{"version":3,"file":"js/chunk-vendors-4fc95042.6936eeb0.js","mappings":"sVAGA,MAAMA,EAAcC,OAAOC,OAAO,MAKlC,MAAMC,EAMFC,YAKAC,EAKAC,EAAOC,GACHC,KAAKH,QAAUA,EACfG,KAAKF,MAAQA,EACbE,KAAKD,OAASA,GAAU,CAAC,IAAIE,EAAeJ,EAAQK,IAAIJ,GAAQD,EAAQM,IAAIL,IAChF,CAIIM,aAAW,OAAOJ,KAAKH,QAAQQ,GAAK,CAIpCC,WAAS,OAAON,KAAKF,MAAMO,GAAK,CAIhCE,WAAS,OAAOP,KAAKQ,MAAMH,GAAK,CAIhCI,SAAO,OAAOT,KAAKU,IAAIL,GAAK,CAI5BG,YACA,OAAOR,KAAKD,OAAO,GAAGS,KAC1B,CAIIE,UACA,OAAOV,KAAKD,OAAO,GAAGW,GAC1B,CAIIC,YACA,IAAIZ,EAASC,KAAKD,OAClB,IAAK,IAAIa,EAAI,EAAGA,EAAIb,EAAOc,OAAQD,IAC/B,GAAIb,EAAOa,GAAGJ,MAAMH,KAAON,EAAOa,GAAGF,IAAIL,IACrC,OAAO,EACf,OAAO,CACX,CAIAS,UACI,OAAOd,KAAKQ,MAAMO,IAAIC,MAAMhB,KAAKO,KAAMP,KAAKS,IAAI,EACpD,CAKAQ,QAAQC,EAAIJ,EAAU,YAIlB,IAAIK,EAAWL,EAAQA,QAAQM,UAAWC,EAAa,KACvD,IAAK,IAAIT,EAAI,EAAGA,EAAIE,EAAQQ,QAASV,IACjCS,EAAaF,EACbA,EAAWA,EAASC,UAExB,IAAIG,EAAUL,EAAGM,MAAMX,OAAQd,EAASC,KAAKD,OAC7C,IAAK,IAAIa,EAAI,EAAGA,EAAIb,EAAOc,OAAQD,IAAK,CACpC,IAAI,MAAEJ,EAAK,IAAEE,GAAQX,EAAOa,GAAIa,EAAUP,EAAGO,QAAQT,MAAMO,GAC3DL,EAAGQ,aAAaD,EAAQE,IAAInB,EAAMH,KAAMoB,EAAQE,IAAIjB,EAAIL,KAAMO,EAAI,WAAcE,GACvE,GAALF,GACAgB,EAAwBV,EAAIK,GAAUJ,EAAWA,EAASU,SAAWR,GAAcA,EAAWS,cAAgB,EAAI,EAC1H,CACJ,CAKAC,YAAYb,EAAIc,GACZ,IAAIT,EAAUL,EAAGM,MAAMX,OAAQd,EAASC,KAAKD,OAC7C,IAAK,IAAIa,EAAI,EAAGA,EAAIb,EAAOc,OAAQD,IAAK,CACpC,IAAI,MAAEJ,EAAK,IAAEE,GAAQX,EAAOa,GAAIa,EAAUP,EAAGO,QAAQT,MAAMO,GACvDhB,EAAOkB,EAAQE,IAAInB,EAAMH,KAAMI,EAAKgB,EAAQE,IAAIjB,EAAIL,KACpDO,EACAM,EAAGe,YAAY1B,EAAME,IAGrBS,EAAGgB,iBAAiB3B,EAAME,EAAIuB,GAC9BJ,EAAwBV,EAAIK,EAASS,EAAKH,UAAY,EAAI,GAElE,CACJ,CAQAM,gBAAgBC,EAAMC,EAAKC,GAAW,GAClC,IAAIC,EAAQH,EAAKI,OAAOC,cAAgB,IAAIC,EAAcN,GACpDO,EAAgBP,EAAKJ,KAAK,GAAII,EAAKI,OAAQJ,EAAK/B,IAAK+B,EAAKQ,QAASP,EAAKC,GAC9E,GAAIC,EACA,OAAOA,EACX,IAAK,IAAIM,EAAQT,EAAKS,MAAQ,EAAGA,GAAS,EAAGA,IAAS,CAClD,IAAIC,EAAQT,EAAM,EACZM,EAAgBP,EAAKJ,KAAK,GAAII,EAAKJ,KAAKa,GAAQT,EAAKW,OAAOF,EAAQ,GAAIT,EAAKQ,MAAMC,GAAQR,EAAKC,GAChGK,EAAgBP,EAAKJ,KAAK,GAAII,EAAKJ,KAAKa,GAAQT,EAAKY,MAAMH,EAAQ,GAAIT,EAAKQ,MAAMC,GAAS,EAAGR,EAAKC,GACzG,GAAIQ,EACA,OAAOA,CACf,CACA,OAAO,IACX,CAMAX,YAAYC,EAAMa,EAAO,GACrB,OAAOjD,KAAKkD,SAASd,EAAMa,IAASjD,KAAKkD,SAASd,GAAOa,IAAS,IAAIE,EAAaf,EAAKJ,KAAK,GACjG,CAOAG,eAAepB,GACX,OAAO4B,EAAgB5B,EAAKA,EAAK,EAAG,EAAG,IAAM,IAAIoC,EAAapC,EAClE,CAKAoB,aAAapB,GACT,OAAO4B,EAAgB5B,EAAKA,EAAKA,EAAID,QAAQsC,KAAMrC,EAAIsC,YAAa,IAAM,IAAIF,EAAapC,EAC/F,CAKAoB,gBAAgBpB,EAAKuC,GACjB,IAAKA,IAASA,EAAKC,KACf,MAAM,IAAIC,WAAW,wCACzB,IAAIC,EAAMjE,EAAY8D,EAAKC,MAC3B,IAAKE,EACD,MAAM,IAAID,WAAW,qBAAqBF,EAAKC,gBACnD,OAAOE,EAAIC,SAAS3C,EAAKuC,EAC7B,CAOAnB,cAAcwB,EAAIC,GACd,GAAID,KAAMnE,EACN,MAAM,IAAIgE,WAAW,sCAAwCG,GAGjE,OAFAnE,EAAYmE,GAAMC,EAClBA,EAAeC,UAAUC,OAASH,EAC3BC,CACX,CAUAG,cACI,OAAOrB,EAAcsB,QAAQhE,KAAKH,QAASG,KAAKF,OAAOiE,aAC3D,EAEJpE,EAAUkE,UAAUI,SAAU,EAI9B,MAAMhE,EAIFL,YAIAY,EAIAE,GACIV,KAAKQ,MAAQA,EACbR,KAAKU,IAAMA,CACf,EAEJ,IAAIwD,GAA2B,EAC/B,SAASC,EAAmB/B,GACnB8B,GAA6B9B,EAAKI,OAAOC,gBAC1CyB,GAA2B,EAC3BE,QAAQ,QAAQ,wEAA0EhC,EAAKI,OAAOe,KAAKc,KAAO,KAE1H,CAOA,MAAM3B,UAAsB/C,EAIxBC,YAAYC,EAASC,EAAQD,GACzBsE,EAAmBtE,GACnBsE,EAAmBrE,GACnBwE,MAAMzE,EAASC,EACnB,CAKIyE,cAAY,OAAOvE,KAAKH,QAAQQ,KAAOL,KAAKF,MAAMO,IAAML,KAAKF,MAAQ,IAAM,CAC/E6B,IAAIZ,EAAKU,GACL,IAAI3B,EAAQiB,EAAIyD,QAAQ/C,EAAQE,IAAI3B,KAAKM,OACzC,IAAKR,EAAM0C,OAAOC,cACd,OAAO9C,EAAU8E,KAAK3E,GAC1B,IAAID,EAAUkB,EAAIyD,QAAQ/C,EAAQE,IAAI3B,KAAKI,SAC3C,OAAO,IAAIsC,EAAc7C,EAAQ2C,OAAOC,cAAgB5C,EAAUC,EAAOA,EAC7E,CACAmB,QAAQC,EAAIJ,EAAU,YAElB,GADAwD,MAAMrD,QAAQC,EAAIJ,GACdA,GAAW,WAAa,CACxB,IAAI4D,EAAQ1E,KAAKQ,MAAMmE,YAAY3E,KAAKU,KACpCgE,GACAxD,EAAG0D,YAAYF,EACvB,CACJ,CACAG,GAAGC,GACC,OAAOA,aAAiBpC,GAAiBoC,EAAM1E,QAAUJ,KAAKI,QAAU0E,EAAMxE,MAAQN,KAAKM,IAC/F,CACAyD,cACI,OAAO,IAAIgB,EAAa/E,KAAKI,OAAQJ,KAAKM,KAC9C,CACA0E,SACI,MAAO,CAAEzB,KAAM,OAAQnD,OAAQJ,KAAKI,OAAQE,KAAMN,KAAKM,KAC3D,CAIA6B,gBAAgBpB,EAAKuC,GACjB,GAA0B,iBAAfA,EAAKlD,QAA0C,iBAAbkD,EAAKhD,KAC9C,MAAM,IAAIkD,WAAW,4CACzB,OAAO,IAAId,EAAc3B,EAAIyD,QAAQlB,EAAKlD,QAASW,EAAIyD,QAAQlB,EAAKhD,MACxE,CAIA6B,cAAcpB,EAAKX,EAAQE,EAAOF,GAC9B,IAAIP,EAAUkB,EAAIyD,QAAQpE,GAC1B,OAAO,IAAIJ,KAAKH,EAASS,GAAQF,EAASP,EAAUkB,EAAIyD,QAAQlE,GACpE,CASA6B,eAAetC,EAASC,EAAOmD,GAC3B,IAAIgC,EAAOpF,EAAQQ,IAAMP,EAAMO,IAG/B,GAFK4C,IAAQgC,IACThC,EAAOgC,GAAQ,EAAI,GAAK,IACvBnF,EAAM0C,OAAOC,cAAe,CAC7B,IAAIK,EAAQnD,EAAUuD,SAASpD,EAAOmD,GAAM,IAAStD,EAAUuD,SAASpD,GAAQmD,GAAM,GACtF,IAAIH,EAGA,OAAOnD,EAAU8E,KAAK3E,EAAOmD,GAF7BnD,EAAQgD,EAAMhD,KAGtB,CAWA,OAVKD,EAAQ2C,OAAOC,gBACJ,GAARwC,EACApF,EAAUC,GAGVD,GAAWF,EAAUuD,SAASrD,GAAUoD,GAAM,IAAStD,EAAUuD,SAASrD,EAASoD,GAAM,IAAOpD,QAC3FA,EAAQQ,IAAMP,EAAMO,KAAS4E,EAAO,IACrCpF,EAAUC,KAGf,IAAI4C,EAAc7C,EAASC,EACtC,EAEJH,EAAUmE,OAAO,OAAQpB,GACzB,MAAMqC,EACFnF,YAAYQ,EAAQE,GAChBN,KAAKI,OAASA,EACdJ,KAAKM,KAAOA,CAChB,CACAqB,IAAIF,GACA,OAAO,IAAIsD,EAAatD,EAAQE,IAAI3B,KAAKI,QAASqB,EAAQE,IAAI3B,KAAKM,MACvE,CACAkE,QAAQzD,GACJ,OAAO2B,EAAcsB,QAAQjD,EAAIyD,QAAQxE,KAAKI,QAASW,EAAIyD,QAAQxE,KAAKM,MAC5E,EASJ,MAAM4E,UAAsBvF,EAKxBC,YAAYwC,GACR,IAAIJ,EAAOI,EAAK+C,UACZC,EAAOhD,EAAKJ,KAAK,GAAGwC,QAAQpC,EAAK/B,IAAM2B,EAAKqD,UAChDf,MAAMlC,EAAMgD,GACZpF,KAAKgC,KAAOA,CAChB,CACAL,IAAIZ,EAAKU,GACL,IAAI,QAAE6D,EAAO,IAAEjF,GAAQoB,EAAQ8D,UAAUvF,KAAKI,QAC1CgC,EAAOrB,EAAIyD,QAAQnE,GACvB,OAAIiF,EACO3F,EAAU8E,KAAKrC,GACnB,IAAI8C,EAAc9C,EAC7B,CACAtB,UACI,OAAO,IAAI,KAAM,UAAcd,KAAKgC,MAAO,EAAG,EAClD,CACA6C,GAAGC,GACC,OAAOA,aAAiBI,GAAiBJ,EAAM1E,QAAUJ,KAAKI,MAClE,CACA4E,SACI,MAAO,CAAEzB,KAAM,OAAQnD,OAAQJ,KAAKI,OACxC,CACA2D,cAAgB,OAAO,IAAIyB,EAAaxF,KAAKI,OAAS,CAItD+B,gBAAgBpB,EAAKuC,GACjB,GAA0B,iBAAfA,EAAKlD,OACZ,MAAM,IAAIoD,WAAW,4CACzB,OAAO,IAAI0B,EAAcnE,EAAIyD,QAAQlB,EAAKlD,QAC9C,CAIA+B,cAAcpB,EAAKR,GACf,OAAO,IAAI2E,EAAcnE,EAAIyD,QAAQjE,GACzC,CAKA4B,oBAAoBH,GAChB,OAAQA,EAAKyD,SAAwC,IAA9BzD,EAAKuB,KAAKmC,KAAKC,UAC1C,EAEJT,EAAcrB,UAAUI,SAAU,EAClCtE,EAAUmE,OAAO,OAAQoB,GACzB,MAAMM,EACF5F,YAAYQ,GACRJ,KAAKI,OAASA,CAClB,CACAuB,IAAIF,GACA,IAAI,QAAE6D,EAAO,IAAEjF,GAAQoB,EAAQ8D,UAAUvF,KAAKI,QAC9C,OAAOkF,EAAU,IAAIP,EAAa1E,EAAKA,GAAO,IAAImF,EAAanF,EACnE,CACAmE,QAAQzD,GACJ,IAAIqB,EAAOrB,EAAIyD,QAAQxE,KAAKI,QAAS4B,EAAOI,EAAK+C,UACjD,OAAInD,GAAQkD,EAAcU,aAAa5D,GAC5B,IAAIkD,EAAc9C,GACtBzC,EAAU8E,KAAKrC,EAC1B,EAQJ,MAAMe,UAAqBxD,EAIvBC,YAAYmB,GACRuD,MAAMvD,EAAIyD,QAAQ,GAAIzD,EAAIyD,QAAQzD,EAAID,QAAQsC,MAClD,CACAnC,QAAQC,EAAIJ,EAAU,YAClB,GAAIA,GAAW,WAAa,CACxBI,EAAG2E,OAAO,EAAG3E,EAAGH,IAAID,QAAQsC,MAC5B,IAAI0C,EAAMnG,EAAUoG,QAAQ7E,EAAGH,KAC1B+E,EAAIjB,GAAG3D,EAAG8E,YACX9E,EAAG+E,aAAaH,EACxB,MAEIxB,MAAMrD,QAAQC,EAAIJ,EAE1B,CACAkE,SAAW,MAAO,CAAEzB,KAAM,MAAS,CAInCpB,gBAAgBpB,GAAO,OAAO,IAAIoC,EAAapC,EAAM,CACrDY,IAAIZ,GAAO,OAAO,IAAIoC,EAAapC,EAAM,CACzC8D,GAAGC,GAAS,OAAOA,aAAiB3B,CAAc,CAClDY,cAAgB,OAAOmC,CAAa,EAExCvG,EAAUmE,OAAO,MAAOX,GACxB,MAAM+C,EAAc,CAChBvE,MAAQ,OAAO3B,IAAM,EACrBwE,QAAQzD,GAAO,OAAO,IAAIoC,EAAapC,EAAM,GAMjD,SAAS4B,EAAgB5B,EAAKiB,EAAM3B,EAAKuC,EAAOP,EAAK8D,GAAO,GACxD,GAAInE,EAAKS,cACL,OAAOC,EAAchD,OAAOqB,EAAKV,GACrC,IAAK,IAAIO,EAAIgC,GAASP,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAIzB,EAAIoB,EAAKqB,WAAazC,GAAK,EAAGA,GAAKyB,EAAK,CACtF,IAAI+D,EAAQpE,EAAKoE,MAAMxF,GACvB,GAAKwF,EAAMC,QAKN,IAAKF,GAAQjB,EAAcU,aAAaQ,GACzC,OAAOlB,EAAcxF,OAAOqB,EAAKV,GAAOgC,EAAM,EAAI+D,EAAMf,SAAW,QANpD,CACf,IAAI9C,EAAQI,EAAgB5B,EAAKqF,EAAO/F,EAAMgC,EAAKA,EAAM,EAAI+D,EAAM/C,WAAa,EAAGhB,EAAK8D,GACxF,GAAI5D,EACA,OAAOA,CACf,CAIAlC,GAAO+F,EAAMf,SAAWhD,CAC5B,CACA,OAAO,IACX,CACA,SAAST,EAAwBV,EAAIoF,EAAUrD,GAC3C,IAAIsD,EAAOrF,EAAGM,MAAMX,OAAS,EAC7B,GAAI0F,EAAOD,EACP,OACJ,IAAIE,EAAOtF,EAAGM,MAAM+E,GACpB,KAAMC,aAAgB,MAAeA,aAAgB,MACjD,OACJ,IAAiCC,EAA7B9E,EAAMT,EAAGO,QAAQiF,KAAKH,GAC1B5E,EAAIgF,SAAQ,CAACC,EAAOC,EAAKC,EAAUC,KAAuB,MAAPN,IAC/CA,EAAMM,EAAK,IACf7F,EAAG+E,aAAatG,EAAU8E,KAAKvD,EAAGH,IAAIyD,QAAQiC,GAAMxD,GACxD,CAEA,MAAM+D,EAAc,EAAGC,EAAgB,EAAGC,EAAiB,EAoB3D,MAAMC,UAAoB,KAItBvH,YAAYwH,GACR9C,MAAM8C,EAAMrG,KAEZf,KAAKqH,gBAAkB,EAGvBrH,KAAKsH,QAAU,EAEftH,KAAKuH,KAAO9H,OAAOC,OAAO,MAC1BM,KAAKwH,KAAOC,KAAKC,MACjB1H,KAAK2H,aAAeP,EAAMpB,UAC1BhG,KAAK4H,YAAcR,EAAMQ,WAC7B,CAOI5B,gBAKA,OAJIhG,KAAKqH,gBAAkBrH,KAAKwB,MAAMX,SAClCb,KAAK2H,aAAe3H,KAAK2H,aAAahG,IAAI3B,KAAKe,IAAKf,KAAKyB,QAAQT,MAAMhB,KAAKqH,kBAC5ErH,KAAKqH,gBAAkBrH,KAAKwB,MAAMX,QAE/Bb,KAAK2H,YAChB,CAKA1B,aAAaD,GACT,GAAIA,EAAUxF,MAAMO,KAAOf,KAAKe,IAC5B,MAAM,IAAIyC,WAAW,uEAKzB,OAJAxD,KAAK2H,aAAe3B,EACpBhG,KAAKqH,gBAAkBrH,KAAKwB,MAAMX,OAClCb,KAAKsH,SAAWtH,KAAKsH,QAAUN,IAAgBC,EAC/CjH,KAAK4H,YAAc,KACZ5H,IACX,CAII6H,mBACA,OAAQ7H,KAAKsH,QAAUN,GAAe,CAC1C,CAIAc,eAAepD,GAGX,OAFA1E,KAAK4H,YAAclD,EACnB1E,KAAKsH,SAAWL,EACTjH,IACX,CAMA4E,YAAYF,GAGR,OAFK,aAAa1E,KAAK4H,aAAe5H,KAAKgG,UAAUxF,MAAMkE,QAASA,IAChE1E,KAAK8H,eAAepD,GACjB1E,IACX,CAIA+H,cAAcC,GACV,OAAOhI,KAAK4E,YAAYoD,EAAKC,SAASjI,KAAK4H,aAAe5H,KAAKgG,UAAUlG,MAAM4E,SACnF,CAIAwD,iBAAiBF,GACb,OAAOhI,KAAK4E,YAAYoD,EAAKG,cAAcnI,KAAK4H,aAAe5H,KAAKgG,UAAUlG,MAAM4E,SACxF,CAII0D,qBACA,OAAQpI,KAAKsH,QAAUL,GAAiB,CAC5C,CAIAoB,QAAQ7B,EAAMzF,GACVuD,MAAM+D,QAAQ7B,EAAMzF,GACpBf,KAAKsH,QAAUtH,KAAKsH,SAAWL,EAC/BjH,KAAK4H,YAAc,IACvB,CAIAU,QAAQd,GAEJ,OADAxH,KAAKwH,KAAOA,EACLxH,IACX,CAIAuI,iBAAiBvH,GAEb,OADAhB,KAAKgG,UAAU/E,QAAQjB,KAAMgB,GACtBhB,IACX,CAMAwI,qBAAqBxG,EAAMyG,GAAe,GACtC,IAAIzC,EAAYhG,KAAKgG,UAIrB,OAHIyC,IACAzG,EAAOA,EAAKgG,KAAKhI,KAAK4H,cAAgB5B,EAAUrF,MAAQqF,EAAUxF,MAAMkE,QAAWsB,EAAUxF,MAAMmE,YAAYqB,EAAUtF,MAAQ,aACrIsF,EAAUjE,YAAY/B,KAAMgC,GACrBhC,IACX,CAIA0I,kBAEI,OADA1I,KAAKgG,UAAU/E,QAAQjB,MAChBA,IACX,CAKA2I,WAAWxC,EAAM5F,EAAME,GACnB,IAAImI,EAAS5I,KAAKe,IAAIwC,KAAKqF,OAC3B,GAAY,MAARrI,EACA,OAAK4F,EAEEnG,KAAKwI,qBAAqBI,EAAOzC,KAAKA,IAAO,GADzCnG,KAAK0I,kBAGf,CAID,GAHU,MAANjI,IACAA,EAAKF,GACTE,EAAW,MAANA,EAAaF,EAAOE,GACpB0F,EACD,OAAOnG,KAAKiC,YAAY1B,EAAME,GAClC,IAAIiE,EAAQ1E,KAAK4H,YACjB,IAAKlD,EAAO,CACR,IAAIlE,EAAQR,KAAKe,IAAIyD,QAAQjE,GAC7BmE,EAAQjE,GAAMF,EAAOC,EAAMkE,QAAUlE,EAAMmE,YAAY3E,KAAKe,IAAIyD,QAAQ/D,GAC5E,CAIA,OAHAT,KAAKkC,iBAAiB3B,EAAME,EAAImI,EAAOzC,KAAKA,EAAMzB,IAC7C1E,KAAKgG,UAAUrF,OAChBX,KAAKiG,aAAatG,EAAU8E,KAAKzE,KAAKgG,UAAUtF,MAC7CV,IACX,CACJ,CAKA6I,QAAQC,EAAKC,GAET,OADA/I,KAAKuH,KAAmB,iBAAPuB,EAAkBA,EAAMA,EAAIA,KAAOC,EAC7C/I,IACX,CAIAgJ,QAAQF,GACJ,OAAO9I,KAAKuH,KAAmB,iBAAPuB,EAAkBA,EAAMA,EAAIA,IACxD,CAKIG,gBACA,IAAK,IAAIC,KAAKlJ,KAAKuH,KACf,OAAO,EACX,OAAO,CACX,CAKA4B,iBAEI,OADAnJ,KAAKsH,SAAWJ,EACTlH,IACX,CAIIoJ,uBACA,OAAQpJ,KAAKsH,QAAUJ,GAAkB,CAC7C,EAGJ,SAASmC,EAAKC,EAAGC,GACb,OAAQA,GAASD,EAAQA,EAAED,KAAKE,GAAXD,CACzB,CACA,MAAME,EACF5J,YAAYyE,EAAMoF,EAAMF,GACpBvJ,KAAKqE,KAAOA,EACZrE,KAAK0J,KAAOL,EAAKI,EAAKC,KAAMH,GAC5BvJ,KAAK2J,MAAQN,EAAKI,EAAKE,MAAOJ,EAClC,EAEJ,MAAMK,EAAa,CACf,IAAIJ,EAAU,MAAO,CACjBE,KAAKG,GAAU,OAAOA,EAAO9I,KAAO8I,EAAOjB,OAAOkB,YAAYC,eAAiB,EAC/EJ,MAAMzI,GAAM,OAAOA,EAAGH,GAAK,IAE/B,IAAIyI,EAAU,YAAa,CACvBE,KAAKG,EAAQG,GAAY,OAAOH,EAAO7D,WAAarG,EAAUoG,QAAQiE,EAASjJ,IAAM,EACrF4I,MAAMzI,GAAM,OAAOA,EAAG8E,SAAW,IAErC,IAAIwD,EAAU,cAAe,CACzBE,KAAKG,GAAU,OAAOA,EAAOjC,aAAe,IAAM,EAClD+B,MAAMzI,EAAI+I,EAAQC,EAAM9C,GAAS,OAAOA,EAAMpB,UAAUzB,QAAUrD,EAAG0G,YAAc,IAAM,IAE7F,IAAI4B,EAAU,oBAAqB,CAC/BE,OAAS,OAAO,CAAG,EACnBC,MAAMzI,EAAIiJ,GAAQ,OAAOjJ,EAAGkI,iBAAmBe,EAAO,EAAIA,CAAM,KAKxE,MAAMC,EACFxK,YAAYgJ,EAAQyB,GAChBrK,KAAK4I,OAASA,EACd5I,KAAKqK,QAAU,GACfrK,KAAKsK,aAAe7K,OAAOC,OAAO,MAClCM,KAAKuK,OAASX,EAAW5I,QACrBqJ,GACAA,EAAQ1D,SAAQ6D,IACZ,GAAIxK,KAAKsK,aAAaE,EAAO1B,KACzB,MAAM,IAAItF,WAAW,iDAAmDgH,EAAO1B,IAAM,KACzF9I,KAAKqK,QAAQI,KAAKD,GAClBxK,KAAKsK,aAAaE,EAAO1B,KAAO0B,EAC5BA,EAAO9E,KAAK0B,OACZpH,KAAKuK,OAAOE,KAAK,IAAIjB,EAAUgB,EAAO1B,IAAK0B,EAAO9E,KAAK0B,MAAOoD,GAAQ,GAEtF,EAWJ,MAAME,EAIF9K,YAIAiK,GACI7J,KAAK6J,OAASA,CAClB,CAIIjB,aACA,OAAO5I,KAAK6J,OAAOjB,MACvB,CAIIyB,cACA,OAAOrK,KAAK6J,OAAOQ,OACvB,CAIAV,MAAMzI,GACF,OAAOlB,KAAK2K,iBAAiBzJ,GAAIkG,KACrC,CAIAwD,kBAAkB1J,EAAI2J,GAAS,GAC3B,IAAK,IAAIjK,EAAI,EAAGA,EAAIZ,KAAK6J,OAAOQ,QAAQxJ,OAAQD,IAC5C,GAAIA,GAAKiK,EAAQ,CACb,IAAIL,EAASxK,KAAK6J,OAAOQ,QAAQzJ,GACjC,GAAI4J,EAAO9E,KAAKkF,oBAAsBJ,EAAO9E,KAAKkF,kBAAkBE,KAAKN,EAAQtJ,EAAIlB,MACjF,OAAO,CACf,CACJ,OAAO,CACX,CAQA2K,iBAAiBI,GACb,IAAK/K,KAAK4K,kBAAkBG,GACxB,MAAO,CAAE3D,MAAOpH,KAAMgL,aAAc,IACxC,IAAIC,EAAM,CAACF,GAASG,EAAWlL,KAAKmL,WAAWJ,GAASK,EAAO,KAI/D,OAAS,CACL,IAAIC,GAAU,EACd,IAAK,IAAIzK,EAAI,EAAGA,EAAIZ,KAAK6J,OAAOQ,QAAQxJ,OAAQD,IAAK,CACjD,IAAI4J,EAASxK,KAAK6J,OAAOQ,QAAQzJ,GACjC,GAAI4J,EAAO9E,KAAK4F,kBAAmB,CAC/B,IAAIC,EAAIH,EAAOA,EAAKxK,GAAG2K,EAAI,EAAGC,EAAWJ,EAAOA,EAAKxK,GAAGwG,MAAQpH,KAC5DkB,EAAKqK,EAAIN,EAAIpK,QACb2J,EAAO9E,KAAK4F,kBAAkBR,KAAKN,EAAQe,EAAIN,EAAIjK,MAAMuK,GAAKN,EAAKO,EAAUN,GACjF,GAAIhK,GAAMgK,EAASN,kBAAkB1J,EAAIN,GAAI,CAEzC,GADAM,EAAG2H,QAAQ,sBAAuBkC,IAC7BK,EAAM,CACPA,EAAO,GACP,IAAK,IAAIK,EAAI,EAAGA,EAAIzL,KAAK6J,OAAOQ,QAAQxJ,OAAQ4K,IAC5CL,EAAKX,KAAKgB,EAAI7K,EAAI,CAAEwG,MAAO8D,EAAUK,EAAGN,EAAIpK,QAAW,CAAEuG,MAAOpH,KAAMuL,EAAG,GACjF,CACAN,EAAIR,KAAKvJ,GACTgK,EAAWA,EAASC,WAAWjK,GAC/BmK,GAAU,CACd,CACID,IACAA,EAAKxK,GAAK,CAAEwG,MAAO8D,EAAUK,EAAGN,EAAIpK,QAC5C,CACJ,CACA,IAAKwK,EACD,MAAO,CAAEjE,MAAO8D,EAAUF,aAAcC,EAChD,CACJ,CAIAE,WAAWjK,GACP,IAAKA,EAAG6B,OAAO8B,GAAG7E,KAAKe,KACnB,MAAM,IAAIyC,WAAW,qCACzB,IAAIkI,EAAc,IAAIhB,EAAY1K,KAAK6J,QAASU,EAASvK,KAAK6J,OAAOU,OACrE,IAAK,IAAI3J,EAAI,EAAGA,EAAI2J,EAAO1J,OAAQD,IAAK,CACpC,IAAI+K,EAAQpB,EAAO3J,GACnB8K,EAAYC,EAAMtH,MAAQsH,EAAMhC,MAAMzI,EAAIlB,KAAK2L,EAAMtH,MAAOrE,KAAM0L,EACtE,CACA,OAAOA,CACX,CAIIxK,SAAO,OAAO,IAAIiG,EAAYnH,KAAO,CAIzCmC,cAAc0H,GACV,IAAI+B,EAAU,IAAIxB,EAAcP,EAAO9I,IAAM8I,EAAO9I,IAAIwC,KAAKqF,OAASiB,EAAOjB,OAAQiB,EAAOQ,SACxFL,EAAW,IAAIU,EAAYkB,GAC/B,IAAK,IAAIhL,EAAI,EAAGA,EAAIgL,EAAQrB,OAAO1J,OAAQD,IACvCoJ,EAAS4B,EAAQrB,OAAO3J,GAAGyD,MAAQuH,EAAQrB,OAAO3J,GAAG8I,KAAKG,EAAQG,GACtE,OAAOA,CACX,CASA6B,YAAYhC,GACR,IAAI+B,EAAU,IAAIxB,EAAcpK,KAAK4I,OAAQiB,EAAOQ,SAChDE,EAASqB,EAAQrB,OAAQP,EAAW,IAAIU,EAAYkB,GACxD,IAAK,IAAIhL,EAAI,EAAGA,EAAI2J,EAAO1J,OAAQD,IAAK,CACpC,IAAIyD,EAAOkG,EAAO3J,GAAGyD,KACrB2F,EAAS3F,GAAQrE,KAAK8L,eAAezH,GAAQrE,KAAKqE,GAAQkG,EAAO3J,GAAG8I,KAAKG,EAAQG,EACrF,CACA,OAAOA,CACX,CAQAhF,OAAO+G,GACH,IAAIC,EAAS,CAAEjL,IAAKf,KAAKe,IAAIiE,SAAUgB,UAAWhG,KAAKgG,UAAUhB,UAGjE,GAFIhF,KAAK4H,cACLoE,EAAOpE,YAAc5H,KAAK4H,YAAYjG,KAAIsK,GAAKA,EAAEjH,YACjD+G,GAAuC,iBAAhBA,EACvB,IAAK,IAAIG,KAAQH,EAAc,CAC3B,GAAY,OAARG,GAAyB,aAARA,EACjB,MAAM,IAAI1I,WAAW,sDACzB,IAAIgH,EAASuB,EAAaG,GAAO9E,EAAQoD,EAAO9E,KAAK0B,MACjDA,GAASA,EAAMpC,SACfgH,EAAOE,GAAQ9E,EAAMpC,OAAO8F,KAAKN,EAAQxK,KAAKwK,EAAO1B,MAC7D,CACJ,OAAOkD,CACX,CAQA7J,gBAAgB0H,EAAQvG,EAAMyI,GAC1B,IAAKzI,EACD,MAAM,IAAIE,WAAW,0CACzB,IAAKqG,EAAOjB,OACR,MAAM,IAAIpF,WAAW,0CACzB,IAAIoI,EAAU,IAAIxB,EAAcP,EAAOjB,OAAQiB,EAAOQ,SAClDL,EAAW,IAAIU,EAAYkB,GAyB/B,OAxBAA,EAAQrB,OAAO5D,SAAQgF,IACnB,GAAkB,OAAdA,EAAMtH,KACN2F,EAASjJ,IAAM,cAAc8I,EAAOjB,OAAQtF,EAAKvC,UAEhD,GAAkB,aAAd4K,EAAMtH,KACX2F,EAAShE,UAAYrG,EAAU+D,SAASsG,EAASjJ,IAAKuC,EAAK0C,gBAE1D,GAAkB,eAAd2F,EAAMtH,KACPf,EAAKsE,cACLoC,EAASpC,YAActE,EAAKsE,YAAYjG,IAAIkI,EAAOjB,OAAOuD,mBAE7D,CACD,GAAIJ,EACA,IAAK,IAAIG,KAAQH,EAAc,CAC3B,IAAIvB,EAASuB,EAAaG,GAAO9E,EAAQoD,EAAO9E,KAAK0B,MACrD,GAAIoD,EAAO1B,KAAO6C,EAAMtH,MAAQ+C,GAASA,EAAM1D,UAC3CjE,OAAOoE,UAAUiI,eAAehB,KAAKxH,EAAM4I,GAE3C,YADAlC,EAAS2B,EAAMtH,MAAQ+C,EAAM1D,SAASoH,KAAKN,EAAQX,EAAQvG,EAAK4I,GAAOlC,GAG/E,CACJA,EAAS2B,EAAMtH,MAAQsH,EAAMjC,KAAKG,EAAQG,EAC9C,KAEGA,CACX,EAGJ,SAASoC,EAAUC,EAAK9C,EAAM+C,GAC1B,IAAK,IAAIJ,KAAQG,EAAK,CAClB,IAAIE,EAAMF,EAAIH,GACVK,aAAeC,SACfD,EAAMA,EAAIlD,KAAKE,GACF,mBAAR2C,IACLK,EAAMH,EAAUG,EAAKhD,EAAM,CAAC,IAChC+C,EAAOJ,GAAQK,CACnB,CACA,OAAOD,CACX,CAMA,MAAMG,EAIF7M,YAIA8F,GACI1F,KAAK0F,KAAOA,EAIZ1F,KAAK0M,MAAQ,CAAC,EACVhH,EAAKgH,OACLN,EAAU1G,EAAKgH,MAAO1M,KAAMA,KAAK0M,OACrC1M,KAAK8I,IAAMpD,EAAKoD,IAAMpD,EAAKoD,IAAIA,IAAM6D,EAAU,SACnD,CAIAC,SAASxF,GAAS,OAAOA,EAAMpH,KAAK8I,IAAM,EAE9C,MAAM+D,EAAOpN,OAAOC,OAAO,MAC3B,SAASiN,EAAUtI,GACf,OAAIA,KAAQwI,EACDxI,EAAO,OAAQwI,EAAKxI,IAC/BwI,EAAKxI,GAAQ,EACNA,EAAO,IAClB,CAOA,MAAMyI,EAIFlN,YAAYyE,EAAO,OAASrE,KAAK8I,IAAM6D,EAAUtI,EAAO,CAKxD0I,IAAI3F,GAAS,OAAOA,EAAMyC,OAAOS,aAAatK,KAAK8I,IAAM,CAIzD8D,SAASxF,GAAS,OAAOA,EAAMpH,KAAK8I,IAAM,E,oeCt9B1CkE,EACAC,E,iDACJ,GAAsB,oBAAXC,QAAwB,CACjC,IAAIC,EAAwB,IAAID,QAChCF,EAAiBlE,GAAQqE,EAAMJ,IAAIjE,GACnCmE,EAAa,CAACnE,EAAKC,KACjBoE,EAAMC,IAAItE,EAAKC,GACRA,EAEX,KAAO,CACL,MAAMoE,EAAQ,GACRE,EAAY,GAClB,IAAIC,EAAW,EACfN,EAAiBlE,IACf,IAAK,IAAIlI,EAAI,EAAGA,EAAIuM,EAAMtM,OAAQD,GAAK,EACrC,GAAIuM,EAAMvM,IAAMkI,EACd,OAAOqE,EAAMvM,EAAI,EAAE,EAEzBqM,EAAa,CAACnE,EAAKC,KACbuE,GAAYD,IACdC,EAAW,GACbH,EAAMG,KAAcxE,EACbqE,EAAMG,KAAcvE,EAE/B,CACA,IAAIwE,EAAW,MACb3N,YAAY4N,EAAOC,EAAQ9L,EAAK+L,GAC9B1N,KAAKwN,MAAQA,EACbxN,KAAKyN,OAASA,EACdzN,KAAK2B,IAAMA,EACX3B,KAAK0N,SAAWA,CAClB,CACAC,SAAStN,GACP,IAAK,IAAIO,EAAI,EAAGA,EAAIZ,KAAK2B,IAAId,OAAQD,IAAK,CACxC,MAAMgN,EAAS5N,KAAK2B,IAAIf,GACxB,GAAIgN,GAAUvN,EACZ,SACF,MAAMwN,EAAOjN,EAAIZ,KAAKwN,MAChBM,EAAMlN,EAAIZ,KAAKwN,MAAQ,EAC7B,IAAIO,EAAQF,EAAO,EACfG,EAASF,EAAM,EACnB,IAAK,IAAIrC,EAAI,EAAGsC,EAAQ/N,KAAKwN,OAASxN,KAAK2B,IAAIf,EAAI6K,IAAMmC,EAAQnC,IAC/DsC,IAEF,IAAK,IAAItC,EAAI,EAAGuC,EAAShO,KAAKyN,QAAUzN,KAAK2B,IAAIf,EAAIZ,KAAKwN,MAAQ/B,IAAMmC,EAAQnC,IAC9EuC,IAEF,MAAO,CAAEH,OAAMC,MAAKC,QAAOC,SAC7B,CACA,MAAM,IAAIxK,WAAW,uBAAuBnD,UAC9C,CACA4N,SAAS5N,GACP,IAAK,IAAIO,EAAI,EAAGA,EAAIZ,KAAK2B,IAAId,OAAQD,IACnC,GAAIZ,KAAK2B,IAAIf,IAAMP,EACjB,OAAOO,EAAIZ,KAAKwN,MAGpB,MAAM,IAAIhK,WAAW,uBAAuBnD,UAC9C,CACA6N,SAAS7N,EAAK8N,EAAM9L,GAClB,MAAM,KAAEwL,EAAI,MAAEE,EAAK,IAAED,EAAG,OAAEE,GAAWhO,KAAK2N,SAAStN,GACnD,MAAY,SAAR8N,GACE9L,EAAM,EAAY,GAARwL,EAAYE,GAAS/N,KAAKwN,OAC/B,KACFxN,KAAK2B,IAAImM,EAAM9N,KAAKwN,OAASnL,EAAM,EAAIwL,EAAO,EAAIE,KAErD1L,EAAM,EAAW,GAAPyL,EAAWE,GAAUhO,KAAKyN,QAC/B,KACFzN,KAAK2B,IAAIkM,EAAO7N,KAAKwN,OAASnL,EAAM,EAAIyL,EAAM,EAAIE,GAE7D,CACAI,YAAYC,EAAGC,GACb,MACET,KAAMU,EACNR,MAAOS,EACPV,IAAKW,EACLT,OAAQU,GACN1O,KAAK2N,SAASU,IAEhBR,KAAMc,EACNZ,MAAOa,EACPd,IAAKe,EACLb,OAAQc,GACN9O,KAAK2N,SAASW,GAClB,MAAO,CACLT,KAAMkB,KAAK7O,IAAIqO,EAAOI,GACtBb,IAAKiB,KAAK7O,IAAIuO,EAAMI,GACpBd,MAAOgB,KAAK5O,IAAIqO,EAAQI,GACxBZ,OAAQe,KAAK5O,IAAIuO,EAASI,GAE9B,CACAE,YAAYC,GACV,MAAMjD,EAAS,GACTZ,EAAO,CAAC,EACd,IAAK,IAAI8D,EAAMD,EAAKnB,IAAKoB,EAAMD,EAAKjB,OAAQkB,IAC1C,IAAK,IAAIC,EAAMF,EAAKpB,KAAMsB,EAAMF,EAAKlB,MAAOoB,IAAO,CACjD,MAAMvM,EAAQsM,EAAMlP,KAAKwN,MAAQ2B,EAC3B9O,EAAML,KAAK2B,IAAIiB,GACjBwI,EAAK/K,KAET+K,EAAK/K,IAAO,EACR8O,GAAOF,EAAKpB,MAAQsB,GAAOnP,KAAK2B,IAAIiB,EAAQ,IAAMvC,GAAO6O,GAAOD,EAAKnB,KAAOoB,GAAOlP,KAAK2B,IAAIiB,EAAQ5C,KAAKwN,QAAUnN,GAGvH2L,EAAOvB,KAAKpK,GACd,CAEF,OAAO2L,CACT,CACAoD,WAAWF,EAAKC,EAAKE,GACnB,IAAK,IAAIzO,EAAI,EAAG0O,EAAW,GAAK1O,IAAK,CACnC,MAAM2O,EAASD,EAAWD,EAAMjJ,MAAMxF,GAAGyE,SACzC,GAAIzE,GAAKsO,EAAK,CACZ,IAAItM,EAAQuM,EAAMD,EAAMlP,KAAKwN,MAC7B,MAAMgC,GAAeN,EAAM,GAAKlP,KAAKwN,MACrC,MAAO5K,EAAQ4M,GAAexP,KAAK2B,IAAIiB,GAAS0M,EAC9C1M,IACF,OAAOA,GAAS4M,EAAcD,EAAS,EAAIvP,KAAK2B,IAAIiB,EACtD,CACA0M,EAAWC,CACb,CACF,CACApN,WAAWkN,GACT,OAAOrC,EAAcqC,IAAUpC,EAAWoC,EAAOI,EAAWJ,GAC9D,GAEF,SAASI,EAAWJ,GAClB,GAAiC,SAA7BA,EAAM9L,KAAKmC,KAAKgK,UAClB,MAAM,IAAIlM,WAAW,qBAAuB6L,EAAM9L,KAAKc,MACzD,MAAMmJ,EAAQmC,EAAUN,GAAQ5B,EAAS4B,EAAMhM,WACzC1B,EAAM,GACZ,IAAIiO,EAAS,EACTlC,EAAW,KACf,MAAMmC,EAAY,GAClB,IAAK,IAAIjP,EAAI,EAAGkP,EAAItC,EAAQC,EAAQ7M,EAAIkP,EAAGlP,IACzCe,EAAIf,GAAK,EACX,IAAK,IAAIsO,EAAM,EAAG7O,EAAM,EAAG6O,EAAMzB,EAAQyB,IAAO,CAC9C,MAAMa,EAAUV,EAAMjJ,MAAM8I,GAC5B7O,IACA,IAAK,IAAIO,EAAI,GAAKA,IAAK,CACrB,MAAOgP,EAASjO,EAAId,QAAyB,GAAfc,EAAIiO,GAChCA,IACF,GAAIhP,GAAKmP,EAAQ1M,WACf,MACF,MAAM2M,EAAWD,EAAQ3J,MAAMxF,IACzB,QAAEqP,EAAO,QAAEC,EAAO,SAAEC,GAAaH,EAASI,MAChD,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAASG,IAAK,CAChC,GAAIA,EAAInB,GAAOzB,EAAQ,EACpBC,IAAaA,EAAW,KAAKjD,KAAK,CACjClH,KAAM,mBACNlD,MACAkL,EAAG2E,EAAUG,IAEf,KACF,CACA,MAAMC,EAAQV,EAASS,EAAI7C,EAC3B,IAAK,IAAI+C,EAAI,EAAGA,EAAIN,EAASM,IAAK,CACV,GAAlB5O,EAAI2O,EAAQC,GACd5O,EAAI2O,EAAQC,GAAKlQ,GAEhBqN,IAAaA,EAAW,KAAKjD,KAAK,CACjClH,KAAM,YACN2L,MACA7O,MACAkL,EAAG0E,EAAUM,IAEjB,MAAMC,EAAOL,GAAYA,EAASI,GAClC,GAAIC,EAAM,CACR,MAAMC,GAAcH,EAAQC,GAAK/C,EAAQ,EAAGrD,EAAO0F,EAAUY,GACjD,MAARtG,GAAgBA,GAAQqG,GAAqC,GAA7BX,EAAUY,EAAa,IACzDZ,EAAUY,GAAcD,EACxBX,EAAUY,EAAa,GAAK,GACnBtG,GAAQqG,GACjBX,EAAUY,EAAa,IAE3B,CACF,CACF,CACAb,GAAUK,EACV5P,GAAO2P,EAAS3K,QAClB,CACA,MAAMqL,GAAexB,EAAM,GAAK1B,EAChC,IAAImD,EAAU,EACd,MAAOf,EAASc,EACO,GAAjB/O,EAAIiO,MACNe,IACAA,IACDjD,IAAaA,EAAW,KAAKjD,KAAK,CAAElH,KAAM,UAAW2L,MAAK3D,EAAGoF,IAChEtQ,GACF,CACA,MAAMuQ,EAAW,IAAIrD,EAASC,EAAOC,EAAQ9L,EAAK+L,GAClD,IAAImD,GAAY,EAChB,IAAK,IAAIjQ,EAAI,GAAIiQ,GAAajQ,EAAIiP,EAAUhP,OAAQD,GAAK,EACnC,MAAhBiP,EAAUjP,IAAciP,EAAUjP,EAAI,GAAK6M,IAC7CoD,GAAY,GAGhB,OAFIA,GACFC,EAAiBF,EAAUf,EAAWR,GACjCuB,CACT,CACA,SAASjB,EAAUN,GACjB,IAAI7B,GAAS,EACTuD,GAAa,EACjB,IAAK,IAAI7B,EAAM,EAAGA,EAAMG,EAAMhM,WAAY6L,IAAO,CAC/C,MAAMa,EAAUV,EAAMjJ,MAAM8I,GAC5B,IAAI8B,EAAW,EACf,GAAID,EACF,IAAK,IAAItF,EAAI,EAAGA,EAAIyD,EAAKzD,IAAK,CAC5B,MAAMwF,EAAU5B,EAAMjJ,MAAMqF,GAC5B,IAAK,IAAI7K,EAAI,EAAGA,EAAIqQ,EAAQ5N,WAAYzC,IAAK,CAC3C,MAAMsQ,EAAOD,EAAQ7K,MAAMxF,GACvB6K,EAAIyF,EAAKd,MAAMF,QAAUhB,IAC3B8B,GAAYE,EAAKd,MAAMH,QAC3B,CACF,CACF,IAAK,IAAIrP,EAAI,EAAGA,EAAImP,EAAQ1M,WAAYzC,IAAK,CAC3C,MAAMsQ,EAAOnB,EAAQ3J,MAAMxF,GAC3BoQ,GAAYE,EAAKd,MAAMH,QACnBiB,EAAKd,MAAMF,QAAU,IACvBa,GAAa,EACjB,EACc,GAAVvD,EACFA,EAAQwD,EACDxD,GAASwD,IAChBxD,EAAQuB,KAAK5O,IAAIqN,EAAOwD,GAC5B,CACA,OAAOxD,CACT,CACA,SAASsD,EAAiBnP,EAAKkO,EAAWR,GACnC1N,EAAI+L,WACP/L,EAAI+L,SAAW,IACjB,MAAMtC,EAAO,CAAC,EACd,IAAK,IAAIxK,EAAI,EAAGA,EAAIe,EAAIA,IAAId,OAAQD,IAAK,CACvC,MAAMP,EAAMsB,EAAIA,IAAIf,GACpB,GAAIwK,EAAK/K,GACP,SACF+K,EAAK/K,IAAO,EACZ,MAAM2B,EAAOqN,EAAM8B,OAAO9Q,GAC1B,IAAK2B,EACH,MAAM,IAAIwB,WAAW,uBAAuBnD,WAE9C,IAAIiH,EAAU,KACd,MAAM8I,EAAQpO,EAAKoO,MACnB,IAAK,IAAI3E,EAAI,EAAGA,EAAI2E,EAAMH,QAASxE,IAAK,CACtC,MAAM0D,GAAOvO,EAAI6K,GAAK9J,EAAI6L,MACpB4D,EAAWvB,EAAgB,EAANV,GACX,MAAZiC,GAAsBhB,EAAMD,UAAYC,EAAMD,SAAS1E,IAAM2F,KAC9D9J,IAAYA,EAAU+J,EAAcjB,KAAS3E,GAAK2F,EACvD,CACI9J,GACF3F,EAAI+L,SAAS4D,QAAQ,CACnB/N,KAAM,oBACNlD,MACA8P,SAAU7I,GAEhB,CACF,CACA,SAAS+J,EAAcjB,GACrB,GAAIA,EAAMD,SACR,OAAOC,EAAMD,SAASnP,QACxB,MAAMgL,EAAS,GACf,IAAK,IAAIpL,EAAI,EAAGA,EAAIwP,EAAMH,QAASrP,IACjCoL,EAAOvB,KAAK,GACd,OAAOuB,CACT,CAMA,SAASuF,EAAaC,EAAKC,GACzB,GAAmB,kBAARD,EACT,MAAO,CAAC,EAEV,MAAME,EAAYF,EAAIG,aAAa,iBAC7BC,EAASF,GAAa,eAAeG,KAAKH,GAAaA,EAAUI,MAAM,KAAKnQ,KAAKoQ,GAAMC,OAAOD,KAAM,KACpG9B,EAAU+B,OAAOR,EAAIG,aAAa,YAAc,GAChD3F,EAAS,CACbiE,UACAC,QAAS8B,OAAOR,EAAIG,aAAa,YAAc,GAC/CxB,SAAUyB,GAAUA,EAAO/Q,QAAUoP,EAAU2B,EAAS,MAE1D,IAAK,MAAM1F,KAAQuF,EAAY,CAC7B,MAAMQ,EAASR,EAAWvF,GAAMgG,WAC1BnJ,EAAQkJ,GAAUA,EAAOT,GAClB,MAATzI,IACFiD,EAAOE,GAAQnD,EAEnB,CACA,OAAOiD,CACT,CACA,SAASmG,EAAanQ,EAAMyP,GAC1B,MAAMrB,EAAQ,CAAC,EACW,GAAtBpO,EAAKoO,MAAMH,UACbG,EAAMH,QAAUjO,EAAKoO,MAAMH,SACH,GAAtBjO,EAAKoO,MAAMF,UACbE,EAAMF,QAAUlO,EAAKoO,MAAMF,SACzBlO,EAAKoO,MAAMD,WACbC,EAAM,iBAAmBpO,EAAKoO,MAAMD,SAASiC,KAAK,MACpD,IAAK,MAAMlG,KAAQuF,EAAY,CAC7B,MAAMY,EAASZ,EAAWvF,GAAMoG,WAC5BD,GACFA,EAAOrQ,EAAKoO,MAAMlE,GAAOkE,EAC7B,CACA,OAAOA,CACT,CACA,SAASmC,EAAWC,GAClB,MAAMf,EAAae,EAAQC,gBAAkB,CAAC,EACxCC,EAAY,CAChBzC,QAAS,CAAE0C,QAAS,GACpBzC,QAAS,CAAEyC,QAAS,GACpBxC,SAAU,CAAEwC,QAAS,OAEvB,IAAK,MAAMzG,KAAQuF,EACjBiB,EAAUxG,GAAQ,CAAEyG,QAASlB,EAAWvF,GAAMyG,SAChD,MAAO,CACLtD,MAAO,CACLvO,QAAS,aACT4O,UAAW,QACXkD,WAAW,EACXC,MAAOL,EAAQM,WACfC,SAAU,CAAC,CAAEC,IAAK,UAClBC,QACE,MAAO,CAAC,QAAS,CAAC,QAAS,GAC7B,GAEFC,UAAW,CACTpS,QAAS,+BACT4O,UAAW,MACXqD,SAAU,CAAC,CAAEC,IAAK,OAClBC,QACE,MAAO,CAAC,KAAM,EAChB,GAEFE,WAAY,CACVrS,QAAS0R,EAAQY,YACjBhD,MAAOsC,EACPhD,UAAW,OACXkD,WAAW,EACXG,SAAU,CACR,CAAEC,IAAK,KAAMK,SAAW7B,GAAQD,EAAaC,EAAKC,KAEpDwB,MAAMjR,GACJ,MAAO,CAAC,KAAMmQ,EAAanQ,EAAMyP,GAAa,EAChD,GAEF6B,aAAc,CACZxS,QAAS0R,EAAQY,YACjBhD,MAAOsC,EACPhD,UAAW,cACXkD,WAAW,EACXG,SAAU,CACR,CAAEC,IAAK,KAAMK,SAAW7B,GAAQD,EAAaC,EAAKC,KAEpDwB,MAAMjR,GACJ,MAAO,CAAC,KAAMmQ,EAAanQ,EAAMyP,GAAa,EAChD,GAGN,CACA,SAAS8B,EAAe3K,GACtB,IAAIoD,EAASpD,EAAO4K,OAAOD,eAC3B,IAAKvH,EAAQ,CACXA,EAASpD,EAAO4K,OAAOD,eAAiB,CAAC,EACzC,IAAK,MAAMlP,KAAQuE,EAAO6K,MAAO,CAC/B,MAAMlQ,EAAOqF,EAAO6K,MAAMpP,GAAOqP,EAAOnQ,EAAKmC,KAAKgK,UAC9CgE,IACF1H,EAAO0H,GAAQnQ,EACnB,CACF,CACA,OAAOyI,CACT,CAGA,IAAI2H,EAAkB,IAAI,KAAU,kBACpC,SAASC,EAAWxR,GAClB,IAAK,IAAIyR,EAAIzR,EAAKS,MAAQ,EAAGgR,EAAI,EAAGA,IAClC,GAAwC,OAApCzR,EAAKJ,KAAK6R,GAAGtQ,KAAKmC,KAAKgK,UACzB,OAAOtN,EAAKJ,KAAK,GAAGwC,QAAQpC,EAAKW,OAAO8Q,EAAI,IAChD,OAAO,IACT,CACA,SAASC,EAAa1R,GACpB,IAAK,IAAIyR,EAAIzR,EAAKS,MAAOgR,EAAI,EAAGA,IAAK,CACnC,MAAMH,EAAOtR,EAAKJ,KAAK6R,GAAGtQ,KAAKmC,KAAKgK,UACpC,GAAa,SAATgE,GAA4B,gBAATA,EACrB,OAAOtR,EAAKJ,KAAK6R,EACrB,CACA,OAAO,IACT,CACA,SAASE,EAAU3M,GACjB,MAAMtH,EAAQsH,EAAMpB,UAAUlG,MAC9B,IAAK,IAAI+T,EAAI/T,EAAM+C,MAAOgR,EAAI,EAAGA,IAC/B,GAAyC,OAArC/T,EAAMkC,KAAK6R,GAAGtQ,KAAKmC,KAAKgK,UAC1B,OAAO,EACX,OAAO,CACT,CACA,SAASsE,EAAc5M,GACrB,MAAMtB,EAAMsB,EAAMpB,UAClB,GAAI,gBAAiBF,GAAOA,EAAImO,YAC9B,OAAOnO,EAAImO,YAAY5T,IAAMyF,EAAIoO,UAAU7T,IAAMyF,EAAImO,YAAcnO,EAAIoO,UAClE,GAAI,SAAUpO,GAAOA,EAAI9D,MAAwC,QAAhC8D,EAAI9D,KAAKuB,KAAKmC,KAAKgK,UACzD,OAAO5J,EAAIjG,QAEb,MAAMsU,EAAQP,EAAW9N,EAAIhG,QAAUsU,EAAStO,EAAIhG,OACpD,GAAIqU,EACF,OAAOA,EAET,MAAM,IAAI3Q,WAAW,iCAAiCsC,EAAIxF,OAC5D,CACA,SAAS8T,EAAShS,GAChB,IAAK,IAAIY,EAAQZ,EAAK+C,UAAW9E,EAAM+B,EAAK/B,IAAK2C,EAAOA,EAAQA,EAAMqR,WAAYhU,IAAO,CACvF,MAAMqT,EAAO1Q,EAAMO,KAAKmC,KAAKgK,UAC7B,GAAY,QAARgE,GAA0B,eAARA,EACpB,OAAOtR,EAAKrB,IAAIyD,QAAQnE,EAC5B,CACA,IAAK,IAAI0C,EAASX,EAAKkS,WAAYjU,EAAM+B,EAAK/B,IAAK0C,EAAQA,EAASA,EAAO3B,UAAWf,IAAO,CAC3F,MAAMqT,EAAO3Q,EAAOQ,KAAKmC,KAAKgK,UAC9B,GAAY,QAARgE,GAA0B,eAARA,EACpB,OAAOtR,EAAKrB,IAAIyD,QAAQnE,EAAM0C,EAAOsC,SACzC,CACF,CACA,SAASkP,EAAanS,GACpB,MAA0C,OAAnCA,EAAKI,OAAOe,KAAKmC,KAAKgK,aAAwBtN,EAAK+C,SAC5D,CACA,SAASqP,EAAgBpS,GACvB,OAAOA,EAAKJ,KAAK,GAAGwC,QAAQpC,EAAK/B,IAAM+B,EAAK+C,UAAUE,SACxD,CACA,SAASoP,EAAYC,EAAQC,GAC3B,OAAOD,EAAO7R,OAAS8R,EAAO9R,OAAS6R,EAAOrU,KAAOsU,EAAOrE,OAAO,IAAMoE,EAAOrU,KAAOsU,EAAOlO,KAAK,EACrG,CAOA,SAASyH,EAAS9L,EAAM+L,EAAM9L,GAC5B,MAAMgN,EAAQjN,EAAKJ,MAAM,GACnBL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAaxS,EAAKkO,OAAO,GACzBuE,EAAQlT,EAAIuM,SAAS9L,EAAK/B,IAAMuU,EAAYzG,EAAM9L,GACxD,OAAgB,MAATwS,EAAgB,KAAOzS,EAAKJ,KAAK,GAAGwC,QAAQoQ,EAAaC,EAClE,CACA,SAASC,EAAc1E,EAAO/P,EAAKkL,EAAI,GACrC,MAAMS,EAAS,IAAKoE,EAAOH,QAASG,EAAMH,QAAU1E,GAOpD,OANIS,EAAOmE,WACTnE,EAAOmE,SAAWnE,EAAOmE,SAASnP,QAClCgL,EAAOmE,SAAS4E,OAAO1U,EAAKkL,GACvBS,EAAOmE,SAAS6E,MAAMzE,GAAMA,EAAI,MACnCvE,EAAOmE,SAAW,OAEfnE,CACT,CACA,SAASiJ,EAAW7E,EAAO/P,EAAKkL,EAAI,GAClC,MAAMS,EAAS,IAAKoE,EAAOH,QAASG,EAAMH,QAAU1E,GACpD,GAAIS,EAAOmE,SAAU,CACnBnE,EAAOmE,SAAWnE,EAAOmE,SAASnP,QAClC,IAAK,IAAIJ,EAAI,EAAGA,EAAI2K,EAAG3K,IACrBoL,EAAOmE,SAAS4E,OAAO1U,EAAK,EAAG,EACnC,CACA,OAAO2L,CACT,CACA,SAASkJ,EAAevT,EAAK0N,EAAOF,GAClC,MAAMgG,EAAa5B,EAAelE,EAAM9L,KAAKqF,QAAQwM,YACrD,IAAK,IAAIlG,EAAM,EAAGA,EAAMvN,EAAI8L,OAAQyB,IAClC,GAAIG,EAAM8B,OAAOxP,EAAIA,IAAIwN,EAAMD,EAAMvN,EAAI6L,QAAQjK,MAAQ4R,EACvD,OAAO,EACX,OAAO,CACT,CAGA,IAAIE,EAAgB,cAAc,KAChCzV,YAAYqU,EAAaC,EAAYD,GACnC,MAAM5E,EAAQ4E,EAAYjS,MAAM,GAC1BL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAaX,EAAY3D,OAAO,GAChCrB,EAAOtN,EAAIyM,YACf6F,EAAY5T,IAAMuU,EAClBV,EAAU7T,IAAMuU,GAEZ7T,EAAMkT,EAAYjS,KAAK,GACvBsT,EAAQ3T,EAAIqN,YAAYC,GAAMsG,QAAQC,GAAMA,GAAKtB,EAAU7T,IAAMuU,IACvEU,EAAMhE,QAAQ4C,EAAU7T,IAAMuU,GAC9B,MAAM7U,EAASuV,EAAM3T,KAAKtB,IACxB,MAAM6Q,EAAO7B,EAAM8B,OAAO9Q,GAC1B,IAAK6Q,EACH,MAAM1N,WAAW,uBAAuBnD,WAE1C,MAAME,EAAOqU,EAAavU,EAAM,EAChC,OAAO,IAAI,KACTU,EAAIyD,QAAQjE,GACZQ,EAAIyD,QAAQjE,EAAO2Q,EAAKpQ,QAAQsC,MACjC,IAEHkB,MAAMvE,EAAO,GAAGS,MAAOT,EAAO,GAAGW,IAAKX,GACtCC,KAAKiU,YAAcA,EACnBjU,KAAKkU,UAAYA,CACnB,CACAvS,IAAIZ,EAAKU,GACP,MAAMwS,EAAclT,EAAIyD,QAAQ/C,EAAQE,IAAI3B,KAAKiU,YAAY5T,MACvD6T,EAAYnT,EAAIyD,QAAQ/C,EAAQE,IAAI3B,KAAKkU,UAAU7T,MACzD,GAAIkU,EAAaN,IAAgBM,EAAaL,IAAcO,EAAYR,EAAaC,GAAY,CAC/F,MAAMuB,EAAezV,KAAKiU,YAAYjS,MAAM,IAAMiS,EAAYjS,MAAM,GACpE,OAAIyT,GAAgBzV,KAAK0V,iBAChBL,EAAcM,aAAa1B,EAAaC,GACxCuB,GAAgBzV,KAAK4V,iBACrBP,EAAcQ,aAAa5B,EAAaC,GAExC,IAAImB,EAAcpB,EAAaC,EAC1C,CACA,OAAO,aAAsBD,EAAaC,EAC5C,CACApT,UACE,MAAMuO,EAAQrP,KAAKiU,YAAYjS,MAAM,GAC/BL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAa5U,KAAKiU,YAAY3D,OAAO,GACrCrB,EAAOtN,EAAIyM,YACfpO,KAAKiU,YAAY5T,IAAMuU,EACvB5U,KAAKkU,UAAU7T,IAAMuU,GAEjBxJ,EAAO,CAAC,EACR0K,EAAO,GACb,IAAK,IAAI5G,EAAMD,EAAKnB,IAAKoB,EAAMD,EAAKjB,OAAQkB,IAAO,CACjD,MAAM6G,EAAa,GACnB,IAAK,IAAInT,EAAQsM,EAAMvN,EAAI6L,MAAQyB,EAAKpB,KAAMsB,EAAMF,EAAKpB,KAAMsB,EAAMF,EAAKlB,MAAOoB,IAAOvM,IAAS,CAC/F,MAAMvC,EAAMsB,EAAIA,IAAIiB,GACpB,GAAIwI,EAAK/K,GACP,SACF+K,EAAK/K,IAAO,EACZ,MAAM2V,EAAWrU,EAAIgM,SAAStN,GAC9B,IAAI6Q,EAAO7B,EAAM8B,OAAO9Q,GACxB,IAAK6Q,EACH,MAAM1N,WAAW,uBAAuBnD,WAE1C,MAAM4V,EAAYhH,EAAKpB,KAAOmI,EAASnI,KACjCqI,EAAaF,EAASjI,MAAQkB,EAAKlB,MACzC,GAAIkI,EAAY,GAAKC,EAAa,EAAG,CACnC,IAAI9F,EAAQc,EAAKd,MAWjB,GAVI6F,EAAY,IACd7F,EAAQ0E,EAAc1E,EAAO,EAAG6F,IAE9BC,EAAa,IACf9F,EAAQ0E,EACN1E,EACAA,EAAMH,QAAUiG,EAChBA,IAGAF,EAASnI,KAAOoB,EAAKpB,MAEvB,GADAqD,EAAOA,EAAK3N,KAAKwG,cAAcqG,IAC1Bc,EACH,MAAM1N,WACJ,oCAAoC2S,KAAKC,UAAUhG,WAIvDc,EAAOA,EAAK3N,KAAK7D,OAAO0Q,EAAOc,EAAKpQ,QAExC,CACA,GAAIkV,EAASlI,IAAMmB,EAAKnB,KAAOkI,EAAShI,OAASiB,EAAKjB,OAAQ,CAC5D,MAAMoC,EAAQ,IACTc,EAAKd,MACRF,QAASnB,KAAK7O,IAAI8V,EAAShI,OAAQiB,EAAKjB,QAAUe,KAAK5O,IAAI6V,EAASlI,IAAKmB,EAAKnB,MAG9EoD,EADE8E,EAASlI,IAAMmB,EAAKnB,IACfoD,EAAK3N,KAAKwG,cAAcqG,GAExBc,EAAK3N,KAAK7D,OAAO0Q,EAAOc,EAAKpQ,QAExC,CACAiV,EAAWtL,KAAKyG,EAClB,CACA4E,EAAKrL,KAAK4E,EAAMjJ,MAAM8I,GAAKmH,KAAK,UAAcN,IAChD,CACA,MAAMO,EAAWtW,KAAK4V,kBAAoB5V,KAAK0V,iBAAmBrG,EAAQyG,EAC1E,OAAO,IAAI,KAAM,UAAcQ,GAAW,EAAG,EAC/C,CACArV,QAAQC,EAAIJ,EAAU,YACpB,MAAMS,EAAUL,EAAGM,MAAMX,OAAQd,EAASC,KAAKD,OAC/C,IAAK,IAAIa,EAAI,EAAGA,EAAIb,EAAOc,OAAQD,IAAK,CACtC,MAAM,MAAEJ,EAAK,IAAEE,GAAQX,EAAOa,GAAIa,EAAUP,EAAGO,QAAQT,MAAMO,GAC7DL,EAAGD,QACDQ,EAAQE,IAAInB,EAAMH,KAClBoB,EAAQE,IAAIjB,EAAIL,KAChBO,EAAI,WAAcE,EAEtB,CACA,MAAMgF,EAAM,cACV5E,EAAGH,IAAIyD,QAAQtD,EAAGO,QAAQT,MAAMO,GAASI,IAAI3B,KAAKS,MACjD,GAECqF,GACF5E,EAAG+E,aAAaH,EACpB,CACA/D,YAAYb,EAAIc,GACdhC,KAAKiB,QAAQC,EAAI,IAAI,KAAM,UAAcc,GAAO,EAAG,GACrD,CACAuU,YAAYjN,GACV,MAAM+F,EAAQrP,KAAKiU,YAAYjS,MAAM,GAC/BL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAa5U,KAAKiU,YAAY3D,OAAO,GACrCgF,EAAQ3T,EAAIqN,YAChBrN,EAAIyM,YACFpO,KAAKiU,YAAY5T,IAAMuU,EACvB5U,KAAKkU,UAAU7T,IAAMuU,IAGzB,IAAK,IAAIhU,EAAI,EAAGA,EAAI0U,EAAMzU,OAAQD,IAChC0I,EAAE+F,EAAM8B,OAAOmE,EAAM1U,IAAKgU,EAAaU,EAAM1U,GAEjD,CACAgV,iBACE,MAAMY,EAAYxW,KAAKiU,YAAYrR,OAAO,GACpC6T,EAAUzW,KAAKkU,UAAUtR,OAAO,GACtC,GAAImM,KAAK7O,IAAIsW,EAAWC,GAAW,EACjC,OAAO,EACT,MAAMC,EAAeF,EAAYxW,KAAKiU,YAAY9O,UAAUiL,MAAMF,QAC5DyG,EAAaF,EAAUzW,KAAKkU,UAAU/O,UAAUiL,MAAMF,QAC5D,OAAOnB,KAAK5O,IAAIuW,EAAcC,IAAe3W,KAAKkU,UAAUlS,MAAM,GAAGqB,UACvE,CACAlB,oBAAoB8R,EAAaC,EAAYD,GAC3C,MAAM5E,EAAQ4E,EAAYjS,MAAM,GAC1BL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAaX,EAAY3D,OAAO,GAChCsG,EAAajV,EAAIgM,SAASsG,EAAY5T,IAAMuU,GAC5CiC,EAAWlV,EAAIgM,SAASuG,EAAU7T,IAAMuU,GACxC7T,EAAMkT,EAAYjS,KAAK,GAgB7B,OAfI4U,EAAW9I,KAAO+I,EAAS/I,KACzB8I,EAAW9I,IAAM,IACnBmG,EAAclT,EAAIyD,QAAQoQ,EAAajT,EAAIA,IAAIiV,EAAW/I,QACxDgJ,EAAS7I,OAASrM,EAAI8L,SACxByG,EAAYnT,EAAIyD,QACdoQ,EAAajT,EAAIA,IAAIA,EAAI6L,OAAS7L,EAAI8L,OAAS,GAAKoJ,EAAS9I,MAAQ,OAGrE8I,EAAS/I,IAAM,IACjBoG,EAAYnT,EAAIyD,QAAQoQ,EAAajT,EAAIA,IAAIkV,EAAShJ,QACpD+I,EAAW5I,OAASrM,EAAI8L,SAC1BwG,EAAclT,EAAIyD,QAChBoQ,EAAajT,EAAIA,IAAIA,EAAI6L,OAAS7L,EAAI8L,OAAS,GAAKmJ,EAAW7I,MAAQ,MAGtE,IAAIsH,EAAcpB,EAAaC,EACxC,CACAwB,iBACE,MAAMrG,EAAQrP,KAAKiU,YAAYjS,MAAM,GAC/BL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAa5U,KAAKiU,YAAY3D,OAAO,GACrCwG,EAAanV,EAAIsM,SAASjO,KAAKiU,YAAY5T,IAAMuU,GACjDmC,EAAWpV,EAAIsM,SAASjO,KAAKkU,UAAU7T,IAAMuU,GACnD,GAAI7F,KAAK7O,IAAI4W,EAAYC,GAAY,EACnC,OAAO,EACT,MAAMC,EAAcF,EAAa9W,KAAKiU,YAAY9O,UAAUiL,MAAMH,QAC5DgH,EAAYF,EAAW/W,KAAKkU,UAAU/O,UAAUiL,MAAMH,QAC5D,OAAOlB,KAAK5O,IAAI6W,EAAaC,IAActV,EAAI6L,KACjD,CACA3I,GAAGC,GACD,OAAOA,aAAiBuQ,GAAiBvQ,EAAMmP,YAAY5T,KAAOL,KAAKiU,YAAY5T,KAAOyE,EAAMoP,UAAU7T,KAAOL,KAAKkU,UAAU7T,GAClI,CACA8B,oBAAoB8R,EAAaC,EAAYD,GAC3C,MAAM5E,EAAQ4E,EAAYjS,MAAM,GAC1BL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAaX,EAAY3D,OAAO,GAChCsG,EAAajV,EAAIgM,SAASsG,EAAY5T,IAAMuU,GAC5CiC,EAAWlV,EAAIgM,SAASuG,EAAU7T,IAAMuU,GACxC7T,EAAMkT,EAAYjS,KAAK,GAkB7B,OAjBI4U,EAAW/I,MAAQgJ,EAAShJ,MAC1B+I,EAAW/I,KAAO,IACpBoG,EAAclT,EAAIyD,QAChBoQ,EAAajT,EAAIA,IAAIiV,EAAW9I,IAAMnM,EAAI6L,SAE1CqJ,EAAS9I,MAAQpM,EAAI6L,QACvB0G,EAAYnT,EAAIyD,QACdoQ,EAAajT,EAAIA,IAAIA,EAAI6L,OAASqJ,EAAS/I,IAAM,GAAK,OAGtD+I,EAAShJ,KAAO,IAClBqG,EAAYnT,EAAIyD,QAAQoQ,EAAajT,EAAIA,IAAIkV,EAAS/I,IAAMnM,EAAI6L,SAC9DoJ,EAAW7I,MAAQpM,EAAI6L,QACzByG,EAAclT,EAAIyD,QAChBoQ,EAAajT,EAAIA,IAAIA,EAAI6L,OAASoJ,EAAW9I,IAAM,GAAK,MAGvD,IAAIuH,EAAcpB,EAAaC,EACxC,CACAlP,SACE,MAAO,CACLzB,KAAM,OACNnD,OAAQJ,KAAKiU,YAAY5T,IACzBC,KAAMN,KAAKkU,UAAU7T,IAEzB,CACA8B,gBAAgBpB,EAAKuC,GACnB,OAAO,IAAI+R,EAActU,EAAIyD,QAAQlB,EAAKlD,QAASW,EAAIyD,QAAQlB,EAAKhD,MACtE,CACA6B,cAAcpB,EAAKmW,EAAYC,EAAWD,GACxC,OAAO,IAAI7B,EAActU,EAAIyD,QAAQ0S,GAAanW,EAAIyD,QAAQ2S,GAChE,CACApT,cACE,OAAO,IAAIqT,EAAapX,KAAKiU,YAAY5T,IAAKL,KAAKkU,UAAU7T,IAC/D,GAEFgV,EAAcxR,UAAUI,SAAU,EAClC,YAAiB,OAAQoR,GACzB,IAAI+B,EAAe,MACjBxX,YAAYQ,EAAQE,GAClBN,KAAKI,OAASA,EACdJ,KAAKM,KAAOA,CACd,CACAqB,IAAIF,GACF,OAAO,IAAI2V,EAAa3V,EAAQE,IAAI3B,KAAKI,QAASqB,EAAQE,IAAI3B,KAAKM,MACrE,CACAkE,QAAQzD,GACN,MAAMkT,EAAclT,EAAIyD,QAAQxE,KAAKI,QAAS8T,EAAYnT,EAAIyD,QAAQxE,KAAKM,MAC3E,MAA8C,OAA1C2T,EAAYzR,OAAOe,KAAKmC,KAAKgK,WAA8D,OAAxCwE,EAAU1R,OAAOe,KAAKmC,KAAKgK,WAAsBuE,EAAYrR,QAAUqR,EAAYzR,OAAOa,YAAc6Q,EAAUtR,QAAUsR,EAAU1R,OAAOa,YAAcoR,EAAYR,EAAaC,GAClO,IAAImB,EAAcpB,EAAaC,GAE/B,UAAeA,EAAW,EACrC,GAEF,SAASmD,EAAkBjQ,GACzB,KAAMA,EAAMpB,qBAAqBqP,GAC/B,OAAO,KACT,MAAMC,EAAQ,GAMd,OALAlO,EAAMpB,UAAUuQ,aAAY,CAACvU,EAAM3B,KACjCiV,EAAM7K,KACJ,SAAgBpK,EAAKA,EAAM2B,EAAKqD,SAAU,CAAEiS,MAAO,iBACpD,IAEI,YAAqBlQ,EAAMrG,IAAKuU,EACzC,CACA,SAASiC,GAAwB,MAAE/W,EAAK,IAAEE,IACxC,GAAIF,EAAMH,KAAOK,EAAIL,KAAOG,EAAMH,IAAMG,EAAMH,IAAM,EAClD,OAAO,EACT,IAAImX,EAAYhX,EAAMH,IAClBoX,EAAW/W,EAAIL,IACfwC,EAAQrC,EAAMqC,MAClB,KAAOA,GAAS,EAAGA,IAAS2U,IAC1B,GAAIhX,EAAMwC,MAAMH,EAAQ,GAAKrC,EAAMiG,IAAI5D,GACrC,MACJ,IAAK,IAAIgR,EAAInT,EAAImC,MAAOgR,GAAK,EAAGA,IAAK4D,IACnC,GAAI/W,EAAIqC,OAAO8Q,EAAI,GAAKnT,EAAI4P,MAAMuD,GAChC,MACJ,OAAO2D,GAAaC,GAAY,YAAY5F,KAAKrR,EAAMwB,KAAKa,GAAOU,KAAKmC,KAAKgK,UAC/E,CACA,SAASgI,GAA2B,MAAElX,EAAK,IAAEE,IAC3C,IAAIiX,EACAC,EACJ,IAAK,IAAIhX,EAAIJ,EAAMqC,MAAOjC,EAAI,EAAGA,IAAK,CACpC,MAAMoB,EAAOxB,EAAMwB,KAAKpB,GACxB,GAAiC,SAA7BoB,EAAKuB,KAAKmC,KAAKgK,WAAqD,gBAA7B1N,EAAKuB,KAAKmC,KAAKgK,UAA6B,CACrFiI,EAAuB3V,EACvB,KACF,CACF,CACA,IAAK,IAAIpB,EAAIF,EAAImC,MAAOjC,EAAI,EAAGA,IAAK,CAClC,MAAMoB,EAAOtB,EAAIsB,KAAKpB,GACtB,GAAiC,SAA7BoB,EAAKuB,KAAKmC,KAAKgK,WAAqD,gBAA7B1N,EAAKuB,KAAKmC,KAAKgK,UAA6B,CACrFkI,EAAqB5V,EACrB,KACF,CACF,CACA,OAAO2V,IAAyBC,GAA2C,IAArBlX,EAAImX,YAC5D,CACA,SAASC,EAAmB1Q,EAAOlG,EAAI6W,GACrC,MAAMjS,GAAO5E,GAAMkG,GAAOpB,UACpBjF,GAAOG,GAAMkG,GAAOrG,IAC1B,IAAIiX,EACAtE,EACJ,GAAI5N,aAAe,OAAmB4N,EAAO5N,EAAI9D,KAAKuB,KAAKmC,KAAKgK,YAC9D,GAAY,QAARgE,GAA0B,eAARA,EACpBsE,EAAY3C,EAAc3V,OAAOqB,EAAK+E,EAAIvF,WACrC,GAAY,OAARmT,EAAe,CACxB,MAAMS,EAAQpT,EAAIyD,QAAQsB,EAAIvF,KAAO,GACrCyX,EAAY3C,EAAcM,aAAaxB,EAAOA,EAChD,MAAO,IAAK4D,EAAyB,CACnC,MAAMpW,EAAM4L,EAASR,IAAIjH,EAAI9D,MACvBsO,EAAQxK,EAAIvF,KAAO,EACnB0X,EAAW3H,EAAQ3O,EAAIA,IAAIA,EAAI6L,MAAQ7L,EAAI8L,OAAS,GAC1DuK,EAAY3C,EAAc3V,OAAOqB,EAAKuP,EAAQ,EAAG2H,EACnD,OACSnS,aAAe,MAAiByR,EAAwBzR,GACjEkS,EAAY,YAAqBjX,EAAK+E,EAAIvF,MACjCuF,aAAe,MAAiB4R,EAA2B5R,KACpEkS,EAAY,YAAqBjX,EAAK+E,EAAItF,MAAM8P,QAASxK,EAAItF,MAAMiG,QAIrE,OAFIuR,IACD9W,IAAOA,EAAKkG,EAAMlG,KAAK+E,aAAa+R,GAChC9W,CACT,CAIA,IAAIgX,EAAe,IAAI,KAAW,cAClC,SAASC,EAAmBC,EAAKC,EAAKC,EAAQhP,GAC5C,MAAMiP,EAAUH,EAAI/U,WAAYmV,EAAUH,EAAIhV,WAC9CoV,EACE,IAAK,IAAI7X,EAAI,EAAG6K,EAAI,EAAG7K,EAAI4X,EAAS5X,IAAK,CACvC,MAAMwF,EAAQiS,EAAIjS,MAAMxF,GACxB,IAAK,IAAI8X,EAAOjN,EAAGqE,EAAIf,KAAK7O,IAAIqY,EAAS3X,EAAI,GAAI8X,EAAO5I,EAAG4I,IACzD,GAAIN,EAAIhS,MAAMsS,IAAStS,EAAO,CAC5BqF,EAAIiN,EAAO,EACXJ,GAAUlS,EAAMf,SAChB,SAASoT,CACX,CAEFnP,EAAElD,EAAOkS,GACL7M,EAAI8M,GAAWH,EAAIhS,MAAMqF,GAAGkN,WAAWvS,GACzC+R,EAAmBC,EAAIhS,MAAMqF,GAAIrF,EAAOkS,EAAS,EAAGhP,GAEpDlD,EAAMwS,aAAa,EAAGxS,EAAMtF,QAAQsC,KAAMkG,EAAGgP,EAAS,GACxDA,GAAUlS,EAAMf,QAClB,CACJ,CACA,SAASwT,EAAUzR,EAAOoE,GACxB,IAAItK,EACJ,MAAM4X,EAAQ,CAAC9W,EAAM3B,KACa,SAA5B2B,EAAKuB,KAAKmC,KAAKgK,YACjBxO,EAAK6X,EAAS3R,EAAOpF,EAAM3B,EAAKa,GAAG,EAMvC,OAJKsK,EAEIA,EAASzK,KAAOqG,EAAMrG,KAC7BoX,EAAmB3M,EAASzK,IAAKqG,EAAMrG,IAAK,EAAG+X,GAF/C1R,EAAMrG,IAAIiY,YAAYF,GAGjB5X,CACT,CACA,SAAS6X,EAAS3R,EAAOiI,EAAO4J,EAAU/X,GACxC,MAAMS,EAAM4L,EAASR,IAAIsC,GACzB,IAAK1N,EAAI+L,SACP,OAAOxM,EACJA,IACHA,EAAKkG,EAAMlG,IACb,MAAMgY,EAAU,GAChB,IAAK,IAAItY,EAAI,EAAGA,EAAIe,EAAI8L,OAAQ7M,IAC9BsY,EAAQzO,KAAK,GACf,IAAK,IAAI7J,EAAI,EAAGA,EAAIe,EAAI+L,SAAS7M,OAAQD,IAAK,CAC5C,MAAMuY,EAAOxX,EAAI+L,SAAS9M,GAC1B,GAAiB,aAAbuY,EAAK5V,KAAqB,CAC5B,MAAM2N,EAAO7B,EAAM8B,OAAOgI,EAAK9Y,KAC/B,IAAK6Q,EACH,SACF,MAAMd,EAAQc,EAAKd,MACnB,IAAK,IAAI3E,EAAI,EAAGA,EAAI2E,EAAMF,QAASzE,IACjCyN,EAAQC,EAAKjK,IAAMzD,IAAM0N,EAAK5N,EAChCrK,EAAGkY,cACDlY,EAAGO,QAAQE,IAAIsX,EAAW,EAAIE,EAAK9Y,KACnC,KACAyU,EAAc1E,EAAOA,EAAMH,QAAUkJ,EAAK5N,EAAG4N,EAAK5N,GAEtD,MAAO,GAAiB,WAAb4N,EAAK5V,KACd2V,EAAQC,EAAKjK,MAAQiK,EAAK5N,OACrB,GAAiB,oBAAb4N,EAAK5V,KAA4B,CAC1C,MAAM2N,EAAO7B,EAAM8B,OAAOgI,EAAK9Y,KAC/B,IAAK6Q,EACH,SACFhQ,EAAGkY,cAAclY,EAAGO,QAAQE,IAAIsX,EAAW,EAAIE,EAAK9Y,KAAM,KAAM,IAC3D6Q,EAAKd,MACRF,QAASgB,EAAKd,MAAMF,QAAUiJ,EAAK5N,GAEvC,MAAO,GAAiB,qBAAb4N,EAAK5V,KAA6B,CAC3C,MAAM2N,EAAO7B,EAAM8B,OAAOgI,EAAK9Y,KAC/B,IAAK6Q,EACH,SACFhQ,EAAGkY,cAAclY,EAAGO,QAAQE,IAAIsX,EAAW,EAAIE,EAAK9Y,KAAM,KAAM,IAC3D6Q,EAAKd,MACRD,SAAUgJ,EAAKhJ,UAEnB,CACF,CACA,IAAIkJ,EAAO9S,EACX,IAAK,IAAI3F,EAAI,EAAGA,EAAIsY,EAAQrY,OAAQD,IAC9BsY,EAAQtY,KACG,MAATyY,IACFA,EAAQzY,GACV2F,EAAO3F,GAEX,IAAK,IAAIA,EAAI,EAAGP,EAAM4Y,EAAW,EAAGrY,EAAIe,EAAI8L,OAAQ7M,IAAK,CACvD,MAAMsO,EAAMG,EAAMjJ,MAAMxF,GAClB6F,EAAMpG,EAAM6O,EAAI7J,SAChBiU,EAAMJ,EAAQtY,GACpB,GAAI0Y,EAAM,EAAG,CACX,IAAI5F,EAAO,OACPxE,EAAImF,aACNX,EAAOxE,EAAImF,WAAW9Q,KAAKmC,KAAKgK,WAElC,MAAM+D,EAAQ,GACd,IAAK,IAAIhI,EAAI,EAAGA,EAAI6N,EAAK7N,IAAK,CAC5B,MAAMzJ,EAAOuR,EAAenM,EAAMwB,QAAQ8K,GAAM3J,gBAC5C/H,GACFyR,EAAMhJ,KAAKzI,EACf,CACA,MAAMuX,EAAa,GAAL3Y,GAAUyY,GAASzY,EAAI,GAAM2F,GAAQ3F,EAAc6F,EAAM,EAAhBpG,EAAM,EAC7Da,EAAGsY,OAAOtY,EAAGO,QAAQE,IAAI4X,GAAO9F,EAClC,CACApT,EAAMoG,CACR,CACA,OAAOvF,EAAG2H,QAAQqP,EAAc,CAAEW,WAAW,GAC/C,CAaA,SAASY,EAAYzY,GACnB,IAAKA,EAAMoC,KACT,OAAO,KACT,IAAI,QAAEtC,EAAO,UAAE4Y,EAAS,QAAEpY,GAAYN,EACtC,MAA6B,GAAtBF,EAAQuC,aAAoBqW,EAAY,GAAKpY,EAAU,GAA6C,SAAxCR,EAAQsF,MAAM,GAAG7C,KAAKmC,KAAKgK,WAC5FgK,IACApY,IACAR,EAAUA,EAAQsF,MAAM,GAAGtF,QAE7B,MAAMuY,EAAQvY,EAAQsF,MAAM,GACtBsN,EAAO2F,EAAM9V,KAAKmC,KAAKgK,UACvB9G,EAASyQ,EAAM9V,KAAKqF,OAAQkN,EAAO,GACzC,GAAY,OAARpC,EACF,IAAK,IAAI9S,EAAI,EAAGA,EAAIE,EAAQuC,WAAYzC,IAAK,CAC3C,IAAI0U,EAAQxU,EAAQsF,MAAMxF,GAAGE,QAC7B,MAAM+M,EAAOjN,EAAI,EAAImO,KAAK5O,IAAI,EAAGuZ,EAAY,GACvC3L,EAAQnN,EAAIE,EAAQuC,WAAa,EAAI,EAAI0L,KAAK5O,IAAI,EAAGmB,EAAU,IACjEuM,GAAQE,KACVuH,EAAQqE,EACNpG,EAAe3K,GAAQsG,IACvB,IAAI,KAAOoG,EAAOzH,EAAME,IACxBjN,SACJgV,EAAKrL,KAAK6K,EACZ,KACK,IAAY,QAAR5B,GAA0B,eAARA,EAQ3B,OAAO,KAPPoC,EAAKrL,KACHiP,GAAapY,EAAUqY,EACrBpG,EAAe3K,GAAQsG,IACvB,IAAI,KAAOpO,EAAS4Y,EAAWpY,IAC/BR,QAAUA,EAIhB,CACA,OAAO8Y,EAAkBhR,EAAQkN,EACnC,CACA,SAAS8D,EAAkBhR,EAAQkN,GACjC,MAAMlE,EAAS,GACf,IAAK,IAAIhR,EAAI,EAAGA,EAAIkV,EAAKjV,OAAQD,IAAK,CACpC,MAAMsO,EAAM4G,EAAKlV,GACjB,IAAK,IAAI6K,EAAIyD,EAAI7L,WAAa,EAAGoI,GAAK,EAAGA,IAAK,CAC5C,MAAM,QAAEyE,EAAO,QAAED,GAAYf,EAAI9I,MAAMqF,GAAG2E,MAC1C,IAAK,IAAIyJ,EAAIjZ,EAAGiZ,EAAIjZ,EAAIsP,EAAS2J,IAC/BjI,EAAOiI,IAAMjI,EAAOiI,IAAM,GAAK5J,CACnC,CACF,CACA,IAAIzC,EAAQ,EACZ,IAAK,IAAIqM,EAAI,EAAGA,EAAIjI,EAAO/Q,OAAQgZ,IACjCrM,EAAQuB,KAAK5O,IAAIqN,EAAOoE,EAAOiI,IACjC,IAAK,IAAIA,EAAI,EAAGA,EAAIjI,EAAO/Q,OAAQgZ,IAGjC,GAFIA,GAAK/D,EAAKjV,QACZiV,EAAKrL,KAAK,YACRmH,EAAOiI,GAAKrM,EAAO,CACrB,MAAM7M,EAAQ4S,EAAe3K,GAAQsI,KAAKnH,gBACpCuL,EAAQ,GACd,IAAK,IAAI1U,EAAIgR,EAAOiI,GAAIjZ,EAAI4M,EAAO5M,IACjC0U,EAAM7K,KAAK9J,GAEbmV,EAAK+D,GAAK/D,EAAK+D,GAAGC,OAAO,UAAexE,GAC1C,CAEF,MAAO,CAAE7H,OAAQqI,EAAKjV,OAAQ2M,QAAOsI,OACvC,CACA,SAAS6D,EAASI,EAAU/Y,GAC1B,MAAMgB,EAAO+X,EAAShQ,gBAChB7I,EAAK,IAAI,KAAUc,GAAMf,QAAQ,EAAGe,EAAKlB,QAAQsC,KAAMpC,GAC7D,OAAOE,EAAGH,GACZ,CACA,SAASiZ,GAAU,MAAExM,EAAK,OAAEC,EAAM,KAAEqI,GAAQmE,EAAUC,GACpD,GAAI1M,GAASyM,EAAU,CACrB,MAAME,EAAQ,GACRC,EAAU,GAChB,IAAK,IAAIlL,EAAM,EAAGA,EAAM4G,EAAKjV,OAAQqO,IAAO,CAC1C,MAAMmL,EAAOvE,EAAK5G,GAAMoG,EAAQ,GAChC,IAAK,IAAInG,EAAMgL,EAAMjL,IAAQ,EAAGtO,EAAI,EAAGuO,EAAM8K,EAAUrZ,IAAK,CAC1D,IAAIsQ,EAAOmJ,EAAKjU,MAAMxF,EAAIyZ,EAAKhX,YAC3B8L,EAAM+B,EAAKd,MAAMH,QAAUgK,IAC7B/I,EAAOA,EAAK3N,KAAK+W,cACfxF,EACE5D,EAAKd,MACLc,EAAKd,MAAMH,QACXd,EAAM+B,EAAKd,MAAMH,QAAUgK,GAE7B/I,EAAKpQ,UAETwU,EAAM7K,KAAKyG,GACX/B,GAAO+B,EAAKd,MAAMH,QAClB,IAAK,IAAIxE,EAAI,EAAGA,EAAIyF,EAAKd,MAAMF,QAASzE,IACtC0O,EAAMjL,EAAMzD,IAAM0O,EAAMjL,EAAMzD,IAAM,GAAKyF,EAAKd,MAAMH,OACxD,CACAmK,EAAQ3P,KAAK,UAAe6K,GAC9B,CACAQ,EAAOsE,EACP5M,EAAQyM,CACV,CACA,GAAIxM,GAAUyM,EAAW,CACvB,MAAME,EAAU,GAChB,IAAK,IAAIlL,EAAM,EAAGtO,EAAI,EAAGsO,EAAMgL,EAAWhL,IAAOtO,IAAK,CACpD,MAAM0U,EAAQ,GAAIiF,EAASzE,EAAKlV,EAAI6M,GACpC,IAAK,IAAIhC,EAAI,EAAGA,EAAI8O,EAAOlX,WAAYoI,IAAK,CAC1C,IAAIyF,EAAOqJ,EAAOnU,MAAMqF,GACpByD,EAAMgC,EAAKd,MAAMF,QAAUgK,IAC7BhJ,EAAOA,EAAK3N,KAAK7D,OACf,IACKwR,EAAKd,MACRF,QAASnB,KAAK5O,IAAI,EAAG+Z,EAAYhJ,EAAKd,MAAMF,UAE9CgB,EAAKpQ,UAETwU,EAAM7K,KAAKyG,EACb,CACAkJ,EAAQ3P,KAAK,UAAe6K,GAC9B,CACAQ,EAAOsE,EACP3M,EAASyM,CACX,CACA,MAAO,CAAE1M,QAAOC,SAAQqI,OAC1B,CACA,SAAS0E,EAAUtZ,EAAIS,EAAK0N,EAAOiB,EAAO9C,EAAOC,EAAQlM,GACvD,MAAMqH,EAAS1H,EAAGH,IAAIwC,KAAKqF,OACrB6R,EAAQlH,EAAe3K,GAC7B,IAAIjI,EACA+Z,EACJ,GAAIlN,EAAQ7L,EAAI6L,MACd,IAAK,IAAI0B,EAAM,EAAGK,EAAS,EAAGL,EAAMvN,EAAI8L,OAAQyB,IAAO,CACrD,MAAMa,EAAUV,EAAMjJ,MAAM8I,GAC5BK,GAAUQ,EAAQ1K,SAClB,MAAMiQ,EAAQ,GACd,IAAIgE,EAEFA,EADuB,MAArBvJ,EAAQ3O,WAAqB2O,EAAQ3O,UAAUmC,MAAQkX,EAAMvJ,KACzDvQ,IAAUA,EAAQ8Z,EAAMvJ,KAAKnH,iBAE7B2Q,IAAcA,EAAYD,EAAMrF,YAAYrL,iBACpD,IAAK,IAAInJ,EAAIe,EAAI6L,MAAO5M,EAAI4M,EAAO5M,IACjC0U,EAAM7K,KAAK6O,GACbpY,EAAGsY,OAAOtY,EAAGO,QAAQT,MAAMO,GAASI,IAAI4N,EAAS,EAAIe,GAAQgF,EAC/D,CAEF,GAAI7H,EAAS9L,EAAI8L,OAAQ,CACvB,MAAM6H,EAAQ,GACd,IAAK,IAAI1U,EAAI,EAAG+Z,GAAUhZ,EAAI8L,OAAS,GAAK9L,EAAI6L,MAAO5M,EAAImO,KAAK5O,IAAIwB,EAAI6L,MAAOA,GAAQ5M,IAAK,CAC1F,MAAMga,IAASha,GAAKe,EAAI6L,QAAgB6B,EAAM8B,OAAOxP,EAAIA,IAAIgZ,EAAS/Z,IAAI2C,MAAQkX,EAAMrF,YACxFE,EAAM7K,KACJmQ,EAASF,IAAcA,EAAYD,EAAMrF,YAAYrL,iBAAmBpJ,IAAUA,EAAQ8Z,EAAMvJ,KAAKnH,iBAEzG,CACA,MAAM8Q,EAAWJ,EAAMvL,IAAIxP,OAAO,KAAM,UAAe4V,IAASQ,EAAO,GACvE,IAAK,IAAIlV,EAAIe,EAAI8L,OAAQ7M,EAAI6M,EAAQ7M,IACnCkV,EAAKrL,KAAKoQ,GACZ3Z,EAAGsY,OAAOtY,EAAGO,QAAQT,MAAMO,GAASI,IAAI2O,EAAQjB,EAAMhK,SAAW,GAAIyQ,EACvE,CACA,SAAUnV,IAAS+Z,EACrB,CACA,SAASI,EAAkB5Z,EAAIS,EAAK0N,EAAOiB,EAAOzC,EAAME,EAAOD,EAAKvM,GAClE,GAAW,GAAPuM,GAAYA,GAAOnM,EAAI8L,OACzB,OAAO,EACT,IAAI3K,GAAQ,EACZ,IAAK,IAAIqM,EAAMtB,EAAMsB,EAAMpB,EAAOoB,IAAO,CACvC,MAAMvM,EAAQkL,EAAMnM,EAAI6L,MAAQ2B,EAAK9O,EAAMsB,EAAIA,IAAIiB,GACnD,GAAIjB,EAAIA,IAAIiB,EAAQjB,EAAI6L,QAAUnN,EAAK,CACrCyC,GAAQ,EACR,MAAMoO,EAAO7B,EAAM8B,OAAO9Q,IAClByN,IAAKiN,EAASlN,KAAMmN,GAAarZ,EAAIgM,SAAStN,GACtDa,EAAGkY,cAAclY,EAAGO,QAAQT,MAAMO,GAASI,IAAItB,EAAMiQ,GAAQ,KAAM,IAC9DY,EAAKd,MACRF,QAASpC,EAAMiN,IAEjB7Z,EAAGsY,OACDtY,EAAGO,QAAQT,MAAMO,GAASI,IAAIA,EAAIyN,WAAWtB,EAAKkN,EAAU3L,IAC5D6B,EAAK3N,KAAKwG,cAAc,IACnBmH,EAAKd,MACRF,QAAS6K,EAAU7J,EAAKd,MAAMF,QAAUpC,KAG5CqB,GAAO+B,EAAKd,MAAMH,QAAU,CAC9B,CACF,CACA,OAAOnN,CACT,CACA,SAASmY,EAAgB/Z,EAAIS,EAAK0N,EAAOiB,EAAOxC,EAAKE,EAAQH,EAAMtM,GACjE,GAAY,GAARsM,GAAaA,GAAQlM,EAAI6L,MAC3B,OAAO,EACT,IAAI1K,GAAQ,EACZ,IAAK,IAAIoM,EAAMpB,EAAKoB,EAAMlB,EAAQkB,IAAO,CACvC,MAAMtM,EAAQsM,EAAMvN,EAAI6L,MAAQK,EAAMxN,EAAMsB,EAAIA,IAAIiB,GACpD,GAAIjB,EAAIA,IAAIiB,EAAQ,IAAMvC,EAAK,CAC7ByC,GAAQ,EACR,MAAMoO,EAAO7B,EAAM8B,OAAO9Q,GACpB2a,EAAWrZ,EAAIsM,SAAS5N,GACxB6a,EAAYha,EAAGO,QAAQT,MAAMO,GAASI,IAAItB,EAAMiQ,GACtDpP,EAAGkY,cACD8B,EACA,KACApG,EACE5D,EAAKd,MACLvC,EAAOmN,EACP9J,EAAKd,MAAMH,SAAWpC,EAAOmN,KAGjC9Z,EAAGsY,OACD0B,EAAYhK,EAAK7L,SACjB6L,EAAK3N,KAAKwG,cACR+K,EAAc5D,EAAKd,MAAO,EAAGvC,EAAOmN,KAGxC9L,GAAOgC,EAAKd,MAAMF,QAAU,CAC9B,CACF,CACA,OAAOpN,CACT,CACA,SAASqY,EAAY/T,EAAOgU,EAAUxG,EAAY3F,EAAMqG,GACtD,IAAIjG,EAAQuF,EAAaxN,EAAMrG,IAAIoQ,OAAOyD,EAAa,GAAKxN,EAAMrG,IAClE,IAAKsO,EACH,MAAM,IAAIgM,MAAM,kBAElB,IAAI1Z,EAAM4L,EAASR,IAAIsC,GACvB,MAAM,IAAEvB,EAAG,KAAED,GAASoB,EAChBlB,EAAQF,EAAOyH,EAAM9H,MAAOQ,EAASF,EAAMwH,EAAM7H,OACjDvM,EAAKkG,EAAMlG,GACjB,IAAIK,EAAU,EACd,SAAS+Z,IAEP,GADAjM,EAAQuF,EAAa1T,EAAGH,IAAIoQ,OAAOyD,EAAa,GAAK1T,EAAGH,KACnDsO,EACH,MAAM,IAAIgM,MAAM,kBAElB1Z,EAAM4L,EAASR,IAAIsC,GACnB9N,EAAUL,EAAGO,QAAQiF,KAAK7F,MAC5B,CACI2Z,EAAUtZ,EAAIS,EAAK0N,EAAOuF,EAAY7G,EAAOC,EAAQzM,IACvD+Z,IACER,EAAkB5Z,EAAIS,EAAK0N,EAAOuF,EAAY/G,EAAME,EAAOD,EAAKvM,IAClE+Z,IACER,EAAkB5Z,EAAIS,EAAK0N,EAAOuF,EAAY/G,EAAME,EAAOC,EAAQzM,IACrE+Z,IACEL,EAAgB/Z,EAAIS,EAAK0N,EAAOuF,EAAY9G,EAAKE,EAAQH,EAAMtM,IACjE+Z,IACEL,EAAgB/Z,EAAIS,EAAK0N,EAAOuF,EAAY9G,EAAKE,EAAQD,EAAOxM,IAClE+Z,IACF,IAAK,IAAIpM,EAAMpB,EAAKoB,EAAMlB,EAAQkB,IAAO,CACvC,MAAM3O,EAAOoB,EAAIyN,WAAWF,EAAKrB,EAAMwB,GAAQ5O,EAAKkB,EAAIyN,WAAWF,EAAKnB,EAAOsB,GAC/EnO,EAAGD,QACDC,EAAGO,QAAQT,MAAMO,GAASI,IAAIpB,EAAOqU,GACrC1T,EAAGO,QAAQT,MAAMO,GAASI,IAAIlB,EAAKmU,GACnC,IAAI,KAAOU,EAAMQ,KAAK5G,EAAMpB,GAAM,EAAG,GAEzC,CACAwN,IACApa,EAAG+E,aACD,IAAIoP,EACFnU,EAAGH,IAAIyD,QAAQoQ,EAAajT,EAAIyN,WAAWtB,EAAKD,EAAMwB,IACtDnO,EAAGH,IAAIyD,QAAQoQ,EAAajT,EAAIyN,WAAWpB,EAAS,EAAGD,EAAQ,EAAGsB,MAGtE+L,EAASla,EACX,CAGA,IAAIqa,GAAgB,OAAe,CACjCC,UAAWC,EAAM,SAAU,GAC3BC,WAAYD,EAAM,QAAS,GAC3BE,QAASF,EAAM,QAAS,GACxBG,UAAWH,EAAM,OAAQ,GACzB,kBAAmBI,EAAW,SAAU,GACxC,mBAAoBA,EAAW,QAAS,GACxC,gBAAiBA,EAAW,QAAS,GACrC,kBAAmBA,EAAW,OAAQ,GACtCC,UAAWC,GACX,gBAAiBA,GACjBC,OAAQD,GACR,aAAcA,KAEhB,SAASE,EAAkB7U,EAAOgU,EAAUpV,GAC1C,OAAIA,EAAUnB,GAAGuC,EAAMpB,aAEnBoV,GACFA,EAAShU,EAAMlG,GAAG+E,aAAaD,GAAWmD,mBACrC,EACT,CACA,SAASsS,EAAMtN,EAAM9L,GACnB,MAAO,CAAC+E,EAAOgU,EAAUc,KACvB,IAAKA,EACH,OAAO,EACT,MAAMpW,EAAMsB,EAAMpB,UAClB,GAAIF,aAAeuP,EACjB,OAAO4G,EACL7U,EACAgU,EACA,UAAgBtV,EAAIoO,UAAW7R,IAGnC,GAAY,SAAR8L,IAAoBrI,EAAInF,MAC1B,OAAO,EACT,MAAM8F,EAAM0V,GAAYD,EAAM/N,EAAM9L,GACpC,GAAW,MAAPoE,EACF,OAAO,EACT,GAAY,SAAR0H,EACF,OAAO8N,EACL7U,EACAgU,EACA,UAAgBhU,EAAMrG,IAAIyD,QAAQsB,EAAIxF,KAAO+B,GAAMA,IAEhD,CACL,MAAM8R,EAAQ/M,EAAMrG,IAAIyD,QAAQiC,GAC1B2V,EAAQlO,EAASiG,EAAOhG,EAAM9L,GACpC,IAAIga,EAOJ,OALEA,EADED,EACO,UAAgBA,EAAO,GACzB/Z,EAAM,EACJ,UAAgB+E,EAAMrG,IAAIyD,QAAQ2P,EAAMpR,QAAQ,KAAM,GAEtD,UAAgBqE,EAAMrG,IAAIyD,QAAQ2P,EAAMnR,OAAO,IAAK,GACxDiZ,EAAkB7U,EAAOgU,EAAUiB,EAC5C,EAEJ,CACA,SAASR,EAAW1N,EAAM9L,GACxB,MAAO,CAAC+E,EAAOgU,EAAUc,KACvB,IAAKA,EACH,OAAO,EACT,MAAMpW,EAAMsB,EAAMpB,UAClB,IAAIsW,EACJ,GAAIxW,aAAeuP,EACjBiH,EAAUxW,MACL,CACL,MAAMW,EAAM0V,GAAYD,EAAM/N,EAAM9L,GACpC,GAAW,MAAPoE,EACF,OAAO,EACT6V,EAAU,IAAIjH,EAAcjO,EAAMrG,IAAIyD,QAAQiC,GAChD,CACA,MAAM3G,EAAQoO,EAASoO,EAAQpI,UAAW/F,EAAM9L,GAChD,QAAKvC,GAEEmc,EACL7U,EACAgU,EACA,IAAI/F,EAAciH,EAAQrI,YAAanU,GACxC,CAEL,CACA,SAASic,GAAoB3U,EAAOgU,GAClC,MAAMtV,EAAMsB,EAAMpB,UAClB,KAAMF,aAAeuP,GACnB,OAAO,EACT,GAAI+F,EAAU,CACZ,MAAMla,EAAKkG,EAAMlG,GACXqb,EAAchJ,EAAenM,EAAMwB,QAAQsI,KAAKnH,gBAAgBjJ,QACtEgF,EAAIyQ,aAAY,CAACrF,EAAM7Q,KAChB6Q,EAAKpQ,QAAQ+D,GAAG0X,IACnBrb,EAAGD,QACDC,EAAGO,QAAQE,IAAItB,EAAM,GACrBa,EAAGO,QAAQE,IAAItB,EAAM6Q,EAAK7L,SAAW,GACrC,IAAI,KAAOkX,EAAa,EAAG,GAC5B,IAEDrb,EAAGsb,YACLpB,EAASla,EACb,CACA,OAAO,CACT,CACA,SAASub,GAAkBP,EAAM7b,GAC/B,MAAMU,EAAMmb,EAAK9U,MAAMrG,IAAKoT,EAAQP,EAAW7S,EAAIyD,QAAQnE,IAC3D,QAAK8T,IAEL+H,EAAKd,SAASc,EAAK9U,MAAMlG,GAAG+E,aAAa,IAAIoP,EAAclB,MACpD,EACT,CACA,SAASuI,GAAYR,EAAMhT,EAAGlI,GAC5B,IAAK+S,EAAUmI,EAAK9U,OAClB,OAAO,EACT,IAAIkO,EAAQmE,EAAYzY,GACxB,MAAM8E,EAAMoW,EAAK9U,MAAMpB,UACvB,GAAIF,aAAeuP,EAAe,CAC3BC,IACHA,EAAQ,CACN9H,MAAO,EACPC,OAAQ,EACRqI,KAAM,CACJ,UACE6D,EAASpG,EAAe2I,EAAK9U,MAAMwB,QAAQsI,KAAMlQ,OAIzD,MAAMqO,EAAQvJ,EAAImO,YAAYjS,MAAM,GAC9BsO,EAAQxK,EAAImO,YAAY3D,OAAO,GAC/BrB,EAAO1B,EAASR,IAAIsC,GAAOjB,YAC/BtI,EAAImO,YAAY5T,IAAMiQ,EACtBxK,EAAIoO,UAAU7T,IAAMiQ,GAItB,OAFAgF,EAAQ0E,EAAU1E,EAAOrG,EAAKlB,MAAQkB,EAAKpB,KAAMoB,EAAKjB,OAASiB,EAAKnB,KACpEqN,EAAYe,EAAK9U,MAAO8U,EAAKd,SAAU9K,EAAOrB,EAAMqG,IAC7C,CACT,CAAO,GAAIA,EAAO,CAChB,MAAMnB,EAAQH,EAAckI,EAAK9U,OAC3BkJ,EAAQ6D,EAAM7D,OAAO,GAQ3B,OAPA6K,EACEe,EAAK9U,MACL8U,EAAKd,SACL9K,EACA/C,EAASR,IAAIoH,EAAMnS,MAAM,IAAI2L,SAASwG,EAAM9T,IAAMiQ,GAClDgF,IAEK,CACT,CACE,OAAO,CAEX,CACA,SAASqH,GAAgBT,EAAMU,GAC7B,IAAIC,EACJ,GAAID,EAAWE,SAAWF,EAAWG,QACnC,OACF,MAAMC,EAAeC,GAAUf,EAAMU,EAAWtQ,QAChD,IAAIzM,EACJ,GAAI+c,EAAWM,UAAYhB,EAAK9U,MAAMpB,qBAAqBqP,EACzD8H,EAAiBjB,EAAK9U,MAAMpB,UAAUiO,YAAa2I,GACnDA,EAAWQ,sBACN,GAAIR,EAAWM,UAAYF,GAAwE,OAAvDnd,EAAU+T,EAAWsI,EAAK9U,MAAMpB,UAAUnG,YAAiE,OAA1Cgd,EAAKQ,GAAenB,EAAMU,SAAuB,EAASC,EAAGxc,MAAQR,EAAQQ,IAC/L8c,EAAiBtd,EAAS+c,GAC1BA,EAAWQ,sBACN,IAAKJ,EACV,OAEF,SAASG,EAAiBG,EAAUC,GAClC,IAAIzd,EAAQud,GAAenB,EAAMqB,GACjC,MAAMC,EAAmD,MAAxC7J,EAAgB/G,SAASsP,EAAK9U,OAC/C,IAAKtH,IAAU2U,EAAY6I,EAAUxd,GAAQ,CAC3C,IAAI0d,EAGF,OAFA1d,EAAQwd,CAGZ,CACA,MAAMtX,EAAY,IAAIqP,EAAciI,EAAUxd,GAC9C,GAAI0d,IAAatB,EAAK9U,MAAMpB,UAAUnB,GAAGmB,GAAY,CACnD,MAAM9E,EAAKgb,EAAK9U,MAAMlG,GAAG+E,aAAaD,GAClCwX,GACFtc,EAAG2H,QAAQ8K,EAAiB2J,EAASjd,KACvC6b,EAAKd,SAASla,EAChB,CACF,CACA,SAASuc,IACPvB,EAAKwB,KAAKC,oBAAoB,UAAWF,GACzCvB,EAAKwB,KAAKC,oBAAoB,YAAaF,GAC3CvB,EAAKwB,KAAKC,oBAAoB,YAAaC,GACC,MAAxCjK,EAAgB/G,SAASsP,EAAK9U,QAChC8U,EAAKd,SAASc,EAAK9U,MAAMlG,GAAG2H,QAAQ8K,GAAkB,GAC1D,CACA,SAASiK,EAAKC,GACZ,MAAMN,EAAQM,EACRzd,EAASuT,EAAgB/G,SAASsP,EAAK9U,OAC7C,IAAIkW,EACJ,GAAc,MAAVld,EACFkd,EAAWpB,EAAK9U,MAAMrG,IAAIyD,QAAQpE,QAC7B,GAAI6c,GAAUf,EAAMqB,EAAMjR,SAAW0Q,IAC1CM,EAAWD,GAAenB,EAAMU,IAC3BU,GACH,OAAOG,IAEPH,GACFH,EAAiBG,EAAUC,EAC/B,CACArB,EAAKwB,KAAKI,iBAAiB,UAAWL,GACtCvB,EAAKwB,KAAKI,iBAAiB,YAAaL,GACxCvB,EAAKwB,KAAKI,iBAAiB,YAAaF,EAC1C,CACA,SAASzB,GAAYD,EAAM/N,EAAM9L,GAC/B,KAAM6Z,EAAK9U,MAAMpB,qBAAqB,MACpC,OAAO,KACT,MAAM,MAAElG,GAAUoc,EAAK9U,MAAMpB,UAC7B,IAAK,IAAI6N,EAAI/T,EAAM+C,MAAQ,EAAGgR,GAAK,EAAGA,IAAK,CACzC,MAAMrR,EAAS1C,EAAMkC,KAAK6R,GAAIjR,EAAQP,EAAM,EAAIvC,EAAM8C,MAAMiR,GAAK/T,EAAMie,WAAWlK,GAClF,GAAIjR,IAAUP,EAAM,EAAI,EAAIG,EAAOa,YACjC,OAAO,KACT,GAAkC,QAA9Bb,EAAOe,KAAKmC,KAAKgK,WAAqD,eAA9BlN,EAAOe,KAAKmC,KAAKgK,UAA4B,CACvF,MAAMsO,EAAUle,EAAMiD,OAAO8Q,GACvBoK,EAAiB,QAAR9P,EAAiB9L,EAAM,EAAI,OAAS,KAAOA,EAAM,EAAI,QAAU,OAC9E,OAAO6Z,EAAKgC,eAAeD,GAAUD,EAAU,IACjD,CACF,CACA,OAAO,IACT,CACA,SAASf,GAAUf,EAAM1K,GACvB,KAAOA,GAAOA,GAAO0K,EAAK1K,IAAKA,EAAMA,EAAI2M,WACvC,GAAoB,MAAhB3M,EAAI4M,UAAoC,MAAhB5M,EAAI4M,SAC9B,OAAO5M,EAGX,OAAO,IACT,CACA,SAAS6L,GAAenB,EAAMqB,GAC5B,MAAMc,EAAWnC,EAAKoC,YAAY,CAChCzQ,KAAM0P,EAAMgB,QACZzQ,IAAKyP,EAAMiB,UAEb,OAAKH,GAEEA,EAAWzK,EAAWsI,EAAK9U,MAAMrG,IAAIyD,QAAQ6Z,EAAShe,MADpD,IAEX,CAUA,IAAIoe,GAAY,MACd7e,YAAYoC,EAAM0c,GAChB1e,KAAKgC,KAAOA,EACZhC,KAAK0e,aAAeA,EACpB1e,KAAKwR,IAAMmN,SAASC,cAAc,OAClC5e,KAAKwR,IAAIqN,UAAY,eACrB7e,KAAKqP,MAAQrP,KAAKwR,IAAIsN,YAAYH,SAASC,cAAc,UACzD5e,KAAK+e,SAAW/e,KAAKqP,MAAMyP,YAAYH,SAASC,cAAc,aAC9DI,GAAsBhd,EAAMhC,KAAK+e,SAAU/e,KAAKqP,MAAOqP,GACvD1e,KAAKif,WAAajf,KAAKqP,MAAMyP,YAAYH,SAASC,cAAc,SAClE,CACAM,OAAOld,GACL,OAAIA,EAAKuB,MAAQvD,KAAKgC,KAAKuB,OAE3BvD,KAAKgC,KAAOA,EACZgd,GAAsBhd,EAAMhC,KAAK+e,SAAU/e,KAAKqP,MAAOrP,KAAK0e,eACrD,EACT,CACAS,eAAeC,GACb,MAAsB,cAAfA,EAAO7b,OAAyB6b,EAAO9S,QAAUtM,KAAKqP,OAASrP,KAAK+e,SAASM,SAASD,EAAO9S,QACtG,GAEF,SAAS0S,GAAsBhd,EAAM+c,EAAU1P,EAAOqP,EAAcY,EAAaC,GAC/E,IAAI1C,EACJ,IAAI2C,EAAa,EACbC,GAAa,EACbC,EAAUX,EAAS1K,WACvB,MAAMnF,EAAMlN,EAAKqS,WACjB,GAAKnF,EAAL,CAEA,IAAK,IAAItO,EAAI,EAAGuO,EAAM,EAAGvO,EAAIsO,EAAI7L,WAAYzC,IAAK,CAChD,MAAM,QAAEqP,EAAO,SAAEE,GAAajB,EAAI9I,MAAMxF,GAAGwP,MAC3C,IAAK,IAAI3E,EAAI,EAAGA,EAAIwE,EAASxE,IAAK0D,IAAO,CACvC,MAAMwQ,EAAWL,GAAenQ,EAAMoQ,EAAgBpP,GAAYA,EAAS1E,GACrEmU,EAAWD,EAAWA,EAAW,KAAO,GAC9CH,GAAcG,GAAYjB,EACrBiB,IACHF,GAAa,GACVC,GAGCA,EAAQG,MAAMrS,OAASoS,IACzBF,EAAQG,MAAMrS,MAAQoS,GACxBF,EAAUA,EAAQI,aAJlBf,EAASD,YAAYH,SAASC,cAAc,QAAQiB,MAAMrS,MAAQoS,CAMtE,CACF,CACA,MAAOF,EAAS,CACd,MAAM1c,EAAQ0c,EAAQI,YACO,OAA5BjD,EAAK6C,EAAQvB,aAA+BtB,EAAGkD,YAAYL,GAC5DA,EAAU1c,CACZ,CACIyc,GACFpQ,EAAMwQ,MAAMrS,MAAQgS,EAAa,KACjCnQ,EAAMwQ,MAAMG,SAAW,KAEvB3Q,EAAMwQ,MAAMrS,MAAQ,GACpB6B,EAAMwQ,MAAMG,SAAWR,EAAa,KA5B9B,CA8BV,CAGA,IAAIS,GAA0B,IAAI,KAChC,uBAEF,SAASC,IAAe,YACtBC,EAAc,EAAC,aACfzB,EAAe,GAAE,KACjB0B,EAAO3B,GAAS,oBAChB4B,GAAsB,GACpB,CAAC,GACH,MAAM7V,EAAS,IAAI,KAAO,CACxB1B,IAAKmX,GACL7Y,MAAO,CACLsC,KAAKR,EAAG9B,GAEN,OADAoD,EAAO9E,KAAKgH,MAAM4T,UAAU/M,EAAenM,EAAMwB,QAAQyG,MAAMhL,MAAQ,CAACrC,EAAMka,IAAS,IAAIkE,EAAKpe,EAAM0c,EAAcxC,GAC7G,IAAIqE,IAAa,GAAG,EAC7B,EACA5W,MAAMzI,EAAIiJ,GACR,OAAOA,EAAKR,MAAMzI,EACpB,GAEFwL,MAAO,CACL8T,WAAapZ,IACX,MAAMqZ,EAAcR,GAAwBrT,SAASxF,GACrD,OAAOqZ,GAAeA,EAAYC,cAAgB,EAAI,CAAEpJ,MAAO,iBAAoB,CAAC,CAAC,EAEvFqJ,gBAAiB,CACfC,UAAW,CAAC1E,EAAMqB,KAChBsD,GACE3E,EACAqB,EACA4C,EACAzB,EACA2B,EACD,EAEHS,WAAa5E,IACX6E,GAAiB7E,EAAK,EAExB8E,UAAW,CAAC9E,EAAMqB,KAChB0D,GAAiB/E,EAAMqB,EAAOmB,EAAa,GAG/CwC,YAAc9Z,IACZ,MAAMqZ,EAAcR,GAAwBrT,SAASxF,GACrD,GAAIqZ,GAAeA,EAAYC,cAAgB,EAC7C,OAAOS,GAAkB/Z,EAAOqZ,EAAYC,aAC9C,EAEFJ,UAAW,CAAC,KAGhB,OAAO9V,CACT,CACA,IAAI+V,GAAc,MAChB3gB,YAAY8gB,EAAcU,GACxBphB,KAAK0gB,aAAeA,EACpB1gB,KAAKohB,SAAWA,CAClB,CACAzX,MAAMzI,GACJ,MAAMkG,EAAQpH,KACRqhB,EAASngB,EAAG8H,QAAQiX,IAC1B,GAAIoB,GAA8B,MAApBA,EAAOC,UACnB,OAAO,IAAIf,GAAYc,EAAOC,WAAW,GAC3C,GAAID,QAAiC,IAAvBA,EAAOE,YACnB,OAAO,IAAIhB,GAAYnZ,EAAMsZ,aAAcW,EAAOE,aACpD,GAAIna,EAAMsZ,cAAgB,GAAKxf,EAAGsb,WAAY,CAC5C,IAAIgF,EAAStgB,EAAGO,QAAQE,IAAIyF,EAAMsZ,cAAe,GAIjD,OAHKnM,EAAarT,EAAGH,IAAIyD,QAAQgd,MAC/BA,GAAU,GAEL,IAAIjB,GAAYiB,EAAQpa,EAAMga,SACvC,CACA,OAAOha,CACT,GAEF,SAASyZ,GAAgB3E,EAAMqB,EAAO4C,EAAazB,EAAc2B,GAC/D,MAAMI,EAAcR,GAAwBrT,SAASsP,EAAK9U,OAC1D,GAAKqZ,IAEAA,EAAYW,SAAU,CACzB,MAAM9U,EAASmV,GAAclE,EAAMjR,QACnC,IAAI4E,GAAQ,EACZ,GAAI5E,EAAQ,CACV,MAAM,KAAEuB,EAAI,MAAEE,GAAUzB,EAAOoV,wBAC3BnE,EAAMgB,QAAU1Q,GAAQsS,EAC1BjP,EAAOyQ,GAASzF,EAAMqB,EAAO,QACtBxP,EAAQwP,EAAMgB,SAAW4B,IAChCjP,EAAOyQ,GAASzF,EAAMqB,EAAO,SACjC,CACA,GAAIrM,GAAQuP,EAAYC,aAAc,CACpC,IAAKL,IAAiC,IAAVnP,EAAa,CACvC,MAAMiD,EAAQ+H,EAAK9U,MAAMrG,IAAIyD,QAAQ0M,GAC/B7B,EAAQ8E,EAAMnS,MAAM,GACpBL,EAAM4L,EAASR,IAAIsC,GACnBuF,EAAaT,EAAM7D,OAAO,GAC1BnB,EAAMxN,EAAIsM,SAASkG,EAAM9T,IAAMuU,GAAcT,EAAMhP,UAAUiL,MAAMH,QAAU,EACnF,GAAId,GAAOxN,EAAI6L,MAAQ,EACrB,MAEJ,CACAoU,GAAa1F,EAAMhL,EACrB,CACF,CACF,CACA,SAAS6P,GAAiB7E,GACxB,MAAMuE,EAAcR,GAAwBrT,SAASsP,EAAK9U,OACtDqZ,GAAeA,EAAYC,cAAgB,IAAMD,EAAYW,UAC/DQ,GAAa1F,GAAO,EACxB,CACA,SAAS+E,GAAiB/E,EAAMqB,EAAOmB,GACrC,MAAM+B,EAAcR,GAAwBrT,SAASsP,EAAK9U,OAC1D,IAAKqZ,IAA4C,GAA7BA,EAAYC,cAAsBD,EAAYW,SAChE,OAAO,EACT,MAAMlQ,EAAOgL,EAAK9U,MAAMrG,IAAIoQ,OAAOsP,EAAYC,cACzClT,EAAQqU,GAAgB3F,EAAMuE,EAAYC,aAAcxP,EAAKd,OAMnE,SAAS0R,EAAOC,GACdC,OAAOrE,oBAAoB,UAAWmE,GACtCE,OAAOrE,oBAAoB,YAAaC,GACxC,MAAMqE,EAAehC,GAAwBrT,SAASsP,EAAK9U,QACvC,MAAhB6a,OAAuB,EAASA,EAAab,YAC/Cc,GACEhG,EACA+F,EAAavB,aACbyB,GAAaF,EAAab,SAAUW,EAAQrD,IAE9CxC,EAAKd,SACHc,EAAK9U,MAAMlG,GAAG2H,QAAQoX,GAAyB,CAAEsB,YAAa,QAGpE,CACA,SAAS3D,EAAKmE,GACZ,IAAKA,EAAOK,MACV,OAAON,EAAOC,GAChB,MAAME,EAAehC,GAAwBrT,SAASsP,EAAK9U,OAC3D,GAAK6a,GAEDA,EAAab,SAAU,CACzB,MAAMiB,EAAUF,GAAaF,EAAab,SAAUW,EAAQrD,GAC5D4D,GAAmBpG,EAAM+F,EAAavB,aAAc2B,EAAS3D,EAC/D,CACF,CAIA,OAlCAxC,EAAKd,SACHc,EAAK9U,MAAMlG,GAAG2H,QAAQoX,GAAyB,CAC7CsB,YAAa,CAAEgB,OAAQhF,EAAMgB,QAASiE,WAAYhV,MA6BtDwU,OAAOlE,iBAAiB,UAAWgE,GACnCE,OAAOlE,iBAAiB,YAAaF,GACrCL,EAAMH,kBACC,CACT,CACA,SAASyE,GAAgB3F,EAAM8B,GAAS,QAAE/N,EAAO,SAAEE,IACjD,MAAM3C,EAAQ2C,GAAYA,EAASA,EAAStP,OAAS,GACrD,GAAI2M,EACF,OAAOA,EACT,MAAMgE,EAAM0K,EAAKuG,SAASzE,GACpBhc,EAAOwP,EAAIxP,KAAK0gB,WAAWlR,EAAI8G,QACrC,IAAIqK,EAAW3gB,EAAK4gB,YAAaC,EAAQ5S,EACzC,GAAIE,EACF,IAAK,IAAIvP,EAAI,EAAGA,EAAIqP,EAASrP,IACvBuP,EAASvP,KACX+hB,GAAYxS,EAASvP,GACrBiiB,KAGN,OAAOF,EAAWE,CACpB,CACA,SAASpB,GAAcnV,GACrB,MAAOA,GAA6B,MAAnBA,EAAO8R,UAAuC,MAAnB9R,EAAO8R,SACjD9R,EAASA,EAAOwW,WAAaxW,EAAOwW,UAAUzD,SAAS,eAAiB,KAAO/S,EAAO6R,WACxF,OAAO7R,CACT,CACA,SAASqV,GAASzF,EAAMqB,EAAOhE,GAC7B,MAAMzW,EAAQoZ,EAAKoC,YAAY,CAAEzQ,KAAM0P,EAAMgB,QAASzQ,IAAKyP,EAAMiB,UACjE,IAAK1b,EACH,OAAQ,EACV,MAAM,IAAEzC,GAAQyC,EACVqR,EAAQP,EAAWsI,EAAK9U,MAAMrG,IAAIyD,QAAQnE,IAChD,IAAK8T,EACH,OAAQ,EACV,GAAY,SAARoF,EACF,OAAOpF,EAAM9T,IACf,MAAMsB,EAAM4L,EAASR,IAAIoH,EAAMnS,MAAM,IAAKsO,EAAQ6D,EAAM7D,OAAO,GACzD1N,EAAQjB,EAAIA,IAAIohB,QAAQ5O,EAAM9T,IAAMiQ,GAC1C,OAAO1N,EAAQjB,EAAI6L,OAAS,GAAK,EAAI8C,EAAQ3O,EAAIA,IAAIiB,EAAQ,EAC/D,CACA,SAASuf,GAAaf,EAAU7D,EAAOmB,GACrC,MAAMpG,EAASiF,EAAMgB,QAAU6C,EAASmB,OACxC,OAAOxT,KAAK5O,IAAIue,EAAc0C,EAASoB,WAAalK,EACtD,CACA,SAASsJ,GAAa1F,EAAMnT,GAC1BmT,EAAKd,SACHc,EAAK9U,MAAMlG,GAAG2H,QAAQoX,GAAyB,CAAEqB,UAAWvY,IAEhE,CACA,SAASmZ,GAAkBhG,EAAMhL,EAAM1D,GACrC,MAAM2G,EAAQ+H,EAAK9U,MAAMrG,IAAIyD,QAAQ0M,GAC/B7B,EAAQ8E,EAAMnS,MAAM,GAAIL,EAAM4L,EAASR,IAAIsC,GAAQiB,EAAQ6D,EAAM7D,OAAO,GACxEnB,EAAMxN,EAAIsM,SAASkG,EAAM9T,IAAMiQ,GAAS6D,EAAMhP,UAAUiL,MAAMH,QAAU,EACxE/O,EAAKgb,EAAK9U,MAAMlG,GACtB,IAAK,IAAIgO,EAAM,EAAGA,EAAMvN,EAAI8L,OAAQyB,IAAO,CACzC,MAAM8T,EAAW9T,EAAMvN,EAAI6L,MAAQ2B,EACnC,GAAID,GAAOvN,EAAIA,IAAIqhB,IAAarhB,EAAIA,IAAIqhB,EAAWrhB,EAAI6L,OACrD,SACF,MAAMnN,EAAMsB,EAAIA,IAAIqhB,GACd5S,EAAQf,EAAM8B,OAAO9Q,GAAK+P,MAC1BxN,EAAyB,GAAjBwN,EAAMH,QAAe,EAAId,EAAMxN,EAAIsM,SAAS5N,GAC1D,GAAI+P,EAAMD,UAAYC,EAAMD,SAASvN,IAAU4K,EAC7C,SACF,MAAM2C,EAAWC,EAAMD,SAAWC,EAAMD,SAASnP,QAAUiiB,GAAO7S,EAAMH,SACxEE,EAASvN,GAAS4K,EAClBtM,EAAGkY,cAAc9I,EAAQjQ,EAAK,KAAM,IAAK+P,EAAOD,YAClD,CACIjP,EAAGsb,YACLN,EAAKd,SAASla,EAClB,CACA,SAASohB,GAAmBpG,EAAMhL,EAAM1D,EAAOkR,GAC7C,MAAMvK,EAAQ+H,EAAK9U,MAAMrG,IAAIyD,QAAQ0M,GAC/B7B,EAAQ8E,EAAMnS,MAAM,GAAIsO,EAAQ6D,EAAM7D,OAAO,GAC7CnB,EAAM5B,EAASR,IAAIsC,GAAOpB,SAASkG,EAAM9T,IAAMiQ,GAAS6D,EAAMhP,UAAUiL,MAAMH,QAAU,EAC9F,IAAIuB,EAAM0K,EAAKuG,SAAStO,EAAM7D,OAAO,IAAItO,KACzC,MAAOwP,GAAuB,SAAhBA,EAAI4M,SAChB5M,EAAMA,EAAI2M,WAEP3M,GAELwN,GACE3P,EACAmC,EAAI6C,WACJ7C,EACAkN,EACAvP,EACA3B,EAEJ,CACA,SAASyV,GAAO1X,GACd,OAAO2X,MAAM3X,GAAG4X,KAAK,EACvB,CACA,SAAShC,GAAkB/Z,EAAO8J,GAChC,MAAMgQ,EAAc,GACd/M,EAAQ/M,EAAMrG,IAAIyD,QAAQ0M,GAC1B7B,EAAQ8E,EAAMnS,MAAM,GAC1B,IAAKqN,EACH,OAAO,WAET,MAAM1N,EAAM4L,EAASR,IAAIsC,GACnBiB,EAAQ6D,EAAM7D,OAAO,GACrBnB,EAAMxN,EAAIsM,SAASkG,EAAM9T,IAAMiQ,GAAS6D,EAAMhP,UAAUiL,MAAMH,QACpE,IAAK,IAAIf,EAAM,EAAGA,EAAMvN,EAAI8L,OAAQyB,IAAO,CACzC,MAAMtM,EAAQuM,EAAMD,EAAMvN,EAAI6L,MAAQ,EACtC,IAAK2B,GAAOxN,EAAI6L,OAAS7L,EAAIA,IAAIiB,IAAUjB,EAAIA,IAAIiB,EAAQ,MAAe,GAAPsM,GAAYvN,EAAIA,IAAIiB,EAAQ,IAAMjB,EAAIA,IAAIiB,EAAQ,EAAIjB,EAAI6L,QAAS,CACpI,MAAMwQ,EAAUrc,EAAIA,IAAIiB,GAClBvC,EAAMiQ,EAAQ0N,EAAU3O,EAAM8B,OAAO6M,GAAS3Y,SAAW,EACzDmM,EAAMmN,SAASC,cAAc,OACnCpN,EAAIqN,UAAY,uBAChBqC,EAAYzW,KAAK,WAAmBpK,EAAKmR,GAC3C,CACF,CACA,OAAO,YAAsBpK,EAAMrG,IAAKmgB,EAC1C,CAOA,SAASkC,GAAahc,GACpB,MAAMtB,EAAMsB,EAAMpB,UACZ5D,EAAO4R,EAAc5M,GACrBiI,EAAQjN,EAAKJ,MAAM,GACnB4S,EAAaxS,EAAKkO,OAAO,GACzB3O,EAAM4L,EAASR,IAAIsC,GACnBJ,EAAOnJ,aAAeuP,EAAgB1T,EAAIyM,YAC9CtI,EAAImO,YAAY5T,IAAMuU,EACtB9O,EAAIoO,UAAU7T,IAAMuU,GAClBjT,EAAIgM,SAASvL,EAAK/B,IAAMuU,GAC5B,MAAO,IAAK3F,EAAM2F,aAAYjT,MAAK0N,QACrC,CACA,SAASgU,GAAUniB,GAAI,IAAES,EAAG,WAAEiT,EAAU,MAAEvF,GAASF,GACjD,IAAImU,EAAYnU,EAAM,GAAK,EAAI,EAC3B+F,EAAevT,EAAK0N,EAAOF,EAAMmU,KACnCA,EAAmB,GAAPnU,GAAYA,GAAOxN,EAAI6L,MAAQ,KAAO,GAEpD,IAAK,IAAI0B,EAAM,EAAGA,EAAMvN,EAAI8L,OAAQyB,IAAO,CACzC,MAAMtM,EAAQsM,EAAMvN,EAAI6L,MAAQ2B,EAChC,GAAIA,EAAM,GAAKA,EAAMxN,EAAI6L,OAAS7L,EAAIA,IAAIiB,EAAQ,IAAMjB,EAAIA,IAAIiB,GAAQ,CACtE,MAAMvC,EAAMsB,EAAIA,IAAIiB,GACdsO,EAAO7B,EAAM8B,OAAO9Q,GAC1Ba,EAAGkY,cACDlY,EAAGO,QAAQE,IAAIiT,EAAavU,GAC5B,KACA4U,EAAW/D,EAAKd,MAAOjB,EAAMxN,EAAIsM,SAAS5N,KAE5C6O,GAAOgC,EAAKd,MAAMF,QAAU,CAC9B,KAAO,CACL,MAAM3M,EAAoB,MAAb+f,EAAoB/P,EAAelE,EAAM9L,KAAKqF,QAAQsI,KAAO7B,EAAM8B,OAAOxP,EAAIA,IAAIiB,EAAQ0gB,IAAY/f,KAC7GlD,EAAMsB,EAAIyN,WAAWF,EAAKC,EAAKE,GACrCnO,EAAGsY,OAAOtY,EAAGO,QAAQE,IAAIiT,EAAavU,GAAMkD,EAAKwG,gBACnD,CACF,CACA,OAAO7I,CACT,CACA,SAASqiB,GAAgBnc,EAAOgU,GAC9B,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMnM,EAAOmU,GAAahc,GAC1BgU,EAASiI,GAAUjc,EAAMlG,GAAI+N,EAAMA,EAAKpB,MAC1C,CACA,OAAO,CACT,CACA,SAAS2V,GAAepc,EAAOgU,GAC7B,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMnM,EAAOmU,GAAahc,GAC1BgU,EAASiI,GAAUjc,EAAMlG,GAAI+N,EAAMA,EAAKlB,OAC1C,CACA,OAAO,CACT,CACA,SAAS0V,GAAaviB,GAAI,IAAES,EAAG,MAAE0N,EAAK,WAAEuF,GAAczF,GACpD,MAAMuU,EAAWxiB,EAAGO,QAAQiF,KAAK7F,OACjC,IAAK,IAAIqO,EAAM,EAAGA,EAAMvN,EAAI8L,QAAU,CACpC,MAAM7K,EAAQsM,EAAMvN,EAAI6L,MAAQ2B,EAC1B9O,EAAMsB,EAAIA,IAAIiB,GACdsO,EAAO7B,EAAM8B,OAAO9Q,GACpB+P,EAAQc,EAAKd,MACnB,GAAIjB,EAAM,GAAKxN,EAAIA,IAAIiB,EAAQ,IAAMvC,GAAO8O,EAAMxN,EAAI6L,MAAQ,GAAK7L,EAAIA,IAAIiB,EAAQ,IAAMvC,EACvFa,EAAGkY,cACDlY,EAAGO,QAAQT,MAAM0iB,GAAU/hB,IAAIiT,EAAavU,GAC5C,KACAyU,EAAc1E,EAAOjB,EAAMxN,EAAIsM,SAAS5N,SAErC,CACL,MAAMiQ,EAAQpP,EAAGO,QAAQT,MAAM0iB,GAAU/hB,IAAIiT,EAAavU,GAC1Da,EAAG2E,OAAOyK,EAAOA,EAAQY,EAAK7L,SAChC,CACA6J,GAAOkB,EAAMF,OACf,CACF,CACA,SAASyT,GAAavc,EAAOgU,GAC3B,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMnM,EAAOmU,GAAahc,GACpBlG,EAAKkG,EAAMlG,GACjB,GAAiB,GAAb+N,EAAKpB,MAAaoB,EAAKlB,OAASkB,EAAKtN,IAAI6L,MAC3C,OAAO,EACT,IAAK,IAAI5M,EAAIqO,EAAKlB,MAAQ,GAAKnN,IAAK,CAElC,GADA6iB,GAAaviB,EAAI+N,EAAMrO,GACnBA,GAAKqO,EAAKpB,KACZ,MACF,MAAMwB,EAAQJ,EAAK2F,WAAa1T,EAAGH,IAAIoQ,OAAOlC,EAAK2F,WAAa,GAAK1T,EAAGH,IACxE,IAAKsO,EACH,MAAM7L,WAAW,kBAEnByL,EAAKI,MAAQA,EACbJ,EAAKtN,IAAM4L,EAASR,IAAIsC,EAC1B,CACA+L,EAASla,EACX,CACA,OAAO,CACT,CACA,SAAS0iB,GAAYjiB,EAAK0N,EAAOH,GAC/B,IAAI2N,EACJ,MAAM1H,EAAa5B,EAAelE,EAAM9L,KAAKqF,QAAQwM,YACrD,IAAK,IAAIjG,EAAM,EAAGA,EAAMxN,EAAI6L,MAAO2B,IACjC,IAA4D,OAAtD0N,EAAKxN,EAAM8B,OAAOxP,EAAIA,IAAIwN,EAAMD,EAAMvN,EAAI6L,cAAmB,EAASqP,EAAGtZ,OAAS4R,EACtF,OAAO,EACX,OAAO,CACT,CACA,SAAS0O,GAAO3iB,GAAI,IAAES,EAAG,WAAEiT,EAAU,MAAEvF,GAASH,GAC9C,IAAI2N,EACJ,IAAIiH,EAASlP,EACb,IAAK,IAAIhU,EAAI,EAAGA,EAAIsO,EAAKtO,IACvBkjB,GAAUzU,EAAMjJ,MAAMxF,GAAGyE,SAC3B,MAAMiQ,EAAQ,GACd,IAAIyO,EAAS7U,EAAM,GAAK,EAAI,EACxB0U,GAAYjiB,EAAK0N,EAAOH,EAAM6U,KAChCA,EAAgB,GAAP7U,GAAYA,GAAOvN,EAAI8L,OAAS,KAAO,GAClD,IAAK,IAAI0B,EAAM,EAAGvM,EAAQjB,EAAI6L,MAAQ0B,EAAKC,EAAMxN,EAAI6L,MAAO2B,IAAOvM,IACjE,GAAIsM,EAAM,GAAKA,EAAMvN,EAAI8L,QAAU9L,EAAIA,IAAIiB,IAAUjB,EAAIA,IAAIiB,EAAQjB,EAAI6L,OAAQ,CAC/E,MAAMnN,EAAMsB,EAAIA,IAAIiB,GACdwN,EAAQf,EAAM8B,OAAO9Q,GAAK+P,MAChClP,EAAGkY,cAAcxE,EAAavU,EAAK,KAAM,IACpC+P,EACHF,QAASE,EAAMF,QAAU,IAE3Bf,GAAOiB,EAAMH,QAAU,CACzB,KAAO,CACL,MAAM1M,EAAiB,MAAVwgB,EAAiBxQ,EAAelE,EAAM9L,KAAKqF,QAAQsI,KAAmE,OAA3D2L,EAAKxN,EAAM8B,OAAOxP,EAAIA,IAAIiB,EAAQmhB,EAASpiB,EAAI6L,cAAmB,EAASqP,EAAGtZ,KAChJvB,EAAe,MAARuB,OAAe,EAASA,EAAKwG,gBACtC/H,GACFsT,EAAM7K,KAAKzI,EACf,CAGF,OADAd,EAAGsY,OAAOsK,EAAQvQ,EAAelE,EAAM9L,KAAKqF,QAAQsG,IAAIxP,OAAO,KAAM4V,IAC9DpU,CACT,CACA,SAAS8iB,GAAa5c,EAAOgU,GAC3B,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMnM,EAAOmU,GAAahc,GAC1BgU,EAASyI,GAAOzc,EAAMlG,GAAI+N,EAAMA,EAAKnB,KACvC,CACA,OAAO,CACT,CACA,SAASmW,GAAY7c,EAAOgU,GAC1B,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMnM,EAAOmU,GAAahc,GAC1BgU,EAASyI,GAAOzc,EAAMlG,GAAI+N,EAAMA,EAAKjB,QACvC,CACA,OAAO,CACT,CACA,SAASkW,GAAUhjB,GAAI,IAAES,EAAG,MAAE0N,EAAK,WAAEuF,GAAc1F,GACjD,IAAI4U,EAAS,EACb,IAAK,IAAIljB,EAAI,EAAGA,EAAIsO,EAAKtO,IACvBkjB,GAAUzU,EAAMjJ,MAAMxF,GAAGyE,SAC3B,MAAM8e,EAAUL,EAASzU,EAAMjJ,MAAM8I,GAAK7J,SACpC9D,EAAUL,EAAGO,QAAQiF,KAAK7F,OAChCK,EAAG2E,OAAOie,EAASlP,EAAYuP,EAAUvP,GACzC,IAAK,IAAIzF,EAAM,EAAGvM,EAAQsM,EAAMvN,EAAI6L,MAAO2B,EAAMxN,EAAI6L,MAAO2B,IAAOvM,IAAS,CAC1E,MAAMvC,EAAMsB,EAAIA,IAAIiB,GACpB,GAAIsM,EAAM,GAAK7O,GAAOsB,EAAIA,IAAIiB,EAAQjB,EAAI6L,OAAQ,CAChD,MAAM4C,EAAQf,EAAM8B,OAAO9Q,GAAK+P,MAChClP,EAAGkY,cAAclY,EAAGO,QAAQT,MAAMO,GAASI,IAAItB,EAAMuU,GAAa,KAAM,IACnExE,EACHF,QAASE,EAAMF,QAAU,IAE3Bf,GAAOiB,EAAMH,QAAU,CACzB,MAAO,GAAIf,EAAMvN,EAAI6L,OAASnN,GAAOsB,EAAIA,IAAIiB,EAAQjB,EAAI6L,OAAQ,CAC/D,MAAM0D,EAAO7B,EAAM8B,OAAO9Q,GACpB+P,EAAQc,EAAKd,MACbiG,EAAOnF,EAAK3N,KAAK7D,OACrB,IAAK0Q,EAAOF,QAASgB,EAAKd,MAAMF,QAAU,GAC1CgB,EAAKpQ,SAEDsjB,EAASziB,EAAIyN,WAAWF,EAAM,EAAGC,EAAKE,GAC5CnO,EAAGsY,OAAOtY,EAAGO,QAAQT,MAAMO,GAASI,IAAIiT,EAAawP,GAAS/N,GAC9DlH,GAAOiB,EAAMH,QAAU,CACzB,CACF,CACF,CACA,SAASoU,GAAUjd,EAAOgU,GACxB,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMnM,EAAOmU,GAAahc,GAAQlG,EAAKkG,EAAMlG,GAC7C,GAAgB,GAAZ+N,EAAKnB,KAAYmB,EAAKjB,QAAUiB,EAAKtN,IAAI8L,OAC3C,OAAO,EACT,IAAK,IAAI7M,EAAIqO,EAAKjB,OAAS,GAAKpN,IAAK,CAEnC,GADAsjB,GAAUhjB,EAAI+N,EAAMrO,GAChBA,GAAKqO,EAAKnB,IACZ,MACF,MAAMuB,EAAQJ,EAAK2F,WAAa1T,EAAGH,IAAIoQ,OAAOlC,EAAK2F,WAAa,GAAK1T,EAAGH,IACxE,IAAKsO,EACH,MAAM7L,WAAW,kBAEnByL,EAAKI,MAAQA,EACbJ,EAAKtN,IAAM4L,EAASR,IAAIkC,EAAKI,MAC/B,CACA+L,EAASla,EACX,CACA,OAAO,CACT,CACA,SAASojB,GAAQpT,GACf,MAAMqT,EAAIrT,EAAKpQ,QACf,OAAuB,GAAhByjB,EAAElhB,YAAmBkhB,EAAEne,MAAM,GAAGtE,aAAwC,GAAzByiB,EAAEne,MAAM,GAAG/C,UACnE,CACA,SAASmhB,IAAsB,MAAEhX,EAAK,OAAEC,EAAM,IAAE9L,GAAOsN,GACrD,IAAIwV,EAAWxV,EAAKnB,IAAMN,EAAQyB,EAAKpB,KAAM6W,EAAYD,EACrDE,GAAe1V,EAAKjB,OAAS,GAAKR,EAAQyB,EAAKpB,KAAM+W,EAAaH,GAAYxV,EAAKlB,MAAQkB,EAAKpB,KAAO,GAC3G,IAAK,IAAIjN,EAAIqO,EAAKnB,IAAKlN,EAAIqO,EAAKjB,OAAQpN,IAAK,CAC3C,GAAIqO,EAAKpB,KAAO,GAAKlM,EAAI+iB,IAAc/iB,EAAI+iB,EAAY,IAAMzV,EAAKlB,MAAQP,GAAS7L,EAAIijB,IAAejjB,EAAIijB,EAAa,GACrH,OAAO,EACTF,GAAalX,EACboX,GAAcpX,CAChB,CACA,IAAK,IAAI5M,EAAIqO,EAAKpB,KAAMjN,EAAIqO,EAAKlB,MAAOnN,IAAK,CAC3C,GAAIqO,EAAKnB,IAAM,GAAKnM,EAAI8iB,IAAa9iB,EAAI8iB,EAAWjX,IAAUyB,EAAKjB,OAASP,GAAU9L,EAAIgjB,IAAgBhjB,EAAIgjB,EAAcnX,GAC1H,OAAO,EACTiX,IACAE,GACF,CACA,OAAO,CACT,CACA,SAASE,GAAWzd,EAAOgU,GACzB,MAAMtV,EAAMsB,EAAMpB,UAClB,KAAMF,aAAeuP,IAAkBvP,EAAImO,YAAY5T,KAAOyF,EAAIoO,UAAU7T,IAC1E,OAAO,EACT,MAAM4O,EAAOmU,GAAahc,IAAQ,IAAEzF,GAAQsN,EAC5C,GAAIuV,GAAsB7iB,EAAKsN,GAC7B,OAAO,EACT,GAAImM,EAAU,CACZ,MAAMla,EAAKkG,EAAMlG,GACXkK,EAAO,CAAC,EACd,IACI0Z,EACAC,EAFAjkB,EAAU,WAGd,IAAK,IAAIoO,EAAMD,EAAKnB,IAAKoB,EAAMD,EAAKjB,OAAQkB,IAC1C,IAAK,IAAIC,EAAMF,EAAKpB,KAAMsB,EAAMF,EAAKlB,MAAOoB,IAAO,CACjD,MAAM6O,EAAUrc,EAAIA,IAAIuN,EAAMvN,EAAI6L,MAAQ2B,GACpC+B,EAAOjC,EAAKI,MAAM8B,OAAO6M,GAC/B,IAAI5S,EAAK4S,IAAa9M,EAGtB,GADA9F,EAAK4S,IAAW,EACC,MAAb8G,EACFA,EAAY9G,EACZ+G,EAAa7T,MACR,CACAoT,GAAQpT,KACXpQ,EAAUA,EAAQgZ,OAAO5I,EAAKpQ,UAChC,MAAMkkB,EAAS9jB,EAAGO,QAAQE,IAAIqc,EAAU/O,EAAK2F,YAC7C1T,EAAG2E,OAAOmf,EAAQA,EAAS9T,EAAK7L,SAClC,CACF,CAEF,GAAiB,MAAbyf,GAAmC,MAAdC,EACvB,OAAO,EAUT,GARA7jB,EAAGkY,cAAc0L,EAAY7V,EAAK2F,WAAY,KAAM,IAC/CK,EACD8P,EAAW3U,MACX2U,EAAW3U,MAAMH,QACjBhB,EAAKlB,MAAQkB,EAAKpB,KAAOkX,EAAW3U,MAAMH,SAE5CC,QAASjB,EAAKjB,OAASiB,EAAKnB,MAE1BhN,EAAQsC,KAAM,CAChB,MAAMqD,EAAMqe,EAAY,EAAIC,EAAWjkB,QAAQsC,KACzCkN,EAAQgU,GAAQS,GAAcD,EAAY,EAAIre,EACpDvF,EAAGa,YAAYuO,EAAQrB,EAAK2F,WAAYnO,EAAMwI,EAAK2F,WAAY9T,EACjE,CACAI,EAAG+E,aACD,IAAIoP,EAAcnU,EAAGH,IAAIyD,QAAQsgB,EAAY7V,EAAK2F,cAEpDwG,EAASla,EACX,CACA,OAAO,CACT,CACA,SAAS+jB,GAAU7d,EAAOgU,GACxB,MAAM8J,EAAY3R,EAAenM,EAAMwB,QACvC,OAAOuc,IAAkB,EAAGnjB,UACnBkjB,EAAUljB,EAAKuB,KAAKmC,KAAKgK,YAD3ByV,CAEJ/d,EAAOgU,EACZ,CACA,SAAS+J,GAAkBC,GACzB,MAAO,CAAChe,EAAOgU,KACb,IAAIyB,EACJ,MAAM/W,EAAMsB,EAAMpB,UAClB,IAAIgK,EACAgO,EACJ,GAAMlY,aAAeuP,EAKd,CACL,GAAIvP,EAAImO,YAAY5T,KAAOyF,EAAIoO,UAAU7T,IACvC,OAAO,EACT2P,EAAWlK,EAAImO,YAAY9O,UAC3B6Y,EAAUlY,EAAImO,YAAY5T,GAC5B,KAVqC,CAEnC,GADA2P,EAAW8D,EAAahO,EAAItF,QACvBwP,EACH,OAAO,EACTgO,EAA0C,OAA/BnB,EAAKjJ,EAAW9N,EAAItF,aAAkB,EAASqc,EAAGxc,GAC/D,CAMA,GAAgB,MAAZ2P,GAA+B,MAAXgO,EACtB,OAAO,EAET,GAA8B,GAA1BhO,EAASI,MAAMH,SAA0C,GAA1BD,EAASI,MAAMF,QAChD,OAAO,EAET,GAAIkL,EAAU,CACZ,IAAIiK,EAAYrV,EAASI,MACzB,MAAMA,EAAQ,GACRD,EAAWkV,EAAUlV,SACvBkV,EAAUnV,QAAU,IACtBmV,EAAY,IAAKA,EAAWnV,QAAS,IACnCmV,EAAUpV,QAAU,IACtBoV,EAAY,IAAKA,EAAWpV,QAAS,IACvC,MAAMhB,EAAOmU,GAAahc,GAAQlG,EAAKkG,EAAMlG,GAC7C,IAAK,IAAIN,EAAI,EAAGA,EAAIqO,EAAKlB,MAAQkB,EAAKpB,KAAMjN,IAC1CwP,EAAM3F,KACJ0F,EAAW,IACNkV,EACHlV,SAAUA,GAAYA,EAASvP,GAAK,CAACuP,EAASvP,IAAM,MAClDykB,GAER,IAAIpN,EACJ,IAAK,IAAI/I,EAAMD,EAAKnB,IAAKoB,EAAMD,EAAKjB,OAAQkB,IAAO,CACjD,IAAI7O,EAAM4O,EAAKtN,IAAIyN,WAAWF,EAAKD,EAAKpB,KAAMoB,EAAKI,OAC/CH,GAAOD,EAAKnB,MACdzN,GAAO2P,EAAS3K,UAClB,IAAK,IAAI8J,EAAMF,EAAKpB,KAAMjN,EAAI,EAAGuO,EAAMF,EAAKlB,MAAOoB,IAAOvO,IACpDuO,GAAOF,EAAKpB,MAAQqB,GAAOD,EAAKnB,KAEpC5M,EAAGsY,OACDvB,EAAW/W,EAAGO,QAAQE,IAAItB,EAAM4O,EAAK2F,WAAY,GACjDwQ,EAAY,CAAEpjB,KAAMgO,EAAUd,MAAKC,QAAOpF,cAAcqG,EAAMxP,IAGpE,CACAM,EAAGkY,cACD4E,EACAoH,EAAY,CAAEpjB,KAAMgO,EAAUd,IAAKD,EAAKnB,IAAKqB,IAAKF,EAAKpB,OACvDuC,EAAM,IAEJtK,aAAeuP,GACjBnU,EAAG+E,aACD,IAAIoP,EACFnU,EAAGH,IAAIyD,QAAQsB,EAAImO,YAAY5T,KAC/B4X,EAAW/W,EAAGH,IAAIyD,QAAQyT,QAAY,IAG5CmD,EAASla,EACX,CACA,OAAO,CAAI,CAEf,CACA,SAASokB,GAAYjhB,EAAM0E,GACzB,OAAO,SAAS3B,EAAOgU,GACrB,IAAKrH,EAAU3M,GACb,OAAO,EACT,MAAM+M,EAAQH,EAAc5M,GAC5B,GAAI+M,EAAMhP,UAAUiL,MAAM/L,KAAU0E,EAClC,OAAO,EACT,GAAIqS,EAAU,CACZ,MAAMla,EAAKkG,EAAMlG,GACbkG,EAAMpB,qBAAqBqP,EAC7BjO,EAAMpB,UAAUuQ,aAAY,CAACvU,EAAM3B,KAC7B2B,EAAKoO,MAAM/L,KAAU0E,GACvB7H,EAAGkY,cAAc/Y,EAAK,KAAM,IACvB2B,EAAKoO,MACR,CAAC/L,GAAO0E,GACR,IAGN7H,EAAGkY,cAAcjF,EAAM9T,IAAK,KAAM,IAC7B8T,EAAMhP,UAAUiL,MACnB,CAAC/L,GAAO0E,IAEZqS,EAASla,EACX,CACA,OAAO,CACT,CACF,CACA,SAASqkB,GAAwBhiB,GAC/B,OAAO,SAAS6D,EAAOgU,GACrB,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMX,EAAQlH,EAAenM,EAAMwB,QAC7BqG,EAAOmU,GAAahc,GAAQlG,EAAKkG,EAAMlG,GACvCoU,EAAQrG,EAAKtN,IAAIqN,YACb,UAARzL,EAAmB,CACjBsK,KAAMoB,EAAKpB,KACXC,IAAK,EACLC,MAAOkB,EAAKlB,MACZC,OAAQiB,EAAKtN,IAAI8L,QACP,OAARlK,EAAgB,CAClBsK,KAAM,EACNC,IAAKmB,EAAKnB,IACVC,MAAOkB,EAAKtN,IAAI6L,MAChBQ,OAAQiB,EAAKjB,QACXiB,GAEAwE,EAAQ6B,EAAM3T,KAAKtB,GAAQ4O,EAAKI,MAAM8B,OAAO9Q,KACnD,IAAK,IAAIO,EAAI,EAAGA,EAAI0U,EAAMzU,OAAQD,IAC5B6S,EAAM7S,GAAG2C,MAAQkX,EAAMrF,aACzBlU,EAAGkY,cACDnK,EAAK2F,WAAaU,EAAM1U,GACxB6Z,EAAMvJ,KACNuC,EAAM7S,GAAGwP,OAEf,GAAuB,GAAnBlP,EAAGM,MAAMX,OACX,IAAK,IAAID,EAAI,EAAGA,EAAI0U,EAAMzU,OAAQD,IAChCM,EAAGkY,cACDnK,EAAK2F,WAAaU,EAAM1U,GACxB6Z,EAAMrF,YACN3B,EAAM7S,GAAGwP,OAEfgL,EAASla,EACX,CACA,OAAO,CACT,CACF,CACA,SAASskB,GAAsBjiB,EAAM0L,EAAMwL,GACzC,MAAMgL,EAAgBxW,EAAKtN,IAAIqN,YAAY,CACzCnB,KAAM,EACNC,IAAK,EACLC,MAAe,OAARxK,EAAgB0L,EAAKtN,IAAI6L,MAAQ,EACxCQ,OAAgB,UAARzK,EAAmB0L,EAAKtN,IAAI8L,OAAS,IAE/C,IAAK,IAAI7M,EAAI,EAAGA,EAAI6kB,EAAc5kB,OAAQD,IAAK,CAC7C,MAAMsQ,EAAOjC,EAAKI,MAAM8B,OAAOsU,EAAc7kB,IAC7C,GAAIsQ,GAAQA,EAAK3N,OAASkX,EAAMrF,YAC9B,OAAO,CAEX,CACA,OAAO,CACT,CACA,SAASsQ,GAAaniB,EAAMiP,GAE1B,OADAA,EAAUA,GAAW,CAAEmT,oBAAoB,GACvCnT,EAAQmT,mBACHJ,GAAwBhiB,GAC1B,SAAS6D,EAAOgU,GACrB,IAAKrH,EAAU3M,GACb,OAAO,EACT,GAAIgU,EAAU,CACZ,MAAMX,EAAQlH,EAAenM,EAAMwB,QAC7BqG,EAAOmU,GAAahc,GAAQlG,EAAKkG,EAAMlG,GACvC0kB,EAAqBJ,GAAsB,MAAOvW,EAAMwL,GACxDoL,EAAwBL,GAC5B,SACAvW,EACAwL,GAEIqL,EAA2B,WAATviB,EAAoBqiB,EAA8B,QAATriB,GAAiBsiB,EAC5EE,EAAoBD,EAAkB,EAAI,EAC1CE,EAAoB,UAARziB,EAAmB,CACnCsK,KAAM,EACNC,IAAKiY,EACLhY,MAAO,EACPC,OAAQiB,EAAKtN,IAAI8L,QACP,OAARlK,EAAgB,CAClBsK,KAAMkY,EACNjY,IAAK,EACLC,MAAOkB,EAAKtN,IAAI6L,MAChBQ,OAAQ,GACNiB,EACEgX,EAAkB,UAAR1iB,EAAmBsiB,EAAwBpL,EAAMvJ,KAAOuJ,EAAMrF,YAAsB,OAAR7R,EAAgBqiB,EAAqBnL,EAAMvJ,KAAOuJ,EAAMrF,YAAcqF,EAAMvJ,KACxKjC,EAAKtN,IAAIqN,YAAYgX,GAAWrf,SAASuf,IACvC,MAAMlI,EAAUkI,EAAkBjX,EAAK2F,WACjC1D,EAAOhQ,EAAGH,IAAIoQ,OAAO6M,GACvB9M,GACFhQ,EAAGkY,cAAc4E,EAASiI,EAAS/U,EAAKd,MAC1C,IAEFgL,EAASla,EACX,CACA,OAAO,CACT,CACF,CACA,IAAIilB,GAAkBT,GAAa,MAAO,CACxCC,oBAAoB,IAElBS,GAAqBV,GAAa,SAAU,CAC9CC,oBAAoB,IAElBU,GAAmBX,GAAa,OAAQ,CAC1CC,oBAAoB,IAEtB,SAASW,GAAanS,EAAO9R,GAC3B,GAAIA,EAAM,EAAG,CACX,MAAMU,EAASoR,EAAMG,WACrB,GAAIvR,EACF,OAAOoR,EAAM9T,IAAM0C,EAAOsC,SAC5B,IAAK,IAAI6J,EAAMiF,EAAMvR,OAAO,GAAK,EAAG2M,EAAS4E,EAAMpR,SAAUmM,GAAO,EAAGA,IAAO,CAC5E,MAAMa,EAAUoE,EAAMnS,MAAM,GAAGoE,MAAM8I,GAC/B9N,EAAY2O,EAAQ3O,UAC1B,GAAIA,EACF,OAAOmO,EAAS,EAAInO,EAAUiE,SAEhCkK,GAAUQ,EAAQ1K,QACpB,CACF,KAAO,CACL,GAAI8O,EAAMvR,QAAUuR,EAAM3R,OAAOa,WAAa,EAC5C,OAAO8Q,EAAM9T,IAAM8T,EAAMhP,UAAUE,SAErC,MAAMgK,EAAQ8E,EAAMnS,MAAM,GAC1B,IAAK,IAAIkN,EAAMiF,EAAM4J,YAAY,GAAIzO,EAAW6E,EAAMnR,QAASkM,EAAMG,EAAMhM,WAAY6L,IAAO,CAC5F,MAAMa,EAAUV,EAAMjJ,MAAM8I,GAC5B,GAAIa,EAAQ1M,WACV,OAAOiM,EAAW,EACpBA,GAAYS,EAAQ1K,QACtB,CACF,CACA,OAAO,IACT,CACA,SAASkhB,GAAaC,GACpB,OAAO,SAASpf,EAAOgU,GACrB,IAAKrH,EAAU3M,GACb,OAAO,EACT,MAAM8J,EAAOoV,GAAatS,EAAc5M,GAAQof,GAChD,GAAY,MAARtV,EACF,OAAO,EACT,GAAIkK,EAAU,CACZ,MAAMjH,EAAQ/M,EAAMrG,IAAIyD,QAAQ0M,GAChCkK,EACEhU,EAAMlG,GAAG+E,aAAa,aAAuBkO,EAAOK,EAAgBL,KAAShL,iBAEjF,CACA,OAAO,CACT,CACF,CACA,SAASsd,GAAYrf,EAAOgU,GAC1B,MAAMhZ,EAAOgF,EAAMpB,UAAUnG,QAC7B,IAAK,IAAIgU,EAAIzR,EAAKS,MAAOgR,EAAI,EAAGA,IAAK,CACnC,MAAM7R,EAAOI,EAAKJ,KAAK6R,GACvB,GAAgC,SAA5B7R,EAAKuB,KAAKmC,KAAKgK,UAKjB,OAJI0L,GACFA,EACEhU,EAAMlG,GAAG2E,OAAOzD,EAAKW,OAAO8Q,GAAIzR,EAAKY,MAAM6Q,IAAI1K,mBAE5C,CAEX,CACA,OAAO,CACT,CAGA,SAASud,IAAa,wBACpB3O,GAA0B,GACxB,CAAC,GACH,OAAO,IAAI,KAAQ,CACjBjP,IAAK6K,EACLvM,MAAO,CACLsC,OACE,OAAO,IACT,EACAC,MAAMzI,EAAImX,GACR,MAAMjL,EAAMlM,EAAG8H,QAAQ2K,GACvB,GAAW,MAAPvG,EACF,OAAe,GAARA,EAAY,KAAOA,EAC5B,GAAW,MAAPiL,IAAgBnX,EAAGsb,WACrB,OAAOnE,EACT,MAAM,QAAE/S,EAAO,IAAEjF,GAAQa,EAAGO,QAAQ8D,UAAU8S,GAC9C,OAAO/S,EAAU,KAAOjF,CAC1B,GAEFqM,MAAO,CACLwU,YAAa7J,EACbsJ,gBAAiB,CACfK,UAAWrE,IAEbgK,uBAAuBzK,GACrB,OAA+C,MAAxCvI,EAAgB/G,SAASsP,EAAK9U,OAAiB8U,EAAK9U,MAAMpB,UAAY,IAC/E,EACAyW,qBACAlB,gBACAmB,gBAEFpR,kBAAkBpC,EAAGsC,EAAUpE,GAC7B,OAAO0Q,EACL1Q,EACAyR,EAAUzR,EAAOoE,GACjBuM,EAEJ,GAEJ,C,+RCzxEA,MAAM6O,EAAU,MACVC,EAAW9X,KAAK+X,IAAI,EAAG,IAC7B,SAASC,EAAYnkB,EAAO0V,GAAU,OAAO1V,EAAQ0V,EAASuO,CAAU,CACxE,SAASG,EAAaje,GAAS,OAAOA,EAAQ6d,CAAS,CACvD,SAASK,EAAcle,GAAS,OAAQA,GAASA,EAAQ6d,IAAYC,CAAU,CAC/E,MAAMK,EAAa,EAAGC,EAAY,EAAGC,EAAa,EAAGC,EAAW,EAKhE,MAAMC,EAIF1nB,YAIAS,EAIAknB,EAIAC,GACIxnB,KAAKK,IAAMA,EACXL,KAAKunB,QAAUA,EACfvnB,KAAKwnB,QAAUA,CACnB,CAMIliB,cAAY,OAAQtF,KAAKunB,QAAUF,GAAY,CAAG,CAIlDI,oBAAkB,OAAQznB,KAAKunB,SAAWL,EAAaE,IAAe,CAAG,CAIzEM,mBAAiB,OAAQ1nB,KAAKunB,SAAWJ,EAAYC,IAAe,CAAG,CAMvEO,oBAAkB,OAAQ3nB,KAAKunB,QAAUH,GAAc,CAAG,EAQlE,MAAMQ,EAMFhoB,YAIAG,EAIA8nB,GAAW,GAGP,GAFA7nB,KAAKD,OAASA,EACdC,KAAK6nB,SAAWA,GACX9nB,EAAOc,QAAU+mB,EAAQjnB,MAC1B,OAAOinB,EAAQjnB,KACvB,CAIA6mB,QAAQze,GACJ,IAAI+e,EAAO,EAAGllB,EAAQokB,EAAaje,GACnC,IAAK/I,KAAK6nB,SACN,IAAK,IAAIjnB,EAAI,EAAGA,EAAIgC,EAAOhC,IACvBknB,GAAQ9nB,KAAKD,OAAW,EAAJa,EAAQ,GAAKZ,KAAKD,OAAW,EAAJa,EAAQ,GAC7D,OAAOZ,KAAKD,OAAe,EAAR6C,GAAaklB,EAAOb,EAAcle,EACzD,CACAxD,UAAUlF,EAAK0nB,EAAQ,GAAK,OAAO/nB,KAAKgoB,KAAK3nB,EAAK0nB,GAAO,EAAQ,CACjEpmB,IAAItB,EAAK0nB,EAAQ,GAAK,OAAO/nB,KAAKgoB,KAAK3nB,EAAK0nB,GAAO,EAAO,CAI1DC,KAAK3nB,EAAK0nB,EAAOE,GACb,IAAIH,EAAO,EAAGI,EAAWloB,KAAK6nB,SAAW,EAAI,EAAGM,EAAWnoB,KAAK6nB,SAAW,EAAI,EAC/E,IAAK,IAAIjnB,EAAI,EAAGA,EAAIZ,KAAKD,OAAOc,OAAQD,GAAK,EAAG,CAC5C,IAAI0P,EAAQtQ,KAAKD,OAAOa,IAAMZ,KAAK6nB,SAAWC,EAAO,GACrD,GAAIxX,EAAQjQ,EACR,MACJ,IAAIkY,EAAUvY,KAAKD,OAAOa,EAAIsnB,GAAWE,EAAUpoB,KAAKD,OAAOa,EAAIunB,GAAW1hB,EAAM6J,EAAQiI,EAC5F,GAAIlY,GAAOoG,EAAK,CACZ,IAAI8S,EAAQhB,EAAkBlY,GAAOiQ,GAAS,EAAIjQ,GAAOoG,EAAM,EAAIshB,EAA7CA,EAClB/b,EAASsE,EAAQwX,GAAQvO,EAAO,EAAI,EAAI6O,GAC5C,GAAIH,EACA,OAAOjc,EACX,IAAIwb,EAAUnnB,IAAQ0nB,EAAQ,EAAIzX,EAAQ7J,GAAO,KAAOsgB,EAAYnmB,EAAI,EAAGP,EAAMiQ,GAC7E+X,EAAMhoB,GAAOiQ,EAAQ6W,EAAY9mB,GAAOoG,EAAMygB,EAAaE,EAG/D,OAFIW,EAAQ,EAAI1nB,GAAOiQ,EAAQjQ,GAAOoG,KAClC4hB,GAAOhB,GACJ,IAAIC,EAAUtb,EAAQqc,EAAKb,EACtC,CACAM,GAAQM,EAAU7P,CACtB,CACA,OAAO0P,EAAS5nB,EAAMynB,EAAO,IAAIR,EAAUjnB,EAAMynB,EAAM,EAAG,KAC9D,CAIAQ,QAAQjoB,EAAKmnB,GACT,IAAIM,EAAO,EAAGllB,EAAQokB,EAAaQ,GAC/BU,EAAWloB,KAAK6nB,SAAW,EAAI,EAAGM,EAAWnoB,KAAK6nB,SAAW,EAAI,EACrE,IAAK,IAAIjnB,EAAI,EAAGA,EAAIZ,KAAKD,OAAOc,OAAQD,GAAK,EAAG,CAC5C,IAAI0P,EAAQtQ,KAAKD,OAAOa,IAAMZ,KAAK6nB,SAAWC,EAAO,GACrD,GAAIxX,EAAQjQ,EACR,MACJ,IAAIkY,EAAUvY,KAAKD,OAAOa,EAAIsnB,GAAWzhB,EAAM6J,EAAQiI,EACvD,GAAIlY,GAAOoG,GAAO7F,GAAa,EAARgC,EACnB,OAAO,EACXklB,GAAQ9nB,KAAKD,OAAOa,EAAIunB,GAAY5P,CACxC,CACA,OAAO,CACX,CAKA5R,QAAQ2C,GACJ,IAAI4e,EAAWloB,KAAK6nB,SAAW,EAAI,EAAGM,EAAWnoB,KAAK6nB,SAAW,EAAI,EACrE,IAAK,IAAIjnB,EAAI,EAAGknB,EAAO,EAAGlnB,EAAIZ,KAAKD,OAAOc,OAAQD,GAAK,EAAG,CACtD,IAAI0P,EAAQtQ,KAAKD,OAAOa,GAAI2nB,EAAWjY,GAAStQ,KAAK6nB,SAAWC,EAAO,GAAIU,EAAWlY,GAAStQ,KAAK6nB,SAAW,EAAIC,GAC/GvP,EAAUvY,KAAKD,OAAOa,EAAIsnB,GAAWE,EAAUpoB,KAAKD,OAAOa,EAAIunB,GACnE7e,EAAEif,EAAUA,EAAWhQ,EAASiQ,EAAUA,EAAWJ,GACrDN,GAAQM,EAAU7P,CACtB,CACJ,CAKAkQ,SACI,OAAO,IAAIb,EAAQ5nB,KAAKD,QAASC,KAAK6nB,SAC1C,CAIAa,WACI,OAAQ1oB,KAAK6nB,SAAW,IAAM,IAAM1R,KAAKC,UAAUpW,KAAKD,OAC5D,CAMAoC,cAAcoJ,GACV,OAAY,GAALA,EAASqc,EAAQjnB,MAAQ,IAAIinB,EAAQrc,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,GAC5E,EAKJqc,EAAQjnB,MAAQ,IAAIinB,EAAQ,IAS5B,MAAMe,EAIF/oB,YAIA8G,EAAO,GAIPkiB,EAKAroB,EAAO,EAIPE,EAAKiG,EAAK7F,QACNb,KAAK0G,KAAOA,EACZ1G,KAAK4oB,OAASA,EACd5oB,KAAKO,KAAOA,EACZP,KAAKS,GAAKA,CACd,CAIAO,MAAMT,EAAO,EAAGE,EAAKT,KAAK0G,KAAK7F,QAC3B,OAAO,IAAI8nB,EAAQ3oB,KAAK0G,KAAM1G,KAAK4oB,OAAQroB,EAAME,EACrD,CAIA4V,OACI,OAAO,IAAIsS,EAAQ3oB,KAAK0G,KAAK1F,QAAShB,KAAK4oB,QAAU5oB,KAAK4oB,OAAO5nB,QAAShB,KAAKO,KAAMP,KAAKS,GAC9F,CAMAooB,UAAUlnB,EAAKmnB,GACX9oB,KAAKS,GAAKT,KAAK0G,KAAK+D,KAAK9I,GACV,MAAXmnB,GACA9oB,KAAK+oB,UAAU/oB,KAAK0G,KAAK7F,OAAS,EAAGioB,EAC7C,CAKAE,cAAcvnB,GACV,IAAK,IAAIb,EAAI,EAAGqoB,EAAYjpB,KAAK0G,KAAK7F,OAAQD,EAAIa,EAAQiF,KAAK7F,OAAQD,IAAK,CACxE,IAAIsoB,EAAOznB,EAAQ0nB,UAAUvoB,GAC7BZ,KAAK6oB,UAAUpnB,EAAQiF,KAAK9F,GAAY,MAARsoB,GAAgBA,EAAOtoB,EAAIqoB,EAAYC,OAAOE,EAClF,CACJ,CAMAD,UAAU5d,GACN,GAAIvL,KAAK4oB,OACL,IAAK,IAAIhoB,EAAI,EAAGA,EAAIZ,KAAK4oB,OAAO/nB,OAAQD,IACpC,GAAIZ,KAAK4oB,OAAOhoB,IAAM2K,EAClB,OAAOvL,KAAK4oB,OAAOhoB,GAAKA,EAAI,GAAK,EAAI,GACrD,CAIAmoB,UAAUxd,EAAGU,GACJjM,KAAK4oB,SACN5oB,KAAK4oB,OAAS,IAClB5oB,KAAK4oB,OAAOne,KAAKc,EAAGU,EACxB,CAIAod,sBAAsB5nB,GAClB,IAAK,IAAIb,EAAIa,EAAQiF,KAAK7F,OAAS,EAAGyoB,EAAYtpB,KAAK0G,KAAK7F,OAASY,EAAQiF,KAAK7F,OAAQD,GAAK,EAAGA,IAAK,CACnG,IAAIsoB,EAAOznB,EAAQ0nB,UAAUvoB,GAC7BZ,KAAK6oB,UAAUpnB,EAAQiF,KAAK9F,GAAG6nB,SAAkB,MAARS,GAAgBA,EAAOtoB,EAAI0oB,EAAYJ,EAAO,OAAIE,EAC/F,CACJ,CAIAX,SACI,IAAIc,EAAU,IAAIZ,EAElB,OADAY,EAAQF,sBAAsBrpB,MACvBupB,CACX,CAIA5nB,IAAItB,EAAK0nB,EAAQ,GACb,GAAI/nB,KAAK4oB,OACL,OAAO5oB,KAAKgoB,KAAK3nB,EAAK0nB,GAAO,GACjC,IAAK,IAAInnB,EAAIZ,KAAKO,KAAMK,EAAIZ,KAAKS,GAAIG,IACjCP,EAAML,KAAK0G,KAAK9F,GAAGe,IAAItB,EAAK0nB,GAChC,OAAO1nB,CACX,CAKAkF,UAAUlF,EAAK0nB,EAAQ,GAAK,OAAO/nB,KAAKgoB,KAAK3nB,EAAK0nB,GAAO,EAAQ,CAIjEC,KAAK3nB,EAAK0nB,EAAOE,GACb,IAAIV,EAAU,EACd,IAAK,IAAI3mB,EAAIZ,KAAKO,KAAMK,EAAIZ,KAAKS,GAAIG,IAAK,CACtC,IAAIe,EAAM3B,KAAK0G,KAAK9F,GAAIoL,EAASrK,EAAI4D,UAAUlF,EAAK0nB,GACpD,GAAsB,MAAlB/b,EAAOwb,QAAiB,CACxB,IAAIgC,EAAOxpB,KAAKmpB,UAAUvoB,GAC1B,GAAY,MAAR4oB,GAAgBA,EAAO5oB,GAAK4oB,EAAOxpB,KAAKS,GAAI,CAC5CG,EAAI4oB,EACJnpB,EAAML,KAAK0G,KAAK8iB,GAAMhC,QAAQxb,EAAOwb,SACrC,QACJ,CACJ,CACAD,GAAWvb,EAAOub,QAClBlnB,EAAM2L,EAAO3L,GACjB,CACA,OAAO4nB,EAAS5nB,EAAM,IAAIinB,EAAUjnB,EAAKknB,EAAS,KACtD,EAGJ,MAAMkC,EAAYhqB,OAAOC,OAAO,MAYhC,MAAMgqB,EAMFC,SAAW,OAAO/B,EAAQjnB,KAAO,CAMjCipB,MAAM9kB,GAAS,OAAO,IAAM,CAK5B3C,gBAAgByG,EAAQtF,GACpB,IAAKA,IAASA,EAAKumB,SACf,MAAM,IAAIrmB,WAAW,mCACzB,IAAID,EAAOkmB,EAAUnmB,EAAKumB,UAC1B,IAAKtmB,EACD,MAAM,IAAIC,WAAW,gBAAgBF,EAAKumB,oBAC9C,OAAOtmB,EAAKG,SAASkF,EAAQtF,EACjC,CAOAnB,cAAcwB,EAAImmB,GACd,GAAInmB,KAAM8lB,EACN,MAAM,IAAIjmB,WAAW,iCAAmCG,GAG5D,OAFA8lB,EAAU9lB,GAAMmmB,EAChBA,EAAUjmB,UAAUC,OAASH,EACtBmmB,CACX,EAMJ,MAAMC,EAIFnqB,YAIAmB,EAIAipB,GACIhqB,KAAKe,IAAMA,EACXf,KAAKgqB,OAASA,CAClB,CAIA7nB,UAAUpB,GAAO,OAAO,IAAIgpB,EAAWhpB,EAAK,KAAO,CAInDoB,YAAY8nB,GAAW,OAAO,IAAIF,EAAW,KAAME,EAAU,CAM7D9nB,mBAAmBpB,EAAKR,EAAME,EAAIO,GAC9B,IACI,OAAO+oB,EAAWG,GAAGnpB,EAAIE,QAAQV,EAAME,EAAIO,GAM/C,CAJA,MAAO8O,GACH,GAAIA,aAAa,KACb,OAAOia,EAAWI,KAAKra,EAAEma,SAC7B,MAAMna,CACV,CACJ,EAGJ,SAASsa,EAAY9T,EAAUhN,EAAG9G,GAC9B,IAAIwiB,EAAS,GACb,IAAK,IAAIpkB,EAAI,EAAGA,EAAI0V,EAASjT,WAAYzC,IAAK,CAC1C,IAAIwF,EAAQkQ,EAASlQ,MAAMxF,GACvBwF,EAAMtF,QAAQsC,OACdgD,EAAQA,EAAMiQ,KAAK+T,EAAYhkB,EAAMtF,QAASwI,EAAGlD,KACjDA,EAAMvE,WACNuE,EAAQkD,EAAElD,EAAO5D,EAAQ5B,IAC7BokB,EAAOva,KAAKrE,EAChB,CACA,OAAO,eAAmB4e,EAC9B,CAIA,MAAMqF,UAAoBX,EAItB9pB,YAIAW,EAIAE,EAIAuH,GACI1D,QACAtE,KAAKO,KAAOA,EACZP,KAAKS,GAAKA,EACVT,KAAKgI,KAAOA,CAChB,CACA2B,MAAM5I,GACF,IAAIupB,EAAWvpB,EAAIC,MAAMhB,KAAKO,KAAMP,KAAKS,IAAKD,EAAQO,EAAIyD,QAAQxE,KAAKO,MACnEiC,EAAShC,EAAMwB,KAAKxB,EAAM+pB,YAAYvqB,KAAKS,KAC3CO,EAAQ,IAAI,KAAMopB,EAAYE,EAASxpB,SAAS,CAACkB,EAAMQ,IAClDR,EAAKqE,QAAW7D,EAAOe,KAAKinB,eAAexqB,KAAKgI,KAAKzE,MAEnDvB,EAAKgG,KAAKhI,KAAKgI,KAAKC,SAASjG,EAAK0C,QAD9B1C,GAEZQ,GAAS8nB,EAAS5Q,UAAW4Q,EAAShpB,SACzC,OAAOyoB,EAAWU,YAAY1pB,EAAKf,KAAKO,KAAMP,KAAKS,GAAIO,EAC3D,CACAynB,SACI,OAAO,IAAIiC,EAAe1qB,KAAKO,KAAMP,KAAKS,GAAIT,KAAKgI,KACvD,CACArG,IAAIF,GACA,IAAIlB,EAAOkB,EAAQ8D,UAAUvF,KAAKO,KAAM,GAAIE,EAAKgB,EAAQ8D,UAAUvF,KAAKS,IAAK,GAC7E,OAAIF,EAAK+E,SAAW7E,EAAG6E,SAAW/E,EAAKF,KAAOI,EAAGJ,IACtC,KACJ,IAAIgqB,EAAY9pB,EAAKF,IAAKI,EAAGJ,IAAKL,KAAKgI,KAClD,CACA4hB,MAAM9kB,GACF,OAAIA,aAAiBulB,GACjBvlB,EAAMkD,KAAKnD,GAAG7E,KAAKgI,OACnBhI,KAAKO,MAAQuE,EAAMrE,IAAMT,KAAKS,IAAMqE,EAAMvE,KACnC,IAAI8pB,EAAYtb,KAAK7O,IAAIF,KAAKO,KAAMuE,EAAMvE,MAAOwO,KAAK5O,IAAIH,KAAKS,GAAIqE,EAAMrE,IAAKT,KAAKgI,MACvF,IACX,CACAhD,SACI,MAAO,CAAE6kB,SAAU,UAAW7hB,KAAMhI,KAAKgI,KAAKhD,SAC1CzE,KAAMP,KAAKO,KAAME,GAAIT,KAAKS,GAClC,CAIA0B,gBAAgByG,EAAQtF,GACpB,GAAwB,iBAAbA,EAAK/C,MAAsC,iBAAX+C,EAAK7C,GAC5C,MAAM,IAAI+C,WAAW,0CACzB,OAAO,IAAI6mB,EAAY/mB,EAAK/C,KAAM+C,EAAK7C,GAAImI,EAAOuD,aAAa7I,EAAK0E,MACxE,EAEJ0hB,EAAK5lB,OAAO,UAAWumB,GAIvB,MAAMK,UAAuBhB,EAIzB9pB,YAIAW,EAIAE,EAIAuH,GACI1D,QACAtE,KAAKO,KAAOA,EACZP,KAAKS,GAAKA,EACVT,KAAKgI,KAAOA,CAChB,CACA2B,MAAM5I,GACF,IAAIupB,EAAWvpB,EAAIC,MAAMhB,KAAKO,KAAMP,KAAKS,IACrCO,EAAQ,IAAI,KAAMopB,EAAYE,EAASxpB,SAASkB,GACzCA,EAAKgG,KAAKhI,KAAKgI,KAAKG,cAAcnG,EAAK0C,SAC/C3D,GAAMupB,EAAS5Q,UAAW4Q,EAAShpB,SACtC,OAAOyoB,EAAWU,YAAY1pB,EAAKf,KAAKO,KAAMP,KAAKS,GAAIO,EAC3D,CACAynB,SACI,OAAO,IAAI4B,EAAYrqB,KAAKO,KAAMP,KAAKS,GAAIT,KAAKgI,KACpD,CACArG,IAAIF,GACA,IAAIlB,EAAOkB,EAAQ8D,UAAUvF,KAAKO,KAAM,GAAIE,EAAKgB,EAAQ8D,UAAUvF,KAAKS,IAAK,GAC7E,OAAIF,EAAK+E,SAAW7E,EAAG6E,SAAW/E,EAAKF,KAAOI,EAAGJ,IACtC,KACJ,IAAIqqB,EAAenqB,EAAKF,IAAKI,EAAGJ,IAAKL,KAAKgI,KACrD,CACA4hB,MAAM9kB,GACF,OAAIA,aAAiB4lB,GACjB5lB,EAAMkD,KAAKnD,GAAG7E,KAAKgI,OACnBhI,KAAKO,MAAQuE,EAAMrE,IAAMT,KAAKS,IAAMqE,EAAMvE,KACnC,IAAImqB,EAAe3b,KAAK7O,IAAIF,KAAKO,KAAMuE,EAAMvE,MAAOwO,KAAK5O,IAAIH,KAAKS,GAAIqE,EAAMrE,IAAKT,KAAKgI,MAC1F,IACX,CACAhD,SACI,MAAO,CAAE6kB,SAAU,aAAc7hB,KAAMhI,KAAKgI,KAAKhD,SAC7CzE,KAAMP,KAAKO,KAAME,GAAIT,KAAKS,GAClC,CAIA0B,gBAAgByG,EAAQtF,GACpB,GAAwB,iBAAbA,EAAK/C,MAAsC,iBAAX+C,EAAK7C,GAC5C,MAAM,IAAI+C,WAAW,6CACzB,OAAO,IAAIknB,EAAepnB,EAAK/C,KAAM+C,EAAK7C,GAAImI,EAAOuD,aAAa7I,EAAK0E,MAC3E,EAEJ0hB,EAAK5lB,OAAO,aAAc4mB,GAI1B,MAAMC,UAAwBjB,EAI1B9pB,YAIAS,EAIA2H,GACI1D,QACAtE,KAAKK,IAAMA,EACXL,KAAKgI,KAAOA,CAChB,CACA2B,MAAM5I,GACF,IAAIiB,EAAOjB,EAAIoQ,OAAOnR,KAAKK,KAC3B,IAAK2B,EACD,OAAO+nB,EAAWI,KAAK,mCAC3B,IAAI7iB,EAAUtF,EAAKuB,KAAK7D,OAAOsC,EAAKoO,MAAO,KAAMpQ,KAAKgI,KAAKC,SAASjG,EAAK0C,QACzE,OAAOqlB,EAAWU,YAAY1pB,EAAKf,KAAKK,IAAKL,KAAKK,IAAM,EAAG,IAAI,KAAM,UAAciH,GAAU,EAAGtF,EAAK4oB,OAAS,EAAI,GACtH,CACAnC,OAAO1nB,GACH,IAAIiB,EAAOjB,EAAIoQ,OAAOnR,KAAKK,KAC3B,GAAI2B,EAAM,CACN,IAAI6oB,EAAS7qB,KAAKgI,KAAKC,SAASjG,EAAK0C,OACrC,GAAImmB,EAAOhqB,QAAUmB,EAAK0C,MAAM7D,OAAQ,CACpC,IAAK,IAAID,EAAI,EAAGA,EAAIoB,EAAK0C,MAAM7D,OAAQD,IACnC,IAAKoB,EAAK0C,MAAM9D,GAAGkqB,QAAQD,GACvB,OAAO,IAAIF,EAAgB3qB,KAAKK,IAAK2B,EAAK0C,MAAM9D,IACxD,OAAO,IAAI+pB,EAAgB3qB,KAAKK,IAAKL,KAAKgI,KAC9C,CACJ,CACA,OAAO,IAAI+iB,EAAmB/qB,KAAKK,IAAKL,KAAKgI,KACjD,CACArG,IAAIF,GACA,IAAIpB,EAAMoB,EAAQ8D,UAAUvF,KAAKK,IAAK,GACtC,OAAOA,EAAIqnB,aAAe,KAAO,IAAIiD,EAAgBtqB,EAAIA,IAAKL,KAAKgI,KACvE,CACAhD,SACI,MAAO,CAAE6kB,SAAU,cAAexpB,IAAKL,KAAKK,IAAK2H,KAAMhI,KAAKgI,KAAKhD,SACrE,CAIA7C,gBAAgByG,EAAQtF,GACpB,GAAuB,iBAAZA,EAAKjD,IACZ,MAAM,IAAImD,WAAW,8CACzB,OAAO,IAAImnB,EAAgBrnB,EAAKjD,IAAKuI,EAAOuD,aAAa7I,EAAK0E,MAClE,EAEJ0hB,EAAK5lB,OAAO,cAAe6mB,GAI3B,MAAMI,UAA2BrB,EAI7B9pB,YAIAS,EAIA2H,GACI1D,QACAtE,KAAKK,IAAMA,EACXL,KAAKgI,KAAOA,CAChB,CACA2B,MAAM5I,GACF,IAAIiB,EAAOjB,EAAIoQ,OAAOnR,KAAKK,KAC3B,IAAK2B,EACD,OAAO+nB,EAAWI,KAAK,mCAC3B,IAAI7iB,EAAUtF,EAAKuB,KAAK7D,OAAOsC,EAAKoO,MAAO,KAAMpQ,KAAKgI,KAAKG,cAAcnG,EAAK0C,QAC9E,OAAOqlB,EAAWU,YAAY1pB,EAAKf,KAAKK,IAAKL,KAAKK,IAAM,EAAG,IAAI,KAAM,UAAciH,GAAU,EAAGtF,EAAK4oB,OAAS,EAAI,GACtH,CACAnC,OAAO1nB,GACH,IAAIiB,EAAOjB,EAAIoQ,OAAOnR,KAAKK,KAC3B,OAAK2B,GAAShC,KAAKgI,KAAK8iB,QAAQ9oB,EAAK0C,OAE9B,IAAIimB,EAAgB3qB,KAAKK,IAAKL,KAAKgI,MAD/BhI,IAEf,CACA2B,IAAIF,GACA,IAAIpB,EAAMoB,EAAQ8D,UAAUvF,KAAKK,IAAK,GACtC,OAAOA,EAAIqnB,aAAe,KAAO,IAAIqD,EAAmB1qB,EAAIA,IAAKL,KAAKgI,KAC1E,CACAhD,SACI,MAAO,CAAE6kB,SAAU,iBAAkBxpB,IAAKL,KAAKK,IAAK2H,KAAMhI,KAAKgI,KAAKhD,SACxE,CAIA7C,gBAAgByG,EAAQtF,GACpB,GAAuB,iBAAZA,EAAKjD,IACZ,MAAM,IAAImD,WAAW,iDACzB,OAAO,IAAIunB,EAAmBznB,EAAKjD,IAAKuI,EAAOuD,aAAa7I,EAAK0E,MACrE,EAEJ0hB,EAAK5lB,OAAO,iBAAkBinB,GAK9B,MAAMC,UAAoBtB,EAUtB9pB,YAIAW,EAIAE,EAIAO,EAIAiqB,GAAY,GACR3mB,QACAtE,KAAKO,KAAOA,EACZP,KAAKS,GAAKA,EACVT,KAAKgB,MAAQA,EACbhB,KAAKirB,UAAYA,CACrB,CACAthB,MAAM5I,GACF,OAAIf,KAAKirB,WAAaC,EAAenqB,EAAKf,KAAKO,KAAMP,KAAKS,IAC/CspB,EAAWI,KAAK,6CACpBJ,EAAWU,YAAY1pB,EAAKf,KAAKO,KAAMP,KAAKS,GAAIT,KAAKgB,MAChE,CACA2oB,SACI,OAAO,IAAI/B,EAAQ,CAAC5nB,KAAKO,KAAMP,KAAKS,GAAKT,KAAKO,KAAMP,KAAKgB,MAAMoC,MACnE,CACAqlB,OAAO1nB,GACH,OAAO,IAAIiqB,EAAYhrB,KAAKO,KAAMP,KAAKO,KAAOP,KAAKgB,MAAMoC,KAAMrC,EAAIC,MAAMhB,KAAKO,KAAMP,KAAKS,IAC7F,CACAkB,IAAIF,GACA,IAAIlB,EAAOkB,EAAQ8D,UAAUvF,KAAKO,KAAM,GAAIE,EAAKgB,EAAQ8D,UAAUvF,KAAKS,IAAK,GAC7E,OAAIF,EAAKonB,eAAiBlnB,EAAGknB,cAClB,KACJ,IAAIqD,EAAYzqB,EAAKF,IAAK0O,KAAK5O,IAAII,EAAKF,IAAKI,EAAGJ,KAAML,KAAKgB,MACtE,CACA4oB,MAAM9kB,GACF,KAAMA,aAAiBkmB,IAAgBlmB,EAAMmmB,WAAajrB,KAAKirB,UAC3D,OAAO,KACX,GAAIjrB,KAAKO,KAAOP,KAAKgB,MAAMoC,MAAQ0B,EAAMvE,MAASP,KAAKgB,MAAMM,SAAYwD,EAAM9D,MAAM0Y,UAKhF,IAAI5U,EAAMrE,IAAMT,KAAKO,MAASP,KAAKgB,MAAM0Y,WAAc5U,EAAM9D,MAAMM,QAMpE,OAAO,KANsE,CAC7E,IAAIN,EAAQhB,KAAKgB,MAAMoC,KAAO0B,EAAM9D,MAAMoC,MAAQ,EAAI,WAChD,IAAI,KAAM0B,EAAM9D,MAAMF,QAAQgZ,OAAO9Z,KAAKgB,MAAMF,SAAUgE,EAAM9D,MAAM0Y,UAAW1Z,KAAKgB,MAAMM,SAClG,OAAO,IAAI0pB,EAAYlmB,EAAMvE,KAAMP,KAAKS,GAAIO,EAAOhB,KAAKirB,UAC5D,CAGA,CAZgG,CAC5F,IAAIjqB,EAAQhB,KAAKgB,MAAMoC,KAAO0B,EAAM9D,MAAMoC,MAAQ,EAAI,WAChD,IAAI,KAAMpD,KAAKgB,MAAMF,QAAQgZ,OAAOhV,EAAM9D,MAAMF,SAAUd,KAAKgB,MAAM0Y,UAAW5U,EAAM9D,MAAMM,SAClG,OAAO,IAAI0pB,EAAYhrB,KAAKO,KAAMP,KAAKS,IAAMqE,EAAMrE,GAAKqE,EAAMvE,MAAOS,EAAOhB,KAAKirB,UACrF,CASJ,CACAjmB,SACI,IAAI1B,EAAO,CAAEumB,SAAU,UAAWtpB,KAAMP,KAAKO,KAAME,GAAIT,KAAKS,IAK5D,OAJIT,KAAKgB,MAAMoC,OACXE,EAAKtC,MAAQhB,KAAKgB,MAAMgE,UACxBhF,KAAKirB,YACL3nB,EAAK2nB,WAAY,GACd3nB,CACX,CAIAnB,gBAAgByG,EAAQtF,GACpB,GAAwB,iBAAbA,EAAK/C,MAAsC,iBAAX+C,EAAK7C,GAC5C,MAAM,IAAI+C,WAAW,0CACzB,OAAO,IAAIwnB,EAAY1nB,EAAK/C,KAAM+C,EAAK7C,GAAI,cAAemI,EAAQtF,EAAKtC,SAAUsC,EAAK2nB,UAC1F,EAEJvB,EAAK5lB,OAAO,UAAWknB,GAMvB,MAAMG,UAA0BzB,EAO5B9pB,YAIAW,EAIAE,EAIA2qB,EAIAC,EAIArqB,EAKAwY,EAIAyR,GAAY,GACR3mB,QACAtE,KAAKO,KAAOA,EACZP,KAAKS,GAAKA,EACVT,KAAKorB,QAAUA,EACfprB,KAAKqrB,MAAQA,EACbrrB,KAAKgB,MAAQA,EACbhB,KAAKwZ,OAASA,EACdxZ,KAAKirB,UAAYA,CACrB,CACAthB,MAAM5I,GACF,GAAIf,KAAKirB,YAAcC,EAAenqB,EAAKf,KAAKO,KAAMP,KAAKorB,UACvDF,EAAenqB,EAAKf,KAAKqrB,MAAOrrB,KAAKS,KACrC,OAAOspB,EAAWI,KAAK,iDAC3B,IAAImB,EAAMvqB,EAAIC,MAAMhB,KAAKorB,QAASprB,KAAKqrB,OACvC,GAAIC,EAAI5R,WAAa4R,EAAIhqB,QACrB,OAAOyoB,EAAWI,KAAK,2BAC3B,IAAIoB,EAAWvrB,KAAKgB,MAAMwqB,SAASxrB,KAAKwZ,OAAQ8R,EAAIxqB,SACpD,OAAKyqB,EAEExB,EAAWU,YAAY1pB,EAAKf,KAAKO,KAAMP,KAAKS,GAAI8qB,GAD5CxB,EAAWI,KAAK,8BAE/B,CACAR,SACI,OAAO,IAAI/B,EAAQ,CAAC5nB,KAAKO,KAAMP,KAAKorB,QAAUprB,KAAKO,KAAMP,KAAKwZ,OAC1DxZ,KAAKqrB,MAAOrrB,KAAKS,GAAKT,KAAKqrB,MAAOrrB,KAAKgB,MAAMoC,KAAOpD,KAAKwZ,QACjE,CACAiP,OAAO1nB,GACH,IAAIuqB,EAAMtrB,KAAKqrB,MAAQrrB,KAAKorB,QAC5B,OAAO,IAAID,EAAkBnrB,KAAKO,KAAMP,KAAKO,KAAOP,KAAKgB,MAAMoC,KAAOkoB,EAAKtrB,KAAKO,KAAOP,KAAKwZ,OAAQxZ,KAAKO,KAAOP,KAAKwZ,OAAS8R,EAAKvqB,EAAIC,MAAMhB,KAAKO,KAAMP,KAAKS,IAAIgrB,cAAczrB,KAAKorB,QAAUprB,KAAKO,KAAMP,KAAKqrB,MAAQrrB,KAAKO,MAAOP,KAAKorB,QAAUprB,KAAKO,KAAMP,KAAKirB,UACrQ,CACAtpB,IAAIF,GACA,IAAIlB,EAAOkB,EAAQ8D,UAAUvF,KAAKO,KAAM,GAAIE,EAAKgB,EAAQ8D,UAAUvF,KAAKS,IAAK,GACzE2qB,EAAU3pB,EAAQE,IAAI3B,KAAKorB,SAAU,GAAIC,EAAQ5pB,EAAQE,IAAI3B,KAAKqrB,MAAO,GAC7E,OAAK9qB,EAAKonB,eAAiBlnB,EAAGknB,eAAkByD,EAAU7qB,EAAKF,KAAOgrB,EAAQ5qB,EAAGJ,IACtE,KACJ,IAAI8qB,EAAkB5qB,EAAKF,IAAKI,EAAGJ,IAAK+qB,EAASC,EAAOrrB,KAAKgB,MAAOhB,KAAKwZ,OAAQxZ,KAAKirB,UACjG,CACAjmB,SACI,IAAI1B,EAAO,CAAEumB,SAAU,gBAAiBtpB,KAAMP,KAAKO,KAAME,GAAIT,KAAKS,GAC9D2qB,QAASprB,KAAKorB,QAASC,MAAOrrB,KAAKqrB,MAAO7R,OAAQxZ,KAAKwZ,QAK3D,OAJIxZ,KAAKgB,MAAMoC,OACXE,EAAKtC,MAAQhB,KAAKgB,MAAMgE,UACxBhF,KAAKirB,YACL3nB,EAAK2nB,WAAY,GACd3nB,CACX,CAIAnB,gBAAgByG,EAAQtF,GACpB,GAAwB,iBAAbA,EAAK/C,MAAsC,iBAAX+C,EAAK7C,IACrB,iBAAhB6C,EAAK8nB,SAA4C,iBAAd9nB,EAAK+nB,OAA2C,iBAAf/nB,EAAKkW,OAChF,MAAM,IAAIhW,WAAW,gDACzB,OAAO,IAAI2nB,EAAkB7nB,EAAK/C,KAAM+C,EAAK7C,GAAI6C,EAAK8nB,QAAS9nB,EAAK+nB,MAAO,cAAeziB,EAAQtF,EAAKtC,OAAQsC,EAAKkW,SAAUlW,EAAK2nB,UACvI,EAGJ,SAASC,EAAenqB,EAAKR,EAAME,GAC/B,IAAID,EAAQO,EAAIyD,QAAQjE,GAAOmrB,EAAOjrB,EAAKF,EAAMsC,EAAQrC,EAAMqC,MAC/D,MAAO6oB,EAAO,GAAK7oB,EAAQ,GAAKrC,EAAMud,WAAWlb,IAAUrC,EAAMwB,KAAKa,GAAOQ,WACzER,IACA6oB,IAEJ,GAAIA,EAAO,EAAG,CACV,IAAIC,EAAOnrB,EAAMwB,KAAKa,GAAO+oB,WAAWprB,EAAMud,WAAWlb,IACzD,MAAO6oB,EAAO,EAAG,CACb,IAAKC,GAAQA,EAAKf,OACd,OAAO,EACXe,EAAOA,EAAKtX,WACZqX,GACJ,CACJ,CACA,OAAO,CACX,CAEA,SAASG,EAAQ3qB,EAAIX,EAAME,EAAIuH,GAC3B,IACI8jB,EAAUC,EADVC,EAAU,GAAI7R,EAAQ,GAE1BjZ,EAAGH,IAAI6X,aAAarY,EAAME,GAAI,CAACuB,EAAM3B,EAAKmC,KACtC,IAAKR,EAAKH,SACN,OACJ,IAAI6C,EAAQ1C,EAAK0C,MACjB,IAAKsD,EAAK8iB,QAAQpmB,IAAUlC,EAAOe,KAAKinB,eAAexiB,EAAKzE,MAAO,CAC/D,IAAI+M,EAAQvB,KAAK5O,IAAIE,EAAKE,GAAOkG,EAAMsI,KAAK7O,IAAIG,EAAM2B,EAAKqD,SAAU5E,GACjEoqB,EAAS7iB,EAAKC,SAASvD,GAC3B,IAAK,IAAI9D,EAAI,EAAGA,EAAI8D,EAAM7D,OAAQD,IACzB8D,EAAM9D,GAAGkqB,QAAQD,KACdiB,GAAYA,EAASrrB,IAAM6P,GAASwb,EAAS9jB,KAAKnD,GAAGH,EAAM9D,IAC3DkrB,EAASrrB,GAAKgG,EAEdulB,EAAQvhB,KAAKqhB,EAAW,IAAIpB,EAAepa,EAAO7J,EAAK/B,EAAM9D,MAGrEmrB,GAAUA,EAAOtrB,IAAM6P,EACvByb,EAAOtrB,GAAKgG,EAEZ0T,EAAM1P,KAAKshB,EAAS,IAAI1B,EAAY/Z,EAAO7J,EAAKuB,GACxD,KAEJgkB,EAAQrlB,SAAQoL,GAAK7Q,EAAGsF,KAAKuL,KAC7BoI,EAAMxT,SAAQoL,GAAK7Q,EAAGsF,KAAKuL,IAC/B,CACA,SAASka,EAAW/qB,EAAIX,EAAME,EAAIuH,GAC9B,IAAIkkB,EAAU,GAAI1lB,EAAO,EACzBtF,EAAGH,IAAI6X,aAAarY,EAAME,GAAI,CAACuB,EAAM3B,KACjC,IAAK2B,EAAKH,SACN,OACJ2E,IACA,IAAI2lB,EAAW,KACf,GAAInkB,aAAgB,KAAU,CAC1B,IAAsBlF,EAAlBsK,EAAMpL,EAAK0C,MACf,MAAO5B,EAAQkF,EAAK8iB,QAAQ1d,IACvB+e,IAAaA,EAAW,KAAK1hB,KAAK3H,GACnCsK,EAAMtK,EAAMqF,cAAciF,EAElC,MACSpF,EACDA,EAAK8iB,QAAQ9oB,EAAK0C,SAClBynB,EAAW,CAACnkB,IAGhBmkB,EAAWnqB,EAAK0C,MAEpB,GAAIynB,GAAYA,EAAStrB,OAAQ,CAC7B,IAAI4F,EAAMsI,KAAK7O,IAAIG,EAAM2B,EAAKqD,SAAU5E,GACxC,IAAK,IAAIG,EAAI,EAAGA,EAAIurB,EAAStrB,OAAQD,IAAK,CACtC,IAAyBkC,EAArB+c,EAAQsM,EAASvrB,GACrB,IAAK,IAAI6K,EAAI,EAAGA,EAAIygB,EAAQrrB,OAAQ4K,IAAK,CACrC,IAAIQ,EAAIigB,EAAQzgB,GACZQ,EAAEzF,MAAQA,EAAO,GAAKqZ,EAAMhb,GAAGqnB,EAAQzgB,GAAGoU,SAC1C/c,EAAQmJ,EAChB,CACInJ,GACAA,EAAMrC,GAAKgG,EACX3D,EAAM0D,KAAOA,GAGb0lB,EAAQzhB,KAAK,CAAEoV,QAAOtf,KAAMwO,KAAK5O,IAAIE,EAAKE,GAAOE,GAAIgG,EAAKD,QAElE,CACJ,KAEJ0lB,EAAQvlB,SAAQsF,GAAK/K,EAAGsF,KAAK,IAAIkkB,EAAeze,EAAE1L,KAAM0L,EAAExL,GAAIwL,EAAE4T,SACpE,CACA,SAASuM,EAAkBlrB,EAAIb,EAAKgsB,EAAYC,EAAQD,EAAWE,cAC/D,IAAIvqB,EAAOd,EAAGH,IAAIoQ,OAAO9Q,GACrBmsB,EAAW,GAAInU,EAAMhY,EAAM,EAC/B,IAAK,IAAIO,EAAI,EAAGA,EAAIoB,EAAKqB,WAAYzC,IAAK,CACtC,IAAIwF,EAAQpE,EAAKoE,MAAMxF,GAAI6F,EAAM4R,EAAMjS,EAAMf,SACzConB,EAAUH,EAAMI,UAAUtmB,EAAM7C,MACpC,GAAKkpB,EAGA,CACDH,EAAQG,EACR,IAAK,IAAIhhB,EAAI,EAAGA,EAAIrF,EAAM1B,MAAM7D,OAAQ4K,IAC/B4gB,EAAW7B,eAAepkB,EAAM1B,MAAM+G,GAAGlI,OAC1CrC,EAAGsF,KAAK,IAAIkkB,EAAerS,EAAK5R,EAAKL,EAAM1B,MAAM+G,IAC7D,MAPI+gB,EAAS/hB,KAAK,IAAIugB,EAAY3S,EAAK5R,EAAK,aAQ5C4R,EAAM5R,CACV,CACA,IAAK6lB,EAAMK,SAAU,CACjB,IAAIxJ,EAAOmJ,EAAMM,WAAW,YAAgB,GAC5C1rB,EAAGD,QAAQoX,EAAKA,EAAK,IAAI,KAAM8K,EAAM,EAAG,GAC5C,CACA,IAAK,IAAIviB,EAAI4rB,EAAS3rB,OAAS,EAAGD,GAAK,EAAGA,IACtCM,EAAGsF,KAAKgmB,EAAS5rB,GACzB,CAEA,SAASisB,EAAO7qB,EAAMsO,EAAO7J,GACzB,OAAiB,GAAT6J,GAActO,EAAK8qB,WAAWxc,EAAOtO,EAAKqB,eAC7CoD,GAAOzE,EAAKqB,YAAcrB,EAAK8qB,WAAW,EAAGrmB,GACtD,CAMA,SAASsmB,EAAWC,GAChB,IAAIxqB,EAASwqB,EAAMxqB,OACf1B,EAAU0B,EAAO1B,QAAQmsB,WAAWD,EAAME,WAAYF,EAAMG,UAChE,IAAK,IAAItqB,EAAQmqB,EAAMnqB,SAAUA,EAAO,CACpC,IAAIb,EAAOgrB,EAAMxsB,MAAMwB,KAAKa,GACxBD,EAAQoqB,EAAMxsB,MAAMoC,MAAMC,GAAQsqB,EAAWH,EAAMtsB,IAAIqd,WAAWlb,GACtE,GAAIA,EAAQmqB,EAAMnqB,OAASb,EAAK8qB,WAAWlqB,EAAOuqB,EAAUrsB,GACxD,OAAO+B,EACX,GAAa,GAATA,GAAcb,EAAKuB,KAAKmC,KAAKkN,YAAcia,EAAO7qB,EAAMY,EAAOuqB,GAC/D,KACR,CACA,OAAO,IACX,CACA,SAASC,EAAKlsB,EAAI8rB,EAAO1gB,GACrB,IAAI,MAAE9L,EAAK,IAAEE,EAAG,MAAEmC,GAAUmqB,EACxBK,EAAW7sB,EAAMuC,OAAOF,EAAQ,GAAIyqB,EAAS5sB,EAAIsC,MAAMH,EAAQ,GAC/DyN,EAAQ+c,EAAU5mB,EAAM6mB,EACxBvqB,EAAS,WAAgB2W,EAAY,EACzC,IAAK,IAAI7F,EAAIhR,EAAO0qB,GAAY,EAAO1Z,EAAIvH,EAAQuH,IAC3C0Z,GAAa/sB,EAAMoC,MAAMiR,GAAK,GAC9B0Z,GAAY,EACZxqB,EAAS,UAAcvC,EAAMwB,KAAK6R,GAAGwC,KAAKtT,IAC1C2W,KAGApJ,IAER,IAAItN,EAAQ,WAAgB1B,EAAU,EACtC,IAAK,IAAIuS,EAAIhR,EAAO0qB,GAAY,EAAO1Z,EAAIvH,EAAQuH,IAC3C0Z,GAAa7sB,EAAIsC,MAAM6Q,EAAI,GAAKnT,EAAI+F,IAAIoN,IACxC0Z,GAAY,EACZvqB,EAAQ,UAActC,EAAIsB,KAAK6R,GAAGwC,KAAKrT,IACvC1B,KAGAmF,IAERvF,EAAGsF,KAAK,IAAI2kB,EAAkB7a,EAAO7J,EAAK4mB,EAAUC,EAAQ,IAAI,KAAMvqB,EAAO+W,OAAO9W,GAAQ0W,EAAWpY,GAAUyB,EAAOK,KAAOsW,GAAW,GAC9I,CASA,SAAS8T,EAAaR,EAAOjT,EAAU3J,EAAQ,KAAMqd,EAAaT,GAC9D,IAAIU,EAASC,EAAoBX,EAAOjT,GACpCxX,EAAQmrB,GAAUE,EAAmBH,EAAY1T,GACrD,OAAKxX,EAEEmrB,EAAO/rB,IAAIksB,GACbC,OAAO,CAAEvqB,KAAMwW,EAAU3J,UAAS0d,OAAOvrB,EAAMZ,IAAIksB,IAF7C,IAGf,CACA,SAASA,EAAUtqB,GAAQ,MAAO,CAAEA,OAAM6M,MAAO,KAAQ,CACzD,SAASud,EAAoBX,EAAOzpB,GAChC,IAAI,OAAEf,EAAM,WAAE0qB,EAAU,SAAEC,GAAaH,EACnCU,EAASlrB,EAAOurB,eAAeb,GAAYM,aAAajqB,GAC5D,IAAKmqB,EACD,OAAO,KACX,IAAIjV,EAAQiV,EAAO7sB,OAAS6sB,EAAO,GAAKnqB,EACxC,OAAOf,EAAOwrB,eAAed,EAAYC,EAAU1U,GAASiV,EAAS,IACzE,CACA,SAASE,EAAmBZ,EAAOzpB,GAC/B,IAAI,OAAEf,EAAM,WAAE0qB,EAAU,SAAEC,GAAaH,EACnCzqB,EAAQC,EAAO4D,MAAM8mB,GACrBe,EAAS1qB,EAAKgpB,aAAaiB,aAAajrB,EAAMgB,MAClD,IAAK0qB,EACD,OAAO,KACX,IAAIC,EAAWD,EAAOptB,OAASotB,EAAOA,EAAOptB,OAAS,GAAK0C,EACvD4qB,EAAaD,EAAS3B,aAC1B,IAAK,IAAI3rB,EAAIssB,EAAYiB,GAAcvtB,EAAIusB,EAAUvsB,IACjDutB,EAAaA,EAAWzB,UAAUlqB,EAAO4D,MAAMxF,GAAG2C,MACtD,OAAK4qB,GAAeA,EAAWxB,SAExBsB,EADI,IAEf,CACA,SAASG,EAAKltB,EAAI8rB,EAAOqB,GACrB,IAAIvtB,EAAU,WACd,IAAK,IAAIF,EAAIytB,EAASxtB,OAAS,EAAGD,GAAK,EAAGA,IAAK,CAC3C,GAAIE,EAAQsC,KAAM,CACd,IAAIkpB,EAAQ+B,EAASztB,GAAG2C,KAAKgpB,aAAa+B,cAAcxtB,GACxD,IAAKwrB,IAAUA,EAAMK,SACjB,MAAM,IAAInpB,WAAW,yFAC7B,CACA1C,EAAU,UAAcutB,EAASztB,GAAG2C,KAAK7D,OAAO2uB,EAASztB,GAAGwP,MAAOtP,GACvE,CACA,IAAIwP,EAAQ0c,EAAM1c,MAAO7J,EAAMumB,EAAMvmB,IACrCvF,EAAGsF,KAAK,IAAI2kB,EAAkB7a,EAAO7J,EAAK6J,EAAO7J,EAAK,IAAI,KAAM3F,EAAS,EAAG,GAAIutB,EAASxtB,QAAQ,GACrG,CACA,SAAS0tB,EAAartB,EAAIX,EAAME,EAAI8C,EAAM6M,GACtC,IAAK7M,EAAKzB,YACN,MAAM,IAAI0B,WAAW,oDACzB,IAAIjC,EAAUL,EAAGM,MAAMX,OACvBK,EAAGH,IAAI6X,aAAarY,EAAME,GAAI,CAACuB,EAAM3B,KACjC,GAAI2B,EAAKF,cAAgBE,EAAKwsB,UAAUjrB,EAAM6M,IAAUqe,EAAcvtB,EAAGH,IAAKG,EAAGO,QAAQT,MAAMO,GAASI,IAAItB,GAAMkD,GAAO,CAErHrC,EAAGkrB,kBAAkBlrB,EAAGO,QAAQT,MAAMO,GAASI,IAAItB,EAAK,GAAIkD,GAC5D,IAAI9B,EAAUP,EAAGO,QAAQT,MAAMO,GAC3BmtB,EAASjtB,EAAQE,IAAItB,EAAK,GAAIsuB,EAAOltB,EAAQE,IAAItB,EAAM2B,EAAKqD,SAAU,GAE1E,OADAnE,EAAGsF,KAAK,IAAI2kB,EAAkBuD,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EAAG,IAAI,KAAM,UAAcprB,EAAK7D,OAAO0Q,EAAO,KAAMpO,EAAK0C,QAAS,EAAG,GAAI,GAAG,KACpI,CACX,IAER,CACA,SAAS+pB,EAAc1tB,EAAKV,EAAKkD,GAC7B,IAAInB,EAAOrB,EAAIyD,QAAQnE,GAAMuC,EAAQR,EAAKQ,QAC1C,OAAOR,EAAKI,OAAOwrB,eAAeprB,EAAOA,EAAQ,EAAGW,EACxD,CAKA,SAAS6V,EAAclY,EAAIb,EAAKkD,EAAM6M,EAAO1L,GACzC,IAAI1C,EAAOd,EAAGH,IAAIoQ,OAAO9Q,GACzB,IAAK2B,EACD,MAAM,IAAIwB,WAAW,6BACpBD,IACDA,EAAOvB,EAAKuB,MAChB,IAAIqrB,EAAUrrB,EAAK7D,OAAO0Q,EAAO,KAAM1L,GAAS1C,EAAK0C,OACrD,GAAI1C,EAAK4oB,OACL,OAAO1pB,EAAGa,YAAY1B,EAAKA,EAAM2B,EAAKqD,SAAUupB,GACpD,IAAKrrB,EAAKsrB,aAAa7sB,EAAKlB,SACxB,MAAM,IAAI0C,WAAW,iCAAmCD,EAAKc,MACjEnD,EAAGsF,KAAK,IAAI2kB,EAAkB9qB,EAAKA,EAAM2B,EAAKqD,SAAUhF,EAAM,EAAGA,EAAM2B,EAAKqD,SAAW,EAAG,IAAI,KAAM,UAAcupB,GAAU,EAAG,GAAI,GAAG,GAC1I,CAIA,SAASE,EAAS/tB,EAAKV,EAAKwC,EAAQ,EAAGksB,GACnC,IAAI3sB,EAAOrB,EAAIyD,QAAQnE,GAAM2uB,EAAO5sB,EAAKS,MAAQA,EAC7CosB,EAAaF,GAAcA,EAAWA,EAAWluB,OAAS,IAAOuB,EAAKI,OAC1E,GAAIwsB,EAAO,GAAK5sB,EAAKI,OAAOe,KAAKmC,KAAKkN,YACjCxQ,EAAKI,OAAOsqB,WAAW1qB,EAAKQ,QAASR,EAAKI,OAAOa,cACjD4rB,EAAU1rB,KAAKsrB,aAAazsB,EAAKI,OAAO1B,QAAQmsB,WAAW7qB,EAAKQ,QAASR,EAAKI,OAAOa,aACtF,OAAO,EACX,IAAK,IAAIwQ,EAAIzR,EAAKS,MAAQ,EAAGjC,EAAIiC,EAAQ,EAAGgR,EAAImb,EAAMnb,IAAKjT,IAAK,CAC5D,IAAIoB,EAAOI,EAAKJ,KAAK6R,GAAIjR,EAAQR,EAAKQ,MAAMiR,GAC5C,GAAI7R,EAAKuB,KAAKmC,KAAKkN,UACf,OAAO,EACX,IAAIsc,EAAOltB,EAAKlB,QAAQmsB,WAAWrqB,EAAOZ,EAAKqB,YAC3CL,EAAS+rB,GAAcA,EAAWnuB,IAAOoB,EAG7C,GAFIgB,GAAShB,IACTktB,EAAOA,EAAKC,aAAa,EAAGnsB,EAAMO,KAAK7D,OAAOsD,EAAMoN,UACnDpO,EAAK8qB,WAAWlqB,EAAQ,EAAGZ,EAAKqB,cAAgBL,EAAMO,KAAKsrB,aAAaK,GACzE,OAAO,CACf,CACA,IAAItsB,EAAQR,EAAK2b,WAAWiR,GACxBI,EAAWL,GAAcA,EAAW,GACxC,OAAO3sB,EAAKJ,KAAKgtB,GAAMhB,eAAeprB,EAAOA,EAAOwsB,EAAWA,EAAS7rB,KAAOnB,EAAKJ,KAAKgtB,EAAO,GAAGzrB,KACvG,CACA,SAASuO,EAAM5Q,EAAIb,EAAKwC,EAAQ,EAAGksB,GAC/B,IAAI3sB,EAAOlB,EAAGH,IAAIyD,QAAQnE,GAAM0C,EAAS,WAAgBC,EAAQ,WACjE,IAAK,IAAI6Q,EAAIzR,EAAKS,MAAOiN,EAAI1N,EAAKS,MAAQA,EAAOjC,EAAIiC,EAAQ,EAAGgR,EAAI/D,EAAG+D,IAAKjT,IAAK,CAC7EmC,EAAS,UAAcX,EAAKJ,KAAK6R,GAAGwC,KAAKtT,IACzC,IAAIssB,EAAYN,GAAcA,EAAWnuB,GACzCoC,EAAQ,UAAcqsB,EAAYA,EAAU9rB,KAAK7D,OAAO2vB,EAAUjf,MAAOpN,GAASZ,EAAKJ,KAAK6R,GAAGwC,KAAKrT,GACxG,CACA9B,EAAGsF,KAAK,IAAIwkB,EAAY3qB,EAAKA,EAAK,IAAI,KAAM0C,EAAO+W,OAAO9W,GAAQH,EAAOA,IAAQ,GACrF,CAKA,SAASysB,EAAQvuB,EAAKV,GAClB,IAAI+B,EAAOrB,EAAIyD,QAAQnE,GAAMuC,EAAQR,EAAKQ,QAC1C,OAAO2sB,EAASntB,EAAKkS,WAAYlS,EAAK+C,YAClC/C,EAAKI,OAAOsqB,WAAWlqB,EAAOA,EAAQ,EAC9C,CACA,SAAS2sB,EAASlhB,EAAGC,GACjB,SAAUD,IAAKC,GAAMD,EAAEuc,SAAUvc,EAAEmhB,UAAUlhB,GACjD,CA+BA,SAAS8D,EAAKlR,EAAIb,EAAKwC,GACnB,IAAI2D,EAAO,IAAIwkB,EAAY3qB,EAAMwC,EAAOxC,EAAMwC,EAAO,YAAa,GAClE3B,EAAGsF,KAAKA,EACZ,CAOA,SAASipB,EAAY1uB,EAAKV,EAAK0Z,GAC3B,IAAI3X,EAAOrB,EAAIyD,QAAQnE,GACvB,GAAI+B,EAAKI,OAAOwrB,eAAe5rB,EAAKQ,QAASR,EAAKQ,QAASmX,GACvD,OAAO1Z,EACX,GAAyB,GAArB+B,EAAKyV,aACL,IAAK,IAAIhE,EAAIzR,EAAKS,MAAQ,EAAGgR,GAAK,EAAGA,IAAK,CACtC,IAAIjR,EAAQR,EAAKQ,MAAMiR,GACvB,GAAIzR,EAAKJ,KAAK6R,GAAGma,eAAeprB,EAAOA,EAAOmX,GAC1C,OAAO3X,EAAKW,OAAO8Q,EAAI,GAC3B,GAAIjR,EAAQ,EACR,OAAO,IACf,CACJ,GAAIR,EAAKyV,cAAgBzV,EAAKI,OAAO1B,QAAQsC,KACzC,IAAK,IAAIyQ,EAAIzR,EAAKS,MAAQ,EAAGgR,GAAK,EAAGA,IAAK,CACtC,IAAIjR,EAAQR,EAAK2b,WAAWlK,GAC5B,GAAIzR,EAAKJ,KAAK6R,GAAGma,eAAeprB,EAAOA,EAAOmX,GAC1C,OAAO3X,EAAKY,MAAM6Q,EAAI,GAC1B,GAAIjR,EAAQR,EAAKJ,KAAK6R,GAAGxQ,WACrB,OAAO,IACf,CACJ,OAAO,IACX,CAOA,SAASqsB,EAAU3uB,EAAKV,EAAKW,GACzB,IAAIoB,EAAOrB,EAAIyD,QAAQnE,GACvB,IAAKW,EAAMF,QAAQsC,KACf,OAAO/C,EACX,IAAIS,EAAUE,EAAMF,QACpB,IAAK,IAAIF,EAAI,EAAGA,EAAII,EAAM0Y,UAAW9Y,IACjCE,EAAUA,EAAQuT,WAAWvT,QACjC,IAAK,IAAI6uB,EAAO,EAAGA,IAA4B,GAAnB3uB,EAAM0Y,WAAkB1Y,EAAMoC,KAAO,EAAI,GAAIusB,IACrE,IAAK,IAAI9b,EAAIzR,EAAKS,MAAOgR,GAAK,EAAGA,IAAK,CAClC,IAAI5Q,EAAO4Q,GAAKzR,EAAKS,MAAQ,EAAIT,EAAK/B,MAAQ+B,EAAKkO,MAAMuD,EAAI,GAAKzR,EAAKqE,IAAIoN,EAAI,IAAM,GAAK,EAAI,EAC1F+b,EAAYxtB,EAAKQ,MAAMiR,IAAM5Q,EAAO,EAAI,EAAI,GAC5CT,EAASJ,EAAKJ,KAAK6R,GAAIgc,GAAO,EAClC,GAAY,GAARF,EACAE,EAAOrtB,EAAOsqB,WAAW8C,EAAWA,EAAW9uB,OAE9C,CACD,IAAIgvB,EAAWttB,EAAOurB,eAAe6B,GAAWpC,aAAa1sB,EAAQuT,WAAW9Q,MAChFssB,EAAOC,GAAYttB,EAAOwrB,eAAe4B,EAAWA,EAAWE,EAAS,GAC5E,CACA,GAAID,EACA,OAAe,GAAR5sB,EAAYb,EAAK/B,IAAM4C,EAAO,EAAIb,EAAKW,OAAO8Q,EAAI,GAAKzR,EAAKY,MAAM6Q,EAAI,EACrF,CAEJ,OAAO,IACX,CAQA,SAASkc,EAAYhvB,EAAKR,EAAME,EAAKF,EAAMS,EAAQ,YAC/C,GAAIT,GAAQE,IAAOO,EAAMoC,KACrB,OAAO,KACX,IAAI5C,EAAQO,EAAIyD,QAAQjE,GAAOG,EAAMK,EAAIyD,QAAQ/D,GAEjD,OAAIuvB,EAAcxvB,EAAOE,EAAKM,GACnB,IAAIgqB,EAAYzqB,EAAME,EAAIO,GAC9B,IAAIivB,EAAOzvB,EAAOE,EAAKM,GAAOkvB,KACzC,CACA,SAASF,EAAcxvB,EAAOE,EAAKM,GAC/B,OAAQA,EAAM0Y,YAAc1Y,EAAMM,SAAWd,EAAM8P,SAAW5P,EAAI4P,SAC9D9P,EAAMgC,OAAOsqB,WAAWtsB,EAAMoC,QAASlC,EAAIkC,QAAS5B,EAAMF,QAClE,CAvZA4oB,EAAK5lB,OAAO,gBAAiBqnB,GA4a7B,MAAM8E,EACFrwB,YAAYY,EAAOE,EAAKyvB,GACpBnwB,KAAKQ,MAAQA,EACbR,KAAKU,IAAMA,EACXV,KAAKmwB,SAAWA,EAChBnwB,KAAKowB,SAAW,GAChBpwB,KAAKqwB,OAAS,WACd,IAAK,IAAIzvB,EAAI,EAAGA,GAAKJ,EAAMqC,MAAOjC,IAAK,CACnC,IAAIoB,EAAOxB,EAAMwB,KAAKpB,GACtBZ,KAAKowB,SAAS3lB,KAAK,CACflH,KAAMvB,EAAKuB,KACX+oB,MAAOtqB,EAAK+rB,eAAevtB,EAAMud,WAAWnd,KAEpD,CACA,IAAK,IAAIA,EAAIJ,EAAMqC,MAAOjC,EAAI,EAAGA,IAC7BZ,KAAKqwB,OAAS,UAAc7vB,EAAMwB,KAAKpB,GAAGyV,KAAKrW,KAAKqwB,QAC5D,CACIxtB,YAAU,OAAO7C,KAAKowB,SAASvvB,OAAS,CAAG,CAC/CqvB,MAII,MAAOlwB,KAAKmwB,SAAS/sB,KAAM,CACvB,IAAI8sB,EAAMlwB,KAAKswB,eACXJ,EACAlwB,KAAKuwB,WAAWL,GAEhBlwB,KAAKwwB,YAAcxwB,KAAKywB,UAChC,CAMA,IAAIC,EAAa1wB,KAAK2wB,iBAAkBC,EAAa5wB,KAAKqwB,OAAOjtB,KAAOpD,KAAK6C,MAAQ7C,KAAKQ,MAAMqC,MAC5FrC,EAAQR,KAAKQ,MAAOE,EAAMV,KAAK6wB,MAAMH,EAAa,EAAI1wB,KAAKU,IAAMF,EAAMO,IAAIyD,QAAQksB,IACvF,IAAKhwB,EACD,OAAO,KAEX,IAAII,EAAUd,KAAKqwB,OAAQ3W,EAAYlZ,EAAMqC,MAAOvB,EAAUZ,EAAImC,MAClE,MAAO6W,GAAapY,GAAiC,GAAtBR,EAAQuC,WACnCvC,EAAUA,EAAQuT,WAAWvT,QAC7B4Y,IACApY,IAEJ,IAAIN,EAAQ,IAAI,KAAMF,EAAS4Y,EAAWpY,GAC1C,OAAIovB,GAAc,EACP,IAAIvF,EAAkB3qB,EAAMH,IAAKqwB,EAAY1wB,KAAKU,IAAIL,IAAKL,KAAKU,IAAI+F,MAAOzF,EAAO4vB,GACzF5vB,EAAMoC,MAAQ5C,EAAMH,KAAOL,KAAKU,IAAIL,IAC7B,IAAI2qB,EAAYxqB,EAAMH,IAAKK,EAAIL,IAAKW,GACxC,IACX,CAIAsvB,eACI,IAAIQ,EAAa9wB,KAAKmwB,SAASzW,UAC/B,IAAK,IAAIrB,EAAMrY,KAAKmwB,SAASrvB,QAAS+S,EAAI,EAAGvS,EAAUtB,KAAKmwB,SAAS7uB,QAASuS,EAAIid,EAAYjd,IAAK,CAC/F,IAAI7R,EAAOqW,EAAIhE,WAGf,GAFIgE,EAAIhV,WAAa,IACjB/B,EAAU,GACVU,EAAKuB,KAAKmC,KAAKkN,WAAatR,GAAWuS,EAAG,CAC1Cid,EAAajd,EACb,KACJ,CACAwE,EAAMrW,EAAKlB,OACf,CAGA,IAAK,IAAI6uB,EAAO,EAAGA,GAAQ,EAAGA,IAC1B,IAAK,IAAIoB,EAAqB,GAARpB,EAAYmB,EAAa9wB,KAAKmwB,SAASzW,UAAWqX,GAAc,EAAGA,IAAc,CACnG,IAAIza,EAAU9T,EAAS,KACnBuuB,GACAvuB,EAASwuB,EAAUhxB,KAAKmwB,SAASrvB,QAASiwB,EAAa,GAAG1c,WAC1DiC,EAAW9T,EAAO1B,SAGlBwV,EAAWtW,KAAKmwB,SAASrvB,QAE7B,IAAIuY,EAAQ/C,EAASjC,WACrB,IAAK,IAAI4c,EAAgBjxB,KAAK6C,MAAOouB,GAAiB,EAAGA,IAAiB,CACtE,IAAoD7C,GAAhD,KAAE7qB,EAAI,MAAE+oB,GAAUtsB,KAAKowB,SAASa,GAAsBC,EAAS,KAInE,GAAY,GAARvB,IAActW,EAAQiT,EAAMI,UAAUrT,EAAM9V,QAAU2tB,EAAS5E,EAAMM,WAAW,UAAcvT,IAAQ,IACpG7W,GAAUe,EAAK4tB,kBAAkB3uB,EAAOe,OAC1C,MAAO,CAAEwtB,aAAYE,gBAAezuB,SAAQ0uB,UAG3C,GAAY,GAARvB,GAAatW,IAAU+U,EAAO9B,EAAMkB,aAAanU,EAAM9V,OAC5D,MAAO,CAAEwtB,aAAYE,gBAAezuB,SAAQ4rB,QAGhD,GAAI5rB,GAAU8pB,EAAMI,UAAUlqB,EAAOe,MACjC,KACR,CACJ,CAER,CACAitB,WACI,IAAI,QAAE1vB,EAAO,UAAE4Y,EAAS,QAAEpY,GAAYtB,KAAKmwB,SACvC5tB,EAAQyuB,EAAUlwB,EAAS4Y,GAC/B,SAAKnX,EAAMc,YAAcd,EAAM8R,WAAWuW,UAE1C5qB,KAAKmwB,SAAW,IAAI,KAAMrvB,EAAS4Y,EAAY,EAAG3K,KAAK5O,IAAImB,EAASiB,EAAMa,KAAOsW,GAAa5Y,EAAQsC,KAAO9B,EAAUoY,EAAY,EAAI,KAChI,EACX,CACA+W,WACI,IAAI,QAAE3vB,EAAO,UAAE4Y,EAAS,QAAEpY,GAAYtB,KAAKmwB,SACvC5tB,EAAQyuB,EAAUlwB,EAAS4Y,GAC/B,GAAInX,EAAMc,YAAc,GAAKqW,EAAY,EAAG,CACxC,IAAI0X,EAAYtwB,EAAQsC,KAAOsW,GAAaA,EAAYnX,EAAMa,KAC9DpD,KAAKmwB,SAAW,IAAI,KAAMkB,EAAiBvwB,EAAS4Y,EAAY,EAAG,GAAIA,EAAY,EAAG0X,EAAY1X,EAAY,EAAIpY,EACtH,MAEItB,KAAKmwB,SAAW,IAAI,KAAMkB,EAAiBvwB,EAAS4Y,EAAW,GAAIA,EAAWpY,EAEtF,CAIAivB,YAAW,WAAEQ,EAAU,cAAEE,EAAa,OAAEzuB,EAAM,OAAE0uB,EAAM,KAAE9C,IACpD,MAAOpuB,KAAK6C,MAAQouB,EAChBjxB,KAAKsxB,oBACT,GAAIlD,EACA,IAAK,IAAIxtB,EAAI,EAAGA,EAAIwtB,EAAKvtB,OAAQD,IAC7BZ,KAAKuxB,iBAAiBnD,EAAKxtB,IACnC,IAAII,EAAQhB,KAAKmwB,SAAU7Z,EAAW9T,EAASA,EAAO1B,QAAUE,EAAMF,QAClE4Y,EAAY1Y,EAAM0Y,UAAYqX,EAC9BS,EAAQ,EAAGlY,EAAM,IACjB,MAAEgT,EAAK,KAAE/oB,GAASvD,KAAKowB,SAASa,GACpC,GAAIC,EAAQ,CACR,IAAK,IAAItwB,EAAI,EAAGA,EAAIswB,EAAO7tB,WAAYzC,IACnC0Y,EAAI7O,KAAKymB,EAAO9qB,MAAMxF,IAC1B0rB,EAAQA,EAAMgC,cAAc4C,EAChC,CAIA,IAAIO,EAAgBnb,EAASlT,KAAO2tB,GAAe/vB,EAAMF,QAAQsC,KAAOpC,EAAMM,SAG9E,MAAOkwB,EAAQlb,EAASjT,WAAY,CAChC,IAAIsoB,EAAOrV,EAASlQ,MAAMorB,GAAQE,EAAUpF,EAAMI,UAAUf,EAAKpoB,MACjE,IAAKmuB,EACD,MACJF,KACIA,EAAQ,GAAkB,GAAb9X,GAAkBiS,EAAK7qB,QAAQsC,QAC5CkpB,EAAQoF,EACRpY,EAAI7O,KAAKknB,GAAehG,EAAK3jB,KAAKzE,EAAKquB,aAAajG,EAAKjnB,QAAkB,GAAT8sB,EAAa9X,EAAY,EAAG8X,GAASlb,EAASjT,WAAaouB,GAAgB,IAErJ,CACA,IAAII,EAAQL,GAASlb,EAASjT,WACzBwuB,IACDJ,GAAgB,GACpBzxB,KAAKqwB,OAASyB,EAAc9xB,KAAKqwB,OAAQY,EAAe,UAAc3X,IACtEtZ,KAAKowB,SAASa,GAAe3E,MAAQA,EAGjCuF,GAASJ,EAAe,GAAKjvB,GAAUA,EAAOe,MAAQvD,KAAKowB,SAASpwB,KAAK6C,OAAOU,MAAQvD,KAAKowB,SAASvvB,OAAS,GAC/Gb,KAAKsxB,oBAET,IAAK,IAAI1wB,EAAI,EAAGyX,EAAM/B,EAAU1V,EAAI6wB,EAAc7wB,IAAK,CACnD,IAAIoB,EAAOqW,EAAIjX,UACfpB,KAAKowB,SAAS3lB,KAAK,CAAElH,KAAMvB,EAAKuB,KAAM+oB,MAAOtqB,EAAK+rB,eAAe/rB,EAAKqB,cACtEgV,EAAMrW,EAAKlB,OACf,CAIAd,KAAKmwB,SAAY0B,EACG,GAAdd,EAAkB,WACd,IAAI,KAAMM,EAAiBrwB,EAAMF,QAASiwB,EAAa,EAAG,GAAIA,EAAa,EAAGU,EAAe,EAAIzwB,EAAMM,QAAUyvB,EAAa,GAF/G,IAAI,KAAMM,EAAiBrwB,EAAMF,QAASiwB,EAAYS,GAAQxwB,EAAM0Y,UAAW1Y,EAAMM,QAGlH,CACAqvB,iBACI,IAAK3wB,KAAKU,IAAI8B,OAAOV,YACjB,OAAQ,EACZ,IAAqCiwB,EAAjCjkB,EAAM9N,KAAKowB,SAASpwB,KAAK6C,OAC7B,IAAKiL,EAAIvK,KAAKzB,cAAgBkwB,GAAiBhyB,KAAKU,IAAKV,KAAKU,IAAImC,MAAOiL,EAAIvK,KAAMuK,EAAIwe,OAAO,IACzFtsB,KAAKU,IAAImC,OAAS7C,KAAK6C,QAAUkvB,EAAQ/xB,KAAKiyB,eAAejyB,KAAKU,OAASqxB,EAAMlvB,OAAS7C,KAAK6C,MAChG,OAAQ,EACZ,IAAI,MAAEA,GAAU7C,KAAKU,IAAKsC,EAAQhD,KAAKU,IAAIsC,MAAMH,GACjD,MAAOA,EAAQ,GAAKG,GAAShD,KAAKU,IAAI+F,MAAM5D,KACtCG,EACN,OAAOA,CACX,CACAivB,eAAevxB,GACXgY,EAAM,IAAK,IAAI9X,EAAImO,KAAK7O,IAAIF,KAAK6C,MAAOnC,EAAImC,OAAQjC,GAAK,EAAGA,IAAK,CAC7D,IAAI,MAAE0rB,EAAK,KAAE/oB,GAASvD,KAAKowB,SAASxvB,GAChCsxB,EAAYtxB,EAAIF,EAAImC,OAASnC,EAAI+F,IAAI7F,EAAI,IAAMF,EAAIL,KAAOK,EAAImC,OAASjC,EAAI,IAC3EsvB,EAAM8B,GAAiBtxB,EAAKE,EAAG2C,EAAM+oB,EAAO4F,GAChD,GAAKhC,EAAL,CAEA,IAAK,IAAIrc,EAAIjT,EAAI,EAAGiT,GAAK,EAAGA,IAAK,CAC7B,IAAI,MAAEyY,EAAK,KAAE/oB,GAASvD,KAAKowB,SAASvc,GAChC6d,EAAUM,GAAiBtxB,EAAKmT,EAAGtQ,EAAM+oB,GAAO,GACpD,IAAKoF,GAAWA,EAAQruB,WACpB,SAASqV,CACjB,CACA,MAAO,CAAE7V,MAAOjC,EAAGsvB,MAAKtS,KAAMsU,EAAYxxB,EAAIK,IAAIyD,QAAQ9D,EAAIsC,MAAMpC,EAAI,IAAMF,EAPlE,CAQhB,CACJ,CACAmwB,MAAMnwB,GACF,IAAImwB,EAAQ7wB,KAAKiyB,eAAevxB,GAChC,IAAKmwB,EACD,OAAO,KACX,MAAO7wB,KAAK6C,MAAQguB,EAAMhuB,MACtB7C,KAAKsxB,oBACLT,EAAMX,IAAI7sB,aACVrD,KAAKqwB,OAASyB,EAAc9xB,KAAKqwB,OAAQQ,EAAMhuB,MAAOguB,EAAMX,MAChExvB,EAAMmwB,EAAMjT,KACZ,IAAK,IAAI/J,EAAIgd,EAAMhuB,MAAQ,EAAGgR,GAAKnT,EAAImC,MAAOgR,IAAK,CAC/C,IAAI7R,EAAOtB,EAAIsB,KAAK6R,GAAIyF,EAAMtX,EAAKuB,KAAKgpB,aAAaK,WAAW5qB,EAAKlB,SAAS,EAAMJ,EAAIkC,MAAMiR,IAC9F7T,KAAKuxB,iBAAiBvvB,EAAKuB,KAAMvB,EAAKoO,MAAOkJ,EACjD,CACA,OAAO5Y,CACX,CACA6wB,iBAAiBhuB,EAAM6M,EAAQ,KAAMtP,GACjC,IAAIgN,EAAM9N,KAAKowB,SAASpwB,KAAK6C,OAC7BiL,EAAIwe,MAAQxe,EAAIwe,MAAMI,UAAUnpB,GAChCvD,KAAKqwB,OAASyB,EAAc9xB,KAAKqwB,OAAQrwB,KAAK6C,MAAO,UAAcU,EAAK7D,OAAO0Q,EAAOtP,KACtFd,KAAKowB,SAAS3lB,KAAK,CAAElH,OAAM+oB,MAAO/oB,EAAKgpB,cAC3C,CACA+E,oBACI,IAAIa,EAAOnyB,KAAKowB,SAASgC,MACrB9Y,EAAM6Y,EAAK7F,MAAMM,WAAW,YAAgB,GAC5CtT,EAAIjW,aACJrD,KAAKqwB,OAASyB,EAAc9xB,KAAKqwB,OAAQrwB,KAAKowB,SAASvvB,OAAQyY,GACvE,EAEJ,SAAS+X,EAAiB/a,EAAUzT,EAAOwvB,GACvC,OAAa,GAATxvB,EACOyT,EAAS2W,WAAWoF,EAAO/b,EAASjT,YACxCiT,EAAS6Y,aAAa,EAAG7Y,EAASjC,WAAWgC,KAAKgb,EAAiB/a,EAASjC,WAAWvT,QAAS+B,EAAQ,EAAGwvB,IACtH,CACA,SAASP,EAAcxb,EAAUzT,EAAO/B,GACpC,OAAa,GAAT+B,EACOyT,EAASwD,OAAOhZ,GACpBwV,EAAS6Y,aAAa7Y,EAASjT,WAAa,EAAGiT,EAASlV,UAAUiV,KAAKyb,EAAcxb,EAASlV,UAAUN,QAAS+B,EAAQ,EAAG/B,IACvI,CACA,SAASkwB,EAAU1a,EAAUzT,GACzB,IAAK,IAAIjC,EAAI,EAAGA,EAAIiC,EAAOjC,IACvB0V,EAAWA,EAASjC,WAAWvT,QACnC,OAAOwV,CACX,CACA,SAASqb,GAAe3vB,EAAM0X,EAAWpY,GACrC,GAAIoY,GAAa,EACb,OAAO1X,EACX,IAAIqY,EAAOrY,EAAKlB,QAQhB,OAPI4Y,EAAY,IACZW,EAAOA,EAAK8U,aAAa,EAAGwC,GAAetX,EAAKhG,WAAYqF,EAAY,EAAsB,GAAnBW,EAAKhX,WAAkB/B,EAAU,EAAI,KAChHoY,EAAY,IACZW,EAAOrY,EAAKuB,KAAKgpB,aAAaK,WAAWvS,GAAMP,OAAOO,GAClD/Y,GAAW,IACX+Y,EAAOA,EAAKP,OAAO9X,EAAKuB,KAAKgpB,aAAa+B,cAAcjU,GAAMuS,WAAW,YAAgB,MAE1F5qB,EAAKqU,KAAKgE,EACrB,CACA,SAAS2X,GAAiBtxB,EAAKmC,EAAOU,EAAM+oB,EAAO6F,GAC/C,IAAInwB,EAAOtB,EAAIsB,KAAKa,GAAQD,EAAQuvB,EAAOzxB,EAAIqd,WAAWlb,GAASnC,EAAIkC,MAAMC,GAC7E,GAAID,GAASZ,EAAKqB,aAAeE,EAAK4tB,kBAAkBnvB,EAAKuB,MACzD,OAAO,KACX,IAAI2sB,EAAM5D,EAAMM,WAAW5qB,EAAKlB,SAAS,EAAM8B,GAC/C,OAAOstB,IAAQoC,GAAa/uB,EAAMvB,EAAKlB,QAAS8B,GAASstB,EAAM,IACnE,CACA,SAASoC,GAAa/uB,EAAM+S,EAAUhG,GAClC,IAAK,IAAI1P,EAAI0P,EAAO1P,EAAI0V,EAASjT,WAAYzC,IACzC,IAAK2C,EAAKgvB,YAAYjc,EAASlQ,MAAMxF,GAAG8D,OACpC,OAAO,EACf,OAAO,CACX,CACA,SAAS8tB,GAAejvB,GACpB,OAAOA,EAAKmC,KAAK+sB,UAAYlvB,EAAKmC,KAAKgtB,kBAC3C,CACA,SAAShxB,GAAaR,EAAIX,EAAME,EAAIO,GAChC,IAAKA,EAAMoC,KACP,OAAOlC,EAAGe,YAAY1B,EAAME,GAChC,IAAID,EAAQU,EAAGH,IAAIyD,QAAQjE,GAAOG,EAAMQ,EAAGH,IAAIyD,QAAQ/D,GACvD,GAAIuvB,EAAcxvB,EAAOE,EAAKM,GAC1B,OAAOE,EAAGsF,KAAK,IAAIwkB,EAAYzqB,EAAME,EAAIO,IAC7C,IAAI2xB,EAAeC,GAAcpyB,EAAOU,EAAGH,IAAIyD,QAAQ/D,IAEV,GAAzCkyB,EAAaA,EAAa9xB,OAAS,IACnC8xB,EAAaP,MAGjB,IAAIS,IAAoBryB,EAAMqC,MAAQ,GACtC8vB,EAAarhB,QAAQuhB,GAKrB,IAAK,IAAIhf,EAAIrT,EAAMqC,MAAOxC,EAAMG,EAAMH,IAAM,EAAGwT,EAAI,EAAGA,IAAKxT,IAAO,CAC9D,IAAIqF,EAAOlF,EAAMwB,KAAK6R,GAAGtQ,KAAKmC,KAC9B,GAAIA,EAAK+sB,UAAY/sB,EAAKotB,mBAAqBptB,EAAKkN,UAChD,MACA+f,EAAa5P,QAAQlP,IAAM,EAC3Bgf,EAAkBhf,EACbrT,EAAMuC,OAAO8Q,IAAMxT,GACxBsyB,EAAa5d,OAAO,EAAG,GAAIlB,EACnC,CAGA,IAAIkf,EAAuBJ,EAAa5P,QAAQ8P,GAC5CG,EAAY,GAAIC,EAAiBjyB,EAAM0Y,UAC3C,IAAK,IAAI5Y,EAAUE,EAAMF,QAASF,EAAI,GAAIA,IAAK,CAC3C,IAAIoB,EAAOlB,EAAQuT,WAEnB,GADA2e,EAAUvoB,KAAKzI,GACXpB,GAAKI,EAAM0Y,UACX,MACJ5Y,EAAUkB,EAAKlB,OACnB,CAGA,IAAK,IAAI+S,EAAIof,EAAiB,EAAGpf,GAAK,EAAGA,IAAK,CAC1C,IAAItQ,EAAOyvB,EAAUnf,GAAGtQ,KAAM2vB,EAAMV,GAAejvB,GACnD,GAAI2vB,GAAO1yB,EAAMwB,KAAK+wB,GAAsBxvB,MAAQA,EAChD0vB,EAAiBpf,OAChB,GAAIqf,IAAQ3vB,EAAKzB,YAClB,KACR,CACA,IAAK,IAAI2J,EAAIzK,EAAM0Y,UAAWjO,GAAK,EAAGA,IAAK,CACvC,IAAI0nB,GAAa1nB,EAAIwnB,EAAiB,IAAMjyB,EAAM0Y,UAAY,GAC1DF,EAASwZ,EAAUG,GACvB,GAAK3Z,EAEL,IAAK,IAAI5Y,EAAI,EAAGA,EAAI+xB,EAAa9xB,OAAQD,IAAK,CAG1C,IAAIwyB,EAAcT,GAAc/xB,EAAImyB,GAAwBJ,EAAa9xB,QAASwyB,GAAS,EACvFD,EAAc,IACdC,GAAS,EACTD,GAAeA,GAEnB,IAAI5wB,EAAShC,EAAMwB,KAAKoxB,EAAc,GAAIxwB,EAAQpC,EAAMoC,MAAMwwB,EAAc,GAC5E,GAAI5wB,EAAOwrB,eAAeprB,EAAOA,EAAO4W,EAAOjW,KAAMiW,EAAO9U,OACxD,OAAOxD,EAAGD,QAAQT,EAAMuC,OAAOqwB,GAAcC,EAAS3yB,EAAIsC,MAAMowB,GAAe3yB,EAAI,IAAI,KAAM6yB,GAActyB,EAAMF,QAAS,EAAGE,EAAM0Y,UAAWyZ,GAAYA,EAAWnyB,EAAMM,SACnL,CACJ,CACA,IAAIiyB,EAAaryB,EAAGM,MAAMX,OAC1B,IAAK,IAAID,EAAI+xB,EAAa9xB,OAAS,EAAGD,GAAK,EAAGA,IAAK,CAE/C,GADAM,EAAGD,QAAQV,EAAME,EAAIO,GACjBE,EAAGM,MAAMX,OAAS0yB,EAClB,MACJ,IAAI1wB,EAAQ8vB,EAAa/xB,GACrBiC,EAAQ,IAEZtC,EAAOC,EAAMuC,OAAOF,GACpBpC,EAAKC,EAAIsC,MAAMH,GACnB,CACJ,CACA,SAASywB,GAAchd,EAAUzT,EAAO2wB,EAASC,EAASjxB,GACtD,GAAIK,EAAQ2wB,EAAS,CACjB,IAAIna,EAAQ/C,EAASjC,WACrBiC,EAAWA,EAAS6Y,aAAa,EAAG9V,EAAMhD,KAAKid,GAAcja,EAAMvY,QAAS+B,EAAQ,EAAG2wB,EAASC,EAASpa,IAC7G,CACA,GAAIxW,EAAQ4wB,EAAS,CACjB,IAAInH,EAAQ9pB,EAAOurB,eAAe,GAC9Bzd,EAAQgc,EAAMM,WAAWtW,GAAUwD,OAAOxD,GAC9CA,EAAWhG,EAAMwJ,OAAOwS,EAAMgC,cAAche,GAAOsc,WAAW,YAAgB,GAClF,CACA,OAAOtW,CACX,CACA,SAASpU,GAAiBhB,EAAIX,EAAME,EAAIuB,GACpC,IAAKA,EAAKH,UAAYtB,GAAQE,GAAMS,EAAGH,IAAIyD,QAAQjE,GAAMiC,OAAO1B,QAAQsC,KAAM,CAC1E,IAAIswB,EAAQjE,EAAYvuB,EAAGH,IAAKR,EAAMyB,EAAKuB,MAC9B,MAATmwB,IACAnzB,EAAOE,EAAKizB,EACpB,CACAxyB,EAAGQ,aAAanB,EAAME,EAAI,IAAI,KAAM,UAAcuB,GAAO,EAAG,GAChE,CACA,SAASC,GAAYf,EAAIX,EAAME,GAC3B,IAAID,EAAQU,EAAGH,IAAIyD,QAAQjE,GAAOG,EAAMQ,EAAGH,IAAIyD,QAAQ/D,GACnDkzB,EAAUf,GAAcpyB,EAAOE,GACnC,IAAK,IAAIE,EAAI,EAAGA,EAAI+yB,EAAQ9yB,OAAQD,IAAK,CACrC,IAAIiC,EAAQ8wB,EAAQ/yB,GAAI2F,EAAO3F,GAAK+yB,EAAQ9yB,OAAS,EACrD,GAAK0F,GAAiB,GAAT1D,GAAerC,EAAMwB,KAAKa,GAAOU,KAAKgpB,aAAaI,SAC5D,OAAOzrB,EAAG2E,OAAOrF,EAAM8P,MAAMzN,GAAQnC,EAAI+F,IAAI5D,IACjD,GAAIA,EAAQ,IAAM0D,GAAQ/F,EAAMwB,KAAKa,EAAQ,GAAGiqB,WAAWtsB,EAAMoC,MAAMC,EAAQ,GAAInC,EAAIqd,WAAWlb,EAAQ,KACtG,OAAO3B,EAAG2E,OAAOrF,EAAMuC,OAAOF,GAAQnC,EAAIsC,MAAMH,GACxD,CACA,IAAK,IAAIgR,EAAI,EAAGA,GAAKrT,EAAMqC,OAASgR,GAAKnT,EAAImC,MAAOgR,IAChD,GAAItT,EAAOC,EAAM8P,MAAMuD,IAAMrT,EAAMqC,MAAQgR,GAAKpT,EAAKD,EAAMiG,IAAIoN,IAAMnT,EAAI+F,IAAIoN,GAAKpT,GAAMC,EAAImC,MAAQgR,EAChG,OAAO3S,EAAG2E,OAAOrF,EAAMuC,OAAO8Q,GAAIpT,GAE1CS,EAAG2E,OAAOtF,EAAME,EACpB,CAGA,SAASmyB,GAAcpyB,EAAOE,GAC1B,IAAIsL,EAAS,GAAI4nB,EAAW7kB,KAAK7O,IAAIM,EAAMqC,MAAOnC,EAAImC,OACtD,IAAK,IAAIgR,EAAI+f,EAAU/f,GAAK,EAAGA,IAAK,CAChC,IAAIvD,EAAQ9P,EAAM8P,MAAMuD,GACxB,GAAIvD,EAAQ9P,EAAMH,KAAOG,EAAMqC,MAAQgR,IACnCnT,EAAI+F,IAAIoN,GAAKnT,EAAIL,KAAOK,EAAImC,MAAQgR,IACpCrT,EAAMwB,KAAK6R,GAAGtQ,KAAKmC,KAAKkN,WACxBlS,EAAIsB,KAAK6R,GAAGtQ,KAAKmC,KAAKkN,UACtB,OACAtC,GAAS5P,EAAI4P,MAAMuD,IAClBA,GAAKrT,EAAMqC,OAASgR,GAAKnT,EAAImC,OAASrC,EAAMgC,OAAOC,eAAiB/B,EAAI8B,OAAOC,eAC5EoR,GAAKnT,EAAI4P,MAAMuD,EAAI,IAAMvD,EAAQ,IACrCtE,EAAOvB,KAAKoJ,EACpB,CACA,OAAO7H,CACX,CAKA,MAAM6nB,WAAiBnK,EAInB9pB,YAIAS,EAIAyzB,EAEA/qB,GACIzE,QACAtE,KAAKK,IAAMA,EACXL,KAAK8zB,KAAOA,EACZ9zB,KAAK+I,MAAQA,CACjB,CACAY,MAAM5I,GACF,IAAIiB,EAAOjB,EAAIoQ,OAAOnR,KAAKK,KAC3B,IAAK2B,EACD,OAAO+nB,EAAWI,KAAK,wCAC3B,IAAI/Z,EAAQ3Q,OAAOC,OAAO,MAC1B,IAAK,IAAI2E,KAAQrC,EAAKoO,MAClBA,EAAM/L,GAAQrC,EAAKoO,MAAM/L,GAC7B+L,EAAMpQ,KAAK8zB,MAAQ9zB,KAAK+I,MACxB,IAAIzB,EAAUtF,EAAKuB,KAAK7D,OAAO0Q,EAAO,KAAMpO,EAAK0C,OACjD,OAAOqlB,EAAWU,YAAY1pB,EAAKf,KAAKK,IAAKL,KAAKK,IAAM,EAAG,IAAI,KAAM,UAAciH,GAAU,EAAGtF,EAAK4oB,OAAS,EAAI,GACtH,CACAjB,SACI,OAAO/B,EAAQjnB,KACnB,CACA8nB,OAAO1nB,GACH,OAAO,IAAI8yB,GAAS7zB,KAAKK,IAAKL,KAAK8zB,KAAM/yB,EAAIoQ,OAAOnR,KAAKK,KAAK+P,MAAMpQ,KAAK8zB,MAC7E,CACAnyB,IAAIF,GACA,IAAIpB,EAAMoB,EAAQ8D,UAAUvF,KAAKK,IAAK,GACtC,OAAOA,EAAIqnB,aAAe,KAAO,IAAImM,GAASxzB,EAAIA,IAAKL,KAAK8zB,KAAM9zB,KAAK+I,MAC3E,CACA/D,SACI,MAAO,CAAE6kB,SAAU,OAAQxpB,IAAKL,KAAKK,IAAKyzB,KAAM9zB,KAAK8zB,KAAM/qB,MAAO/I,KAAK+I,MAC3E,CACA5G,gBAAgByG,EAAQtF,GACpB,GAAuB,iBAAZA,EAAKjD,KAAuC,iBAAbiD,EAAKwwB,KAC3C,MAAM,IAAItwB,WAAW,uCACzB,OAAO,IAAIqwB,GAASvwB,EAAKjD,IAAKiD,EAAKwwB,KAAMxwB,EAAKyF,MAClD,EAEJ2gB,EAAK5lB,OAAO,OAAQ+vB,IAKpB,IAAIE,GAAiB,cAAc1Y,QAEnC0Y,GAAiB,SAASA,EAAe9J,GACrC,IAAI+J,EAAM3Y,MAAMvQ,KAAK9K,KAAMiqB,GAE3B,OADA+J,EAAIC,UAAYF,EAAelwB,UACxBmwB,CACX,EACAD,GAAelwB,UAAYpE,OAAOC,OAAO2b,MAAMxX,WAC/CkwB,GAAelwB,UAAUjE,YAAcm0B,GACvCA,GAAelwB,UAAUQ,KAAO,iBAQhC,MAAM6vB,GAIFt0B,YAKAmB,GACIf,KAAKe,IAAMA,EAIXf,KAAKwB,MAAQ,GAIbxB,KAAKm0B,KAAO,GAIZn0B,KAAKyB,QAAU,IAAIknB,CACvB,CAII5lB,aAAW,OAAO/C,KAAKm0B,KAAKtzB,OAASb,KAAKm0B,KAAK,GAAKn0B,KAAKe,GAAK,CAKlEyF,KAAKA,GACD,IAAIwF,EAAShM,KAAKo0B,UAAU5tB,GAC5B,GAAIwF,EAAOge,OACP,MAAM,IAAI+J,GAAe/nB,EAAOge,QACpC,OAAOhqB,IACX,CAKAo0B,UAAU5tB,GACN,IAAIwF,EAASxF,EAAKmD,MAAM3J,KAAKe,KAG7B,OAFKiL,EAAOge,QACRhqB,KAAKqI,QAAQ7B,EAAMwF,EAAOjL,KACvBiL,CACX,CAKIwQ,iBACA,OAAOxc,KAAKwB,MAAMX,OAAS,CAC/B,CAIAwH,QAAQ7B,EAAMzF,GACVf,KAAKm0B,KAAK1pB,KAAKzK,KAAKe,KACpBf,KAAKwB,MAAMiJ,KAAKjE,GAChBxG,KAAKyB,QAAQonB,UAAUriB,EAAKmjB,UAC5B3pB,KAAKe,IAAMA,CACf,CAKAE,QAAQV,EAAME,EAAKF,EAAMS,EAAQ,YAC7B,IAAIwF,EAAOupB,EAAY/vB,KAAKe,IAAKR,EAAME,EAAIO,GAG3C,OAFIwF,GACAxG,KAAKwG,KAAKA,GACPxG,IACX,CAKA+B,YAAYxB,EAAME,EAAIK,GAClB,OAAOd,KAAKiB,QAAQV,EAAME,EAAI,IAAI,KAAM,UAAcK,GAAU,EAAG,GACvE,CAIA+E,OAAOtF,EAAME,GACT,OAAOT,KAAKiB,QAAQV,EAAME,EAAI,WAClC,CAIA+Y,OAAOnZ,EAAKS,GACR,OAAOd,KAAK+B,YAAY1B,EAAKA,EAAKS,EACtC,CAoBAY,aAAanB,EAAME,EAAIO,GAEnB,OADAU,GAAa1B,KAAMO,EAAME,EAAIO,GACtBhB,IACX,CAUAkC,iBAAiB3B,EAAME,EAAIuB,GAEvB,OADAE,GAAiBlC,KAAMO,EAAME,EAAIuB,GAC1BhC,IACX,CAKAiC,YAAY1B,EAAME,GAEd,OADAwB,GAAYjC,KAAMO,EAAME,GACjBT,IACX,CAQAotB,KAAKJ,EAAO1gB,GAER,OADA8gB,EAAKptB,KAAMgtB,EAAO1gB,GACXtM,IACX,CAKAoS,KAAK/R,EAAKwC,EAAQ,GAEd,OADAuP,EAAKpS,KAAMK,EAAKwC,GACT7C,IACX,CAMAouB,KAAKpB,EAAOqB,GAER,OADAD,EAAKpuB,KAAMgtB,EAAOqB,GACXruB,IACX,CAKAuuB,aAAahuB,EAAME,EAAKF,EAAMgD,EAAM6M,EAAQ,MAExC,OADAme,EAAavuB,KAAMO,EAAME,EAAI8C,EAAM6M,GAC5BpQ,IACX,CAKAoZ,cAAc/Y,EAAKkD,EAAM6M,EAAQ,KAAM1L,GAEnC,OADA0U,EAAcpZ,KAAMK,EAAKkD,EAAM6M,EAAO1L,GAC/B1E,IACX,CAIAq0B,iBAAiBh0B,EAAKyzB,EAAM/qB,GAExB,OADA/I,KAAKwG,KAAK,IAAIqtB,GAASxzB,EAAKyzB,EAAM/qB,IAC3B/I,IACX,CAIAs0B,YAAYj0B,EAAK2H,GAEb,OADAhI,KAAKwG,KAAK,IAAImkB,EAAgBtqB,EAAK2H,IAC5BhI,IACX,CAKAu0B,eAAel0B,EAAK2H,GAChB,KAAMA,aAAgB,MAAO,CACzB,IAAIhG,EAAOhC,KAAKe,IAAIoQ,OAAO9Q,GAC3B,IAAK2B,EACD,MAAM,IAAIwB,WAAW,uBAAyBnD,GAElD,GADA2H,EAAOA,EAAK8iB,QAAQ9oB,EAAK0C,QACpBsD,EACD,OAAOhI,IACf,CAEA,OADAA,KAAKwG,KAAK,IAAIukB,EAAmB1qB,EAAK2H,IAC/BhI,IACX,CAQA8R,MAAMzR,EAAKwC,EAAQ,EAAGksB,GAElB,OADAjd,EAAM9R,KAAMK,EAAKwC,EAAOksB,GACjB/uB,IACX,CAIA6rB,QAAQtrB,EAAME,EAAIuH,GAEd,OADA6jB,EAAQ7rB,KAAMO,EAAME,EAAIuH,GACjBhI,IACX,CAOAisB,WAAW1rB,EAAME,EAAIuH,GAEjB,OADAikB,EAAWjsB,KAAMO,EAAME,EAAIuH,GACpBhI,IACX,CAOAosB,kBAAkB/rB,EAAKgsB,EAAYC,GAE/B,OADAF,EAAkBpsB,KAAMK,EAAKgsB,EAAYC,GAClCtsB,IACX,E","sources":["webpack://ida-jandaya/./node_modules/prosemirror-state/dist/index.js","webpack://ida-jandaya/./node_modules/prosemirror-tables/dist/index.js","webpack://ida-jandaya/./node_modules/prosemirror-transform/dist/index.js"],"sourcesContent":["import { Slice, Fragment, Mark, Node } from 'prosemirror-model';\nimport { ReplaceStep, ReplaceAroundStep, Transform } from 'prosemirror-transform';\n\nconst classesById = Object.create(null);\n/**\nSuperclass for editor selections. Every selection type should\nextend this. Should not be instantiated directly.\n*/\nclass Selection {\n    /**\n    Initialize a selection with the head and anchor and ranges. If no\n    ranges are given, constructs a single range across `$anchor` and\n    `$head`.\n    */\n    constructor(\n    /**\n    The resolved anchor of the selection (the side that stays in\n    place when the selection is modified).\n    */\n    $anchor, \n    /**\n    The resolved head of the selection (the side that moves when\n    the selection is modified).\n    */\n    $head, ranges) {\n        this.$anchor = $anchor;\n        this.$head = $head;\n        this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];\n    }\n    /**\n    The selection's anchor, as an unresolved position.\n    */\n    get anchor() { return this.$anchor.pos; }\n    /**\n    The selection's head.\n    */\n    get head() { return this.$head.pos; }\n    /**\n    The lower bound of the selection's main range.\n    */\n    get from() { return this.$from.pos; }\n    /**\n    The upper bound of the selection's main range.\n    */\n    get to() { return this.$to.pos; }\n    /**\n    The resolved lower  bound of the selection's main range.\n    */\n    get $from() {\n        return this.ranges[0].$from;\n    }\n    /**\n    The resolved upper bound of the selection's main range.\n    */\n    get $to() {\n        return this.ranges[0].$to;\n    }\n    /**\n    Indicates whether the selection contains any content.\n    */\n    get empty() {\n        let ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++)\n            if (ranges[i].$from.pos != ranges[i].$to.pos)\n                return false;\n        return true;\n    }\n    /**\n    Get the content of this selection as a slice.\n    */\n    content() {\n        return this.$from.doc.slice(this.from, this.to, true);\n    }\n    /**\n    Replace the selection with a slice or, if no slice is given,\n    delete the selection. Will append to the given transaction.\n    */\n    replace(tr, content = Slice.empty) {\n        // Put the new selection at the position after the inserted\n        // content. When that ended in an inline node, search backwards,\n        // to get the position after that node. If not, search forward.\n        let lastNode = content.content.lastChild, lastParent = null;\n        for (let i = 0; i < content.openEnd; i++) {\n            lastParent = lastNode;\n            lastNode = lastNode.lastChild;\n        }\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);\n            if (i == 0)\n                selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1);\n        }\n    }\n    /**\n    Replace the selection with the given node, appending the changes\n    to the given transaction.\n    */\n    replaceWith(tr, node) {\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            let from = mapping.map($from.pos), to = mapping.map($to.pos);\n            if (i) {\n                tr.deleteRange(from, to);\n            }\n            else {\n                tr.replaceRangeWith(from, to, node);\n                selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);\n            }\n        }\n    }\n    /**\n    Find a valid cursor or leaf node selection starting at the given\n    position and searching back if `dir` is negative, and forward if\n    positive. When `textOnly` is true, only consider cursor\n    selections. Will return null when no valid selection position is\n    found.\n    */\n    static findFrom($pos, dir, textOnly = false) {\n        let inner = $pos.parent.inlineContent ? new TextSelection($pos)\n            : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);\n        if (inner)\n            return inner;\n        for (let depth = $pos.depth - 1; depth >= 0; depth--) {\n            let found = dir < 0\n                ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)\n                : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);\n            if (found)\n                return found;\n        }\n        return null;\n    }\n    /**\n    Find a valid cursor or leaf node selection near the given\n    position. Searches forward first by default, but if `bias` is\n    negative, it will search backwards first.\n    */\n    static near($pos, bias = 1) {\n        return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0));\n    }\n    /**\n    Find the cursor or leaf node selection closest to the start of\n    the given document. Will return an\n    [`AllSelection`](https://prosemirror.net/docs/ref/#state.AllSelection) if no valid position\n    exists.\n    */\n    static atStart(doc) {\n        return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc);\n    }\n    /**\n    Find the cursor or leaf node selection closest to the end of the\n    given document.\n    */\n    static atEnd(doc) {\n        return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc);\n    }\n    /**\n    Deserialize the JSON representation of a selection. Must be\n    implemented for custom classes (as a static class method).\n    */\n    static fromJSON(doc, json) {\n        if (!json || !json.type)\n            throw new RangeError(\"Invalid input for Selection.fromJSON\");\n        let cls = classesById[json.type];\n        if (!cls)\n            throw new RangeError(`No selection type ${json.type} defined`);\n        return cls.fromJSON(doc, json);\n    }\n    /**\n    To be able to deserialize selections from JSON, custom selection\n    classes must register themselves with an ID string, so that they\n    can be disambiguated. Try to pick something that's unlikely to\n    clash with classes from other modules.\n    */\n    static jsonID(id, selectionClass) {\n        if (id in classesById)\n            throw new RangeError(\"Duplicate use of selection JSON ID \" + id);\n        classesById[id] = selectionClass;\n        selectionClass.prototype.jsonID = id;\n        return selectionClass;\n    }\n    /**\n    Get a [bookmark](https://prosemirror.net/docs/ref/#state.SelectionBookmark) for this selection,\n    which is a value that can be mapped without having access to a\n    current document, and later resolved to a real selection for a\n    given document again. (This is used mostly by the history to\n    track and restore old selections.) The default implementation of\n    this method just converts the selection to a text selection and\n    returns the bookmark for that.\n    */\n    getBookmark() {\n        return TextSelection.between(this.$anchor, this.$head).getBookmark();\n    }\n}\nSelection.prototype.visible = true;\n/**\nRepresents a selected range in a document.\n*/\nclass SelectionRange {\n    /**\n    Create a range.\n    */\n    constructor(\n    /**\n    The lower bound of the range.\n    */\n    $from, \n    /**\n    The upper bound of the range.\n    */\n    $to) {\n        this.$from = $from;\n        this.$to = $to;\n    }\n}\nlet warnedAboutTextSelection = false;\nfunction checkTextSelection($pos) {\n    if (!warnedAboutTextSelection && !$pos.parent.inlineContent) {\n        warnedAboutTextSelection = true;\n        console[\"warn\"](\"TextSelection endpoint not pointing into a node with inline content (\" + $pos.parent.type.name + \")\");\n    }\n}\n/**\nA text selection represents a classical editor selection, with a\nhead (the moving side) and anchor (immobile side), both of which\npoint into textblock nodes. It can be empty (a regular cursor\nposition).\n*/\nclass TextSelection extends Selection {\n    /**\n    Construct a text selection between the given points.\n    */\n    constructor($anchor, $head = $anchor) {\n        checkTextSelection($anchor);\n        checkTextSelection($head);\n        super($anchor, $head);\n    }\n    /**\n    Returns a resolved position if this is a cursor selection (an\n    empty text selection), and null otherwise.\n    */\n    get $cursor() { return this.$anchor.pos == this.$head.pos ? this.$head : null; }\n    map(doc, mapping) {\n        let $head = doc.resolve(mapping.map(this.head));\n        if (!$head.parent.inlineContent)\n            return Selection.near($head);\n        let $anchor = doc.resolve(mapping.map(this.anchor));\n        return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head);\n    }\n    replace(tr, content = Slice.empty) {\n        super.replace(tr, content);\n        if (content == Slice.empty) {\n            let marks = this.$from.marksAcross(this.$to);\n            if (marks)\n                tr.ensureMarks(marks);\n        }\n    }\n    eq(other) {\n        return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head;\n    }\n    getBookmark() {\n        return new TextBookmark(this.anchor, this.head);\n    }\n    toJSON() {\n        return { type: \"text\", anchor: this.anchor, head: this.head };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.anchor != \"number\" || typeof json.head != \"number\")\n            throw new RangeError(\"Invalid input for TextSelection.fromJSON\");\n        return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head));\n    }\n    /**\n    Create a text selection from non-resolved positions.\n    */\n    static create(doc, anchor, head = anchor) {\n        let $anchor = doc.resolve(anchor);\n        return new this($anchor, head == anchor ? $anchor : doc.resolve(head));\n    }\n    /**\n    Return a text selection that spans the given positions or, if\n    they aren't text positions, find a text selection near them.\n    `bias` determines whether the method searches forward (default)\n    or backwards (negative number) first. Will fall back to calling\n    [`Selection.near`](https://prosemirror.net/docs/ref/#state.Selection^near) when the document\n    doesn't contain a valid text position.\n    */\n    static between($anchor, $head, bias) {\n        let dPos = $anchor.pos - $head.pos;\n        if (!bias || dPos)\n            bias = dPos >= 0 ? 1 : -1;\n        if (!$head.parent.inlineContent) {\n            let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);\n            if (found)\n                $head = found.$head;\n            else\n                return Selection.near($head, bias);\n        }\n        if (!$anchor.parent.inlineContent) {\n            if (dPos == 0) {\n                $anchor = $head;\n            }\n            else {\n                $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;\n                if (($anchor.pos < $head.pos) != (dPos < 0))\n                    $anchor = $head;\n            }\n        }\n        return new TextSelection($anchor, $head);\n    }\n}\nSelection.jsonID(\"text\", TextSelection);\nclass TextBookmark {\n    constructor(anchor, head) {\n        this.anchor = anchor;\n        this.head = head;\n    }\n    map(mapping) {\n        return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head));\n    }\n    resolve(doc) {\n        return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head));\n    }\n}\n/**\nA node selection is a selection that points at a single node. All\nnodes marked [selectable](https://prosemirror.net/docs/ref/#model.NodeSpec.selectable) can be the\ntarget of a node selection. In such a selection, `from` and `to`\npoint directly before and after the selected node, `anchor` equals\n`from`, and `head` equals `to`..\n*/\nclass NodeSelection extends Selection {\n    /**\n    Create a node selection. Does not verify the validity of its\n    argument.\n    */\n    constructor($pos) {\n        let node = $pos.nodeAfter;\n        let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n        super($pos, $end);\n        this.node = node;\n    }\n    map(doc, mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        let $pos = doc.resolve(pos);\n        if (deleted)\n            return Selection.near($pos);\n        return new NodeSelection($pos);\n    }\n    content() {\n        return new Slice(Fragment.from(this.node), 0, 0);\n    }\n    eq(other) {\n        return other instanceof NodeSelection && other.anchor == this.anchor;\n    }\n    toJSON() {\n        return { type: \"node\", anchor: this.anchor };\n    }\n    getBookmark() { return new NodeBookmark(this.anchor); }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.anchor != \"number\")\n            throw new RangeError(\"Invalid input for NodeSelection.fromJSON\");\n        return new NodeSelection(doc.resolve(json.anchor));\n    }\n    /**\n    Create a node selection from non-resolved positions.\n    */\n    static create(doc, from) {\n        return new NodeSelection(doc.resolve(from));\n    }\n    /**\n    Determines whether the given node may be selected as a node\n    selection.\n    */\n    static isSelectable(node) {\n        return !node.isText && node.type.spec.selectable !== false;\n    }\n}\nNodeSelection.prototype.visible = false;\nSelection.jsonID(\"node\", NodeSelection);\nclass NodeBookmark {\n    constructor(anchor) {\n        this.anchor = anchor;\n    }\n    map(mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos);\n    }\n    resolve(doc) {\n        let $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;\n        if (node && NodeSelection.isSelectable(node))\n            return new NodeSelection($pos);\n        return Selection.near($pos);\n    }\n}\n/**\nA selection type that represents selecting the whole document\n(which can not necessarily be expressed with a text selection, when\nthere are for example leaf block nodes at the start or end of the\ndocument).\n*/\nclass AllSelection extends Selection {\n    /**\n    Create an all-selection over the given document.\n    */\n    constructor(doc) {\n        super(doc.resolve(0), doc.resolve(doc.content.size));\n    }\n    replace(tr, content = Slice.empty) {\n        if (content == Slice.empty) {\n            tr.delete(0, tr.doc.content.size);\n            let sel = Selection.atStart(tr.doc);\n            if (!sel.eq(tr.selection))\n                tr.setSelection(sel);\n        }\n        else {\n            super.replace(tr, content);\n        }\n    }\n    toJSON() { return { type: \"all\" }; }\n    /**\n    @internal\n    */\n    static fromJSON(doc) { return new AllSelection(doc); }\n    map(doc) { return new AllSelection(doc); }\n    eq(other) { return other instanceof AllSelection; }\n    getBookmark() { return AllBookmark; }\n}\nSelection.jsonID(\"all\", AllSelection);\nconst AllBookmark = {\n    map() { return this; },\n    resolve(doc) { return new AllSelection(doc); }\n};\n// FIXME we'll need some awareness of text direction when scanning for selections\n// Try to find a selection inside the given node. `pos` points at the\n// position where the search starts. When `text` is true, only return\n// text selections.\nfunction findSelectionIn(doc, node, pos, index, dir, text = false) {\n    if (node.inlineContent)\n        return TextSelection.create(doc, pos);\n    for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n        let child = node.child(i);\n        if (!child.isAtom) {\n            let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);\n            if (inner)\n                return inner;\n        }\n        else if (!text && NodeSelection.isSelectable(child)) {\n            return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0));\n        }\n        pos += child.nodeSize * dir;\n    }\n    return null;\n}\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n    let last = tr.steps.length - 1;\n    if (last < startLen)\n        return;\n    let step = tr.steps[last];\n    if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep))\n        return;\n    let map = tr.mapping.maps[last], end;\n    map.forEach((_from, _to, _newFrom, newTo) => { if (end == null)\n        end = newTo; });\n    tr.setSelection(Selection.near(tr.doc.resolve(end), bias));\n}\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4;\n/**\nAn editor state transaction, which can be applied to a state to\ncreate an updated state. Use\n[`EditorState.tr`](https://prosemirror.net/docs/ref/#state.EditorState.tr) to create an instance.\n\nTransactions track changes to the document (they are a subclass of\n[`Transform`](https://prosemirror.net/docs/ref/#transform.Transform)), but also other state changes,\nlike selection updates and adjustments of the set of [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks). In addition, you can store\nmetadata properties in a transaction, which are extra pieces of\ninformation that client code or plugins can use to describe what a\ntransaction represents, so that they can update their [own\nstate](https://prosemirror.net/docs/ref/#state.StateField) accordingly.\n\nThe [editor view](https://prosemirror.net/docs/ref/#view.EditorView) uses a few metadata properties:\nit will attach a property `\"pointer\"` with the value `true` to\nselection transactions directly caused by mouse or touch input, and\na `\"uiEvent\"` property of that may be `\"paste\"`, `\"cut\"`, or `\"drop\"`.\n*/\nclass Transaction extends Transform {\n    /**\n    @internal\n    */\n    constructor(state) {\n        super(state.doc);\n        // The step count for which the current selection is valid.\n        this.curSelectionFor = 0;\n        // Bitfield to track which aspects of the state were updated by\n        // this transaction.\n        this.updated = 0;\n        // Object used to store metadata properties for the transaction.\n        this.meta = Object.create(null);\n        this.time = Date.now();\n        this.curSelection = state.selection;\n        this.storedMarks = state.storedMarks;\n    }\n    /**\n    The transaction's current selection. This defaults to the editor\n    selection [mapped](https://prosemirror.net/docs/ref/#state.Selection.map) through the steps in the\n    transaction, but can be overwritten with\n    [`setSelection`](https://prosemirror.net/docs/ref/#state.Transaction.setSelection).\n    */\n    get selection() {\n        if (this.curSelectionFor < this.steps.length) {\n            this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));\n            this.curSelectionFor = this.steps.length;\n        }\n        return this.curSelection;\n    }\n    /**\n    Update the transaction's current selection. Will determine the\n    selection that the editor gets when the transaction is applied.\n    */\n    setSelection(selection) {\n        if (selection.$from.doc != this.doc)\n            throw new RangeError(\"Selection passed to setSelection must point at the current document\");\n        this.curSelection = selection;\n        this.curSelectionFor = this.steps.length;\n        this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;\n        this.storedMarks = null;\n        return this;\n    }\n    /**\n    Whether the selection was explicitly updated by this transaction.\n    */\n    get selectionSet() {\n        return (this.updated & UPDATED_SEL) > 0;\n    }\n    /**\n    Set the current stored marks.\n    */\n    setStoredMarks(marks) {\n        this.storedMarks = marks;\n        this.updated |= UPDATED_MARKS;\n        return this;\n    }\n    /**\n    Make sure the current stored marks or, if that is null, the marks\n    at the selection, match the given set of marks. Does nothing if\n    this is already the case.\n    */\n    ensureMarks(marks) {\n        if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n            this.setStoredMarks(marks);\n        return this;\n    }\n    /**\n    Add a mark to the set of stored marks.\n    */\n    addStoredMark(mark) {\n        return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Remove a mark or mark type from the set of stored marks.\n    */\n    removeStoredMark(mark) {\n        return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Whether the stored marks were explicitly set for this transaction.\n    */\n    get storedMarksSet() {\n        return (this.updated & UPDATED_MARKS) > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        super.addStep(step, doc);\n        this.updated = this.updated & ~UPDATED_MARKS;\n        this.storedMarks = null;\n    }\n    /**\n    Update the timestamp for the transaction.\n    */\n    setTime(time) {\n        this.time = time;\n        return this;\n    }\n    /**\n    Replace the current selection with the given slice.\n    */\n    replaceSelection(slice) {\n        this.selection.replace(this, slice);\n        return this;\n    }\n    /**\n    Replace the selection with the given node. When `inheritMarks` is\n    true and the content is inline, it inherits the marks from the\n    place where it is inserted.\n    */\n    replaceSelectionWith(node, inheritMarks = true) {\n        let selection = this.selection;\n        if (inheritMarks)\n            node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)));\n        selection.replaceWith(this, node);\n        return this;\n    }\n    /**\n    Delete the selection.\n    */\n    deleteSelection() {\n        this.selection.replace(this);\n        return this;\n    }\n    /**\n    Replace the given range, or the selection if no range is given,\n    with a text node containing the given string.\n    */\n    insertText(text, from, to) {\n        let schema = this.doc.type.schema;\n        if (from == null) {\n            if (!text)\n                return this.deleteSelection();\n            return this.replaceSelectionWith(schema.text(text), true);\n        }\n        else {\n            if (to == null)\n                to = from;\n            to = to == null ? from : to;\n            if (!text)\n                return this.deleteRange(from, to);\n            let marks = this.storedMarks;\n            if (!marks) {\n                let $from = this.doc.resolve(from);\n                marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));\n            }\n            this.replaceRangeWith(from, to, schema.text(text, marks));\n            if (!this.selection.empty)\n                this.setSelection(Selection.near(this.selection.$to));\n            return this;\n        }\n    }\n    /**\n    Store a metadata property in this transaction, keyed either by\n    name or by plugin.\n    */\n    setMeta(key, value) {\n        this.meta[typeof key == \"string\" ? key : key.key] = value;\n        return this;\n    }\n    /**\n    Retrieve a metadata property for a given name or plugin.\n    */\n    getMeta(key) {\n        return this.meta[typeof key == \"string\" ? key : key.key];\n    }\n    /**\n    Returns true if this transaction doesn't contain any metadata,\n    and can thus safely be extended.\n    */\n    get isGeneric() {\n        for (let _ in this.meta)\n            return false;\n        return true;\n    }\n    /**\n    Indicate that the editor should scroll the selection into view\n    when updated to the state produced by this transaction.\n    */\n    scrollIntoView() {\n        this.updated |= UPDATED_SCROLL;\n        return this;\n    }\n    /**\n    True when this transaction has had `scrollIntoView` called on it.\n    */\n    get scrolledIntoView() {\n        return (this.updated & UPDATED_SCROLL) > 0;\n    }\n}\n\nfunction bind(f, self) {\n    return !self || !f ? f : f.bind(self);\n}\nclass FieldDesc {\n    constructor(name, desc, self) {\n        this.name = name;\n        this.init = bind(desc.init, self);\n        this.apply = bind(desc.apply, self);\n    }\n}\nconst baseFields = [\n    new FieldDesc(\"doc\", {\n        init(config) { return config.doc || config.schema.topNodeType.createAndFill(); },\n        apply(tr) { return tr.doc; }\n    }),\n    new FieldDesc(\"selection\", {\n        init(config, instance) { return config.selection || Selection.atStart(instance.doc); },\n        apply(tr) { return tr.selection; }\n    }),\n    new FieldDesc(\"storedMarks\", {\n        init(config) { return config.storedMarks || null; },\n        apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null; }\n    }),\n    new FieldDesc(\"scrollToSelection\", {\n        init() { return 0; },\n        apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev; }\n    })\n];\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n    constructor(schema, plugins) {\n        this.schema = schema;\n        this.plugins = [];\n        this.pluginsByKey = Object.create(null);\n        this.fields = baseFields.slice();\n        if (plugins)\n            plugins.forEach(plugin => {\n                if (this.pluginsByKey[plugin.key])\n                    throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\");\n                this.plugins.push(plugin);\n                this.pluginsByKey[plugin.key] = plugin;\n                if (plugin.spec.state)\n                    this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin));\n            });\n    }\n}\n/**\nThe state of a ProseMirror editor is represented by an object of\nthis type. A state is a persistent data structure—it isn't\nupdated, but rather a new state value is computed from an old one\nusing the [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) method.\n\nA state holds a number of built-in fields, and plugins can\n[define](https://prosemirror.net/docs/ref/#state.PluginSpec.state) additional fields.\n*/\nclass EditorState {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    config) {\n        this.config = config;\n    }\n    /**\n    The schema of the state's document.\n    */\n    get schema() {\n        return this.config.schema;\n    }\n    /**\n    The plugins that are active in this state.\n    */\n    get plugins() {\n        return this.config.plugins;\n    }\n    /**\n    Apply the given transaction to produce a new state.\n    */\n    apply(tr) {\n        return this.applyTransaction(tr).state;\n    }\n    /**\n    @internal\n    */\n    filterTransaction(tr, ignore = -1) {\n        for (let i = 0; i < this.config.plugins.length; i++)\n            if (i != ignore) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n                    return false;\n            }\n        return true;\n    }\n    /**\n    Verbose variant of [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) that\n    returns the precise transactions that were applied (which might\n    be influenced by the [transaction\n    hooks](https://prosemirror.net/docs/ref/#state.PluginSpec.filterTransaction) of\n    plugins) along with the new state.\n    */\n    applyTransaction(rootTr) {\n        if (!this.filterTransaction(rootTr))\n            return { state: this, transactions: [] };\n        let trs = [rootTr], newState = this.applyInner(rootTr), seen = null;\n        // This loop repeatedly gives plugins a chance to respond to\n        // transactions as new transactions are added, making sure to only\n        // pass the transactions the plugin did not see before.\n        for (;;) {\n            let haveNew = false;\n            for (let i = 0; i < this.config.plugins.length; i++) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.appendTransaction) {\n                    let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this;\n                    let tr = n < trs.length &&\n                        plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);\n                    if (tr && newState.filterTransaction(tr, i)) {\n                        tr.setMeta(\"appendedTransaction\", rootTr);\n                        if (!seen) {\n                            seen = [];\n                            for (let j = 0; j < this.config.plugins.length; j++)\n                                seen.push(j < i ? { state: newState, n: trs.length } : { state: this, n: 0 });\n                        }\n                        trs.push(tr);\n                        newState = newState.applyInner(tr);\n                        haveNew = true;\n                    }\n                    if (seen)\n                        seen[i] = { state: newState, n: trs.length };\n                }\n            }\n            if (!haveNew)\n                return { state: newState, transactions: trs };\n        }\n    }\n    /**\n    @internal\n    */\n    applyInner(tr) {\n        if (!tr.before.eq(this.doc))\n            throw new RangeError(\"Applying a mismatched transaction\");\n        let newInstance = new EditorState(this.config), fields = this.config.fields;\n        for (let i = 0; i < fields.length; i++) {\n            let field = fields[i];\n            newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);\n        }\n        return newInstance;\n    }\n    /**\n    Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.\n    */\n    get tr() { return new Transaction(this); }\n    /**\n    Create a new state.\n    */\n    static create(config) {\n        let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins);\n        let instance = new EditorState($config);\n        for (let i = 0; i < $config.fields.length; i++)\n            instance[$config.fields[i].name] = $config.fields[i].init(config, instance);\n        return instance;\n    }\n    /**\n    Create a new state based on this one, but with an adjusted set\n    of active plugins. State fields that exist in both sets of\n    plugins are kept unchanged. Those that no longer exist are\n    dropped, and those that are new are initialized using their\n    [`init`](https://prosemirror.net/docs/ref/#state.StateField.init) method, passing in the new\n    configuration object..\n    */\n    reconfigure(config) {\n        let $config = new Configuration(this.schema, config.plugins);\n        let fields = $config.fields, instance = new EditorState($config);\n        for (let i = 0; i < fields.length; i++) {\n            let name = fields[i].name;\n            instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);\n        }\n        return instance;\n    }\n    /**\n    Serialize this state to JSON. If you want to serialize the state\n    of plugins, pass an object mapping property names to use in the\n    resulting JSON object to plugin objects. The argument may also be\n    a string or number, in which case it is ignored, to support the\n    way `JSON.stringify` calls `toString` methods.\n    */\n    toJSON(pluginFields) {\n        let result = { doc: this.doc.toJSON(), selection: this.selection.toJSON() };\n        if (this.storedMarks)\n            result.storedMarks = this.storedMarks.map(m => m.toJSON());\n        if (pluginFields && typeof pluginFields == 'object')\n            for (let prop in pluginFields) {\n                if (prop == \"doc\" || prop == \"selection\")\n                    throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\");\n                let plugin = pluginFields[prop], state = plugin.spec.state;\n                if (state && state.toJSON)\n                    result[prop] = state.toJSON.call(plugin, this[plugin.key]);\n            }\n        return result;\n    }\n    /**\n    Deserialize a JSON representation of a state. `config` should\n    have at least a `schema` field, and should contain array of\n    plugins to initialize the state with. `pluginFields` can be used\n    to deserialize the state of plugins, by associating plugin\n    instances with the property names they use in the JSON object.\n    */\n    static fromJSON(config, json, pluginFields) {\n        if (!json)\n            throw new RangeError(\"Invalid input for EditorState.fromJSON\");\n        if (!config.schema)\n            throw new RangeError(\"Required config field 'schema' missing\");\n        let $config = new Configuration(config.schema, config.plugins);\n        let instance = new EditorState($config);\n        $config.fields.forEach(field => {\n            if (field.name == \"doc\") {\n                instance.doc = Node.fromJSON(config.schema, json.doc);\n            }\n            else if (field.name == \"selection\") {\n                instance.selection = Selection.fromJSON(instance.doc, json.selection);\n            }\n            else if (field.name == \"storedMarks\") {\n                if (json.storedMarks)\n                    instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON);\n            }\n            else {\n                if (pluginFields)\n                    for (let prop in pluginFields) {\n                        let plugin = pluginFields[prop], state = plugin.spec.state;\n                        if (plugin.key == field.name && state && state.fromJSON &&\n                            Object.prototype.hasOwnProperty.call(json, prop)) {\n                            instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);\n                            return;\n                        }\n                    }\n                instance[field.name] = field.init(config, instance);\n            }\n        });\n        return instance;\n    }\n}\n\nfunction bindProps(obj, self, target) {\n    for (let prop in obj) {\n        let val = obj[prop];\n        if (val instanceof Function)\n            val = val.bind(self);\n        else if (prop == \"handleDOMEvents\")\n            val = bindProps(val, self, {});\n        target[prop] = val;\n    }\n    return target;\n}\n/**\nPlugins bundle functionality that can be added to an editor.\nThey are part of the [editor state](https://prosemirror.net/docs/ref/#state.EditorState) and\nmay influence that state and the view that contains it.\n*/\nclass Plugin {\n    /**\n    Create a plugin.\n    */\n    constructor(\n    /**\n    The plugin's [spec object](https://prosemirror.net/docs/ref/#state.PluginSpec).\n    */\n    spec) {\n        this.spec = spec;\n        /**\n        The [props](https://prosemirror.net/docs/ref/#view.EditorProps) exported by this plugin.\n        */\n        this.props = {};\n        if (spec.props)\n            bindProps(spec.props, this, this.props);\n        this.key = spec.key ? spec.key.key : createKey(\"plugin\");\n    }\n    /**\n    Extract the plugin's state field from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\nconst keys = Object.create(null);\nfunction createKey(name) {\n    if (name in keys)\n        return name + \"$\" + ++keys[name];\n    keys[name] = 0;\n    return name + \"$\";\n}\n/**\nA key is used to [tag](https://prosemirror.net/docs/ref/#state.PluginSpec.key) plugins in a way\nthat makes it possible to find them, given an editor state.\nAssigning a key does mean only one plugin of that type can be\nactive in a state.\n*/\nclass PluginKey {\n    /**\n    Create a plugin key.\n    */\n    constructor(name = \"key\") { this.key = createKey(name); }\n    /**\n    Get the active plugin with this key, if any, from an editor\n    state.\n    */\n    get(state) { return state.config.pluginsByKey[this.key]; }\n    /**\n    Get the plugin's state from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\n\nexport { AllSelection, EditorState, NodeSelection, Plugin, PluginKey, Selection, SelectionRange, TextSelection, Transaction };\n","// src/index.ts\nimport { Plugin as Plugin2 } from \"prosemirror-state\";\n\n// src/cellselection.ts\nimport { Fragment, Slice } from \"prosemirror-model\";\nimport {\n  NodeSelection as NodeSelection2,\n  Selection,\n  SelectionRange,\n  TextSelection\n} from \"prosemirror-state\";\nimport { Decoration, DecorationSet } from \"prosemirror-view\";\n\n// src/tablemap.ts\nvar readFromCache;\nvar addToCache;\nif (typeof WeakMap != \"undefined\") {\n  let cache = /* @__PURE__ */ new WeakMap();\n  readFromCache = (key) => cache.get(key);\n  addToCache = (key, value) => {\n    cache.set(key, value);\n    return value;\n  };\n} else {\n  const cache = [];\n  const cacheSize = 10;\n  let cachePos = 0;\n  readFromCache = (key) => {\n    for (let i = 0; i < cache.length; i += 2)\n      if (cache[i] == key)\n        return cache[i + 1];\n  };\n  addToCache = (key, value) => {\n    if (cachePos == cacheSize)\n      cachePos = 0;\n    cache[cachePos++] = key;\n    return cache[cachePos++] = value;\n  };\n}\nvar TableMap = class {\n  constructor(width, height, map, problems) {\n    this.width = width;\n    this.height = height;\n    this.map = map;\n    this.problems = problems;\n  }\n  findCell(pos) {\n    for (let i = 0; i < this.map.length; i++) {\n      const curPos = this.map[i];\n      if (curPos != pos)\n        continue;\n      const left = i % this.width;\n      const top = i / this.width | 0;\n      let right = left + 1;\n      let bottom = top + 1;\n      for (let j = 1; right < this.width && this.map[i + j] == curPos; j++) {\n        right++;\n      }\n      for (let j = 1; bottom < this.height && this.map[i + this.width * j] == curPos; j++) {\n        bottom++;\n      }\n      return { left, top, right, bottom };\n    }\n    throw new RangeError(`No cell with offset ${pos} found`);\n  }\n  colCount(pos) {\n    for (let i = 0; i < this.map.length; i++) {\n      if (this.map[i] == pos) {\n        return i % this.width;\n      }\n    }\n    throw new RangeError(`No cell with offset ${pos} found`);\n  }\n  nextCell(pos, axis, dir) {\n    const { left, right, top, bottom } = this.findCell(pos);\n    if (axis == \"horiz\") {\n      if (dir < 0 ? left == 0 : right == this.width)\n        return null;\n      return this.map[top * this.width + (dir < 0 ? left - 1 : right)];\n    } else {\n      if (dir < 0 ? top == 0 : bottom == this.height)\n        return null;\n      return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)];\n    }\n  }\n  rectBetween(a, b) {\n    const {\n      left: leftA,\n      right: rightA,\n      top: topA,\n      bottom: bottomA\n    } = this.findCell(a);\n    const {\n      left: leftB,\n      right: rightB,\n      top: topB,\n      bottom: bottomB\n    } = this.findCell(b);\n    return {\n      left: Math.min(leftA, leftB),\n      top: Math.min(topA, topB),\n      right: Math.max(rightA, rightB),\n      bottom: Math.max(bottomA, bottomB)\n    };\n  }\n  cellsInRect(rect) {\n    const result = [];\n    const seen = {};\n    for (let row = rect.top; row < rect.bottom; row++) {\n      for (let col = rect.left; col < rect.right; col++) {\n        const index = row * this.width + col;\n        const pos = this.map[index];\n        if (seen[pos])\n          continue;\n        seen[pos] = true;\n        if (col == rect.left && col && this.map[index - 1] == pos || row == rect.top && row && this.map[index - this.width] == pos) {\n          continue;\n        }\n        result.push(pos);\n      }\n    }\n    return result;\n  }\n  positionAt(row, col, table) {\n    for (let i = 0, rowStart = 0; ; i++) {\n      const rowEnd = rowStart + table.child(i).nodeSize;\n      if (i == row) {\n        let index = col + row * this.width;\n        const rowEndIndex = (row + 1) * this.width;\n        while (index < rowEndIndex && this.map[index] < rowStart)\n          index++;\n        return index == rowEndIndex ? rowEnd - 1 : this.map[index];\n      }\n      rowStart = rowEnd;\n    }\n  }\n  static get(table) {\n    return readFromCache(table) || addToCache(table, computeMap(table));\n  }\n};\nfunction computeMap(table) {\n  if (table.type.spec.tableRole != \"table\")\n    throw new RangeError(\"Not a table node: \" + table.type.name);\n  const width = findWidth(table), height = table.childCount;\n  const map = [];\n  let mapPos = 0;\n  let problems = null;\n  const colWidths = [];\n  for (let i = 0, e = width * height; i < e; i++)\n    map[i] = 0;\n  for (let row = 0, pos = 0; row < height; row++) {\n    const rowNode = table.child(row);\n    pos++;\n    for (let i = 0; ; i++) {\n      while (mapPos < map.length && map[mapPos] != 0)\n        mapPos++;\n      if (i == rowNode.childCount)\n        break;\n      const cellNode = rowNode.child(i);\n      const { colspan, rowspan, colwidth } = cellNode.attrs;\n      for (let h = 0; h < rowspan; h++) {\n        if (h + row >= height) {\n          (problems || (problems = [])).push({\n            type: \"overlong_rowspan\",\n            pos,\n            n: rowspan - h\n          });\n          break;\n        }\n        const start = mapPos + h * width;\n        for (let w = 0; w < colspan; w++) {\n          if (map[start + w] == 0)\n            map[start + w] = pos;\n          else\n            (problems || (problems = [])).push({\n              type: \"collision\",\n              row,\n              pos,\n              n: colspan - w\n            });\n          const colW = colwidth && colwidth[w];\n          if (colW) {\n            const widthIndex = (start + w) % width * 2, prev = colWidths[widthIndex];\n            if (prev == null || prev != colW && colWidths[widthIndex + 1] == 1) {\n              colWidths[widthIndex] = colW;\n              colWidths[widthIndex + 1] = 1;\n            } else if (prev == colW) {\n              colWidths[widthIndex + 1]++;\n            }\n          }\n        }\n      }\n      mapPos += colspan;\n      pos += cellNode.nodeSize;\n    }\n    const expectedPos = (row + 1) * width;\n    let missing = 0;\n    while (mapPos < expectedPos)\n      if (map[mapPos++] == 0)\n        missing++;\n    if (missing)\n      (problems || (problems = [])).push({ type: \"missing\", row, n: missing });\n    pos++;\n  }\n  const tableMap = new TableMap(width, height, map, problems);\n  let badWidths = false;\n  for (let i = 0; !badWidths && i < colWidths.length; i += 2)\n    if (colWidths[i] != null && colWidths[i + 1] < height)\n      badWidths = true;\n  if (badWidths)\n    findBadColWidths(tableMap, colWidths, table);\n  return tableMap;\n}\nfunction findWidth(table) {\n  let width = -1;\n  let hasRowSpan = false;\n  for (let row = 0; row < table.childCount; row++) {\n    const rowNode = table.child(row);\n    let rowWidth = 0;\n    if (hasRowSpan)\n      for (let j = 0; j < row; j++) {\n        const prevRow = table.child(j);\n        for (let i = 0; i < prevRow.childCount; i++) {\n          const cell = prevRow.child(i);\n          if (j + cell.attrs.rowspan > row)\n            rowWidth += cell.attrs.colspan;\n        }\n      }\n    for (let i = 0; i < rowNode.childCount; i++) {\n      const cell = rowNode.child(i);\n      rowWidth += cell.attrs.colspan;\n      if (cell.attrs.rowspan > 1)\n        hasRowSpan = true;\n    }\n    if (width == -1)\n      width = rowWidth;\n    else if (width != rowWidth)\n      width = Math.max(width, rowWidth);\n  }\n  return width;\n}\nfunction findBadColWidths(map, colWidths, table) {\n  if (!map.problems)\n    map.problems = [];\n  const seen = {};\n  for (let i = 0; i < map.map.length; i++) {\n    const pos = map.map[i];\n    if (seen[pos])\n      continue;\n    seen[pos] = true;\n    const node = table.nodeAt(pos);\n    if (!node) {\n      throw new RangeError(`No cell with offset ${pos} found`);\n    }\n    let updated = null;\n    const attrs = node.attrs;\n    for (let j = 0; j < attrs.colspan; j++) {\n      const col = (i + j) % map.width;\n      const colWidth = colWidths[col * 2];\n      if (colWidth != null && (!attrs.colwidth || attrs.colwidth[j] != colWidth))\n        (updated || (updated = freshColWidth(attrs)))[j] = colWidth;\n    }\n    if (updated)\n      map.problems.unshift({\n        type: \"colwidth mismatch\",\n        pos,\n        colwidth: updated\n      });\n  }\n}\nfunction freshColWidth(attrs) {\n  if (attrs.colwidth)\n    return attrs.colwidth.slice();\n  const result = [];\n  for (let i = 0; i < attrs.colspan; i++)\n    result.push(0);\n  return result;\n}\n\n// src/util.ts\nimport { PluginKey } from \"prosemirror-state\";\n\n// src/schema.ts\nfunction getCellAttrs(dom, extraAttrs) {\n  if (typeof dom === \"string\") {\n    return {};\n  }\n  const widthAttr = dom.getAttribute(\"data-colwidth\");\n  const widths = widthAttr && /^\\d+(,\\d+)*$/.test(widthAttr) ? widthAttr.split(\",\").map((s) => Number(s)) : null;\n  const colspan = Number(dom.getAttribute(\"colspan\") || 1);\n  const result = {\n    colspan,\n    rowspan: Number(dom.getAttribute(\"rowspan\") || 1),\n    colwidth: widths && widths.length == colspan ? widths : null\n  };\n  for (const prop in extraAttrs) {\n    const getter = extraAttrs[prop].getFromDOM;\n    const value = getter && getter(dom);\n    if (value != null) {\n      result[prop] = value;\n    }\n  }\n  return result;\n}\nfunction setCellAttrs(node, extraAttrs) {\n  const attrs = {};\n  if (node.attrs.colspan != 1)\n    attrs.colspan = node.attrs.colspan;\n  if (node.attrs.rowspan != 1)\n    attrs.rowspan = node.attrs.rowspan;\n  if (node.attrs.colwidth)\n    attrs[\"data-colwidth\"] = node.attrs.colwidth.join(\",\");\n  for (const prop in extraAttrs) {\n    const setter = extraAttrs[prop].setDOMAttr;\n    if (setter)\n      setter(node.attrs[prop], attrs);\n  }\n  return attrs;\n}\nfunction tableNodes(options) {\n  const extraAttrs = options.cellAttributes || {};\n  const cellAttrs = {\n    colspan: { default: 1 },\n    rowspan: { default: 1 },\n    colwidth: { default: null }\n  };\n  for (const prop in extraAttrs)\n    cellAttrs[prop] = { default: extraAttrs[prop].default };\n  return {\n    table: {\n      content: \"table_row+\",\n      tableRole: \"table\",\n      isolating: true,\n      group: options.tableGroup,\n      parseDOM: [{ tag: \"table\" }],\n      toDOM() {\n        return [\"table\", [\"tbody\", 0]];\n      }\n    },\n    table_row: {\n      content: \"(table_cell | table_header)*\",\n      tableRole: \"row\",\n      parseDOM: [{ tag: \"tr\" }],\n      toDOM() {\n        return [\"tr\", 0];\n      }\n    },\n    table_cell: {\n      content: options.cellContent,\n      attrs: cellAttrs,\n      tableRole: \"cell\",\n      isolating: true,\n      parseDOM: [\n        { tag: \"td\", getAttrs: (dom) => getCellAttrs(dom, extraAttrs) }\n      ],\n      toDOM(node) {\n        return [\"td\", setCellAttrs(node, extraAttrs), 0];\n      }\n    },\n    table_header: {\n      content: options.cellContent,\n      attrs: cellAttrs,\n      tableRole: \"header_cell\",\n      isolating: true,\n      parseDOM: [\n        { tag: \"th\", getAttrs: (dom) => getCellAttrs(dom, extraAttrs) }\n      ],\n      toDOM(node) {\n        return [\"th\", setCellAttrs(node, extraAttrs), 0];\n      }\n    }\n  };\n}\nfunction tableNodeTypes(schema) {\n  let result = schema.cached.tableNodeTypes;\n  if (!result) {\n    result = schema.cached.tableNodeTypes = {};\n    for (const name in schema.nodes) {\n      const type = schema.nodes[name], role = type.spec.tableRole;\n      if (role)\n        result[role] = type;\n    }\n  }\n  return result;\n}\n\n// src/util.ts\nvar tableEditingKey = new PluginKey(\"selectingCells\");\nfunction cellAround($pos) {\n  for (let d = $pos.depth - 1; d > 0; d--)\n    if ($pos.node(d).type.spec.tableRole == \"row\")\n      return $pos.node(0).resolve($pos.before(d + 1));\n  return null;\n}\nfunction cellWrapping($pos) {\n  for (let d = $pos.depth; d > 0; d--) {\n    const role = $pos.node(d).type.spec.tableRole;\n    if (role === \"cell\" || role === \"header_cell\")\n      return $pos.node(d);\n  }\n  return null;\n}\nfunction isInTable(state) {\n  const $head = state.selection.$head;\n  for (let d = $head.depth; d > 0; d--)\n    if ($head.node(d).type.spec.tableRole == \"row\")\n      return true;\n  return false;\n}\nfunction selectionCell(state) {\n  const sel = state.selection;\n  if (\"$anchorCell\" in sel && sel.$anchorCell) {\n    return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;\n  } else if (\"node\" in sel && sel.node && sel.node.type.spec.tableRole == \"cell\") {\n    return sel.$anchor;\n  }\n  const $cell = cellAround(sel.$head) || cellNear(sel.$head);\n  if ($cell) {\n    return $cell;\n  }\n  throw new RangeError(`No cell found around position ${sel.head}`);\n}\nfunction cellNear($pos) {\n  for (let after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {\n    const role = after.type.spec.tableRole;\n    if (role == \"cell\" || role == \"header_cell\")\n      return $pos.doc.resolve(pos);\n  }\n  for (let before = $pos.nodeBefore, pos = $pos.pos; before; before = before.lastChild, pos--) {\n    const role = before.type.spec.tableRole;\n    if (role == \"cell\" || role == \"header_cell\")\n      return $pos.doc.resolve(pos - before.nodeSize);\n  }\n}\nfunction pointsAtCell($pos) {\n  return $pos.parent.type.spec.tableRole == \"row\" && !!$pos.nodeAfter;\n}\nfunction moveCellForward($pos) {\n  return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize);\n}\nfunction inSameTable($cellA, $cellB) {\n  return $cellA.depth == $cellB.depth && $cellA.pos >= $cellB.start(-1) && $cellA.pos <= $cellB.end(-1);\n}\nfunction findCell($pos) {\n  return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1));\n}\nfunction colCount($pos) {\n  return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1));\n}\nfunction nextCell($pos, axis, dir) {\n  const table = $pos.node(-1);\n  const map = TableMap.get(table);\n  const tableStart = $pos.start(-1);\n  const moved = map.nextCell($pos.pos - tableStart, axis, dir);\n  return moved == null ? null : $pos.node(0).resolve(tableStart + moved);\n}\nfunction removeColSpan(attrs, pos, n = 1) {\n  const result = { ...attrs, colspan: attrs.colspan - n };\n  if (result.colwidth) {\n    result.colwidth = result.colwidth.slice();\n    result.colwidth.splice(pos, n);\n    if (!result.colwidth.some((w) => w > 0))\n      result.colwidth = null;\n  }\n  return result;\n}\nfunction addColSpan(attrs, pos, n = 1) {\n  const result = { ...attrs, colspan: attrs.colspan + n };\n  if (result.colwidth) {\n    result.colwidth = result.colwidth.slice();\n    for (let i = 0; i < n; i++)\n      result.colwidth.splice(pos, 0, 0);\n  }\n  return result;\n}\nfunction columnIsHeader(map, table, col) {\n  const headerCell = tableNodeTypes(table.type.schema).header_cell;\n  for (let row = 0; row < map.height; row++)\n    if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)\n      return false;\n  return true;\n}\n\n// src/cellselection.ts\nvar CellSelection = class extends Selection {\n  constructor($anchorCell, $headCell = $anchorCell) {\n    const table = $anchorCell.node(-1);\n    const map = TableMap.get(table);\n    const tableStart = $anchorCell.start(-1);\n    const rect = map.rectBetween(\n      $anchorCell.pos - tableStart,\n      $headCell.pos - tableStart\n    );\n    const doc = $anchorCell.node(0);\n    const cells = map.cellsInRect(rect).filter((p) => p != $headCell.pos - tableStart);\n    cells.unshift($headCell.pos - tableStart);\n    const ranges = cells.map((pos) => {\n      const cell = table.nodeAt(pos);\n      if (!cell) {\n        throw RangeError(`No cell with offset ${pos} found`);\n      }\n      const from = tableStart + pos + 1;\n      return new SelectionRange(\n        doc.resolve(from),\n        doc.resolve(from + cell.content.size)\n      );\n    });\n    super(ranges[0].$from, ranges[0].$to, ranges);\n    this.$anchorCell = $anchorCell;\n    this.$headCell = $headCell;\n  }\n  map(doc, mapping) {\n    const $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));\n    const $headCell = doc.resolve(mapping.map(this.$headCell.pos));\n    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {\n      const tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);\n      if (tableChanged && this.isRowSelection())\n        return CellSelection.rowSelection($anchorCell, $headCell);\n      else if (tableChanged && this.isColSelection())\n        return CellSelection.colSelection($anchorCell, $headCell);\n      else\n        return new CellSelection($anchorCell, $headCell);\n    }\n    return TextSelection.between($anchorCell, $headCell);\n  }\n  content() {\n    const table = this.$anchorCell.node(-1);\n    const map = TableMap.get(table);\n    const tableStart = this.$anchorCell.start(-1);\n    const rect = map.rectBetween(\n      this.$anchorCell.pos - tableStart,\n      this.$headCell.pos - tableStart\n    );\n    const seen = {};\n    const rows = [];\n    for (let row = rect.top; row < rect.bottom; row++) {\n      const rowContent = [];\n      for (let index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {\n        const pos = map.map[index];\n        if (seen[pos])\n          continue;\n        seen[pos] = true;\n        const cellRect = map.findCell(pos);\n        let cell = table.nodeAt(pos);\n        if (!cell) {\n          throw RangeError(`No cell with offset ${pos} found`);\n        }\n        const extraLeft = rect.left - cellRect.left;\n        const extraRight = cellRect.right - rect.right;\n        if (extraLeft > 0 || extraRight > 0) {\n          let attrs = cell.attrs;\n          if (extraLeft > 0) {\n            attrs = removeColSpan(attrs, 0, extraLeft);\n          }\n          if (extraRight > 0) {\n            attrs = removeColSpan(\n              attrs,\n              attrs.colspan - extraRight,\n              extraRight\n            );\n          }\n          if (cellRect.left < rect.left) {\n            cell = cell.type.createAndFill(attrs);\n            if (!cell) {\n              throw RangeError(\n                `Could not create cell with attrs ${JSON.stringify(attrs)}`\n              );\n            }\n          } else {\n            cell = cell.type.create(attrs, cell.content);\n          }\n        }\n        if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {\n          const attrs = {\n            ...cell.attrs,\n            rowspan: Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top)\n          };\n          if (cellRect.top < rect.top) {\n            cell = cell.type.createAndFill(attrs);\n          } else {\n            cell = cell.type.create(attrs, cell.content);\n          }\n        }\n        rowContent.push(cell);\n      }\n      rows.push(table.child(row).copy(Fragment.from(rowContent)));\n    }\n    const fragment = this.isColSelection() && this.isRowSelection() ? table : rows;\n    return new Slice(Fragment.from(fragment), 1, 1);\n  }\n  replace(tr, content = Slice.empty) {\n    const mapFrom = tr.steps.length, ranges = this.ranges;\n    for (let i = 0; i < ranges.length; i++) {\n      const { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n      tr.replace(\n        mapping.map($from.pos),\n        mapping.map($to.pos),\n        i ? Slice.empty : content\n      );\n    }\n    const sel = Selection.findFrom(\n      tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)),\n      -1\n    );\n    if (sel)\n      tr.setSelection(sel);\n  }\n  replaceWith(tr, node) {\n    this.replace(tr, new Slice(Fragment.from(node), 0, 0));\n  }\n  forEachCell(f) {\n    const table = this.$anchorCell.node(-1);\n    const map = TableMap.get(table);\n    const tableStart = this.$anchorCell.start(-1);\n    const cells = map.cellsInRect(\n      map.rectBetween(\n        this.$anchorCell.pos - tableStart,\n        this.$headCell.pos - tableStart\n      )\n    );\n    for (let i = 0; i < cells.length; i++) {\n      f(table.nodeAt(cells[i]), tableStart + cells[i]);\n    }\n  }\n  isColSelection() {\n    const anchorTop = this.$anchorCell.index(-1);\n    const headTop = this.$headCell.index(-1);\n    if (Math.min(anchorTop, headTop) > 0)\n      return false;\n    const anchorBottom = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan;\n    const headBottom = headTop + this.$headCell.nodeAfter.attrs.rowspan;\n    return Math.max(anchorBottom, headBottom) == this.$headCell.node(-1).childCount;\n  }\n  static colSelection($anchorCell, $headCell = $anchorCell) {\n    const table = $anchorCell.node(-1);\n    const map = TableMap.get(table);\n    const tableStart = $anchorCell.start(-1);\n    const anchorRect = map.findCell($anchorCell.pos - tableStart);\n    const headRect = map.findCell($headCell.pos - tableStart);\n    const doc = $anchorCell.node(0);\n    if (anchorRect.top <= headRect.top) {\n      if (anchorRect.top > 0)\n        $anchorCell = doc.resolve(tableStart + map.map[anchorRect.left]);\n      if (headRect.bottom < map.height)\n        $headCell = doc.resolve(\n          tableStart + map.map[map.width * (map.height - 1) + headRect.right - 1]\n        );\n    } else {\n      if (headRect.top > 0)\n        $headCell = doc.resolve(tableStart + map.map[headRect.left]);\n      if (anchorRect.bottom < map.height)\n        $anchorCell = doc.resolve(\n          tableStart + map.map[map.width * (map.height - 1) + anchorRect.right - 1]\n        );\n    }\n    return new CellSelection($anchorCell, $headCell);\n  }\n  isRowSelection() {\n    const table = this.$anchorCell.node(-1);\n    const map = TableMap.get(table);\n    const tableStart = this.$anchorCell.start(-1);\n    const anchorLeft = map.colCount(this.$anchorCell.pos - tableStart);\n    const headLeft = map.colCount(this.$headCell.pos - tableStart);\n    if (Math.min(anchorLeft, headLeft) > 0)\n      return false;\n    const anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan;\n    const headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;\n    return Math.max(anchorRight, headRight) == map.width;\n  }\n  eq(other) {\n    return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos && other.$headCell.pos == this.$headCell.pos;\n  }\n  static rowSelection($anchorCell, $headCell = $anchorCell) {\n    const table = $anchorCell.node(-1);\n    const map = TableMap.get(table);\n    const tableStart = $anchorCell.start(-1);\n    const anchorRect = map.findCell($anchorCell.pos - tableStart);\n    const headRect = map.findCell($headCell.pos - tableStart);\n    const doc = $anchorCell.node(0);\n    if (anchorRect.left <= headRect.left) {\n      if (anchorRect.left > 0)\n        $anchorCell = doc.resolve(\n          tableStart + map.map[anchorRect.top * map.width]\n        );\n      if (headRect.right < map.width)\n        $headCell = doc.resolve(\n          tableStart + map.map[map.width * (headRect.top + 1) - 1]\n        );\n    } else {\n      if (headRect.left > 0)\n        $headCell = doc.resolve(tableStart + map.map[headRect.top * map.width]);\n      if (anchorRect.right < map.width)\n        $anchorCell = doc.resolve(\n          tableStart + map.map[map.width * (anchorRect.top + 1) - 1]\n        );\n    }\n    return new CellSelection($anchorCell, $headCell);\n  }\n  toJSON() {\n    return {\n      type: \"cell\",\n      anchor: this.$anchorCell.pos,\n      head: this.$headCell.pos\n    };\n  }\n  static fromJSON(doc, json) {\n    return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head));\n  }\n  static create(doc, anchorCell, headCell = anchorCell) {\n    return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell));\n  }\n  getBookmark() {\n    return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos);\n  }\n};\nCellSelection.prototype.visible = false;\nSelection.jsonID(\"cell\", CellSelection);\nvar CellBookmark = class {\n  constructor(anchor, head) {\n    this.anchor = anchor;\n    this.head = head;\n  }\n  map(mapping) {\n    return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head));\n  }\n  resolve(doc) {\n    const $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);\n    if ($anchorCell.parent.type.spec.tableRole == \"row\" && $headCell.parent.type.spec.tableRole == \"row\" && $anchorCell.index() < $anchorCell.parent.childCount && $headCell.index() < $headCell.parent.childCount && inSameTable($anchorCell, $headCell))\n      return new CellSelection($anchorCell, $headCell);\n    else\n      return Selection.near($headCell, 1);\n  }\n};\nfunction drawCellSelection(state) {\n  if (!(state.selection instanceof CellSelection))\n    return null;\n  const cells = [];\n  state.selection.forEachCell((node, pos) => {\n    cells.push(\n      Decoration.node(pos, pos + node.nodeSize, { class: \"selectedCell\" })\n    );\n  });\n  return DecorationSet.create(state.doc, cells);\n}\nfunction isCellBoundarySelection({ $from, $to }) {\n  if ($from.pos == $to.pos || $from.pos < $from.pos - 6)\n    return false;\n  let afterFrom = $from.pos;\n  let beforeTo = $to.pos;\n  let depth = $from.depth;\n  for (; depth >= 0; depth--, afterFrom++)\n    if ($from.after(depth + 1) < $from.end(depth))\n      break;\n  for (let d = $to.depth; d >= 0; d--, beforeTo--)\n    if ($to.before(d + 1) > $to.start(d))\n      break;\n  return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole);\n}\nfunction isTextSelectionAcrossCells({ $from, $to }) {\n  let fromCellBoundaryNode;\n  let toCellBoundaryNode;\n  for (let i = $from.depth; i > 0; i--) {\n    const node = $from.node(i);\n    if (node.type.spec.tableRole === \"cell\" || node.type.spec.tableRole === \"header_cell\") {\n      fromCellBoundaryNode = node;\n      break;\n    }\n  }\n  for (let i = $to.depth; i > 0; i--) {\n    const node = $to.node(i);\n    if (node.type.spec.tableRole === \"cell\" || node.type.spec.tableRole === \"header_cell\") {\n      toCellBoundaryNode = node;\n      break;\n    }\n  }\n  return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0;\n}\nfunction normalizeSelection(state, tr, allowTableNodeSelection) {\n  const sel = (tr || state).selection;\n  const doc = (tr || state).doc;\n  let normalize;\n  let role;\n  if (sel instanceof NodeSelection2 && (role = sel.node.type.spec.tableRole)) {\n    if (role == \"cell\" || role == \"header_cell\") {\n      normalize = CellSelection.create(doc, sel.from);\n    } else if (role == \"row\") {\n      const $cell = doc.resolve(sel.from + 1);\n      normalize = CellSelection.rowSelection($cell, $cell);\n    } else if (!allowTableNodeSelection) {\n      const map = TableMap.get(sel.node);\n      const start = sel.from + 1;\n      const lastCell = start + map.map[map.width * map.height - 1];\n      normalize = CellSelection.create(doc, start + 1, lastCell);\n    }\n  } else if (sel instanceof TextSelection && isCellBoundarySelection(sel)) {\n    normalize = TextSelection.create(doc, sel.from);\n  } else if (sel instanceof TextSelection && isTextSelectionAcrossCells(sel)) {\n    normalize = TextSelection.create(doc, sel.$from.start(), sel.$from.end());\n  }\n  if (normalize)\n    (tr || (tr = state.tr)).setSelection(normalize);\n  return tr;\n}\n\n// src/fixtables.ts\nimport { PluginKey as PluginKey2 } from \"prosemirror-state\";\nvar fixTablesKey = new PluginKey2(\"fix-tables\");\nfunction changedDescendants(old, cur, offset, f) {\n  const oldSize = old.childCount, curSize = cur.childCount;\n  outer:\n    for (let i = 0, j = 0; i < curSize; i++) {\n      const child = cur.child(i);\n      for (let scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {\n        if (old.child(scan) == child) {\n          j = scan + 1;\n          offset += child.nodeSize;\n          continue outer;\n        }\n      }\n      f(child, offset);\n      if (j < oldSize && old.child(j).sameMarkup(child))\n        changedDescendants(old.child(j), child, offset + 1, f);\n      else\n        child.nodesBetween(0, child.content.size, f, offset + 1);\n      offset += child.nodeSize;\n    }\n}\nfunction fixTables(state, oldState) {\n  let tr;\n  const check = (node, pos) => {\n    if (node.type.spec.tableRole == \"table\")\n      tr = fixTable(state, node, pos, tr);\n  };\n  if (!oldState)\n    state.doc.descendants(check);\n  else if (oldState.doc != state.doc)\n    changedDescendants(oldState.doc, state.doc, 0, check);\n  return tr;\n}\nfunction fixTable(state, table, tablePos, tr) {\n  const map = TableMap.get(table);\n  if (!map.problems)\n    return tr;\n  if (!tr)\n    tr = state.tr;\n  const mustAdd = [];\n  for (let i = 0; i < map.height; i++)\n    mustAdd.push(0);\n  for (let i = 0; i < map.problems.length; i++) {\n    const prob = map.problems[i];\n    if (prob.type == \"collision\") {\n      const cell = table.nodeAt(prob.pos);\n      if (!cell)\n        continue;\n      const attrs = cell.attrs;\n      for (let j = 0; j < attrs.rowspan; j++)\n        mustAdd[prob.row + j] += prob.n;\n      tr.setNodeMarkup(\n        tr.mapping.map(tablePos + 1 + prob.pos),\n        null,\n        removeColSpan(attrs, attrs.colspan - prob.n, prob.n)\n      );\n    } else if (prob.type == \"missing\") {\n      mustAdd[prob.row] += prob.n;\n    } else if (prob.type == \"overlong_rowspan\") {\n      const cell = table.nodeAt(prob.pos);\n      if (!cell)\n        continue;\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, {\n        ...cell.attrs,\n        rowspan: cell.attrs.rowspan - prob.n\n      });\n    } else if (prob.type == \"colwidth mismatch\") {\n      const cell = table.nodeAt(prob.pos);\n      if (!cell)\n        continue;\n      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, {\n        ...cell.attrs,\n        colwidth: prob.colwidth\n      });\n    }\n  }\n  let first, last;\n  for (let i = 0; i < mustAdd.length; i++)\n    if (mustAdd[i]) {\n      if (first == null)\n        first = i;\n      last = i;\n    }\n  for (let i = 0, pos = tablePos + 1; i < map.height; i++) {\n    const row = table.child(i);\n    const end = pos + row.nodeSize;\n    const add = mustAdd[i];\n    if (add > 0) {\n      let role = \"cell\";\n      if (row.firstChild) {\n        role = row.firstChild.type.spec.tableRole;\n      }\n      const nodes = [];\n      for (let j = 0; j < add; j++) {\n        const node = tableNodeTypes(state.schema)[role].createAndFill();\n        if (node)\n          nodes.push(node);\n      }\n      const side = (i == 0 || first == i - 1) && last == i ? pos + 1 : end - 1;\n      tr.insert(tr.mapping.map(side), nodes);\n    }\n    pos = end;\n  }\n  return tr.setMeta(fixTablesKey, { fixTables: true });\n}\n\n// src/input.ts\nimport { Fragment as Fragment3, Slice as Slice3 } from \"prosemirror-model\";\nimport {\n  Selection as Selection2,\n  TextSelection as TextSelection2\n} from \"prosemirror-state\";\nimport { keydownHandler } from \"prosemirror-keymap\";\n\n// src/copypaste.ts\nimport { Fragment as Fragment2, Slice as Slice2 } from \"prosemirror-model\";\nimport { Transform } from \"prosemirror-transform\";\nfunction pastedCells(slice) {\n  if (!slice.size)\n    return null;\n  let { content, openStart, openEnd } = slice;\n  while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.child(0).type.spec.tableRole == \"table\")) {\n    openStart--;\n    openEnd--;\n    content = content.child(0).content;\n  }\n  const first = content.child(0);\n  const role = first.type.spec.tableRole;\n  const schema = first.type.schema, rows = [];\n  if (role == \"row\") {\n    for (let i = 0; i < content.childCount; i++) {\n      let cells = content.child(i).content;\n      const left = i ? 0 : Math.max(0, openStart - 1);\n      const right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);\n      if (left || right)\n        cells = fitSlice(\n          tableNodeTypes(schema).row,\n          new Slice2(cells, left, right)\n        ).content;\n      rows.push(cells);\n    }\n  } else if (role == \"cell\" || role == \"header_cell\") {\n    rows.push(\n      openStart || openEnd ? fitSlice(\n        tableNodeTypes(schema).row,\n        new Slice2(content, openStart, openEnd)\n      ).content : content\n    );\n  } else {\n    return null;\n  }\n  return ensureRectangular(schema, rows);\n}\nfunction ensureRectangular(schema, rows) {\n  const widths = [];\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i];\n    for (let j = row.childCount - 1; j >= 0; j--) {\n      const { rowspan, colspan } = row.child(j).attrs;\n      for (let r = i; r < i + rowspan; r++)\n        widths[r] = (widths[r] || 0) + colspan;\n    }\n  }\n  let width = 0;\n  for (let r = 0; r < widths.length; r++)\n    width = Math.max(width, widths[r]);\n  for (let r = 0; r < widths.length; r++) {\n    if (r >= rows.length)\n      rows.push(Fragment2.empty);\n    if (widths[r] < width) {\n      const empty = tableNodeTypes(schema).cell.createAndFill();\n      const cells = [];\n      for (let i = widths[r]; i < width; i++) {\n        cells.push(empty);\n      }\n      rows[r] = rows[r].append(Fragment2.from(cells));\n    }\n  }\n  return { height: rows.length, width, rows };\n}\nfunction fitSlice(nodeType, slice) {\n  const node = nodeType.createAndFill();\n  const tr = new Transform(node).replace(0, node.content.size, slice);\n  return tr.doc;\n}\nfunction clipCells({ width, height, rows }, newWidth, newHeight) {\n  if (width != newWidth) {\n    const added = [];\n    const newRows = [];\n    for (let row = 0; row < rows.length; row++) {\n      const frag = rows[row], cells = [];\n      for (let col = added[row] || 0, i = 0; col < newWidth; i++) {\n        let cell = frag.child(i % frag.childCount);\n        if (col + cell.attrs.colspan > newWidth)\n          cell = cell.type.createChecked(\n            removeColSpan(\n              cell.attrs,\n              cell.attrs.colspan,\n              col + cell.attrs.colspan - newWidth\n            ),\n            cell.content\n          );\n        cells.push(cell);\n        col += cell.attrs.colspan;\n        for (let j = 1; j < cell.attrs.rowspan; j++)\n          added[row + j] = (added[row + j] || 0) + cell.attrs.colspan;\n      }\n      newRows.push(Fragment2.from(cells));\n    }\n    rows = newRows;\n    width = newWidth;\n  }\n  if (height != newHeight) {\n    const newRows = [];\n    for (let row = 0, i = 0; row < newHeight; row++, i++) {\n      const cells = [], source = rows[i % height];\n      for (let j = 0; j < source.childCount; j++) {\n        let cell = source.child(j);\n        if (row + cell.attrs.rowspan > newHeight)\n          cell = cell.type.create(\n            {\n              ...cell.attrs,\n              rowspan: Math.max(1, newHeight - cell.attrs.rowspan)\n            },\n            cell.content\n          );\n        cells.push(cell);\n      }\n      newRows.push(Fragment2.from(cells));\n    }\n    rows = newRows;\n    height = newHeight;\n  }\n  return { width, height, rows };\n}\nfunction growTable(tr, map, table, start, width, height, mapFrom) {\n  const schema = tr.doc.type.schema;\n  const types = tableNodeTypes(schema);\n  let empty;\n  let emptyHead;\n  if (width > map.width) {\n    for (let row = 0, rowEnd = 0; row < map.height; row++) {\n      const rowNode = table.child(row);\n      rowEnd += rowNode.nodeSize;\n      const cells = [];\n      let add;\n      if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)\n        add = empty || (empty = types.cell.createAndFill());\n      else\n        add = emptyHead || (emptyHead = types.header_cell.createAndFill());\n      for (let i = map.width; i < width; i++)\n        cells.push(add);\n      tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);\n    }\n  }\n  if (height > map.height) {\n    const cells = [];\n    for (let i = 0, start2 = (map.height - 1) * map.width; i < Math.max(map.width, width); i++) {\n      const header = i >= map.width ? false : table.nodeAt(map.map[start2 + i]).type == types.header_cell;\n      cells.push(\n        header ? emptyHead || (emptyHead = types.header_cell.createAndFill()) : empty || (empty = types.cell.createAndFill())\n      );\n    }\n    const emptyRow = types.row.create(null, Fragment2.from(cells)), rows = [];\n    for (let i = map.height; i < height; i++)\n      rows.push(emptyRow);\n    tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);\n  }\n  return !!(empty || emptyHead);\n}\nfunction isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {\n  if (top == 0 || top == map.height)\n    return false;\n  let found = false;\n  for (let col = left; col < right; col++) {\n    const index = top * map.width + col, pos = map.map[index];\n    if (map.map[index - map.width] == pos) {\n      found = true;\n      const cell = table.nodeAt(pos);\n      const { top: cellTop, left: cellLeft } = map.findCell(pos);\n      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, {\n        ...cell.attrs,\n        rowspan: top - cellTop\n      });\n      tr.insert(\n        tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),\n        cell.type.createAndFill({\n          ...cell.attrs,\n          rowspan: cellTop + cell.attrs.rowspan - top\n        })\n      );\n      col += cell.attrs.colspan - 1;\n    }\n  }\n  return found;\n}\nfunction isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {\n  if (left == 0 || left == map.width)\n    return false;\n  let found = false;\n  for (let row = top; row < bottom; row++) {\n    const index = row * map.width + left, pos = map.map[index];\n    if (map.map[index - 1] == pos) {\n      found = true;\n      const cell = table.nodeAt(pos);\n      const cellLeft = map.colCount(pos);\n      const updatePos = tr.mapping.slice(mapFrom).map(pos + start);\n      tr.setNodeMarkup(\n        updatePos,\n        null,\n        removeColSpan(\n          cell.attrs,\n          left - cellLeft,\n          cell.attrs.colspan - (left - cellLeft)\n        )\n      );\n      tr.insert(\n        updatePos + cell.nodeSize,\n        cell.type.createAndFill(\n          removeColSpan(cell.attrs, 0, left - cellLeft)\n        )\n      );\n      row += cell.attrs.rowspan - 1;\n    }\n  }\n  return found;\n}\nfunction insertCells(state, dispatch, tableStart, rect, cells) {\n  let table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc;\n  if (!table) {\n    throw new Error(\"No table found\");\n  }\n  let map = TableMap.get(table);\n  const { top, left } = rect;\n  const right = left + cells.width, bottom = top + cells.height;\n  const tr = state.tr;\n  let mapFrom = 0;\n  function recomp() {\n    table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;\n    if (!table) {\n      throw new Error(\"No table found\");\n    }\n    map = TableMap.get(table);\n    mapFrom = tr.mapping.maps.length;\n  }\n  if (growTable(tr, map, table, tableStart, right, bottom, mapFrom))\n    recomp();\n  if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom))\n    recomp();\n  if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom))\n    recomp();\n  if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom))\n    recomp();\n  if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom))\n    recomp();\n  for (let row = top; row < bottom; row++) {\n    const from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);\n    tr.replace(\n      tr.mapping.slice(mapFrom).map(from + tableStart),\n      tr.mapping.slice(mapFrom).map(to + tableStart),\n      new Slice2(cells.rows[row - top], 0, 0)\n    );\n  }\n  recomp();\n  tr.setSelection(\n    new CellSelection(\n      tr.doc.resolve(tableStart + map.positionAt(top, left, table)),\n      tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))\n    )\n  );\n  dispatch(tr);\n}\n\n// src/input.ts\nvar handleKeyDown = keydownHandler({\n  ArrowLeft: arrow(\"horiz\", -1),\n  ArrowRight: arrow(\"horiz\", 1),\n  ArrowUp: arrow(\"vert\", -1),\n  ArrowDown: arrow(\"vert\", 1),\n  \"Shift-ArrowLeft\": shiftArrow(\"horiz\", -1),\n  \"Shift-ArrowRight\": shiftArrow(\"horiz\", 1),\n  \"Shift-ArrowUp\": shiftArrow(\"vert\", -1),\n  \"Shift-ArrowDown\": shiftArrow(\"vert\", 1),\n  Backspace: deleteCellSelection,\n  \"Mod-Backspace\": deleteCellSelection,\n  Delete: deleteCellSelection,\n  \"Mod-Delete\": deleteCellSelection\n});\nfunction maybeSetSelection(state, dispatch, selection) {\n  if (selection.eq(state.selection))\n    return false;\n  if (dispatch)\n    dispatch(state.tr.setSelection(selection).scrollIntoView());\n  return true;\n}\nfunction arrow(axis, dir) {\n  return (state, dispatch, view) => {\n    if (!view)\n      return false;\n    const sel = state.selection;\n    if (sel instanceof CellSelection) {\n      return maybeSetSelection(\n        state,\n        dispatch,\n        Selection2.near(sel.$headCell, dir)\n      );\n    }\n    if (axis != \"horiz\" && !sel.empty)\n      return false;\n    const end = atEndOfCell(view, axis, dir);\n    if (end == null)\n      return false;\n    if (axis == \"horiz\") {\n      return maybeSetSelection(\n        state,\n        dispatch,\n        Selection2.near(state.doc.resolve(sel.head + dir), dir)\n      );\n    } else {\n      const $cell = state.doc.resolve(end);\n      const $next = nextCell($cell, axis, dir);\n      let newSel;\n      if ($next)\n        newSel = Selection2.near($next, 1);\n      else if (dir < 0)\n        newSel = Selection2.near(state.doc.resolve($cell.before(-1)), -1);\n      else\n        newSel = Selection2.near(state.doc.resolve($cell.after(-1)), 1);\n      return maybeSetSelection(state, dispatch, newSel);\n    }\n  };\n}\nfunction shiftArrow(axis, dir) {\n  return (state, dispatch, view) => {\n    if (!view)\n      return false;\n    const sel = state.selection;\n    let cellSel;\n    if (sel instanceof CellSelection) {\n      cellSel = sel;\n    } else {\n      const end = atEndOfCell(view, axis, dir);\n      if (end == null)\n        return false;\n      cellSel = new CellSelection(state.doc.resolve(end));\n    }\n    const $head = nextCell(cellSel.$headCell, axis, dir);\n    if (!$head)\n      return false;\n    return maybeSetSelection(\n      state,\n      dispatch,\n      new CellSelection(cellSel.$anchorCell, $head)\n    );\n  };\n}\nfunction deleteCellSelection(state, dispatch) {\n  const sel = state.selection;\n  if (!(sel instanceof CellSelection))\n    return false;\n  if (dispatch) {\n    const tr = state.tr;\n    const baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;\n    sel.forEachCell((cell, pos) => {\n      if (!cell.content.eq(baseContent))\n        tr.replace(\n          tr.mapping.map(pos + 1),\n          tr.mapping.map(pos + cell.nodeSize - 1),\n          new Slice3(baseContent, 0, 0)\n        );\n    });\n    if (tr.docChanged)\n      dispatch(tr);\n  }\n  return true;\n}\nfunction handleTripleClick(view, pos) {\n  const doc = view.state.doc, $cell = cellAround(doc.resolve(pos));\n  if (!$cell)\n    return false;\n  view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));\n  return true;\n}\nfunction handlePaste(view, _, slice) {\n  if (!isInTable(view.state))\n    return false;\n  let cells = pastedCells(slice);\n  const sel = view.state.selection;\n  if (sel instanceof CellSelection) {\n    if (!cells)\n      cells = {\n        width: 1,\n        height: 1,\n        rows: [\n          Fragment3.from(\n            fitSlice(tableNodeTypes(view.state.schema).cell, slice)\n          )\n        ]\n      };\n    const table = sel.$anchorCell.node(-1);\n    const start = sel.$anchorCell.start(-1);\n    const rect = TableMap.get(table).rectBetween(\n      sel.$anchorCell.pos - start,\n      sel.$headCell.pos - start\n    );\n    cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);\n    insertCells(view.state, view.dispatch, start, rect, cells);\n    return true;\n  } else if (cells) {\n    const $cell = selectionCell(view.state);\n    const start = $cell.start(-1);\n    insertCells(\n      view.state,\n      view.dispatch,\n      start,\n      TableMap.get($cell.node(-1)).findCell($cell.pos - start),\n      cells\n    );\n    return true;\n  } else {\n    return false;\n  }\n}\nfunction handleMouseDown(view, startEvent) {\n  var _a;\n  if (startEvent.ctrlKey || startEvent.metaKey)\n    return;\n  const startDOMCell = domInCell(view, startEvent.target);\n  let $anchor;\n  if (startEvent.shiftKey && view.state.selection instanceof CellSelection) {\n    setCellSelection(view.state.selection.$anchorCell, startEvent);\n    startEvent.preventDefault();\n  } else if (startEvent.shiftKey && startDOMCell && ($anchor = cellAround(view.state.selection.$anchor)) != null && ((_a = cellUnderMouse(view, startEvent)) == null ? void 0 : _a.pos) != $anchor.pos) {\n    setCellSelection($anchor, startEvent);\n    startEvent.preventDefault();\n  } else if (!startDOMCell) {\n    return;\n  }\n  function setCellSelection($anchor2, event) {\n    let $head = cellUnderMouse(view, event);\n    const starting = tableEditingKey.getState(view.state) == null;\n    if (!$head || !inSameTable($anchor2, $head)) {\n      if (starting)\n        $head = $anchor2;\n      else\n        return;\n    }\n    const selection = new CellSelection($anchor2, $head);\n    if (starting || !view.state.selection.eq(selection)) {\n      const tr = view.state.tr.setSelection(selection);\n      if (starting)\n        tr.setMeta(tableEditingKey, $anchor2.pos);\n      view.dispatch(tr);\n    }\n  }\n  function stop() {\n    view.root.removeEventListener(\"mouseup\", stop);\n    view.root.removeEventListener(\"dragstart\", stop);\n    view.root.removeEventListener(\"mousemove\", move);\n    if (tableEditingKey.getState(view.state) != null)\n      view.dispatch(view.state.tr.setMeta(tableEditingKey, -1));\n  }\n  function move(_event) {\n    const event = _event;\n    const anchor = tableEditingKey.getState(view.state);\n    let $anchor2;\n    if (anchor != null) {\n      $anchor2 = view.state.doc.resolve(anchor);\n    } else if (domInCell(view, event.target) != startDOMCell) {\n      $anchor2 = cellUnderMouse(view, startEvent);\n      if (!$anchor2)\n        return stop();\n    }\n    if ($anchor2)\n      setCellSelection($anchor2, event);\n  }\n  view.root.addEventListener(\"mouseup\", stop);\n  view.root.addEventListener(\"dragstart\", stop);\n  view.root.addEventListener(\"mousemove\", move);\n}\nfunction atEndOfCell(view, axis, dir) {\n  if (!(view.state.selection instanceof TextSelection2))\n    return null;\n  const { $head } = view.state.selection;\n  for (let d = $head.depth - 1; d >= 0; d--) {\n    const parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d);\n    if (index != (dir < 0 ? 0 : parent.childCount))\n      return null;\n    if (parent.type.spec.tableRole == \"cell\" || parent.type.spec.tableRole == \"header_cell\") {\n      const cellPos = $head.before(d);\n      const dirStr = axis == \"vert\" ? dir > 0 ? \"down\" : \"up\" : dir > 0 ? \"right\" : \"left\";\n      return view.endOfTextblock(dirStr) ? cellPos : null;\n    }\n  }\n  return null;\n}\nfunction domInCell(view, dom) {\n  for (; dom && dom != view.dom; dom = dom.parentNode) {\n    if (dom.nodeName == \"TD\" || dom.nodeName == \"TH\") {\n      return dom;\n    }\n  }\n  return null;\n}\nfunction cellUnderMouse(view, event) {\n  const mousePos = view.posAtCoords({\n    left: event.clientX,\n    top: event.clientY\n  });\n  if (!mousePos)\n    return null;\n  return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null;\n}\n\n// src/columnresizing.ts\nimport { Plugin, PluginKey as PluginKey3 } from \"prosemirror-state\";\nimport {\n  Decoration as Decoration2,\n  DecorationSet as DecorationSet2\n} from \"prosemirror-view\";\n\n// src/tableview.ts\nvar TableView = class {\n  constructor(node, cellMinWidth) {\n    this.node = node;\n    this.cellMinWidth = cellMinWidth;\n    this.dom = document.createElement(\"div\");\n    this.dom.className = \"tableWrapper\";\n    this.table = this.dom.appendChild(document.createElement(\"table\"));\n    this.colgroup = this.table.appendChild(document.createElement(\"colgroup\"));\n    updateColumnsOnResize(node, this.colgroup, this.table, cellMinWidth);\n    this.contentDOM = this.table.appendChild(document.createElement(\"tbody\"));\n  }\n  update(node) {\n    if (node.type != this.node.type)\n      return false;\n    this.node = node;\n    updateColumnsOnResize(node, this.colgroup, this.table, this.cellMinWidth);\n    return true;\n  }\n  ignoreMutation(record) {\n    return record.type == \"attributes\" && (record.target == this.table || this.colgroup.contains(record.target));\n  }\n};\nfunction updateColumnsOnResize(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {\n  var _a;\n  let totalWidth = 0;\n  let fixedWidth = true;\n  let nextDOM = colgroup.firstChild;\n  const row = node.firstChild;\n  if (!row)\n    return;\n  for (let i = 0, col = 0; i < row.childCount; i++) {\n    const { colspan, colwidth } = row.child(i).attrs;\n    for (let j = 0; j < colspan; j++, col++) {\n      const hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j];\n      const cssWidth = hasWidth ? hasWidth + \"px\" : \"\";\n      totalWidth += hasWidth || cellMinWidth;\n      if (!hasWidth)\n        fixedWidth = false;\n      if (!nextDOM) {\n        colgroup.appendChild(document.createElement(\"col\")).style.width = cssWidth;\n      } else {\n        if (nextDOM.style.width != cssWidth)\n          nextDOM.style.width = cssWidth;\n        nextDOM = nextDOM.nextSibling;\n      }\n    }\n  }\n  while (nextDOM) {\n    const after = nextDOM.nextSibling;\n    (_a = nextDOM.parentNode) == null ? void 0 : _a.removeChild(nextDOM);\n    nextDOM = after;\n  }\n  if (fixedWidth) {\n    table.style.width = totalWidth + \"px\";\n    table.style.minWidth = \"\";\n  } else {\n    table.style.width = \"\";\n    table.style.minWidth = totalWidth + \"px\";\n  }\n}\n\n// src/columnresizing.ts\nvar columnResizingPluginKey = new PluginKey3(\n  \"tableColumnResizing\"\n);\nfunction columnResizing({\n  handleWidth = 5,\n  cellMinWidth = 25,\n  View = TableView,\n  lastColumnResizable = true\n} = {}) {\n  const plugin = new Plugin({\n    key: columnResizingPluginKey,\n    state: {\n      init(_, state) {\n        plugin.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] = (node, view) => new View(node, cellMinWidth, view);\n        return new ResizeState(-1, false);\n      },\n      apply(tr, prev) {\n        return prev.apply(tr);\n      }\n    },\n    props: {\n      attributes: (state) => {\n        const pluginState = columnResizingPluginKey.getState(state);\n        return pluginState && pluginState.activeHandle > -1 ? { class: \"resize-cursor\" } : {};\n      },\n      handleDOMEvents: {\n        mousemove: (view, event) => {\n          handleMouseMove(\n            view,\n            event,\n            handleWidth,\n            cellMinWidth,\n            lastColumnResizable\n          );\n        },\n        mouseleave: (view) => {\n          handleMouseLeave(view);\n        },\n        mousedown: (view, event) => {\n          handleMouseDown2(view, event, cellMinWidth);\n        }\n      },\n      decorations: (state) => {\n        const pluginState = columnResizingPluginKey.getState(state);\n        if (pluginState && pluginState.activeHandle > -1) {\n          return handleDecorations(state, pluginState.activeHandle);\n        }\n      },\n      nodeViews: {}\n    }\n  });\n  return plugin;\n}\nvar ResizeState = class {\n  constructor(activeHandle, dragging) {\n    this.activeHandle = activeHandle;\n    this.dragging = dragging;\n  }\n  apply(tr) {\n    const state = this;\n    const action = tr.getMeta(columnResizingPluginKey);\n    if (action && action.setHandle != null)\n      return new ResizeState(action.setHandle, false);\n    if (action && action.setDragging !== void 0)\n      return new ResizeState(state.activeHandle, action.setDragging);\n    if (state.activeHandle > -1 && tr.docChanged) {\n      let handle = tr.mapping.map(state.activeHandle, -1);\n      if (!pointsAtCell(tr.doc.resolve(handle))) {\n        handle = -1;\n      }\n      return new ResizeState(handle, state.dragging);\n    }\n    return state;\n  }\n};\nfunction handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {\n  const pluginState = columnResizingPluginKey.getState(view.state);\n  if (!pluginState)\n    return;\n  if (!pluginState.dragging) {\n    const target = domCellAround(event.target);\n    let cell = -1;\n    if (target) {\n      const { left, right } = target.getBoundingClientRect();\n      if (event.clientX - left <= handleWidth)\n        cell = edgeCell(view, event, \"left\");\n      else if (right - event.clientX <= handleWidth)\n        cell = edgeCell(view, event, \"right\");\n    }\n    if (cell != pluginState.activeHandle) {\n      if (!lastColumnResizable && cell !== -1) {\n        const $cell = view.state.doc.resolve(cell);\n        const table = $cell.node(-1);\n        const map = TableMap.get(table);\n        const tableStart = $cell.start(-1);\n        const col = map.colCount($cell.pos - tableStart) + $cell.nodeAfter.attrs.colspan - 1;\n        if (col == map.width - 1) {\n          return;\n        }\n      }\n      updateHandle(view, cell);\n    }\n  }\n}\nfunction handleMouseLeave(view) {\n  const pluginState = columnResizingPluginKey.getState(view.state);\n  if (pluginState && pluginState.activeHandle > -1 && !pluginState.dragging)\n    updateHandle(view, -1);\n}\nfunction handleMouseDown2(view, event, cellMinWidth) {\n  const pluginState = columnResizingPluginKey.getState(view.state);\n  if (!pluginState || pluginState.activeHandle == -1 || pluginState.dragging)\n    return false;\n  const cell = view.state.doc.nodeAt(pluginState.activeHandle);\n  const width = currentColWidth(view, pluginState.activeHandle, cell.attrs);\n  view.dispatch(\n    view.state.tr.setMeta(columnResizingPluginKey, {\n      setDragging: { startX: event.clientX, startWidth: width }\n    })\n  );\n  function finish(event2) {\n    window.removeEventListener(\"mouseup\", finish);\n    window.removeEventListener(\"mousemove\", move);\n    const pluginState2 = columnResizingPluginKey.getState(view.state);\n    if (pluginState2 == null ? void 0 : pluginState2.dragging) {\n      updateColumnWidth(\n        view,\n        pluginState2.activeHandle,\n        draggedWidth(pluginState2.dragging, event2, cellMinWidth)\n      );\n      view.dispatch(\n        view.state.tr.setMeta(columnResizingPluginKey, { setDragging: null })\n      );\n    }\n  }\n  function move(event2) {\n    if (!event2.which)\n      return finish(event2);\n    const pluginState2 = columnResizingPluginKey.getState(view.state);\n    if (!pluginState2)\n      return;\n    if (pluginState2.dragging) {\n      const dragged = draggedWidth(pluginState2.dragging, event2, cellMinWidth);\n      displayColumnWidth(view, pluginState2.activeHandle, dragged, cellMinWidth);\n    }\n  }\n  window.addEventListener(\"mouseup\", finish);\n  window.addEventListener(\"mousemove\", move);\n  event.preventDefault();\n  return true;\n}\nfunction currentColWidth(view, cellPos, { colspan, colwidth }) {\n  const width = colwidth && colwidth[colwidth.length - 1];\n  if (width)\n    return width;\n  const dom = view.domAtPos(cellPos);\n  const node = dom.node.childNodes[dom.offset];\n  let domWidth = node.offsetWidth, parts = colspan;\n  if (colwidth) {\n    for (let i = 0; i < colspan; i++)\n      if (colwidth[i]) {\n        domWidth -= colwidth[i];\n        parts--;\n      }\n  }\n  return domWidth / parts;\n}\nfunction domCellAround(target) {\n  while (target && target.nodeName != \"TD\" && target.nodeName != \"TH\")\n    target = target.classList && target.classList.contains(\"ProseMirror\") ? null : target.parentNode;\n  return target;\n}\nfunction edgeCell(view, event, side) {\n  const found = view.posAtCoords({ left: event.clientX, top: event.clientY });\n  if (!found)\n    return -1;\n  const { pos } = found;\n  const $cell = cellAround(view.state.doc.resolve(pos));\n  if (!$cell)\n    return -1;\n  if (side == \"right\")\n    return $cell.pos;\n  const map = TableMap.get($cell.node(-1)), start = $cell.start(-1);\n  const index = map.map.indexOf($cell.pos - start);\n  return index % map.width == 0 ? -1 : start + map.map[index - 1];\n}\nfunction draggedWidth(dragging, event, cellMinWidth) {\n  const offset = event.clientX - dragging.startX;\n  return Math.max(cellMinWidth, dragging.startWidth + offset);\n}\nfunction updateHandle(view, value) {\n  view.dispatch(\n    view.state.tr.setMeta(columnResizingPluginKey, { setHandle: value })\n  );\n}\nfunction updateColumnWidth(view, cell, width) {\n  const $cell = view.state.doc.resolve(cell);\n  const table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);\n  const col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;\n  const tr = view.state.tr;\n  for (let row = 0; row < map.height; row++) {\n    const mapIndex = row * map.width + col;\n    if (row && map.map[mapIndex] == map.map[mapIndex - map.width])\n      continue;\n    const pos = map.map[mapIndex];\n    const attrs = table.nodeAt(pos).attrs;\n    const index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);\n    if (attrs.colwidth && attrs.colwidth[index] == width)\n      continue;\n    const colwidth = attrs.colwidth ? attrs.colwidth.slice() : zeroes(attrs.colspan);\n    colwidth[index] = width;\n    tr.setNodeMarkup(start + pos, null, { ...attrs, colwidth });\n  }\n  if (tr.docChanged)\n    view.dispatch(tr);\n}\nfunction displayColumnWidth(view, cell, width, cellMinWidth) {\n  const $cell = view.state.doc.resolve(cell);\n  const table = $cell.node(-1), start = $cell.start(-1);\n  const col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;\n  let dom = view.domAtPos($cell.start(-1)).node;\n  while (dom && dom.nodeName != \"TABLE\") {\n    dom = dom.parentNode;\n  }\n  if (!dom)\n    return;\n  updateColumnsOnResize(\n    table,\n    dom.firstChild,\n    dom,\n    cellMinWidth,\n    col,\n    width\n  );\n}\nfunction zeroes(n) {\n  return Array(n).fill(0);\n}\nfunction handleDecorations(state, cell) {\n  const decorations = [];\n  const $cell = state.doc.resolve(cell);\n  const table = $cell.node(-1);\n  if (!table) {\n    return DecorationSet2.empty;\n  }\n  const map = TableMap.get(table);\n  const start = $cell.start(-1);\n  const col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;\n  for (let row = 0; row < map.height; row++) {\n    const index = col + row * map.width - 1;\n    if ((col == map.width || map.map[index] != map.map[index + 1]) && (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])) {\n      const cellPos = map.map[index];\n      const pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;\n      const dom = document.createElement(\"div\");\n      dom.className = \"column-resize-handle\";\n      decorations.push(Decoration2.widget(pos, dom));\n    }\n  }\n  return DecorationSet2.create(state.doc, decorations);\n}\n\n// src/commands.ts\nimport { Fragment as Fragment4 } from \"prosemirror-model\";\nimport {\n  TextSelection as TextSelection3\n} from \"prosemirror-state\";\nfunction selectedRect(state) {\n  const sel = state.selection;\n  const $pos = selectionCell(state);\n  const table = $pos.node(-1);\n  const tableStart = $pos.start(-1);\n  const map = TableMap.get(table);\n  const rect = sel instanceof CellSelection ? map.rectBetween(\n    sel.$anchorCell.pos - tableStart,\n    sel.$headCell.pos - tableStart\n  ) : map.findCell($pos.pos - tableStart);\n  return { ...rect, tableStart, map, table };\n}\nfunction addColumn(tr, { map, tableStart, table }, col) {\n  let refColumn = col > 0 ? -1 : 0;\n  if (columnIsHeader(map, table, col + refColumn)) {\n    refColumn = col == 0 || col == map.width ? null : 0;\n  }\n  for (let row = 0; row < map.height; row++) {\n    const index = row * map.width + col;\n    if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {\n      const pos = map.map[index];\n      const cell = table.nodeAt(pos);\n      tr.setNodeMarkup(\n        tr.mapping.map(tableStart + pos),\n        null,\n        addColSpan(cell.attrs, col - map.colCount(pos))\n      );\n      row += cell.attrs.rowspan - 1;\n    } else {\n      const type = refColumn == null ? tableNodeTypes(table.type.schema).cell : table.nodeAt(map.map[index + refColumn]).type;\n      const pos = map.positionAt(row, col, table);\n      tr.insert(tr.mapping.map(tableStart + pos), type.createAndFill());\n    }\n  }\n  return tr;\n}\nfunction addColumnBefore(state, dispatch) {\n  if (!isInTable(state))\n    return false;\n  if (dispatch) {\n    const rect = selectedRect(state);\n    dispatch(addColumn(state.tr, rect, rect.left));\n  }\n  return true;\n}\nfunction addColumnAfter(state, dispatch) {\n  if (!isInTable(state))\n    return false;\n  if (dispatch) {\n    const rect = selectedRect(state);\n    dispatch(addColumn(state.tr, rect, rect.right));\n  }\n  return true;\n}\nfunction removeColumn(tr, { map, table, tableStart }, col) {\n  const mapStart = tr.mapping.maps.length;\n  for (let row = 0; row < map.height; ) {\n    const index = row * map.width + col;\n    const pos = map.map[index];\n    const cell = table.nodeAt(pos);\n    const attrs = cell.attrs;\n    if (col > 0 && map.map[index - 1] == pos || col < map.width - 1 && map.map[index + 1] == pos) {\n      tr.setNodeMarkup(\n        tr.mapping.slice(mapStart).map(tableStart + pos),\n        null,\n        removeColSpan(attrs, col - map.colCount(pos))\n      );\n    } else {\n      const start = tr.mapping.slice(mapStart).map(tableStart + pos);\n      tr.delete(start, start + cell.nodeSize);\n    }\n    row += attrs.rowspan;\n  }\n}\nfunction deleteColumn(state, dispatch) {\n  if (!isInTable(state))\n    return false;\n  if (dispatch) {\n    const rect = selectedRect(state);\n    const tr = state.tr;\n    if (rect.left == 0 && rect.right == rect.map.width)\n      return false;\n    for (let i = rect.right - 1; ; i--) {\n      removeColumn(tr, rect, i);\n      if (i == rect.left)\n        break;\n      const table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;\n      if (!table) {\n        throw RangeError(\"No table found\");\n      }\n      rect.table = table;\n      rect.map = TableMap.get(table);\n    }\n    dispatch(tr);\n  }\n  return true;\n}\nfunction rowIsHeader(map, table, row) {\n  var _a;\n  const headerCell = tableNodeTypes(table.type.schema).header_cell;\n  for (let col = 0; col < map.width; col++)\n    if (((_a = table.nodeAt(map.map[col + row * map.width])) == null ? void 0 : _a.type) != headerCell)\n      return false;\n  return true;\n}\nfunction addRow(tr, { map, tableStart, table }, row) {\n  var _a;\n  let rowPos = tableStart;\n  for (let i = 0; i < row; i++)\n    rowPos += table.child(i).nodeSize;\n  const cells = [];\n  let refRow = row > 0 ? -1 : 0;\n  if (rowIsHeader(map, table, row + refRow))\n    refRow = row == 0 || row == map.height ? null : 0;\n  for (let col = 0, index = map.width * row; col < map.width; col++, index++) {\n    if (row > 0 && row < map.height && map.map[index] == map.map[index - map.width]) {\n      const pos = map.map[index];\n      const attrs = table.nodeAt(pos).attrs;\n      tr.setNodeMarkup(tableStart + pos, null, {\n        ...attrs,\n        rowspan: attrs.rowspan + 1\n      });\n      col += attrs.colspan - 1;\n    } else {\n      const type = refRow == null ? tableNodeTypes(table.type.schema).cell : (_a = table.nodeAt(map.map[index + refRow * map.width])) == null ? void 0 : _a.type;\n      const node = type == null ? void 0 : type.createAndFill();\n      if (node)\n        cells.push(node);\n    }\n  }\n  tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells));\n  return tr;\n}\nfunction addRowBefore(state, dispatch) {\n  if (!isInTable(state))\n    return false;\n  if (dispatch) {\n    const rect = selectedRect(state);\n    dispatch(addRow(state.tr, rect, rect.top));\n  }\n  return true;\n}\nfunction addRowAfter(state, dispatch) {\n  if (!isInTable(state))\n    return false;\n  if (dispatch) {\n    const rect = selectedRect(state);\n    dispatch(addRow(state.tr, rect, rect.bottom));\n  }\n  return true;\n}\nfunction removeRow(tr, { map, table, tableStart }, row) {\n  let rowPos = 0;\n  for (let i = 0; i < row; i++)\n    rowPos += table.child(i).nodeSize;\n  const nextRow = rowPos + table.child(row).nodeSize;\n  const mapFrom = tr.mapping.maps.length;\n  tr.delete(rowPos + tableStart, nextRow + tableStart);\n  for (let col = 0, index = row * map.width; col < map.width; col++, index++) {\n    const pos = map.map[index];\n    if (row > 0 && pos == map.map[index - map.width]) {\n      const attrs = table.nodeAt(pos).attrs;\n      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + tableStart), null, {\n        ...attrs,\n        rowspan: attrs.rowspan - 1\n      });\n      col += attrs.colspan - 1;\n    } else if (row < map.width && pos == map.map[index + map.width]) {\n      const cell = table.nodeAt(pos);\n      const attrs = cell.attrs;\n      const copy = cell.type.create(\n        { ...attrs, rowspan: cell.attrs.rowspan - 1 },\n        cell.content\n      );\n      const newPos = map.positionAt(row + 1, col, table);\n      tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy);\n      col += attrs.colspan - 1;\n    }\n  }\n}\nfunction deleteRow(state, dispatch) {\n  if (!isInTable(state))\n    return false;\n  if (dispatch) {\n    const rect = selectedRect(state), tr = state.tr;\n    if (rect.top == 0 && rect.bottom == rect.map.height)\n      return false;\n    for (let i = rect.bottom - 1; ; i--) {\n      removeRow(tr, rect, i);\n      if (i == rect.top)\n        break;\n      const table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;\n      if (!table) {\n        throw RangeError(\"No table found\");\n      }\n      rect.table = table;\n      rect.map = TableMap.get(rect.table);\n    }\n    dispatch(tr);\n  }\n  return true;\n}\nfunction isEmpty(cell) {\n  const c = cell.content;\n  return c.childCount == 1 && c.child(0).isTextblock && c.child(0).childCount == 0;\n}\nfunction cellsOverlapRectangle({ width, height, map }, rect) {\n  let indexTop = rect.top * width + rect.left, indexLeft = indexTop;\n  let indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1);\n  for (let i = rect.top; i < rect.bottom; i++) {\n    if (rect.left > 0 && map[indexLeft] == map[indexLeft - 1] || rect.right < width && map[indexRight] == map[indexRight + 1])\n      return true;\n    indexLeft += width;\n    indexRight += width;\n  }\n  for (let i = rect.left; i < rect.right; i++) {\n    if (rect.top > 0 && map[indexTop] == map[indexTop - width] || rect.bottom < height && map[indexBottom] == map[indexBottom + width])\n      return true;\n    indexTop++;\n    indexBottom++;\n  }\n  return false;\n}\nfunction mergeCells(state, dispatch) {\n  const sel = state.selection;\n  if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos)\n    return false;\n  const rect = selectedRect(state), { map } = rect;\n  if (cellsOverlapRectangle(map, rect))\n    return false;\n  if (dispatch) {\n    const tr = state.tr;\n    const seen = {};\n    let content = Fragment4.empty;\n    let mergedPos;\n    let mergedCell;\n    for (let row = rect.top; row < rect.bottom; row++) {\n      for (let col = rect.left; col < rect.right; col++) {\n        const cellPos = map.map[row * map.width + col];\n        const cell = rect.table.nodeAt(cellPos);\n        if (seen[cellPos] || !cell)\n          continue;\n        seen[cellPos] = true;\n        if (mergedPos == null) {\n          mergedPos = cellPos;\n          mergedCell = cell;\n        } else {\n          if (!isEmpty(cell))\n            content = content.append(cell.content);\n          const mapped = tr.mapping.map(cellPos + rect.tableStart);\n          tr.delete(mapped, mapped + cell.nodeSize);\n        }\n      }\n    }\n    if (mergedPos == null || mergedCell == null) {\n      return true;\n    }\n    tr.setNodeMarkup(mergedPos + rect.tableStart, null, {\n      ...addColSpan(\n        mergedCell.attrs,\n        mergedCell.attrs.colspan,\n        rect.right - rect.left - mergedCell.attrs.colspan\n      ),\n      rowspan: rect.bottom - rect.top\n    });\n    if (content.size) {\n      const end = mergedPos + 1 + mergedCell.content.size;\n      const start = isEmpty(mergedCell) ? mergedPos + 1 : end;\n      tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content);\n    }\n    tr.setSelection(\n      new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart))\n    );\n    dispatch(tr);\n  }\n  return true;\n}\nfunction splitCell(state, dispatch) {\n  const nodeTypes = tableNodeTypes(state.schema);\n  return splitCellWithType(({ node }) => {\n    return nodeTypes[node.type.spec.tableRole];\n  })(state, dispatch);\n}\nfunction splitCellWithType(getCellType) {\n  return (state, dispatch) => {\n    var _a;\n    const sel = state.selection;\n    let cellNode;\n    let cellPos;\n    if (!(sel instanceof CellSelection)) {\n      cellNode = cellWrapping(sel.$from);\n      if (!cellNode)\n        return false;\n      cellPos = (_a = cellAround(sel.$from)) == null ? void 0 : _a.pos;\n    } else {\n      if (sel.$anchorCell.pos != sel.$headCell.pos)\n        return false;\n      cellNode = sel.$anchorCell.nodeAfter;\n      cellPos = sel.$anchorCell.pos;\n    }\n    if (cellNode == null || cellPos == null) {\n      return false;\n    }\n    if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {\n      return false;\n    }\n    if (dispatch) {\n      let baseAttrs = cellNode.attrs;\n      const attrs = [];\n      const colwidth = baseAttrs.colwidth;\n      if (baseAttrs.rowspan > 1)\n        baseAttrs = { ...baseAttrs, rowspan: 1 };\n      if (baseAttrs.colspan > 1)\n        baseAttrs = { ...baseAttrs, colspan: 1 };\n      const rect = selectedRect(state), tr = state.tr;\n      for (let i = 0; i < rect.right - rect.left; i++)\n        attrs.push(\n          colwidth ? {\n            ...baseAttrs,\n            colwidth: colwidth && colwidth[i] ? [colwidth[i]] : null\n          } : baseAttrs\n        );\n      let lastCell;\n      for (let row = rect.top; row < rect.bottom; row++) {\n        let pos = rect.map.positionAt(row, rect.left, rect.table);\n        if (row == rect.top)\n          pos += cellNode.nodeSize;\n        for (let col = rect.left, i = 0; col < rect.right; col++, i++) {\n          if (col == rect.left && row == rect.top)\n            continue;\n          tr.insert(\n            lastCell = tr.mapping.map(pos + rect.tableStart, 1),\n            getCellType({ node: cellNode, row, col }).createAndFill(attrs[i])\n          );\n        }\n      }\n      tr.setNodeMarkup(\n        cellPos,\n        getCellType({ node: cellNode, row: rect.top, col: rect.left }),\n        attrs[0]\n      );\n      if (sel instanceof CellSelection)\n        tr.setSelection(\n          new CellSelection(\n            tr.doc.resolve(sel.$anchorCell.pos),\n            lastCell ? tr.doc.resolve(lastCell) : void 0\n          )\n        );\n      dispatch(tr);\n    }\n    return true;\n  };\n}\nfunction setCellAttr(name, value) {\n  return function(state, dispatch) {\n    if (!isInTable(state))\n      return false;\n    const $cell = selectionCell(state);\n    if ($cell.nodeAfter.attrs[name] === value)\n      return false;\n    if (dispatch) {\n      const tr = state.tr;\n      if (state.selection instanceof CellSelection)\n        state.selection.forEachCell((node, pos) => {\n          if (node.attrs[name] !== value)\n            tr.setNodeMarkup(pos, null, {\n              ...node.attrs,\n              [name]: value\n            });\n        });\n      else\n        tr.setNodeMarkup($cell.pos, null, {\n          ...$cell.nodeAfter.attrs,\n          [name]: value\n        });\n      dispatch(tr);\n    }\n    return true;\n  };\n}\nfunction deprecated_toggleHeader(type) {\n  return function(state, dispatch) {\n    if (!isInTable(state))\n      return false;\n    if (dispatch) {\n      const types = tableNodeTypes(state.schema);\n      const rect = selectedRect(state), tr = state.tr;\n      const cells = rect.map.cellsInRect(\n        type == \"column\" ? {\n          left: rect.left,\n          top: 0,\n          right: rect.right,\n          bottom: rect.map.height\n        } : type == \"row\" ? {\n          left: 0,\n          top: rect.top,\n          right: rect.map.width,\n          bottom: rect.bottom\n        } : rect\n      );\n      const nodes = cells.map((pos) => rect.table.nodeAt(pos));\n      for (let i = 0; i < cells.length; i++)\n        if (nodes[i].type == types.header_cell)\n          tr.setNodeMarkup(\n            rect.tableStart + cells[i],\n            types.cell,\n            nodes[i].attrs\n          );\n      if (tr.steps.length == 0)\n        for (let i = 0; i < cells.length; i++)\n          tr.setNodeMarkup(\n            rect.tableStart + cells[i],\n            types.header_cell,\n            nodes[i].attrs\n          );\n      dispatch(tr);\n    }\n    return true;\n  };\n}\nfunction isHeaderEnabledByType(type, rect, types) {\n  const cellPositions = rect.map.cellsInRect({\n    left: 0,\n    top: 0,\n    right: type == \"row\" ? rect.map.width : 1,\n    bottom: type == \"column\" ? rect.map.height : 1\n  });\n  for (let i = 0; i < cellPositions.length; i++) {\n    const cell = rect.table.nodeAt(cellPositions[i]);\n    if (cell && cell.type !== types.header_cell) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction toggleHeader(type, options) {\n  options = options || { useDeprecatedLogic: false };\n  if (options.useDeprecatedLogic)\n    return deprecated_toggleHeader(type);\n  return function(state, dispatch) {\n    if (!isInTable(state))\n      return false;\n    if (dispatch) {\n      const types = tableNodeTypes(state.schema);\n      const rect = selectedRect(state), tr = state.tr;\n      const isHeaderRowEnabled = isHeaderEnabledByType(\"row\", rect, types);\n      const isHeaderColumnEnabled = isHeaderEnabledByType(\n        \"column\",\n        rect,\n        types\n      );\n      const isHeaderEnabled = type === \"column\" ? isHeaderRowEnabled : type === \"row\" ? isHeaderColumnEnabled : false;\n      const selectionStartsAt = isHeaderEnabled ? 1 : 0;\n      const cellsRect = type == \"column\" ? {\n        left: 0,\n        top: selectionStartsAt,\n        right: 1,\n        bottom: rect.map.height\n      } : type == \"row\" ? {\n        left: selectionStartsAt,\n        top: 0,\n        right: rect.map.width,\n        bottom: 1\n      } : rect;\n      const newType = type == \"column\" ? isHeaderColumnEnabled ? types.cell : types.header_cell : type == \"row\" ? isHeaderRowEnabled ? types.cell : types.header_cell : types.cell;\n      rect.map.cellsInRect(cellsRect).forEach((relativeCellPos) => {\n        const cellPos = relativeCellPos + rect.tableStart;\n        const cell = tr.doc.nodeAt(cellPos);\n        if (cell) {\n          tr.setNodeMarkup(cellPos, newType, cell.attrs);\n        }\n      });\n      dispatch(tr);\n    }\n    return true;\n  };\n}\nvar toggleHeaderRow = toggleHeader(\"row\", {\n  useDeprecatedLogic: true\n});\nvar toggleHeaderColumn = toggleHeader(\"column\", {\n  useDeprecatedLogic: true\n});\nvar toggleHeaderCell = toggleHeader(\"cell\", {\n  useDeprecatedLogic: true\n});\nfunction findNextCell($cell, dir) {\n  if (dir < 0) {\n    const before = $cell.nodeBefore;\n    if (before)\n      return $cell.pos - before.nodeSize;\n    for (let row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {\n      const rowNode = $cell.node(-1).child(row);\n      const lastChild = rowNode.lastChild;\n      if (lastChild) {\n        return rowEnd - 1 - lastChild.nodeSize;\n      }\n      rowEnd -= rowNode.nodeSize;\n    }\n  } else {\n    if ($cell.index() < $cell.parent.childCount - 1) {\n      return $cell.pos + $cell.nodeAfter.nodeSize;\n    }\n    const table = $cell.node(-1);\n    for (let row = $cell.indexAfter(-1), rowStart = $cell.after(); row < table.childCount; row++) {\n      const rowNode = table.child(row);\n      if (rowNode.childCount)\n        return rowStart + 1;\n      rowStart += rowNode.nodeSize;\n    }\n  }\n  return null;\n}\nfunction goToNextCell(direction) {\n  return function(state, dispatch) {\n    if (!isInTable(state))\n      return false;\n    const cell = findNextCell(selectionCell(state), direction);\n    if (cell == null)\n      return false;\n    if (dispatch) {\n      const $cell = state.doc.resolve(cell);\n      dispatch(\n        state.tr.setSelection(TextSelection3.between($cell, moveCellForward($cell))).scrollIntoView()\n      );\n    }\n    return true;\n  };\n}\nfunction deleteTable(state, dispatch) {\n  const $pos = state.selection.$anchor;\n  for (let d = $pos.depth; d > 0; d--) {\n    const node = $pos.node(d);\n    if (node.type.spec.tableRole == \"table\") {\n      if (dispatch)\n        dispatch(\n          state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView()\n        );\n      return true;\n    }\n  }\n  return false;\n}\n\n// src/index.ts\nfunction tableEditing({\n  allowTableNodeSelection = false\n} = {}) {\n  return new Plugin2({\n    key: tableEditingKey,\n    state: {\n      init() {\n        return null;\n      },\n      apply(tr, cur) {\n        const set = tr.getMeta(tableEditingKey);\n        if (set != null)\n          return set == -1 ? null : set;\n        if (cur == null || !tr.docChanged)\n          return cur;\n        const { deleted, pos } = tr.mapping.mapResult(cur);\n        return deleted ? null : pos;\n      }\n    },\n    props: {\n      decorations: drawCellSelection,\n      handleDOMEvents: {\n        mousedown: handleMouseDown\n      },\n      createSelectionBetween(view) {\n        return tableEditingKey.getState(view.state) != null ? view.state.selection : null;\n      },\n      handleTripleClick,\n      handleKeyDown,\n      handlePaste\n    },\n    appendTransaction(_, oldState, state) {\n      return normalizeSelection(\n        state,\n        fixTables(state, oldState),\n        allowTableNodeSelection\n      );\n    }\n  });\n}\nexport {\n  CellBookmark,\n  CellSelection,\n  ResizeState,\n  TableMap,\n  TableView,\n  clipCells as __clipCells,\n  insertCells as __insertCells,\n  pastedCells as __pastedCells,\n  addColSpan,\n  addColumn,\n  addColumnAfter,\n  addColumnBefore,\n  addRow,\n  addRowAfter,\n  addRowBefore,\n  cellAround,\n  colCount,\n  columnIsHeader,\n  columnResizing,\n  columnResizingPluginKey,\n  deleteColumn,\n  deleteRow,\n  deleteTable,\n  findCell,\n  fixTables,\n  fixTablesKey,\n  goToNextCell,\n  handlePaste,\n  inSameTable,\n  isInTable,\n  mergeCells,\n  moveCellForward,\n  nextCell,\n  pointsAtCell,\n  removeColSpan,\n  removeColumn,\n  removeRow,\n  rowIsHeader,\n  selectedRect,\n  selectionCell,\n  setCellAttr,\n  splitCell,\n  splitCellWithType,\n  tableEditing,\n  tableEditingKey,\n  tableNodeTypes,\n  tableNodes,\n  toggleHeader,\n  toggleHeaderCell,\n  toggleHeaderColumn,\n  toggleHeaderRow,\n  updateColumnsOnResize\n};\n","import { ReplaceError, Slice, Fragment, MarkType, Mark } from 'prosemirror-model';\n\n// Recovery values encode a range index and an offset. They are\n// represented as numbers, because tons of them will be created when\n// mapping, for example, a large number of decorations. The number's\n// lower 16 bits provide the index, the remaining bits the offset.\n//\n// Note: We intentionally don't use bit shift operators to en- and\n// decode these, since those clip to 32 bits, which we might in rare\n// cases want to overflow. A 64-bit float can represent 48-bit\n// integers precisely.\nconst lower16 = 0xffff;\nconst factor16 = Math.pow(2, 16);\nfunction makeRecover(index, offset) { return index + offset * factor16; }\nfunction recoverIndex(value) { return value & lower16; }\nfunction recoverOffset(value) { return (value - (value & lower16)) / factor16; }\nconst DEL_BEFORE = 1, DEL_AFTER = 2, DEL_ACROSS = 4, DEL_SIDE = 8;\n/**\nAn object representing a mapped position with extra\ninformation.\n*/\nclass MapResult {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The mapped version of the position.\n    */\n    pos, \n    /**\n    @internal\n    */\n    delInfo, \n    /**\n    @internal\n    */\n    recover) {\n        this.pos = pos;\n        this.delInfo = delInfo;\n        this.recover = recover;\n    }\n    /**\n    Tells you whether the position was deleted, that is, whether the\n    step removed the token on the side queried (via the `assoc`)\n    argument from the document.\n    */\n    get deleted() { return (this.delInfo & DEL_SIDE) > 0; }\n    /**\n    Tells you whether the token before the mapped position was deleted.\n    */\n    get deletedBefore() { return (this.delInfo & (DEL_BEFORE | DEL_ACROSS)) > 0; }\n    /**\n    True when the token after the mapped position was deleted.\n    */\n    get deletedAfter() { return (this.delInfo & (DEL_AFTER | DEL_ACROSS)) > 0; }\n    /**\n    Tells whether any of the steps mapped through deletes across the\n    position (including both the token before and after the\n    position).\n    */\n    get deletedAcross() { return (this.delInfo & DEL_ACROSS) > 0; }\n}\n/**\nA map describing the deletions and insertions made by a step, which\ncan be used to find the correspondence between positions in the\npre-step version of a document and the same position in the\npost-step version.\n*/\nclass StepMap {\n    /**\n    Create a position map. The modifications to the document are\n    represented as an array of numbers, in which each group of three\n    represents a modified chunk as `[start, oldSize, newSize]`.\n    */\n    constructor(\n    /**\n    @internal\n    */\n    ranges, \n    /**\n    @internal\n    */\n    inverted = false) {\n        this.ranges = ranges;\n        this.inverted = inverted;\n        if (!ranges.length && StepMap.empty)\n            return StepMap.empty;\n    }\n    /**\n    @internal\n    */\n    recover(value) {\n        let diff = 0, index = recoverIndex(value);\n        if (!this.inverted)\n            for (let i = 0; i < index; i++)\n                diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];\n        return this.ranges[index * 3] + diff + recoverOffset(value);\n    }\n    mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n    map(pos, assoc = 1) { return this._map(pos, assoc, true); }\n    /**\n    @internal\n    */\n    _map(pos, assoc, simple) {\n        let diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i] - (this.inverted ? diff : 0);\n            if (start > pos)\n                break;\n            let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize;\n            if (pos <= end) {\n                let side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;\n                let result = start + diff + (side < 0 ? 0 : newSize);\n                if (simple)\n                    return result;\n                let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start);\n                let del = pos == start ? DEL_AFTER : pos == end ? DEL_BEFORE : DEL_ACROSS;\n                if (assoc < 0 ? pos != start : pos != end)\n                    del |= DEL_SIDE;\n                return new MapResult(result, del, recover);\n            }\n            diff += newSize - oldSize;\n        }\n        return simple ? pos + diff : new MapResult(pos + diff, 0, null);\n    }\n    /**\n    @internal\n    */\n    touches(pos, recover) {\n        let diff = 0, index = recoverIndex(recover);\n        let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i] - (this.inverted ? diff : 0);\n            if (start > pos)\n                break;\n            let oldSize = this.ranges[i + oldIndex], end = start + oldSize;\n            if (pos <= end && i == index * 3)\n                return true;\n            diff += this.ranges[i + newIndex] - oldSize;\n        }\n        return false;\n    }\n    /**\n    Calls the given function on each of the changed ranges included in\n    this map.\n    */\n    forEach(f) {\n        let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff);\n            let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex];\n            f(oldStart, oldStart + oldSize, newStart, newStart + newSize);\n            diff += newSize - oldSize;\n        }\n    }\n    /**\n    Create an inverted version of this map. The result can be used to\n    map positions in the post-step document to the pre-step document.\n    */\n    invert() {\n        return new StepMap(this.ranges, !this.inverted);\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return (this.inverted ? \"-\" : \"\") + JSON.stringify(this.ranges);\n    }\n    /**\n    Create a map that moves all positions by offset `n` (which may be\n    negative). This can be useful when applying steps meant for a\n    sub-document to a larger document, or vice-versa.\n    */\n    static offset(n) {\n        return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n]);\n    }\n}\n/**\nA StepMap that contains no changed ranges.\n*/\nStepMap.empty = new StepMap([]);\n/**\nA mapping represents a pipeline of zero or more [step\nmaps](https://prosemirror.net/docs/ref/#transform.StepMap). It has special provisions for losslessly\nhandling mapping positions through a series of steps in which some\nsteps are inverted versions of earlier steps. (This comes up when\n‘[rebasing](/docs/guide/#transform.rebasing)’ steps for\ncollaboration or history management.)\n*/\nclass Mapping {\n    /**\n    Create a new mapping with the given position maps.\n    */\n    constructor(\n    /**\n    The step maps in this mapping.\n    */\n    maps = [], \n    /**\n    @internal\n    */\n    mirror, \n    /**\n    The starting position in the `maps` array, used when `map` or\n    `mapResult` is called.\n    */\n    from = 0, \n    /**\n    The end position in the `maps` array.\n    */\n    to = maps.length) {\n        this.maps = maps;\n        this.mirror = mirror;\n        this.from = from;\n        this.to = to;\n    }\n    /**\n    Create a mapping that maps only through a part of this one.\n    */\n    slice(from = 0, to = this.maps.length) {\n        return new Mapping(this.maps, this.mirror, from, to);\n    }\n    /**\n    @internal\n    */\n    copy() {\n        return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to);\n    }\n    /**\n    Add a step map to the end of this mapping. If `mirrors` is\n    given, it should be the index of the step map that is the mirror\n    image of this one.\n    */\n    appendMap(map, mirrors) {\n        this.to = this.maps.push(map);\n        if (mirrors != null)\n            this.setMirror(this.maps.length - 1, mirrors);\n    }\n    /**\n    Add all the step maps in a given mapping to this one (preserving\n    mirroring information).\n    */\n    appendMapping(mapping) {\n        for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n            let mirr = mapping.getMirror(i);\n            this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);\n        }\n    }\n    /**\n    Finds the offset of the step map that mirrors the map at the\n    given offset, in this mapping (as per the second argument to\n    `appendMap`).\n    */\n    getMirror(n) {\n        if (this.mirror)\n            for (let i = 0; i < this.mirror.length; i++)\n                if (this.mirror[i] == n)\n                    return this.mirror[i + (i % 2 ? -1 : 1)];\n    }\n    /**\n    @internal\n    */\n    setMirror(n, m) {\n        if (!this.mirror)\n            this.mirror = [];\n        this.mirror.push(n, m);\n    }\n    /**\n    Append the inverse of the given mapping to this one.\n    */\n    appendMappingInverted(mapping) {\n        for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n            let mirr = mapping.getMirror(i);\n            this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);\n        }\n    }\n    /**\n    Create an inverted version of this mapping.\n    */\n    invert() {\n        let inverse = new Mapping;\n        inverse.appendMappingInverted(this);\n        return inverse;\n    }\n    /**\n    Map a position through this mapping.\n    */\n    map(pos, assoc = 1) {\n        if (this.mirror)\n            return this._map(pos, assoc, true);\n        for (let i = this.from; i < this.to; i++)\n            pos = this.maps[i].map(pos, assoc);\n        return pos;\n    }\n    /**\n    Map a position through this mapping, returning a mapping\n    result.\n    */\n    mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n    /**\n    @internal\n    */\n    _map(pos, assoc, simple) {\n        let delInfo = 0;\n        for (let i = this.from; i < this.to; i++) {\n            let map = this.maps[i], result = map.mapResult(pos, assoc);\n            if (result.recover != null) {\n                let corr = this.getMirror(i);\n                if (corr != null && corr > i && corr < this.to) {\n                    i = corr;\n                    pos = this.maps[corr].recover(result.recover);\n                    continue;\n                }\n            }\n            delInfo |= result.delInfo;\n            pos = result.pos;\n        }\n        return simple ? pos : new MapResult(pos, delInfo, null);\n    }\n}\n\nconst stepsByID = Object.create(null);\n/**\nA step object represents an atomic change. It generally applies\nonly to the document it was created for, since the positions\nstored in it will only make sense for that document.\n\nNew steps are defined by creating classes that extend `Step`,\noverriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`\nmethods, and registering your class with a unique\nJSON-serialization identifier using\n[`Step.jsonID`](https://prosemirror.net/docs/ref/#transform.Step^jsonID).\n*/\nclass Step {\n    /**\n    Get the step map that represents the changes made by this step,\n    and which can be used to transform between positions in the old\n    and the new document.\n    */\n    getMap() { return StepMap.empty; }\n    /**\n    Try to merge this step with another one, to be applied directly\n    after it. Returns the merged step when possible, null if the\n    steps can't be merged.\n    */\n    merge(other) { return null; }\n    /**\n    Deserialize a step from its JSON representation. Will call\n    through to the step class' own implementation of this method.\n    */\n    static fromJSON(schema, json) {\n        if (!json || !json.stepType)\n            throw new RangeError(\"Invalid input for Step.fromJSON\");\n        let type = stepsByID[json.stepType];\n        if (!type)\n            throw new RangeError(`No step type ${json.stepType} defined`);\n        return type.fromJSON(schema, json);\n    }\n    /**\n    To be able to serialize steps to JSON, each step needs a string\n    ID to attach to its JSON representation. Use this method to\n    register an ID for your step classes. Try to pick something\n    that's unlikely to clash with steps from other modules.\n    */\n    static jsonID(id, stepClass) {\n        if (id in stepsByID)\n            throw new RangeError(\"Duplicate use of step JSON ID \" + id);\n        stepsByID[id] = stepClass;\n        stepClass.prototype.jsonID = id;\n        return stepClass;\n    }\n}\n/**\nThe result of [applying](https://prosemirror.net/docs/ref/#transform.Step.apply) a step. Contains either a\nnew document or a failure value.\n*/\nclass StepResult {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The transformed document, if successful.\n    */\n    doc, \n    /**\n    The failure message, if unsuccessful.\n    */\n    failed) {\n        this.doc = doc;\n        this.failed = failed;\n    }\n    /**\n    Create a successful step result.\n    */\n    static ok(doc) { return new StepResult(doc, null); }\n    /**\n    Create a failed step result.\n    */\n    static fail(message) { return new StepResult(null, message); }\n    /**\n    Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given\n    arguments. Create a successful result if it succeeds, and a\n    failed one if it throws a `ReplaceError`.\n    */\n    static fromReplace(doc, from, to, slice) {\n        try {\n            return StepResult.ok(doc.replace(from, to, slice));\n        }\n        catch (e) {\n            if (e instanceof ReplaceError)\n                return StepResult.fail(e.message);\n            throw e;\n        }\n    }\n}\n\nfunction mapFragment(fragment, f, parent) {\n    let mapped = [];\n    for (let i = 0; i < fragment.childCount; i++) {\n        let child = fragment.child(i);\n        if (child.content.size)\n            child = child.copy(mapFragment(child.content, f, child));\n        if (child.isInline)\n            child = f(child, parent, i);\n        mapped.push(child);\n    }\n    return Fragment.fromArray(mapped);\n}\n/**\nAdd a mark to all inline content between two positions.\n*/\nclass AddMarkStep extends Step {\n    /**\n    Create a mark step.\n    */\n    constructor(\n    /**\n    The start of the marked range.\n    */\n    from, \n    /**\n    The end of the marked range.\n    */\n    to, \n    /**\n    The mark to add.\n    */\n    mark) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);\n        let parent = $from.node($from.sharedDepth(this.to));\n        let slice = new Slice(mapFragment(oldSlice.content, (node, parent) => {\n            if (!node.isAtom || !parent.type.allowsMarkType(this.mark.type))\n                return node;\n            return node.mark(this.mark.addToSet(node.marks));\n        }, parent), oldSlice.openStart, oldSlice.openEnd);\n        return StepResult.fromReplace(doc, this.from, this.to, slice);\n    }\n    invert() {\n        return new RemoveMarkStep(this.from, this.to, this.mark);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deleted && to.deleted || from.pos >= to.pos)\n            return null;\n        return new AddMarkStep(from.pos, to.pos, this.mark);\n    }\n    merge(other) {\n        if (other instanceof AddMarkStep &&\n            other.mark.eq(this.mark) &&\n            this.from <= other.to && this.to >= other.from)\n            return new AddMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n        return null;\n    }\n    toJSON() {\n        return { stepType: \"addMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for AddMarkStep.fromJSON\");\n        return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"addMark\", AddMarkStep);\n/**\nRemove a mark from all inline content between two positions.\n*/\nclass RemoveMarkStep extends Step {\n    /**\n    Create a mark-removing step.\n    */\n    constructor(\n    /**\n    The start of the unmarked range.\n    */\n    from, \n    /**\n    The end of the unmarked range.\n    */\n    to, \n    /**\n    The mark to remove.\n    */\n    mark) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let oldSlice = doc.slice(this.from, this.to);\n        let slice = new Slice(mapFragment(oldSlice.content, node => {\n            return node.mark(this.mark.removeFromSet(node.marks));\n        }, doc), oldSlice.openStart, oldSlice.openEnd);\n        return StepResult.fromReplace(doc, this.from, this.to, slice);\n    }\n    invert() {\n        return new AddMarkStep(this.from, this.to, this.mark);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deleted && to.deleted || from.pos >= to.pos)\n            return null;\n        return new RemoveMarkStep(from.pos, to.pos, this.mark);\n    }\n    merge(other) {\n        if (other instanceof RemoveMarkStep &&\n            other.mark.eq(this.mark) &&\n            this.from <= other.to && this.to >= other.from)\n            return new RemoveMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n        return null;\n    }\n    toJSON() {\n        return { stepType: \"removeMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for RemoveMarkStep.fromJSON\");\n        return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"removeMark\", RemoveMarkStep);\n/**\nAdd a mark to a specific node.\n*/\nclass AddNodeMarkStep extends Step {\n    /**\n    Create a node mark step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The mark to add.\n    */\n    mark) {\n        super();\n        this.pos = pos;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at mark step's position\");\n        let updated = node.type.create(node.attrs, null, this.mark.addToSet(node.marks));\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    invert(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (node) {\n            let newSet = this.mark.addToSet(node.marks);\n            if (newSet.length == node.marks.length) {\n                for (let i = 0; i < node.marks.length; i++)\n                    if (!node.marks[i].isInSet(newSet))\n                        return new AddNodeMarkStep(this.pos, node.marks[i]);\n                return new AddNodeMarkStep(this.pos, this.mark);\n            }\n        }\n        return new RemoveNodeMarkStep(this.pos, this.mark);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new AddNodeMarkStep(pos.pos, this.mark);\n    }\n    toJSON() {\n        return { stepType: \"addNodeMark\", pos: this.pos, mark: this.mark.toJSON() };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for AddNodeMarkStep.fromJSON\");\n        return new AddNodeMarkStep(json.pos, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"addNodeMark\", AddNodeMarkStep);\n/**\nRemove a mark from a specific node.\n*/\nclass RemoveNodeMarkStep extends Step {\n    /**\n    Create a mark-removing step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The mark to remove.\n    */\n    mark) {\n        super();\n        this.pos = pos;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at mark step's position\");\n        let updated = node.type.create(node.attrs, null, this.mark.removeFromSet(node.marks));\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    invert(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node || !this.mark.isInSet(node.marks))\n            return this;\n        return new AddNodeMarkStep(this.pos, this.mark);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new RemoveNodeMarkStep(pos.pos, this.mark);\n    }\n    toJSON() {\n        return { stepType: \"removeNodeMark\", pos: this.pos, mark: this.mark.toJSON() };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for RemoveNodeMarkStep.fromJSON\");\n        return new RemoveNodeMarkStep(json.pos, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"removeNodeMark\", RemoveNodeMarkStep);\n\n/**\nReplace a part of the document with a slice of new content.\n*/\nclass ReplaceStep extends Step {\n    /**\n    The given `slice` should fit the 'gap' between `from` and\n    `to`—the depths must line up, and the surrounding nodes must be\n    able to be joined with the open sides of the slice. When\n    `structure` is true, the step will fail if the content between\n    from and to is not just a sequence of closing and then opening\n    tokens (this is to guard against rebased replace steps\n    overwriting something they weren't supposed to).\n    */\n    constructor(\n    /**\n    The start position of the replaced range.\n    */\n    from, \n    /**\n    The end position of the replaced range.\n    */\n    to, \n    /**\n    The slice to insert.\n    */\n    slice, \n    /**\n    @internal\n    */\n    structure = false) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.slice = slice;\n        this.structure = structure;\n    }\n    apply(doc) {\n        if (this.structure && contentBetween(doc, this.from, this.to))\n            return StepResult.fail(\"Structure replace would overwrite content\");\n        return StepResult.fromReplace(doc, this.from, this.to, this.slice);\n    }\n    getMap() {\n        return new StepMap([this.from, this.to - this.from, this.slice.size]);\n    }\n    invert(doc) {\n        return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to));\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deletedAcross && to.deletedAcross)\n            return null;\n        return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice);\n    }\n    merge(other) {\n        if (!(other instanceof ReplaceStep) || other.structure || this.structure)\n            return null;\n        if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {\n            let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n                : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);\n            return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure);\n        }\n        else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {\n            let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n                : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);\n            return new ReplaceStep(other.from, this.to, slice, this.structure);\n        }\n        else {\n            return null;\n        }\n    }\n    toJSON() {\n        let json = { stepType: \"replace\", from: this.from, to: this.to };\n        if (this.slice.size)\n            json.slice = this.slice.toJSON();\n        if (this.structure)\n            json.structure = true;\n        return json;\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for ReplaceStep.fromJSON\");\n        return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure);\n    }\n}\nStep.jsonID(\"replace\", ReplaceStep);\n/**\nReplace a part of the document with a slice of content, but\npreserve a range of the replaced content by moving it into the\nslice.\n*/\nclass ReplaceAroundStep extends Step {\n    /**\n    Create a replace-around step with the given range and gap.\n    `insert` should be the point in the slice into which the content\n    of the gap should be moved. `structure` has the same meaning as\n    it has in the [`ReplaceStep`](https://prosemirror.net/docs/ref/#transform.ReplaceStep) class.\n    */\n    constructor(\n    /**\n    The start position of the replaced range.\n    */\n    from, \n    /**\n    The end position of the replaced range.\n    */\n    to, \n    /**\n    The start of preserved range.\n    */\n    gapFrom, \n    /**\n    The end of preserved range.\n    */\n    gapTo, \n    /**\n    The slice to insert.\n    */\n    slice, \n    /**\n    The position in the slice where the preserved range should be\n    inserted.\n    */\n    insert, \n    /**\n    @internal\n    */\n    structure = false) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.gapFrom = gapFrom;\n        this.gapTo = gapTo;\n        this.slice = slice;\n        this.insert = insert;\n        this.structure = structure;\n    }\n    apply(doc) {\n        if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||\n            contentBetween(doc, this.gapTo, this.to)))\n            return StepResult.fail(\"Structure gap-replace would overwrite content\");\n        let gap = doc.slice(this.gapFrom, this.gapTo);\n        if (gap.openStart || gap.openEnd)\n            return StepResult.fail(\"Gap is not a flat range\");\n        let inserted = this.slice.insertAt(this.insert, gap.content);\n        if (!inserted)\n            return StepResult.fail(\"Content does not fit in gap\");\n        return StepResult.fromReplace(doc, this.from, this.to, inserted);\n    }\n    getMap() {\n        return new StepMap([this.from, this.gapFrom - this.from, this.insert,\n            this.gapTo, this.to - this.gapTo, this.slice.size - this.insert]);\n    }\n    invert(doc) {\n        let gap = this.gapTo - this.gapFrom;\n        return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap, this.from + this.insert, this.from + this.insert + gap, doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        let gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);\n        if ((from.deletedAcross && to.deletedAcross) || gapFrom < from.pos || gapTo > to.pos)\n            return null;\n        return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure);\n    }\n    toJSON() {\n        let json = { stepType: \"replaceAround\", from: this.from, to: this.to,\n            gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert };\n        if (this.slice.size)\n            json.slice = this.slice.toJSON();\n        if (this.structure)\n            json.structure = true;\n        return json;\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\" ||\n            typeof json.gapFrom != \"number\" || typeof json.gapTo != \"number\" || typeof json.insert != \"number\")\n            throw new RangeError(\"Invalid input for ReplaceAroundStep.fromJSON\");\n        return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo, Slice.fromJSON(schema, json.slice), json.insert, !!json.structure);\n    }\n}\nStep.jsonID(\"replaceAround\", ReplaceAroundStep);\nfunction contentBetween(doc, from, to) {\n    let $from = doc.resolve(from), dist = to - from, depth = $from.depth;\n    while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {\n        depth--;\n        dist--;\n    }\n    if (dist > 0) {\n        let next = $from.node(depth).maybeChild($from.indexAfter(depth));\n        while (dist > 0) {\n            if (!next || next.isLeaf)\n                return true;\n            next = next.firstChild;\n            dist--;\n        }\n    }\n    return false;\n}\n\nfunction addMark(tr, from, to, mark) {\n    let removed = [], added = [];\n    let removing, adding;\n    tr.doc.nodesBetween(from, to, (node, pos, parent) => {\n        if (!node.isInline)\n            return;\n        let marks = node.marks;\n        if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n            let start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);\n            let newSet = mark.addToSet(marks);\n            for (let i = 0; i < marks.length; i++) {\n                if (!marks[i].isInSet(newSet)) {\n                    if (removing && removing.to == start && removing.mark.eq(marks[i]))\n                        removing.to = end;\n                    else\n                        removed.push(removing = new RemoveMarkStep(start, end, marks[i]));\n                }\n            }\n            if (adding && adding.to == start)\n                adding.to = end;\n            else\n                added.push(adding = new AddMarkStep(start, end, mark));\n        }\n    });\n    removed.forEach(s => tr.step(s));\n    added.forEach(s => tr.step(s));\n}\nfunction removeMark(tr, from, to, mark) {\n    let matched = [], step = 0;\n    tr.doc.nodesBetween(from, to, (node, pos) => {\n        if (!node.isInline)\n            return;\n        step++;\n        let toRemove = null;\n        if (mark instanceof MarkType) {\n            let set = node.marks, found;\n            while (found = mark.isInSet(set)) {\n                (toRemove || (toRemove = [])).push(found);\n                set = found.removeFromSet(set);\n            }\n        }\n        else if (mark) {\n            if (mark.isInSet(node.marks))\n                toRemove = [mark];\n        }\n        else {\n            toRemove = node.marks;\n        }\n        if (toRemove && toRemove.length) {\n            let end = Math.min(pos + node.nodeSize, to);\n            for (let i = 0; i < toRemove.length; i++) {\n                let style = toRemove[i], found;\n                for (let j = 0; j < matched.length; j++) {\n                    let m = matched[j];\n                    if (m.step == step - 1 && style.eq(matched[j].style))\n                        found = m;\n                }\n                if (found) {\n                    found.to = end;\n                    found.step = step;\n                }\n                else {\n                    matched.push({ style, from: Math.max(pos, from), to: end, step });\n                }\n            }\n        }\n    });\n    matched.forEach(m => tr.step(new RemoveMarkStep(m.from, m.to, m.style)));\n}\nfunction clearIncompatible(tr, pos, parentType, match = parentType.contentMatch) {\n    let node = tr.doc.nodeAt(pos);\n    let delSteps = [], cur = pos + 1;\n    for (let i = 0; i < node.childCount; i++) {\n        let child = node.child(i), end = cur + child.nodeSize;\n        let allowed = match.matchType(child.type);\n        if (!allowed) {\n            delSteps.push(new ReplaceStep(cur, end, Slice.empty));\n        }\n        else {\n            match = allowed;\n            for (let j = 0; j < child.marks.length; j++)\n                if (!parentType.allowsMarkType(child.marks[j].type))\n                    tr.step(new RemoveMarkStep(cur, end, child.marks[j]));\n        }\n        cur = end;\n    }\n    if (!match.validEnd) {\n        let fill = match.fillBefore(Fragment.empty, true);\n        tr.replace(cur, cur, new Slice(fill, 0, 0));\n    }\n    for (let i = delSteps.length - 1; i >= 0; i--)\n        tr.step(delSteps[i]);\n}\n\nfunction canCut(node, start, end) {\n    return (start == 0 || node.canReplace(start, node.childCount)) &&\n        (end == node.childCount || node.canReplace(0, end));\n}\n/**\nTry to find a target depth to which the content in the given range\ncan be lifted. Will not go across\n[isolating](https://prosemirror.net/docs/ref/#model.NodeSpec.isolating) parent nodes.\n*/\nfunction liftTarget(range) {\n    let parent = range.parent;\n    let content = parent.content.cutByIndex(range.startIndex, range.endIndex);\n    for (let depth = range.depth;; --depth) {\n        let node = range.$from.node(depth);\n        let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);\n        if (depth < range.depth && node.canReplace(index, endIndex, content))\n            return depth;\n        if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex))\n            break;\n    }\n    return null;\n}\nfunction lift(tr, range, target) {\n    let { $from, $to, depth } = range;\n    let gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);\n    let start = gapStart, end = gapEnd;\n    let before = Fragment.empty, openStart = 0;\n    for (let d = depth, splitting = false; d > target; d--)\n        if (splitting || $from.index(d) > 0) {\n            splitting = true;\n            before = Fragment.from($from.node(d).copy(before));\n            openStart++;\n        }\n        else {\n            start--;\n        }\n    let after = Fragment.empty, openEnd = 0;\n    for (let d = depth, splitting = false; d > target; d--)\n        if (splitting || $to.after(d + 1) < $to.end(d)) {\n            splitting = true;\n            after = Fragment.from($to.node(d).copy(after));\n            openEnd++;\n        }\n        else {\n            end++;\n        }\n    tr.step(new ReplaceAroundStep(start, end, gapStart, gapEnd, new Slice(before.append(after), openStart, openEnd), before.size - openStart, true));\n}\n/**\nTry to find a valid way to wrap the content in the given range in a\nnode of the given type. May introduce extra nodes around and inside\nthe wrapper node, if necessary. Returns null if no valid wrapping\ncould be found. When `innerRange` is given, that range's content is\nused as the content to fit into the wrapping, instead of the\ncontent of `range`.\n*/\nfunction findWrapping(range, nodeType, attrs = null, innerRange = range) {\n    let around = findWrappingOutside(range, nodeType);\n    let inner = around && findWrappingInside(innerRange, nodeType);\n    if (!inner)\n        return null;\n    return around.map(withAttrs)\n        .concat({ type: nodeType, attrs }).concat(inner.map(withAttrs));\n}\nfunction withAttrs(type) { return { type, attrs: null }; }\nfunction findWrappingOutside(range, type) {\n    let { parent, startIndex, endIndex } = range;\n    let around = parent.contentMatchAt(startIndex).findWrapping(type);\n    if (!around)\n        return null;\n    let outer = around.length ? around[0] : type;\n    return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null;\n}\nfunction findWrappingInside(range, type) {\n    let { parent, startIndex, endIndex } = range;\n    let inner = parent.child(startIndex);\n    let inside = type.contentMatch.findWrapping(inner.type);\n    if (!inside)\n        return null;\n    let lastType = inside.length ? inside[inside.length - 1] : type;\n    let innerMatch = lastType.contentMatch;\n    for (let i = startIndex; innerMatch && i < endIndex; i++)\n        innerMatch = innerMatch.matchType(parent.child(i).type);\n    if (!innerMatch || !innerMatch.validEnd)\n        return null;\n    return inside;\n}\nfunction wrap(tr, range, wrappers) {\n    let content = Fragment.empty;\n    for (let i = wrappers.length - 1; i >= 0; i--) {\n        if (content.size) {\n            let match = wrappers[i].type.contentMatch.matchFragment(content);\n            if (!match || !match.validEnd)\n                throw new RangeError(\"Wrapper type given to Transform.wrap does not form valid content of its parent wrapper\");\n        }\n        content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n    }\n    let start = range.start, end = range.end;\n    tr.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true));\n}\nfunction setBlockType(tr, from, to, type, attrs) {\n    if (!type.isTextblock)\n        throw new RangeError(\"Type given to setBlockType should be a textblock\");\n    let mapFrom = tr.steps.length;\n    tr.doc.nodesBetween(from, to, (node, pos) => {\n        if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(tr.doc, tr.mapping.slice(mapFrom).map(pos), type)) {\n            // Ensure all markup that isn't allowed in the new node type is cleared\n            tr.clearIncompatible(tr.mapping.slice(mapFrom).map(pos, 1), type);\n            let mapping = tr.mapping.slice(mapFrom);\n            let startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);\n            tr.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1, new Slice(Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));\n            return false;\n        }\n    });\n}\nfunction canChangeType(doc, pos, type) {\n    let $pos = doc.resolve(pos), index = $pos.index();\n    return $pos.parent.canReplaceWith(index, index + 1, type);\n}\n/**\nChange the type, attributes, and/or marks of the node at `pos`.\nWhen `type` isn't given, the existing node type is preserved,\n*/\nfunction setNodeMarkup(tr, pos, type, attrs, marks) {\n    let node = tr.doc.nodeAt(pos);\n    if (!node)\n        throw new RangeError(\"No node at given position\");\n    if (!type)\n        type = node.type;\n    let newNode = type.create(attrs, null, marks || node.marks);\n    if (node.isLeaf)\n        return tr.replaceWith(pos, pos + node.nodeSize, newNode);\n    if (!type.validContent(node.content))\n        throw new RangeError(\"Invalid content for node type \" + type.name);\n    tr.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1, new Slice(Fragment.from(newNode), 0, 0), 1, true));\n}\n/**\nCheck whether splitting at the given position is allowed.\n*/\nfunction canSplit(doc, pos, depth = 1, typesAfter) {\n    let $pos = doc.resolve(pos), base = $pos.depth - depth;\n    let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;\n    if (base < 0 || $pos.parent.type.spec.isolating ||\n        !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||\n        !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))\n        return false;\n    for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n        let node = $pos.node(d), index = $pos.index(d);\n        if (node.type.spec.isolating)\n            return false;\n        let rest = node.content.cutByIndex(index, node.childCount);\n        let after = (typesAfter && typesAfter[i]) || node;\n        if (after != node)\n            rest = rest.replaceChild(0, after.type.create(after.attrs));\n        if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n            return false;\n    }\n    let index = $pos.indexAfter(base);\n    let baseType = typesAfter && typesAfter[0];\n    return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);\n}\nfunction split(tr, pos, depth = 1, typesAfter) {\n    let $pos = tr.doc.resolve(pos), before = Fragment.empty, after = Fragment.empty;\n    for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n        before = Fragment.from($pos.node(d).copy(before));\n        let typeAfter = typesAfter && typesAfter[i];\n        after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));\n    }\n    tr.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true));\n}\n/**\nTest whether the blocks before and after a given position can be\njoined.\n*/\nfunction canJoin(doc, pos) {\n    let $pos = doc.resolve(pos), index = $pos.index();\n    return joinable($pos.nodeBefore, $pos.nodeAfter) &&\n        $pos.parent.canReplace(index, index + 1);\n}\nfunction joinable(a, b) {\n    return !!(a && b && !a.isLeaf && a.canAppend(b));\n}\n/**\nFind an ancestor of the given position that can be joined to the\nblock before (or after if `dir` is positive). Returns the joinable\npoint, if any.\n*/\nfunction joinPoint(doc, pos, dir = -1) {\n    let $pos = doc.resolve(pos);\n    for (let d = $pos.depth;; d--) {\n        let before, after, index = $pos.index(d);\n        if (d == $pos.depth) {\n            before = $pos.nodeBefore;\n            after = $pos.nodeAfter;\n        }\n        else if (dir > 0) {\n            before = $pos.node(d + 1);\n            index++;\n            after = $pos.node(d).maybeChild(index);\n        }\n        else {\n            before = $pos.node(d).maybeChild(index - 1);\n            after = $pos.node(d + 1);\n        }\n        if (before && !before.isTextblock && joinable(before, after) &&\n            $pos.node(d).canReplace(index, index + 1))\n            return pos;\n        if (d == 0)\n            break;\n        pos = dir < 0 ? $pos.before(d) : $pos.after(d);\n    }\n}\nfunction join(tr, pos, depth) {\n    let step = new ReplaceStep(pos - depth, pos + depth, Slice.empty, true);\n    tr.step(step);\n}\n/**\nTry to find a point where a node of the given type can be inserted\nnear `pos`, by searching up the node hierarchy when `pos` itself\nisn't a valid place but is at the start or end of a node. Return\nnull if no position was found.\n*/\nfunction insertPoint(doc, pos, nodeType) {\n    let $pos = doc.resolve(pos);\n    if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType))\n        return pos;\n    if ($pos.parentOffset == 0)\n        for (let d = $pos.depth - 1; d >= 0; d--) {\n            let index = $pos.index(d);\n            if ($pos.node(d).canReplaceWith(index, index, nodeType))\n                return $pos.before(d + 1);\n            if (index > 0)\n                return null;\n        }\n    if ($pos.parentOffset == $pos.parent.content.size)\n        for (let d = $pos.depth - 1; d >= 0; d--) {\n            let index = $pos.indexAfter(d);\n            if ($pos.node(d).canReplaceWith(index, index, nodeType))\n                return $pos.after(d + 1);\n            if (index < $pos.node(d).childCount)\n                return null;\n        }\n    return null;\n}\n/**\nFinds a position at or around the given position where the given\nslice can be inserted. Will look at parent nodes' nearest boundary\nand try there, even if the original position wasn't directly at the\nstart or end of that node. Returns null when no position was found.\n*/\nfunction dropPoint(doc, pos, slice) {\n    let $pos = doc.resolve(pos);\n    if (!slice.content.size)\n        return pos;\n    let content = slice.content;\n    for (let i = 0; i < slice.openStart; i++)\n        content = content.firstChild.content;\n    for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n        for (let d = $pos.depth; d >= 0; d--) {\n            let bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;\n            let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);\n            let parent = $pos.node(d), fits = false;\n            if (pass == 1) {\n                fits = parent.canReplace(insertPos, insertPos, content);\n            }\n            else {\n                let wrapping = parent.contentMatchAt(insertPos).findWrapping(content.firstChild.type);\n                fits = wrapping && parent.canReplaceWith(insertPos, insertPos, wrapping[0]);\n            }\n            if (fits)\n                return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1);\n        }\n    }\n    return null;\n}\n\n/**\n‘Fit’ a slice into a given position in the document, producing a\n[step](https://prosemirror.net/docs/ref/#transform.Step) that inserts it. Will return null if\nthere's no meaningful way to insert the slice here, or inserting it\nwould be a no-op (an empty slice over an empty range).\n*/\nfunction replaceStep(doc, from, to = from, slice = Slice.empty) {\n    if (from == to && !slice.size)\n        return null;\n    let $from = doc.resolve(from), $to = doc.resolve(to);\n    // Optimization -- avoid work if it's obvious that it's not needed.\n    if (fitsTrivially($from, $to, slice))\n        return new ReplaceStep(from, to, slice);\n    return new Fitter($from, $to, slice).fit();\n}\nfunction fitsTrivially($from, $to, slice) {\n    return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&\n        $from.parent.canReplace($from.index(), $to.index(), slice.content);\n}\n// Algorithm for 'placing' the elements of a slice into a gap:\n//\n// We consider the content of each node that is open to the left to be\n// independently placeable. I.e. in <p(\"foo\"), p(\"bar\")>, when the\n// paragraph on the left is open, \"foo\" can be placed (somewhere on\n// the left side of the replacement gap) independently from p(\"bar\").\n//\n// This class tracks the state of the placement progress in the\n// following properties:\n//\n//  - `frontier` holds a stack of `{type, match}` objects that\n//    represent the open side of the replacement. It starts at\n//    `$from`, then moves forward as content is placed, and is finally\n//    reconciled with `$to`.\n//\n//  - `unplaced` is a slice that represents the content that hasn't\n//    been placed yet.\n//\n//  - `placed` is a fragment of placed content. Its open-start value\n//    is implicit in `$from`, and its open-end value in `frontier`.\nclass Fitter {\n    constructor($from, $to, unplaced) {\n        this.$from = $from;\n        this.$to = $to;\n        this.unplaced = unplaced;\n        this.frontier = [];\n        this.placed = Fragment.empty;\n        for (let i = 0; i <= $from.depth; i++) {\n            let node = $from.node(i);\n            this.frontier.push({\n                type: node.type,\n                match: node.contentMatchAt($from.indexAfter(i))\n            });\n        }\n        for (let i = $from.depth; i > 0; i--)\n            this.placed = Fragment.from($from.node(i).copy(this.placed));\n    }\n    get depth() { return this.frontier.length - 1; }\n    fit() {\n        // As long as there's unplaced content, try to place some of it.\n        // If that fails, either increase the open score of the unplaced\n        // slice, or drop nodes from it, and then try again.\n        while (this.unplaced.size) {\n            let fit = this.findFittable();\n            if (fit)\n                this.placeNodes(fit);\n            else\n                this.openMore() || this.dropNode();\n        }\n        // When there's inline content directly after the frontier _and_\n        // directly after `this.$to`, we must generate a `ReplaceAround`\n        // step that pulls that content into the node after the frontier.\n        // That means the fitting must be done to the end of the textblock\n        // node after `this.$to`, not `this.$to` itself.\n        let moveInline = this.mustMoveInline(), placedSize = this.placed.size - this.depth - this.$from.depth;\n        let $from = this.$from, $to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline));\n        if (!$to)\n            return null;\n        // If closing to `$to` succeeded, create a step\n        let content = this.placed, openStart = $from.depth, openEnd = $to.depth;\n        while (openStart && openEnd && content.childCount == 1) { // Normalize by dropping open parent nodes\n            content = content.firstChild.content;\n            openStart--;\n            openEnd--;\n        }\n        let slice = new Slice(content, openStart, openEnd);\n        if (moveInline > -1)\n            return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize);\n        if (slice.size || $from.pos != this.$to.pos) // Don't generate no-op steps\n            return new ReplaceStep($from.pos, $to.pos, slice);\n        return null;\n    }\n    // Find a position on the start spine of `this.unplaced` that has\n    // content that can be moved somewhere on the frontier. Returns two\n    // depths, one for the slice and one for the frontier.\n    findFittable() {\n        let startDepth = this.unplaced.openStart;\n        for (let cur = this.unplaced.content, d = 0, openEnd = this.unplaced.openEnd; d < startDepth; d++) {\n            let node = cur.firstChild;\n            if (cur.childCount > 1)\n                openEnd = 0;\n            if (node.type.spec.isolating && openEnd <= d) {\n                startDepth = d;\n                break;\n            }\n            cur = node.content;\n        }\n        // Only try wrapping nodes (pass 2) after finding a place without\n        // wrapping failed.\n        for (let pass = 1; pass <= 2; pass++) {\n            for (let sliceDepth = pass == 1 ? startDepth : this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {\n                let fragment, parent = null;\n                if (sliceDepth) {\n                    parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild;\n                    fragment = parent.content;\n                }\n                else {\n                    fragment = this.unplaced.content;\n                }\n                let first = fragment.firstChild;\n                for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {\n                    let { type, match } = this.frontier[frontierDepth], wrap, inject = null;\n                    // In pass 1, if the next node matches, or there is no next\n                    // node but the parents look compatible, we've found a\n                    // place.\n                    if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false))\n                        : parent && type.compatibleContent(parent.type)))\n                        return { sliceDepth, frontierDepth, parent, inject };\n                    // In pass 2, look for a set of wrapping nodes that make\n                    // `first` fit here.\n                    else if (pass == 2 && first && (wrap = match.findWrapping(first.type)))\n                        return { sliceDepth, frontierDepth, parent, wrap };\n                    // Don't continue looking further up if the parent node\n                    // would fit here.\n                    if (parent && match.matchType(parent.type))\n                        break;\n                }\n            }\n        }\n    }\n    openMore() {\n        let { content, openStart, openEnd } = this.unplaced;\n        let inner = contentAt(content, openStart);\n        if (!inner.childCount || inner.firstChild.isLeaf)\n            return false;\n        this.unplaced = new Slice(content, openStart + 1, Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0));\n        return true;\n    }\n    dropNode() {\n        let { content, openStart, openEnd } = this.unplaced;\n        let inner = contentAt(content, openStart);\n        if (inner.childCount <= 1 && openStart > 0) {\n            let openAtEnd = content.size - openStart <= openStart + inner.size;\n            this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1, openAtEnd ? openStart - 1 : openEnd);\n        }\n        else {\n            this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd);\n        }\n    }\n    // Move content from the unplaced slice at `sliceDepth` to the\n    // frontier node at `frontierDepth`. Close that frontier node when\n    // applicable.\n    placeNodes({ sliceDepth, frontierDepth, parent, inject, wrap }) {\n        while (this.depth > frontierDepth)\n            this.closeFrontierNode();\n        if (wrap)\n            for (let i = 0; i < wrap.length; i++)\n                this.openFrontierNode(wrap[i]);\n        let slice = this.unplaced, fragment = parent ? parent.content : slice.content;\n        let openStart = slice.openStart - sliceDepth;\n        let taken = 0, add = [];\n        let { match, type } = this.frontier[frontierDepth];\n        if (inject) {\n            for (let i = 0; i < inject.childCount; i++)\n                add.push(inject.child(i));\n            match = match.matchFragment(inject);\n        }\n        // Computes the amount of (end) open nodes at the end of the\n        // fragment. When 0, the parent is open, but no more. When\n        // negative, nothing is open.\n        let openEndCount = (fragment.size + sliceDepth) - (slice.content.size - slice.openEnd);\n        // Scan over the fragment, fitting as many child nodes as\n        // possible.\n        while (taken < fragment.childCount) {\n            let next = fragment.child(taken), matches = match.matchType(next.type);\n            if (!matches)\n                break;\n            taken++;\n            if (taken > 1 || openStart == 0 || next.content.size) { // Drop empty open nodes\n                match = matches;\n                add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0, taken == fragment.childCount ? openEndCount : -1));\n            }\n        }\n        let toEnd = taken == fragment.childCount;\n        if (!toEnd)\n            openEndCount = -1;\n        this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add));\n        this.frontier[frontierDepth].match = match;\n        // If the parent types match, and the entire node was moved, and\n        // it's not open, close this frontier node right away.\n        if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1)\n            this.closeFrontierNode();\n        // Add new frontier nodes for any open nodes at the end.\n        for (let i = 0, cur = fragment; i < openEndCount; i++) {\n            let node = cur.lastChild;\n            this.frontier.push({ type: node.type, match: node.contentMatchAt(node.childCount) });\n            cur = node.content;\n        }\n        // Update `this.unplaced`. Drop the entire node from which we\n        // placed it we got to its end, otherwise just drop the placed\n        // nodes.\n        this.unplaced = !toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)\n            : sliceDepth == 0 ? Slice.empty\n                : new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1), sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1);\n    }\n    mustMoveInline() {\n        if (!this.$to.parent.isTextblock)\n            return -1;\n        let top = this.frontier[this.depth], level;\n        if (!top.type.isTextblock || !contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||\n            (this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth))\n            return -1;\n        let { depth } = this.$to, after = this.$to.after(depth);\n        while (depth > 1 && after == this.$to.end(--depth))\n            ++after;\n        return after;\n    }\n    findCloseLevel($to) {\n        scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {\n            let { match, type } = this.frontier[i];\n            let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1));\n            let fit = contentAfterFits($to, i, type, match, dropInner);\n            if (!fit)\n                continue;\n            for (let d = i - 1; d >= 0; d--) {\n                let { match, type } = this.frontier[d];\n                let matches = contentAfterFits($to, d, type, match, true);\n                if (!matches || matches.childCount)\n                    continue scan;\n            }\n            return { depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to };\n        }\n    }\n    close($to) {\n        let close = this.findCloseLevel($to);\n        if (!close)\n            return null;\n        while (this.depth > close.depth)\n            this.closeFrontierNode();\n        if (close.fit.childCount)\n            this.placed = addToFragment(this.placed, close.depth, close.fit);\n        $to = close.move;\n        for (let d = close.depth + 1; d <= $to.depth; d++) {\n            let node = $to.node(d), add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d));\n            this.openFrontierNode(node.type, node.attrs, add);\n        }\n        return $to;\n    }\n    openFrontierNode(type, attrs = null, content) {\n        let top = this.frontier[this.depth];\n        top.match = top.match.matchType(type);\n        this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)));\n        this.frontier.push({ type, match: type.contentMatch });\n    }\n    closeFrontierNode() {\n        let open = this.frontier.pop();\n        let add = open.match.fillBefore(Fragment.empty, true);\n        if (add.childCount)\n            this.placed = addToFragment(this.placed, this.frontier.length, add);\n    }\n}\nfunction dropFromFragment(fragment, depth, count) {\n    if (depth == 0)\n        return fragment.cutByIndex(count, fragment.childCount);\n    return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)));\n}\nfunction addToFragment(fragment, depth, content) {\n    if (depth == 0)\n        return fragment.append(content);\n    return fragment.replaceChild(fragment.childCount - 1, fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)));\n}\nfunction contentAt(fragment, depth) {\n    for (let i = 0; i < depth; i++)\n        fragment = fragment.firstChild.content;\n    return fragment;\n}\nfunction closeNodeStart(node, openStart, openEnd) {\n    if (openStart <= 0)\n        return node;\n    let frag = node.content;\n    if (openStart > 1)\n        frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0));\n    if (openStart > 0) {\n        frag = node.type.contentMatch.fillBefore(frag).append(frag);\n        if (openEnd <= 0)\n            frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true));\n    }\n    return node.copy(frag);\n}\nfunction contentAfterFits($to, depth, type, match, open) {\n    let node = $to.node(depth), index = open ? $to.indexAfter(depth) : $to.index(depth);\n    if (index == node.childCount && !type.compatibleContent(node.type))\n        return null;\n    let fit = match.fillBefore(node.content, true, index);\n    return fit && !invalidMarks(type, node.content, index) ? fit : null;\n}\nfunction invalidMarks(type, fragment, start) {\n    for (let i = start; i < fragment.childCount; i++)\n        if (!type.allowsMarks(fragment.child(i).marks))\n            return true;\n    return false;\n}\nfunction definesContent(type) {\n    return type.spec.defining || type.spec.definingForContent;\n}\nfunction replaceRange(tr, from, to, slice) {\n    if (!slice.size)\n        return tr.deleteRange(from, to);\n    let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n    if (fitsTrivially($from, $to, slice))\n        return tr.step(new ReplaceStep(from, to, slice));\n    let targetDepths = coveredDepths($from, tr.doc.resolve(to));\n    // Can't replace the whole document, so remove 0 if it's present\n    if (targetDepths[targetDepths.length - 1] == 0)\n        targetDepths.pop();\n    // Negative numbers represent not expansion over the whole node at\n    // that depth, but replacing from $from.before(-D) to $to.pos.\n    let preferredTarget = -($from.depth + 1);\n    targetDepths.unshift(preferredTarget);\n    // This loop picks a preferred target depth, if one of the covering\n    // depths is not outside of a defining node, and adds negative\n    // depths for any depth that has $from at its start and does not\n    // cross a defining node.\n    for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n        let spec = $from.node(d).type.spec;\n        if (spec.defining || spec.definingAsContext || spec.isolating)\n            break;\n        if (targetDepths.indexOf(d) > -1)\n            preferredTarget = d;\n        else if ($from.before(d) == pos)\n            targetDepths.splice(1, 0, -d);\n    }\n    // Try to fit each possible depth of the slice into each possible\n    // target depth, starting with the preferred depths.\n    let preferredTargetIndex = targetDepths.indexOf(preferredTarget);\n    let leftNodes = [], preferredDepth = slice.openStart;\n    for (let content = slice.content, i = 0;; i++) {\n        let node = content.firstChild;\n        leftNodes.push(node);\n        if (i == slice.openStart)\n            break;\n        content = node.content;\n    }\n    // Back up preferredDepth to cover defining textblocks directly\n    // above it, possibly skipping a non-defining textblock.\n    for (let d = preferredDepth - 1; d >= 0; d--) {\n        let type = leftNodes[d].type, def = definesContent(type);\n        if (def && $from.node(preferredTargetIndex).type != type)\n            preferredDepth = d;\n        else if (def || !type.isTextblock)\n            break;\n    }\n    for (let j = slice.openStart; j >= 0; j--) {\n        let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);\n        let insert = leftNodes[openDepth];\n        if (!insert)\n            continue;\n        for (let i = 0; i < targetDepths.length; i++) {\n            // Loop over possible expansion levels, starting with the\n            // preferred one\n            let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length], expand = true;\n            if (targetDepth < 0) {\n                expand = false;\n                targetDepth = -targetDepth;\n            }\n            let parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);\n            if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n                return tr.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to, new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth), openDepth, slice.openEnd));\n        }\n    }\n    let startSteps = tr.steps.length;\n    for (let i = targetDepths.length - 1; i >= 0; i--) {\n        tr.replace(from, to, slice);\n        if (tr.steps.length > startSteps)\n            break;\n        let depth = targetDepths[i];\n        if (depth < 0)\n            continue;\n        from = $from.before(depth);\n        to = $to.after(depth);\n    }\n}\nfunction closeFragment(fragment, depth, oldOpen, newOpen, parent) {\n    if (depth < oldOpen) {\n        let first = fragment.firstChild;\n        fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));\n    }\n    if (depth > newOpen) {\n        let match = parent.contentMatchAt(0);\n        let start = match.fillBefore(fragment).append(fragment);\n        fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true));\n    }\n    return fragment;\n}\nfunction replaceRangeWith(tr, from, to, node) {\n    if (!node.isInline && from == to && tr.doc.resolve(from).parent.content.size) {\n        let point = insertPoint(tr.doc, from, node.type);\n        if (point != null)\n            from = to = point;\n    }\n    tr.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0));\n}\nfunction deleteRange(tr, from, to) {\n    let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n    let covered = coveredDepths($from, $to);\n    for (let i = 0; i < covered.length; i++) {\n        let depth = covered[i], last = i == covered.length - 1;\n        if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n            return tr.delete($from.start(depth), $to.end(depth));\n        if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))\n            return tr.delete($from.before(depth), $to.after(depth));\n    }\n    for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {\n        if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)\n            return tr.delete($from.before(d), to);\n    }\n    tr.delete(from, to);\n}\n// Returns an array of all depths for which $from - $to spans the\n// whole content of the nodes at that depth.\nfunction coveredDepths($from, $to) {\n    let result = [], minDepth = Math.min($from.depth, $to.depth);\n    for (let d = minDepth; d >= 0; d--) {\n        let start = $from.start(d);\n        if (start < $from.pos - ($from.depth - d) ||\n            $to.end(d) > $to.pos + ($to.depth - d) ||\n            $from.node(d).type.spec.isolating ||\n            $to.node(d).type.spec.isolating)\n            break;\n        if (start == $to.start(d) ||\n            (d == $from.depth && d == $to.depth && $from.parent.inlineContent && $to.parent.inlineContent &&\n                d && $to.start(d - 1) == start - 1))\n            result.push(d);\n    }\n    return result;\n}\n\n/**\nUpdate an attribute in a specific node.\n*/\nclass AttrStep extends Step {\n    /**\n    Construct an attribute step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The attribute to set.\n    */\n    attr, \n    // The attribute's new value.\n    value) {\n        super();\n        this.pos = pos;\n        this.attr = attr;\n        this.value = value;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at attribute step's position\");\n        let attrs = Object.create(null);\n        for (let name in node.attrs)\n            attrs[name] = node.attrs[name];\n        attrs[this.attr] = this.value;\n        let updated = node.type.create(attrs, null, node.marks);\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    getMap() {\n        return StepMap.empty;\n    }\n    invert(doc) {\n        return new AttrStep(this.pos, this.attr, doc.nodeAt(this.pos).attrs[this.attr]);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new AttrStep(pos.pos, this.attr, this.value);\n    }\n    toJSON() {\n        return { stepType: \"attr\", pos: this.pos, attr: this.attr, value: this.value };\n    }\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\" || typeof json.attr != \"string\")\n            throw new RangeError(\"Invalid input for AttrStep.fromJSON\");\n        return new AttrStep(json.pos, json.attr, json.value);\n    }\n}\nStep.jsonID(\"attr\", AttrStep);\n\n/**\n@internal\n*/\nlet TransformError = class extends Error {\n};\nTransformError = function TransformError(message) {\n    let err = Error.call(this, message);\n    err.__proto__ = TransformError.prototype;\n    return err;\n};\nTransformError.prototype = Object.create(Error.prototype);\nTransformError.prototype.constructor = TransformError;\nTransformError.prototype.name = \"TransformError\";\n/**\nAbstraction to build up and track an array of\n[steps](https://prosemirror.net/docs/ref/#transform.Step) representing a document transformation.\n\nMost transforming methods return the `Transform` object itself, so\nthat they can be chained.\n*/\nclass Transform {\n    /**\n    Create a transform that starts with the given document.\n    */\n    constructor(\n    /**\n    The current document (the result of applying the steps in the\n    transform).\n    */\n    doc) {\n        this.doc = doc;\n        /**\n        The steps in this transform.\n        */\n        this.steps = [];\n        /**\n        The documents before each of the steps.\n        */\n        this.docs = [];\n        /**\n        A mapping with the maps for each of the steps in this transform.\n        */\n        this.mapping = new Mapping;\n    }\n    /**\n    The starting document.\n    */\n    get before() { return this.docs.length ? this.docs[0] : this.doc; }\n    /**\n    Apply a new step in this transform, saving the result. Throws an\n    error when the step fails.\n    */\n    step(step) {\n        let result = this.maybeStep(step);\n        if (result.failed)\n            throw new TransformError(result.failed);\n        return this;\n    }\n    /**\n    Try to apply a step in this transformation, ignoring it if it\n    fails. Returns the step result.\n    */\n    maybeStep(step) {\n        let result = step.apply(this.doc);\n        if (!result.failed)\n            this.addStep(step, result.doc);\n        return result;\n    }\n    /**\n    True when the document has been changed (when there are any\n    steps).\n    */\n    get docChanged() {\n        return this.steps.length > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        this.docs.push(this.doc);\n        this.steps.push(step);\n        this.mapping.appendMap(step.getMap());\n        this.doc = doc;\n    }\n    /**\n    Replace the part of the document between `from` and `to` with the\n    given `slice`.\n    */\n    replace(from, to = from, slice = Slice.empty) {\n        let step = replaceStep(this.doc, from, to, slice);\n        if (step)\n            this.step(step);\n        return this;\n    }\n    /**\n    Replace the given range with the given content, which may be a\n    fragment, node, or array of nodes.\n    */\n    replaceWith(from, to, content) {\n        return this.replace(from, to, new Slice(Fragment.from(content), 0, 0));\n    }\n    /**\n    Delete the content between the given positions.\n    */\n    delete(from, to) {\n        return this.replace(from, to, Slice.empty);\n    }\n    /**\n    Insert the given content at the given position.\n    */\n    insert(pos, content) {\n        return this.replaceWith(pos, pos, content);\n    }\n    /**\n    Replace a range of the document with a given slice, using\n    `from`, `to`, and the slice's\n    [`openStart`](https://prosemirror.net/docs/ref/#model.Slice.openStart) property as hints, rather\n    than fixed start and end points. This method may grow the\n    replaced area or close open nodes in the slice in order to get a\n    fit that is more in line with WYSIWYG expectations, by dropping\n    fully covered parent nodes of the replaced region when they are\n    marked [non-defining as\n    context](https://prosemirror.net/docs/ref/#model.NodeSpec.definingAsContext), or including an\n    open parent node from the slice that _is_ marked as [defining\n    its content](https://prosemirror.net/docs/ref/#model.NodeSpec.definingForContent).\n    \n    This is the method, for example, to handle paste. The similar\n    [`replace`](https://prosemirror.net/docs/ref/#transform.Transform.replace) method is a more\n    primitive tool which will _not_ move the start and end of its given\n    range, and is useful in situations where you need more precise\n    control over what happens.\n    */\n    replaceRange(from, to, slice) {\n        replaceRange(this, from, to, slice);\n        return this;\n    }\n    /**\n    Replace the given range with a node, but use `from` and `to` as\n    hints, rather than precise positions. When from and to are the same\n    and are at the start or end of a parent node in which the given\n    node doesn't fit, this method may _move_ them out towards a parent\n    that does allow the given node to be placed. When the given range\n    completely covers a parent node, this method may completely replace\n    that parent node.\n    */\n    replaceRangeWith(from, to, node) {\n        replaceRangeWith(this, from, to, node);\n        return this;\n    }\n    /**\n    Delete the given range, expanding it to cover fully covered\n    parent nodes until a valid replace is found.\n    */\n    deleteRange(from, to) {\n        deleteRange(this, from, to);\n        return this;\n    }\n    /**\n    Split the content in the given range off from its parent, if there\n    is sibling content before or after it, and move it up the tree to\n    the depth specified by `target`. You'll probably want to use\n    [`liftTarget`](https://prosemirror.net/docs/ref/#transform.liftTarget) to compute `target`, to make\n    sure the lift is valid.\n    */\n    lift(range, target) {\n        lift(this, range, target);\n        return this;\n    }\n    /**\n    Join the blocks around the given position. If depth is 2, their\n    last and first siblings are also joined, and so on.\n    */\n    join(pos, depth = 1) {\n        join(this, pos, depth);\n        return this;\n    }\n    /**\n    Wrap the given [range](https://prosemirror.net/docs/ref/#model.NodeRange) in the given set of wrappers.\n    The wrappers are assumed to be valid in this position, and should\n    probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).\n    */\n    wrap(range, wrappers) {\n        wrap(this, range, wrappers);\n        return this;\n    }\n    /**\n    Set the type of all textblocks (partly) between `from` and `to` to\n    the given node type with the given attributes.\n    */\n    setBlockType(from, to = from, type, attrs = null) {\n        setBlockType(this, from, to, type, attrs);\n        return this;\n    }\n    /**\n    Change the type, attributes, and/or marks of the node at `pos`.\n    When `type` isn't given, the existing node type is preserved,\n    */\n    setNodeMarkup(pos, type, attrs = null, marks) {\n        setNodeMarkup(this, pos, type, attrs, marks);\n        return this;\n    }\n    /**\n    Set a single attribute on a given node to a new value.\n    */\n    setNodeAttribute(pos, attr, value) {\n        this.step(new AttrStep(pos, attr, value));\n        return this;\n    }\n    /**\n    Add a mark to the node at position `pos`.\n    */\n    addNodeMark(pos, mark) {\n        this.step(new AddNodeMarkStep(pos, mark));\n        return this;\n    }\n    /**\n    Remove a mark (or a mark of the given type) from the node at\n    position `pos`.\n    */\n    removeNodeMark(pos, mark) {\n        if (!(mark instanceof Mark)) {\n            let node = this.doc.nodeAt(pos);\n            if (!node)\n                throw new RangeError(\"No node at position \" + pos);\n            mark = mark.isInSet(node.marks);\n            if (!mark)\n                return this;\n        }\n        this.step(new RemoveNodeMarkStep(pos, mark));\n        return this;\n    }\n    /**\n    Split the node at the given position, and optionally, if `depth` is\n    greater than one, any number of nodes above that. By default, the\n    parts split off will inherit the node type of the original node.\n    This can be changed by passing an array of types and attributes to\n    use after the split.\n    */\n    split(pos, depth = 1, typesAfter) {\n        split(this, pos, depth, typesAfter);\n        return this;\n    }\n    /**\n    Add the given mark to the inline content between `from` and `to`.\n    */\n    addMark(from, to, mark) {\n        addMark(this, from, to, mark);\n        return this;\n    }\n    /**\n    Remove marks from inline nodes between `from` and `to`. When\n    `mark` is a single mark, remove precisely that mark. When it is\n    a mark type, remove all marks of that type. When it is null,\n    remove all marks of any type.\n    */\n    removeMark(from, to, mark) {\n        removeMark(this, from, to, mark);\n        return this;\n    }\n    /**\n    Removes all marks and nodes from the content of the node at\n    `pos` that don't match the given new parent node type. Accepts\n    an optional starting [content match](https://prosemirror.net/docs/ref/#model.ContentMatch) as\n    third argument.\n    */\n    clearIncompatible(pos, parentType, match) {\n        clearIncompatible(this, pos, parentType, match);\n        return this;\n    }\n}\n\nexport { AddMarkStep, AddNodeMarkStep, AttrStep, MapResult, Mapping, RemoveMarkStep, RemoveNodeMarkStep, ReplaceAroundStep, ReplaceStep, Step, StepMap, StepResult, Transform, TransformError, canJoin, canSplit, dropPoint, findWrapping, insertPoint, joinPoint, liftTarget, replaceStep };\n"],"names":["classesById","Object","create","Selection","constructor","$anchor","$head","ranges","this","SelectionRange","min","max","anchor","pos","head","from","$from","to","$to","empty","i","length","content","doc","slice","replace","tr","lastNode","lastChild","lastParent","openEnd","mapFrom","steps","mapping","replaceRange","map","selectionToInsertionEnd","isInline","isTextblock","replaceWith","node","deleteRange","replaceRangeWith","static","$pos","dir","textOnly","inner","parent","inlineContent","TextSelection","findSelectionIn","index","depth","found","before","after","bias","findFrom","AllSelection","size","childCount","json","type","RangeError","cls","fromJSON","id","selectionClass","prototype","jsonID","getBookmark","between","visible","warnedAboutTextSelection","checkTextSelection","console","name","super","$cursor","resolve","near","marks","marksAcross","ensureMarks","eq","other","TextBookmark","toJSON","dPos","NodeSelection","nodeAfter","$end","nodeSize","deleted","mapResult","NodeBookmark","isText","spec","selectable","isSelectable","delete","sel","atStart","selection","setSelection","AllBookmark","text","child","isAtom","startLen","last","step","end","maps","forEach","_from","_to","_newFrom","newTo","UPDATED_SEL","UPDATED_MARKS","UPDATED_SCROLL","Transaction","state","curSelectionFor","updated","meta","time","Date","now","curSelection","storedMarks","selectionSet","setStoredMarks","addStoredMark","mark","addToSet","removeStoredMark","removeFromSet","storedMarksSet","addStep","setTime","replaceSelection","replaceSelectionWith","inheritMarks","deleteSelection","insertText","schema","setMeta","key","value","getMeta","isGeneric","_","scrollIntoView","scrolledIntoView","bind","f","self","FieldDesc","desc","init","apply","baseFields","config","topNodeType","createAndFill","instance","_marks","_old","prev","Configuration","plugins","pluginsByKey","fields","plugin","push","EditorState","applyTransaction","filterTransaction","ignore","call","rootTr","transactions","trs","newState","applyInner","seen","haveNew","appendTransaction","n","oldState","j","newInstance","field","$config","reconfigure","hasOwnProperty","pluginFields","result","m","prop","markFromJSON","bindProps","obj","target","val","Function","Plugin","props","createKey","getState","keys","PluginKey","get","readFromCache","addToCache","WeakMap","cache","set","cacheSize","cachePos","TableMap","width","height","problems","findCell","curPos","left","top","right","bottom","colCount","nextCell","axis","rectBetween","a","b","leftA","rightA","topA","bottomA","leftB","rightB","topB","bottomB","Math","cellsInRect","rect","row","col","positionAt","table","rowStart","rowEnd","rowEndIndex","computeMap","tableRole","findWidth","mapPos","colWidths","e","rowNode","cellNode","colspan","rowspan","colwidth","attrs","h","start","w","colW","widthIndex","expectedPos","missing","tableMap","badWidths","findBadColWidths","hasRowSpan","rowWidth","prevRow","cell","nodeAt","colWidth","freshColWidth","unshift","getCellAttrs","dom","extraAttrs","widthAttr","getAttribute","widths","test","split","s","Number","getter","getFromDOM","setCellAttrs","join","setter","setDOMAttr","tableNodes","options","cellAttributes","cellAttrs","default","isolating","group","tableGroup","parseDOM","tag","toDOM","table_row","table_cell","cellContent","getAttrs","table_header","tableNodeTypes","cached","nodes","role","tableEditingKey","cellAround","d","cellWrapping","isInTable","selectionCell","$anchorCell","$headCell","$cell","cellNear","firstChild","nodeBefore","pointsAtCell","moveCellForward","inSameTable","$cellA","$cellB","tableStart","moved","removeColSpan","splice","some","addColSpan","columnIsHeader","headerCell","header_cell","CellSelection","cells","filter","p","tableChanged","isRowSelection","rowSelection","isColSelection","colSelection","rows","rowContent","cellRect","extraLeft","extraRight","JSON","stringify","copy","fragment","forEachCell","anchorTop","headTop","anchorBottom","headBottom","anchorRect","headRect","anchorLeft","headLeft","anchorRight","headRight","anchorCell","headCell","CellBookmark","drawCellSelection","class","isCellBoundarySelection","afterFrom","beforeTo","isTextSelectionAcrossCells","fromCellBoundaryNode","toCellBoundaryNode","parentOffset","normalizeSelection","allowTableNodeSelection","normalize","lastCell","fixTablesKey","changedDescendants","old","cur","offset","oldSize","curSize","outer","scan","sameMarkup","nodesBetween","fixTables","check","fixTable","descendants","tablePos","mustAdd","prob","setNodeMarkup","first","add","side","insert","pastedCells","openStart","fitSlice","ensureRectangular","r","append","nodeType","clipCells","newWidth","newHeight","added","newRows","frag","createChecked","source","growTable","types","emptyHead","start2","header","emptyRow","isolateHorizontal","cellTop","cellLeft","isolateVertical","updatePos","insertCells","dispatch","Error","recomp","handleKeyDown","ArrowLeft","arrow","ArrowRight","ArrowUp","ArrowDown","shiftArrow","Backspace","deleteCellSelection","Delete","maybeSetSelection","view","atEndOfCell","$next","newSel","cellSel","baseContent","docChanged","handleTripleClick","handlePaste","handleMouseDown","startEvent","_a","ctrlKey","metaKey","startDOMCell","domInCell","shiftKey","setCellSelection","preventDefault","cellUnderMouse","$anchor2","event","starting","stop","root","removeEventListener","move","_event","addEventListener","indexAfter","cellPos","dirStr","endOfTextblock","parentNode","nodeName","mousePos","posAtCoords","clientX","clientY","TableView","cellMinWidth","document","createElement","className","appendChild","colgroup","updateColumnsOnResize","contentDOM","update","ignoreMutation","record","contains","overrideCol","overrideValue","totalWidth","fixedWidth","nextDOM","hasWidth","cssWidth","style","nextSibling","removeChild","minWidth","columnResizingPluginKey","columnResizing","handleWidth","View","lastColumnResizable","nodeViews","ResizeState","attributes","pluginState","activeHandle","handleDOMEvents","mousemove","handleMouseMove","mouseleave","handleMouseLeave","mousedown","handleMouseDown2","decorations","handleDecorations","dragging","action","setHandle","setDragging","handle","domCellAround","getBoundingClientRect","edgeCell","updateHandle","currentColWidth","finish","event2","window","pluginState2","updateColumnWidth","draggedWidth","which","dragged","displayColumnWidth","startX","startWidth","domAtPos","childNodes","domWidth","offsetWidth","parts","classList","indexOf","mapIndex","zeroes","Array","fill","selectedRect","addColumn","refColumn","addColumnBefore","addColumnAfter","removeColumn","mapStart","deleteColumn","rowIsHeader","addRow","rowPos","refRow","addRowBefore","addRowAfter","removeRow","nextRow","newPos","deleteRow","isEmpty","c","cellsOverlapRectangle","indexTop","indexLeft","indexBottom","indexRight","mergeCells","mergedPos","mergedCell","mapped","splitCell","nodeTypes","splitCellWithType","getCellType","baseAttrs","setCellAttr","deprecated_toggleHeader","isHeaderEnabledByType","cellPositions","toggleHeader","useDeprecatedLogic","isHeaderRowEnabled","isHeaderColumnEnabled","isHeaderEnabled","selectionStartsAt","cellsRect","newType","relativeCellPos","toggleHeaderRow","toggleHeaderColumn","toggleHeaderCell","findNextCell","goToNextCell","direction","deleteTable","tableEditing","createSelectionBetween","lower16","factor16","pow","makeRecover","recoverIndex","recoverOffset","DEL_BEFORE","DEL_AFTER","DEL_ACROSS","DEL_SIDE","MapResult","delInfo","recover","deletedBefore","deletedAfter","deletedAcross","StepMap","inverted","diff","assoc","_map","simple","oldIndex","newIndex","newSize","del","touches","oldStart","newStart","invert","toString","Mapping","mirror","appendMap","mirrors","setMirror","appendMapping","startSize","mirr","getMirror","undefined","appendMappingInverted","totalSize","inverse","corr","stepsByID","Step","getMap","merge","stepType","stepClass","StepResult","failed","message","ok","fail","mapFragment","AddMarkStep","oldSlice","sharedDepth","allowsMarkType","fromReplace","RemoveMarkStep","AddNodeMarkStep","isLeaf","newSet","isInSet","RemoveNodeMarkStep","ReplaceStep","structure","contentBetween","ReplaceAroundStep","gapFrom","gapTo","gap","inserted","insertAt","removeBetween","dist","next","maybeChild","addMark","removing","adding","removed","removeMark","matched","toRemove","clearIncompatible","parentType","match","contentMatch","delSteps","allowed","matchType","validEnd","fillBefore","canCut","canReplace","liftTarget","range","cutByIndex","startIndex","endIndex","lift","gapStart","gapEnd","splitting","findWrapping","innerRange","around","findWrappingOutside","findWrappingInside","withAttrs","concat","contentMatchAt","canReplaceWith","inside","lastType","innerMatch","wrap","wrappers","matchFragment","setBlockType","hasMarkup","canChangeType","startM","endM","newNode","validContent","canSplit","typesAfter","base","innerType","rest","replaceChild","baseType","typeAfter","canJoin","joinable","canAppend","insertPoint","dropPoint","pass","insertPos","fits","wrapping","replaceStep","fitsTrivially","Fitter","fit","unplaced","frontier","placed","findFittable","placeNodes","openMore","dropNode","moveInline","mustMoveInline","placedSize","close","startDepth","sliceDepth","contentAt","frontierDepth","inject","compatibleContent","openAtEnd","dropFromFragment","closeFrontierNode","openFrontierNode","taken","openEndCount","matches","closeNodeStart","allowedMarks","toEnd","addToFragment","level","contentAfterFits","findCloseLevel","dropInner","open","pop","count","invalidMarks","allowsMarks","definesContent","defining","definingForContent","targetDepths","coveredDepths","preferredTarget","definingAsContext","preferredTargetIndex","leftNodes","preferredDepth","def","openDepth","targetDepth","expand","closeFragment","startSteps","oldOpen","newOpen","point","covered","minDepth","AttrStep","attr","TransformError","err","__proto__","Transform","docs","maybeStep","setNodeAttribute","addNodeMark","removeNodeMark"],"sourceRoot":""}