isomorphic-git 1.37.2 → 1.37.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (10) hide show
  1. package/README.md +4 -1
  2. package/index.cjs +24 -8
  3. package/index.js +24 -8
  4. package/index.umd.min.js +1 -1
  5. package/index.umd.min.js.map +1 -1
  6. package/managers/index.cjs +12 -5
  7. package/managers/index.js +12 -5
  8. package/managers/index.umd.min.js +1 -1
  9. package/managers/index.umd.min.js.map +1 -1
  10. package/package.json +1 -1
package/managers/index.umd.min.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"managers/index.umd.min.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAa,IAAID,IAEjBD,EAAU,IAAIC,GACf,CATD,CASGK,KAAM,I,uCCPT,IAAIC,EAAkB,EAAQ,KAE1BC,EAAe,EAAQ,MACvBC,EAAa,EAAQ,MAErBC,EAAO,EAAQ,MAGnBP,EAAOD,QAAU,SAChBS,EACAC,EACAC,GAEA,IAAKF,GAAuB,iBAARA,GAAmC,mBAARA,EAC9C,MAAM,IAAIF,EAAW,0CAEtB,GAAwB,iBAAbG,GAA6C,iBAAbA,EAC1C,MAAM,IAAIH,EAAW,4CAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,IAAqC,OAAjBA,UAAU,GAC1E,MAAM,IAAIL,EAAW,2DAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,IAAqC,OAAjBA,UAAU,GAC1E,MAAM,IAAIL,EAAW,yDAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,IAAqC,OAAjBA,UAAU,GAC1E,MAAM,IAAIL,EAAW,6DAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,GAC5C,MAAM,IAAIL,EAAW,2CAGtB,IAAIO,EAAgBF,UAAUC,OAAS,EAAID,UAAU,GAAK,KACtDG,EAAcH,UAAUC,OAAS,EAAID,UAAU,GAAK,KACpDI,EAAkBJ,UAAUC,OAAS,EAAID,UAAU,GAAK,KACxDK,EAAQL,UAAUC,OAAS,GAAID,UAAU,GAGzCM,IAASV,GAAQA,EAAKC,EAAKC,GAE/B,GAAIL,EACHA,EAAgBI,EAAKC,EAAU,CAC9BS,aAAkC,OAApBH,GAA4BE,EAAOA,EAAKC,cAAgBH,EACtEI,WAA8B,OAAlBN,GAA0BI,EAAOA,EAAKE,YAAcN,EAChEH,MAAOA,EACPU,SAA0B,OAAhBN,GAAwBG,EAAOA,EAAKG,UAAYN,QAErD,KAAIE,IAAWH,GAAkBC,GAAgBC,GAIvD,MAAM,IAAIV,EAAa,+GAFvBG,EAAIC,GAAYC,CAGjB,CACD,C,sBCpDAV,EAAOD,QAAUsB,SAASC,UAAUC,I,cCFpCxB,EAAQyB,KAAO,SAAUC,EAAQC,EAAQC,EAAMC,EAAMC,GACnD,IAAIC,EAAGC,EACHC,EAAiB,EAATH,EAAcD,EAAO,EAC7BK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTC,EAAIT,EAAQE,EAAS,EAAK,EAC1BQ,EAAIV,GAAQ,EAAI,EAChBW,EAAIb,EAAOC,EAASU,GAOxB,IALAA,GAAKC,EAELP,EAAIQ,GAAM,IAAOH,GAAU,EAC3BG,KAAQH,EACRA,GAASH,EACFG,EAAQ,EAAGL,EAAS,IAAJA,EAAWL,EAAOC,EAASU,GAAIA,GAAKC,EAAGF,GAAS,GAKvE,IAHAJ,EAAID,GAAM,IAAOK,GAAU,EAC3BL,KAAQK,EACRA,GAASP,EACFO,EAAQ,EAAGJ,EAAS,IAAJA,EAAWN,EAAOC,EAASU,GAAIA,GAAKC,EAAGF,GAAS,GAEvE,GAAU,IAANL,EACFA,EAAI,EAAII,MACH,IAAIJ,IAAMG,EACf,OAAOF,EAAIQ,IAAsBC,KAAdF,GAAK,EAAI,GAE5BP,GAAQU,KAAKC,IAAI,EAAGd,GACpBE,GAAQI,CACV,CACA,OAAQI,GAAK,EAAI,GAAKP,EAAIU,KAAKC,IAAI,EAAGZ,EAAIF,EAC5C,EAEA7B,EAAQ4C,MAAQ,SAAUlB,EAAQf,EAAOgB,EAAQC,EAAMC,EAAMC,GAC3D,IAAIC,EAAGC,EAAGa,EACNZ,EAAiB,EAATH,EAAcD,EAAO,EAC7BK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBY,EAAe,KAATjB,EAAca,KAAKC,IAAI,GAAI,IAAMD,KAAKC,IAAI,GAAI,IAAM,EAC1DN,EAAIT,EAAO,EAAKE,EAAS,EACzBQ,EAAIV,EAAO,GAAK,EAChBW,EAAI5B,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQ+B,KAAKK,IAAIpC,GAEbqC,MAAMrC,IAAUA,IAAU8B,KAC5BT,EAAIgB,MAAMrC,GAAS,EAAI,EACvBoB,EAAIG,IAEJH,EAAIW,KAAKO,MAAMP,KAAKQ,IAAIvC,GAAS+B,KAAKS,KAClCxC,GAASkC,EAAIH,KAAKC,IAAI,GAAIZ,IAAM,IAClCA,IACAc,GAAK,IAGLlC,GADEoB,EAAII,GAAS,EACNW,EAAKD,EAELC,EAAKJ,KAAKC,IAAI,EAAG,EAAIR,IAEpBU,GAAK,IACfd,IACAc,GAAK,GAGHd,EAAII,GAASD,GACfF,EAAI,EACJD,EAAIG,GACKH,EAAII,GAAS,GACtBH,GAAMrB,EAAQkC,EAAK,GAAKH,KAAKC,IAAI,EAAGd,GACpCE,GAAQI,IAERH,EAAIrB,EAAQ+B,KAAKC,IAAI,EAAGR,EAAQ,GAAKO,KAAKC,IAAI,EAAGd,GACjDE,EAAI,IAIDF,GAAQ,EAAGH,EAAOC,EAASU,GAAS,IAAJL,EAAUK,GAAKC,EAAGN,GAAK,IAAKH,GAAQ,GAI3E,IAFAE,EAAKA,GAAKF,EAAQG,EAClBC,GAAQJ,EACDI,EAAO,EAAGP,EAAOC,EAASU,GAAS,IAAJN,EAAUM,GAAKC,EAAGP,GAAK,IAAKE,GAAQ,GAE1EP,EAAOC,EAASU,EAAIC,IAAU,IAAJC,CAC5B,C,6BClFA,IAAIa,EAAS,eACTC,EAAW,EAAQ,MAGvB,SAASC,EAAKC,EAAWC,GACxBC,KAAKC,OAASN,EAAOO,MAAMJ,GAC3BE,KAAKG,WAAaJ,EAClBC,KAAKI,WAAaN,EAClBE,KAAKK,KAAO,CACb,CAEAR,EAAK/B,UAAUwC,OAAS,SAAUC,EAAMC,GAEvCD,EAAOX,EAASW,EAAMC,GAAO,QAO7B,IALA,IAAIC,EAAQT,KAAKC,OACbH,EAAYE,KAAKI,WACjBhD,EAASmD,EAAKnD,OACdsD,EAAQV,KAAKK,KAERnC,EAAS,EAAGA,EAASd,GAAS,CAItC,IAHA,IAAIuD,EAAWD,EAAQZ,EACnBc,EAAY3B,KAAK4B,IAAIzD,EAASc,EAAQ4B,EAAYa,GAE7C/B,EAAI,EAAGA,EAAIgC,EAAWhC,IAC9B6B,EAAME,EAAW/B,GAAK2B,EAAKrC,EAASU,GAIrCV,GAAU0C,GADVF,GAASE,GAGId,IAAe,GAC3BE,KAAKc,QAAQL,EAEf,CAGA,OADAT,KAAKK,MAAQjD,EACN4C,IACR,EAEAH,EAAK/B,UAAUiD,OAAS,SAAUP,GACjC,IAAIQ,EAAMhB,KAAKK,KAAOL,KAAKI,WAE3BJ,KAAKC,OAAOe,GAAO,IAMnBhB,KAAKC,OAAOgB,KAAK,EAAGD,EAAM,GAEtBA,GAAOhB,KAAKG,aACfH,KAAKc,QAAQd,KAAKC,QAClBD,KAAKC,OAAOgB,KAAK,IAGlB,IAAIC,EAAmB,EAAZlB,KAAKK,KAGhB,GAAIa,GAAQ,WACXlB,KAAKC,OAAOkB,cAAcD,EAAMlB,KAAKI,WAAa,OAG5C,CACN,IAAIgB,GAAkB,WAAPF,KAAuB,EAClCG,GAAYH,EAAOE,GAAW,WAElCpB,KAAKC,OAAOkB,cAAcE,EAAUrB,KAAKI,WAAa,GACtDJ,KAAKC,OAAOkB,cAAcC,EAASpB,KAAKI,WAAa,EACtD,CAEAJ,KAAKc,QAAQd,KAAKC,QAClB,IAAIqB,EAAOtB,KAAKuB,QAEhB,OAAOf,EAAMc,EAAKE,SAAShB,GAAOc,CACnC,EAEAzB,EAAK/B,UAAUgD,QAAU,WACxB,MAAM,IAAIW,MAAM,0CACjB,EAEAjF,EAAOD,QAAUsD,C,uBChFjBrD,EAAOD,QAAU0C,KAAKyC,K,6BCDtB,IAAIC,EAEAC,EAAU,EAAQ,MAElBC,EAAS,EAAQ,MACjBC,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MACtBC,EAAkB,EAAQ,MAC1BnF,EAAe,EAAQ,MACvBC,EAAa,EAAQ,MACrBmF,EAAY,EAAQ,MAEpB3C,EAAM,EAAQ,MACdE,EAAQ,EAAQ,MAChB0C,EAAM,EAAQ,MACdrB,EAAM,EAAQ,MACd3B,EAAM,EAAQ,MACdwC,EAAQ,EAAQ,KAChBS,EAAO,EAAQ,MAEfC,EAAYvE,SAGZwE,EAAwB,SAAUC,GACrC,IACC,OAAOF,EAAU,yBAA2BE,EAAmB,iBAAxDF,EACR,CAAE,MAAO9D,GAAI,CACd,EAEIiE,EAAQ,EAAQ,MAChB3F,EAAkB,EAAQ,KAE1B4F,EAAiB,WACpB,MAAM,IAAI1F,CACX,EACI2F,EAAiBF,EACjB,WACF,IAGC,OAAOC,CACR,CAAE,MAAOE,GACR,IAEC,OAAOH,EAAMpF,UAAW,UAAUwF,GACnC,CAAE,MAAOC,GACR,OAAOJ,CACR,CACD,CACD,CAbE,GAcAA,EAECK,EAAa,EAAQ,KAAR,GAEbC,EAAW,EAAQ,MACnBC,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MAEtBC,EAAS,EAAQ,MACjBC,EAAQ,EAAQ,IAEhBC,EAAY,CAAC,EAEbC,EAAmC,oBAAfC,YAA+BP,EAAuBA,EAASO,YAArB1B,EAE9D2B,EAAa,CAChBC,UAAW,KACX,mBAA8C,oBAAnBC,eAAiC7B,EAAY6B,eACxE,UAAWC,MACX,gBAAwC,oBAAhBC,YAA8B/B,EAAY+B,YAClE,2BAA4Bb,GAAcC,EAAWA,EAAS,GAAGa,OAAOC,aAAejC,EACvF,mCAAoCA,EACpC,kBAAmBwB,EACnB,mBAAoBA,EACpB,2BAA4BA,EAC5B,2BAA4BA,EAC5B,YAAgC,oBAAZU,QAA0BlC,EAAYkC,QAC1D,WAA8B,oBAAXC,OAAyBnC,EAAYmC,OACxD,kBAA4C,oBAAlBC,cAAgCpC,EAAYoC,cACtE,mBAA8C,oBAAnBC,eAAiCrC,EAAYqC,eACxE,YAAaC,QACb,aAAkC,oBAAbC,SAA2BvC,EAAYuC,SAC5D,SAAUC,KACV,cAAeC,UACf,uBAAwBC,mBACxB,cAAeC,UACf,uBAAwBC,mBACxB,UAAW1C,EACX,SAAU2C,KACV,cAAe1C,EACf,iBAA0C,oBAAjB2C,aAA+B9C,EAAY8C,aACpE,iBAA0C,oBAAjBC,aAA+B/C,EAAY+C,aACpE,iBAA0C,oBAAjBC,aAA+BhD,EAAYgD,aACpE,yBAA0D,oBAAzBC,qBAAuCjD,EAAYiD,qBACpF,aAAcxC,EACd,sBAAuBe,EACvB,cAAoC,oBAAd0B,UAA4BlD,EAAYkD,UAC9D,eAAsC,oBAAfC,WAA6BnD,EAAYmD,WAChE,eAAsC,oBAAfC,WAA6BpD,EAAYoD,WAChE,aAAcC,SACd,UAAWzF,MACX,sBAAuBsD,GAAcC,EAAWA,EAASA,EAAS,GAAGa,OAAOC,cAAgBjC,EAC5F,SAA0B,iBAATsD,KAAoBA,KAAOtD,EAC5C,QAAwB,oBAARuD,IAAsBvD,EAAYuD,IAClD,yBAAyC,oBAARA,KAAwBrC,GAAeC,EAAuBA,GAAS,IAAIoC,KAAMvB,OAAOC,aAAtCjC,EACnF,SAAU1C,KACV,WAAYkG,OACZ,WAAYvD,EACZ,oCAAqCW,EACrC,eAAgB6C,WAChB,aAAcC,SACd,YAAgC,oBAAZC,QAA0B3D,EAAY2D,QAC1D,UAA4B,oBAAVC,MAAwB5D,EAAY4D,MACtD,eAAgBxD,EAChB,mBAAoBC,EACpB,YAAgC,oBAAZwD,QAA0B7D,EAAY6D,QAC1D,WAAYC,OACZ,QAAwB,oBAARC,IAAsB/D,EAAY+D,IAClD,yBAAyC,oBAARA,KAAwB7C,GAAeC,EAAuBA,GAAS,IAAI4C,KAAM/B,OAAOC,aAAtCjC,EACnF,sBAAoD,oBAAtBgE,kBAAoChE,EAAYgE,kBAC9E,WAAYC,OACZ,4BAA6B/C,GAAcC,EAAWA,EAAS,GAAGa,OAAOC,aAAejC,EACxF,WAAYkB,EAAac,OAAShC,EAClC,gBAAiB9E,EACjB,mBAAoB4F,EACpB,eAAgBW,EAChB,cAAetG,EACf,eAAsC,oBAAfuG,WAA6B1B,EAAY0B,WAChE,sBAAoD,oBAAtBwC,kBAAoClE,EAAYkE,kBAC9E,gBAAwC,oBAAhBC,YAA8BnE,EAAYmE,YAClE,gBAAwC,oBAAhBC,YAA8BpE,EAAYoE,YAClE,aAAc9D,EACd,YAAgC,oBAAZ+D,QAA0BrE,EAAYqE,QAC1D,YAAgC,oBAAZC,QAA0BtE,EAAYsE,QAC1D,YAAgC,oBAAZC,QAA0BvE,EAAYuE,QAE1D,4BAA6BhD,EAC7B,6BAA8BD,EAC9B,0BAA2BrG,EAC3B,0BAA2BmG,EAC3B,aAAczD,EACd,eAAgBE,EAChB,aAAc0C,EACd,aAAcrB,EACd,aAAc3B,EACd,eAAgBwC,EAChB,cAAeS,EACf,2BAA4Ba,GAG7B,GAAIF,EACH,IACC,KAAKqD,KACN,CAAE,MAAO7H,GAER,IAAI8H,EAAatD,EAASA,EAASxE,IACnCgF,EAAW,qBAAuB8C,CACnC,CAGD,IAAIC,EAAS,SAASA,EAAOC,GAC5B,IAAIpJ,EACJ,GAAa,oBAAToJ,EACHpJ,EAAQmF,EAAsB,6BACxB,GAAa,wBAATiE,EACVpJ,EAAQmF,EAAsB,wBACxB,GAAa,6BAATiE,EACVpJ,EAAQmF,EAAsB,8BACxB,GAAa,qBAATiE,EAA6B,CACvC,IAAIC,EAAKF,EAAO,4BACZE,IACHrJ,EAAQqJ,EAAGzI,UAEb,MAAO,GAAa,6BAATwI,EAAqC,CAC/C,IAAIE,EAAMH,EAAO,oBACbG,GAAO1D,IACV5F,EAAQ4F,EAAS0D,EAAI1I,WAEvB,CAIA,OAFAwF,EAAWgD,GAAQpJ,EAEZA,CACR,EAEIuJ,EAAiB,CACpBlD,UAAW,KACX,yBAA0B,CAAC,cAAe,aAC1C,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,QAAS,YAAa,WAC/C,uBAAwB,CAAC,QAAS,YAAa,WAC/C,oBAAqB,CAAC,QAAS,YAAa,QAC5C,sBAAuB,CAAC,QAAS,YAAa,UAC9C,2BAA4B,CAAC,gBAAiB,aAC9C,mBAAoB,CAAC,yBAA0B,aAC/C,4BAA6B,CAAC,yBAA0B,YAAa,aACrE,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,WAAY,aACpC,kBAAmB,CAAC,OAAQ,aAC5B,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,YAAa,aACtC,0BAA2B,CAAC,eAAgB,aAC5C,0BAA2B,CAAC,eAAgB,aAC5C,sBAAuB,CAAC,WAAY,aACpC,cAAe,CAAC,oBAAqB,aACrC,uBAAwB,CAAC,oBAAqB,YAAa,aAC3D,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,wBAAyB,CAAC,aAAc,aACxC,cAAe,CAAC,OAAQ,SACxB,kBAAmB,CAAC,OAAQ,aAC5B,iBAAkB,CAAC,MAAO,aAC1B,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,sBAAuB,CAAC,SAAU,YAAa,YAC/C,qBAAsB,CAAC,SAAU,YAAa,WAC9C,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,UAAW,YAAa,QAChD,gBAAiB,CAAC,UAAW,OAC7B,mBAAoB,CAAC,UAAW,UAChC,oBAAqB,CAAC,UAAW,WACjC,wBAAyB,CAAC,aAAc,aACxC,4BAA6B,CAAC,iBAAkB,aAChD,oBAAqB,CAAC,SAAU,aAChC,iBAAkB,CAAC,MAAO,aAC1B,+BAAgC,CAAC,oBAAqB,aACtD,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,yBAA0B,CAAC,cAAe,aAC1C,wBAAyB,CAAC,aAAc,aACxC,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,+BAAgC,CAAC,oBAAqB,aACtD,yBAA0B,CAAC,cAAe,aAC1C,yBAA0B,CAAC,cAAe,aAC1C,sBAAuB,CAAC,WAAY,aACpC,qBAAsB,CAAC,UAAW,aAClC,qBAAsB,CAAC,UAAW,cAG/BmD,EAAO,EAAQ,MACfC,EAAS,EAAQ,MACjBC,EAAUF,EAAK3I,KAAKmF,EAAOO,MAAM3F,UAAU+I,QAC3CC,EAAeJ,EAAK3I,KAAKkF,EAAQQ,MAAM3F,UAAUiJ,QACjDC,EAAWN,EAAK3I,KAAKmF,EAAO0C,OAAO9H,UAAUmJ,SAC7CC,EAAYR,EAAK3I,KAAKmF,EAAO0C,OAAO9H,UAAUqJ,OAC9CC,EAAQV,EAAK3I,KAAKmF,EAAOuC,OAAO3H,UAAUuJ,MAG1CC,EAAa,qGACbC,EAAe,WAiBfC,EAAmB,SAA0BlB,EAAMmB,GACtD,IACIC,EADAC,EAAgBrB,EAOpB,GALIK,EAAOF,EAAgBkB,KAE1BA,EAAgB,KADhBD,EAAQjB,EAAekB,IACK,GAAK,KAG9BhB,EAAOrD,EAAYqE,GAAgB,CACtC,IAAIzK,EAAQoG,EAAWqE,GAIvB,GAHIzK,IAAUiG,IACbjG,EAAQmJ,EAAOsB,SAEK,IAAVzK,IAA0BuK,EACpC,MAAM,IAAI3K,EAAW,aAAewJ,EAAO,wDAG5C,MAAO,CACNoB,MAAOA,EACPpB,KAAMqB,EACNzK,MAAOA,EAET,CAEA,MAAM,IAAIL,EAAa,aAAeyJ,EAAO,mBAC9C,EAEA9J,EAAOD,QAAU,SAAsB+J,EAAMmB,GAC5C,GAAoB,iBAATnB,GAAqC,IAAhBA,EAAKlJ,OACpC,MAAM,IAAIN,EAAW,6CAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBqK,EAClC,MAAM,IAAI3K,EAAW,6CAGtB,GAAmC,OAA/BsK,EAAM,cAAed,GACxB,MAAM,IAAIzJ,EAAa,sFAExB,IAAI+K,EAtDc,SAAsBC,GACxC,IAAIC,EAAQZ,EAAUW,EAAQ,EAAG,GAC7BE,EAAOb,EAAUW,GAAS,GAC9B,GAAc,MAAVC,GAA0B,MAATC,EACpB,MAAM,IAAIlL,EAAa,kDACjB,GAAa,MAATkL,GAA0B,MAAVD,EAC1B,MAAM,IAAIjL,EAAa,kDAExB,IAAImL,EAAS,GAIb,OAHAhB,EAASa,EAAQP,EAAY,SAAUW,EAAOC,EAAQC,EAAOC,GAC5DJ,EAAOA,EAAO5K,QAAU+K,EAAQnB,EAASoB,EAAWb,EAAc,MAAQW,GAAUD,CACrF,GACOD,CACR,CAyCaK,CAAa/B,GACrBgC,EAAoBV,EAAMxK,OAAS,EAAIwK,EAAM,GAAK,GAElDW,EAAYf,EAAiB,IAAMc,EAAoB,IAAKb,GAC5De,EAAoBD,EAAUjC,KAC9BpJ,EAAQqL,EAAUrL,MAClBuL,GAAqB,EAErBf,EAAQa,EAAUb,MAClBA,IACHY,EAAoBZ,EAAM,GAC1BZ,EAAac,EAAOhB,EAAQ,CAAC,EAAG,GAAIc,KAGrC,IAAK,IAAI9I,EAAI,EAAG8J,GAAQ,EAAM9J,EAAIgJ,EAAMxK,OAAQwB,GAAK,EAAG,CACvD,IAAI+J,EAAOf,EAAMhJ,GACbkJ,EAAQZ,EAAUyB,EAAM,EAAG,GAC3BZ,EAAOb,EAAUyB,GAAO,GAC5B,IAEa,MAAVb,GAA2B,MAAVA,GAA2B,MAAVA,GACtB,MAATC,GAAyB,MAATA,GAAyB,MAATA,IAElCD,IAAUC,EAEb,MAAM,IAAIlL,EAAa,wDASxB,GAPa,gBAAT8L,GAA2BD,IAC9BD,GAAqB,GAMlB9B,EAAOrD,EAFXkF,EAAoB,KADpBF,GAAqB,IAAMK,GACmB,KAG7CzL,EAAQoG,EAAWkF,QACb,GAAa,MAATtL,EAAe,CACzB,KAAMyL,KAAQzL,GAAQ,CACrB,IAAKuK,EACJ,MAAM,IAAI3K,EAAW,sBAAwBwJ,EAAO,+CAErD,MACD,CACA,GAAI/D,GAAU3D,EAAI,GAAMgJ,EAAMxK,OAAQ,CACrC,IAAIK,EAAO8E,EAAMrF,EAAOyL,GAWvBzL,GAVDwL,IAAUjL,IASG,QAASA,KAAU,kBAAmBA,EAAKkF,KAC/ClF,EAAKkF,IAELzF,EAAMyL,EAEhB,MACCD,EAAQ/B,EAAOzJ,EAAOyL,GACtBzL,EAAQA,EAAMyL,GAGXD,IAAUD,IACbnF,EAAWkF,GAAqBtL,EAElC,CACD,CACA,OAAOA,CACR,C,6BCvXA,IAAI0L,EAAoB,EAAQ,MAE5BhM,EAAkB,EAAQ,KAE1BiM,EAAgB,EAAQ,MACxBC,EAAY,EAAQ,MAExBtM,EAAOD,QAAU,SAAkBwM,GAClC,IAAIC,EAAOH,EAAc1L,WACrB8L,EAAiBF,EAAiB3L,QAAUD,UAAUC,OAAS,GACnE,OAAOwL,EACNI,EACA,GAAKC,EAAiB,EAAIA,EAAiB,IAC3C,EAEF,EAEIrM,EACHA,EAAgBJ,EAAOD,QAAS,QAAS,CAAEW,MAAO4L,IAElDtM,EAAOD,QAAQ2M,MAAQJ,C,6BCpBxB,IAAIlM,EAAkB,EAAQ,KAE1BuM,EAAyB,WAC5B,QAASvM,CACV,EAEAuM,EAAuBC,wBAA0B,WAEhD,IAAKxM,EACJ,OAAO,KAER,IACC,OAA8D,IAAvDA,EAAgB,GAAI,SAAU,CAAEM,MAAO,IAAKE,MACpD,CAAE,MAAOkB,GAER,OAAO,CACR,CACD,EAEA9B,EAAOD,QAAU4M,C,uBClBjB,IAAIvM,EAAkByM,OAAOC,iBAAkB,EAC/C,GAAI1M,EACH,IACCA,EAAgB,CAAC,EAAG,IAAK,CAAEM,MAAO,GACnC,CAAE,MAAOoB,GAER1B,GAAkB,CACnB,CAGDJ,EAAOD,QAAUK,C,uBCXjB,IAAI2M,EAAY,SAAUC,GAWzB,GAVAA,EAAOA,GAAQ,CAAC,EAEhBxJ,KAAKsF,QAAUkE,EAAKlE,SAAWA,QAI/BtF,KAAKyJ,OAASJ,OAAOK,OAAO,MAG5B1J,KAAK2J,gBAAkBH,EAAKG,kBAAmB,EAC3C3J,KAAK2J,gBAAiB,CACzB,GAAuB,oBAAZC,cAAqD,IAAnBA,QAAQC,OACpD,MAAM,IAAIpI,MACT,2LAIFzB,KAAK8J,QAAUT,OAAOK,OAAO,KAC9B,CAEA1J,KAAK+J,QAAUP,EAAKO,SAAWR,EAAUS,gBACzChK,KAAKiK,kBAAoBT,EAAKS,mBAAqBV,EAAUW,4BAC7DlK,KAAKmK,iBAAmBX,EAAKW,kBAAoBZ,EAAUa,2BACvDZ,EAAKa,aAAerL,KAAamG,OAAOmF,UAAUd,EAAKa,aAAeb,EAAKa,YAAc,EAC5FrK,KAAKqK,WAAab,EAAKa,WAEvBrK,KAAKqK,WAAad,EAAUgB,mBAE9B,EAEAhB,EAAUS,gBAAkB,EAC5BT,EAAUW,4BAA8B,EACxCX,EAAUa,2BAA6B,EACvCb,EAAUgB,oBAAsB,IAUhChB,EAAUzL,UAAU0M,QAAU,SAAUC,EAAKlE,EAAImE,EAAIlB,GACpD,GAAI/F,MAAMkH,QAAQF,GACjB,OAAOzK,KAAK4K,cAAcH,EAAKlE,EAAImE,EAAIlB,GAGxC,GAAoB,mBAAT,EACV,MAAM,IAAI/H,MAAM,uCAIjB,IAAIoJ,EAAkB,KAClBC,EAAiB,KACjBC,EAAW,KAEK,mBAAT,IACVvB,EAAOkB,EACPA,EAAK,KAGLK,EAAW,IAAI/K,KAAKsF,QAAQ,SAAS0F,EAASC,GAC7CJ,EAAkBG,EAClBF,EAAiBG,CAClB,IAGDzB,EAAOA,GAAQ,CAAC,EAEhB,IAAI0B,GAAW,EACXC,EAAQ,KACRC,EAAkB,KAClBC,EAAiB,KACjB1O,EAAOqD,KAEPsL,EAAO,SAAUC,EAAQC,EAAKC,GAE7BL,IACHM,aAAaN,GACbA,EAAkB,MAGfC,IACHK,aAAaL,GACbA,EAAiB,MAGdE,IACG5O,EAAK8M,OAAOgB,IAAoC,IAA5B9N,EAAK8M,OAAOgB,GAAKrN,eACnCT,EAAK8M,OAAOgB,GAEhB9N,EAAKgN,wBACDhN,EAAKmN,QAAQW,IAIjBS,IACCH,EAOAS,EACHV,EAAeU,GAGfX,EAAgBY,GAVG,mBAAT,GACVf,EAAGc,EAAKC,GAYVP,GAAW,GAGRK,GAEG5O,EAAK8M,OAAOgB,IAAQ9N,EAAK8M,OAAOgB,GAAKrN,OAAS,GACnDT,EAAK8M,OAAOgB,GAAKkB,OAAjBhP,EAGH,EAEI0K,EAAO,SAAUkE,GACpB,GAAIL,EACH,OAAOI,EAAKC,GAGTJ,IACHO,aAAaP,GACbA,EAAQ,MAGLxO,EAAKgN,iBAAmB4B,IAC3B5O,EAAKmN,QAAQW,GAAOb,QAAQC,QAG7B,IAAIM,EAAmBX,EAAKW,kBAAoBxN,EAAKwN,iBAUrD,GATIA,IACHkB,EAAiBO,WAAW,WACrBjP,EAAK8M,OAAOgB,IACjBa,EAAKC,EAAQ,IAAI9J,MAAM,sCAAwCgJ,GAEjE,EAAGN,IAIc,IAAd5D,EAAGnJ,OAAc,CACpB,IAAIyO,GAAS,EACb,IACCtF,EAAG,SAAUiF,EAAKC,GACZI,IACJA,GAAS,EACTP,EAAKC,EAAQC,EAAKC,GAEpB,EACD,CAAE,MAAOD,GAEHK,IACJA,GAAS,EACTP,EAAKC,EAAQC,GAEf,CACD,MAGC7O,EAAKmP,YAAY,WAChB,OAAOvF,GACR,GACCwF,KAAK,SAASN,GACdH,EAAKC,OAAQ5J,EAAW8J,EACzB,EAAG,SAAStF,GACXmF,EAAKC,EAAQpF,EACd,EAEF,EAEIxJ,EAAKgN,iBAAqBC,QAAQC,SACrCxC,EAAOuC,QAAQC,OAAOnD,KAAKW,IAG5B,IAAIgD,EAAab,EAAKa,YAAc1N,EAAK0N,WAEzC,GAAK1N,EAAK8M,OAAOgB,GAIZ,GAAI9N,EAAKgN,iBAAqBC,QAAQC,QAAUD,QAAQC,SAAWlN,EAAKmN,QAAQW,GAGpFpD,GAAK,QAED,GAAI1K,EAAK8M,OAAOgB,GAAKrN,QAAUiN,EACnCiB,GAAK,EAAO,IAAI7J,MAAM,mCAAqCgJ,QAEvD,CACJ,IAAIuB,EAAS,WACZ3E,GAAK,EACN,EACImC,EAAKyC,UACRtP,EAAK8M,OAAOgB,GAAKyB,QAAQF,GAEzBrP,EAAK8M,OAAOgB,GAAK0B,KAAKH,GAGvB,IAAIjC,EAAUP,EAAKO,SAAWpN,EAAKoN,QAC/BA,IACHoB,EAAQS,WAAW,WAClBT,EAAQ,KACRG,GAAK,EAAO,IAAI7J,MAAM,iCAAmCgJ,GAC1D,EAAGV,GAEL,MA5BCpN,EAAK8M,OAAOgB,GAAO,GACnBpD,GAAK,GA6BN,IAAI4C,EAAoBT,EAAKS,mBAAqBtN,EAAKsN,kBASvD,OARKA,IACHmB,EAAkBQ,WAAW,WACtBjP,EAAK8M,OAAOgB,IACjBa,GAAK,EAAO,IAAI7J,MAAM,gDAAkDgJ,GAE1E,EAAGR,IAGDc,QAAJ,CAGD,EAkBAxB,EAAUzL,UAAU8M,cAAgB,SAAUwB,EAAM7F,EAAImE,EAAIlB,GACvC,mBAAT,IACVA,EAAOkB,EACPA,EAAK,MAGN,IAAI/N,EAAOqD,KAOPqM,EAAMD,EAAKE,YAAY,SAAUC,EAAM9B,GAC1C,OAPW,SAAUA,EAAKlE,GAC1B,OAAO,SAAUmE,GAChB/N,EAAK6N,QAAQC,EAAKlE,EAAImE,EAAIlB,EAC3B,CACD,CAGQgD,CAAM/B,EAAK8B,EACnB,EAAGhG,GAEH,GAAoB,mBAAT,EAIV,OAAO,IAAIvG,KAAKsF,QAAQ,SAAU0F,EAASC,GAEvB,IAAfoB,EAAIjP,OACPiP,EAAI,SAAUb,EAAKC,GACdD,EACHP,EAAOO,GAGPR,EAAQS,EAEV,GAEAT,EAAQqB,IAEV,GAjBAA,EAAI3B,EAmBN,EAOAnB,EAAUzL,UAAU2O,OAAS,SAAUhC,GACtC,OAAKA,IAIKzK,KAAKyJ,OAAOgB,GAHdpB,OAAO+C,KAAKpM,KAAKyJ,QAAQrM,OAAS,CAK3C,EAKAmM,EAAUzL,UAAUgO,YAAc,SAASvF,GAC1C,IACC,OAAOvG,KAAKsF,QAAQ0F,QAAQzE,IAC7B,CAAE,MAAOjI,GACR,OAAO0B,KAAKsF,QAAQ2F,OAAO3M,EAC5B,CACD,EAEA9B,EAAOD,QAAUgN,C,gBCrTjB,IAAItL,EAAS,EAAQ,MACjB0B,EAAS1B,EAAO0B,OAGpB,SAAS+M,EAAWC,EAAKC,GACvB,IAAK,IAAInC,KAAOkC,EACdC,EAAInC,GAAOkC,EAAIlC,EAEnB,CASA,SAASoC,EAAYC,EAAKC,EAAkB3P,GAC1C,OAAOuC,EAAOmN,EAAKC,EAAkB3P,EACvC,CAVIuC,EAAOqN,MAAQrN,EAAOO,OAASP,EAAOsN,aAAetN,EAAOuN,gBAC9D1Q,EAAOD,QAAU0B,GAGjByO,EAAUzO,EAAQ1B,GAClBA,EAAQoD,OAASkN,GAOnBA,EAAW/O,UAAYuL,OAAOK,OAAO/J,EAAO7B,WAG5C4O,EAAU/M,EAAQkN,GAElBA,EAAWG,KAAO,SAAUF,EAAKC,EAAkB3P,GACjD,GAAmB,iBAAR0P,EACT,MAAM,IAAIK,UAAU,iCAEtB,OAAOxN,EAAOmN,EAAKC,EAAkB3P,EACvC,EAEAyP,EAAW3M,MAAQ,SAAUkN,EAAMnM,EAAMoM,GACvC,GAAoB,iBAATD,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAIG,EAAM3N,EAAOyN,GAUjB,YATazL,IAATV,EACsB,iBAAboM,EACTC,EAAIrM,KAAKA,EAAMoM,GAEfC,EAAIrM,KAAKA,GAGXqM,EAAIrM,KAAK,GAEJqM,CACT,EAEAT,EAAWI,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOxN,EAAOyN,EAChB,EAEAP,EAAWK,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOlP,EAAOsP,WAAWH,EAC3B,C,wBC7DA5Q,EAAOD,QAAUsB,SAASC,UAAUoL,K,8BCDpC,IAAItH,EAAU,EAAQ,MAGtBpF,EAAOD,QAAUqF,EAAQ4L,gBAAkB,I,wBCF3ChR,EAAOD,QAAUkR,S,wBCCjBjR,EAAOD,QAAU,WAChB,GAAsB,mBAAXoH,QAAiE,mBAAjC0F,OAAOqE,sBAAwC,OAAO,EACjG,GAA+B,iBAApB/J,OAAOC,SAAyB,OAAO,EAGlD,IAAI5G,EAAM,CAAC,EACP2Q,EAAMhK,OAAO,QACbiK,EAASvE,OAAOsE,GACpB,GAAmB,iBAARA,EAAoB,OAAO,EAEtC,GAA4C,oBAAxCtE,OAAOvL,UAAU0D,SAASzD,KAAK4P,GAA8B,OAAO,EACxE,GAA+C,oBAA3CtE,OAAOvL,UAAU0D,SAASzD,KAAK6P,GAAiC,OAAO,EAY3E,IAAK,IAAIC,KADT7Q,EAAI2Q,GADS,GAEC3Q,EAAO,OAAO,EAC5B,GAA2B,mBAAhBqM,OAAO+C,MAAmD,IAA5B/C,OAAO+C,KAAKpP,GAAKI,OAAgB,OAAO,EAEjF,GAA0C,mBAA/BiM,OAAOyE,qBAAiF,IAA3CzE,OAAOyE,oBAAoB9Q,GAAKI,OAAgB,OAAO,EAE/G,IAAI2Q,EAAO1E,OAAOqE,sBAAsB1Q,GACxC,GAAoB,IAAhB+Q,EAAK3Q,QAAgB2Q,EAAK,KAAOJ,EAAO,OAAO,EAEnD,IAAKtE,OAAOvL,UAAUkQ,qBAAqBjQ,KAAKf,EAAK2Q,GAAQ,OAAO,EAEpE,GAA+C,mBAApCtE,OAAO4E,yBAAyC,CAE1D,IAAIC,EAAgD7E,OAAO4E,yBAAyBjR,EAAK2Q,GACzF,GAfY,KAeRO,EAAWhR,QAA8C,IAA1BgR,EAAWvQ,WAAuB,OAAO,CAC7E,CAEA,OAAO,CACR,C,8BCvBA,IAAIwQ,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MA2BxBC,GAAmB,EAyBZC,EAAO,GAkBXC,EAAM,GAiBb,SAASC,EAAQC,GACf,OAAWA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,GACzB,CAGA,SAASC,IACP7O,KAAK8O,KAAO,EACZ9O,KAAK+H,MAAO,EACZ/H,KAAK+O,KAAO,EACZ/O,KAAKgP,UAAW,EAChBhP,KAAKiP,MAAQ,EACbjP,KAAKkP,KAAO,EACZlP,KAAKmP,MAAQ,EACbnP,KAAKoP,MAAQ,EAEbpP,KAAKqP,KAAO,KAGZrP,KAAKsP,MAAQ,EACbtP,KAAKuP,MAAQ,EACbvP,KAAKwP,MAAQ,EACbxP,KAAKyP,MAAQ,EACbzP,KAAK0P,OAAS,KAGd1P,KAAK2P,KAAO,EACZ3P,KAAKkB,KAAO,EAGZlB,KAAK5C,OAAS,EACd4C,KAAK9B,OAAS,EAGd8B,KAAK4P,MAAQ,EAGb5P,KAAK6P,QAAU,KACf7P,KAAK8P,SAAW,KAChB9P,KAAK+P,QAAU,EACf/P,KAAKgQ,SAAW,EAGhBhQ,KAAKiQ,MAAQ,EACbjQ,KAAKkQ,KAAO,EACZlQ,KAAKmQ,MAAQ,EACbnQ,KAAKoQ,KAAO,EACZpQ,KAAKqQ,KAAO,KAEZrQ,KAAKsQ,KAAO,IAAInC,EAAMoC,MAAM,KAC5BvQ,KAAKwQ,KAAO,IAAIrC,EAAMoC,MAAM,KAO5BvQ,KAAKyQ,OAAS,KACdzQ,KAAK0Q,QAAU,KACf1Q,KAAK2Q,KAAO,EACZ3Q,KAAK4Q,KAAO,EACZ5Q,KAAK6Q,IAAM,CACb,CAEA,SAASC,EAAiBC,GACxB,IAAIC,EAEJ,OAAKD,GAASA,EAAKC,OACnBA,EAAQD,EAAKC,MACbD,EAAKE,SAAWF,EAAKG,UAAYF,EAAM5B,MAAQ,EAC/C2B,EAAKI,IAAM,GACPH,EAAMjC,OACRgC,EAAKK,MAAqB,EAAbJ,EAAMjC,MAErBiC,EAAMlC,KA1HM,EA2HZkC,EAAMjJ,KAAO,EACbiJ,EAAMhC,SAAW,EACjBgC,EAAM9B,KAAO,MACb8B,EAAM3B,KAAO,KACb2B,EAAMrB,KAAO,EACbqB,EAAM9P,KAAO,EAEb8P,EAAMnB,QAAUmB,EAAMP,OAAS,IAAItC,EAAMkD,MA7FzB,KA8FhBL,EAAMlB,SAAWkB,EAAMN,QAAU,IAAIvC,EAAMkD,MA7F1B,KA+FjBL,EAAML,KAAO,EACbK,EAAMJ,MAAQ,EAxJM,GAqIepC,CAsBrC,CAEA,SAAS8C,EAAaP,GACpB,IAAIC,EAEJ,OAAKD,GAASA,EAAKC,QACnBA,EAAQD,EAAKC,OACPzB,MAAQ,EACdyB,EAAMxB,MAAQ,EACdwB,EAAMvB,MAAQ,EACPqB,EAAiBC,IALWvC,CAOrC,CAEA,SAAS+C,EAAcR,EAAMS,GAC3B,IAAIzC,EACAiC,EAGJ,OAAKD,GAASA,EAAKC,OACnBA,EAAQD,EAAKC,MAGTQ,EAAa,GACfzC,EAAO,EACPyC,GAAcA,IAGdzC,EAA2B,GAAnByC,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzChD,GAEY,OAAjBwC,EAAMtB,QAAmBsB,EAAM1B,QAAUkC,IAC3CR,EAAMtB,OAAS,MAIjBsB,EAAMjC,KAAOA,EACbiC,EAAM1B,MAAQkC,EACPF,EAAaP,KA1BevC,CA2BrC,CAEA,SAASiD,EAAaV,EAAMS,GAC1B,IAAI/F,EACAuF,EAEJ,OAAKD,GAGLC,EAAQ,IAAInC,EAIZkC,EAAKC,MAAQA,EACbA,EAAMtB,OAAS,KAvNK,KAwNpBjE,EAAM8F,EAAcR,EAAMS,MAExBT,EAAKC,MAAQ,MAERvF,GAba+C,CActB,CAiBA,IAEIkD,EAAQC,EAFRC,GAAS,EAIb,SAASC,EAAYb,GAEnB,GAAIY,EAAQ,CACV,IAAIjE,EAOJ,IALA+D,EAAS,IAAIvD,EAAMkD,MAAM,KACzBM,EAAU,IAAIxD,EAAMkD,MAAM,IAG1B1D,EAAM,EACCA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EACxC,KAAOA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EACxC,KAAOA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EACxC,KAAOA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EAMxC,IAJAY,EArRO,EAqRcyC,EAAMV,KAAM,EAAG,IAAKoB,EAAU,EAAGV,EAAMR,KAAM,CAAEtP,KAAM,IAG1EyM,EAAM,EACCA,EAAM,IAAMqD,EAAMV,KAAK3C,KAAS,EAEvCY,EA1RQ,EA0RayC,EAAMV,KAAM,EAAG,GAAMqB,EAAS,EAAGX,EAAMR,KAAM,CAAEtP,KAAM,IAG1E0Q,GAAS,CACX,CAEAZ,EAAMnB,QAAU6B,EAChBV,EAAMjB,QAAU,EAChBiB,EAAMlB,SAAW6B,EACjBX,EAAMhB,SAAW,CACnB,CAiBA,SAAS8B,EAAaf,EAAMpE,EAAKoF,EAAKC,GACpC,IAAIC,EACAjB,EAAQD,EAAKC,MAqCjB,OAlCqB,OAAjBA,EAAMtB,SACRsB,EAAMzB,MAAQ,GAAKyB,EAAM1B,MACzB0B,EAAMvB,MAAQ,EACduB,EAAMxB,MAAQ,EAEdwB,EAAMtB,OAAS,IAAIvB,EAAM+D,KAAKlB,EAAMzB,QAIlCyC,GAAQhB,EAAMzB,OAChBpB,EAAMgE,SAASnB,EAAMtB,OAAQ/C,EAAKoF,EAAMf,EAAMzB,MAAOyB,EAAMzB,MAAO,GAClEyB,EAAMvB,MAAQ,EACduB,EAAMxB,MAAQwB,EAAMzB,SAGpB0C,EAAOjB,EAAMzB,MAAQyB,EAAMvB,OAChBuC,IACTC,EAAOD,GAGT7D,EAAMgE,SAASnB,EAAMtB,OAAQ/C,EAAKoF,EAAMC,EAAMC,EAAMjB,EAAMvB,QAC1DuC,GAAQC,IAGN9D,EAAMgE,SAASnB,EAAMtB,OAAQ/C,EAAKoF,EAAMC,EAAMA,EAAM,GACpDhB,EAAMvB,MAAQuC,EACdhB,EAAMxB,MAAQwB,EAAMzB,QAGpByB,EAAMvB,OAASwC,EACXjB,EAAMvB,QAAUuB,EAAMzB,QAASyB,EAAMvB,MAAQ,GAC7CuB,EAAMxB,MAAQwB,EAAMzB,QAASyB,EAAMxB,OAASyC,KAG7C,CACT,CAsoCA1V,EAAQ+U,aAAeA,EACvB/U,EAAQgV,cAAgBA,EACxBhV,EAAQuU,iBAAmBA,EAC3BvU,EAAQ6V,YApvCR,SAAqBrB,GACnB,OAAOU,EAAaV,EArKN,GAsKhB,EAmvCAxU,EAAQkV,aAAeA,EACvBlV,EAAQ8V,QAzoCR,SAAiBtB,EAAMuB,GACrB,IAAItB,EACAuB,EAAOC,EACPnC,EACAoC,EACArC,EAAMsC,EACN/C,EACAzO,EACAyR,EAAKC,EACLZ,EACAhF,EACA6F,EAEAC,EAAWC,EAASC,EAEpBC,EAAWC,EAASC,EACpBC,EACA3H,EAEAjC,EAEA6J,EATAC,EAAO,EAMPC,EAAO,IAAIpF,EAAM+D,KAAK,GAKtBsB,EACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAGlE,IAAKzC,IAASA,EAAKC,QAAUD,EAAKyB,SAC5BzB,EAAKwB,OAA2B,IAAlBxB,EAAK0C,SACvB,OAAOjF,GAGTwC,EAAQD,EAAKC,OACHlC,OAASL,IAAQuC,EAAMlC,KA/Uf,IAmVlB2D,EAAM1B,EAAK2C,SACXlB,EAASzB,EAAKyB,OACdE,EAAO3B,EAAK4C,UACZtD,EAAOU,EAAK6C,QACZrB,EAAQxB,EAAKwB,MACbnC,EAAOW,EAAK0C,SACZ9D,EAAOqB,EAAMrB,KACbzO,EAAO8P,EAAM9P,KAGbyR,EAAMvC,EACNwC,EAAOF,EACPjH,EA7XoB,EA+XpBoI,EACA,OACE,OAAQ7C,EAAMlC,MACZ,KAhXQ,EAiXN,GAAmB,IAAfkC,EAAMjC,KAAY,CACpBiC,EAAMlC,KAtWI,GAuWV,KACF,CAEA,KAAO5N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb8P,EAAMjC,MAAsB,QAATY,EAAiB,CACvCqB,EAAM7B,MAAQ,EAEdoE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,GAI1C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAxYD,EAyYL,KACF,CAKA,GAJAkC,EAAM/B,MAAQ,EACV+B,EAAM3B,OACR2B,EAAM3B,KAAK/D,MAAO,KAED,EAAb0F,EAAMjC,UACA,IAAPY,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtDoB,EAAKI,IAAM,yBACXH,EAAMlC,KAAOJ,EACb,KACF,CACA,GA7ZU,IA6ZE,GAAPiB,GAAwC,CAC3CoB,EAAKI,IAAM,6BACXH,EAAMlC,KAAOJ,EACb,KACF,CAMA,GAHAxN,GAAQ,EAERkS,EAAiC,GAAnB,IAHdzD,KAAU,IAIU,IAAhBqB,EAAM1B,MACR0B,EAAM1B,MAAQ8D,OAEX,GAAIA,EAAMpC,EAAM1B,MAAO,CAC1ByB,EAAKI,IAAM,sBACXH,EAAMlC,KAAOJ,EACb,KACF,CACAsC,EAAM9B,KAAO,GAAKkE,EAElBrC,EAAKK,MAAQJ,EAAM7B,MAAQ,EAC3B6B,EAAMlC,KAAc,IAAPa,EAlaL,GAka6BlB,EAErCkB,EAAO,EACPzO,EAAO,EAEP,MACF,KAhbS,EAkbP,KAAOA,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAGA,GADA8P,EAAM/B,MAAQU,EAjcJ,IAkcS,IAAdqB,EAAM/B,OAA8B,CACvC8B,EAAKI,IAAM,6BACXH,EAAMlC,KAAOJ,EACb,KACF,CACA,GAAkB,MAAdsC,EAAM/B,MAAgB,CACxB8B,EAAKI,IAAM,2BACXH,EAAMlC,KAAOJ,EACb,KACF,CACIsC,EAAM3B,OACR2B,EAAM3B,KAAKyE,KAASnE,GAAQ,EAAK,GAEjB,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAjdA,EAmdR,KAndQ,EAqdN,KAAO5N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEI8P,EAAM3B,OACR2B,EAAM3B,KAAK0E,KAAOpE,GAEF,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzB4D,EAAK,GAAM5D,IAAS,GAAM,IAC1B4D,EAAK,GAAM5D,IAAS,GAAM,IAC1BqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KA3eF,EA6eN,KA7eM,EA+eJ,KAAO5N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEI8P,EAAM3B,OACR2B,EAAM3B,KAAK2E,OAAiB,IAAPrE,EACrBqB,EAAM3B,KAAK4E,GAAMtE,GAAQ,GAET,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KApgBC,EAsgBT,KAtgBS,EAugBP,GAAkB,KAAdkC,EAAM/B,MAAgB,CAExB,KAAO/N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAM5T,OAASuS,EACXqB,EAAM3B,OACR2B,EAAM3B,KAAK6E,UAAYvE,GAEP,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,CAET,MACS8P,EAAM3B,OACb2B,EAAM3B,KAAKO,MAAQ,MAErBoB,EAAMlC,KAliBC,EAoiBT,KApiBS,EAqiBP,GAAkB,KAAdkC,EAAM/B,SACR+C,EAAOhB,EAAM5T,QACFgT,IAAQ4B,EAAO5B,GACtB4B,IACEhB,EAAM3B,OACR+D,EAAMpC,EAAM3B,KAAK6E,UAAYlD,EAAM5T,OAC9B4T,EAAM3B,KAAKO,QAEdoB,EAAM3B,KAAKO,MAAQ,IAAInM,MAAMuN,EAAM3B,KAAK6E,YAE1C/F,EAAMgE,SACJnB,EAAM3B,KAAKO,MACX2C,EACAlC,EAGA2B,EAEAoB,IAMc,IAAdpC,EAAM/B,QACR+B,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoD,EAAOP,EAAM3B,IAEhDD,GAAQ4B,EACR3B,GAAQ2B,EACRhB,EAAM5T,QAAU4U,GAEdhB,EAAM5T,QAAU,MAAMyW,EAE5B7C,EAAM5T,OAAS,EACf4T,EAAMlC,KAtkBA,EAwkBR,KAxkBQ,EAykBN,GAAkB,KAAdkC,EAAM/B,MAAgB,CACxB,GAAa,IAATmB,EAAc,MAAMyD,EACxB7B,EAAO,EACP,GAEEoB,EAAMb,EAAMlC,EAAO2B,KAEfhB,EAAM3B,MAAQ+D,GACbpC,EAAM5T,OAAS,QAClB4T,EAAM3B,KAAK/I,MAAQV,OAAOuO,aAAaf,UAElCA,GAAOpB,EAAO5B,GAOvB,GALkB,IAAdY,EAAM/B,QACR+B,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoD,EAAOP,EAAM3B,IAEhDD,GAAQ4B,EACR3B,GAAQ2B,EACJoB,EAAO,MAAMS,CACnB,MACS7C,EAAM3B,OACb2B,EAAM3B,KAAK/I,KAAO,MAEpB0K,EAAM5T,OAAS,EACf4T,EAAMlC,KAhmBG,EAkmBX,KAlmBW,EAmmBT,GAAkB,KAAdkC,EAAM/B,MAAgB,CACxB,GAAa,IAATmB,EAAc,MAAMyD,EACxB7B,EAAO,EACP,GACEoB,EAAMb,EAAMlC,EAAO2B,KAEfhB,EAAM3B,MAAQ+D,GACbpC,EAAM5T,OAAS,QAClB4T,EAAM3B,KAAK+E,SAAWxO,OAAOuO,aAAaf,UAErCA,GAAOpB,EAAO5B,GAMvB,GALkB,IAAdY,EAAM/B,QACR+B,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoD,EAAOP,EAAM3B,IAEhDD,GAAQ4B,EACR3B,GAAQ2B,EACJoB,EAAO,MAAMS,CACnB,MACS7C,EAAM3B,OACb2B,EAAM3B,KAAK+E,QAAU,MAEvBpD,EAAMlC,KAvnBA,EAynBR,KAznBQ,EA0nBN,GAAkB,IAAdkC,EAAM/B,MAAgB,CAExB,KAAO/N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,GAAIyO,KAAwB,MAAdqB,EAAM7B,OAAiB,CACnC4B,EAAKI,IAAM,sBACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAiB,EAAO,EACPzO,EAAO,CAET,CACI8P,EAAM3B,OACR2B,EAAM3B,KAAKgF,KAASrD,EAAM/B,OAAS,EAAK,EACxC+B,EAAM3B,KAAK/D,MAAO,GAEpByF,EAAKK,MAAQJ,EAAM7B,MAAQ,EAC3B6B,EAAMlC,KAAOL,EACb,MACF,KAnpBU,GAqpBR,KAAOvN,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA6P,EAAKK,MAAQJ,EAAM7B,MAAQR,EAAQgB,GAEnCA,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAhqBA,GAkqBR,KAlqBQ,GAmqBN,GAAuB,IAAnBkC,EAAMhC,SASR,OAPA+B,EAAK2C,SAAWjB,EAChB1B,EAAK4C,UAAYjB,EACjB3B,EAAK6C,QAAUvD,EACfU,EAAK0C,SAAWrD,EAChBY,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,EApsBD,EAwsBd6P,EAAKK,MAAQJ,EAAM7B,MAAQ,EAC3B6B,EAAMlC,KAAOL,EAEf,KAAKA,EACH,GArtBc,IAqtBV6D,GAptBU,IAotBWA,EAAqB,MAAMuB,EAEtD,KAlrBc,GAmrBZ,GAAI7C,EAAMjJ,KAAM,CAEd4H,KAAiB,EAAPzO,EACVA,GAAe,EAAPA,EAER8P,EAAMlC,KA1qBD,GA2qBL,KACF,CAEA,KAAO5N,EAAO,GAAG,CACf,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAQA,OANA8P,EAAMjJ,KAAe,EAAP4H,EAGdzO,GAAQ,EAGQ,GAJhByO,KAAU,IAKR,KAAK,EAGHqB,EAAMlC,KA5sBE,GA6sBR,MACF,KAAK,EAKH,GAJA+C,EAAYb,GAGZA,EAAMlC,KA5sBI,GA3CA,IAwvBNwD,EAAmB,CAErB3C,KAAU,EACVzO,GAAQ,EAER,MAAM2S,CACR,CACA,MACF,KAAK,EAGH7C,EAAMlC,KA3tBC,GA4tBP,MACF,KAAK,EACHiC,EAAKI,IAAM,qBACXH,EAAMlC,KAAOJ,EAGjBiB,KAAU,EACVzO,GAAQ,EAER,MACF,KAzuBc,GA+uBZ,IAJAyO,KAAiB,EAAPzO,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,IAAY,MAAPyO,KAAqBA,IAAS,GAAM,OAAS,CAChDoB,EAAKI,IAAM,+BACXH,EAAMlC,KAAOJ,EACb,KACF,CASA,GARAsC,EAAM5T,OAAgB,MAAPuS,EAIfA,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAjwBK,GAtCG,IAwyBVwD,EAAqB,MAAMuB,EAEjC,KApwBa,GAqwBX7C,EAAMlC,KApwBI,GAswBZ,KAtwBY,GAwwBV,GADAkD,EAAOhB,EAAM5T,OACH,CAGR,GAFI4U,EAAO5B,IAAQ4B,EAAO5B,GACtB4B,EAAOU,IAAQV,EAAOU,GACb,IAATV,EAAc,MAAM6B,EAExB1F,EAAMgE,SAASK,EAAQD,EAAOlC,EAAM2B,EAAMS,GAE1CrC,GAAQ4B,EACR3B,GAAQ2B,EACRU,GAAQV,EACRS,GAAOT,EACPhB,EAAM5T,QAAU4U,EAChB,KACF,CAEAhB,EAAMlC,KAAOL,EACb,MACF,KAxxBa,GA0xBX,KAAOvN,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAkBA,GAhBA8P,EAAMd,KAAkC,KAAnB,GAAPP,GAEdA,KAAU,EACVzO,GAAQ,EAER8P,EAAMb,MAAmC,GAAnB,GAAPR,GAEfA,KAAU,EACVzO,GAAQ,EAER8P,EAAMf,MAAmC,GAAnB,GAAPN,GAEfA,KAAU,EACVzO,GAAQ,EAGJ8P,EAAMd,KAAO,KAAOc,EAAMb,MAAQ,GAAI,CACxCY,EAAKI,IAAM,sCACXH,EAAMlC,KAAOJ,EACb,KACF,CAGAsC,EAAMZ,KAAO,EACbY,EAAMlC,KAxzBO,GA0zBf,KA1zBe,GA2zBb,KAAOkC,EAAMZ,KAAOY,EAAMf,OAAO,CAE/B,KAAO/O,EAAO,GAAG,CACf,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAMV,KAAKkD,EAAMxC,EAAMZ,SAAmB,EAAPT,EAEnCA,KAAU,EACVzO,GAAQ,CAEV,CACA,KAAO8P,EAAMZ,KAAO,IAClBY,EAAMV,KAAKkD,EAAMxC,EAAMZ,SAAW,EAapC,GAPAY,EAAMnB,QAAUmB,EAAMP,OACtBO,EAAMjB,QAAU,EAEhBvG,EAAO,CAAEtI,KAAM8P,EAAMjB,SACrBtE,EAAM8C,EA74BF,EA64BuByC,EAAMV,KAAM,EAAG,GAAIU,EAAMnB,QAAS,EAAGmB,EAAMR,KAAMhH,GAC5EwH,EAAMjB,QAAUvG,EAAKtI,KAEjBuK,EAAK,CACPsF,EAAKI,IAAM,2BACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAsC,EAAMZ,KAAO,EACbY,EAAMlC,KA91BQ,GAg2BhB,KAh2BgB,GAi2Bd,KAAOkC,EAAMZ,KAAOY,EAAMd,KAAOc,EAAMb,OAAO,CAC5C,KAGE4C,GAFAO,EAAOtC,EAAMnB,QAAQF,GAAS,GAAKqB,EAAMjB,SAAW,MAEhC,GAAM,IAC1BiD,EAAkB,MAAPM,KAFXR,EAAYQ,IAAS,KAIFpS,IANZ,CAQP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CACA,GAAI8R,EAAW,GAEbrD,KAAUmD,EACV5R,GAAQ4R,EAER9B,EAAMV,KAAKU,EAAMZ,QAAU4C,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADAK,EAAIP,EAAY,EACT5R,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAMA,GAHAyO,KAAUmD,EACV5R,GAAQ4R,EAEW,IAAf9B,EAAMZ,KAAY,CACpBW,EAAKI,IAAM,4BACXH,EAAMlC,KAAOJ,EACb,KACF,CACA0E,EAAMpC,EAAMV,KAAKU,EAAMZ,KAAO,GAC9B4B,EAAO,GAAY,EAAPrC,GAEZA,KAAU,EACVzO,GAAQ,CAEV,MACK,GAAiB,KAAb8R,EAAiB,CAGxB,IADAK,EAAIP,EAAY,EACT5R,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAIAA,GAAQ4R,EAERM,EAAM,EACNpB,EAAO,GAAY,GAJnBrC,KAAUmD,IAMVnD,KAAU,EACVzO,GAAQ,CAEV,KACK,CAGH,IADAmS,EAAIP,EAAY,EACT5R,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAIAA,GAAQ4R,EAERM,EAAM,EACNpB,EAAO,IAAa,KAJpBrC,KAAUmD,IAMVnD,KAAU,EACVzO,GAAQ,CAEV,CACA,GAAI8P,EAAMZ,KAAO4B,EAAOhB,EAAMd,KAAOc,EAAMb,MAAO,CAChDY,EAAKI,IAAM,4BACXH,EAAMlC,KAAOJ,EACb,KACF,CACA,KAAOsD,KACLhB,EAAMV,KAAKU,EAAMZ,QAAUgD,CAE/B,CACF,CAGA,GAAIpC,EAAMlC,OAASJ,EAAO,MAG1B,GAAwB,IAApBsC,EAAMV,KAAK,KAAY,CACzBS,EAAKI,IAAM,uCACXH,EAAMlC,KAAOJ,EACb,KACF,CAcA,GATAsC,EAAMjB,QAAU,EAEhBvG,EAAO,CAAEtI,KAAM8P,EAAMjB,SACrBtE,EAAM8C,EA/gCH,EA+gCuByC,EAAMV,KAAM,EAAGU,EAAMd,KAAMc,EAAMnB,QAAS,EAAGmB,EAAMR,KAAMhH,GAGnFwH,EAAMjB,QAAUvG,EAAKtI,KAGjBuK,EAAK,CACPsF,EAAKI,IAAM,8BACXH,EAAMlC,KAAOJ,EACb,KACF,CAaA,GAXAsC,EAAMhB,SAAW,EAGjBgB,EAAMlB,SAAWkB,EAAMN,QACvBlH,EAAO,CAAEtI,KAAM8P,EAAMhB,UACrBvE,EAAM8C,EA/hCF,EA+hCuByC,EAAMV,KAAMU,EAAMd,KAAMc,EAAMb,MAAOa,EAAMlB,SAAU,EAAGkB,EAAMR,KAAMhH,GAG/FwH,EAAMhB,SAAWxG,EAAKtI,KAGlBuK,EAAK,CACPsF,EAAKI,IAAM,wBACXH,EAAMlC,KAAOJ,EACb,KACF,CAGA,GADAsC,EAAMlC,KAn/BQ,GA3CA,IA+hCVwD,EAAqB,MAAMuB,EAEjC,KAt/BgB,GAu/Bd7C,EAAMlC,KAt/BO,GAw/Bf,KAx/Be,GAy/Bb,GAAIsB,GAAQ,GAAKsC,GAAQ,IAAK,CAE5B3B,EAAK2C,SAAWjB,EAChB1B,EAAK4C,UAAYjB,EACjB3B,EAAK6C,QAAUvD,EACfU,EAAK0C,SAAWrD,EAChBY,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,EAEboN,EAAayC,EAAM6B,GAEnBH,EAAM1B,EAAK2C,SACXlB,EAASzB,EAAKyB,OACdE,EAAO3B,EAAK4C,UACZtD,EAAOU,EAAK6C,QACZrB,EAAQxB,EAAKwB,MACbnC,EAAOW,EAAK0C,SACZ9D,EAAOqB,EAAMrB,KACbzO,EAAO8P,EAAM9P,KAGT8P,EAAMlC,OAASL,IACjBuC,EAAMJ,MAAQ,GAEhB,KACF,CAEA,IADAI,EAAMJ,KAAO,EAIXmC,GAFAO,EAAOtC,EAAMnB,QAAQF,GAAS,GAAKqB,EAAMjB,SAAW,MAEhC,GAAM,IAC1BiD,EAAkB,MAAPM,KAFXR,EAAYQ,IAAS,KAIJpS,IANV,CAQP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CACA,GAAI6R,KAAsB,IAAVA,GAAuB,CAIrC,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAKTD,GAHAO,EAAOtC,EAAMnB,QAAQsD,IACXxD,GAAS,GAAMsD,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BD,EAAkB,MAAPM,IAENL,GAJLH,EAAYQ,IAAS,KAIUpS,IAPxB,CASP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CAEAyO,KAAUsD,EACV/R,GAAQ+R,EAERjC,EAAMJ,MAAQqC,CAChB,CAOA,GALAtD,KAAUmD,EACV5R,GAAQ4R,EAER9B,EAAMJ,MAAQkC,EACd9B,EAAM5T,OAAS4V,EACC,IAAZD,EAAe,CAIjB/B,EAAMlC,KAhkCK,GAikCX,KACF,CACA,GAAc,GAAViE,EAAc,CAEhB/B,EAAMJ,MAAQ,EACdI,EAAMlC,KAAOL,EACb,KACF,CACA,GAAc,GAAVsE,EAAc,CAChBhC,EAAKI,IAAM,8BACXH,EAAMlC,KAAOJ,EACb,KACF,CACAsC,EAAMpB,MAAkB,GAAVmD,EACd/B,EAAMlC,KAnlCU,GAqlClB,KArlCkB,GAslChB,GAAIkC,EAAMpB,MAAO,CAGf,IADAyD,EAAIrC,EAAMpB,MACH1O,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAM5T,QAAUuS,GAAS,GAAKqB,EAAMpB,OAAS,EAE7CD,KAAUqB,EAAMpB,MAChB1O,GAAQ8P,EAAMpB,MAEdoB,EAAMJ,MAAQI,EAAMpB,KACtB,CAEAoB,EAAMH,IAAMG,EAAM5T,OAClB4T,EAAMlC,KAxmCQ,GA0mChB,KA1mCgB,GA2mCd,KAGEiE,GAFAO,EAAOtC,EAAMlB,SAASH,GAAS,GAAKqB,EAAMhB,UAAY,MAElC,GAAM,IAC1BgD,EAAkB,MAAPM,KAFXR,EAAYQ,IAAS,KAIFpS,IANZ,CAQP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CACA,KAAe,IAAV6R,GAAuB,CAI1B,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAKTD,GAHAO,EAAOtC,EAAMlB,SAASqD,IACZxD,GAAS,GAAMsD,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BD,EAAkB,MAAPM,IAENL,GAJLH,EAAYQ,IAAS,KAIUpS,IAPxB,CASP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CAEAyO,KAAUsD,EACV/R,GAAQ+R,EAERjC,EAAMJ,MAAQqC,CAChB,CAMA,GAJAtD,KAAUmD,EACV5R,GAAQ4R,EAER9B,EAAMJ,MAAQkC,EACA,GAAVC,EAAc,CAChBhC,EAAKI,IAAM,wBACXH,EAAMlC,KAAOJ,EACb,KACF,CACAsC,EAAM9S,OAAS8U,EACfhC,EAAMpB,MAAoB,GAAZ,EACdoB,EAAMlC,KA7pCW,GA+pCnB,KA/pCmB,GAgqCjB,GAAIkC,EAAMpB,MAAO,CAGf,IADAyD,EAAIrC,EAAMpB,MACH1O,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAM9S,QAAUyR,GAAS,GAAKqB,EAAMpB,OAAS,EAE7CD,KAAUqB,EAAMpB,MAChB1O,GAAQ8P,EAAMpB,MAEdoB,EAAMJ,MAAQI,EAAMpB,KACtB,CAEA,GAAIoB,EAAM9S,OAAS8S,EAAM9B,KAAM,CAC7B6B,EAAKI,IAAM,gCACXH,EAAMlC,KAAOJ,EACb,KACF,CAGAsC,EAAMlC,KAxrCS,GA0rCjB,KA1rCiB,GA2rCf,GAAa,IAAT4D,EAAc,MAAMmB,EAExB,GADA7B,EAAOY,EAAOF,EACV1B,EAAM9S,OAAS8T,EAAM,CAEvB,IADAA,EAAOhB,EAAM9S,OAAS8T,GACXhB,EAAMxB,OACXwB,EAAML,KAAM,CACdI,EAAKI,IAAM,gCACXH,EAAMlC,KAAOJ,EACb,KACF,CAiBEsD,EAAOhB,EAAMvB,OACfuC,GAAQhB,EAAMvB,MACdzC,EAAOgE,EAAMzB,MAAQyC,GAGrBhF,EAAOgE,EAAMvB,MAAQuC,EAEnBA,EAAOhB,EAAM5T,SAAU4U,EAAOhB,EAAM5T,QACxCyV,EAAc7B,EAAMtB,MACtB,MAEEmD,EAAcL,EACdxF,EAAOyF,EAAMzB,EAAM9S,OACnB8T,EAAOhB,EAAM5T,OAEX4U,EAAOU,IAAQV,EAAOU,GAC1BA,GAAQV,EACRhB,EAAM5T,QAAU4U,EAChB,GACEQ,EAAOC,KAASI,EAAY7F,aACnBgF,GACU,IAAjBhB,EAAM5T,SAAgB4T,EAAMlC,KA9uCnB,IA+uCb,MACF,KA3uCe,GA4uCb,GAAa,IAAT4D,EAAc,MAAMmB,EACxBrB,EAAOC,KAASzB,EAAM5T,OACtBsV,IACA1B,EAAMlC,KApvCO,GAqvCb,MACF,KAhvCS,GAivCP,GAAIkC,EAAMjC,KAAM,CAEd,KAAO7N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IAEAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAaA,GAXA0R,GAAQF,EACR3B,EAAKG,WAAa0B,EAClB5B,EAAM5B,OAASwD,EACXA,IACF7B,EAAKK,MAAQJ,EAAM7B,MAEd6B,EAAM/B,MAAQZ,EAAM2C,EAAM7B,MAAOqD,EAAQI,EAAMH,EAAMG,GAAQxE,EAAQ4C,EAAM7B,MAAOqD,EAAQI,EAAMH,EAAMG,IAG7GA,EAAOF,GAEF1B,EAAM/B,MAAQU,EAAOhB,EAAQgB,MAAWqB,EAAM7B,MAAO,CACxD4B,EAAKI,IAAM,uBACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAiB,EAAO,EACPzO,EAAO,CAGT,CACA8P,EAAMlC,KAhxCE,GAkxCV,KAlxCU,GAmxCR,GAAIkC,EAAMjC,MAAQiC,EAAM/B,MAAO,CAE7B,KAAO/N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,GAAIyO,KAAwB,WAAdqB,EAAM5B,OAAqB,CACvC2B,EAAKI,IAAM,yBACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAiB,EAAO,EACPzO,EAAO,CAGT,CACA8P,EAAMlC,KAtyCA,GAwyCR,KAxyCQ,GAyyCNrD,EAt1Cc,EAu1Cd,MAAMoI,EACR,KAAKnF,EACHjD,GAr1Cc,EAs1Cd,MAAMoI,EACR,KA5yCO,GA6yCL,OAv1Cc,EA01ChB,QACE,OAAOrF,EAsBb,OARAuC,EAAK2C,SAAWjB,EAChB1B,EAAK4C,UAAYjB,EACjB3B,EAAK6C,QAAUvD,EACfU,EAAK0C,SAAWrD,EAChBY,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,GAGT8P,EAAMzB,OAAUqD,IAAS7B,EAAK4C,WAAa3C,EAAMlC,KAAOJ,IACvCsC,EAAMlC,KA50Cd,IApDO,IAg4CuBwD,KACrCR,EAAaf,EAAMA,EAAKyB,OAAQzB,EAAK2C,SAAUd,EAAO7B,EAAK4C,YAC7D3C,EAAMlC,KA10CC,IA1CS,IAw3CpB6D,GAAO5B,EAAK0C,SACZb,GAAQ7B,EAAK4C,UACb5C,EAAKE,UAAY0B,EACjB5B,EAAKG,WAAa0B,EAClB5B,EAAM5B,OAASwD,EACX5B,EAAMjC,MAAQ6D,IAChB7B,EAAKK,MAAQJ,EAAM7B,MAChB6B,EAAM/B,MAAQZ,EAAM2C,EAAM7B,MAAOqD,EAAQI,EAAM7B,EAAK2C,SAAWd,GAAQxE,EAAQ4C,EAAM7B,MAAOqD,EAAQI,EAAM7B,EAAK2C,SAAWd,IAE/H7B,EAAKuD,UAAYtD,EAAM9P,MAAQ8P,EAAMjJ,KAAO,GAAK,IAC9BiJ,EAAMlC,OAASL,EAAO,IAAM,IAn2C3B,KAo2CDuC,EAAMlC,MAz2CR,KAy2CyBkC,EAAMlC,KAAiB,IAAM,IACzD,IAAR6D,GAAsB,IAATC,GAl5CC,IAk5CcN,IA14Cd,IA04CqC7G,IACvDA,GAp4CkB,GAs4CbA,EACT,EAwEAlP,EAAQgY,WAtER,SAAoBxD,GAElB,IAAKA,IAASA,EAAKC,MACjB,OAAOxC,EAGT,IAAIwC,EAAQD,EAAKC,MAKjB,OAJIA,EAAMtB,SACRsB,EAAMtB,OAAS,MAEjBqB,EAAKC,MAAQ,KA15CO,CA45CtB,EA2DAzU,EAAQiY,iBAzDR,SAA0BzD,EAAM1B,GAC9B,IAAI2B,EAGJ,OAAKD,GAASA,EAAKC,OAED,GADlBA,EAAQD,EAAKC,OACFjC,MAGXiC,EAAM3B,KAAOA,EACbA,EAAK/D,MAAO,EAx6CQ,GAk6CekD,CAQrC,EA8CAjS,EAAQkY,qBA5CR,SAA8B1D,EAAM2D,GAClC,IAEI1D,EAFA2D,EAAaD,EAAWtX,OAO5B,OAAK2T,GAAyBA,EAAKC,MAGhB,KAFnBA,EAAQD,EAAKC,OAEHjC,MA35CE,KA25CYiC,EAAMlC,KACrBN,EA55CG,KAg6CRwC,EAAMlC,MAGCV,EAFA,EAEgBsG,EAAYC,EAAY,KAClC3D,EAAM7B,OA37CH,EAi8Cd2C,EAAaf,EAAM2D,EAAYC,EAAYA,IAE/C3D,EAAMlC,KAx5CG,IA1CS,IAq8CpBkC,EAAMhC,SAAW,EA38CG,GAo7C+CR,CA0BrE,EAWAjS,EAAQqY,YAAc,oC,wBCtgDtBpY,EAAOD,QAAU0C,KAAKK,G,8BCAtB,IAMIuV,EAAO,CAAC,GAEZC,EARgB,gBAQTD,EANS,EAAQ,MACR,EAAQ,MACR,EAAQ,OAMxBrY,EAAOD,QAAUsY,C,8BCTjB,IAAI1G,EAAQ,EAAQ,MAQhB4G,GAAe,EACfC,GAAmB,EAEvB,IAAMpP,OAAOuO,aAAajL,MAAM,KAAM,CAAE,GAAM,CAAE,MAAO+L,GAAMF,GAAe,CAAO,CACnF,IAAMnP,OAAOuO,aAAajL,MAAM,KAAM,IAAI7F,WAAW,GAAK,CAAE,MAAO4R,GAAMD,GAAmB,CAAO,CAOnG,IADA,IAAIE,EAAW,IAAI/G,EAAM+D,KAAK,KACrBtD,EAAI,EAAGA,EAAI,IAAKA,IACvBsG,EAAStG,GAAMA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EA4D5F,SAASuG,EAAc7H,EAAK8F,GAI1B,GAAIA,EAAM,QACH9F,EAAI8H,UAAYJ,IAAuB1H,EAAI8H,UAAYL,GAC1D,OAAOnP,OAAOuO,aAAajL,MAAM,KAAMiF,EAAMkH,UAAU/H,EAAK8F,IAKhE,IADA,IAAIpL,EAAS,GACJpJ,EAAI,EAAGA,EAAIwU,EAAKxU,IACvBoJ,GAAUpC,OAAOuO,aAAa7G,EAAI1O,IAEpC,OAAOoJ,CACT,CAzEAkN,EAAS,KAAOA,EAAS,KAAO,EAIhC3Y,EAAQ+Y,WAAa,SAAUC,GAC7B,IAAIjI,EAAKlO,EAAGoW,EAAIC,EAAO7W,EAAG8W,EAAUH,EAAInY,OAAQuY,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAEV,QAAZ,OADTrW,EAAImW,EAAIK,WAAWH,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKD,EAAIK,WAAWH,EAAQ,OAE1BrW,EAAI,OAAYA,EAAI,OAAW,KAAOoW,EAAK,OAC3CC,KAGJE,GAAWvW,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHAkO,EAAM,IAAIa,EAAM+D,KAAKyD,GAGhB/W,EAAI,EAAG6W,EAAQ,EAAG7W,EAAI+W,EAASF,IAEb,QAAZ,OADTrW,EAAImW,EAAIK,WAAWH,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKD,EAAIK,WAAWH,EAAQ,OAE1BrW,EAAI,OAAYA,EAAI,OAAW,KAAOoW,EAAK,OAC3CC,KAGArW,EAAI,IAENkO,EAAI1O,KAAOQ,EACFA,EAAI,MAEbkO,EAAI1O,KAAO,IAAQQ,IAAM,EACzBkO,EAAI1O,KAAO,IAAY,GAAJQ,GACVA,EAAI,OAEbkO,EAAI1O,KAAO,IAAQQ,IAAM,GACzBkO,EAAI1O,KAAO,IAAQQ,IAAM,EAAI,GAC7BkO,EAAI1O,KAAO,IAAY,GAAJQ,IAGnBkO,EAAI1O,KAAO,IAAQQ,IAAM,GACzBkO,EAAI1O,KAAO,IAAQQ,IAAM,GAAK,GAC9BkO,EAAI1O,KAAO,IAAQQ,IAAM,EAAI,GAC7BkO,EAAI1O,KAAO,IAAY,GAAJQ,GAIvB,OAAOkO,CACT,EAsBA/Q,EAAQ4Y,cAAgB,SAAU7H,GAChC,OAAO6H,EAAc7H,EAAKA,EAAIlQ,OAChC,EAIAb,EAAQsZ,cAAgB,SAAUN,GAEhC,IADA,IAAIjI,EAAM,IAAIa,EAAM+D,KAAKqD,EAAInY,QACpBwB,EAAI,EAAGwU,EAAM9F,EAAIlQ,OAAQwB,EAAIwU,EAAKxU,IACzC0O,EAAI1O,GAAK2W,EAAIK,WAAWhX,GAE1B,OAAO0O,CACT,EAIA/Q,EAAQuZ,WAAa,SAAUxI,EAAKpL,GAClC,IAAItD,EAAGmX,EAAK3W,EAAG4W,EACX5C,EAAMlR,GAAOoL,EAAIlQ,OAKjB6Y,EAAW,IAAIxS,MAAY,EAAN2P,GAEzB,IAAK2C,EAAM,EAAGnX,EAAI,EAAGA,EAAIwU,GAGvB,IAFAhU,EAAIkO,EAAI1O,MAEA,IAAQqX,EAASF,KAAS3W,OAIlC,IAFA4W,EAAQd,EAAS9V,IAEL,EAAK6W,EAASF,KAAS,MAAQnX,GAAKoX,EAAQ,MAAxD,CAKA,IAFA5W,GAAe,IAAV4W,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAKpX,EAAIwU,GACtBhU,EAAKA,GAAK,EAAiB,GAAXkO,EAAI1O,KACpBoX,IAIEA,EAAQ,EAAKC,EAASF,KAAS,MAE/B3W,EAAI,MACN6W,EAASF,KAAS3W,GAElBA,GAAK,MACL6W,EAASF,KAAS,MAAW3W,GAAK,GAAM,KACxC6W,EAASF,KAAS,MAAc,KAAJ3W,EAlBuC,CAsBvE,OAAO+V,EAAcc,EAAUF,EACjC,EASAxZ,EAAQ2Z,WAAa,SAAU5I,EAAKpL,GAClC,IAAIiU,EAOJ,KALAjU,EAAMA,GAAOoL,EAAIlQ,QACPkQ,EAAIlQ,SAAU8E,EAAMoL,EAAIlQ,QAGlC+Y,EAAMjU,EAAM,EACLiU,GAAO,GAA2B,MAAV,IAAX7I,EAAI6I,KAAyBA,IAIjD,OAAIA,EAAM,GAIE,IAARA,EAJkBjU,EAMdiU,EAAMjB,EAAS5H,EAAI6I,IAAQjU,EAAOiU,EAAMjU,CAClD,C,8BCrKA,IAAIiM,EAAQ,EAAQ,MAWhBiI,EAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,GAG3DC,EAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtDC,EAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,GAG5BC,EAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtB/Z,EAAOD,QAAU,SAAuBia,EAAMlG,EAAMmG,EAAYC,EAAOC,EAAOC,EAAapG,EAAMhH,GAE/F,IAYIqN,EACA5V,EACA6V,EACAC,EACA1G,EAIA0B,EAMAe,EAAWC,EAASC,EA1BpB9R,EAAOsI,EAAKtI,KAGZkS,EAAM,EACNzF,EAAM,EACN9M,EAAM,EAAGqB,EAAM,EACf7F,EAAO,EACP2a,EAAO,EACPC,EAAO,EACPvE,EAAO,EACPwE,EAAO,EACPC,EAAO,EAMPC,EAAO,KACPC,EAAa,EAGbC,EAAQ,IAAInJ,EAAMoC,MAAMgH,IACxBC,EAAO,IAAIrJ,EAAMoC,MAAMgH,IACvB3H,EAAQ,KACR6H,EAAc,EAoClB,IAAKrE,EAAM,EAAGA,GA7FF,GA6FkBA,IAC5BkE,EAAMlE,GAAO,EAEf,IAAKzF,EAAM,EAAGA,EAAM+I,EAAO/I,IACzB2J,EAAMhH,EAAKmG,EAAa9I,MAK1B,IADAtR,EAAO6E,EACFgB,EAtGO,GAsGQA,GAAO,GACN,IAAfoV,EAAMpV,GADkBA,KAM9B,GAHI7F,EAAO6F,IACT7F,EAAO6F,GAEG,IAARA,EAaF,OATAyU,EAAMC,KAAiB,SAMvBD,EAAMC,KAAiB,SAEvBpN,EAAKtI,KAAO,EACL,EAET,IAAKL,EAAM,EAAGA,EAAMqB,GACC,IAAfoV,EAAMzW,GADaA,KASzB,IANIxE,EAAOwE,IACTxE,EAAOwE,GAIT6R,EAAO,EACFU,EAAM,EAAGA,GApIF,GAoIkBA,IAG5B,GAFAV,IAAS,GACTA,GAAQ4E,EAAMlE,IACH,EACT,OAAQ,EAGZ,GAAIV,EAAO,IAtID,IAsIO8D,GAA0B,IAARtU,GACjC,OAAQ,EAKV,IADAsV,EAAK,GAAK,EACLpE,EAAM,EAAGA,EAjJF,GAiJiBA,IAC3BoE,EAAKpE,EAAM,GAAKoE,EAAKpE,GAAOkE,EAAMlE,GAIpC,IAAKzF,EAAM,EAAGA,EAAM+I,EAAO/I,IACM,IAA3B2C,EAAKmG,EAAa9I,KACpB6C,EAAKgH,EAAKlH,EAAKmG,EAAa9I,OAAWA,GAmE3C,GAtNU,IAyLN6I,GACFY,EAAOxH,EAAQY,EACfuB,EAAM,IA1LC,IA4LEyE,GACTY,EAAOhB,EACPiB,GAAc,IACdzH,EAAQyG,EACRoB,GAAe,IACf1F,EAAM,MAGNqF,EAAOd,EACP1G,EAAQ2G,EACRxE,GAAO,GAIToF,EAAO,EACPxJ,EAAM,EACNyF,EAAMvS,EACNwP,EAAOuG,EACPI,EAAO3a,EACP4a,EAAO,EACPH,GAAO,EAEPC,GADAG,EAAO,GAAK7a,GACE,EAlNL,IAqNJma,GAAiBU,EA1NN,KAMN,IAqNPV,GAAkBU,EA1NJ,IA2Nf,OAAO,EAIT,OAAS,CAEPpE,EAAYM,EAAM6D,EACdzG,EAAK7C,GAAOoE,GACdgB,EAAU,EACVC,EAAWxC,EAAK7C,IAET6C,EAAK7C,GAAOoE,GACnBgB,EAAUnD,EAAM6H,EAAcjH,EAAK7C,IACnCqF,EAAWoE,EAAKC,EAAa7G,EAAK7C,MAGlCoF,EAAU,GACVC,EAAW,GAIb6D,EAAO,GAAMzD,EAAM6D,EAEnBpW,EADAI,EAAO,GAAK+V,EAEZ,GAEEL,EAAMtG,GAAQ8G,GAAQF,IADtBhW,GAAQ4V,IAC+B/D,GAAa,GAAOC,GAAW,GAAMC,QAC5D,IAAT/R,GAIT,IADA4V,EAAO,GAAMzD,EAAM,EACZ+D,EAAON,GACZA,IAAS,EAWX,GATa,IAATA,GACFM,GAAQN,EAAO,EACfM,GAAQN,GAERM,EAAO,EAITxJ,IACqB,MAAf2J,EAAMlE,GAAY,CACtB,GAAIA,IAAQlR,EAAO,MACnBkR,EAAM9C,EAAKmG,EAAajG,EAAK7C,GAC/B,CAGA,GAAIyF,EAAM/W,IAAS8a,EAAOJ,KAAUD,EAAK,CAYvC,IAVa,IAATG,IACFA,EAAO5a,GAITgU,GAAQxP,EAIR6R,EAAO,IADPsE,EAAO5D,EAAM6D,GAEND,EAAOC,EAAO/U,MACnBwQ,GAAQ4E,EAAMN,EAAOC,KACT,IACZD,IACAtE,IAAS,EAKX,GADAwE,GAAQ,GAAKF,EA5RR,IA6RAR,GAAiBU,EAlSV,KAMN,IA6RHV,GAAkBU,EAlSR,IAmSX,OAAO,EAQTP,EAJAG,EAAMK,EAAOJ,GAIC1a,GAAQ,GAAO2a,GAAQ,GAAO3G,EAAOuG,CACrD,CACF,CAeA,OAVa,IAATO,IAIFR,EAAMtG,EAAO8G,GAAU/D,EAAM6D,GAAS,GAAO,IAAM,IAKrDzN,EAAKtI,KAAO7E,EACL,CACT,C,8BCpVA,IAAIqK,EAAO,EAAQ,MACfzD,EAAS,EAAQ,MACjByU,EAAc,EAAQ,MAG1Blb,EAAOD,QAAU,WAChB,OAAOmb,EAAYhR,EAAMzD,EAAQ9F,UAClC,C,WCRA,SAASwa,EAAWC,GAClB,OAAOnU,MAAMkH,QAAQiN,GACjBA,EACA,CAACA,EACP,CAEA,MAGMC,EAAwB,QACxBC,EAAmC,iBACnCC,EAA4C,OAC5CC,EAAqC,OACrCC,EAAsB,SAMtBC,EAA0B,eAKhC,IAAIC,EAAiB,cAEC,oBAAXxU,SACTwU,EAAiBxU,OAAOyU,IAAI,gBAE9B,MAAMC,EAAaF,EAKbG,EAAqB,mBAErBC,EAAe,KAAM,EA8BrBC,EAAY,CAEhB,CAIE,UACA,IAnEU,IAuEZ,CAKE,wBACA,CAAC3K,EAAG4K,EAAIC,IAAOD,GACQ,IAArBC,EAAGC,QAAQ,MA7EH,IADA,KAwFZ,CACE,YACA,CAAC9K,EAAG4K,KACF,MAAM,OAACrb,GAAUqb,EACjB,OAAOA,EAAGtR,MAAM,EAAG/J,EAASA,EAAS,GA3F7B,MAgHZ,CACE,iBACA6K,GAAS,KAAKA,KAGhB,CAEE,YACA,IAAM,QAIR,CAKE,MACA,IAAM,KAIR,CACE,MACA,IAAM,OAGR,CAOE,mBAGA,IAAM,eAIR,CAIE,YACA,WAEE,MAAQ,UAAU2Q,KAAK5Y,MAiBnB,IAJA,WAKN,GAIF,CAEE,0BAMA,CAAC6N,EAAGgL,EAAOtD,IAAQsD,EAAQ,EAAItD,EAAInY,OAO/B,kBAMA,SAIN,CAOE,2BAIA,CAACyQ,EAAGiL,EAAIC,IAOCD,EADWC,EAAG9R,QAAQ,QAAS,YAK1C,CAIE,yBACA,IAzOW,MA4Ob,CAEE,QACA,IA/OW,MAkPb,CAKE,gCACA,CAACgB,EAAO+Q,EAAYC,EAAOC,EAAWC,IAxP3B,OAwPqCH,EAE5C,MAAMC,IAhNcG,KAC1B,MAAM,OAAChc,GAAUgc,EACjB,OAAOA,EAAQjS,MAAM,EAAG/J,EAASA,EAAS,IA8MtBic,CAAoBH,KAAaC,IACrC,MAAVA,GACED,EAAU9b,OAAS,GAAM,EAIvB,IAhOU6b,IAASA,EAAMhS,QACnCqR,EACA,CAACrQ,EAAO+E,EAAMsM,IAAOtM,EAAK4I,WAAW,IAAM0D,EAAG1D,WAAW,GACrD3N,EArCQ,IAkQEsR,CAAcN,KAASC,KAI7B,MAIR,CAGE,YAcAjR,GAAS,MAAM2Q,KAAK3Q,GAEhB,GAAGA,KAEH,GAAGA,eAIT,CACE,kBACA,CAAC4F,EAAGiL,KACaA,EAOX,GAAGA,SAIH,SAEG,eAMPU,EAAanQ,OAAOK,OAAO,MAoB3B+P,EAAW7B,GAA8B,iBAAZA,EAanC,MAAM8B,EACJ,WAAAC,CACEC,EACAC,EACAC,EACAC,GAEA/Z,KAAK4Z,OAASA,EACd5Z,KAAK6Z,QAAUA,EACf7Z,KAAK8Z,SAAWA,EAChB9Z,KAAK+Z,MAAQA,CACf,EAGF,MA4BMC,EAAa,CAACC,EAASC,KAC3B,MAAM,IAAIA,EAAKD,IAGXE,EAAY,CAACC,EAAMC,EAAcC,IAChCb,EAASW,GAQTA,GAKDD,EAAUI,cAAcH,IAEnBE,EACL,0DAA0CD,KAC1CG,YARKF,EAAQ,yBAA0BnN,WARlCmN,EACL,oCAAoCD,MACpClN,WAqBAoN,EAAgBH,GAAQlC,EAAwBU,KAAKwB,GAE3DD,EAAUI,cAAgBA,EAC1BJ,EAAUM,QAAUC,GAAKA,EAEzB,MAAMC,EACJ,WAAAhB,EAAa,WACXiB,GAAa,EAAI,WACjBC,EAAaD,EAAU,mBACvBE,GAAqB,GACnB,CAAC,GAlZQ,IAASrQ,IAmZP4N,EAlZfhP,OAAOC,eAkZEtJ,KAlZqByK,EAAK,CAACvN,MAkZT,OAEzB8C,KAAK+a,OAAS,GACd/a,KAAKgb,YAAcH,EACnB7a,KAAKib,oBAAsBH,EAC3B9a,KAAKkb,YACP,CAEA,UAAAA,GACElb,KAAKmb,aAAe9R,OAAOK,OAAO,MAClC1J,KAAKob,WAAa/R,OAAOK,OAAO,KAClC,CAEA,WAAA2R,CAAaxB,GAEX,GAAIA,GAAWA,EAAQxB,GAGrB,OAFArY,KAAK+a,OAAS/a,KAAK+a,OAAOlU,OAAOgT,EAAQkB,aACzC/a,KAAKsb,QAAS,GAIhB,GAjHiBzB,IAAWA,GAC3BJ,EAASI,KACRhC,EAAsBe,KAAKiB,KAC3B/B,EAAiCc,KAAKiB,IAGd,IAAzBA,EAAQlB,QAAQ,KA2Gb4C,CAAa1B,GAAU,CACzB,MAAM2B,EA1FO,EAAC3B,EAASgB,KAC3B,MAAMjB,EAASC,EACf,IAAIC,GAAW,EAGc,IAAzBD,EAAQlB,QAAQ,OAClBmB,GAAW,EACXD,EAAUA,EAAQ4B,OAAO,IAW3B,MAAM1B,EA9DU,EAACF,EAASgB,KAC1B,IAAIa,EAASlC,EAAWK,GAWxB,OATK6B,IACHA,EAASlD,EAAUmD,OACjB,CAACpP,GAAOqP,EAASC,KACftP,EAAKtF,QAAQ2U,EAASC,EAASnV,KAAKmT,IACtCA,GAEFL,EAAWK,GAAW6B,GAGjBb,EACH,IAAIpV,OAAOiW,EAAQ,KACnB,IAAIjW,OAAOiW,IAgDDI,CARdjC,EAAUA,EAGT5S,QAAQ8Q,EAA2C,KAGnD9Q,QAAQ+Q,EAAoC,KAEZ6C,GAEjC,OAAO,IAAInB,EACTE,EACAC,EACAC,EACAC,IAkEegC,CAAWlC,EAAS7Z,KAAKgb,aACtChb,KAAKsb,QAAS,EACdtb,KAAK+a,OAAO5O,KAAKqP,EACnB,CACF,CAGA,GAAAQ,CAAKnC,GAeH,OAdA7Z,KAAKsb,QAAS,EAEd3D,EACE8B,EAASI,GArHMA,IAAWA,EAAQoC,MAAMhE,GAsHpCiE,CAAarC,GACbA,GACJsC,QAAQnc,KAAKqb,YAAarb,MAIxBA,KAAKsb,QACPtb,KAAKkb,aAGAlb,IACT,CAGA,UAAAoc,CAAYvC,GACV,OAAO7Z,KAAKgc,IAAInC,EAClB,CAkBA,QAAAwC,CAAUjC,EAAMkC,GACd,IAAIC,GAAU,EACVC,GAAY,EAmBhB,OAjBAxc,KAAK+a,OAAOoB,QAAQX,IAClB,MAAM,SAAC1B,GAAY0B,EAEjBgB,IAAc1C,GAAYyC,IAAYC,GACnC1C,IAAayC,IAAYC,IAAcF,GAK5Bd,EAAKzB,MAAMnB,KAAKwB,KAG9BmC,GAAWzC,EACX0C,EAAY1C,KAIT,CACLyC,UACAC,YAEJ,CAGA,KAAAC,CAAOpC,EAAcqC,EAAOJ,EAAgBK,GAC1C,MAAMvC,EAAOC,GAERF,EAAUM,QAAQJ,GAUvB,OARAF,EACEC,EACAC,EACAra,KAAKib,oBACD1C,EACAyB,GAGCha,KAAK4c,GAAGxC,EAAMsC,EAAOJ,EAAgBK,EAC9C,CAEA,EAAAC,CAAIxC,EAAMsC,EAAOJ,EAAgBK,GAC/B,GAAIvC,KAAQsC,EACV,OAAOA,EAAMtC,GAYf,GATKuC,IAGHA,EAASvC,EAAK6B,MArhBN,MAwhBVU,EAAOE,OAGFF,EAAOvf,OACV,OAAOsf,EAAMtC,GAAQpa,KAAKqc,SAASjC,EAAMkC,GAG3C,MAAMQ,EAAS9c,KAAK4c,GAClBD,EAAOI,KAhiBC,SAiiBRL,EACAJ,EACAK,GAIF,OAAOD,EAAMtC,GAAQ0C,EAAOP,QAGxBO,EACA9c,KAAKqc,SAASjC,EAAMkC,EAC1B,CAEA,OAAAU,CAAS5C,GACP,OAAOpa,KAAKyc,MAAMrC,EAAMpa,KAAKmb,cAAc,GAAOoB,OACpD,CAEA,YAAAU,GACE,OAAO7C,IAASpa,KAAKgd,QAAQ5C,EAC/B,CAEA,MAAA8C,CAAQC,GACN,OAAOxF,EAAUwF,GAAOD,OAAOld,KAAKid,eACtC,CAGA,IAAArE,CAAMwB,GACJ,OAAOpa,KAAKyc,MAAMrC,EAAMpa,KAAKob,YAAY,EAC3C,EAGF,MAAM9e,EAAU8gB,GAAW,IAAIzC,EAAOyC,GAetC,GAVA9gB,EAAQ+gB,YAHYjD,GAClBD,EAAUC,GAAQD,EAAUM,QAAQL,GAAOA,EAAM7B,GAKnDjc,EAAQghB,QAAUhhB,EAElBE,EAAOD,QAAUD,EAOI,oBAAZsN,UAELA,QAAQ2T,KAAO3T,QAAQ2T,IAAIC,mBACH,UAArB5T,QAAQ6T,UAEb,CAEA,MAAMC,EAAYnI,GAAO,YAAYqD,KAAKrD,IACvC,wBAAwBqD,KAAKrD,GAC5BA,EACAA,EAAItO,QAAQ,MAAO,KAEvBkT,EAAUM,QAAUiD,EAIpB,MAAMC,EAAiC,aACvCxD,EAAUI,cAAgBH,GACxBuD,EAA+B/E,KAAKwB,IACjCG,EAAcH,EACrB,C,eCxnBA,IACW9d,IAoBT,SAASshB,GACXA,EAAMC,QAAU,QAqBhB,IAAIC,EAnBJ,WAGC,IAFA,IAAI1e,EAAI,EAAGuX,EAAQ,IAAIlT,MAAM,KAErB4P,EAAG,EAAQ,KAALA,IAAYA,EASzBjU,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAIiU,IACW,UAAajU,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,EAC/CuX,EAAMtD,GAAKjU,EAGZ,MAA6B,oBAAf2F,WAA6B,IAAIA,WAAW4R,GAASA,CACpE,CAESoH,GAaLC,EAZJ,SAA4BC,GAC3B,IAAI7e,EAAI,EAAG8e,EAAI,EAAG7K,EAAI,EAAGsD,EAA8B,oBAAf5R,WAA6B,IAAIA,WAAW,MAAQ,IAAItB,MAAM,MAEtG,IAAI4P,EAAI,EAAQ,KAALA,IAAYA,EAAGsD,EAAMtD,GAAK4K,EAAE5K,GACvC,IAAIA,EAAI,EAAQ,KAALA,IAAYA,EAEtB,IADA6K,EAAID,EAAE5K,GACFjU,EAAI,IAAMiU,EAAGjU,EAAI,KAAMA,GAAK,IAAK8e,EAAIvH,EAAMvX,GAAM8e,IAAM,EAAKD,EAAM,IAAJC,GAEnE,IAAInI,EAAM,GACV,IAAI1C,EAAI,EAAQ,IAALA,IAAWA,EAAG0C,EAAI1C,EAAI,GAA2B,oBAAftO,WAA6B4R,EAAMvB,SAAa,IAAJ/B,EAAa,IAAJA,EAAU,KAAOsD,EAAMxP,MAAU,IAAJkM,EAAa,IAAJA,EAAU,KAClJ,OAAO0C,CACR,CACSoI,CAAmBL,GACxBM,EAAKJ,EAAG,GAAKK,EAAKL,EAAG,GAAKM,EAAKN,EAAG,GAAKO,EAAKP,EAAG,GAAKQ,EAAKR,EAAG,GAC5DS,EAAKT,EAAG,GAAKU,EAAKV,EAAG,GAAKW,EAAKX,EAAG,GAAKY,EAAKZ,EAAG,GAAKa,EAAKb,EAAG,GAC5Dc,EAAKd,EAAG,IAAKe,EAAKf,EAAG,IAAKgB,EAAKhB,EAAG,IAAKiB,EAAKjB,EAAG,IAAKkB,EAAKlB,EAAG,IA6ChEJ,EAAMjH,MAAQmH,EAEdF,EAAMuB,KA9CN,SAAoBA,EAAMC,GAEzB,IADA,IAAIC,GAAY,EAARD,EACAxgB,EAAI,EAAG0gB,EAAIH,EAAK/hB,OAAQwB,EAAI0gB,GAAID,EAAKA,IAAI,EAAKvB,EAA4B,KAAxBuB,EAAEF,EAAKvJ,WAAWhX,OAC5E,OAAQygB,CACT,EA4CAzB,EAAMtQ,IA1CN,SAAmBiS,EAAGH,GAErB,IADA,IAAIC,GAAY,EAARD,EAAWE,EAAIC,EAAEniB,OAAS,GAAIwB,EAAI,EACpCA,EAAI0gB,GAAID,EACbH,EAAGK,EAAE3gB,KAAY,IAAJygB,GACbJ,EAAGM,EAAE3gB,KAASygB,GAAK,EAAK,KACxBL,EAAGO,EAAE3gB,KAASygB,GAAK,GAAM,KACzBN,EAAGQ,EAAE3gB,KAAQygB,IAAM,IACnBP,EAAGS,EAAE3gB,MAAQigB,EAAGU,EAAE3gB,MAAQggB,EAAGW,EAAE3gB,MAAQ+f,EAAGY,EAAE3gB,MAC5C8f,EAAGa,EAAE3gB,MAAQ6f,EAAGc,EAAE3gB,MAAQ4f,EAAGe,EAAE3gB,MAAQ2f,EAAGgB,EAAE3gB,MAC5C0f,EAAGiB,EAAE3gB,MAAQyf,EAAGkB,EAAE3gB,MAAQwf,EAAGmB,EAAE3gB,MAAQkf,EAAGyB,EAAE3gB,MAE7C,IADA0gB,GAAK,GACC1gB,EAAI0gB,GAAGD,EAAKA,IAAI,EAAKvB,EAAc,KAAVuB,EAAEE,EAAE3gB,OACnC,OAAQygB,CACT,EA+BAzB,EAAMrI,IA7BN,SAAmBA,EAAK6J,GAEvB,IADA,IAAIC,GAAY,EAARD,EACAxgB,EAAI,EAAG0gB,EAAI/J,EAAInY,OAAQgC,EAAI,EAAGP,EAAI,EAAGD,EAAI0gB,IAChDlgB,EAAImW,EAAIK,WAAWhX,MACZ,IACNygB,EAAKA,IAAI,EAAKvB,EAAS,KAALuB,EAAEjgB,IACXA,EAAI,KAEbigB,GADAA,EAAKA,IAAI,EAAKvB,EAA2B,KAAvBuB,GAAK,IAAMjgB,GAAG,EAAG,SAC1B,EAAK0e,EAAsB,KAAlBuB,GAAK,IAAO,GAAFjgB,KACnBA,GAAK,OAAUA,EAAI,OAC5BA,EAAa,IAAN,KAAFA,GAAYP,EAAwB,KAApB0W,EAAIK,WAAWhX,KAIpCygB,GADAA,GADAA,GADAA,EAAKA,IAAI,EAAKvB,EAA0B,KAAtBuB,GAAK,IAAMjgB,GAAG,EAAG,QAC1B,EAAK0e,EAA2B,KAAvBuB,GAAK,IAAMjgB,GAAG,EAAG,SAC1B,EAAK0e,EAAsC,KAAlCuB,GAAK,IAAMxgB,GAAG,EAAG,IAAQ,EAAFO,IAAM,QACtC,EAAK0e,EAAsB,KAAlBuB,GAAK,IAAO,GAAFxgB,MAI5BwgB,GADAA,GADAA,EAAKA,IAAI,EAAKvB,EAA4B,KAAxBuB,GAAK,IAAMjgB,GAAG,GAAI,SAC3B,EAAK0e,EAA2B,KAAvBuB,GAAK,IAAMjgB,GAAG,EAAG,SAC1B,EAAK0e,EAAsB,KAAlBuB,GAAK,IAAO,GAAFjgB,KAG9B,OAAQigB,CACT,CAQA,EA3GiC,oBAAtBG,kBAERljB,EAAQC,GAWTD,EAAgB,CAAC,E,8BClBnB,IAAImjB,EAAa,EAAQ,MAErBC,EAAQrW,OAAOvL,UAAU0D,SACzBme,EAAiBtW,OAAOvL,UAAU6hB,eA8CtCnjB,EAAOD,QAAU,SAAiBqjB,EAAMhc,EAAUic,GAC9C,IAAKJ,EAAW7b,GACZ,MAAM,IAAIuJ,UAAU,+BAGxB,IAAI2S,EAVSC,EAWT5iB,UAAUC,QAAU,IACpB0iB,EAAWD,GAZFE,EAeDH,EAda,mBAAlBF,EAAM3hB,KAAKgiB,GAvCH,SAAsBC,EAAOpc,EAAUkc,GACtD,IAAK,IAAIlhB,EAAI,EAAGwU,EAAM4M,EAAM5iB,OAAQwB,EAAIwU,EAAKxU,IACrC+gB,EAAe5hB,KAAKiiB,EAAOphB,KACX,MAAZkhB,EACAlc,EAASoc,EAAMphB,GAAIA,EAAGohB,GAEtBpc,EAAS7F,KAAK+hB,EAAUE,EAAMphB,GAAIA,EAAGohB,GAIrD,CA4CQC,CAAaL,EAAMhc,EAAUkc,GACN,iBAATF,EA1CF,SAAuB/X,EAAQjE,EAAUkc,GACzD,IAAK,IAAIlhB,EAAI,EAAGwU,EAAMvL,EAAOzK,OAAQwB,EAAIwU,EAAKxU,IAE1B,MAAZkhB,EACAlc,EAASiE,EAAOqY,OAAOthB,GAAIA,EAAGiJ,GAE9BjE,EAAS7F,KAAK+hB,EAAUjY,EAAOqY,OAAOthB,GAAIA,EAAGiJ,EAGzD,CAkCQsY,CAAcP,EAAMhc,EAAUkc,GA/BlB,SAAuBM,EAAQxc,EAAUkc,GACzD,IAAK,IAAIO,KAAKD,EACNT,EAAe5hB,KAAKqiB,EAAQC,KACZ,MAAZP,EACAlc,EAASwc,EAAOC,GAAIA,EAAGD,GAEvBxc,EAAS7F,KAAK+hB,EAAUM,EAAOC,GAAIA,EAAGD,GAItD,CAuBQE,CAAcV,EAAMhc,EAAUkc,EAEtC,C,8BClEA,IAAIS,EAAS,EAAQ,MAGrB/jB,EAAOD,QAAU,SAAc2L,GAC9B,OAAIqY,EAAOrY,IAAsB,IAAXA,EACdA,EAEDA,EAAS,GAAK,EAAI,CAC1B,C,8BCRA,IAAIxB,EAAO,EAAQ,MACf5J,EAAa,EAAQ,MAErBoG,EAAQ,EAAQ,IAChBsd,EAAe,EAAQ,MAG3BhkB,EAAOD,QAAU,SAAuBkkB,GACvC,GAAIA,EAAKrjB,OAAS,GAAwB,mBAAZqjB,EAAK,GAClC,MAAM,IAAI3jB,EAAW,0BAEtB,OAAO0jB,EAAa9Z,EAAMxD,EAAOud,EAClC,C,8BCZA,IAAI/Z,EAAO,EAAQ,MAEfzD,EAAS,EAAQ,MACjBC,EAAQ,EAAQ,IAChBwd,EAAgB,EAAQ,MAG5BlkB,EAAOD,QAAUmkB,GAAiBha,EAAK3I,KAAKmF,EAAOD,E,wBCyCnDzG,EAAOD,QAzBP,SAAiB6U,EAAO9D,EAAK8F,EAAK+C,GAKhC,IAJA,IAAIwK,EAAc,MAARvP,EACNwP,EAAOxP,IAAU,GAAM,MACvBiC,EAAI,EAEO,IAARD,GAAW,CAKhBA,GADAC,EAAID,EAAM,IAAO,IAAOA,EAGxB,GAEEwN,EAAMA,GADND,EAAMA,EAAKrT,EAAI6I,KAAS,GACR,UACP9C,GAEXsN,GAAM,MACNC,GAAM,KACR,CAEA,OAAQD,EAAMC,GAAM,EACtB,C,8BC5CA,IAAIC,EAAe,EAAQ,MACvB1S,EAAe,EAAQ,MACvB2S,EAAe,EAAQ,MACvB3P,EAAe,EAAQ,MACvB4P,EAAe,EAAQ,MAEvBvf,EAAW6H,OAAOvL,UAAU0D,SA8GhC,SAASwf,EAAQ5D,GACf,KAAMpd,gBAAgBghB,GAAU,OAAO,IAAIA,EAAQ5D,GAEnDpd,KAAKod,QAAUjP,EAAM2G,OAAO,CAC1BmM,OAtGwB,EAuGxBC,OAnGc,EAoGdC,UAAW,MACX3P,WAAY,GACZ4P,SAAU,EACVC,SAzGwB,EA0GxB/H,GAAI,IACH8D,GAAW,CAAC,GAEf,IAAIkE,EAAMthB,KAAKod,QAEXkE,EAAIC,KAAQD,EAAI9P,WAAa,EAC/B8P,EAAI9P,YAAc8P,EAAI9P,WAGf8P,EAAIE,MAASF,EAAI9P,WAAa,GAAO8P,EAAI9P,WAAa,KAC7D8P,EAAI9P,YAAc,IAGpBxR,KAAKwL,IAAS,EACdxL,KAAKmR,IAAS,GACdnR,KAAKyhB,OAAS,EACdzhB,KAAK0hB,OAAS,GAEd1hB,KAAK+Q,KAAO,IAAIgQ,EAChB/gB,KAAK+Q,KAAK4C,UAAY,EAEtB,IAAIgO,EAASd,EAAae,aACxB5hB,KAAK+Q,KACLuQ,EAAIL,MACJK,EAAIJ,OACJI,EAAI9P,WACJ8P,EAAIF,SACJE,EAAID,UAGN,GA9IoB,IA8IhBM,EACF,MAAM,IAAIlgB,MAAM0P,EAAIwQ,IAOtB,GAJIL,EAAIO,QACNhB,EAAaiB,iBAAiB9hB,KAAK+Q,KAAMuQ,EAAIO,QAG3CP,EAAI5M,WAAY,CAClB,IAAIqN,EAaJ,GATEA,EAF4B,iBAAnBT,EAAI5M,WAENoM,EAAQxL,WAAWgM,EAAI5M,YACa,yBAAlClT,EAASzD,KAAKujB,EAAI5M,YACpB,IAAIrR,WAAWie,EAAI5M,YAEnB4M,EAAI5M,WA/JK,KAkKlBiN,EAASd,EAAamB,qBAAqBhiB,KAAK+Q,KAAMgR,IAGpD,MAAM,IAAItgB,MAAM0P,EAAIwQ,IAGtB3hB,KAAKiiB,WAAY,CACnB,CACF,CAuKA,SAASC,EAAQ3P,EAAO6K,GACtB,IAAI+E,EAAW,IAAInB,EAAQ5D,GAK3B,GAHA+E,EAAShW,KAAKoG,GAAO,GAGjB4P,EAAS3W,IAAO,MAAM2W,EAAShR,KAAOA,EAAIgR,EAAS3W,KAEvD,OAAO2W,EAASna,MAClB,CAjJAgZ,EAAQljB,UAAUqO,KAAO,SAAU5L,EAAMuO,GACvC,IAEI6S,EAAQS,EAFRrR,EAAO/Q,KAAK+Q,KACZoQ,EAAYnhB,KAAKod,QAAQ+D,UAG7B,GAAInhB,KAAKyhB,MAAS,OAAO,EAEzBW,EAAStT,MAAWA,EAAQA,GAAkB,IAATA,EAlNjB,EADA,EAsNA,iBAATvO,EAETwQ,EAAKwB,MAAQuO,EAAQxL,WAAW/U,GACC,yBAAxBiB,EAASzD,KAAKwC,GACvBwQ,EAAKwB,MAAQ,IAAIlP,WAAW9C,GAE5BwQ,EAAKwB,MAAQhS,EAGfwQ,EAAK6C,QAAU,EACf7C,EAAK0C,SAAW1C,EAAKwB,MAAMnV,OAE3B,EAAG,CAQD,GAPuB,IAAnB2T,EAAK4C,YACP5C,EAAKyB,OAAS,IAAIrE,EAAM+D,KAAKiP,GAC7BpQ,EAAK2C,SAAW,EAChB3C,EAAK4C,UAAYwN,GAlOD,KAoOlBQ,EAASd,EAAaqB,QAAQnR,EAAMqR,KArOlB,IAuOaT,EAG7B,OAFA3hB,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,GACN,EAEc,IAAnB1Q,EAAK4C,YAAsC,IAAlB5C,EAAK0C,UA9OhB,IA8OmC2O,GA1OnC,IA0OyDA,KACjD,WAApBpiB,KAAKod,QAAQ9D,GACftZ,KAAKsiB,OAAOxB,EAAQ3L,cAAchH,EAAMkH,UAAUtE,EAAKyB,OAAQzB,EAAK2C,YAEpE1T,KAAKsiB,OAAOnU,EAAMkH,UAAUtE,EAAKyB,OAAQzB,EAAK2C,WAGpD,QAAU3C,EAAK0C,SAAW,GAAwB,IAAnB1C,EAAK4C,YAlPhB,IAkPoCgO,GAGxD,OAxPoB,IAwPhBS,GACFT,EAASd,EAAa0B,WAAWviB,KAAK+Q,MACtC/Q,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,EAzPK,IA0PXE,GAxPW,IA4PhBS,IACFpiB,KAAKqiB,MA/Pa,GAgQlBtR,EAAK4C,UAAY,GACV,EAIX,EAYAqN,EAAQljB,UAAUwkB,OAAS,SAAUE,GACnCxiB,KAAK0hB,OAAOvV,KAAKqW,EACnB,EAaAxB,EAAQljB,UAAUukB,MAAQ,SAAUV,GAhSd,IAkShBA,IACsB,WAApB3hB,KAAKod,QAAQ9D,GACftZ,KAAKgI,OAAShI,KAAK0hB,OAAO3E,KAAK,IAE/B/c,KAAKgI,OAASmG,EAAMsU,cAAcziB,KAAK0hB,SAG3C1hB,KAAK0hB,OAAS,GACd1hB,KAAKwL,IAAMmW,EACX3hB,KAAKmR,IAAMnR,KAAK+Q,KAAKI,GACvB,EA+EA5U,EAAQykB,QAAUA,EAClBzkB,EAAQ2lB,QAAUA,EAClB3lB,EAAQmmB,WAxBR,SAAoBnQ,EAAO6K,GAGzB,OAFAA,EAAUA,GAAW,CAAC,GACdmE,KAAM,EACPW,EAAQ3P,EAAO6K,EACxB,EAqBA7gB,EAAQilB,KAVR,SAAcjP,EAAO6K,GAGnB,OAFAA,EAAUA,GAAW,CAAC,GACdoE,MAAO,EACRU,EAAQ3P,EAAO6K,EACxB,C,8BCvYA,IAAIuF,EAAkB,EAAQ,MAC1BC,EAAmB,EAAQ,MAE3BC,EAAiB,EAAQ,MAG7BrmB,EAAOD,QAAUomB,EACd,SAAkBG,GAEnB,OAAOH,EAAgBG,EACxB,EACEF,EACC,SAAkBE,GACnB,IAAKA,GAAmB,iBAANA,GAA+B,mBAANA,EAC1C,MAAM,IAAI3V,UAAU,2BAGrB,OAAOyV,EAAiBE,EACzB,EACED,EACC,SAAkBC,GAEnB,OAAOD,EAAeC,EACvB,EACE,I,8BCHL,IAAI3U,EAAQ,EAAQ,MAqBpB,SAAS4U,EAAKzV,GAA6B,IAAtB,IAAI8F,EAAM9F,EAAIlQ,SAAiBgW,GAAO,GAAK9F,EAAI8F,GAAO,CAAK,CAIhF,IA2DI4P,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEvDC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAEhEC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEnCC,EACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAgB3CC,EAAgB,IAAI3f,MAAM,KAC9Bsf,EAAKK,GAOL,IAAIC,EAAgB,IAAI5f,MAAM6f,IAC9BP,EAAKM,GAKL,IAAIE,EAAgB,IAAI9f,MAjBJ,KAkBpBsf,EAAKQ,GAML,IAAIC,EAAgB,IAAI/f,MAAMggB,KAC9BV,EAAKS,GAGL,IAAIE,EAAgB,IAAIjgB,MAhGJ,IAiGpBsf,EAAKW,GAGL,IAkBIC,EACAC,EACAC,EApBAC,EAAgB,IAAIrgB,MA3FJ,IAgGpB,SAASsgB,EAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElEpkB,KAAKgkB,YAAeA,EACpBhkB,KAAKikB,WAAeA,EACpBjkB,KAAKkkB,WAAeA,EACpBlkB,KAAKmkB,MAAeA,EACpBnkB,KAAKokB,WAAeA,EAGpBpkB,KAAKqkB,UAAeL,GAAeA,EAAY5mB,MACjD,CAQA,SAASknB,EAASC,EAAUC,GAC1BxkB,KAAKukB,SAAWA,EAChBvkB,KAAKykB,SAAW,EAChBzkB,KAAKwkB,UAAYA,CACnB,CAIA,SAASE,EAAOzS,GACd,OAAOA,EAAO,IAAMsR,EAAWtR,GAAQsR,EAAW,KAAOtR,IAAS,GACpE,CAOA,SAAS0S,EAAU7lB,EAAG8lB,GAGpB9lB,EAAE+lB,YAAY/lB,EAAEgmB,WAAmB,IAAN,EAC7BhmB,EAAE+lB,YAAY/lB,EAAEgmB,WAAcF,IAAM,EAAK,GAC3C,CAOA,SAASG,EAAUjmB,EAAG5B,EAAOE,GACvB0B,EAAEkmB,SApIY,GAoIW5nB,GAC3B0B,EAAEmmB,QAAW/nB,GAAS4B,EAAEkmB,SAAY,MACpCL,EAAU7lB,EAAGA,EAAEmmB,QACfnmB,EAAEmmB,OAAS/nB,GAvIK,GAuIgB4B,EAAEkmB,SAClClmB,EAAEkmB,UAAY5nB,EAxIE,KA0IhB0B,EAAEmmB,QAAW/nB,GAAS4B,EAAEkmB,SAAY,MACpClmB,EAAEkmB,UAAY5nB,EAElB,CAGA,SAAS8nB,EAAUpmB,EAAGM,EAAG+lB,GACvBJ,EAAUjmB,EAAGqmB,EAAS,EAAJ/lB,GAAiB+lB,EAAS,EAAJ/lB,EAAQ,GAClD,CAQA,SAASgmB,EAAWC,EAAMjS,GACxB,IAAIkS,EAAM,EACV,GACEA,GAAc,EAAPD,EACPA,KAAU,EACVC,IAAQ,UACClS,EAAM,GACjB,OAAOkS,IAAQ,CACjB,CA+HA,SAASC,EAAUJ,EAAMV,EAAUe,GAKjC,IAEItkB,EACAmS,EAHAoS,EAAY,IAAIhiB,MAAMiiB,IACtBL,EAAO,EAOX,IAAKnkB,EAAO,EAAGA,GAjTG,GAiTeA,IAC/BukB,EAAUvkB,GAAQmkB,EAAQA,EAAOG,EAAStkB,EAAO,IAAO,EAS1D,IAAKmS,EAAI,EAAIA,GAAKoR,EAAUpR,IAAK,CAC/B,IAAID,EAAM+R,EAAS,EAAJ9R,EAAQ,GACX,IAARD,IAEJ+R,EAAS,EAAJ9R,GAAkB+R,EAAWK,EAAUrS,KAAQA,GAItD,CACF,CA8GA,SAASuS,EAAW7mB,GAClB,IAAIuU,EAGJ,IAAKA,EAAI,EAAGA,EAlcMuS,IAkcQvS,IAAOvU,EAAE+mB,UAAc,EAAJxS,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EAhcM,GAgcQA,IAAOvU,EAAEgnB,UAAc,EAAJzS,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EA9bM,GA8bQA,IAAOvU,EAAEinB,QAAY,EAAJ1S,GAAkB,EAE7DvU,EAAE+mB,UAAUG,KAA0B,EACtClnB,EAAEmnB,QAAUnnB,EAAEonB,WAAa,EAC3BpnB,EAAEqnB,SAAWrnB,EAAEsnB,QAAU,CAC3B,CAMA,SAASC,EAAUvnB,GAEbA,EAAEkmB,SAAW,EACfL,EAAU7lB,EAAGA,EAAEmmB,QACNnmB,EAAEkmB,SAAW,IAEtBlmB,EAAE+lB,YAAY/lB,EAAEgmB,WAAahmB,EAAEmmB,QAEjCnmB,EAAEmmB,OAAS,EACXnmB,EAAEkmB,SAAW,CACf,CA6BA,SAASsB,EAAQnB,EAAM9R,EAAG9U,EAAGgoB,GAC3B,IAAIC,EAAU,EAAJnT,EACNoT,EAAU,EAAJloB,EACV,OAAQ4mB,EAAKqB,GAAgBrB,EAAKsB,IAC1BtB,EAAKqB,KAAkBrB,EAAKsB,IAAiBF,EAAMlT,IAAMkT,EAAMhoB,EACzE,CAQA,SAASmoB,EAAW5nB,EAAGqmB,EAAM9E,GAO3B,IAFA,IAAInC,EAAIpf,EAAE6nB,KAAKtG,GACXuG,EAAIvG,GAAK,EACNuG,GAAK9nB,EAAE+nB,WAERD,EAAI9nB,EAAE+nB,UACRP,EAAQnB,EAAMrmB,EAAE6nB,KAAKC,EAAI,GAAI9nB,EAAE6nB,KAAKC,GAAI9nB,EAAEynB,QAC1CK,KAGEN,EAAQnB,EAAMjH,EAAGpf,EAAE6nB,KAAKC,GAAI9nB,EAAEynB,SAGlCznB,EAAE6nB,KAAKtG,GAAKvhB,EAAE6nB,KAAKC,GACnBvG,EAAIuG,EAGJA,IAAM,EAER9nB,EAAE6nB,KAAKtG,GAAKnC,CACd,CASA,SAAS4I,EAAehoB,EAAGioB,EAAOC,GAKhC,IAAI/U,EACAgV,EAEA5B,EACAzV,EAFAsX,EAAK,EAIT,GAAmB,IAAfpoB,EAAEqnB,SACJ,GACElU,EAAQnT,EAAE+lB,YAAY/lB,EAAEqoB,MAAa,EAALD,IAAW,EAAMpoB,EAAE+lB,YAAY/lB,EAAEqoB,MAAa,EAALD,EAAS,GAClFD,EAAKnoB,EAAE+lB,YAAY/lB,EAAEsoB,MAAQF,GAC7BA,IAEa,IAATjV,EACFiT,EAAUpmB,EAAGmoB,EAAIF,IAKjB7B,EAAUpmB,GADVumB,EAAO7B,EAAayD,IA7jBR,IA8jBmB,EAAGF,GAEpB,KADdnX,EAAQoT,EAAYqC,KAGlBN,EAAUjmB,EADVmoB,GAAMvD,EAAY2B,GACDzV,GAMnBsV,EAAUpmB,EAHVumB,EAAOX,IADPzS,GAImB+U,GAEL,KADdpX,EAAQqT,EAAYoC,KAGlBN,EAAUjmB,EADVmT,GAAQ6R,EAAUuB,GACCzV,UAQhBsX,EAAKpoB,EAAEqnB,UAGlBjB,EAAUpmB,EA1jBM,IA0jBQioB,EAC1B,CAWA,SAASM,EAAWvoB,EAAGrB,GAIrB,IAII4V,EAAG9U,EAEH+oB,EANAnC,EAAW1nB,EAAK8mB,SAChBgD,EAAW9pB,EAAK+mB,UAAUR,YAC1BK,EAAY5mB,EAAK+mB,UAAUH,UAC3BF,EAAW1mB,EAAK+mB,UAAUL,MAE1BM,GAAY,EAUhB,IAHA3lB,EAAE+nB,SAAW,EACb/nB,EAAE0oB,SAxmBgB,IA0mBbnU,EAAI,EAAGA,EAAI8Q,EAAO9Q,IACQ,IAAzB8R,EAAS,EAAJ9R,IACPvU,EAAE6nB,OAAO7nB,EAAE+nB,UAAYpC,EAAWpR,EAClCvU,EAAEynB,MAAMlT,GAAK,GAGb8R,EAAS,EAAJ9R,EAAQ,GAAa,EAS9B,KAAOvU,EAAE+nB,SAAW,GAElB1B,EAAY,GADZmC,EAAOxoB,EAAE6nB,OAAO7nB,EAAE+nB,UAAapC,EAAW,IAAMA,EAAW,IACjC,EAC1B3lB,EAAEynB,MAAMe,GAAQ,EAChBxoB,EAAEmnB,UAEE5B,IACFvlB,EAAEonB,YAAcqB,EAAa,EAAPD,EAAW,IASrC,IALA7pB,EAAKgnB,SAAWA,EAKXpR,EAAKvU,EAAE+nB,UAAY,EAAcxT,GAAK,EAAGA,IAAOqT,EAAW5nB,EAAGqmB,EAAM9R,GAKzEiU,EAAOnD,EACP,GAGE9Q,EAAIvU,EAAE6nB,KAAK,GACX7nB,EAAE6nB,KAAK,GAAiB7nB,EAAE6nB,KAAK7nB,EAAE+nB,YACjCH,EAAW5nB,EAAGqmB,EAAM,GAGpB5mB,EAAIO,EAAE6nB,KAAK,GAEX7nB,EAAE6nB,OAAO7nB,EAAE0oB,UAAYnU,EACvBvU,EAAE6nB,OAAO7nB,EAAE0oB,UAAYjpB,EAGvB4mB,EAAY,EAAPmC,GAAqBnC,EAAS,EAAJ9R,GAAkB8R,EAAS,EAAJ5mB,GACtDO,EAAEynB,MAAMe,IAASxoB,EAAEynB,MAAMlT,IAAMvU,EAAEynB,MAAMhoB,GAAKO,EAAEynB,MAAMlT,GAAKvU,EAAEynB,MAAMhoB,IAAM,EACvE4mB,EAAS,EAAJ9R,EAAQ,GAAa8R,EAAS,EAAJ5mB,EAAQ,GAAa+oB,EAGpDxoB,EAAE6nB,KAAK,GAAiBW,IACxBZ,EAAW5nB,EAAGqmB,EAAM,SAEbrmB,EAAE+nB,UAAY,GAEvB/nB,EAAE6nB,OAAO7nB,EAAE0oB,UAAY1oB,EAAE6nB,KAAK,GAjehC,SAAoB7nB,EAAGrB,GAIrB,IAOIgqB,EACApU,EAAG9U,EACH2C,EACAwmB,EACAC,EAXAxC,EAAkB1nB,EAAK8mB,SACvBE,EAAkBhnB,EAAKgnB,SACvB8C,EAAkB9pB,EAAK+mB,UAAUR,YACjCK,EAAkB5mB,EAAK+mB,UAAUH,UACjCzU,EAAkBnS,EAAK+mB,UAAUP,WACjC7M,EAAkB3Z,EAAK+mB,UAAUN,WACjCE,EAAkB3mB,EAAK+mB,UAAUJ,WAMjCwD,EAAW,EAEf,IAAK1mB,EAAO,EAAGA,GArNG,GAqNeA,IAC/BpC,EAAE0mB,SAAStkB,GAAQ,EAQrB,IAFAikB,EAA0B,EAArBrmB,EAAE6nB,KAAK7nB,EAAE0oB,UAAgB,GAAa,EAEtCC,EAAI3oB,EAAE0oB,SAAW,EAAGC,EAjOP,IAiOsBA,KAEtCvmB,EAAOikB,EAA+B,EAA1BA,EAAS,GADrB9R,EAAIvU,EAAE6nB,KAAKc,IACc,GAAiB,GAAa,GAC5CrD,IACTljB,EAAOkjB,EACPwD,KAEFzC,EAAS,EAAJ9R,EAAQ,GAAanS,EAGtBmS,EAAIoR,IAER3lB,EAAE0mB,SAAStkB,KACXwmB,EAAQ,EACJrU,GAAK+D,IACPsQ,EAAQ9X,EAAMyD,EAAI+D,IAEpBuQ,EAAIxC,EAAS,EAAJ9R,GACTvU,EAAEmnB,SAAW0B,GAAKzmB,EAAOwmB,GACrBrD,IACFvlB,EAAEonB,YAAcyB,GAAKJ,EAAU,EAAJlU,EAAQ,GAAaqU,KAGpD,GAAiB,IAAbE,EAAJ,CAMA,EAAG,CAED,IADA1mB,EAAOkjB,EAAa,EACQ,IAArBtlB,EAAE0mB,SAAStkB,IAAeA,IACjCpC,EAAE0mB,SAAStkB,KACXpC,EAAE0mB,SAAStkB,EAAO,IAAM,EACxBpC,EAAE0mB,SAASpB,KAIXwD,GAAY,CACd,OAASA,EAAW,GAOpB,IAAK1mB,EAAOkjB,EAAqB,IAATljB,EAAYA,IAElC,IADAmS,EAAIvU,EAAE0mB,SAAStkB,GACF,IAANmS,IACL9U,EAAIO,EAAE6nB,OAAOc,IACLhD,IACJU,EAAS,EAAJ5mB,EAAQ,KAAe2C,IAE9BpC,EAAEmnB,UAAY/kB,EAAOikB,EAAS,EAAJ5mB,EAAQ,IAAc4mB,EAAS,EAAJ5mB,GACrD4mB,EAAS,EAAJ5mB,EAAQ,GAAa2C,GAE5BmS,IAjC0B,CAoChC,CAgZEwU,CAAW/oB,EAAGrB,GAGd8nB,EAAUJ,EAAMV,EAAU3lB,EAAE0mB,SAC9B,CAOA,SAASsC,EAAUhpB,EAAGqmB,EAAMV,GAK1B,IAAIpR,EAEA0U,EADAC,GAAW,EAGXC,EAAU9C,EAAK,GAEf7N,EAAQ,EACR4Q,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAEdhD,EAAsB,GAAhBV,EAAW,GAAS,GAAa,MAElCpR,EAAI,EAAGA,GAAKoR,EAAUpR,IACzB0U,EAASE,EACTA,EAAU9C,EAAe,GAAT9R,EAAI,GAAS,KAEvBiE,EAAQ4Q,GAAaH,IAAWE,IAG3B3Q,EAAQ6Q,EACjBrpB,EAAEinB,QAAiB,EAATgC,IAAwBzQ,EAEd,IAAXyQ,GAELA,IAAWC,GAAWlpB,EAAEinB,QAAiB,EAATgC,KACpCjpB,EAAEinB,QAAQqC,OAED9Q,GAAS,GAClBxY,EAAEinB,QAAQsC,MAGVvpB,EAAEinB,QAAQuC,MAGZhR,EAAQ,EACR0Q,EAAUD,EAEM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,CAOA,SAASI,EAAUzpB,EAAGqmB,EAAMV,GAK1B,IAAIpR,EAEA0U,EADAC,GAAW,EAGXC,EAAU9C,EAAK,GAEf7N,EAAQ,EACR4Q,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAGT9U,EAAI,EAAGA,GAAKoR,EAAUpR,IAIzB,GAHA0U,EAASE,EACTA,EAAU9C,EAAe,GAAT9R,EAAI,GAAS,OAEvBiE,EAAQ4Q,GAAaH,IAAWE,GAAtC,CAGO,GAAI3Q,EAAQ6Q,EACjB,GAAKjD,EAAUpmB,EAAGipB,EAAQjpB,EAAEinB,eAA+B,MAAVzO,QAE7B,IAAXyQ,GACLA,IAAWC,IACb9C,EAAUpmB,EAAGipB,EAAQjpB,EAAEinB,SACvBzO,KAGF4N,EAAUpmB,EA1wBE,GA0wBUA,EAAEinB,SACxBhB,EAAUjmB,EAAGwY,EAAQ,EAAG,IAEfA,GAAS,IAClB4N,EAAUpmB,EA3wBE,GA2wBYA,EAAEinB,SAC1BhB,EAAUjmB,EAAGwY,EAAQ,EAAG,KAGxB4N,EAAUpmB,EA5wBE,GA4wBcA,EAAEinB,SAC5BhB,EAAUjmB,EAAGwY,EAAQ,GAAI,IAG3BA,EAAQ,EACR0Q,EAAUD,EACM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,EAdd,CAiBJ,CAnuBApF,EAAKe,GAu1BL,IAAI0E,GAAmB,EA4BvB,SAASC,EAAiB3pB,EAAGwO,EAAKob,EAAY3gB,GAM5Cgd,EAAUjmB,EAAG,GAAuBiJ,EAAO,EAAI,GAAI,GAzfrD,SAAoBjJ,EAAGwO,EAAK8F,GAM1BiT,EAAUvnB,GAGR6lB,EAAU7lB,EAAGsU,GACbuR,EAAU7lB,GAAIsU,GAKhBjF,EAAMgE,SAASrT,EAAE+lB,YAAa/lB,EAAE4Q,OAAQpC,EAAK8F,EAAKtU,EAAEgmB,SACpDhmB,EAAEgmB,SAAW1R,CACf,CAyeEuV,CAAW7pB,EAAGwO,EAAKob,EACrB,CAmKAnsB,EAAQqsB,SAlMR,SAAkB9pB,GAGX0pB,IAxmBP,WACE,IAAInV,EACAnS,EACA9D,EACAioB,EACApT,EACAuT,EAAW,IAAI/hB,MAAMiiB,IAiBzB,IADAtoB,EAAS,EACJioB,EAAO,EAAGA,EAAOwD,GAAkBxD,IAEtC,IADA3B,EAAY2B,GAAQjoB,EACfiW,EAAI,EAAGA,EAAK,GAAK2P,EAAYqC,GAAQhS,IACxCmQ,EAAapmB,KAAYioB,EAY7B,IAJA7B,EAAapmB,EAAS,GAAKioB,EAG3BpT,EAAO,EACFoT,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAvB,EAAUuB,GAAQpT,EACboB,EAAI,EAAGA,EAAK,GAAK4P,EAAYoC,GAAQhS,IACxCkQ,EAAWtR,KAAUoT,EAKzB,IADApT,IAAS,EACFoT,EAjYW,GAiYKA,IAErB,IADAvB,EAAUuB,GAAQpT,GAAQ,EACrBoB,EAAI,EAAGA,EAAK,GAAM4P,EAAYoC,GAAQ,EAAKhS,IAC9CkQ,EAAW,IAAMtR,KAAUoT,EAM/B,IAAKnkB,EAAO,EAAGA,GAjYG,GAiYeA,IAC/BskB,EAAStkB,GAAQ,EAInB,IADAmS,EAAI,EACGA,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KAEX,KAAOnS,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KAEX,KAAOnS,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KAEX,KAAOnS,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KASX,IAHAD,EAAUnC,EAAc0F,IAAatD,GAGhCnS,EAAI,EAAGA,EA1aM,GA0aOA,IACvBgQ,EAAiB,EAAJhQ,EAAQ,GAAa,EAClCgQ,EAAiB,EAAJhQ,GAAkB+R,EAAW/R,EAAG,GAI/CsQ,EAAgB,IAAII,EAAeX,EAAcJ,EAAa4C,IAnb5CA,IAYA,IAwalBhC,EAAgB,IAAIG,EAAeV,EAAcJ,EAAa,EAjb5C,GASA,IAyalBY,EAAiB,IAAIE,EAAe,IAAItgB,MAAM,GAAIyf,EAAc,EA/a9C,GAiBF,EAialB,CAugBI6F,GACAP,GAAmB,GAGrB1pB,EAAEkqB,OAAU,IAAI1E,EAASxlB,EAAE+mB,UAAWlC,GACtC7kB,EAAEmqB,OAAU,IAAI3E,EAASxlB,EAAEgnB,UAAWlC,GACtC9kB,EAAEoqB,QAAU,IAAI5E,EAASxlB,EAAEinB,QAASlC,GAEpC/kB,EAAEmmB,OAAS,EACXnmB,EAAEkmB,SAAW,EAGbW,EAAW7mB,EACb,EAkLAvC,EAAQksB,iBAAmBA,EAC3BlsB,EAAQ4sB,gBAnJR,SAAyBrqB,EAAGwO,EAAKob,EAAY3gB,GAM3C,IAAIqhB,EAAUC,EACVC,EAAc,EAGdxqB,EAAEmiB,MAAQ,GAnhCY,IAshCpBniB,EAAEiS,KAAKuD,YACTxV,EAAEiS,KAAKuD,UArGb,SAA0BxV,GAKxB,IACIuU,EADAkW,EAAa,WAIjB,IAAKlW,EAAI,EAAGA,GAAK,GAAIA,IAAKkW,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhCzqB,EAAE+mB,UAAc,EAAJxS,GACnC,OAh8BsB,EAq8B1B,GAAoC,IAAhCvU,EAAE+mB,UAAU,KAA0D,IAAjC/mB,EAAE+mB,UAAU,KAChB,IAAjC/mB,EAAE+mB,UAAU,IACd,OAt8BwB,EAw8B1B,IAAKxS,EAAI,GAAIA,EA56BK,IA46BSA,IACzB,GAAoC,IAAhCvU,EAAE+mB,UAAc,EAAJxS,GACd,OA18BsB,EAi9B1B,OAl9B0B,CAm9B5B,CAuEyBmW,CAAiB1qB,IAItCuoB,EAAWvoB,EAAGA,EAAEkqB,QAIhB3B,EAAWvoB,EAAGA,EAAEmqB,QAUhBK,EAnMJ,SAAuBxqB,GACrB,IAAIwqB,EAgBJ,IAbAxB,EAAUhpB,EAAGA,EAAE+mB,UAAW/mB,EAAEkqB,OAAOvE,UACnCqD,EAAUhpB,EAAGA,EAAEgnB,UAAWhnB,EAAEmqB,OAAOxE,UAGnC4C,EAAWvoB,EAAGA,EAAEoqB,SASXI,EAAcG,GAAcH,GAAe,GACW,IAArDxqB,EAAEinB,QAAgC,EAAxB5C,EAASmG,GAAmB,GADOA,KAUnD,OAJAxqB,EAAEmnB,SAAW,GAAKqD,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,CAuKkBI,CAAc5qB,GAG5BsqB,EAAYtqB,EAAEmnB,QAAU,EAAI,IAAO,GACnCoD,EAAevqB,EAAEonB,WAAa,EAAI,IAAO,IAMtBkD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcX,EAAa,EAGnCA,EAAa,GAAKU,IAAuB,IAAT9b,EASnCmb,EAAiB3pB,EAAGwO,EAAKob,EAAY3gB,GA1kCb,IA4kCfjJ,EAAEuiB,UAAwBgI,IAAgBD,GAEnDrE,EAAUjmB,EAAG,GAAuBiJ,EAAO,EAAI,GAAI,GACnD+e,EAAehoB,EAAGskB,EAAcC,KAGhC0B,EAAUjmB,EAAG,GAAoBiJ,EAAO,EAAI,GAAI,GAjMpD,SAAwBjJ,EAAG6qB,EAAQC,EAAQC,GAIzC,IAAIC,EASJ,IAHA/E,EAAUjmB,EAAG6qB,EAAS,IAAK,GAC3B5E,EAAUjmB,EAAG8qB,EAAS,EAAK,GAC3B7E,EAAUjmB,EAAG+qB,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B/E,EAAUjmB,EAAGA,EAAEinB,QAAyB,EAAjB5C,EAAS2G,GAAY,GAAY,GAI1DvB,EAAUzpB,EAAGA,EAAE+mB,UAAW8D,EAAS,GAGnCpB,EAAUzpB,EAAGA,EAAEgnB,UAAW8D,EAAS,EAErC,CA0KIG,CAAejrB,EAAGA,EAAEkqB,OAAOvE,SAAW,EAAG3lB,EAAEmqB,OAAOxE,SAAW,EAAG6E,EAAc,GAC9ExC,EAAehoB,EAAGA,EAAE+mB,UAAW/mB,EAAEgnB,YAMnCH,EAAW7mB,GAEPiJ,GACFse,EAAUvnB,EAId,EAmEAvC,EAAQytB,UA7DR,SAAmBlrB,EAAGmT,EAAMgV,GAmD1B,OA5CAnoB,EAAE+lB,YAAY/lB,EAAEqoB,MAAqB,EAAbroB,EAAEqnB,UAAqBlU,IAAS,EAAK,IAC7DnT,EAAE+lB,YAAY/lB,EAAEqoB,MAAqB,EAAbroB,EAAEqnB,SAAe,GAAY,IAAPlU,EAE9CnT,EAAE+lB,YAAY/lB,EAAEsoB,MAAQtoB,EAAEqnB,UAAiB,IAALc,EACtCnoB,EAAEqnB,WAEW,IAATlU,EAEFnT,EAAE+mB,UAAe,EAALoB,MAEZnoB,EAAEsnB,UAEFnU,IAKAnT,EAAE+mB,UAA8C,GAAnCrC,EAAayD,GA9lCV,IA8lC2B,MAC3CnoB,EAAEgnB,UAAyB,EAAfpB,EAAOzS,OA0BbnT,EAAEqnB,WAAarnB,EAAEmrB,YAAc,CAKzC,EAMA1tB,EAAQ2tB,UAhKR,SAAmBprB,GACjBimB,EAAUjmB,EAAGqrB,EAAmB,GAChCjF,EAAUpmB,EAz8BM,IAy8BQskB,GA5yB1B,SAAkBtkB,GACG,KAAfA,EAAEkmB,UACJL,EAAU7lB,EAAGA,EAAEmmB,QACfnmB,EAAEmmB,OAAS,EACXnmB,EAAEkmB,SAAW,GAEJlmB,EAAEkmB,UAAY,IACvBlmB,EAAE+lB,YAAY/lB,EAAEgmB,WAAwB,IAAXhmB,EAAEmmB,OAC/BnmB,EAAEmmB,SAAW,EACbnmB,EAAEkmB,UAAY,EAElB,CAkyBEoF,CAAStrB,EACX,C,8BC9hCA,IAAIurB,EAAW,EAAQ,MACnBxqB,EAAO,EAAQ,KACfF,EAAS,eAET2qB,EAAI,CACP,WAAY,YAAY,YAAgB,WAGrCC,EAAI,IAAI9mB,MAAM,IAElB,SAAS+mB,IACRxqB,KAAKyqB,OACLzqB,KAAK0qB,GAAKH,EAEV1qB,EAAK9B,KAAKiC,KAAM,GAAI,GACrB,CAcA,SAAS2qB,EAAMC,GACd,OAAQA,GAAO,EAAMA,IAAQ,EAC9B,CAEA,SAASC,EAAMD,GACd,OAAQA,GAAO,EAAMA,IAAQ,EAC9B,CAEA,SAASE,EAAOF,GACf,OAAQA,GAAO,GAAOA,IAAQ,CAC/B,CAEA,SAASG,EAAGjsB,EAAGksB,EAAG5rB,EAAGP,GACpB,OAAU,IAANC,EACKksB,EAAI5rB,GAAO4rB,EAAInsB,EAEd,IAANC,EACKksB,EAAI5rB,EAAM4rB,EAAInsB,EAAMO,EAAIP,EAE1BmsB,EAAI5rB,EAAIP,CAChB,CAhCAwrB,EAASG,EAAM3qB,GAEf2qB,EAAK1sB,UAAU2sB,KAAO,WAOrB,OANAzqB,KAAKirB,GAAK,WACVjrB,KAAKkrB,GAAK,WACVlrB,KAAKmrB,GAAK,WACVnrB,KAAKorB,GAAK,UACVprB,KAAKqrB,GAAK,WAEHrrB,IACR,EAwBAwqB,EAAK1sB,UAAUgD,QAAU,SAAUwqB,GASlC,IARA,IAAI1G,EAAI5kB,KAAK0qB,GAETa,EAAc,EAAVvrB,KAAKirB,GACTD,EAAc,EAAVhrB,KAAKkrB,GACT9rB,EAAc,EAAVY,KAAKmrB,GACTtsB,EAAc,EAAVmB,KAAKorB,GACT9sB,EAAc,EAAV0B,KAAKqrB,GAEJzsB,EAAI,EAAGA,EAAI,KAAMA,EACzBgmB,EAAEhmB,GAAK0sB,EAAEE,YAAgB,EAAJ5sB,GAEtB,KAAOA,EAAI,KAAMA,EAChBgmB,EAAEhmB,GAAK+rB,EAAM/F,EAAEhmB,EAAI,GAAKgmB,EAAEhmB,EAAI,GAAKgmB,EAAEhmB,EAAI,IAAMgmB,EAAEhmB,EAAI,KAGtD,IAAK,IAAIgoB,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC5B,IAAI9nB,KAAO8nB,EAAI,IACX6E,EAAKZ,EAAMU,GAAKR,EAAGjsB,EAAGksB,EAAG5rB,EAAGP,GAAKP,EAAIsmB,EAAEgC,GAAK0D,EAAExrB,GAAM,EAExDR,EAAIO,EACJA,EAAIO,EACJA,EAAI0rB,EAAOE,GACXA,EAAIO,EACJA,EAAIE,CACL,CAEAzrB,KAAKirB,GAAMM,EAAIvrB,KAAKirB,GAAM,EAC1BjrB,KAAKkrB,GAAMF,EAAIhrB,KAAKkrB,GAAM,EAC1BlrB,KAAKmrB,GAAM/rB,EAAIY,KAAKmrB,GAAM,EAC1BnrB,KAAKorB,GAAMvsB,EAAImB,KAAKorB,GAAM,EAC1BprB,KAAKqrB,GAAM/sB,EAAI0B,KAAKqrB,GAAM,CAC3B,EAEAb,EAAK1sB,UAAUyD,MAAQ,WACtB,IAAImqB,EAAI/rB,EAAOsN,YAAY,IAQ3B,OANAye,EAAEC,aAAuB,EAAV3rB,KAAKirB,GAAQ,GAC5BS,EAAEC,aAAuB,EAAV3rB,KAAKkrB,GAAQ,GAC5BQ,EAAEC,aAAuB,EAAV3rB,KAAKmrB,GAAQ,GAC5BO,EAAEC,aAAuB,EAAV3rB,KAAKorB,GAAQ,IAC5BM,EAAEC,aAAuB,EAAV3rB,KAAKqrB,GAAQ,IAErBK,CACR,EAEAlvB,EAAOD,QAAUiuB,C,8BC1GjB,IAAIoB,EAA+B,oBAAXjoB,QAA0BA,OAC9CkoB,EAAgB,EAAQ,MAG5BrvB,EAAOD,QAAU,WAChB,MAA0B,mBAAfqvB,GACW,mBAAXjoB,QACsB,iBAAtBioB,EAAW,QACO,iBAAlBjoB,OAAO,QAEXkoB,GACR,C,8BCXA,IAAI/uB,EAAa,EAAQ,MAKrBgvB,EAHY,EAAQ,KAGAC,CAAU,+BAA+B,GAE7DC,EAAe,EAAQ,MAI3BxvB,EAAOD,QAAUuvB,GAAqB,SAA0B/L,GAC/D,IAAKiM,EAAajM,GACjB,MAAM,IAAIjjB,EAAW,qBAEtB,OAAOijB,EAAE9hB,MACV,C,wBC4BAzB,EAAOD,QAzBP,WAEEyD,KAAKuS,MAAQ,KACbvS,KAAK4T,QAAU,EAEf5T,KAAKyT,SAAW,EAEhBzT,KAAKiR,SAAW,EAEhBjR,KAAKwS,OAAS,KACdxS,KAAK0T,SAAW,EAEhB1T,KAAK2T,UAAY,EAEjB3T,KAAKkR,UAAY,EAEjBlR,KAAKmR,IAAM,GAEXnR,KAAKgR,MAAQ,KAEbhR,KAAKsU,UAAY,EAEjBtU,KAAKoR,MAAQ,CACf,C,wBCzCA5U,EAAOD,QAAU4I,OAAO5F,OAAS,SAAegsB,GAC/C,OAAOA,GAAMA,CACd,C,WCLA,IAAI/pB,EAAW,CAAC,EAAEA,SAElBhF,EAAOD,QAAUkH,MAAMkH,SAAW,SAAUshB,GAC1C,MAA6B,kBAAtBzqB,EAASzD,KAAKkuB,EACvB,C,wBCiBAzvB,EAAOD,QAAU,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,uB,wBCWV,IAAI2vB,EAfJ,WAGE,IAFA,IAAI9sB,EAAGuX,EAAQ,GAENtD,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BjU,EAAIiU,EACJ,IAAK,IAAIgN,EAAI,EAAGA,EAAI,EAAGA,IACrBjhB,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnDuX,EAAMtD,GAAKjU,CACb,CAEA,OAAOuX,CACT,CAGewV,GAiBf3vB,EAAOD,QAdP,SAAe6vB,EAAK9e,EAAK8F,EAAK+C,GAC5B,IAAIsV,EAAIS,EACJna,EAAMoE,EAAM/C,EAEhBgZ,IAAQ,EAER,IAAK,IAAIxtB,EAAIuX,EAAKvX,EAAImT,EAAKnT,IACzBwtB,EAAOA,IAAQ,EAAKX,EAAmB,KAAhBW,EAAM9e,EAAI1O,KAGnC,OAAgB,EAARwtB,CACV,C,wBCpDA5vB,EAAOD,QAAU8vB,Q,8BCDjB,IAAI1sB,EAAS,cACTgL,EAAU,EAAQ,MAClB2hB,EAAmB,EAAQ,MAE3BC,EAAS7oB,YAAY6oB,QAAU,SAAgBvvB,GAClD,IAEC,OADAsvB,EAAiBtvB,IACV,CACR,CAAE,MAAOsB,GACR,OAAO,CACR,CACD,EAEIkuB,EAAsC,oBAAfnpB,WACvBopB,EAAwC,oBAAhB/oB,aACF,oBAAfL,WACPqpB,EAAqBD,IAAmB9sB,EAAO7B,qBAAqBuF,YAAc1D,EAAOgtB,qBAE7FnwB,EAAOD,QAAU,SAAkBgE,EAAM8M,GAKxC,GAAI9M,aAAgBZ,EACnB,OAAOY,EAGR,GAAoB,iBAATA,EACV,OAAOZ,EAAOqN,KAAKzM,EAAM8M,GAO1B,GAAIof,GAAkBF,EAAOhsB,GAAO,CAEnC,GAAwB,IAApBA,EAAKqsB,WACR,OAAOjtB,EAAOO,MAAM,GAIrB,GAAIwsB,EAAoB,CACvB,IAAIpH,EAAM3lB,EAAOqN,KAAKzM,EAAKtC,OAAQsC,EAAKssB,WAAYtsB,EAAKqsB,YAKzD,GAAItH,EAAIsH,aAAersB,EAAKqsB,WAC3B,OAAOtH,CAET,CAGA,IAAIwH,EAAQvsB,aAAgB8C,WAAa9C,EAAO,IAAI8C,WAAW9C,EAAKtC,OAAQsC,EAAKssB,WAAYtsB,EAAKqsB,YAC9F5kB,EAASrI,EAAOqN,KAAK8f,GAMzB,GAAI9kB,EAAO5K,SAAWmD,EAAKqsB,WAC1B,OAAO5kB,CAET,CAMA,GAAIwkB,GAAiBjsB,aAAgB8C,WACpC,OAAO1D,EAAOqN,KAAKzM,GAGpB,IAAIwsB,EAAQpiB,EAAQpK,GACpB,GAAIwsB,EACH,IAAK,IAAInuB,EAAI,EAAGA,EAAI2B,EAAKnD,OAAQwB,GAAK,EAAG,CACxC,IAAImhB,EAAIxf,EAAK3B,GACb,GACc,iBAANmhB,GACJA,EAAI,GACJA,EAAI,OACFA,IAAMA,EAEX,MAAM,IAAIvF,WAAW,kDAEvB,CAQD,GACCuS,GACCptB,EAAOqtB,SAASzsB,IACZA,EAAKoZ,aACgC,mBAA9BpZ,EAAKoZ,YAAYqT,UACxBzsB,EAAKoZ,YAAYqT,SAASzsB,GAG/B,OAAOZ,EAAOqN,KAAKzM,GAGpB,MAAM,IAAI4M,UAAU,yFACrB,C,8BC1GA,IAAI8f,EAAkB,EAAQ,MAG9BzwB,EAAOD,QAAU,SAAsBW,GACtC,QAAS+vB,EAAgB/vB,EAC1B,C,8BCLA,IAAIif,EAAU,EAAQ,MAClB+Q,EAAuB,EAAQ,MAC/BC,EAAW,EAAQ,KACnBpB,EAAY,EAAQ,MACpBqB,EAAO,EAAQ,MACftqB,EAAW,EAAQ,MAEnBuqB,EAAYtB,EAAU,6BACtBuB,EAAiB,EAAQ,KAAR,GAEjBC,EAA0B,oBAAfC,WAA6B,EAAAD,EAASC,WACjDC,EAAcP,IAEdQ,EAAS3B,EAAU,0BAGnB4B,EAAW5B,EAAU,2BAA2B,IAAS,SAAiB/L,EAAO9iB,GACpF,IAAK,IAAI0B,EAAI,EAAGA,EAAIohB,EAAM5iB,OAAQwB,GAAK,EACtC,GAAIohB,EAAMphB,KAAO1B,EAChB,OAAO0B,EAGT,OAAQ,CACT,EAII8d,EAAQ,CAAEnZ,UAAW,MAExB4Y,EAAQsR,EADLH,GAAkBF,GAAQtqB,EACR,SAAU8qB,GAC9B,IAAI3B,EAAM,IAAIsB,EAAEK,GAChB,GAAIjqB,OAAOkqB,eAAe5B,GAAOnpB,EAAU,CAC1C,IAAIgrB,EAAQhrB,EAASmpB,GAEjB/d,EAAakf,EAAKU,EAAOnqB,OAAOkqB,aACpC,IAAK3f,GAAc4f,EAAO,CACzB,IAAIC,EAAajrB,EAASgrB,GAE1B5f,EAAakf,EAAKW,EAAYpqB,OAAOkqB,YACtC,CAEAnR,EAAM,IAAMkR,GAAcT,EAASjf,EAAWvL,IAC/C,CACD,EAEqB,SAAUirB,GAC9B,IAAI3B,EAAM,IAAIsB,EAAEK,GACZrnB,EAAK0lB,EAAI9kB,OAAS8kB,EAAI+B,IACtBznB,IACHmW,EACkD,IAAMkR,GAGvDT,EAAS5mB,GAGZ,GA0CD/J,EAAOD,QAAU,SAAyBW,GACzC,IAAKA,GAA0B,iBAAVA,EAAsB,OAAO,EAClD,IAAKowB,EAAgB,CAEpB,IAAIW,EAAMP,EAAOL,EAAUnwB,GAAQ,GAAI,GACvC,OAAIywB,EAASF,EAAaQ,IAAQ,EAC1BA,EAEI,WAARA,GA1BU,SAAsB/wB,GACU,IAAIgxB,GAAQ,EAa3D,OAZA/R,EACiE,EACiB,SAAUgS,EAAQ7nB,GAClG,IAAK4nB,EACJ,IAECC,EAAOjxB,GACPgxB,EAAmDR,EAAOpnB,EAAM,EACjE,CAAE,MAAOhI,GAAU,CAErB,GAEM4vB,CACR,CAeSE,CAAUlxB,EAClB,CACA,OAAKkwB,EApDe,SAA2BlwB,GACK,IAAIgxB,GAAQ,EAehE,OAdA/R,EACkE,EAEjE,SAAUgS,EAAQP,GACjB,IAAKM,EACJ,IAEK,IAAMC,EAAOjxB,KAAW0wB,IAC3BM,EAAmDR,EAAOE,EAAY,GAExE,CAAE,MAAOtvB,GAAU,CAErB,GAEM4vB,CACR,CAoCQG,CAAenxB,GADF,IAErB,C,8BCjHA,IAAIqF,EAAQ,EAAQ,MAEpB,GAAIA,EACH,IACCA,EAAM,GAAI,SACX,CAAE,MAAOjE,GAERiE,EAAQ,IACT,CAGD/F,EAAOD,QAAUgG,C,wBCXjB/F,EAAOD,QAAU0C,KAAKC,G,wBCAtB1C,EAAOD,QAAU0C,KAAKiD,G,wBCAtB1F,EAAOD,QAAU8M,OAAO4E,wB,8BCDxB,IAAIqgB,EAAe,EAAQ,KAEvBzlB,EAAgB,EAAQ,MAGxB8kB,EAAW9kB,EAAc,CAACylB,EAAa,gCAG3C9xB,EAAOD,QAAU,SAA4B+J,EAAMmB,GAGlD,IAAIc,EAA2E+lB,EAAahoB,IAAQmB,GACpG,MAAyB,mBAAdc,GAA4BolB,EAASrnB,EAAM,gBAAkB,EAChEuC,EAAmC,CAAEN,IAEtCA,CACR,C,wBCfA/L,EAAOD,QAAU,CAChB,eACA,eACA,eACA,YACA,aACA,aACA,aACA,oBACA,cACA,cACA,gBACA,iB,WCf4B,mBAAlB8M,OAAOK,OAEhBlN,EAAOD,QAAU,SAAkBgyB,EAAMC,GACnCA,IACFD,EAAKE,OAASD,EACdD,EAAKzwB,UAAYuL,OAAOK,OAAO8kB,EAAU1wB,UAAW,CAClD6b,YAAa,CACXzc,MAAOqxB,EACP5wB,YAAY,EACZC,UAAU,EACVF,cAAc,KAItB,EAGAlB,EAAOD,QAAU,SAAkBgyB,EAAMC,GACvC,GAAIA,EAAW,CACbD,EAAKE,OAASD,EACd,IAAIE,EAAW,WAAa,EAC5BA,EAAS5wB,UAAY0wB,EAAU1wB,UAC/BywB,EAAKzwB,UAAY,IAAI4wB,EACrBH,EAAKzwB,UAAU6b,YAAc4U,CAC/B,CACF,C,8BCvBF,IAAII,EAAiB,EAAQ,MAE7BnyB,EAAOD,QAAUsB,SAASC,UAAU4I,MAAQioB,C,8BCF5C,IAAIL,EAAe,EAAQ,KACvB7xB,EAAS,EAAQ,IACjBmyB,EAAiB,EAAQ,IAAR,GACjBxB,EAAO,EAAQ,MAEftwB,EAAa,EAAQ,MACrB+xB,EAASP,EAAa,gBAG1B9xB,EAAOD,QAAU,SAA2BgK,EAAInJ,GAC/C,GAAkB,mBAAPmJ,EACV,MAAM,IAAIzJ,EAAW,0BAEtB,GAAsB,iBAAXM,GAAuBA,EAAS,GAAKA,EAAS,YAAcyxB,EAAOzxB,KAAYA,EACzF,MAAM,IAAIN,EAAW,8CAGtB,IAAIU,EAAQL,UAAUC,OAAS,KAAOD,UAAU,GAE5C2xB,GAA+B,EAC/BC,GAA2B,EAC/B,GAAI,WAAYxoB,GAAM6mB,EAAM,CAC3B,IAAI3vB,EAAO2vB,EAAK7mB,EAAI,UAChB9I,IAASA,EAAKC,eACjBoxB,GAA+B,GAE5BrxB,IAASA,EAAKG,WACjBmxB,GAA2B,EAE7B,CASA,OAPID,GAAgCC,IAA6BvxB,KAC5DoxB,EACHnyB,EAA4C,EAAM,SAAUW,GAAQ,GAAM,GAE1EX,EAA4C,EAAM,SAAUW,IAGvDmJ,CACR,C,8BCtCA,IAAIyoB,EAAe,EAAQ,MACvB7gB,EAAe,EAAQ,MACvB2S,EAAe,EAAQ,MACvB1hB,EAAe,EAAQ,MACvB+R,EAAe,EAAQ,MACvB4P,EAAe,EAAQ,MACvBkO,EAAe,EAAQ,MAEvBztB,EAAW6H,OAAOvL,UAAU0D,SAiFhC,SAAS0tB,EAAQ9R,GACf,KAAMpd,gBAAgBkvB,GAAU,OAAO,IAAIA,EAAQ9R,GAEnDpd,KAAKod,QAAUjP,EAAM2G,OAAO,CAC1BqM,UAAW,MACX3P,WAAY,EACZ8H,GAAI,IACH8D,GAAW,CAAC,GAEf,IAAIkE,EAAMthB,KAAKod,QAIXkE,EAAIC,KAAQD,EAAI9P,YAAc,GAAO8P,EAAI9P,WAAa,KACxD8P,EAAI9P,YAAc8P,EAAI9P,WACC,IAAnB8P,EAAI9P,aAAoB8P,EAAI9P,YAAc,OAI3C8P,EAAI9P,YAAc,GAAO8P,EAAI9P,WAAa,KACzC4L,GAAWA,EAAQ5L,aACvB8P,EAAI9P,YAAc,IAKf8P,EAAI9P,WAAa,IAAQ8P,EAAI9P,WAAa,KAGvB,GAAjB8P,EAAI9P,aACP8P,EAAI9P,YAAc,KAItBxR,KAAKwL,IAAS,EACdxL,KAAKmR,IAAS,GACdnR,KAAKyhB,OAAS,EACdzhB,KAAK0hB,OAAS,GAEd1hB,KAAK+Q,KAAS,IAAIgQ,EAClB/gB,KAAK+Q,KAAK4C,UAAY,EAEtB,IAAIgO,EAAUqN,EAAavd,aACzBzR,KAAK+Q,KACLuQ,EAAI9P,YAGN,GAAImQ,IAAWviB,EAAE+vB,KACf,MAAM,IAAI1tB,MAAM0P,EAAIwQ,IAQtB,GALA3hB,KAAK6hB,OAAS,IAAIoN,EAElBD,EAAaxa,iBAAiBxU,KAAK+Q,KAAM/Q,KAAK6hB,QAG1CP,EAAI5M,aAEwB,iBAAnB4M,EAAI5M,WACb4M,EAAI5M,WAAaoM,EAAQxL,WAAWgM,EAAI5M,YACG,yBAAlClT,EAASzD,KAAKujB,EAAI5M,cAC3B4M,EAAI5M,WAAa,IAAIrR,WAAWie,EAAI5M,aAElC4M,EAAIC,MACNI,EAASqN,EAAava,qBAAqBzU,KAAK+Q,KAAMuQ,EAAI5M,eAC3CtV,EAAE+vB,MACf,MAAM,IAAI1tB,MAAM0P,EAAIwQ,GAI5B,CA4NA,SAAStP,EAAQE,EAAO6K,GACtB,IAAIgS,EAAW,IAAIF,EAAQ9R,GAK3B,GAHAgS,EAASjjB,KAAKoG,GAAO,GAGjB6c,EAAS5jB,IAAO,MAAM4jB,EAASje,KAAOA,EAAIie,EAAS5jB,KAEvD,OAAO4jB,EAASpnB,MAClB,CAvMAknB,EAAQpxB,UAAUqO,KAAO,SAAU5L,EAAMuO,GACvC,IAGI6S,EAAQS,EACRiN,EAAeC,EAAMC,EAJrBxe,EAAO/Q,KAAK+Q,KACZoQ,EAAYnhB,KAAKod,QAAQ+D,UACzBzM,EAAa1U,KAAKod,QAAQ1I,WAM1B8a,GAAgB,EAEpB,GAAIxvB,KAAKyhB,MAAS,OAAO,EACzBW,EAAStT,MAAWA,EAAQA,GAAkB,IAATA,EAAiB1P,EAAEqwB,SAAWrwB,EAAEswB,WAGjD,iBAATnvB,EAETwQ,EAAKwB,MAAQuO,EAAQjL,cAActV,GACF,yBAAxBiB,EAASzD,KAAKwC,GACvBwQ,EAAKwB,MAAQ,IAAIlP,WAAW9C,GAE5BwQ,EAAKwB,MAAQhS,EAGfwQ,EAAK6C,QAAU,EACf7C,EAAK0C,SAAW1C,EAAKwB,MAAMnV,OAE3B,EAAG,CAkBD,GAjBuB,IAAnB2T,EAAK4C,YACP5C,EAAKyB,OAAS,IAAIrE,EAAM+D,KAAKiP,GAC7BpQ,EAAK2C,SAAW,EAChB3C,EAAK4C,UAAYwN,IAGnBQ,EAASqN,EAAa3c,QAAQtB,EAAM3R,EAAEswB,eAEvBtwB,EAAEuwB,aAAejb,IAC9BiN,EAASqN,EAAava,qBAAqBzU,KAAK+Q,KAAM2D,IAGpDiN,IAAWviB,EAAEwwB,cAAiC,IAAlBJ,IAC9B7N,EAASviB,EAAE+vB,KACXK,GAAgB,GAGd7N,IAAWviB,EAAEywB,cAAgBlO,IAAWviB,EAAE+vB,KAG5C,OAFAnvB,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,GACN,EAGL1Q,EAAK2C,WACgB,IAAnB3C,EAAK4C,WAAmBgO,IAAWviB,EAAEywB,eAAmC,IAAlB9e,EAAK0C,UAAmB2O,IAAUhjB,EAAEqwB,UAAYrN,IAAUhjB,EAAE0wB,gBAE5F,WAApB9vB,KAAKod,QAAQ9D,IAEf+V,EAAgBvO,EAAQ5K,WAAWnF,EAAKyB,OAAQzB,EAAK2C,UAErD4b,EAAOve,EAAK2C,SAAW2b,EACvBE,EAAUzO,EAAQhL,WAAW/E,EAAKyB,OAAQ6c,GAG1Cte,EAAK2C,SAAW4b,EAChBve,EAAK4C,UAAYwN,EAAYmO,EACzBA,GAAQnhB,EAAMgE,SAASpB,EAAKyB,OAAQzB,EAAKyB,OAAQ6c,EAAeC,EAAM,GAE1EtvB,KAAKsiB,OAAOiN,IAGZvvB,KAAKsiB,OAAOnU,EAAMkH,UAAUtE,EAAKyB,OAAQzB,EAAK2C,aAY9B,IAAlB3C,EAAK0C,UAAqC,IAAnB1C,EAAK4C,YAC9B6b,GAAgB,EAGpB,QAAUze,EAAK0C,SAAW,GAAwB,IAAnB1C,EAAK4C,YAAoBgO,IAAWviB,EAAEywB,cAOrE,OALIlO,IAAWviB,EAAEywB,eACfzN,EAAQhjB,EAAEqwB,UAIRrN,IAAUhjB,EAAEqwB,UACd9N,EAASqN,EAAaza,WAAWvU,KAAK+Q,MACtC/Q,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,EACNE,IAAWviB,EAAE+vB,MAIlB/M,IAAUhjB,EAAE0wB,eACd9vB,KAAKqiB,MAAMjjB,EAAE+vB,MACbpe,EAAK4C,UAAY,GACV,EAIX,EAYAub,EAAQpxB,UAAUwkB,OAAS,SAAUE,GACnCxiB,KAAK0hB,OAAOvV,KAAKqW,EACnB,EAaA0M,EAAQpxB,UAAUukB,MAAQ,SAAUV,GAE9BA,IAAWviB,EAAE+vB,OACS,WAApBnvB,KAAKod,QAAQ9D,GAGftZ,KAAKgI,OAAShI,KAAK0hB,OAAO3E,KAAK,IAE/B/c,KAAKgI,OAASmG,EAAMsU,cAAcziB,KAAK0hB,SAG3C1hB,KAAK0hB,OAAS,GACd1hB,KAAKwL,IAAMmW,EACX3hB,KAAKmR,IAAMnR,KAAK+Q,KAAKI,GACvB,EA+EA5U,EAAQ2yB,QAAUA,EAClB3yB,EAAQ8V,QAAUA,EAClB9V,EAAQwzB,WAnBR,SAAoBxd,EAAO6K,GAGzB,OAFAA,EAAUA,GAAW,CAAC,GACdmE,KAAM,EACPlP,EAAQE,EAAO6K,EACxB,EAgBA7gB,EAAQyzB,OAAU3d,C,wBCnalB7V,EAAOD,QAA6B,oBAAZiJ,SAA2BA,SAAWA,QAAQ0D,K,8BCDtE,IAGI+mB,EAHA9C,EAAW,EAAQ,MACnBC,EAAO,EAAQ,MAGnB,IAEC6C,EAAyE,GAAK1sB,YAAcE,MAAM3F,SACnG,CAAE,MAAOQ,GACR,IAAKA,GAAkB,iBAANA,KAAoB,SAAUA,IAAiB,qBAAXA,EAAE+mB,KACtD,MAAM/mB,CAER,CAGA,IAAIb,IAASwyB,GAAoB7C,GAAQA,EAAK/jB,OAAOvL,UAAwD,aAEzG8D,EAAUyH,OACV6mB,EAAkBtuB,EAAQ4L,eAG9BhR,EAAOD,QAAUkB,GAA4B,mBAAbA,EAAKkF,IAClCwqB,EAAS,CAAC1vB,EAAKkF,MACY,mBAApButB,GACyB,SAAmBhzB,GAEnD,OAAOgzB,EAAyB,MAAThzB,EAAgBA,EAAQ0E,EAAQ1E,GACxD,C,wBCgCFV,EAAOD,QAAU,SAAsBwU,EAAMof,GAC3C,IAAInf,EACA2B,EACA5K,EACA6K,EACAwd,EACAre,EAEA7C,EAEAK,EACAC,EACAC,EAEA4gB,EACA1gB,EACAzO,EACAovB,EACAC,EACAC,EACAC,EACAnd,EACAod,EAEAtd,EACAnB,EACAjF,EACA6F,EAGAN,EAAOC,EAGXxB,EAAQD,EAAKC,MAEb2B,EAAM5B,EAAK6C,QACXrB,EAAQxB,EAAKwB,MACbxK,EAAO4K,GAAO5B,EAAK0C,SAAW,GAC9Bb,EAAO7B,EAAK2C,SACZlB,EAASzB,EAAKyB,OACd4d,EAAMxd,GAAQud,EAAQpf,EAAK4C,WAC3B5B,EAAMa,GAAQ7B,EAAK4C,UAAY,KAE/BzE,EAAO8B,EAAM9B,KAEbK,EAAQyB,EAAMzB,MACdC,EAAQwB,EAAMxB,MACdC,EAAQuB,EAAMvB,MACd4gB,EAAWrf,EAAMtB,OACjBC,EAAOqB,EAAMrB,KACbzO,EAAO8P,EAAM9P,KACbovB,EAAQtf,EAAMnB,QACd0gB,EAAQvf,EAAMlB,SACd0gB,GAAS,GAAKxf,EAAMjB,SAAW,EAC/B0gB,GAAS,GAAKzf,EAAMhB,UAAY,EAMhC2gB,EACA,EAAG,CACGzvB,EAAO,KACTyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,EACRyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,GAGVoS,EAAOgd,EAAM3gB,EAAO6gB,GAEpBI,EACA,OAAS,CAKP,GAHAjhB,KADA+gB,EAAKpd,IAAS,GAEdpS,GAAQwvB,EAEG,IADXA,EAAMpd,IAAS,GAAM,KAKnBd,EAAOI,KAAiB,MAAPU,MAEd,MAAS,GAALod,GAwKJ,IAAU,GAALA,EAIL,IAAS,GAALA,EAAS,CAEhB1f,EAAMlC,KAtSH,GAuSH,MAAM6hB,CACR,CAEE5f,EAAKI,IAAM,8BACXH,EAAMlC,KA5SJ,GA6SF,MAAM6hB,CACR,CAZErd,EAAOgd,GAAc,MAAPhd,IAA8B3D,GAAS,GAAK+gB,GAAM,IAChE,SAASE,CAWX,CA/JE,IArBAxd,EAAa,MAAPE,GACNod,GAAM,MAEAxvB,EAAOwvB,IACT/gB,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,GAEVkS,GAAOzD,GAAS,GAAK+gB,GAAM,EAC3B/gB,KAAU+gB,EACVxvB,GAAQwvB,GAGNxvB,EAAO,KACTyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,EACRyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,GAEVoS,EAAOid,EAAM5gB,EAAO8gB,KAGX,CAMP,GAJA9gB,KADA+gB,EAAKpd,IAAS,GAEdpS,GAAQwvB,EAGC,IAFTA,EAAMpd,IAAS,GAAM,KAErB,CAaE,GAZArB,EAAc,MAAPqB,EAEHpS,GADJwvB,GAAM,MAEJ/gB,GAAQ4C,EAAMI,MAAUzR,GACxBA,GAAQ,GACGwvB,IACT/gB,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,KAGZ+Q,GAAQtC,GAAS,GAAK+gB,GAAM,GAEjBxhB,EAAM,CACf6B,EAAKI,IAAM,gCACXH,EAAMlC,KApKV,GAqKI,MAAM6hB,CACR,CAMA,GAJAhhB,KAAU+gB,EACVxvB,GAAQwvB,EAGJze,GADJye,EAAK9d,EAAOwd,GACG,CAEb,IADAM,EAAKze,EAAOye,GACHlhB,GACHwB,EAAML,KAAM,CACdI,EAAKI,IAAM,gCACXH,EAAMlC,KAjLd,GAkLQ,MAAM6hB,CACR,CA0BF,GAFA3jB,EAAO,EACP6F,EAAcwd,EACA,IAAV5gB,GAEF,GADAzC,GAAQuC,EAAQmhB,EACZA,EAAKtd,EAAK,CACZA,GAAOsd,EACP,GACEle,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GACX1jB,EAAO4F,EAAOX,EACdY,EAAcL,CAChB,OAEG,GAAI/C,EAAQihB,GAGf,GAFA1jB,GAAQuC,EAAQE,EAAQihB,GACxBA,GAAMjhB,GACG2D,EAAK,CACZA,GAAOsd,EACP,GACEle,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GAEX,GADA1jB,EAAO,EACHyC,EAAQ2D,EAAK,CAEfA,GADAsd,EAAKjhB,EAEL,GACE+C,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GACX1jB,EAAO4F,EAAOX,EACdY,EAAcL,CAChB,CACF,OAIA,GADAxF,GAAQyC,EAAQihB,EACZA,EAAKtd,EAAK,CACZA,GAAOsd,EACP,GACEle,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GACX1jB,EAAO4F,EAAOX,EACdY,EAAcL,CAChB,CAEF,KAAOY,EAAM,GACXZ,EAAOI,KAAUC,EAAY7F,KAC7BwF,EAAOI,KAAUC,EAAY7F,KAC7BwF,EAAOI,KAAUC,EAAY7F,KAC7BoG,GAAO,EAELA,IACFZ,EAAOI,KAAUC,EAAY7F,KACzBoG,EAAM,IACRZ,EAAOI,KAAUC,EAAY7F,MAGnC,KACK,CACHA,EAAO4F,EAAOX,EACd,GACEO,EAAOI,KAAUJ,EAAOxF,KACxBwF,EAAOI,KAAUJ,EAAOxF,KACxBwF,EAAOI,KAAUJ,EAAOxF,KACxBoG,GAAO,QACAA,EAAM,GACXA,IACFZ,EAAOI,KAAUJ,EAAOxF,KACpBoG,EAAM,IACRZ,EAAOI,KAAUJ,EAAOxF,MAG9B,CAYF,KAFA,CARK,GAAU,GAAL0jB,EAIL,CACH3f,EAAKI,IAAM,wBACXH,EAAMlC,KA1RR,GA2RE,MAAM6hB,CACR,CAPErd,EAAOid,GAAc,MAAPjd,IAA8B3D,GAAS,GAAK+gB,GAAM,GAUpE,CAeF,CAEA,KACF,CACF,OAAS/d,EAAM5K,GAAQ6K,EAAOb,GAI9BY,GADAS,EAAMlS,GAAQ,EAGdyO,IAAS,IADTzO,GAAQkS,GAAO,IACO,EAGtBrC,EAAK6C,QAAUjB,EACf5B,EAAK2C,SAAWd,EAChB7B,EAAK0C,SAAYd,EAAM5K,EAAYA,EAAO4K,EAAZ,EAAmB,GAAKA,EAAM5K,GAC5DgJ,EAAK4C,UAAaf,EAAOb,EAAaA,EAAMa,EAAb,IAAqB,KAAOA,EAAOb,GAClEf,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,CAEf,C,wBC/RA1E,EAAOD,QApCP,WAEEyD,KAAK8T,KAAa,EAElB9T,KAAK+T,KAAa,EAElB/T,KAAKgU,OAAa,EAElBhU,KAAKiU,GAAa,EAElBjU,KAAK4P,MAAa,KAElB5P,KAAKkU,UAAa,EAWlBlU,KAAKsG,KAAa,GAIlBtG,KAAKoU,QAAa,GAIlBpU,KAAKqU,KAAa,EAElBrU,KAAKsL,MAAa,CACpB,C,4BCrDA/O,EAAQqwB,WAuCR,SAAqBiE,GACnB,IAAIvgB,EAAOwgB,EAAQD,GACfE,EAAWzgB,EAAK,GAChB0gB,EAAkB1gB,EAAK,GAC3B,OAAuC,GAA9BygB,EAAWC,GAAuB,EAAKA,CAClD,EA3CAz0B,EAAQ00B,YAiDR,SAAsBJ,GACpB,IAAIK,EAcAtyB,EAbA0R,EAAOwgB,EAAQD,GACfE,EAAWzgB,EAAK,GAChB0gB,EAAkB1gB,EAAK,GAEvB2b,EAAM,IAAIkF,EAVhB,SAAsBN,EAAKE,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,CAClD,CAQoBI,CAAYP,EAAKE,EAAUC,IAEzCK,EAAU,EAGVje,EAAM4d,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKnyB,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EACxBsyB,EACGI,EAAUT,EAAIjb,WAAWhX,KAAO,GAChC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,GACpC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACrC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,IAC/BqtB,EAAIoF,KAAcH,GAAO,GAAM,IAC/BjF,EAAIoF,KAAcH,GAAO,EAAK,IAC9BjF,EAAIoF,KAAmB,IAANH,EAmBnB,OAhBwB,IAApBF,IACFE,EACGI,EAAUT,EAAIjb,WAAWhX,KAAO,EAChC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACvCqtB,EAAIoF,KAAmB,IAANH,GAGK,IAApBF,IACFE,EACGI,EAAUT,EAAIjb,WAAWhX,KAAO,GAChC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACpC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACvCqtB,EAAIoF,KAAcH,GAAO,EAAK,IAC9BjF,EAAIoF,KAAmB,IAANH,GAGZjF,CACT,EA5FA1vB,EAAQg1B,cAkHR,SAAwBzE,GAQtB,IAPA,IAAIoE,EACA9d,EAAM0Z,EAAM1vB,OACZo0B,EAAape,EAAM,EACnBxL,EAAQ,GACR6pB,EAAiB,MAGZ7yB,EAAI,EAAG8yB,EAAOte,EAAMoe,EAAY5yB,EAAI8yB,EAAM9yB,GAAK6yB,EACtD7pB,EAAMuE,KAAKwlB,EAAY7E,EAAOluB,EAAIA,EAAI6yB,EAAkBC,EAAOA,EAAQ9yB,EAAI6yB,IAqB7E,OAjBmB,IAAfD,GACFN,EAAMpE,EAAM1Z,EAAM,GAClBxL,EAAMuE,KACJylB,EAAOV,GAAO,GACdU,EAAQV,GAAO,EAAK,IACpB,OAEsB,IAAfM,IACTN,GAAOpE,EAAM1Z,EAAM,IAAM,GAAK0Z,EAAM1Z,EAAM,GAC1CxL,EAAMuE,KACJylB,EAAOV,GAAO,IACdU,EAAQV,GAAO,EAAK,IACpBU,EAAQV,GAAO,EAAK,IACpB,MAIGtpB,EAAMmV,KAAK,GACpB,EA1IA,IALA,IAAI6U,EAAS,GACTN,EAAY,GACZH,EAA4B,oBAAf9tB,WAA6BA,WAAaI,MAEvD4hB,EAAO,mEACFzmB,EAAI,EAAsBA,EAAbymB,KAAwBzmB,EAC5CgzB,EAAOhzB,GAAKymB,EAAKzmB,GACjB0yB,EAAUjM,EAAKzP,WAAWhX,IAAMA,EAQlC,SAASkyB,EAASD,GAChB,IAAIzd,EAAMyd,EAAIzzB,OAEd,GAAIgW,EAAM,EAAI,EACZ,MAAM,IAAI3R,MAAM,kDAKlB,IAAIsvB,EAAWF,EAAIlY,QAAQ,KAO3B,OANkB,IAAdoY,IAAiBA,EAAW3d,GAMzB,CAAC2d,EAJcA,IAAa3d,EAC/B,EACA,EAAK2d,EAAW,EAGtB,CA4DA,SAASc,EAAiBjH,GACxB,OAAOgH,EAAOhH,GAAO,GAAK,IACxBgH,EAAOhH,GAAO,GAAK,IACnBgH,EAAOhH,GAAO,EAAI,IAClBgH,EAAa,GAANhH,EACX,CAEA,SAAS+G,EAAa7E,EAAOqD,EAAOpe,GAGlC,IAFA,IAAImf,EACA1e,EAAS,GACJ5T,EAAIuxB,EAAOvxB,EAAImT,EAAKnT,GAAK,EAChCsyB,GACIpE,EAAMluB,IAAM,GAAM,WAClBkuB,EAAMluB,EAAI,IAAM,EAAK,QACP,IAAfkuB,EAAMluB,EAAI,IACb4T,EAAOrG,KAAK0lB,EAAgBX,IAE9B,OAAO1e,EAAOuK,KAAK,GACrB,CAlGAuU,EAAU,IAAI1b,WAAW,IAAM,GAC/B0b,EAAU,IAAI1b,WAAW,IAAM,E,wBChB/BpZ,EAAOD,QAAU0C,KAAK4B,G,wBCAtBrE,EAAOD,QAAUu1B,W,iBCDjB,IAAI7zB,EAAS,EAAQ,MACjB0B,EAAS1B,EAAO0B,OAGpB,SAAS+M,EAAWC,EAAKC,GACvB,IAAK,IAAInC,KAAOkC,EACdC,EAAInC,GAAOkC,EAAIlC,EAEnB,CASA,SAASoC,EAAYC,EAAKC,EAAkB3P,GAC1C,OAAOuC,EAAOmN,EAAKC,EAAkB3P,EACvC,CAVIuC,EAAOqN,MAAQrN,EAAOO,OAASP,EAAOsN,aAAetN,EAAOuN,gBAC9D1Q,EAAOD,QAAU0B,GAGjByO,EAAUzO,EAAQ1B,GAClBA,EAAQoD,OAASkN,GAOnBA,EAAW/O,UAAYuL,OAAOK,OAAO/J,EAAO7B,WAG5C4O,EAAU/M,EAAQkN,GAElBA,EAAWG,KAAO,SAAUF,EAAKC,EAAkB3P,GACjD,GAAmB,iBAAR0P,EACT,MAAM,IAAIK,UAAU,iCAEtB,OAAOxN,EAAOmN,EAAKC,EAAkB3P,EACvC,EAEAyP,EAAW3M,MAAQ,SAAUkN,EAAMnM,EAAMoM,GACvC,GAAoB,iBAATD,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAIG,EAAM3N,EAAOyN,GAUjB,YATazL,IAATV,EACsB,iBAAboM,EACTC,EAAIrM,KAAKA,EAAMoM,GAEfC,EAAIrM,KAAKA,GAGXqM,EAAIrM,KAAK,GAEJqM,CACT,EAEAT,EAAWI,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOxN,EAAOyN,EAChB,EAEAP,EAAWK,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOlP,EAAOsP,WAAWH,EAC3B,C,8BCtDA,MAAM2kB,EAAS,EAAQ,MACjBC,EAAU,EAAQ,KAClBC,EACe,mBAAXtuB,QAAkD,mBAAlBA,OAAY,IAChDA,OAAY,IAAE,8BACd,KAENpH,EAAQoD,OAASA,EACjBpD,EAAQgR,WAyTR,SAAqBnQ,GAInB,OAHKA,GAAUA,IACbA,EAAS,GAEJuC,EAAOO,OAAO9C,EACvB,EA7TAb,EAAQ21B,kBAAoB,GAE5B,MAAMC,EAAe,WAwDrB,SAASC,EAAch1B,GACrB,GAAIA,EAAS+0B,EACX,MAAM,IAAI3X,WAAW,cAAgBpd,EAAS,kCAGhD,MAAMkQ,EAAM,IAAIjK,WAAWjG,GAE3B,OADAiM,OAAOgpB,eAAe/kB,EAAK3N,EAAO7B,WAC3BwP,CACT,CAYA,SAAS3N,EAAQmN,EAAKC,EAAkB3P,GAEtC,GAAmB,iBAAR0P,EAAkB,CAC3B,GAAgC,iBAArBC,EACT,MAAM,IAAII,UACR,sEAGJ,OAAOF,EAAYH,EACrB,CACA,OAAOE,EAAKF,EAAKC,EAAkB3P,EACrC,CAIA,SAAS4P,EAAM9P,EAAO6P,EAAkB3P,GACtC,GAAqB,iBAAVF,EACT,OAqHJ,SAAqB2K,EAAQwF,GAK3B,GAJwB,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,SAGR1N,EAAO2yB,WAAWjlB,GACrB,MAAM,IAAIF,UAAU,qBAAuBE,GAG7C,MAAMjQ,EAAwC,EAA/BwvB,EAAW/kB,EAAQwF,GAClC,IAAIC,EAAM8kB,EAAah1B,GAEvB,MAAMm1B,EAASjlB,EAAInO,MAAM0I,EAAQwF,GASjC,OAPIklB,IAAWn1B,IAIbkQ,EAAMA,EAAInG,MAAM,EAAGorB,IAGdjlB,CACT,CA3IWklB,CAAWt1B,EAAO6P,GAG3B,GAAIrJ,YAAY6oB,OAAOrvB,GACrB,OAkJJ,SAAwBu1B,GACtB,GAAIC,EAAWD,EAAWpvB,YAAa,CACrC,MAAM2O,EAAO,IAAI3O,WAAWovB,GAC5B,OAAOE,EAAgB3gB,EAAK/T,OAAQ+T,EAAK6a,WAAY7a,EAAK4a,WAC5D,CACA,OAAOgG,EAAcH,EACvB,CAxJWI,CAAc31B,GAGvB,GAAa,MAATA,EACF,MAAM,IAAIiQ,UACR,yHACiDjQ,GAIrD,GAAIw1B,EAAWx1B,EAAOwG,cACjBxG,GAASw1B,EAAWx1B,EAAMe,OAAQyF,aACrC,OAAOivB,EAAgBz1B,EAAO6P,EAAkB3P,GAGlD,GAAiC,oBAAtBuI,oBACN+sB,EAAWx1B,EAAOyI,oBAClBzI,GAASw1B,EAAWx1B,EAAMe,OAAQ0H,oBACrC,OAAOgtB,EAAgBz1B,EAAO6P,EAAkB3P,GAGlD,GAAqB,iBAAVF,EACT,MAAM,IAAIiQ,UACR,yEAIJ,MAAM2lB,EAAU51B,EAAM41B,SAAW51B,EAAM41B,UACvC,GAAe,MAAXA,GAAmBA,IAAY51B,EACjC,OAAOyC,EAAOqN,KAAK8lB,EAAS/lB,EAAkB3P,GAGhD,MAAM4tB,EAkJR,SAAqBhuB,GACnB,GAAI2C,EAAOqtB,SAAShwB,GAAM,CACxB,MAAMoW,EAA4B,EAAtB2f,EAAQ/1B,EAAII,QAClBkQ,EAAM8kB,EAAahf,GAEzB,OAAmB,IAAf9F,EAAIlQ,QAIRJ,EAAIgV,KAAK1E,EAAK,EAAG,EAAG8F,GAHX9F,CAKX,CAEA,YAAmB3L,IAAf3E,EAAII,OACoB,iBAAfJ,EAAII,QAAuB41B,EAAYh2B,EAAII,QAC7Cg1B,EAAa,GAEfQ,EAAc51B,GAGN,WAAbA,EAAIwZ,MAAqB/S,MAAMkH,QAAQ3N,EAAIuD,MACtCqyB,EAAc51B,EAAIuD,WAD3B,CAGF,CAzKY0yB,CAAW/1B,GACrB,GAAI8tB,EAAG,OAAOA,EAEd,GAAsB,oBAAXrnB,QAAgD,MAAtBA,OAAOuvB,aACH,mBAA9Bh2B,EAAMyG,OAAOuvB,aACtB,OAAOvzB,EAAOqN,KAAK9P,EAAMyG,OAAOuvB,aAAa,UAAWnmB,EAAkB3P,GAG5E,MAAM,IAAI+P,UACR,yHACiDjQ,EAErD,CAmBA,SAASi2B,EAAY/lB,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,0CACf,GAAIC,EAAO,EAChB,MAAM,IAAIoN,WAAW,cAAgBpN,EAAO,iCAEhD,CA0BA,SAASH,EAAaG,GAEpB,OADA+lB,EAAW/lB,GACJglB,EAAahlB,EAAO,EAAI,EAAoB,EAAhB2lB,EAAQ3lB,GAC7C,CAuCA,SAASwlB,EAAe5S,GACtB,MAAM5iB,EAAS4iB,EAAM5iB,OAAS,EAAI,EAA4B,EAAxB21B,EAAQ/S,EAAM5iB,QAC9CkQ,EAAM8kB,EAAah1B,GACzB,IAAK,IAAIwB,EAAI,EAAGA,EAAIxB,EAAQwB,GAAK,EAC/B0O,EAAI1O,GAAgB,IAAXohB,EAAMphB,GAEjB,OAAO0O,CACT,CAUA,SAASqlB,EAAiB3S,EAAO6M,EAAYzvB,GAC3C,GAAIyvB,EAAa,GAAK7M,EAAM4M,WAAaC,EACvC,MAAM,IAAIrS,WAAW,wCAGvB,GAAIwF,EAAM4M,WAAaC,GAAczvB,GAAU,GAC7C,MAAM,IAAIod,WAAW,wCAGvB,IAAIlN,EAYJ,OAVEA,OADiB3L,IAAfkrB,QAAuClrB,IAAXvE,EACxB,IAAIiG,WAAW2c,QACDre,IAAXvE,EACH,IAAIiG,WAAW2c,EAAO6M,GAEtB,IAAIxpB,WAAW2c,EAAO6M,EAAYzvB,GAI1CiM,OAAOgpB,eAAe/kB,EAAK3N,EAAO7B,WAE3BwP,CACT,CA2BA,SAASylB,EAAS31B,GAGhB,GAAIA,GAAU+0B,EACZ,MAAM,IAAI3X,WAAW,0DACa2X,EAAa3wB,SAAS,IAAM,UAEhE,OAAgB,EAATpE,CACT,CAsGA,SAASwvB,EAAY/kB,EAAQwF,GAC3B,GAAI1N,EAAOqtB,SAASnlB,GAClB,OAAOA,EAAOzK,OAEhB,GAAIsG,YAAY6oB,OAAO1kB,IAAW6qB,EAAW7qB,EAAQnE,aACnD,OAAOmE,EAAO+kB,WAEhB,GAAsB,iBAAX/kB,EACT,MAAM,IAAIsF,UACR,kGAC0BtF,GAI9B,MAAMuL,EAAMvL,EAAOzK,OACbg2B,EAAaj2B,UAAUC,OAAS,IAAsB,IAAjBD,UAAU,GACrD,IAAKi2B,GAAqB,IAARhgB,EAAW,OAAO,EAGpC,IAAIigB,GAAc,EAClB,OACE,OAAQhmB,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAO+F,EACT,IAAK,OACL,IAAK,QACH,OAAOkgB,EAAYzrB,GAAQzK,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAANgW,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAOmgB,EAAc1rB,GAAQzK,OAC/B,QACE,GAAIi2B,EACF,OAAOD,GAAa,EAAIE,EAAYzrB,GAAQzK,OAE9CiQ,GAAY,GAAKA,GAAUmmB,cAC3BH,GAAc,EAGtB,CAGA,SAASI,EAAcpmB,EAAU8iB,EAAOpe,GACtC,IAAIshB,GAAc,EAclB,SALc1xB,IAAVwuB,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQnwB,KAAK5C,OACf,MAAO,GAOT,SAJYuE,IAARoQ,GAAqBA,EAAM/R,KAAK5C,UAClC2U,EAAM/R,KAAK5C,QAGT2U,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACToe,KAAW,GAGT,MAAO,GAKT,IAFK9iB,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAOqmB,EAAS1zB,KAAMmwB,EAAOpe,GAE/B,IAAK,OACL,IAAK,QACH,OAAO4hB,EAAU3zB,KAAMmwB,EAAOpe,GAEhC,IAAK,QACH,OAAO6hB,EAAW5zB,KAAMmwB,EAAOpe,GAEjC,IAAK,SACL,IAAK,SACH,OAAO8hB,EAAY7zB,KAAMmwB,EAAOpe,GAElC,IAAK,SACH,OAAO+hB,EAAY9zB,KAAMmwB,EAAOpe,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOgiB,EAAa/zB,KAAMmwB,EAAOpe,GAEnC,QACE,GAAIshB,EAAa,MAAM,IAAIlmB,UAAU,qBAAuBE,GAC5DA,GAAYA,EAAW,IAAImmB,cAC3BH,GAAc,EAGtB,CAUA,SAASW,EAAMhJ,EAAG3X,EAAG9U,GACnB,MAAMK,EAAIosB,EAAE3X,GACZ2X,EAAE3X,GAAK2X,EAAEzsB,GACTysB,EAAEzsB,GAAKK,CACT,CA2IA,SAASq1B,EAAsBh2B,EAAQi2B,EAAKrH,EAAYxf,EAAU8mB,GAEhE,GAAsB,IAAlBl2B,EAAOb,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAfyvB,GACTxf,EAAWwf,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAGZmG,EADJnG,GAAcA,KAGZA,EAAasH,EAAM,EAAKl2B,EAAOb,OAAS,GAItCyvB,EAAa,IAAGA,EAAa5uB,EAAOb,OAASyvB,GAC7CA,GAAc5uB,EAAOb,OAAQ,CAC/B,GAAI+2B,EAAK,OAAQ,EACZtH,EAAa5uB,EAAOb,OAAS,CACpC,MAAO,GAAIyvB,EAAa,EAAG,CACzB,IAAIsH,EACC,OAAQ,EADJtH,EAAa,CAExB,CAQA,GALmB,iBAARqH,IACTA,EAAMv0B,EAAOqN,KAAKknB,EAAK7mB,IAIrB1N,EAAOqtB,SAASkH,GAElB,OAAmB,IAAfA,EAAI92B,QACE,EAEHg3B,EAAan2B,EAAQi2B,EAAKrH,EAAYxf,EAAU8mB,GAClD,GAAmB,iBAARD,EAEhB,OADAA,GAAY,IACgC,mBAAjC7wB,WAAWvF,UAAU6a,QAC1Bwb,EACK9wB,WAAWvF,UAAU6a,QAAQ5a,KAAKE,EAAQi2B,EAAKrH,GAE/CxpB,WAAWvF,UAAUu2B,YAAYt2B,KAAKE,EAAQi2B,EAAKrH,GAGvDuH,EAAan2B,EAAQ,CAACi2B,GAAMrH,EAAYxf,EAAU8mB,GAG3D,MAAM,IAAIhnB,UAAU,uCACtB,CAEA,SAASinB,EAAcnI,EAAKiI,EAAKrH,EAAYxf,EAAU8mB,GACrD,IA0BIv1B,EA1BA01B,EAAY,EACZC,EAAYtI,EAAI7uB,OAChBo3B,EAAYN,EAAI92B,OAEpB,QAAiBuE,IAAb0L,IAEe,UADjBA,EAAWzH,OAAOyH,GAAUmmB,gBACY,UAAbnmB,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAI4e,EAAI7uB,OAAS,GAAK82B,EAAI92B,OAAS,EACjC,OAAQ,EAEVk3B,EAAY,EACZC,GAAa,EACbC,GAAa,EACb3H,GAAc,CAChB,CAGF,SAAS7uB,EAAMsP,EAAK1O,GAClB,OAAkB,IAAd01B,EACKhnB,EAAI1O,GAEJ0O,EAAImnB,aAAa71B,EAAI01B,EAEhC,CAGA,GAAIH,EAAK,CACP,IAAIO,GAAc,EAClB,IAAK91B,EAAIiuB,EAAYjuB,EAAI21B,EAAW31B,IAClC,GAAIZ,EAAKiuB,EAAKrtB,KAAOZ,EAAKk2B,GAAqB,IAAhBQ,EAAoB,EAAI91B,EAAI81B,IAEzD,IADoB,IAAhBA,IAAmBA,EAAa91B,GAChCA,EAAI81B,EAAa,IAAMF,EAAW,OAAOE,EAAaJ,OAEtC,IAAhBI,IAAmB91B,GAAKA,EAAI81B,GAChCA,GAAc,CAGpB,MAEE,IADI7H,EAAa2H,EAAYD,IAAW1H,EAAa0H,EAAYC,GAC5D51B,EAAIiuB,EAAYjuB,GAAK,EAAGA,IAAK,CAChC,IAAIsvB,GAAQ,EACZ,IAAK,IAAItH,EAAI,EAAGA,EAAI4N,EAAW5N,IAC7B,GAAI5oB,EAAKiuB,EAAKrtB,EAAIgoB,KAAO5oB,EAAKk2B,EAAKtN,GAAI,CACrCsH,GAAQ,EACR,KACF,CAEF,GAAIA,EAAO,OAAOtvB,CACpB,CAGF,OAAQ,CACV,CAcA,SAAS+1B,EAAUrnB,EAAKzF,EAAQ3J,EAAQd,GACtCc,EAASiH,OAAOjH,IAAW,EAC3B,MAAM02B,EAAYtnB,EAAIlQ,OAASc,EAC1Bd,GAGHA,EAAS+H,OAAO/H,IACHw3B,IACXx3B,EAASw3B,GAJXx3B,EAASw3B,EAQX,MAAMC,EAAShtB,EAAOzK,OAKtB,IAAIwB,EACJ,IAJIxB,EAASy3B,EAAS,IACpBz3B,EAASy3B,EAAS,GAGfj2B,EAAI,EAAGA,EAAIxB,IAAUwB,EAAG,CAC3B,MAAMk2B,EAASzvB,SAASwC,EAAO4T,OAAW,EAAJ7c,EAAO,GAAI,IACjD,GAAIo0B,EAAY8B,GAAS,OAAOl2B,EAChC0O,EAAIpP,EAASU,GAAKk2B,CACpB,CACA,OAAOl2B,CACT,CAEA,SAASm2B,EAAWznB,EAAKzF,EAAQ3J,EAAQd,GACvC,OAAO43B,EAAW1B,EAAYzrB,EAAQyF,EAAIlQ,OAASc,GAASoP,EAAKpP,EAAQd,EAC3E,CAEA,SAAS63B,EAAY3nB,EAAKzF,EAAQ3J,EAAQd,GACxC,OAAO43B,EAypCT,SAAuBzf,GACrB,MAAM2f,EAAY,GAClB,IAAK,IAAIt2B,EAAI,EAAGA,EAAI2W,EAAInY,SAAUwB,EAEhCs2B,EAAU/oB,KAAyB,IAApBoJ,EAAIK,WAAWhX,IAEhC,OAAOs2B,CACT,CAhqCoBC,CAAattB,GAASyF,EAAKpP,EAAQd,EACvD,CAEA,SAASg4B,EAAa9nB,EAAKzF,EAAQ3J,EAAQd,GACzC,OAAO43B,EAAWzB,EAAc1rB,GAASyF,EAAKpP,EAAQd,EACxD,CAEA,SAASi4B,EAAW/nB,EAAKzF,EAAQ3J,EAAQd,GACvC,OAAO43B,EA0pCT,SAAyBzf,EAAK+f,GAC5B,IAAIl2B,EAAGm2B,EAAIC,EACX,MAAMN,EAAY,GAClB,IAAK,IAAIt2B,EAAI,EAAGA,EAAI2W,EAAInY,WACjBk4B,GAAS,GAAK,KADa12B,EAGhCQ,EAAImW,EAAIK,WAAWhX,GACnB22B,EAAKn2B,GAAK,EACVo2B,EAAKp2B,EAAI,IACT81B,EAAU/oB,KAAKqpB,GACfN,EAAU/oB,KAAKopB,GAGjB,OAAOL,CACT,CAxqCoBO,CAAe5tB,EAAQyF,EAAIlQ,OAASc,GAASoP,EAAKpP,EAAQd,EAC9E,CA8EA,SAAS02B,EAAaxmB,EAAK6iB,EAAOpe,GAChC,OAAc,IAAVoe,GAAepe,IAAQzE,EAAIlQ,OACtB20B,EAAOR,cAAcjkB,GAErBykB,EAAOR,cAAcjkB,EAAInG,MAAMgpB,EAAOpe,GAEjD,CAEA,SAAS4hB,EAAWrmB,EAAK6iB,EAAOpe,GAC9BA,EAAM9S,KAAK4B,IAAIyM,EAAIlQ,OAAQ2U,GAC3B,MAAMuT,EAAM,GAEZ,IAAI1mB,EAAIuxB,EACR,KAAOvxB,EAAImT,GAAK,CACd,MAAM2jB,EAAYpoB,EAAI1O,GACtB,IAAI+2B,EAAY,KACZC,EAAoBF,EAAY,IAChC,EACCA,EAAY,IACT,EACCA,EAAY,IACT,EACA,EAEZ,GAAI92B,EAAIg3B,GAAoB7jB,EAAK,CAC/B,IAAI8jB,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EACHG,EAAavoB,EAAI1O,EAAI,GACO,MAAV,IAAbi3B,KACHG,GAA6B,GAAZN,IAAqB,EAAoB,GAAbG,EACzCG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAavoB,EAAI1O,EAAI,GACrBk3B,EAAYxoB,EAAI1O,EAAI,GACQ,MAAV,IAAbi3B,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZN,IAAoB,IAAoB,GAAbG,IAAsB,EAAmB,GAAZC,EACrEE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAavoB,EAAI1O,EAAI,GACrBk3B,EAAYxoB,EAAI1O,EAAI,GACpBm3B,EAAazoB,EAAI1O,EAAI,GACO,MAAV,IAAbi3B,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZN,IAAoB,IAAqB,GAAbG,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,EAClGC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,IAItB,CAEkB,OAAdL,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbrQ,EAAInZ,KAAKwpB,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvBrQ,EAAInZ,KAAKwpB,GACT/2B,GAAKg3B,CACP,CAEA,OAQF,SAAgCK,GAC9B,MAAM7iB,EAAM6iB,EAAW74B,OACvB,GAAIgW,GAAO8iB,EACT,OAAOtwB,OAAOuO,aAAajL,MAAMtD,OAAQqwB,GAI3C,IAAI3Q,EAAM,GACN1mB,EAAI,EACR,KAAOA,EAAIwU,GACTkS,GAAO1f,OAAOuO,aAAajL,MACzBtD,OACAqwB,EAAW9uB,MAAMvI,EAAGA,GAAKs3B,IAG7B,OAAO5Q,CACT,CAxBS6Q,CAAsB7Q,EAC/B,CA3+BA/oB,EAAQ65B,WAAajE,EAgBrBxyB,EAAOgtB,oBAUP,WAEE,IACE,MAAMV,EAAM,IAAI5oB,WAAW,GACrByqB,EAAQ,CAAEuI,IAAK,WAAc,OAAO,EAAG,GAG7C,OAFAhtB,OAAOgpB,eAAevE,EAAOzqB,WAAWvF,WACxCuL,OAAOgpB,eAAepG,EAAK6B,GACN,KAAd7B,EAAIoK,KACb,CAAE,MAAO/3B,GACP,OAAO,CACT,CACF,CArB6Bg4B,GAExB32B,EAAOgtB,qBAA0C,oBAAZ4J,SACb,mBAAlBA,QAAQpwB,OACjBowB,QAAQpwB,MACN,iJAkBJkD,OAAOC,eAAe3J,EAAO7B,UAAW,SAAU,CAChDH,YAAY,EACZgF,IAAK,WACH,GAAKhD,EAAOqtB,SAAShtB,MACrB,OAAOA,KAAK/B,MACd,IAGFoL,OAAOC,eAAe3J,EAAO7B,UAAW,SAAU,CAChDH,YAAY,EACZgF,IAAK,WACH,GAAKhD,EAAOqtB,SAAShtB,MACrB,OAAOA,KAAK6sB,UACd,IAoCFltB,EAAO62B,SAAW,KA8DlB72B,EAAOqN,KAAO,SAAU9P,EAAO6P,EAAkB3P,GAC/C,OAAO4P,EAAK9P,EAAO6P,EAAkB3P,EACvC,EAIAiM,OAAOgpB,eAAe1yB,EAAO7B,UAAWuF,WAAWvF,WACnDuL,OAAOgpB,eAAe1yB,EAAQ0D,YA8B9B1D,EAAOO,MAAQ,SAAUkN,EAAMnM,EAAMoM,GACnC,OArBF,SAAgBD,EAAMnM,EAAMoM,GAE1B,OADA8lB,EAAW/lB,GACPA,GAAQ,EACHglB,EAAahlB,QAETzL,IAATV,EAIyB,iBAAboM,EACV+kB,EAAahlB,GAAMnM,KAAKA,EAAMoM,GAC9B+kB,EAAahlB,GAAMnM,KAAKA,GAEvBmxB,EAAahlB,EACtB,CAOSlN,CAAMkN,EAAMnM,EAAMoM,EAC3B,EAUA1N,EAAOsN,YAAc,SAAUG,GAC7B,OAAOH,EAAYG,EACrB,EAIAzN,EAAOuN,gBAAkB,SAAUE,GACjC,OAAOH,EAAYG,EACrB,EA6GAzN,EAAOqtB,SAAW,SAAmBhC,GACnC,OAAY,MAALA,IAA6B,IAAhBA,EAAEyL,WACpBzL,IAAMrrB,EAAO7B,SACjB,EAEA6B,EAAO+2B,QAAU,SAAkBnL,EAAGP,GAGpC,GAFI0H,EAAWnH,EAAGloB,cAAakoB,EAAI5rB,EAAOqN,KAAKue,EAAGA,EAAErtB,OAAQqtB,EAAEqB,aAC1D8F,EAAW1H,EAAG3nB,cAAa2nB,EAAIrrB,EAAOqN,KAAKge,EAAGA,EAAE9sB,OAAQ8sB,EAAE4B,cACzDjtB,EAAOqtB,SAASzB,KAAO5rB,EAAOqtB,SAAShC,GAC1C,MAAM,IAAI7d,UACR,yEAIJ,GAAIoe,IAAMP,EAAG,OAAO,EAEpB,IAAIjL,EAAIwL,EAAEnuB,OACNu5B,EAAI3L,EAAE5tB,OAEV,IAAK,IAAIwB,EAAI,EAAGwU,EAAMnU,KAAK4B,IAAIkf,EAAG4W,GAAI/3B,EAAIwU,IAAOxU,EAC/C,GAAI2sB,EAAE3sB,KAAOosB,EAAEpsB,GAAI,CACjBmhB,EAAIwL,EAAE3sB,GACN+3B,EAAI3L,EAAEpsB,GACN,KACF,CAGF,OAAImhB,EAAI4W,GAAW,EACfA,EAAI5W,EAAU,EACX,CACT,EAEApgB,EAAO2yB,WAAa,SAAqBjlB,GACvC,OAAQzH,OAAOyH,GAAUmmB,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,EAEb,EAEA7zB,EAAOkH,OAAS,SAAiB+Y,EAAMxiB,GACrC,IAAKqG,MAAMkH,QAAQiV,GACjB,MAAM,IAAIzS,UAAU,+CAGtB,GAAoB,IAAhByS,EAAKxiB,OACP,OAAOuC,EAAOO,MAAM,GAGtB,IAAItB,EACJ,QAAe+C,IAAXvE,EAEF,IADAA,EAAS,EACJwB,EAAI,EAAGA,EAAIghB,EAAKxiB,SAAUwB,EAC7BxB,GAAUwiB,EAAKhhB,GAAGxB,OAItB,MAAMa,EAAS0B,EAAOsN,YAAY7P,GAClC,IAAI+Y,EAAM,EACV,IAAKvX,EAAI,EAAGA,EAAIghB,EAAKxiB,SAAUwB,EAAG,CAChC,IAAI0O,EAAMsS,EAAKhhB,GACf,GAAI8zB,EAAWplB,EAAKjK,YACd8S,EAAM7I,EAAIlQ,OAASa,EAAOb,QACvBuC,EAAOqtB,SAAS1f,KAAMA,EAAM3N,EAAOqN,KAAKM,IAC7CA,EAAI0E,KAAK/T,EAAQkY,IAEjB9S,WAAWvF,UAAUkwB,IAAIjwB,KACvBE,EACAqP,EACA6I,OAGC,KAAKxW,EAAOqtB,SAAS1f,GAC1B,MAAM,IAAIH,UAAU,+CAEpBG,EAAI0E,KAAK/T,EAAQkY,EACnB,CACAA,GAAO7I,EAAIlQ,MACb,CACA,OAAOa,CACT,EAiDA0B,EAAOitB,WAAaA,EA8EpBjtB,EAAO7B,UAAU24B,WAAY,EAQ7B92B,EAAO7B,UAAU84B,OAAS,WACxB,MAAMxjB,EAAMpT,KAAK5C,OACjB,GAAIgW,EAAM,GAAM,EACd,MAAM,IAAIoH,WAAW,6CAEvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EAC5Bo1B,EAAKh0B,KAAMpB,EAAGA,EAAI,GAEpB,OAAOoB,IACT,EAEAL,EAAO7B,UAAU+4B,OAAS,WACxB,MAAMzjB,EAAMpT,KAAK5C,OACjB,GAAIgW,EAAM,GAAM,EACd,MAAM,IAAIoH,WAAW,6CAEvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EAC5Bo1B,EAAKh0B,KAAMpB,EAAGA,EAAI,GAClBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GAExB,OAAOoB,IACT,EAEAL,EAAO7B,UAAUg5B,OAAS,WACxB,MAAM1jB,EAAMpT,KAAK5C,OACjB,GAAIgW,EAAM,GAAM,EACd,MAAM,IAAIoH,WAAW,6CAEvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EAC5Bo1B,EAAKh0B,KAAMpB,EAAGA,EAAI,GAClBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GACtBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GACtBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GAExB,OAAOoB,IACT,EAEAL,EAAO7B,UAAU0D,SAAW,WAC1B,MAAMpE,EAAS4C,KAAK5C,OACpB,OAAe,IAAXA,EAAqB,GACA,IAArBD,UAAUC,OAAqBu2B,EAAU3zB,KAAM,EAAG5C,GAC/Cq2B,EAAavqB,MAAMlJ,KAAM7C,UAClC,EAEAwC,EAAO7B,UAAUi5B,eAAiBp3B,EAAO7B,UAAU0D,SAEnD7B,EAAO7B,UAAUk5B,OAAS,SAAiBhM,GACzC,IAAKrrB,EAAOqtB,SAAShC,GAAI,MAAM,IAAI7d,UAAU,6BAC7C,OAAInN,OAASgrB,GACsB,IAA5BrrB,EAAO+2B,QAAQ12B,KAAMgrB,EAC9B,EAEArrB,EAAO7B,UAAUm5B,QAAU,WACzB,IAAI1hB,EAAM,GACV,MAAMrT,EAAM3F,EAAQ21B,kBAGpB,OAFA3c,EAAMvV,KAAKwB,SAAS,MAAO,EAAGU,GAAK+E,QAAQ,UAAW,OAAOiwB,OACzDl3B,KAAK5C,OAAS8E,IAAKqT,GAAO,SACvB,WAAaA,EAAM,GAC5B,EACI0c,IACFtyB,EAAO7B,UAAUm0B,GAAuBtyB,EAAO7B,UAAUm5B,SAG3Dt3B,EAAO7B,UAAU44B,QAAU,SAAkBS,EAAQhH,EAAOpe,EAAKqlB,EAAWC,GAI1E,GAHI3E,EAAWyE,EAAQ9zB,cACrB8zB,EAASx3B,EAAOqN,KAAKmqB,EAAQA,EAAOj5B,OAAQi5B,EAAOvK,cAEhDjtB,EAAOqtB,SAASmK,GACnB,MAAM,IAAIhqB,UACR,wFAC2BgqB,GAiB/B,QAbcx1B,IAAVwuB,IACFA,EAAQ,QAEExuB,IAARoQ,IACFA,EAAMolB,EAASA,EAAO/5B,OAAS,QAEfuE,IAAdy1B,IACFA,EAAY,QAEEz1B,IAAZ01B,IACFA,EAAUr3B,KAAK5C,QAGb+yB,EAAQ,GAAKpe,EAAMolB,EAAO/5B,QAAUg6B,EAAY,GAAKC,EAAUr3B,KAAK5C,OACtE,MAAM,IAAIod,WAAW,sBAGvB,GAAI4c,GAAaC,GAAWlH,GAASpe,EACnC,OAAO,EAET,GAAIqlB,GAAaC,EACf,OAAQ,EAEV,GAAIlH,GAASpe,EACX,OAAO,EAQT,GAAI/R,OAASm3B,EAAQ,OAAO,EAE5B,IAAIpX,GAJJsX,KAAa,IADbD,KAAe,GAMXT,GAPJ5kB,KAAS,IADToe,KAAW,GASX,MAAM/c,EAAMnU,KAAK4B,IAAIkf,EAAG4W,GAElBW,EAAWt3B,KAAKmH,MAAMiwB,EAAWC,GACjCE,EAAaJ,EAAOhwB,MAAMgpB,EAAOpe,GAEvC,IAAK,IAAInT,EAAI,EAAGA,EAAIwU,IAAOxU,EACzB,GAAI04B,EAAS14B,KAAO24B,EAAW34B,GAAI,CACjCmhB,EAAIuX,EAAS14B,GACb+3B,EAAIY,EAAW34B,GACf,KACF,CAGF,OAAImhB,EAAI4W,GAAW,EACfA,EAAI5W,EAAU,EACX,CACT,EA2HApgB,EAAO7B,UAAU05B,SAAW,SAAmBtD,EAAKrH,EAAYxf,GAC9D,OAAoD,IAA7CrN,KAAK2Y,QAAQub,EAAKrH,EAAYxf,EACvC,EAEA1N,EAAO7B,UAAU6a,QAAU,SAAkBub,EAAKrH,EAAYxf,GAC5D,OAAO4mB,EAAqBj0B,KAAMk0B,EAAKrH,EAAYxf,GAAU,EAC/D,EAEA1N,EAAO7B,UAAUu2B,YAAc,SAAsBH,EAAKrH,EAAYxf,GACpE,OAAO4mB,EAAqBj0B,KAAMk0B,EAAKrH,EAAYxf,GAAU,EAC/D,EA4CA1N,EAAO7B,UAAUqB,MAAQ,SAAgB0I,EAAQ3J,EAAQd,EAAQiQ,GAE/D,QAAe1L,IAAXzD,EACFmP,EAAW,OACXjQ,EAAS4C,KAAK5C,OACdc,EAAS,OAEJ,QAAeyD,IAAXvE,GAA0C,iBAAXc,EACxCmP,EAAWnP,EACXd,EAAS4C,KAAK5C,OACdc,EAAS,MAEJ,KAAI8G,SAAS9G,GAUlB,MAAM,IAAIuD,MACR,2EAVFvD,KAAoB,EAChB8G,SAAS5H,IACXA,KAAoB,OACHuE,IAAb0L,IAAwBA,EAAW,UAEvCA,EAAWjQ,EACXA,OAASuE,EAMb,CAEA,MAAMizB,EAAY50B,KAAK5C,OAASc,EAGhC,SAFeyD,IAAXvE,GAAwBA,EAASw3B,KAAWx3B,EAASw3B,GAEpD/sB,EAAOzK,OAAS,IAAMA,EAAS,GAAKc,EAAS,IAAOA,EAAS8B,KAAK5C,OACrE,MAAM,IAAIod,WAAW,0CAGlBnN,IAAUA,EAAW,QAE1B,IAAIgmB,GAAc,EAClB,OACE,OAAQhmB,GACN,IAAK,MACH,OAAOsnB,EAAS30B,KAAM6H,EAAQ3J,EAAQd,GAExC,IAAK,OACL,IAAK,QACH,OAAO23B,EAAU/0B,KAAM6H,EAAQ3J,EAAQd,GAEzC,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAO63B,EAAWj1B,KAAM6H,EAAQ3J,EAAQd,GAE1C,IAAK,SAEH,OAAOg4B,EAAYp1B,KAAM6H,EAAQ3J,EAAQd,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOi4B,EAAUr1B,KAAM6H,EAAQ3J,EAAQd,GAEzC,QACE,GAAIi2B,EAAa,MAAM,IAAIlmB,UAAU,qBAAuBE,GAC5DA,GAAY,GAAKA,GAAUmmB,cAC3BH,GAAc,EAGtB,EAEA1zB,EAAO7B,UAAU25B,OAAS,WACxB,MAAO,CACLjhB,KAAM,SACNjW,KAAMkD,MAAM3F,UAAUqJ,MAAMpJ,KAAKiC,KAAK03B,MAAQ13B,KAAM,GAExD,EAyFA,MAAMk2B,EAAuB,KAoB7B,SAAStC,EAAYtmB,EAAK6iB,EAAOpe,GAC/B,IAAItG,EAAM,GACVsG,EAAM9S,KAAK4B,IAAIyM,EAAIlQ,OAAQ2U,GAE3B,IAAK,IAAInT,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EAC7B6M,GAAO7F,OAAOuO,aAAsB,IAAT7G,EAAI1O,IAEjC,OAAO6M,CACT,CAEA,SAASooB,EAAavmB,EAAK6iB,EAAOpe,GAChC,IAAItG,EAAM,GACVsG,EAAM9S,KAAK4B,IAAIyM,EAAIlQ,OAAQ2U,GAE3B,IAAK,IAAInT,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EAC7B6M,GAAO7F,OAAOuO,aAAa7G,EAAI1O,IAEjC,OAAO6M,CACT,CAEA,SAASioB,EAAUpmB,EAAK6iB,EAAOpe,GAC7B,MAAMqB,EAAM9F,EAAIlQ,SAEX+yB,GAASA,EAAQ,KAAGA,EAAQ,KAC5Bpe,GAAOA,EAAM,GAAKA,EAAMqB,KAAKrB,EAAMqB,GAExC,IAAI2C,EAAM,GACV,IAAK,IAAInX,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EAC7BmX,GAAO4hB,EAAoBrqB,EAAI1O,IAEjC,OAAOmX,CACT,CAEA,SAASge,EAAczmB,EAAK6iB,EAAOpe,GACjC,MAAM6lB,EAAQtqB,EAAInG,MAAMgpB,EAAOpe,GAC/B,IAAIuT,EAAM,GAEV,IAAK,IAAI1mB,EAAI,EAAGA,EAAIg5B,EAAMx6B,OAAS,EAAGwB,GAAK,EACzC0mB,GAAO1f,OAAOuO,aAAayjB,EAAMh5B,GAAqB,IAAfg5B,EAAMh5B,EAAI,IAEnD,OAAO0mB,CACT,CAiCA,SAASuS,EAAa35B,EAAQ45B,EAAK16B,GACjC,GAAKc,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAIsc,WAAW,sBAC3D,GAAItc,EAAS45B,EAAM16B,EAAQ,MAAM,IAAIod,WAAW,wCAClD,CAyQA,SAASud,EAAUzqB,EAAKpQ,EAAOgB,EAAQ45B,EAAK51B,EAAKrB,GAC/C,IAAKlB,EAAOqtB,SAAS1f,GAAM,MAAM,IAAIH,UAAU,+CAC/C,GAAIjQ,EAAQgF,GAAOhF,EAAQ2D,EAAK,MAAM,IAAI2Z,WAAW,qCACrD,GAAItc,EAAS45B,EAAMxqB,EAAIlQ,OAAQ,MAAM,IAAIod,WAAW,qBACtD,CA+FA,SAASwd,EAAgB1qB,EAAKpQ,EAAOgB,EAAQ2C,EAAKqB,GAChD+1B,EAAW/6B,EAAO2D,EAAKqB,EAAKoL,EAAKpP,EAAQ,GAEzC,IAAIs3B,EAAKrwB,OAAOjI,EAAQ4G,OAAO,aAC/BwJ,EAAIpP,KAAYs3B,EAChBA,IAAW,EACXloB,EAAIpP,KAAYs3B,EAChBA,IAAW,EACXloB,EAAIpP,KAAYs3B,EAChBA,IAAW,EACXloB,EAAIpP,KAAYs3B,EAChB,IAAID,EAAKpwB,OAAOjI,GAAS4G,OAAO,IAAMA,OAAO,aAQ7C,OAPAwJ,EAAIpP,KAAYq3B,EAChBA,IAAW,EACXjoB,EAAIpP,KAAYq3B,EAChBA,IAAW,EACXjoB,EAAIpP,KAAYq3B,EAChBA,IAAW,EACXjoB,EAAIpP,KAAYq3B,EACTr3B,CACT,CAEA,SAASg6B,EAAgB5qB,EAAKpQ,EAAOgB,EAAQ2C,EAAKqB,GAChD+1B,EAAW/6B,EAAO2D,EAAKqB,EAAKoL,EAAKpP,EAAQ,GAEzC,IAAIs3B,EAAKrwB,OAAOjI,EAAQ4G,OAAO,aAC/BwJ,EAAIpP,EAAS,GAAKs3B,EAClBA,IAAW,EACXloB,EAAIpP,EAAS,GAAKs3B,EAClBA,IAAW,EACXloB,EAAIpP,EAAS,GAAKs3B,EAClBA,IAAW,EACXloB,EAAIpP,EAAS,GAAKs3B,EAClB,IAAID,EAAKpwB,OAAOjI,GAAS4G,OAAO,IAAMA,OAAO,aAQ7C,OAPAwJ,EAAIpP,EAAS,GAAKq3B,EAClBA,IAAW,EACXjoB,EAAIpP,EAAS,GAAKq3B,EAClBA,IAAW,EACXjoB,EAAIpP,EAAS,GAAKq3B,EAClBA,IAAW,EACXjoB,EAAIpP,GAAUq3B,EACPr3B,EAAS,CAClB,CAkHA,SAASi6B,EAAc7qB,EAAKpQ,EAAOgB,EAAQ45B,EAAK51B,EAAKrB,GACnD,GAAI3C,EAAS45B,EAAMxqB,EAAIlQ,OAAQ,MAAM,IAAIod,WAAW,sBACpD,GAAItc,EAAS,EAAG,MAAM,IAAIsc,WAAW,qBACvC,CAEA,SAAS4d,EAAY9qB,EAAKpQ,EAAOgB,EAAQm6B,EAAcC,GAOrD,OANAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GACHH,EAAa7qB,EAAKpQ,EAAOgB,EAAQ,GAEnC8zB,EAAQ7yB,MAAMmO,EAAKpQ,EAAOgB,EAAQm6B,EAAc,GAAI,GAC7Cn6B,EAAS,CAClB,CAUA,SAASq6B,EAAajrB,EAAKpQ,EAAOgB,EAAQm6B,EAAcC,GAOtD,OANAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GACHH,EAAa7qB,EAAKpQ,EAAOgB,EAAQ,GAEnC8zB,EAAQ7yB,MAAMmO,EAAKpQ,EAAOgB,EAAQm6B,EAAc,GAAI,GAC7Cn6B,EAAS,CAClB,CAzkBAyB,EAAO7B,UAAUqJ,MAAQ,SAAgBgpB,EAAOpe,GAC9C,MAAMqB,EAAMpT,KAAK5C,QACjB+yB,IAAUA,GAGE,GACVA,GAAS/c,GACG,IAAG+c,EAAQ,GACdA,EAAQ/c,IACjB+c,EAAQ/c,IANVrB,OAAcpQ,IAARoQ,EAAoBqB,IAAQrB,GASxB,GACRA,GAAOqB,GACG,IAAGrB,EAAM,GACVA,EAAMqB,IACfrB,EAAMqB,GAGJrB,EAAMoe,IAAOpe,EAAMoe,GAEvB,MAAMqI,EAASx4B,KAAKoV,SAAS+a,EAAOpe,GAIpC,OAFA1I,OAAOgpB,eAAemG,EAAQ74B,EAAO7B,WAE9B06B,CACT,EAUA74B,EAAO7B,UAAU26B,WACjB94B,EAAO7B,UAAU46B,WAAa,SAAqBx6B,EAAQ0uB,EAAY0L,GACrEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAAUT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAEpD,IAAI82B,EAAMl0B,KAAK9B,GACXy6B,EAAM,EACN/5B,EAAI,EACR,OAASA,EAAIguB,IAAe+L,GAAO,MACjCzE,GAAOl0B,KAAK9B,EAASU,GAAK+5B,EAG5B,OAAOzE,CACT,EAEAv0B,EAAO7B,UAAU86B,WACjBj5B,EAAO7B,UAAU+6B,WAAa,SAAqB36B,EAAQ0uB,EAAY0L,GACrEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GACHT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAGvC,IAAI82B,EAAMl0B,KAAK9B,IAAW0uB,GACtB+L,EAAM,EACV,KAAO/L,EAAa,IAAM+L,GAAO,MAC/BzE,GAAOl0B,KAAK9B,IAAW0uB,GAAc+L,EAGvC,OAAOzE,CACT,EAEAv0B,EAAO7B,UAAUg7B,UACjBn5B,EAAO7B,UAAUi7B,UAAY,SAAoB76B,EAAQo6B,GAGvD,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC4C,KAAK9B,EACd,EAEAyB,EAAO7B,UAAUk7B,aACjBr5B,EAAO7B,UAAUm7B,aAAe,SAAuB/6B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC4C,KAAK9B,GAAW8B,KAAK9B,EAAS,IAAM,CAC7C,EAEAyB,EAAO7B,UAAUo7B,aACjBv5B,EAAO7B,UAAU22B,aAAe,SAAuBv2B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACnC4C,KAAK9B,IAAW,EAAK8B,KAAK9B,EAAS,EAC7C,EAEAyB,EAAO7B,UAAUq7B,aACjBx5B,EAAO7B,UAAUs7B,aAAe,SAAuBl7B,EAAQo6B,GAI7D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,SAElC4C,KAAK9B,GACT8B,KAAK9B,EAAS,IAAM,EACpB8B,KAAK9B,EAAS,IAAM,IACD,SAAnB8B,KAAK9B,EAAS,EACrB,EAEAyB,EAAO7B,UAAUu7B,aACjB15B,EAAO7B,UAAUw7B,aAAe,SAAuBp7B,EAAQo6B,GAI7D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAEpB,SAAf4C,KAAK9B,IACT8B,KAAK9B,EAAS,IAAM,GACrB8B,KAAK9B,EAAS,IAAM,EACrB8B,KAAK9B,EAAS,GAClB,EAEAyB,EAAO7B,UAAUy7B,gBAAkBC,EAAmB,SAA0Bt7B,GAE9Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAMo4B,EAAK1tB,EACQ,IAAjB9H,OAAO9B,GACU,MAAjB8B,OAAO9B,GACP8B,OAAO9B,GAAU,GAAK,GAElBq3B,EAAKv1B,OAAO9B,GACC,IAAjB8B,OAAO9B,GACU,MAAjB8B,OAAO9B,GACP6J,EAAO,GAAK,GAEd,OAAOjE,OAAO0xB,IAAO1xB,OAAOyxB,IAAOzxB,OAAO,IAC5C,GAEAnE,EAAO7B,UAAU67B,gBAAkBH,EAAmB,SAA0Bt7B,GAE9Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAMm4B,EAAKztB,EAAQ,GAAK,GACL,MAAjB9H,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP8B,OAAO9B,GAEHs3B,EAAKx1B,OAAO9B,GAAU,GAAK,GACd,MAAjB8B,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP6J,EAEF,OAAQjE,OAAOyxB,IAAOzxB,OAAO,KAAOA,OAAO0xB,EAC7C,GAEA71B,EAAO7B,UAAU87B,UAAY,SAAoB17B,EAAQ0uB,EAAY0L,GACnEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAAUT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAEpD,IAAI82B,EAAMl0B,KAAK9B,GACXy6B,EAAM,EACN/5B,EAAI,EACR,OAASA,EAAIguB,IAAe+L,GAAO,MACjCzE,GAAOl0B,KAAK9B,EAASU,GAAK+5B,EAM5B,OAJAA,GAAO,IAEHzE,GAAOyE,IAAKzE,GAAOj1B,KAAKC,IAAI,EAAG,EAAI0tB,IAEhCsH,CACT,EAEAv0B,EAAO7B,UAAU+7B,UAAY,SAAoB37B,EAAQ0uB,EAAY0L,GACnEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAAUT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAEpD,IAAIwB,EAAIguB,EACJ+L,EAAM,EACNzE,EAAMl0B,KAAK9B,IAAWU,GAC1B,KAAOA,EAAI,IAAM+5B,GAAO,MACtBzE,GAAOl0B,KAAK9B,IAAWU,GAAK+5B,EAM9B,OAJAA,GAAO,IAEHzE,GAAOyE,IAAKzE,GAAOj1B,KAAKC,IAAI,EAAG,EAAI0tB,IAEhCsH,CACT,EAEAv0B,EAAO7B,UAAUg8B,SAAW,SAAmB57B,EAAQo6B,GAGrD,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACtB,IAAf4C,KAAK9B,IAC0B,GAA5B,IAAO8B,KAAK9B,GAAU,GADK8B,KAAK9B,EAE3C,EAEAyB,EAAO7B,UAAUi8B,YAAc,SAAsB77B,EAAQo6B,GAC3Dp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAC3C,MAAM82B,EAAMl0B,KAAK9B,GAAW8B,KAAK9B,EAAS,IAAM,EAChD,OAAc,MAANg2B,EAAsB,WAANA,EAAmBA,CAC7C,EAEAv0B,EAAO7B,UAAUk8B,YAAc,SAAsB97B,EAAQo6B,GAC3Dp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAC3C,MAAM82B,EAAMl0B,KAAK9B,EAAS,GAAM8B,KAAK9B,IAAW,EAChD,OAAc,MAANg2B,EAAsB,WAANA,EAAmBA,CAC7C,EAEAv0B,EAAO7B,UAAUm8B,YAAc,SAAsB/7B,EAAQo6B,GAI3D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAEnC4C,KAAK9B,GACV8B,KAAK9B,EAAS,IAAM,EACpB8B,KAAK9B,EAAS,IAAM,GACpB8B,KAAK9B,EAAS,IAAM,EACzB,EAEAyB,EAAO7B,UAAU0tB,YAAc,SAAsBttB,EAAQo6B,GAI3D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAEnC4C,KAAK9B,IAAW,GACrB8B,KAAK9B,EAAS,IAAM,GACpB8B,KAAK9B,EAAS,IAAM,EACpB8B,KAAK9B,EAAS,EACnB,EAEAyB,EAAO7B,UAAUo8B,eAAiBV,EAAmB,SAAyBt7B,GAE5Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAM82B,EAAMl0B,KAAK9B,EAAS,GACL,IAAnB8B,KAAK9B,EAAS,GACK,MAAnB8B,KAAK9B,EAAS,IACb6J,GAAQ,IAEX,OAAQjE,OAAOowB,IAAQpwB,OAAO,KAC5BA,OAAOgE,EACU,IAAjB9H,OAAO9B,GACU,MAAjB8B,OAAO9B,GACP8B,OAAO9B,GAAU,GAAK,GAC1B,GAEAyB,EAAO7B,UAAUq8B,eAAiBX,EAAmB,SAAyBt7B,GAE5Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAM82B,GAAOpsB,GAAS,IACH,MAAjB9H,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP8B,OAAO9B,GAET,OAAQ4F,OAAOowB,IAAQpwB,OAAO,KAC5BA,OAAO9D,OAAO9B,GAAU,GAAK,GACZ,MAAjB8B,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP6J,EACJ,GAEApI,EAAO7B,UAAUs8B,YAAc,SAAsBl8B,EAAQo6B,GAG3D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAM,GAAI,EAC9C,EAEAyB,EAAO7B,UAAUu8B,YAAc,SAAsBn8B,EAAQo6B,GAG3D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAO,GAAI,EAC/C,EAEAyB,EAAO7B,UAAUw8B,aAAe,SAAuBp8B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAM,GAAI,EAC9C,EAEAyB,EAAO7B,UAAUy8B,aAAe,SAAuBr8B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAO,GAAI,EAC/C,EAQAyB,EAAO7B,UAAU08B,YACjB76B,EAAO7B,UAAU28B,YAAc,SAAsBv9B,EAAOgB,EAAQ0uB,EAAY0L,GAC9Ep7B,GAASA,EACTgB,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAEHP,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EADb3tB,KAAKC,IAAI,EAAG,EAAI0tB,GAAc,EACK,GAGtD,IAAI+L,EAAM,EACN/5B,EAAI,EAER,IADAoB,KAAK9B,GAAkB,IAARhB,IACN0B,EAAIguB,IAAe+L,GAAO,MACjC34B,KAAK9B,EAASU,GAAM1B,EAAQy7B,EAAO,IAGrC,OAAOz6B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU48B,YACjB/6B,EAAO7B,UAAU68B,YAAc,SAAsBz9B,EAAOgB,EAAQ0uB,EAAY0L,GAC9Ep7B,GAASA,EACTgB,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAEHP,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EADb3tB,KAAKC,IAAI,EAAG,EAAI0tB,GAAc,EACK,GAGtD,IAAIhuB,EAAIguB,EAAa,EACjB+L,EAAM,EAEV,IADA34B,KAAK9B,EAASU,GAAa,IAAR1B,IACV0B,GAAK,IAAM+5B,GAAO,MACzB34B,KAAK9B,EAASU,GAAM1B,EAAQy7B,EAAO,IAGrC,OAAOz6B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU88B,WACjBj7B,EAAO7B,UAAU+8B,WAAa,SAAqB39B,EAAOgB,EAAQo6B,GAKhE,OAJAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,IAAM,GACtD8B,KAAK9B,GAAmB,IAARhB,EACTgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUg9B,cACjBn7B,EAAO7B,UAAUi9B,cAAgB,SAAwB79B,EAAOgB,EAAQo6B,GAMtE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,MAAQ,GACxD8B,KAAK9B,GAAmB,IAARhB,EAChB8C,KAAK9B,EAAS,GAAMhB,IAAU,EACvBgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUk9B,cACjBr7B,EAAO7B,UAAUm9B,cAAgB,SAAwB/9B,EAAOgB,EAAQo6B,GAMtE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,MAAQ,GACxD8B,KAAK9B,GAAWhB,IAAU,EAC1B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUo9B,cACjBv7B,EAAO7B,UAAUq9B,cAAgB,SAAwBj+B,EAAOgB,EAAQo6B,GAQtE,OAPAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,WAAY,GAC5D8B,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,GAAmB,IAARhB,EACTgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUs9B,cACjBz7B,EAAO7B,UAAUqD,cAAgB,SAAwBjE,EAAOgB,EAAQo6B,GAQtE,OAPAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,WAAY,GAC5D8B,KAAK9B,GAAWhB,IAAU,GAC1B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EA8CAyB,EAAO7B,UAAUu9B,iBAAmB7B,EAAmB,SAA2Bt8B,EAAOgB,EAAS,GAChG,OAAO85B,EAAeh4B,KAAM9C,EAAOgB,EAAQ4F,OAAO,GAAIA,OAAO,sBAC/D,GAEAnE,EAAO7B,UAAUw9B,iBAAmB9B,EAAmB,SAA2Bt8B,EAAOgB,EAAS,GAChG,OAAOg6B,EAAel4B,KAAM9C,EAAOgB,EAAQ4F,OAAO,GAAIA,OAAO,sBAC/D,GAEAnE,EAAO7B,UAAUy9B,WAAa,SAAqBr+B,EAAOgB,EAAQ0uB,EAAY0L,GAG5E,GAFAp7B,GAASA,EACTgB,KAAoB,GACfo6B,EAAU,CACb,MAAMkD,EAAQv8B,KAAKC,IAAI,EAAI,EAAI0tB,EAAc,GAE7CmL,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EAAY4O,EAAQ,GAAIA,EACxD,CAEA,IAAI58B,EAAI,EACJ+5B,EAAM,EACN8C,EAAM,EAEV,IADAz7B,KAAK9B,GAAkB,IAARhB,IACN0B,EAAIguB,IAAe+L,GAAO,MAC7Bz7B,EAAQ,GAAa,IAARu+B,GAAsC,IAAzBz7B,KAAK9B,EAASU,EAAI,KAC9C68B,EAAM,GAERz7B,KAAK9B,EAASU,IAAO1B,EAAQy7B,EAAQ,GAAK8C,EAAM,IAGlD,OAAOv9B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU49B,WAAa,SAAqBx+B,EAAOgB,EAAQ0uB,EAAY0L,GAG5E,GAFAp7B,GAASA,EACTgB,KAAoB,GACfo6B,EAAU,CACb,MAAMkD,EAAQv8B,KAAKC,IAAI,EAAI,EAAI0tB,EAAc,GAE7CmL,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EAAY4O,EAAQ,GAAIA,EACxD,CAEA,IAAI58B,EAAIguB,EAAa,EACjB+L,EAAM,EACN8C,EAAM,EAEV,IADAz7B,KAAK9B,EAASU,GAAa,IAAR1B,IACV0B,GAAK,IAAM+5B,GAAO,MACrBz7B,EAAQ,GAAa,IAARu+B,GAAsC,IAAzBz7B,KAAK9B,EAASU,EAAI,KAC9C68B,EAAM,GAERz7B,KAAK9B,EAASU,IAAO1B,EAAQy7B,EAAQ,GAAK8C,EAAM,IAGlD,OAAOv9B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU69B,UAAY,SAAoBz+B,EAAOgB,EAAQo6B,GAM9D,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,KAAO,KACnDhB,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtC8C,KAAK9B,GAAmB,IAARhB,EACTgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAU89B,aAAe,SAAuB1+B,EAAOgB,EAAQo6B,GAMpE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,OAAS,OACzD8B,KAAK9B,GAAmB,IAARhB,EAChB8C,KAAK9B,EAAS,GAAMhB,IAAU,EACvBgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAU+9B,aAAe,SAAuB3+B,EAAOgB,EAAQo6B,GAMpE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,OAAS,OACzD8B,KAAK9B,GAAWhB,IAAU,EAC1B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUg+B,aAAe,SAAuB5+B,EAAOgB,EAAQo6B,GAQpE,OAPAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,YAAa,YAC7D8B,KAAK9B,GAAmB,IAARhB,EAChB8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,GACvBgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAU6tB,aAAe,SAAuBzuB,EAAOgB,EAAQo6B,GASpE,OARAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,YAAa,YACzDhB,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5C8C,KAAK9B,GAAWhB,IAAU,GAC1B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUi+B,gBAAkBvC,EAAmB,SAA0Bt8B,EAAOgB,EAAS,GAC9F,OAAO85B,EAAeh4B,KAAM9C,EAAOgB,GAAS4F,OAAO,sBAAuBA,OAAO,sBACnF,GAEAnE,EAAO7B,UAAUk+B,gBAAkBxC,EAAmB,SAA0Bt8B,EAAOgB,EAAS,GAC9F,OAAOg6B,EAAel4B,KAAM9C,EAAOgB,GAAS4F,OAAO,sBAAuBA,OAAO,sBACnF,GAiBAnE,EAAO7B,UAAUm+B,aAAe,SAAuB/+B,EAAOgB,EAAQo6B,GACpE,OAAOF,EAAWp4B,KAAM9C,EAAOgB,GAAQ,EAAMo6B,EAC/C,EAEA34B,EAAO7B,UAAUo+B,aAAe,SAAuBh/B,EAAOgB,EAAQo6B,GACpE,OAAOF,EAAWp4B,KAAM9C,EAAOgB,GAAQ,EAAOo6B,EAChD,EAYA34B,EAAO7B,UAAUq+B,cAAgB,SAAwBj/B,EAAOgB,EAAQo6B,GACtE,OAAOC,EAAYv4B,KAAM9C,EAAOgB,GAAQ,EAAMo6B,EAChD,EAEA34B,EAAO7B,UAAUs+B,cAAgB,SAAwBl/B,EAAOgB,EAAQo6B,GACtE,OAAOC,EAAYv4B,KAAM9C,EAAOgB,GAAQ,EAAOo6B,EACjD,EAGA34B,EAAO7B,UAAUkU,KAAO,SAAemlB,EAAQkF,EAAalM,EAAOpe,GACjE,IAAKpS,EAAOqtB,SAASmK,GAAS,MAAM,IAAIhqB,UAAU,+BAQlD,GAPKgjB,IAAOA,EAAQ,GACfpe,GAAe,IAARA,IAAWA,EAAM/R,KAAK5C,QAC9Bi/B,GAAelF,EAAO/5B,SAAQi/B,EAAclF,EAAO/5B,QAClDi/B,IAAaA,EAAc,GAC5BtqB,EAAM,GAAKA,EAAMoe,IAAOpe,EAAMoe,GAG9Bpe,IAAQoe,EAAO,OAAO,EAC1B,GAAsB,IAAlBgH,EAAO/5B,QAAgC,IAAhB4C,KAAK5C,OAAc,OAAO,EAGrD,GAAIi/B,EAAc,EAChB,MAAM,IAAI7hB,WAAW,6BAEvB,GAAI2V,EAAQ,GAAKA,GAASnwB,KAAK5C,OAAQ,MAAM,IAAIod,WAAW,sBAC5D,GAAIzI,EAAM,EAAG,MAAM,IAAIyI,WAAW,2BAG9BzI,EAAM/R,KAAK5C,SAAQ2U,EAAM/R,KAAK5C,QAC9B+5B,EAAO/5B,OAASi/B,EAActqB,EAAMoe,IACtCpe,EAAMolB,EAAO/5B,OAASi/B,EAAclM,GAGtC,MAAM/c,EAAMrB,EAAMoe,EAalB,OAXInwB,OAASm3B,GAAqD,mBAApC9zB,WAAWvF,UAAUw+B,WAEjDt8B,KAAKs8B,WAAWD,EAAalM,EAAOpe,GAEpC1O,WAAWvF,UAAUkwB,IAAIjwB,KACvBo5B,EACAn3B,KAAKoV,SAAS+a,EAAOpe,GACrBsqB,GAIGjpB,CACT,EAMAzT,EAAO7B,UAAUmD,KAAO,SAAeizB,EAAK/D,EAAOpe,EAAK1E,GAEtD,GAAmB,iBAAR6mB,EAAkB,CAS3B,GARqB,iBAAV/D,GACT9iB,EAAW8iB,EACXA,EAAQ,EACRpe,EAAM/R,KAAK5C,QACa,iBAAR2U,IAChB1E,EAAW0E,EACXA,EAAM/R,KAAK5C,aAEIuE,IAAb0L,GAA8C,iBAAbA,EACnC,MAAM,IAAIF,UAAU,6BAEtB,GAAwB,iBAAbE,IAA0B1N,EAAO2yB,WAAWjlB,GACrD,MAAM,IAAIF,UAAU,qBAAuBE,GAE7C,GAAmB,IAAf6mB,EAAI92B,OAAc,CACpB,MAAMioB,EAAO6O,EAAIte,WAAW,IACV,SAAbvI,GAAuBgY,EAAO,KAClB,WAAbhY,KAEF6mB,EAAM7O,EAEV,CACF,KAA0B,iBAAR6O,EAChBA,GAAY,IACY,kBAARA,IAChBA,EAAM/uB,OAAO+uB,IAIf,GAAI/D,EAAQ,GAAKnwB,KAAK5C,OAAS+yB,GAASnwB,KAAK5C,OAAS2U,EACpD,MAAM,IAAIyI,WAAW,sBAGvB,GAAIzI,GAAOoe,EACT,OAAOnwB,KAQT,IAAIpB,EACJ,GANAuxB,KAAkB,EAClBpe,OAAcpQ,IAARoQ,EAAoB/R,KAAK5C,OAAS2U,IAAQ,EAE3CmiB,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKt1B,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EACzBoB,KAAKpB,GAAKs1B,MAEP,CACL,MAAM0D,EAAQj4B,EAAOqtB,SAASkH,GAC1BA,EACAv0B,EAAOqN,KAAKknB,EAAK7mB,GACf+F,EAAMwkB,EAAMx6B,OAClB,GAAY,IAARgW,EACF,MAAM,IAAIjG,UAAU,cAAgB+mB,EAClC,qCAEJ,IAAKt1B,EAAI,EAAGA,EAAImT,EAAMoe,IAASvxB,EAC7BoB,KAAKpB,EAAIuxB,GAASyH,EAAMh5B,EAAIwU,EAEhC,CAEA,OAAOpT,IACT,EAMA,MAAMu8B,EAAS,CAAC,EAChB,SAASC,EAAG7uB,EAAK8uB,EAAYC,GAC3BH,EAAO5uB,GAAO,cAAwB+uB,EACpC,WAAA/iB,GACEgjB,QAEAtzB,OAAOC,eAAetJ,KAAM,UAAW,CACrC9C,MAAOu/B,EAAWvzB,MAAMlJ,KAAM7C,WAC9BS,UAAU,EACVF,cAAc,IAIhBsC,KAAKsG,KAAO,GAAGtG,KAAKsG,SAASqH,KAG7B3N,KAAK48B,aAEE58B,KAAKsG,IACd,CAEA,QAAI+e,GACF,OAAO1X,CACT,CAEA,QAAI0X,CAAMnoB,GACRmM,OAAOC,eAAetJ,KAAM,OAAQ,CAClCtC,cAAc,EACdC,YAAY,EACZT,QACAU,UAAU,GAEd,CAEA,QAAA4D,GACE,MAAO,GAAGxB,KAAKsG,SAASqH,OAAS3N,KAAKia,SACxC,EAEJ,CA+BA,SAAS4iB,EAAuB3I,GAC9B,IAAI5O,EAAM,GACN1mB,EAAIs1B,EAAI92B,OACZ,MAAM+yB,EAAmB,MAAX+D,EAAI,GAAa,EAAI,EACnC,KAAOt1B,GAAKuxB,EAAQ,EAAGvxB,GAAK,EAC1B0mB,EAAM,IAAI4O,EAAI/sB,MAAMvI,EAAI,EAAGA,KAAK0mB,IAElC,MAAO,GAAG4O,EAAI/sB,MAAM,EAAGvI,KAAK0mB,GAC9B,CAYA,SAAS2S,EAAY/6B,EAAO2D,EAAKqB,EAAKoL,EAAKpP,EAAQ0uB,GACjD,GAAI1vB,EAAQgF,GAAOhF,EAAQ2D,EAAK,CAC9B,MAAMwS,EAAmB,iBAARxS,EAAmB,IAAM,GAC1C,IAAIoY,EAWJ,MARIA,EAFA2T,EAAa,EACH,IAAR/rB,GAAaA,IAAQiD,OAAO,GACtB,OAAOuP,YAAYA,QAA2B,GAAlBuZ,EAAa,KAASvZ,IAElD,SAASA,QAA2B,GAAlBuZ,EAAa,GAAS,IAAIvZ,iBACtB,GAAlBuZ,EAAa,GAAS,IAAIvZ,IAGhC,MAAMxS,IAAMwS,YAAYnR,IAAMmR,IAElC,IAAIkpB,EAAOO,iBAAiB,QAAS7jB,EAAO/b,EACpD,EAtBF,SAAsBoQ,EAAKpP,EAAQ0uB,GACjC6M,EAAev7B,EAAQ,eACHyD,IAAhB2L,EAAIpP,SAAsDyD,IAA7B2L,EAAIpP,EAAS0uB,IAC5C8M,EAAYx7B,EAAQoP,EAAIlQ,QAAUwvB,EAAa,GAEnD,CAkBEmQ,CAAYzvB,EAAKpP,EAAQ0uB,EAC3B,CAEA,SAAS6M,EAAgBv8B,EAAOoJ,GAC9B,GAAqB,iBAAVpJ,EACT,MAAM,IAAIq/B,EAAOS,qBAAqB12B,EAAM,SAAUpJ,EAE1D,CAEA,SAASw8B,EAAax8B,EAAOE,EAAQoZ,GACnC,GAAIvX,KAAKO,MAAMtC,KAAWA,EAExB,MADAu8B,EAAev8B,EAAOsZ,GAChB,IAAI+lB,EAAOO,iBAAiBtmB,GAAQ,SAAU,aAActZ,GAGpE,GAAIE,EAAS,EACX,MAAM,IAAIm/B,EAAOU,yBAGnB,MAAM,IAAIV,EAAOO,iBAAiBtmB,GAAQ,SACR,MAAMA,EAAO,EAAI,YAAYpZ,IAC7BF,EACpC,CAvFAs/B,EAAE,2BACA,SAAUl2B,GACR,OAAIA,EACK,GAAGA,gCAGL,gDACT,EAAGkU,YACLgiB,EAAE,uBACA,SAAUl2B,EAAMisB,GACd,MAAO,QAAQjsB,4DAA+DisB,GAChF,EAAGplB,WACLqvB,EAAE,mBACA,SAAUjnB,EAAK0D,EAAO1G,GACpB,IAAIpB,EAAM,iBAAiBoE,sBACvB2nB,EAAW3qB,EAWf,OAVIpN,OAAOmF,UAAUiI,IAAUtT,KAAKK,IAAIiT,GAAS,GAAK,GACpD2qB,EAAWL,EAAsBj3B,OAAO2M,IACd,iBAAVA,IAChB2qB,EAAWt3B,OAAO2M,IACdA,EAAQzO,OAAO,IAAMA,OAAO,KAAOyO,IAAUzO,OAAO,IAAMA,OAAO,QACnEo5B,EAAWL,EAAsBK,IAEnCA,GAAY,KAEd/rB,GAAO,eAAe8H,eAAmBikB,IAClC/rB,CACT,EAAGqJ,YAiEL,MAAM2iB,EAAoB,oBAgB1B,SAAS7J,EAAazrB,EAAQytB,GAE5B,IAAIK,EADJL,EAAQA,GAASt2B,IAEjB,MAAM5B,EAASyK,EAAOzK,OACtB,IAAIggC,EAAgB,KACpB,MAAMxF,EAAQ,GAEd,IAAK,IAAIh5B,EAAI,EAAGA,EAAIxB,IAAUwB,EAAG,CAI/B,GAHA+2B,EAAY9tB,EAAO+N,WAAWhX,GAG1B+2B,EAAY,OAAUA,EAAY,MAAQ,CAE5C,IAAKyH,EAAe,CAElB,GAAIzH,EAAY,MAAQ,EAEjBL,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAC9C,QACF,CAAO,GAAIvN,EAAI,IAAMxB,EAAQ,EAEtBk4B,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAC9C,QACF,CAGAixB,EAAgBzH,EAEhB,QACF,CAGA,GAAIA,EAAY,MAAQ,EACjBL,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAC9CixB,EAAgBzH,EAChB,QACF,CAGAA,EAAkE,OAArDyH,EAAgB,OAAU,GAAKzH,EAAY,MAC1D,MAAWyH,IAEJ9H,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAMhD,GAHAixB,EAAgB,KAGZzH,EAAY,IAAM,CACpB,IAAKL,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KAAKwpB,EACb,MAAO,GAAIA,EAAY,KAAO,CAC5B,IAAKL,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KACJwpB,GAAa,EAAM,IACP,GAAZA,EAAmB,IAEvB,MAAO,GAAIA,EAAY,MAAS,CAC9B,IAAKL,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KACJwpB,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAEvB,KAAO,MAAIA,EAAY,SASrB,MAAM,IAAIl0B,MAAM,sBARhB,IAAK6zB,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KACJwpB,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAIvB,CACF,CAEA,OAAOiC,CACT,CA2BA,SAASrE,EAAehe,GACtB,OAAOwc,EAAOd,YAxHhB,SAAsB1b,GAMpB,IAFAA,GAFAA,EAAMA,EAAI0G,MAAM,KAAK,IAEXib,OAAOjwB,QAAQk2B,EAAmB,KAEpC//B,OAAS,EAAG,MAAO,GAE3B,KAAOmY,EAAInY,OAAS,GAAM,GACxBmY,GAAY,IAEd,OAAOA,CACT,CA4G4B8nB,CAAY9nB,GACxC,CAEA,SAASyf,EAAYroB,EAAKC,EAAK1O,EAAQd,GACrC,IAAIwB,EACJ,IAAKA,EAAI,EAAGA,EAAIxB,KACTwB,EAAIV,GAAU0O,EAAIxP,QAAYwB,GAAK+N,EAAIvP,UADpBwB,EAExBgO,EAAIhO,EAAIV,GAAUyO,EAAI/N,GAExB,OAAOA,CACT,CAKA,SAAS8zB,EAAY11B,EAAKwZ,GACxB,OAAOxZ,aAAewZ,GACZ,MAAPxZ,GAAkC,MAAnBA,EAAI2c,aAA+C,MAAxB3c,EAAI2c,YAAYrT,MACzDtJ,EAAI2c,YAAYrT,OAASkQ,EAAKlQ,IACpC,CACA,SAAS0sB,EAAah2B,GAEpB,OAAOA,GAAQA,CACjB,CAIA,MAAM26B,EAAsB,WAC1B,MAAM2F,EAAW,mBACX3mB,EAAQ,IAAIlT,MAAM,KACxB,IAAK,IAAI7E,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,MAAM2+B,EAAU,GAAJ3+B,EACZ,IAAK,IAAIgoB,EAAI,EAAGA,EAAI,KAAMA,EACxBjQ,EAAM4mB,EAAM3W,GAAK0W,EAAS1+B,GAAK0+B,EAAS1W,EAE5C,CACA,OAAOjQ,CACR,CAV2B,GAa5B,SAAS6iB,EAAoBjzB,GAC3B,MAAyB,oBAAXzC,OAAyB05B,EAAyBj3B,CAClE,CAEA,SAASi3B,IACP,MAAM,IAAI/7B,MAAM,uBAClB,C,8BCpiEA,IAkgCIg8B,EAlgCAtvB,EAAU,EAAQ,MAClBuvB,EAAU,EAAQ,MAClBtvB,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClB8C,EAAU,EAAQ,MAuBlB3C,GAAmB,EAwDnBiV,EAAY,IACZka,EAAgB,IAQhBC,EAAa,IACbC,EAAa,IACbC,EAAe,IASnB,SAAStyB,EAAIuF,EAAMgtB,GAEjB,OADAhtB,EAAKI,IAAMA,EAAI4sB,GACRA,CACT,CAEA,SAASjU,EAAKnC,GACZ,OAAQ,GAAO,IAAM,EAAM,EAAI,EAAI,EACrC,CAEA,SAAS5E,EAAKzV,GAA6B,IAAtB,IAAI8F,EAAM9F,EAAIlQ,SAAiBgW,GAAO,GAAK9F,EAAI8F,GAAO,CAAK,CAShF,SAAS4qB,EAAcjtB,GACrB,IAAIjS,EAAIiS,EAAKC,MAGToC,EAAMtU,EAAEgmB,QACR1R,EAAMrC,EAAK4C,YACbP,EAAMrC,EAAK4C,WAED,IAARP,IAEJjF,EAAMgE,SAASpB,EAAKyB,OAAQ1T,EAAE+lB,YAAa/lB,EAAEm/B,YAAa7qB,EAAKrC,EAAK2C,UACpE3C,EAAK2C,UAAYN,EACjBtU,EAAEm/B,aAAe7qB,EACjBrC,EAAKG,WAAakC,EAClBrC,EAAK4C,WAAaP,EAClBtU,EAAEgmB,SAAW1R,EACK,IAAdtU,EAAEgmB,UACJhmB,EAAEm/B,YAAc,GAEpB,CAGA,SAASC,EAAiBp/B,EAAGiJ,GAC3B21B,EAAMvU,gBAAgBrqB,EAAIA,EAAEq/B,aAAe,EAAIr/B,EAAEq/B,aAAe,EAAIr/B,EAAEs/B,SAAWt/B,EAAEq/B,YAAap2B,GAChGjJ,EAAEq/B,YAAcr/B,EAAEs/B,SAClBJ,EAAcl/B,EAAEiS,KAClB,CAGA,SAASstB,EAASv/B,EAAGksB,GACnBlsB,EAAE+lB,YAAY/lB,EAAEgmB,WAAakG,CAC/B,CAQA,SAASsT,EAAYx/B,EAAGksB,GAGtBlsB,EAAE+lB,YAAY/lB,EAAEgmB,WAAckG,IAAM,EAAK,IACzClsB,EAAE+lB,YAAY/lB,EAAEgmB,WAAiB,IAAJkG,CAC/B,CAUA,SAASuT,EAASxtB,EAAMzD,EAAK6iB,EAAO/iB,GAClC,IAAIgG,EAAMrC,EAAK0C,SAGf,OADIL,EAAMhG,IAAQgG,EAAMhG,GACZ,IAARgG,EAAoB,GAExBrC,EAAK0C,UAAYL,EAGjBjF,EAAMgE,SAAS7E,EAAKyD,EAAKwB,MAAOxB,EAAK6C,QAASR,EAAK+c,GAC3B,IAApBpf,EAAKC,MAAMjC,KACbgC,EAAKK,MAAQhD,EAAQ2C,EAAKK,MAAO9D,EAAK8F,EAAK+c,GAGhB,IAApBpf,EAAKC,MAAMjC,OAClBgC,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAO9D,EAAK8F,EAAK+c,IAG3Cpf,EAAK6C,SAAWR,EAChBrC,EAAKE,UAAYmC,EAEVA,EACT,CAYA,SAASorB,EAAc1/B,EAAG2/B,GACxB,IAEIx2B,EACAmL,EAHAsrB,EAAe5/B,EAAE6/B,iBACjBC,EAAO9/B,EAAEs/B,SAGTS,EAAW//B,EAAEggC,YACbC,EAAajgC,EAAEigC,WACfvD,EAAS18B,EAAEs/B,SAAYt/B,EAAEkgC,OAASrB,EAClC7+B,EAAEs/B,UAAYt/B,EAAEkgC,OAASrB,GAAiB,EAE1CsB,EAAOngC,EAAE4Q,OAETwvB,EAAQpgC,EAAEqgC,OACV5yB,EAAQzN,EAAEyN,KAMV6yB,EAAStgC,EAAEs/B,SAAW3a,EACtB4b,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,GAQzB//B,EAAEggC,aAAehgC,EAAEygC,aACrBb,IAAiB,GAKfK,EAAajgC,EAAE0gC,YAAaT,EAAajgC,EAAE0gC,WAI/C,GAaE,GAAIP,GAXJh3B,EAAQw2B,GAWSI,KAAkBS,GAC/BL,EAAKh3B,EAAQ42B,EAAW,KAAOQ,GAC/BJ,EAAKh3B,KAA0Bg3B,EAAKL,IACpCK,IAAOh3B,KAAwBg3B,EAAKL,EAAO,GAH/C,CAaAA,GAAQ,EACR32B,IAMA,UAESg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1Dg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1Dg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1Dg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1D22B,EAAOQ,GAOhB,GAHAhsB,EAAMqQ,GAAa2b,EAASR,GAC5BA,EAAOQ,EAAS3b,EAEZrQ,EAAMyrB,EAAU,CAGlB,GAFA//B,EAAE2gC,YAAchB,EAChBI,EAAWzrB,EACPA,GAAO2rB,EACT,MAEFM,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,EAC3B,CApCA,SAqCQJ,EAAYlyB,EAAKkyB,EAAYS,IAAU1D,GAA4B,MAAjBkD,GAE5D,OAAIG,GAAY//B,EAAE0gC,UACTX,EAEF//B,EAAE0gC,SACX,CAaA,SAASE,EAAY5gC,GACnB,IACI4b,EAAGrH,EAAG9U,EAAGohC,EAAMpqB,EADfqqB,EAAU9gC,EAAEkgC,OAKhB,EAAG,CAqBD,GApBAW,EAAO7gC,EAAE+gC,YAAc/gC,EAAE0gC,UAAY1gC,EAAEs/B,SAoBnCt/B,EAAEs/B,UAAYwB,GAAWA,EAAUjC,GAAgB,CAErDxvB,EAAMgE,SAASrT,EAAE4Q,OAAQ5Q,EAAE4Q,OAAQkwB,EAASA,EAAS,GACrD9gC,EAAE2gC,aAAeG,EACjB9gC,EAAEs/B,UAAYwB,EAEd9gC,EAAEq/B,aAAeyB,EAUjBllB,EADArH,EAAIvU,EAAEghC,UAEN,GACEvhC,EAAIO,EAAEuQ,OAAOqL,GACb5b,EAAEuQ,KAAKqL,GAAMnc,GAAKqhC,EAAUrhC,EAAIqhC,EAAU,UACjCvsB,GAGXqH,EADArH,EAAIusB,EAEJ,GACErhC,EAAIO,EAAEyN,OAAOmO,GACb5b,EAAEyN,KAAKmO,GAAMnc,GAAKqhC,EAAUrhC,EAAIqhC,EAAU,UAIjCvsB,GAEXssB,GAAQC,CACV,CACA,GAAwB,IAApB9gC,EAAEiS,KAAK0C,SACT,MAmBF,GAJAJ,EAAIkrB,EAASz/B,EAAEiS,KAAMjS,EAAE4Q,OAAQ5Q,EAAEs/B,SAAWt/B,EAAE0gC,UAAWG,GACzD7gC,EAAE0gC,WAAansB,EAGXvU,EAAE0gC,UAAY1gC,EAAEihC,QAjUR,EA0UV,IARAxqB,EAAMzW,EAAEs/B,SAAWt/B,EAAEihC,OACrBjhC,EAAEkhC,MAAQlhC,EAAE4Q,OAAO6F,GAGnBzW,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO6F,EAAM,IAAMzW,EAAEohC,UAIvDphC,EAAEihC,SAEPjhC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO6F,EA5UxC,EA4U0D,IAAMzW,EAAEohC,UAE1EphC,EAAEyN,KAAKgJ,EAAMzW,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OAClClhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASzqB,EAClBA,IACAzW,EAAEihC,WACEjhC,EAAE0gC,UAAY1gC,EAAEihC,OAlVZ,MA2Vd,OAASjhC,EAAE0gC,UAAY7B,GAAqC,IAApB7+B,EAAEiS,KAAK0C,SAsCjD,CA6GA,SAAS0sB,EAAarhC,EAAGwT,GAIvB,IAHA,IAAI8tB,EACAC,IAEK,CAMP,GAAIvhC,EAAE0gC,UAAY7B,EAAe,CAE/B,GADA+B,EAAY5gC,GACRA,EAAE0gC,UAAY7B,GAjkBF,IAikBmBrrB,EACjC,OA7egB,EA+elB,GAAoB,IAAhBxT,EAAE0gC,UACJ,KAEJ,CAyBA,GApBAY,EAAY,EACRthC,EAAE0gC,WAtgBM,IAwgBV1gC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SAxgBxC,EAwgB+D,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,UAOJ,IAAdgC,GAA4BthC,EAAEs/B,SAAWgC,GAAethC,EAAEkgC,OAASrB,IAKrE7+B,EAAEwhC,aAAe9B,EAAc1/B,EAAGshC,IAGhCthC,EAAEwhC,cAzhBM,EAqiBV,GAPAD,EAAS3C,EAAM1T,UAAUlrB,EAAGA,EAAEs/B,SAAWt/B,EAAE2gC,YAAa3gC,EAAEwhC,aA9hBhD,GAgiBVxhC,EAAE0gC,WAAa1gC,EAAEwhC,aAKbxhC,EAAEwhC,cAAgBxhC,EAAEyhC,gBAAuCzhC,EAAE0gC,WAriBvD,EAqiB+E,CACvF1gC,EAAEwhC,eACF,GACExhC,EAAEs/B,WAEFt/B,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SA1iB5C,EA0iBmE,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,eAKQ,MAAnBt/B,EAAEwhC,cACbxhC,EAAEs/B,UACJ,MAEEt/B,EAAEs/B,UAAYt/B,EAAEwhC,aAChBxhC,EAAEwhC,aAAe,EACjBxhC,EAAEkhC,MAAQlhC,EAAE4Q,OAAO5Q,EAAEs/B,UAErBt/B,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SAAW,IAAMt/B,EAAEohC,eAavEG,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,WAE1Ct/B,EAAE0gC,YACF1gC,EAAEs/B,WAEJ,GAAIiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OAjkBgB,CAqkBtB,CAEA,OADA7U,EAAEihC,OAAWjhC,EAAEs/B,SAAW,EAAmBt/B,EAAEs/B,SAAWoC,EAvpBtC,IAwpBhBluB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UAxkBS,EACA,GA6kBlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WAnlBS,EACA,CAwlBxB,CAOA,SAAS8sB,EAAa3hC,EAAGwT,GAOvB,IANA,IAAI8tB,EACAC,EAEAK,IAGK,CAMP,GAAI5hC,EAAE0gC,UAAY7B,EAAe,CAE/B,GADA+B,EAAY5gC,GACRA,EAAE0gC,UAAY7B,GApsBF,IAosBmBrrB,EACjC,OAhnBgB,EAknBlB,GAAoB,IAAhBxT,EAAE0gC,UAAmB,KAC3B,CAyCA,GApCAY,EAAY,EACRthC,EAAE0gC,WAvoBM,IAyoBV1gC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SAzoBxC,EAyoB+D,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,UAMtBt/B,EAAEggC,YAAchgC,EAAEwhC,aAClBxhC,EAAE6hC,WAAa7hC,EAAE2gC,YACjB3gC,EAAEwhC,aAAeE,EAEC,IAAdJ,GAA0BthC,EAAEggC,YAAchgC,EAAEyhC,gBAC5CzhC,EAAEs/B,SAAWgC,GAActhC,EAAEkgC,OAASrB,IAKxC7+B,EAAEwhC,aAAe9B,EAAc1/B,EAAGshC,GAG9BthC,EAAEwhC,cAAgB,IAvsBA,IAwsBlBxhC,EAAEuiB,UA/pBI,IA+pBwBviB,EAAEwhC,cAA8BxhC,EAAEs/B,SAAWt/B,EAAE2gC,YAAc,QAK7F3gC,EAAEwhC,aAAeE,IAMjB1hC,EAAEggC,aA1qBM,GA0qBsBhgC,EAAEwhC,cAAgBxhC,EAAEggC,YAAa,CACjE4B,EAAa5hC,EAAEs/B,SAAWt/B,EAAE0gC,UA3qBlB,EAkrBVa,EAAS3C,EAAM1T,UAAUlrB,EAAGA,EAAEs/B,SAAW,EAAIt/B,EAAE6hC,WAAY7hC,EAAEggC,YAlrBnD,GAwrBVhgC,EAAE0gC,WAAa1gC,EAAEggC,YAAc,EAC/BhgC,EAAEggC,aAAe,EACjB,KACQhgC,EAAEs/B,UAAYsC,IAElB5hC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SA7rB5C,EA6rBmE,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,gBAGK,MAAlBt/B,EAAEggC,aAKb,GAJAhgC,EAAE8hC,gBAAkB,EACpB9hC,EAAEwhC,aAAeE,EACjB1hC,EAAEs/B,WAEEiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA7rBc,CAksBpB,MAAO,GAAI7U,EAAE8hC,iBAgBX,IATAP,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,SAAW,MAInDF,EAAiBp/B,GAAG,GAGtBA,EAAEs/B,WACFt/B,EAAE0gC,YACuB,IAArB1gC,EAAEiS,KAAK4C,UACT,OAntBgB,OAytBlB7U,EAAE8hC,gBAAkB,EACpB9hC,EAAEs/B,WACFt/B,EAAE0gC,WAEN,CAUA,OARI1gC,EAAE8hC,kBAGJP,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,SAAW,IAErDt/B,EAAE8hC,gBAAkB,GAEtB9hC,EAAEihC,OAASjhC,EAAEs/B,SAAWoC,EAAgB1hC,EAAEs/B,SAAWoC,EAvzBjC,IAwzBhBluB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UAxuBS,EACA,GA6uBlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WAnvBS,EACA,CAyvBxB,CAgKA,SAASktB,EAAOC,EAAaC,EAAUC,EAAaC,EAAWj4B,GAC7DhJ,KAAK8gC,YAAcA,EACnB9gC,KAAK+gC,SAAWA,EAChB/gC,KAAKghC,YAAcA,EACnBhhC,KAAKihC,UAAYA,EACjBjhC,KAAKgJ,KAAOA,CACd,CA8CA,SAASk4B,IACPlhC,KAAK+Q,KAAO,KACZ/Q,KAAK2hB,OAAS,EACd3hB,KAAK6kB,YAAc,KACnB7kB,KAAKmhC,iBAAmB,EACxBnhC,KAAKi+B,YAAc,EACnBj+B,KAAK8kB,QAAU,EACf9kB,KAAK+O,KAAO,EACZ/O,KAAKohC,OAAS,KACdphC,KAAKqhC,QAAU,EACfrhC,KAAKkhB,OAjgCW,EAkgChBlhB,KAAKshC,YAAc,EAEnBthC,KAAKg/B,OAAS,EACdh/B,KAAKuhC,OAAS,EACdvhC,KAAKm/B,OAAS,EAEdn/B,KAAK0P,OAAS,KAQd1P,KAAK6/B,YAAc,EAKnB7/B,KAAKuM,KAAO,KAMZvM,KAAKqP,KAAO,KAEZrP,KAAKggC,MAAQ,EACbhgC,KAAK8/B,UAAY,EACjB9/B,KAAKwhC,UAAY,EACjBxhC,KAAKkgC,UAAY,EAEjBlgC,KAAKigC,WAAa,EAOlBjgC,KAAKm+B,YAAc,EAKnBn+B,KAAKsgC,aAAe,EACpBtgC,KAAK2gC,WAAa,EAClB3gC,KAAK4gC,gBAAkB,EACvB5gC,KAAKo+B,SAAW,EAChBp+B,KAAKy/B,YAAc,EACnBz/B,KAAKw/B,UAAY,EAEjBx/B,KAAK8+B,YAAc,EAKnB9+B,KAAK2+B,iBAAmB,EAMxB3+B,KAAKugC,eAAiB,EAYtBvgC,KAAKihB,MAAQ,EACbjhB,KAAKqhB,SAAW,EAEhBrhB,KAAKu/B,WAAa,EAGlBv/B,KAAK++B,WAAa,EAYlB/+B,KAAK6lB,UAAa,IAAI1X,EAAMoC,MAAMkxB,MAClCzhC,KAAK8lB,UAAa,IAAI3X,EAAMoC,MAAM,KAClCvQ,KAAK+lB,QAAa,IAAI5X,EAAMoC,MAAM,IAClCwS,EAAK/iB,KAAK6lB,WACV9C,EAAK/iB,KAAK8lB,WACV/C,EAAK/iB,KAAK+lB,SAEV/lB,KAAKgpB,OAAW,KAChBhpB,KAAKipB,OAAW,KAChBjpB,KAAKkpB,QAAW,KAGhBlpB,KAAKwlB,SAAW,IAAIrX,EAAMoC,MAAMmV,IAIhC1lB,KAAK2mB,KAAO,IAAIxY,EAAMoC,MAAM,KAC5BwS,EAAK/iB,KAAK2mB,MAEV3mB,KAAK6mB,SAAW,EAChB7mB,KAAKwnB,SAAW,EAKhBxnB,KAAKumB,MAAQ,IAAIpY,EAAMoC,MAAM,KAC7BwS,EAAK/iB,KAAKumB,OAIVvmB,KAAKonB,MAAQ,EAEbpnB,KAAKiqB,YAAc,EAoBnBjqB,KAAKmmB,SAAW,EAEhBnmB,KAAKmnB,MAAQ,EAMbnnB,KAAKimB,QAAU,EACfjmB,KAAKkmB,WAAa,EAClBlmB,KAAKomB,QAAU,EACfpmB,KAAK+/B,OAAS,EAGd//B,KAAKilB,OAAS,EAIdjlB,KAAKglB,SAAW,CAalB,CAGA,SAAS0c,EAAiB3wB,GACxB,IAAIjS,EAEJ,OAAKiS,GAASA,EAAKC,OAInBD,EAAKE,SAAWF,EAAKG,UAAY,EACjCH,EAAKuD,UAhsCqB,GAksC1BxV,EAAIiS,EAAKC,OACP8T,QAAU,EACZhmB,EAAEm/B,YAAc,EAEZn/B,EAAEiQ,KAAO,IACXjQ,EAAEiQ,MAAQjQ,EAAEiQ,MAGdjQ,EAAE6iB,OAAU7iB,EAAEiQ,KArqCC,GAqqCmB8uB,EAClC9sB,EAAKK,MAAoB,IAAXtS,EAAEiQ,KACd,EAEA,EACFjQ,EAAEwiC,WAvvCkB,EAwvCpB5D,EAAM9U,SAAS9pB,GA5uCK,GAwtCX0M,EAAIuF,EAAMvC,EAsBrB,CAGA,SAASmzB,EAAa5wB,GACpB,IAlPejS,EAkPX2M,EAAMi2B,EAAiB3wB,GAI3B,OAtvCoB,IAmvChBtF,KAnPW3M,EAoPLiS,EAAKC,OAnPb6uB,YAAc,EAAI/gC,EAAEkgC,OAGtBjc,EAAKjkB,EAAEuQ,MAIPvQ,EAAEyhC,eAAiB9C,EAAoB3+B,EAAEmiB,OAAO8f,SAChDjiC,EAAEygC,WAAa9B,EAAoB3+B,EAAEmiB,OAAO6f,YAC5ChiC,EAAEigC,WAAatB,EAAoB3+B,EAAEmiB,OAAO+f,YAC5CliC,EAAE6/B,iBAAmBlB,EAAoB3+B,EAAEmiB,OAAOggB,UAElDniC,EAAEs/B,SAAW,EACbt/B,EAAEq/B,YAAc,EAChBr/B,EAAE0gC,UAAY,EACd1gC,EAAEihC,OAAS,EACXjhC,EAAEwhC,aAAexhC,EAAEggC,YAAc0B,EACjC1hC,EAAE8hC,gBAAkB,EACpB9hC,EAAEkhC,MAAQ,GAmOHv0B,CACT,CAWA,SAASmW,EAAa7Q,EAAMkQ,EAAOC,EAAQ1P,EAAY4P,EAAUC,GAC/D,IAAKtQ,EACH,OAAOvC,EAET,IAAIO,EAAO,EAiBX,IAxwC0B,IAyvCtBkS,IACFA,EAAQ,GAGNzP,EAAa,GACfzC,EAAO,EACPyC,GAAcA,GAGPA,EAAa,KACpBzC,EAAO,EACPyC,GAAc,IAIZ4P,EAAW,GAAKA,EAlvCF,GALF,IAuvCgCF,GAC9C1P,EAAa,GAAKA,EAAa,IAAMyP,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EApwCQ,EAqwCxB,OAAO7V,EAAIuF,EAAMvC,GAIA,IAAfgD,IACFA,EAAa,GAIf,IAAI1S,EAAI,IAAIoiC,EA0CZ,OAxCAnwB,EAAKC,MAAQlS,EACbA,EAAEiS,KAAOA,EAETjS,EAAEiQ,KAAOA,EACTjQ,EAAEsiC,OAAS,KACXtiC,EAAEyiC,OAAS/vB,EACX1S,EAAEkgC,OAAS,GAAKlgC,EAAEyiC,OAClBziC,EAAEqgC,OAASrgC,EAAEkgC,OAAS,EAEtBlgC,EAAE0iC,UAAYpgB,EAAW,EACzBtiB,EAAEghC,UAAY,GAAKhhC,EAAE0iC,UACrB1iC,EAAEohC,UAAYphC,EAAEghC,UAAY,EAC5BhhC,EAAEmhC,eAAiBnhC,EAAE0iC,UAtvCP,EAsvC+B,GAtvC/B,GAwvCd1iC,EAAE4Q,OAAS,IAAIvB,EAAM+D,KAAgB,EAAXpT,EAAEkgC,QAC5BlgC,EAAEuQ,KAAO,IAAIlB,EAAMoC,MAAMzR,EAAEghC,WAC3BhhC,EAAEyN,KAAO,IAAI4B,EAAMoC,MAAMzR,EAAEkgC,QAK3BlgC,EAAEmrB,YAAc,GAAM7I,EAAW,EAEjCtiB,EAAEqiC,iBAAmC,EAAhBriC,EAAEmrB,YAIvBnrB,EAAE+lB,YAAc,IAAI1W,EAAM+D,KAAKpT,EAAEqiC,kBAIjCriC,EAAEqoB,MAAQ,EAAIroB,EAAEmrB,YAGhBnrB,EAAEsoB,MAAQ,EAAUtoB,EAAEmrB,YAEtBnrB,EAAEmiB,MAAQA,EACVniB,EAAEuiB,SAAWA,EACbviB,EAAEoiB,OAASA,EAEJygB,EAAa5wB,EACtB,CAjWA0sB,EAAsB,CAEpB,IAAIoD,EAAO,EAAG,EAAG,EAAG,EAxiBtB,SAAwB/hC,EAAGwT,GAIzB,IAAIsvB,EAAiB,MAOrB,IALIA,EAAiB9iC,EAAEqiC,iBAAmB,IACxCS,EAAiB9iC,EAAEqiC,iBAAmB,KAI/B,CAEP,GAAIriC,EAAE0gC,WAAa,EAAG,CAUpB,GADAE,EAAY5gC,GACQ,IAAhBA,EAAE0gC,WA1eU,IA0eSltB,EACvB,OAtZgB,EAyZlB,GAAoB,IAAhBxT,EAAE0gC,UACJ,KAGJ,CAIA1gC,EAAEs/B,UAAYt/B,EAAE0gC,UAChB1gC,EAAE0gC,UAAY,EAGd,IAAIqC,EAAY/iC,EAAEq/B,YAAcyD,EAEhC,IAAmB,IAAf9iC,EAAEs/B,UAAkBt/B,EAAEs/B,UAAYyD,KAEpC/iC,EAAE0gC,UAAY1gC,EAAEs/B,SAAWyD,EAC3B/iC,EAAEs/B,SAAWyD,EAEb3D,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA9agB,EAubpB,GAAI7U,EAAEs/B,SAAWt/B,EAAEq/B,aAAgBr/B,EAAEkgC,OAASrB,IAE5CO,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA3bgB,CA+btB,CAIA,OAFA7U,EAAEihC,OAAS,EAlhBS,IAohBhBztB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UApcS,EACA,IA0clB7U,EAAEs/B,SAAWt/B,EAAEq/B,cAEjBD,EAAiBp/B,GAAG,GAChBA,EAAEiS,KAAK4C,WAhdS,EAudxB,GAgdE,IAAIktB,EAAO,EAAG,EAAG,EAAG,EAAGV,GACvB,IAAIU,EAAO,EAAG,EAAG,GAAI,EAAGV,GACxB,IAAIU,EAAO,EAAG,EAAG,GAAI,GAAIV,GAEzB,IAAIU,EAAO,EAAG,EAAG,GAAI,GAAIJ,GACzB,IAAII,EAAO,EAAG,GAAI,GAAI,GAAIJ,GAC1B,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,GAC5B,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,GAC5B,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,GAC/B,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,IA2xBjClkC,EAAQulC,YApcR,SAAqB/wB,EAAMkQ,GACzB,OAAOW,EAAa7Q,EAAMkQ,EAjzCV,EAOF,GAEI,EAnBQ,EA4zC5B,EAmcA1kB,EAAQqlB,aAAeA,EACvBrlB,EAAQolC,aAAeA,EACvBplC,EAAQmlC,iBAAmBA,EAC3BnlC,EAAQulB,iBA9hBR,SAA0B/Q,EAAM1B,GAC9B,OAAK0B,GAASA,EAAKC,MACK,IAApBD,EAAKC,MAAMjC,KAAqBP,GACpCuC,EAAKC,MAAMowB,OAAS/xB,EA7vCA,GA2vCeb,CAIrC,EA0hBAjS,EAAQ2lB,QApcR,SAAiBnR,EAAMuB,GACrB,IAAIyvB,EAAWjjC,EACXsxB,EAAK8D,EAET,IAAKnjB,IAASA,EAAKC,OACjBsB,EAj2CkB,GAi2CCA,EAAQ,EAC3B,OAAOvB,EAAOvF,EAAIuF,EAAMvC,GAAkBA,EAK5C,GAFA1P,EAAIiS,EAAKC,OAEJD,EAAKyB,SACJzB,EAAKwB,OAA2B,IAAlBxB,EAAK0C,UACpB3U,EAAE6iB,SAAWmc,GA12CE,IA02CcxrB,EAChC,OAAO9G,EAAIuF,EAA0B,IAAnBA,EAAK4C,WA51CL,EA41CsCnF,GAQ1D,GALA1P,EAAEiS,KAAOA,EACTgxB,EAAYjjC,EAAEwiC,WACdxiC,EAAEwiC,WAAahvB,EAvyCA,KA0yCXxT,EAAE6iB,OAEJ,GAAe,IAAX7iB,EAAEiQ,KACJgC,EAAKK,MAAQ,EACbitB,EAASv/B,EAAG,IACZu/B,EAASv/B,EAAG,KACZu/B,EAASv/B,EAAG,GACPA,EAAEsiC,QAaL/C,EAASv/B,GAAIA,EAAEsiC,OAAOttB,KAAO,EAAI,IACpBhV,EAAEsiC,OAAO/sB,KAAO,EAAI,IACnBvV,EAAEsiC,OAAOxxB,MAAY,EAAJ,IACjB9Q,EAAEsiC,OAAO96B,KAAW,EAAJ,IAChBxH,EAAEsiC,OAAOhtB,QAAc,GAAJ,IAEjCiqB,EAASv/B,EAAmB,IAAhBA,EAAEsiC,OAAOrtB,MACrBsqB,EAASv/B,EAAIA,EAAEsiC,OAAOrtB,MAAQ,EAAK,KACnCsqB,EAASv/B,EAAIA,EAAEsiC,OAAOrtB,MAAQ,GAAM,KACpCsqB,EAASv/B,EAAIA,EAAEsiC,OAAOrtB,MAAQ,GAAM,KACpCsqB,EAASv/B,EAAe,IAAZA,EAAEmiB,MAAc,EACfniB,EAAEuiB,UAv3CK,GAu3CyBviB,EAAEmiB,MAAQ,EAC1C,EAAI,GACjBod,EAASv/B,EAAiB,IAAdA,EAAEsiC,OAAOntB,IACjBnV,EAAEsiC,OAAOxxB,OAAS9Q,EAAEsiC,OAAOxxB,MAAMxS,SACnCihC,EAASv/B,EAA2B,IAAxBA,EAAEsiC,OAAOxxB,MAAMxS,QAC3BihC,EAASv/B,EAAIA,EAAEsiC,OAAOxxB,MAAMxS,QAAU,EAAK,MAEzC0B,EAAEsiC,OAAO/sB,OACXtD,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAS,IAE3DhmB,EAAEuiC,QAAU,EACZviC,EAAE6iB,OAn1CQ,KAizCV0c,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAe,IAAZA,EAAEmiB,MAAc,EACfniB,EAAEuiB,UAt2CK,GAs2CyBviB,EAAEmiB,MAAQ,EAC1C,EAAI,GACjBod,EAASv/B,EA7yCH,GA8yCNA,EAAE6iB,OAASkc,OA6Bf,CACE,IAAIhc,EA13CQ,GA03CiB/iB,EAAEyiC,OAAS,GAAM,IAAO,EAYrD1f,IATI/iB,EAAEuiB,UA14CgB,GA04CcviB,EAAEmiB,MAAQ,EAC9B,EACLniB,EAAEmiB,MAAQ,EACL,EACO,IAAZniB,EAAEmiB,MACG,EAEA,IAEU,EACP,IAAfniB,EAAEs/B,WAAkBvc,GAx2CZ,IAy2CZA,GAAU,GAAMA,EAAS,GAEzB/iB,EAAE6iB,OAASkc,EACXS,EAAYx/B,EAAG+iB,GAGI,IAAf/iB,EAAEs/B,WACJE,EAAYx/B,EAAGiS,EAAKK,QAAU,IAC9BktB,EAAYx/B,EAAgB,MAAbiS,EAAKK,QAEtBL,EAAKK,MAAQ,CACf,CAIF,GAr3CgB,KAq3CZtS,EAAE6iB,OACJ,GAAI7iB,EAAEsiC,OAAOxxB,MAAqB,CAGhC,IAFAwgB,EAAMtxB,EAAEgmB,QAEDhmB,EAAEuiC,SAAmC,MAAxBviC,EAAEsiC,OAAOxxB,MAAMxS,UAC7B0B,EAAEgmB,UAAYhmB,EAAEqiC,mBACdriC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAEjE4N,EAAcjtB,GACdqf,EAAMtxB,EAAEgmB,QACJhmB,EAAEgmB,UAAYhmB,EAAEqiC,oBAItB9C,EAASv/B,EAA+B,IAA5BA,EAAEsiC,OAAOxxB,MAAM9Q,EAAEuiC,UAC7BviC,EAAEuiC,UAEAviC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAE7DtxB,EAAEuiC,UAAYviC,EAAEsiC,OAAOxxB,MAAMxS,SAC/B0B,EAAEuiC,QAAU,EACZviC,EAAE6iB,OA34CO,GA64Cb,MAEE7iB,EAAE6iB,OA/4CS,GAk5Cf,GAl5Ce,KAk5CX7iB,EAAE6iB,OACJ,GAAI7iB,EAAEsiC,OAAO96B,KAAoB,CAC/B8pB,EAAMtxB,EAAEgmB,QAGR,EAAG,CACD,GAAIhmB,EAAEgmB,UAAYhmB,EAAEqiC,mBACdriC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAEjE4N,EAAcjtB,GACdqf,EAAMtxB,EAAEgmB,QACJhmB,EAAEgmB,UAAYhmB,EAAEqiC,kBAAkB,CACpCjN,EAAM,EACN,KACF,CAIAA,EADEp1B,EAAEuiC,QAAUviC,EAAEsiC,OAAO96B,KAAKlJ,OACkB,IAAxC0B,EAAEsiC,OAAO96B,KAAKsP,WAAW9W,EAAEuiC,WAE3B,EAERhD,EAASv/B,EAAGo1B,EACd,OAAiB,IAARA,GAELp1B,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAErD,IAAR8D,IACFp1B,EAAEuiC,QAAU,EACZviC,EAAE6iB,OAh7CU,GAk7ChB,MAEE7iB,EAAE6iB,OAp7CY,GAu7ClB,GAv7CkB,KAu7Cd7iB,EAAE6iB,OACJ,GAAI7iB,EAAEsiC,OAAOhtB,QAAuB,CAClCgc,EAAMtxB,EAAEgmB,QAGR,EAAG,CACD,GAAIhmB,EAAEgmB,UAAYhmB,EAAEqiC,mBACdriC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAEjE4N,EAAcjtB,GACdqf,EAAMtxB,EAAEgmB,QACJhmB,EAAEgmB,UAAYhmB,EAAEqiC,kBAAkB,CACpCjN,EAAM,EACN,KACF,CAIAA,EADEp1B,EAAEuiC,QAAUviC,EAAEsiC,OAAOhtB,QAAQhX,OACkB,IAA3C0B,EAAEsiC,OAAOhtB,QAAQwB,WAAW9W,EAAEuiC,WAE9B,EAERhD,EAASv/B,EAAGo1B,EACd,OAAiB,IAARA,GAELp1B,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAErD,IAAR8D,IACFp1B,EAAE6iB,OAASic,EAEf,MAEE9+B,EAAE6iB,OAASic,EAsBf,GAnBI9+B,EAAE6iB,SAAWic,IACX9+B,EAAEsiC,OAAO/sB,MACPvV,EAAEgmB,QAAU,EAAIhmB,EAAEqiC,kBACpBnD,EAAcjtB,GAEZjS,EAAEgmB,QAAU,GAAKhmB,EAAEqiC,mBACrB9C,EAASv/B,EAAgB,IAAbiS,EAAKK,OACjBitB,EAASv/B,EAAIiS,EAAKK,OAAS,EAAK,KAChCL,EAAKK,MAAQ,EACbtS,EAAE6iB,OAASkc,IAIb/+B,EAAE6iB,OAASkc,GAMG,IAAd/+B,EAAEgmB,SAEJ,GADAkZ,EAAcjtB,GACS,IAAnBA,EAAK4C,UAQP,OADA7U,EAAEwiC,YAAc,EA5jDA,OAokDb,GAAsB,IAAlBvwB,EAAK0C,UAAkBqW,EAAKxX,IAAUwX,EAAKiY,IA5kDlC,IA6kDlBzvB,EACA,OAAO9G,EAAIuF,GA/jDO,GAmkDpB,GAAIjS,EAAE6iB,SAAWmc,GAAkC,IAAlB/sB,EAAK0C,SACpC,OAAOjI,EAAIuF,GApkDO,GAykDpB,GAAsB,IAAlBA,EAAK0C,UAAkC,IAAhB3U,EAAE0gC,WA5lDT,IA6lDjBltB,GAAwBxT,EAAE6iB,SAAWmc,EAAe,CACrD,IAAIkE,EA/jDoB,IA+jDVljC,EAAEuiB,SAxqBpB,SAAsBviB,EAAGwT,GAGvB,IAFA,IAAI+tB,IAEK,CAEP,GAAoB,IAAhBvhC,EAAE0gC,YACJE,EAAY5gC,GACQ,IAAhBA,EAAE0gC,WAAiB,CACrB,GA97Bc,IA87BVltB,EACF,OA12Bc,EA42BhB,KACF,CAUF,GANAxT,EAAEwhC,aAAe,EAGjBD,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,WAC1Ct/B,EAAE0gC,YACF1gC,EAAEs/B,WACEiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA33BgB,CA+3BtB,CAEA,OADA7U,EAAEihC,OAAS,EAj9BS,IAk9BhBztB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UAl4BS,EACA,GAu4BlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WA74BS,EACA,CAk5BxB,CAsnBmDsuB,CAAanjC,EAAGwT,GA9jDvC,IA+jDrBxT,EAAEuiB,SAxwBT,SAAqBviB,EAAGwT,GAOtB,IANA,IAAI+tB,EACA9zB,EACAqyB,EAAMQ,EAENH,EAAOngC,EAAE4Q,SAEJ,CAKP,GAAI5Q,EAAE0gC,WAAa/b,EAAW,CAE5B,GADAic,EAAY5gC,GACRA,EAAE0gC,WAAa/b,GAr2BH,IAq2BgBnR,EAC9B,OAjxBgB,EAmxBlB,GAAoB,IAAhBxT,EAAE0gC,UAAmB,KAC3B,CAIA,GADA1gC,EAAEwhC,aAAe,EACbxhC,EAAE0gC,WAtyBM,GAsyBoB1gC,EAAEs/B,SAAW,IAE3C7xB,EAAO0yB,EADPL,EAAO9/B,EAAEs/B,SAAW,MAEPa,IAAOL,IAASryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,GAAO,CAC3EQ,EAAStgC,EAAEs/B,SAAW3a,EACtB,UAESlX,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCA,EAAOQ,GAChBtgC,EAAEwhC,aAAe7c,GAAa2b,EAASR,GACnC9/B,EAAEwhC,aAAexhC,EAAE0gC,YACrB1gC,EAAEwhC,aAAexhC,EAAE0gC,UAEvB,CAuBF,GAlBI1gC,EAAEwhC,cA3zBM,GA+zBVD,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAEwhC,aA/zBvB,GAi0BVxhC,EAAE0gC,WAAa1gC,EAAEwhC,aACjBxhC,EAAEs/B,UAAYt/B,EAAEwhC,aAChBxhC,EAAEwhC,aAAe,IAKjBD,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,WAE1Ct/B,EAAE0gC,YACF1gC,EAAEs/B,YAEAiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OAn0BgB,CAu0BtB,CAEA,OADA7U,EAAEihC,OAAS,EAz5BS,IA05BhBztB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UA10BS,EACA,GA+0BlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WAr1BS,EACA,CA01BxB,CA+qB8BuuB,CAAYpjC,EAAGwT,GACrCmrB,EAAoB3+B,EAAEmiB,OAAOjY,KAAKlK,EAAGwT,GAKzC,GA9gDoB,IA2gDhB0vB,GA1gDgB,IA0gDgBA,IAClCljC,EAAE6iB,OAASmc,GA9gDO,IAghDhBkE,GA9gDgB,IA8gDWA,EAK7B,OAJuB,IAAnBjxB,EAAK4C,YACP7U,EAAEwiC,YAAc,GA3lDF,EAumDlB,GA7hDoB,IA6hDhBU,IAlnDc,IAmnDZ1vB,EACForB,EAAMxT,UAAUprB,GAhnDF,IAknDPwT,IAEPorB,EAAMjV,iBAAiB3pB,EAAG,EAAG,GAAG,GAtnDlB,IA0nDVwT,IAEFyQ,EAAKjkB,EAAEuQ,MAEa,IAAhBvQ,EAAE0gC,YACJ1gC,EAAEs/B,SAAW,EACbt/B,EAAEq/B,YAAc,EAChBr/B,EAAEihC,OAAS,KAIjB/B,EAAcjtB,GACS,IAAnBA,EAAK4C,WAEP,OADA7U,EAAEwiC,YAAc,EA9nDF,CAkoDpB,CAIA,OA9oDoB,IA8oDhBhvB,EAtoDgB,EAuoDhBxT,EAAEiQ,MAAQ,EAtoDM,GAyoDL,IAAXjQ,EAAEiQ,MACJsvB,EAASv/B,EAAgB,IAAbiS,EAAKK,OACjBitB,EAASv/B,EAAIiS,EAAKK,OAAS,EAAK,KAChCitB,EAASv/B,EAAIiS,EAAKK,OAAS,GAAM,KACjCitB,EAASv/B,EAAIiS,EAAKK,OAAS,GAAM,KACjCitB,EAASv/B,EAAmB,IAAhBiS,EAAKE,UACjBotB,EAASv/B,EAAIiS,EAAKE,UAAY,EAAK,KACnCotB,EAASv/B,EAAIiS,EAAKE,UAAY,GAAM,KACpCotB,EAASv/B,EAAIiS,EAAKE,UAAY,GAAM,OAIpCqtB,EAAYx/B,EAAGiS,EAAKK,QAAU,IAC9BktB,EAAYx/B,EAAgB,MAAbiS,EAAKK,QAGtB4sB,EAAcjtB,GAIVjS,EAAEiQ,KAAO,IAAKjQ,EAAEiQ,MAAQjQ,EAAEiQ,MAET,IAAdjQ,EAAEgmB,QAhqDW,EACA,EAgqDtB,EAyHAvoB,EAAQgmB,WAvHR,SAAoBxR,GAClB,IAAI4Q,EAEJ,OAAK5Q,GAAsBA,EAAKC,MArmDjB,MAymDf2Q,EAAS5Q,EAAKC,MAAM2Q,SAxmDJ,KA0mDdA,GAzmDa,KA0mDbA,GAzmDgB,KA0mDhBA,GACAA,IAAWic,GACXjc,IAAWkc,GACXlc,IAAWmc,EAEJtyB,EAAIuF,EAAMvC,IAGnBuC,EAAKC,MAAQ,KAEN2Q,IAAWkc,EAAaryB,EAAIuF,GAnrDf,GALA,GAuqDXvC,CAkBX,EAkGAjS,EAAQylB,qBA3FR,SAA8BjR,EAAM2D,GAClC,IAEI5V,EACAyW,EAAKlC,EACLtE,EACAozB,EACA9xB,EACAkC,EACA6vB,EARAztB,EAAaD,EAAWtX,OAU5B,IAAK2T,IAAsBA,EAAKC,MAC9B,OAAOxC,EAMT,GAAa,KAFbO,GADAjQ,EAAIiS,EAAKC,OACAjC,OAEmB,IAATA,GAjpDJ,KAipDkBjQ,EAAE6iB,QAA0B7iB,EAAE0gC,UAC7D,OAAOhxB,EAmCT,IA/Ba,IAATO,IAEFgC,EAAKK,MAAQhD,EAAQ2C,EAAKK,MAAOsD,EAAYC,EAAY,IAG3D7V,EAAEiQ,KAAO,EAGL4F,GAAc7V,EAAEkgC,SACL,IAATjwB,IAEFgU,EAAKjkB,EAAEuQ,MACPvQ,EAAEs/B,SAAW,EACbt/B,EAAEq/B,YAAc,EAChBr/B,EAAEihC,OAAS,GAIbqC,EAAU,IAAIj0B,EAAM+D,KAAKpT,EAAEkgC,QAC3B7wB,EAAMgE,SAASiwB,EAAS1tB,EAAYC,EAAa7V,EAAEkgC,OAAQlgC,EAAEkgC,OAAQ,GACrEtqB,EAAa0tB,EACbztB,EAAa7V,EAAEkgC,QAGjBmD,EAAQpxB,EAAK0C,SACbpD,EAAOU,EAAK6C,QACZrB,EAAQxB,EAAKwB,MACbxB,EAAK0C,SAAWkB,EAChB5D,EAAK6C,QAAU,EACf7C,EAAKwB,MAAQmC,EACbgrB,EAAY5gC,GACLA,EAAE0gC,WA3rDK,GA2rDmB,CAC/BjqB,EAAMzW,EAAEs/B,SACR/qB,EAAIvU,EAAE0gC,UAAY,EAClB,GAEE1gC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO6F,EAhsDtC,EAgsDwD,IAAMzW,EAAEohC,UAE1EphC,EAAEyN,KAAKgJ,EAAMzW,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OAElClhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASzqB,EAClBA,YACSlC,GACXvU,EAAEs/B,SAAW7oB,EACbzW,EAAE0gC,UAAYgB,EACdd,EAAY5gC,EACd,CAWA,OAVAA,EAAEs/B,UAAYt/B,EAAE0gC,UAChB1gC,EAAEq/B,YAAcr/B,EAAEs/B,SAClBt/B,EAAEihC,OAASjhC,EAAE0gC,UACb1gC,EAAE0gC,UAAY,EACd1gC,EAAEwhC,aAAexhC,EAAEggC,YAAc0B,EACjC1hC,EAAE8hC,gBAAkB,EACpB7vB,EAAK6C,QAAUvD,EACfU,EAAKwB,MAAQA,EACbxB,EAAK0C,SAAW0uB,EAChBrjC,EAAEiQ,KAAOA,EA/wDW,CAixDtB,EAWAxS,EAAQ8lC,YAAc,oC,8BCv0DtB7lC,EAAOD,QAAU,EAAjB,I,wBCEAC,EAAOD,QAA8B,oBAAZiJ,SAA2BA,QAAQgI,gBAAmB,I,wBCA/EhR,EAAOD,QAAU0C,KAAKO,K,8BCDtB,IAAIqD,EAAa,EAAQ,MAGzBrG,EAAOD,QAAU,WAChB,OAAOsG,OAAkBc,OAAOkqB,WACjC,C,8BCLA,IAAIyU,EAAgB,EAAQ,MAExB/U,EAA0B,oBAAfC,WAA6B,EAAAD,EAASC,WAGrDhxB,EAAOD,QAAU,WAEhB,IADA,IAA2DwZ,EAAM,GACxDnX,EAAI,EAAGA,EAAI0jC,EAAcllC,OAAQwB,IACN,mBAAxB2uB,EAAE+U,EAAc1jC,MAE1BmX,EAAIA,EAAI3Y,QAAUklC,EAAc1jC,IAGlC,OAAOmX,CACR,C,wBCbAvZ,EAAOD,QAAUie,U,wBCCjB,IACIkF,EAAQrW,OAAOvL,UAAU0D,SACzBU,EAAMjD,KAAKiD,IAGXqgC,EAAW,SAAkBhX,EAAGP,GAGhC,IAFA,IAAIiB,EAAM,GAEDrtB,EAAI,EAAGA,EAAI2sB,EAAEnuB,OAAQwB,GAAK,EAC/BqtB,EAAIrtB,GAAK2sB,EAAE3sB,GAEf,IAAK,IAAIgoB,EAAI,EAAGA,EAAIoE,EAAE5tB,OAAQwpB,GAAK,EAC/BqF,EAAIrF,EAAI2E,EAAEnuB,QAAU4tB,EAAEpE,GAG1B,OAAOqF,CACX,EAqBAzvB,EAAOD,QAAU,SAAcimC,GAC3B,IAAIrL,EAASn3B,KACb,GAAsB,mBAAXm3B,GApCA,sBAoCyBzX,EAAMxW,MAAMiuB,GAC5C,MAAM,IAAIhqB,UAxCE,kDAwCwBgqB,GAyBxC,IAvBA,IAEIsL,EAFAhiB,EAxBI,SAAeiiB,GAEvB,IADA,IAAIzW,EAAM,GACDrtB,EAsBmB,EAtBFgoB,EAAI,EAAGhoB,EAAI8jC,EAAQtlC,OAAQwB,GAAK,EAAGgoB,GAAK,EAC9DqF,EAAIrF,GAAK8b,EAAQ9jC,GAErB,OAAOqtB,CACX,CAkBe0W,CAAMxlC,WAqBbylC,EAAc1gC,EAAI,EAAGi1B,EAAO/5B,OAASqjB,EAAKrjB,QAC1CylC,EAAY,GACPjkC,EAAI,EAAGA,EAAIgkC,EAAahkC,IAC7BikC,EAAUjkC,GAAK,IAAMA,EAKzB,GAFA6jC,EAAQ5kC,SAAS,SAAU,oBA3CnB,SAAUouB,GAElB,IADA,IAAI1W,EAAM,GACD3W,EAAI,EAAGA,EAAIqtB,EAAI7uB,OAAQwB,GAAK,EACjC2W,GAAO0W,EAAIrtB,GACPA,EAAI,EAAIqtB,EAAI7uB,SACZmY,GAsC0D,KAnClE,OAAOA,CACX,CAkCqDutB,CAAMD,GAAkB,4CAAjEhlC,CAxBK,WACT,GAAImC,gBAAgByiC,EAAO,CACvB,IAAIz6B,EAASmvB,EAAOjuB,MAChBlJ,KACAuiC,EAAS9hB,EAAMtjB,YAEnB,OAAIkM,OAAOrB,KAAYA,EACZA,EAEJhI,IACX,CACA,OAAOm3B,EAAOjuB,MACVs5B,EACAD,EAAS9hB,EAAMtjB,WAGvB,GAUIg6B,EAAOr5B,UAAW,CAClB,IAAIilC,EAAQ,WAAkB,EAC9BA,EAAMjlC,UAAYq5B,EAAOr5B,UACzB2kC,EAAM3kC,UAAY,IAAIilC,EACtBA,EAAMjlC,UAAY,IACtB,CAEA,OAAO2kC,CACX,C,wBChFAjmC,EAAOD,QAAUkF,K,wBCAjBjF,EAAOD,QAAUymC,c,wBCDjB,IAEIC,EACAC,EAHAC,EAAUtlC,SAASC,UAAU0D,SAC7B4hC,EAAkC,iBAAZ59B,SAAoC,OAAZA,SAAoBA,QAAQ0D,MAG9E,GAA4B,mBAAjBk6B,GAAgE,mBAA1B/5B,OAAOC,eACvD,IACC25B,EAAe55B,OAAOC,eAAe,CAAC,EAAG,SAAU,CAClD3G,IAAK,WACJ,MAAMugC,CACP,IAEDA,EAAmB,CAAC,EAEpBE,EAAa,WAAc,MAAM,EAAI,EAAG,KAAMH,EAC/C,CAAE,MAAOp1B,GACJA,IAAMq1B,IACTE,EAAe,KAEjB,MAEAA,EAAe,KAGhB,IAAIC,EAAmB,cACnBC,EAAe,SAA4BpmC,GAC9C,IACC,IAAIqmC,EAAQJ,EAAQplC,KAAKb,GACzB,OAAOmmC,EAAiBzqB,KAAK2qB,EAC9B,CAAE,MAAOjlC,GACR,OAAO,CACR,CACD,EAEIklC,EAAoB,SAA0BtmC,GACjD,IACC,OAAIomC,EAAapmC,KACjBimC,EAAQplC,KAAKb,IACN,EACR,CAAE,MAAOoB,GACR,OAAO,CACR,CACD,EACIohB,EAAQrW,OAAOvL,UAAU0D,SAOzB8rB,EAAmC,mBAAX3pB,UAA2BA,OAAOkqB,YAE1D4V,IAAW,IAAK,CAAC,IAEjBC,EAAQ,WAA8B,OAAO,CAAO,EACxD,GAAwB,iBAAbC,SAAuB,CAEjC,IAAIC,EAAMD,SAASC,IACflkB,EAAM3hB,KAAK6lC,KAASlkB,EAAM3hB,KAAK4lC,SAASC,OAC3CF,EAAQ,SAA0BxmC,GAGjC,IAAKumC,IAAWvmC,UAA4B,IAAVA,GAA0C,iBAAVA,GACjE,IACC,IAAIqY,EAAMmK,EAAM3hB,KAAKb,GACrB,OAlBU,+BAmBTqY,GAlBU,qCAmBPA,GAlBO,4BAmBPA,GAxBS,oBAyBTA,IACc,MAAbrY,EAAM,GACZ,CAAE,MAAOoB,GAAU,CAEpB,OAAO,CACR,EAEF,CAEA9B,EAAOD,QAAU6mC,EACd,SAAoBlmC,GACrB,GAAIwmC,EAAMxmC,GAAU,OAAO,EAC3B,IAAKA,EAAS,OAAO,EACrB,GAAqB,mBAAVA,GAAyC,iBAAVA,EAAsB,OAAO,EACvE,IACCkmC,EAAalmC,EAAO,KAAM+lC,EAC3B,CAAE,MAAO3kC,GACR,GAAIA,IAAM4kC,EAAoB,OAAO,CACtC,CACA,OAAQI,EAAapmC,IAAUsmC,EAAkBtmC,EAClD,EACE,SAAoBA,GACrB,GAAIwmC,EAAMxmC,GAAU,OAAO,EAC3B,IAAKA,EAAS,OAAO,EACrB,GAAqB,mBAAVA,GAAyC,iBAAVA,EAAsB,OAAO,EACvE,GAAIowB,EAAkB,OAAOkW,EAAkBtmC,GAC/C,GAAIomC,EAAapmC,GAAU,OAAO,EAClC,IAAI2mC,EAAWnkB,EAAM3hB,KAAKb,GAC1B,QApDY,sBAoDR2mC,GAnDS,+BAmDeA,IAA0B,iBAAmBjrB,KAAKirB,KACvEL,EAAkBtmC,EAC1B,C,wBCjGDV,EAAOD,QAAU8M,M,wBCAjB7M,EAAOD,QAAU4Q,S,wBCkBjB3Q,EAAOD,QAAU,CAGfmzB,WAAoB,EACpBoU,gBAAoB,EACpBhU,aAAoB,EACpBiU,aAAoB,EACpBtU,SAAoB,EACpBuU,QAAoB,EACpBC,QAAoB,EAKpB9U,KAAoB,EACpBU,aAAoB,EACpBF,YAAoB,EACpBuU,SAAoB,EACpB11B,gBAAoB,EACpB21B,cAAoB,EAEpBvU,aAAoB,EAIpBwU,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BC,uBAA0B,EAG1BC,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1BC,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1BC,WAA0B,E,4BC9D5B,IAAIC,EAAmC,oBAAf5hC,YACgB,oBAAhByC,aACe,oBAAff,WAExB,SAASmgC,EAAKloC,EAAKyN,GACjB,OAAOpB,OAAOvL,UAAU6hB,eAAe5hB,KAAKf,EAAKyN,EACnD,CAEAlO,EAAQuY,OAAS,SAAU9X,GAEzB,IADA,IAAImoC,EAAU1hC,MAAM3F,UAAUqJ,MAAMpJ,KAAKZ,UAAW,GAC7CgoC,EAAQ/nC,QAAQ,CACrB,IAAIse,EAASypB,EAAQx5B,QACrB,GAAK+P,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIvO,UAAUuO,EAAS,sBAG/B,IAAK,IAAIhB,KAAKgB,EACRwpB,EAAKxpB,EAAQhB,KACf1d,EAAI0d,GAAKgB,EAAOhB,GARK,CAW3B,CAEA,OAAO1d,CACT,EAIAT,EAAQ8Y,UAAY,SAAU/H,EAAKF,GACjC,OAAIE,EAAIlQ,SAAWgQ,EAAeE,EAC9BA,EAAI8H,SAAmB9H,EAAI8H,SAAS,EAAGhI,IAC3CE,EAAIlQ,OAASgQ,EACNE,EACT,EAGA,IAAI83B,EAAU,CACZjzB,SAAU,SAAUkzB,EAAM14B,EAAK24B,EAAUlyB,EAAKmyB,GAC5C,GAAI54B,EAAIyI,UAAYiwB,EAAKjwB,SACvBiwB,EAAKrX,IAAIrhB,EAAIyI,SAASkwB,EAAUA,EAAWlyB,GAAMmyB,QAInD,IAAK,IAAI3mC,EAAI,EAAGA,EAAIwU,EAAKxU,IACvBymC,EAAKE,EAAY3mC,GAAK+N,EAAI24B,EAAW1mC,EAEzC,EAEA6jB,cAAe,SAAUf,GACvB,IAAI9iB,EAAG4mC,EAAGpyB,EAAK+C,EAAKqM,EAAOxa,EAI3B,IADAoL,EAAM,EACDxU,EAAI,EAAG4mC,EAAI9jB,EAAOtkB,OAAQwB,EAAI4mC,EAAG5mC,IACpCwU,GAAOsO,EAAO9iB,GAAGxB,OAMnB,IAFA4K,EAAS,IAAI3E,WAAW+P,GACxB+C,EAAM,EACDvX,EAAI,EAAG4mC,EAAI9jB,EAAOtkB,OAAQwB,EAAI4mC,EAAG5mC,IACpC4jB,EAAQd,EAAO9iB,GACfoJ,EAAOgmB,IAAIxL,EAAOrM,GAClBA,GAAOqM,EAAMplB,OAGf,OAAO4K,CACT,GAGEy9B,EAAY,CACdtzB,SAAU,SAAUkzB,EAAM14B,EAAK24B,EAAUlyB,EAAKmyB,GAC5C,IAAK,IAAI3mC,EAAI,EAAGA,EAAIwU,EAAKxU,IACvBymC,EAAKE,EAAY3mC,GAAK+N,EAAI24B,EAAW1mC,EAEzC,EAEA6jB,cAAe,SAAUf,GACvB,MAAO,GAAG7a,OAAOqC,MAAM,GAAIwY,EAC7B,GAMFnlB,EAAQmpC,SAAW,SAAUC,GACvBA,GACFppC,EAAQ2V,KAAQ7O,WAChB9G,EAAQgU,MAAQzK,YAChBvJ,EAAQ8U,MAAQtM,WAChBxI,EAAQuY,OAAOvY,EAAS6oC,KAExB7oC,EAAQ2V,KAAQzO,MAChBlH,EAAQgU,MAAQ9M,MAChBlH,EAAQ8U,MAAQ5N,MAChBlH,EAAQuY,OAAOvY,EAASkpC,GAE5B,EAEAlpC,EAAQmpC,SAAST,E,8BCtGjB,IAAIlnC,EAAOF,SAASC,UAAUC,KAC1B6nC,EAAUv8B,OAAOvL,UAAU6hB,eAC3BjZ,EAAO,EAAQ,MAGnBlK,EAAOD,QAAUmK,EAAK3I,KAAKA,EAAM6nC,E,GCN7BC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBpkC,IAAjBqkC,EACH,OAAOA,EAAazpC,QAGrB,IAAIC,EAASqpC,EAAyBE,GAAY,CAGjDxpC,QAAS,CAAC,GAOX,OAHA0pC,EAAoBF,GAAUvpC,EAAQA,EAAOD,QAASupC,GAG/CtpC,EAAOD,OACf,CCrBAupC,EAAoBjnC,EAAI,CAACtC,EAAS2pC,KACjC,IAAI,IAAIz7B,KAAOy7B,EACXJ,EAAoBK,EAAED,EAAYz7B,KAASq7B,EAAoBK,EAAE5pC,EAASkO,IAC5EpB,OAAOC,eAAe/M,EAASkO,EAAK,CAAE9M,YAAY,EAAMgF,IAAKujC,EAAWz7B,MCJ3Eq7B,EAAoBvY,EAAI,WACvB,GAA0B,iBAAfC,WAAyB,OAAOA,WAC3C,IACC,OAAOxtB,MAAQ,IAAInC,SAAS,cAAb,EAChB,CAAE,MAAOS,GACR,GAAsB,iBAAXoR,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBo2B,EAAoBK,EAAI,CAACnpC,EAAKopC,IAAU/8B,OAAOvL,UAAU6hB,eAAe5hB,KAAKf,EAAKopC,GCClFN,EAAoBO,EAAK9pC,IACH,oBAAXoH,QAA0BA,OAAOkqB,aAC1CxkB,OAAOC,eAAe/M,EAASoH,OAAOkqB,YAAa,CAAE3wB,MAAO,WAE7DmM,OAAOC,eAAe/M,EAAS,aAAc,CAAEW,OAAO,K,uOCJvD,MAcMopC,EAAOpS,IACX,GAAmB,kBAARA,EACT,OAAOA,EAIT,GAAY,UADZA,EAAMA,EAAIgD,OAAO1D,gBACa,QAARU,GAAyB,OAARA,EAAc,OAAO,EAC5D,GAAY,UAARA,GAA2B,OAARA,GAAwB,QAARA,EAAe,OAAO,EAC7D,MAAMzyB,MACJ,kEAAkEyyB,MAIhEqS,EAAS,CACbC,KAAM,CACJC,SAAUH,EACVI,KAAMJ,EACNK,iBAAkBL,EAClBM,SAAUN,EACV1rB,WAAY0rB,EACZO,iBAlCQ3S,IACV,GAAmB,iBAARA,EACT,OAAOA,EAGTA,EAAMA,EAAIV,cACV,IAAIngB,EAAIhO,SAAS6uB,GAIjB,OAHIA,EAAI4S,SAAS,OAAMzzB,GAAK,MACxB6gB,EAAI4S,SAAS,OAAMzzB,GAAK,SACxB6gB,EAAI4S,SAAS,OAAMzzB,GAAK,YACrBA,KAoCH0zB,EAAqB,qCACrBC,EAAgB,mBAOhBC,EAAsB,uCACtBC,EAAsB,uBAGtBC,EAA+B,oBAsC/BC,EAAuBtzB,IACHA,EAAK7L,MAAM,kBAAoB,IAAI7K,OACnC,GAAM,EAG1BiqC,EAAevzB,GACZA,EAAKmI,MAAM,IAAIN,OAAO,CAAC2rB,EAASloC,EAAGmoC,EAAKzzB,KAC7C,MAAM0zB,EAAgB,MAANpoC,GAA+B,OAAlB0U,EAAKyzB,EAAM,GAClCE,EAAyB,OAANroC,GAAgC,MAAlB0U,EAAKyzB,EAAM,GAClD,OAAIC,GAAWC,EACNH,EAEFA,EAAUloC,GAChB,IAGCsoC,EAAQ5zB,GACG,MAARA,EAAeA,EAAK0f,cAAgB,KAGvCmU,EAAU,CAACC,EAASC,EAAYvhC,IAC7B,CAACohC,EAAME,GAAUC,EAAYH,EAAMphC,IACvC4W,OAAOqO,GAAU,MAALA,GACZxO,KAAK,KAGJ+qB,EAAgB1tB,IACpB,MAAM2tB,EAAe3tB,EAAK6B,MAAM,KAC1B2rB,EAAUG,EAAap8B,QACvBrF,EAAOyhC,EAAalrB,MACpBgrB,EAAaE,EAAa3qC,OAAS2qC,EAAahrB,KAAK,UAAOpb,EAElE,MAAO,CACLimC,UACAC,aACAvhC,OACA8T,KAAMutB,EAAQC,EAASC,EAAYvhC,GACnC0hC,YAAaL,EAAQC,EAASC,EAAY,MAC1CI,YAAaL,IAYV,MAAMM,EACX,WAAAvuB,CAAY7F,GACV,IAAI8zB,EAAU,KACVC,EAAa,KACjB7nC,KAAKmoC,aAAer0B,EAChBA,EAAKmI,MAAM,MAAMmsB,IAAIC,IACnB,IAAI/hC,EAAO,KACPpJ,EAAQ,KAEZ,MAAMorC,EAAcD,EAAKnR,OACnBqR,EAhGWF,KACzB,MAAMjiB,EAAU2gB,EAAmB1/B,KAAKghC,GACxC,GAAe,MAAXjiB,EAAiB,CACnB,MAAOwhB,EAASC,GAAczhB,EAAQjf,MAAM,GAC5C,MAAO,CAACygC,EAASC,EACnB,CACA,OAAO,MA0F0BW,CAAmBF,GACtCL,EAAgC,MAApBM,EAClB,GAAIN,GACAL,EAASC,GAAcU,MACpB,CACL,MAAME,EA5FUJ,KAC1B,MAAMjiB,EAAU6gB,EAAoB5/B,KAAKghC,GACzC,GAAe,MAAXjiB,EAAiB,CACnB,MAAO9f,EAAMoiC,EAAW,QAAUtiB,EAAQjf,MAAM,GAC1CwhC,EAOaD,KACrB,MAAME,EAAiBzB,EAA6B9/B,KAAKqhC,GACzD,GAAsB,MAAlBE,EACF,OAAOF,EAET,MAAOG,EAAqBz0B,GAAWw0B,EAAezhC,MAAM,GAE5D,OACEigC,EAAqByB,IACrBzB,EAAqBhzB,GAEd,GAAGy0B,IAAsBz0B,IAE3By0B,GApBwBC,CAAeJ,GAE5C,MAAO,CAACpiC,EADmB+gC,EAAasB,GAE1C,CACA,OAAO,MAoF6BI,CAAoBT,GACN,MAArBG,KAEfniC,EAAMpJ,GAASurC,EAErB,CAEA,MAAMruB,EAAOutB,EAAQC,EAASC,EAAYvhC,GAC1C,MAAO,CAAE+hC,OAAMJ,YAAWL,UAASC,aAAYvhC,OAAMpJ,QAAOkd,UAE9D,EACN,CAEA,WAAOpN,CAAK8G,GACV,OAAO,IAAIo0B,EAAUp0B,EACvB,CAEA,SAAMnR,CAAIyX,EAAM4uB,GAAS,GACvB,MAAMC,EAAiBnB,EAAc1tB,GAAMA,KACrC8uB,EAAYlpC,KAAKmoC,aACpBjrB,OAAOisB,GAAUA,EAAO/uB,OAAS6uB,GACjCb,IAAI,EAAGR,UAASthC,OAAMpJ,YACrB,MAAMqJ,EAAKggC,EAAOqB,IAAYrB,EAAOqB,GAASthC,GAC9C,OAAOC,EAAKA,EAAGrJ,GAASA,IAE5B,OAAO8rC,EAASE,EAAYA,EAAUrsB,KACxC,CAEA,YAAMmsB,CAAO5uB,GACX,OAAOpa,KAAK2C,IAAIyX,GAAM,EACxB,CAEA,oBAAMgvB,CAAexB,GACnB,OAAO5nC,KAAKmoC,aACTjrB,OAAOisB,GAAUA,EAAOlB,WAAakB,EAAOvB,UAAYA,GACxDQ,IAAIe,GAAUA,EAAOtB,WAC1B,CAEA,mBAAMwB,CAAczB,EAASC,GAC3B7nC,KAAKmoC,aAAenoC,KAAKmoC,aAAajrB,OACpCisB,KACIA,EAAOvB,UAAYA,GAAWuB,EAAOtB,aAAeA,GAE5D,CAEA,YAAMyB,CAAOlvB,EAAMld,GACjB,OAAO8C,KAAKguB,IAAI5T,EAAMld,GAAO,EAC/B,CAEA,SAAM8wB,CAAI5T,EAAMld,EAAOosC,GAAS,GAC9B,MAAM,QACJ1B,EAAO,WACPC,EAAU,KACVvhC,EACA8T,KAAM6uB,EAAc,YACpBjB,EAAW,UACXC,GACEH,EAAc1tB,GAEZmvB,GAlFavpB,EAmFjBhgB,KAAKmoC,aAnFmBqB,EAoFxBL,GAAUA,EAAO/uB,OAAS6uB,EAnFvBjpB,EAAMrE,OAAO,CAAC8tB,EAAWC,EAAM7wB,IAC7B2wB,EAASE,GAAQ7wB,EAAQ4wB,GAC9B,IAHgB,IAACzpB,EAAOwpB,EAsF1B,GAAa,MAATtsC,GACmB,IAAjBqsC,GACFvpC,KAAKmoC,aAAaphC,OAAOwiC,EAAa,QAGxC,IAAqB,IAAjBA,EAAoB,CACtB,MAAMJ,EAASnpC,KAAKmoC,aAAaoB,GAE3BI,EAAiBtgC,OAAOyL,OAAO,CAAC,EAAGq0B,EAAQ,CAC/C7iC,OACApJ,QACA0sC,UAAU,IAERN,EACFtpC,KAAKmoC,aAAaphC,OAAOwiC,EAAc,EAAG,EAAGI,GAE7C3pC,KAAKmoC,aAAaoB,GAAeI,CAErC,KAAO,CACL,MAAME,EAAe7pC,KAAKmoC,aAAa2B,UACrCX,GAAUA,EAAO/uB,OAAS4tB,GAEtB+B,EAAY,CAChBnC,UACAC,aACAvhC,OACApJ,QACA0sC,UAAU,EACVxvB,KAAM6uB,GAER,GAAIjC,EAAcpuB,KAAKgvB,IAAYV,EAAoBtuB,KAAKtS,GAC1D,GAAIujC,GAAgB,EAElB7pC,KAAKmoC,aAAaphC,OAAO8iC,EAAe,EAAG,EAAGE,OACzC,CAEL,MAAMC,EAAa,CACjB/B,YACAL,UACAC,aACA+B,UAAU,EACVxvB,KAAM4tB,GAERhoC,KAAKmoC,aAAah8B,KAAK69B,EAAYD,EACrC,CAEJ,CAEJ,CAEA,QAAAvoC,GACE,OAAOxB,KAAKmoC,aACTC,IAAI,EAAGC,OAAMT,UAASC,aAAYvhC,OAAMpJ,QAAO0sC,YAAW,KACpDA,EAGO,MAARtjC,GAAyB,MAATpJ,EACG,iBAAVA,GAAsB,OAAO0b,KAAK1b,GAEpC,KAAKoJ,QAAWpJ,KAElB,KAAKoJ,OAAUpJ,IAEN,MAAd2qC,EACK,IAAID,MAAYC,MAElB,IAAID,KAZFS,GAcVtrB,KAAK,KACV,EC/RK,MAAMktB,EASX,gBAAatnC,EAAI,GAAEunC,EAAE,OAAEC,IAGrB,MAAMr2B,QAAao2B,EAAGlsC,KAAK,GAAGmsC,WAAiB,CAAE98B,SAAU,SAC3D,OAAO66B,EAAUl7B,KAAK8G,EACxB,CAWA,iBAAas2B,EAAK,GAAEF,EAAE,OAAEC,EAAM,OAAEhB,UAGxBe,EAAG/qC,MAAM,GAAGgrC,WAAiBhB,EAAO3nC,WAAY,CACpD6L,SAAU,QAEd,E,cCtCK,SAASg9B,EAAQjwB,GACtB,MAAMrS,EAAO9I,KAAKiD,IAAIkY,EAAKia,YAAY,KAAMja,EAAKia,YAAY,OAC9D,OAAc,IAAVtsB,EAAoB,IACX,IAATA,EAAmB,IAChBqS,EAAKjT,MAAM,EAAGY,EACvB,CC+EO,SAAS,KAAQ0Y,GACtB,GAAoB,IAAhBA,EAAKrjB,OAAc,MAAO,IAC9B,IAAIktC,EACJ,IAAK,IAAI1rC,EAAI,EAAGA,EAAI6hB,EAAKrjB,SAAUwB,EAAG,CACpC,MAAMkO,EAAM2T,EAAK7hB,GACbkO,EAAI1P,OAAS,SACAuE,IAAX2oC,EAAsBA,EAASx9B,EAC9Bw9B,GAAU,IAAMx9B,EAEzB,CACA,YAAenL,IAAX2oC,EAA6B,IA3BnC,SAAmBlwB,GACjB,IAAKA,EAAKhd,OAAQ,MAAO,IAEzB,MAAMmtC,EAAyB,MAAZnwB,EAAK,GAClBowB,EAAoC,MAAhBpwB,EAAKqwB,IAAI,GAInC,OAFArwB,EAnEF,SAAyBA,EAAMswB,GAC7B,IAAIplB,EAAM,GACNqlB,EAAoB,EACpBC,GAAa,EACbC,EAAO,EACPC,EAAO,KACX,IAAK,IAAIlsC,EAAI,EAAGA,GAAKwb,EAAKhd,SAAUwB,EAAG,CACrC,GAAIA,EAAIwb,EAAKhd,OAAQ0tC,EAAO1wB,EAAKxb,OAC5B,IAAa,MAATksC,EAAc,MAClBA,EAAO,IAEZ,GAAa,MAATA,EAAc,CAChB,GAAIF,IAAchsC,EAAI,GAAc,IAATisC,QAEpB,GAAa,IAATA,EAAY,CACrB,GACEvlB,EAAIloB,OAAS,GACS,IAAtButC,GACe,MAAfrlB,EAAImlB,IAAI,IACO,MAAfnlB,EAAImlB,IAAI,GACR,CACA,GAAInlB,EAAIloB,OAAS,EAAG,CAClB,MAAM2tC,EAAiBzlB,EAAI+O,YAAY,MACf,IAApB0W,GACFzlB,EAAM,GACNqlB,EAAoB,IAEpBrlB,EAAMA,EAAIne,MAAM,EAAG4jC,GACnBJ,EAAoBrlB,EAAIloB,OAAS,EAAIkoB,EAAI+O,YAAY,MAEvDuW,EAAYhsC,EACZisC,EAAO,EACP,QACF,CAAO,GAAmB,IAAfvlB,EAAIloB,OAAc,CAC3BkoB,EAAM,GACNqlB,EAAoB,EACpBC,EAAYhsC,EACZisC,EAAO,EACP,QACF,CACF,CACIH,IACFplB,GAAOA,EAAIloB,OAAS,EAAI,MAAQ,KAChCutC,EAAoB,EAExB,MACMrlB,EAAIloB,OAAS,EAAGkoB,GAAO,IAAMlL,EAAKjT,MAAMyjC,EAAY,EAAGhsC,GACtD0mB,EAAMlL,EAAKjT,MAAMyjC,EAAY,EAAGhsC,GACrC+rC,EAAoB/rC,EAAIgsC,EAAY,EAEtCA,EAAYhsC,EACZisC,EAAO,CACT,KAAoB,MAATC,IAA0B,IAAVD,IACvBA,EAEFA,GAAQ,CAEZ,CACA,OAAOvlB,CACT,CAQS0lB,CAAgB5wB,GAAOmwB,IAEpBntC,QAINotC,IAAmBpwB,GAAQ,KAExBmwB,EAAa,IAAInwB,IAASA,GAL3BmwB,EAAmB,IAChBC,EAAoB,KAAO,GAKtC,CAaSS,CAAUX,EACnB,CCtFO,MAAM,EAWX,sBAAaY,EAAU,GAAEhB,EAAE,IAAE/V,EAAG,OAAEgW,EAAS,EAAKhW,EAAK,QAAO,SAAEgX,IAE5D,GAA2B,SCvBxB,SAAkB/wB,GACvB,MAAMrS,EAAO9I,KAAKiD,IAAIkY,EAAKia,YAAY,KAAMja,EAAKia,YAAY,OAI9D,OAHItsB,GAAQ,IACVqS,EAAOA,EAAKjT,MAAMY,EAAO,IAEpBqS,CACT,CDiBQgxB,CAASD,GAAsB,OAAO,EAE1C,GAAiB,MAAbA,EAAkB,OAAO,EAE7B,IAAIE,EAAW,GACf,MAAMC,EAAe,EAAKnB,EAAQ,OAAQ,iBAChCD,EAAGqB,OAAOD,KAClBD,QAAiBnB,EAAGlsC,KAAKstC,EAAc,SAGzC,MAAME,EAAQ,CACZ,CACEC,UAAW,EAAKtX,EAAK,cACrBgX,aAGEO,EAASP,EAASlvB,MAAM,KAAKiB,OAAOjZ,SAC1C,IAAK,IAAIrF,EAAI,EAAGA,EAAI8sC,EAAOtuC,OAAQwB,IAAK,CACtC,MAAM+sC,EAASD,EAAOvkC,MAAM,EAAGvI,GAAGme,KAAK,KACjC6uB,EAAOF,EAAOvkC,MAAMvI,GAAGme,KAAK,KAClCyuB,EAAMr/B,KAAK,CACTs/B,UAAW,EAAKtX,EAAKwX,EAAQ,cAC7BR,SAAUS,GAEd,CACA,IAAIC,GAAgB,EACpB,IAAK,MAAMnxB,KAAK8wB,EAAO,CACrB,IAAII,EACJ,IACEA,QAAa1B,EAAGlsC,KAAK0c,EAAE+wB,UAAW,OACpC,CAAE,MAAOjgC,GACP,GAAiB,UAAbA,EAAI6Z,KAAkB,QAC5B,CACA,MAAMymB,EAAMC,IAAS/vB,IAAIqvB,GACzBS,EAAI9vB,IAAI4vB,GAIR,MAAMI,EAAY3B,EAAQ3vB,EAAEywB,UAC5B,GAAkB,MAAda,GAAqBF,EAAI9uB,QAAQgvB,GAAY,OAAO,EAGtDH,EADEA,GACeC,EAAIlzB,KAAK8B,EAAEywB,UAAU3uB,UAEtBsvB,EAAIlzB,KAAK8B,EAAEywB,UAAU5uB,OAEzC,CACA,OAAOsvB,CACT,E,cEvEK,MAAMI,UAAkBxqC,MAC7B,WAAAkY,CAAYM,GACV0iB,MAAM1iB,GAGNja,KAAKksC,OAAS,EAChB,CAEA,MAAAzU,GAEE,MAAO,CACLpS,KAAMrlB,KAAKqlB,KACX9kB,KAAMP,KAAKO,KACX2rC,OAAQlsC,KAAKksC,OACbjyB,QAASja,KAAKia,QACd2iB,MAAO58B,KAAK48B,MAEhB,CAEA,QAAAuP,CAASC,GACP,MAAM9tC,EAAI,IAAI2tC,EAAUG,EAAKnyB,SAK7B,OAJA3b,EAAE+mB,KAAO+mB,EAAK/mB,KACd/mB,EAAEiC,KAAO6rC,EAAK7rC,KACdjC,EAAE4tC,OAASE,EAAKF,OAChB5tC,EAAEs+B,MAAQwP,EAAKxP,MACRt+B,CACT,CAEA,wBAAI+tC,GACF,OAAO,CACT,EC5BK,MAAMC,UAA2BL,EAItC,WAAAtyB,CAAY4yB,GACV5P,MACE,wEAAwE4P,EAAU/qC,yHAEpFxB,KAAKqlB,KAAOrlB,KAAKsG,KAAOgmC,EAAmBjnB,KAC3CrlB,KAAKO,KAAO,CAAEgsC,YAChB,EAGFD,EAAmBjnB,KAAO,qBCbnB,MAAM,UAAsB4mB,EAIjC,WAAAtyB,CAAYM,GACV0iB,MACE,kbAAkb1iB,KAEpbja,KAAKqlB,KAAOrlB,KAAKsG,KAAO,EAAc+e,KACtCrlB,KAAKO,KAAO,CAAE0Z,UAChB,EAGF,EAAcoL,KAAO,gBCbd,MAAMmnB,UAA4BP,EAIvC,WAAAtyB,CAAYwxB,GACVxO,MAAM,iBAAiBwO,0CACvBnrC,KAAKqlB,KAAOrlB,KAAKsG,KAAOkmC,EAAoBnnB,KAC5CrlB,KAAKO,KAAO,CAAE4qC,WAChB,EAGFqB,EAAoBnnB,KAAO,sBCXpB,MAAMonB,EACX,WAAA9yB,CAAY1b,GACV+B,KAAK/B,OAASA,EACd+B,KAAK0sC,OAAS,CAChB,CAEA,GAAAC,GACE,OAAO3sC,KAAK0sC,QAAU1sC,KAAK/B,OAAOb,MACpC,CAEA,IAAAwvC,GACE,OAAO5sC,KAAK0sC,MACd,CAEA,IAAAG,CAAKx5B,GACHrT,KAAK0sC,OAASr5B,CAChB,CAEA,KAAAlM,CAAMkM,GACJ,MAAMgzB,EAAIrmC,KAAK/B,OAAOkJ,MAAMnH,KAAK0sC,OAAQ1sC,KAAK0sC,OAASr5B,GAEvD,OADArT,KAAK0sC,QAAUr5B,EACRgzB,CACT,CAEA,QAAA7kC,CAAShB,EAAKpD,GACZ,MAAMipC,EAAIrmC,KAAK/B,OAAOuD,SAAShB,EAAKR,KAAK0sC,OAAQ1sC,KAAK0sC,OAAStvC,GAE/D,OADA4C,KAAK0sC,QAAUtvC,EACRipC,CACT,CAEA,KAAAlnC,CAAMjC,EAAOE,EAAQoD,GACnB,MAAM6lC,EAAIrmC,KAAK/B,OAAOkB,MAAMjC,EAAO8C,KAAK0sC,OAAQtvC,EAAQoD,GAExD,OADAR,KAAK0sC,QAAUtvC,EACRipC,CACT,CAEA,IAAAr0B,CAAK0J,EAAQyU,EAAOpe,GAClB,MAAMs0B,EAAI3qB,EAAO1J,KAAKhS,KAAK/B,OAAQ+B,KAAK0sC,OAAQvc,EAAOpe,GAEvD,OADA/R,KAAK0sC,QAAUrG,EACRA,CACT,CAEA,SAAAtN,GACE,MAAMsN,EAAIrmC,KAAK/B,OAAO86B,UAAU/4B,KAAK0sC,QAErC,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,UAAAxL,CAAW39B,GACT,MAAMmpC,EAAIrmC,KAAK/B,OAAO48B,WAAW39B,EAAO8C,KAAK0sC,QAE7C,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,YAAA5R,GACE,MAAM4R,EAAIrmC,KAAK/B,OAAOw2B,aAAaz0B,KAAK0sC,QAExC,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,aAAApL,CAAc/9B,GACZ,MAAMmpC,EAAIrmC,KAAK/B,OAAOg9B,cAAc/9B,EAAO8C,KAAK0sC,QAEhD,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,YAAA/M,GACE,MAAM+M,EAAIrmC,KAAK/B,OAAOq7B,aAAat5B,KAAK0sC,QAExC,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,aAAAllC,CAAcjE,GACZ,MAAMmpC,EAAIrmC,KAAK/B,OAAOkD,cAAcjE,EAAO8C,KAAK0sC,QAEhD,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,EC5EK,SAASyG,EAAYvhB,EAAGP,GAE7B,OCJK,SAAwBO,EAAGP,GAEhC,QAASO,EAAIP,MAAQO,EAAIP,EAC3B,CDCS+hB,CAAexhB,EAAEnR,KAAM4Q,EAAE5Q,KAClC,CESO,SAAS4yB,EAAcl+B,GAG5B,IAAI0H,EAAO1H,EAAO,EAAIA,GAAQ,GAAK,EAOxB,IAAT0H,GACS,IAATA,GACS,KAATA,GACS,KAATA,IAEAA,EAAO,GAET,IAAIy2B,EAAqB,IAAPn+B,EASlB,OANEm+B,EADgB,GAAdA,EACY,IAEA,IAGH,IAATz2B,IAAiBy2B,EAAc,IAC3Bz2B,GAAQ,IAAMy2B,CACxB,CCvCA,MAAMC,EAAa,GAAK,GAExB,SAASC,EACPC,EACAC,EACAC,EACAC,GAEA,QAAqB5rC,IAAjByrC,QAAmDzrC,IAArB0rC,EAChC,MAAO,CAACD,EAAcC,QAEH1rC,IAAjB2rC,IACFA,EAAeC,EAAKza,WAEtB,MAAM0a,EAAUvuC,KAAKO,MAAM8tC,EAAe,KAE1C,MAAO,CAACE,EAD8C,KAAjCF,EAAyB,IAAVE,GAEtC,CAEO,SAASC,EAAenvC,GAC7B,MAAOovC,EAAcC,GAAoBR,EACvC7uC,EAAEovC,aACFpvC,EAAEqvC,iBACFrvC,EAAEsvC,QACFtvC,EAAEuvC,QAEGC,EAAcC,GAAoBZ,EACvC7uC,EAAEwvC,aACFxvC,EAAEyvC,iBACFzvC,EAAE0vC,QACF1vC,EAAE2vC,OAGJ,MAAO,CACLP,aAAcA,EAAeR,EAC7BS,iBAAkBA,EAAmBT,EACrCY,aAAcA,EAAeZ,EAC7Ba,iBAAkBA,EAAmBb,EACrCgB,IAAK5vC,EAAE4vC,IAAMhB,EACbiB,IAAK7vC,EAAE6vC,IAAMjB,EACbp+B,KAAMk+B,EAAc1uC,EAAEwQ,KAAOo+B,GAC7BkB,IAAK9vC,EAAE8vC,IAAMlB,EACbmB,IAAK/vC,EAAE+vC,IAAMnB,EAGb9/B,KAAM9O,EAAE8O,MAAQ,EAAI9O,EAAE8O,KAAO8/B,EAAa,EAE9C,C,cC5CA,IAAIoB,EAAqB,KAElBC,eAAeC,EAAOvwC,GAI3B,OAH2B,OAAvBqwC,IACFA,QAiBJC,iBAGE,IAEE,MAAgB,mDADGE,EAAW,IAAIprC,WAAW,IAE/C,CAAE,MAAOwK,GAET,CACA,OAAO,CACT,CA3B+B6gC,IAEtBJ,EAAqBG,EAAWxwC,GAMzC,SAAoBA,GAClB,OAAO,IAAI,GAAOqC,OAAOrC,GAAQ8C,OAAO,MAC1C,CARmD4tC,CAAW1wC,EAC9D,CASAswC,eAAeE,EAAWxwC,GAExB,OCvBK,SAAeA,GACpB,IAAI2wC,EAAM,GACV,IAAK,MAAMC,KAAQ,IAAIxrC,WAAWpF,GAC5B4wC,EAAO,KAAID,GAAO,KACtBA,GAAOC,EAAKrtC,SAAS,IAEvB,OAAOotC,CACT,CDgBSE,OADYC,OAAOC,OAAOjuC,OAAO,QAAS9C,GAEnD,CEhBA,SAASgxC,EAAqB/tC,GAC5B,MAAO,CACLguC,YAAajrC,QAAe,MAAP/C,GACrBiuC,SAAUlrC,QAAe,MAAP/C,GAClBkuC,OAAe,MAAPluC,IAA8B,GACtCmuC,WAAmB,KAAPnuC,EAEhB,CAiBO,MAAMouC,EAKX,WAAA31B,CAAY41B,EAASC,GACnBxvC,KAAKyvC,QAAS,EACdzvC,KAAK0vC,eAAiBF,GAAiB,IAAI9pC,IAC3C1F,KAAK2vC,SAAWJ,GAAW,IAAIrqC,GACjC,CAEA,SAAA0qC,CAAUC,GACR,GAA0B,IAAtBA,EAAM5gC,MAAMmgC,MACdS,EAAMC,OAAS,CAACD,GAChB7vC,KAAK2vC,SAAS3hB,IAAI6hB,EAAMz1B,KAAMy1B,GAC9B7vC,KAAK0vC,eAAeK,OAAOF,EAAMz1B,UAC5B,CACL,IAAI41B,EAAgBhwC,KAAK2vC,SAAShtC,IAAIktC,EAAMz1B,MACvC41B,IACHhwC,KAAK2vC,SAAS3hB,IAAI6hB,EAAMz1B,KAAMy1B,GAC9BG,EAAgBH,GAElBG,EAAcF,OAAOD,EAAM5gC,MAAMmgC,OAASS,EAC1C7vC,KAAK0vC,eAAe1zB,IAAI6zB,EAAMz1B,KAChC,CACF,CAEA,iBAAapN,CAAK/O,GAChB,GAAI0B,OAAOqtB,SAAS/uB,GAClB,OAAOqxC,EAASW,WAAWhyC,GACtB,GAAe,OAAXA,EACT,OAAO,IAAIqxC,EAAS,MAEpB,MAAM,IAAI,EAAc,uCAE5B,CAEA,uBAAaW,CAAWhyC,GACtB,GAAsB,IAAlBA,EAAOb,OACT,MAAM,IAAI,EAAc,oCAG1B,MAAMyb,EAAQ,IAAIy2B,EACZY,EAAS,IAAIzD,EAAaxuC,GAC1BkyC,EAAQD,EAAO1uC,SAAS,OAAQ,GACtC,GAAc,SAAV2uC,EACF,MAAM,IAAI,EAAc,uCAAuCA,KAIjE,MAAMC,QAAoB5B,EAAOvwC,EAAOkJ,MAAM,GAAI,KAC5CkpC,EAAapyC,EAAOkJ,OAAO,IAAI3F,SAAS,OAC9C,GAAI6uC,IAAeD,EACjB,MAAM,IAAI,EACR,iDAAiDC,aAAsBD,KAI3E,MAAMvyB,EAAUqyB,EAAO5W,eACvB,GAAgB,IAAZzb,EACF,MAAM,IAAI,EAAc,iCAAiCA,KAE3D,MAAMyyB,EAAaJ,EAAO5W,eAC1B,IAAI16B,EAAI,EACR,MAAQsxC,EAAOvD,OAAS/tC,EAAI0xC,GAAY,CACtC,MAAMT,EAAQ,CAAC,EACfA,EAAMnC,aAAewC,EAAO5W,eAC5BuW,EAAMlC,iBAAmBuC,EAAO5W,eAChCuW,EAAM/B,aAAeoC,EAAO5W,eAC5BuW,EAAM9B,iBAAmBmC,EAAO5W,eAChCuW,EAAM3B,IAAMgC,EAAO5W,eACnBuW,EAAM1B,IAAM+B,EAAO5W,eACnBuW,EAAM/gC,KAAOohC,EAAO5W,eACpBuW,EAAMzB,IAAM8B,EAAO5W,eACnBuW,EAAMxB,IAAM6B,EAAO5W,eACnBuW,EAAMziC,KAAO8iC,EAAO5W,eACpBuW,EAAMU,IAAML,EAAO/oC,MAAM,IAAI3F,SAAS,OACtC,MAAMyN,EAAQihC,EAAOzb,eACrBob,EAAM5gC,MAAQggC,EAAqBhgC,GAEnC,MAAMuhC,EAAavyC,EAAO0a,QAAQ,EAAGu3B,EAAOtD,OAAS,GAAKsD,EAAOtD,OACjE,GAAI4D,EAAa,EACf,MAAM,IAAI,EAAc,yBAAyBA,KAMnD,GAHAX,EAAMz1B,KAAO81B,EAAO1uC,SAAS,OAAQgvC,GAGjCX,EAAMz1B,KAAKod,SAAS,SAAWqY,EAAMz1B,KAAKod,SAAS,OACrD,MAAM,IAAIgV,EAAoBqD,EAAMz1B,MAMtC,IAAIq2B,EAAU,GAAMP,EAAOtD,OAAS,IAAM,EAE1C,IADgB,IAAZ6D,IAAeA,EAAU,GACtBA,KAAW,CAChB,MAAMvf,EAAMgf,EAAOnX,YACnB,GAAY,IAAR7H,EACF,MAAM,IAAI,EACR,yCAAyCA,YAAc2e,EAAMz1B,QAE1D,GAAI81B,EAAOvD,MAChB,MAAM,IAAI,EAAc,yBAE5B,CAEAkD,EAAMC,OAAS,GAEfj3B,EAAM+2B,UAAUC,GAEhBjxC,GACF,CACA,OAAOia,CACT,CAEA,iBAAI22B,GACF,MAAO,IAAIxvC,KAAK0vC,eAClB,CAEA,WAAIH,GACF,MAAO,IAAIvvC,KAAK2vC,SAASe,UAAUC,KAAK7D,EAC1C,CAEA,cAAI8D,GACF,OAAO5wC,KAAK2vC,QACd,CAEA,eAAIkB,GACF,MAAO,IAAI7wC,KAAKuvC,SAASuB,QAAQjB,GACxBA,EAAMC,OAAO1yC,OAAS,EAAIyyC,EAAMC,OAAO5yB,OAAO6C,GAAKA,GAAK8vB,EAEnE,CAEA,EAAElsC,OAAOC,YACP,IAAK,MAAMisC,KAAS7vC,KAAKuvC,cACjBM,CAEV,CAEA,MAAA9P,EAAO,SAAEoL,EAAQ,MAAE4F,EAAK,IAAER,EAAG,MAAEnB,EAAQ,IAChC2B,IACHA,EAAQ,CACNrD,aAAc,EACdC,iBAAkB,EAClBG,aAAc,EACdC,iBAAkB,EAClBG,IAAK,EACLC,IAAK,EACLr/B,KAAM,EACNs/B,IAAK,EACLC,IAAK,EACLjhC,KAAM,IAGV2jC,EAAQtD,EAAesD,GACvB,MAAMC,EAAYrxC,OAAOqN,KAAKm+B,GACxB0E,EAAQ,CACZnC,aAAcqD,EAAMrD,aACpBC,iBAAkBoD,EAAMpD,iBACxBG,aAAciD,EAAMjD,aACpBC,iBAAkBgD,EAAMhD,iBACxBG,IAAK6C,EAAM7C,IACXC,IAAK4C,EAAM5C,IAIXr/B,KAAMiiC,EAAMjiC,MAAQ,MACpBs/B,IAAK2C,EAAM3C,IACXC,IAAK0C,EAAM1C,IACXjhC,KAAM2jC,EAAM3jC,KACZgN,KAAM+wB,EACNoF,MACAthC,MAAO,CACLigC,aAAa,EACbC,UAAU,EACVC,QACAC,WAAY2B,EAAU5zC,OAAS,KAAQ4zC,EAAU5zC,OAAS,MAE5D0yC,OAAQ,IAGV9vC,KAAK4vC,UAAUC,GAEf7vC,KAAKyvC,QAAS,CAChB,CAEA,QAAO,SAAEtE,IACP,GAAInrC,KAAK2vC,SAASsB,IAAI9F,GACpBnrC,KAAK2vC,SAASI,OAAO5E,QAErB,IAAK,MAAM1gC,KAAOzK,KAAK2vC,SAASvjC,OAC1B3B,EAAIymC,WAAW/F,EAAW,MAC5BnrC,KAAK2vC,SAASI,OAAOtlC,GAKvBzK,KAAK0vC,eAAeuB,IAAI9F,IAC1BnrC,KAAK0vC,eAAeK,OAAO5E,GAE7BnrC,KAAKyvC,QAAS,CAChB,CAEA,KAAA0B,GACEnxC,KAAK2vC,SAASwB,QACdnxC,KAAKyvC,QAAS,CAChB,CAEA,GAAAwB,EAAI,SAAE9F,IACJ,OAAOnrC,KAAK2vC,SAASsB,IAAI9F,EAC3B,CAEA,MAAAiG,GACE,OAAOpxC,KAAKuvC,QACTnH,IAAIyH,GAAS,GAAGA,EAAM/gC,KAAKtN,SAAS,MAAMquC,EAAMU,UAAUV,EAAMz1B,QAChE2C,KAAK,KACV,CAEA,2BAAas0B,CAAexB,GAC1B,MAAMyB,EAAQ3xC,OAAOqN,KAAK6iC,EAAMz1B,MAE1Bhd,EAAkD,EAAzC6B,KAAKsyC,MAAM,GAAKD,EAAMl0C,OAAS,GAAK,GAC7Co0C,EAAU7xC,OAAOO,MAAM9C,GACvBq0C,EAAS,IAAIhF,EAAa+E,GAC1BE,EAAOjE,EAAeoC,GAc5B,OAbA4B,EAAOtwC,cAAcuwC,EAAKhE,cAC1B+D,EAAOtwC,cAAcuwC,EAAK/D,kBAC1B8D,EAAOtwC,cAAcuwC,EAAK5D,cAC1B2D,EAAOtwC,cAAcuwC,EAAK3D,kBAC1B0D,EAAOtwC,cAAcuwC,EAAKxD,KAC1BuD,EAAOtwC,cAAcuwC,EAAKvD,KAC1BsD,EAAOtwC,cAAcuwC,EAAK5iC,MAC1B2iC,EAAOtwC,cAAcuwC,EAAKtD,KAC1BqD,EAAOtwC,cAAcuwC,EAAKrD,KAC1BoD,EAAOtwC,cAAcuwC,EAAKtkC,MAC1BqkC,EAAOtyC,MAAM0wC,EAAMU,IAAK,GAAI,OAC5BkB,EAAOxW,cA7PX,SAA+B4U,GAC7B,MAAM5gC,EAAQ4gC,EAAM5gC,MAMpB,OAJAA,EAAMkgC,UAAW,EAGjBlgC,EAAMogC,WAAapwC,KAAK4B,IAAIlB,OAAOqN,KAAK6iC,EAAMz1B,MAAMhd,OAAQ,OAEzD6R,EAAMigC,YAAc,MAAqB,IACzCjgC,EAAMkgC,SAAW,MAAqB,KACvB,EAAdlgC,EAAMmgC,QAAiB,KACL,KAAnBngC,EAAMogC,WAEX,CAgPyBsC,CAAsB9B,IAC3C4B,EAAOtyC,MAAM0wC,EAAMz1B,KAAMk3B,EAAMl0C,OAAQ,QAChCo0C,CACT,CAEA,cAAMI,GACJ,MAAM/vB,EAASliB,OAAOO,MAAM,IACtBuxC,EAAS,IAAIhF,EAAa5qB,GAChC4vB,EAAOtyC,MAAM,OAAQ,EAAG,QACxBsyC,EAAOtwC,cAAc,GACrBswC,EAAOtwC,cAAcnB,KAAK6wC,YAAYzzC,QAEtC,IAAIy0C,EAAe,GACnB,IAAK,MAAMhC,KAAS7vC,KAAKuvC,QAEvB,GADAsC,EAAa1lC,KAAKmjC,EAAS+B,eAAexB,IACtCA,EAAMC,OAAO1yC,OAAS,EACxB,IAAK,MAAMgyC,KAASS,EAAMC,OACpBV,GAASA,IAAUS,GACrBgC,EAAa1lC,KAAKmjC,EAAS+B,eAAejC,IAKlDyC,QAAqBvsC,QAAQs+B,IAAIiO,GAEjC,MAAMC,EAAOnyC,OAAOkH,OAAOgrC,GACrBE,EAAOpyC,OAAOkH,OAAO,CAACgb,EAAQiwB,IAC9BE,QAAYxD,EAAOuD,GACzB,OAAOpyC,OAAOkH,OAAO,CAACkrC,EAAMpyC,OAAOqN,KAAKglC,EAAK,QAC/C,EC/RF,IAAIC,EAAO,KAEX,MAAMC,EAAavuC,OAAO,cAkDnB,MAAM,EAaX,oBAAa6G,EAAQ,GAAE0/B,EAAE,OAAEC,EAAM,MAAEztB,EAAK,cAAEy1B,GAAgB,GAAQC,GAC3D11B,EAAMw1B,KACTx1B,EAAMw1B,GA1DH,CACL9J,IAAK,IAAIljC,IACT6rC,MAAO,IAAI7rC,MA2DX,MAAMimC,EAAW,GAAGhB,UAEpB,IAAIniC,EADS,OAATiqC,IAAeA,EAAO,IAAI,EAAU,CAAE5nC,WAAYrL,OAEtD,IAAIwwC,EAAgB,GA4BpB,aA3BMyC,EAAKznC,QAAQ2gC,EAAUoD,UAK3B,MAAM8D,EAAgB31B,EAAMw1B,SArClC3D,eAA4BrE,EAAIiB,EAAUzuB,GACxC,MAAM41B,EAAa51B,EAAMq0B,MAAMpuC,IAAIwoC,GACnC,QAAmBxpC,IAAf2wC,EAA0B,OAAO,EACrC,GAAmB,OAAfA,EAAqB,OAAO,EAEhC,MAAMC,QAAkBrI,EAAGsI,MAAMrH,GACjC,OAAkB,OAAdoH,GC1DC,SAAsB1C,EAAOkB,EAAOtK,GAAW,EAAMgM,GAAW,GAGrE,MAAMn0C,EAAImvC,EAAeoC,GACnB/wC,EAAI2uC,EAAesD,GASzB,OAPGtK,GAAYnoC,EAAEwQ,OAAShQ,EAAEgQ,MAC1BxQ,EAAEwvC,eAAiBhvC,EAAEgvC,cACrBxvC,EAAEovC,eAAiB5uC,EAAE4uC,cACrBpvC,EAAE8vC,MAAQtvC,EAAEsvC,KACZ9vC,EAAE+vC,MAAQvvC,EAAEuvC,KACXoE,GAAYn0C,EAAE6vC,MAAQrvC,EAAEqvC,KACzB7vC,EAAE8O,OAAStO,EAAEsO,IAEjB,CD6CSslC,CAAaJ,EAAYC,EAClC,CA8BgBI,CAAazI,EAAIiB,EAAUkH,UA1D3C9D,eAAqCrE,EAAIiB,EAAUzuB,GACjD,MAAOg1B,EAAMkB,SAAsBttC,QAAQs+B,IAAI,CAC7CsG,EAAGsI,MAAMrH,GACTjB,EAAGlsC,KAAKmtC,KAGJtyB,QAAcy2B,EAAStiC,KAAK4lC,GAElCl2B,EAAM0rB,IAAIpa,IAAImd,EAAUtyB,GAExB6D,EAAMq0B,MAAM/iB,IAAImd,EAAUuG,EAC5B,CAgDcmB,CAAsB3I,EAAIiB,EAAUkH,GAE5C,MAAMx5B,EAAQw5B,EAAcjK,IAAIzlC,IAAIwoC,GAGpC,GAFAqE,EAAgB32B,EAAM22B,cAElBA,EAAcpyC,SAAW+0C,EAC3B,MAAM,IAAI7F,EAAmBkD,GAG/B,GADAxnC,QAAeoqC,EAAQv5B,GACnBA,EAAM42B,OAAQ,CAGhB,MAAMxxC,QAAe4a,EAAM+4B,iBACrB1H,EAAG/qC,MAAMgsC,EAAUltC,GAEzBo0C,EAActB,MAAM/iB,IAAImd,QAAgBjB,EAAGsI,MAAMrH,IACjDtyB,EAAM42B,QAAS,CACjB,IAGKznC,CACT,EEhHK,MAAM8qC,UAAwB7G,EAInC,WAAAtyB,CAAYzc,GACVy/B,MAAM,6CAA6Cz/B,OACnD8C,KAAKqlB,KAAOrlB,KAAKsG,KAAOwsC,EAAgBztB,KACxCrlB,KAAKO,KAAO,CAAErD,QAChB,EAGF41C,EAAgBztB,KAAO,kBCXhB,MAAM0tB,UAAuB9G,EAIlC,WAAAtyB,CAAYq5B,GACVrW,MAAM,8CAA8CqW,4EAC7CA,wDAGPhzC,KAAKqlB,KAAOrlB,KAAKsG,KAAOysC,EAAe1tB,KACvCrlB,KAAKO,KAAO,CAAEyyC,SAChB,EAGFD,EAAe1tB,KAAO,iBCdf,MAAM,UAAsB4mB,EAIjC,WAAAtyB,CAAYs5B,GACVtW,MAAM,kBAAkBsW,MACxBjzC,KAAKqlB,KAAOrlB,KAAKsG,KAAO,EAAc+e,KACtCrlB,KAAKO,KAAO,CAAE0yC,OAChB,EAGF,EAAc5tB,KAAO,gBCbd,MAAM6tB,EACX,WAAAv5B,CAAY7F,GAGV,GAFA9T,KAAKmzC,KAAO,IAAIjuC,IAChBlF,KAAKmoC,aAAe,GAChBr0B,EAAM,CACR,IAAIrJ,EAAM,KACVzK,KAAKmoC,aAAer0B,EACjBojB,OACAjb,MAAM,MACNmsB,IAAIC,IACH,GAAI,QAAQzvB,KAAKyvB,GACf,MAAO,CAAEA,OAAMj0B,SAAS,GAE1B,MAAMxV,EAAIypC,EAAK1vB,QAAQ,KACvB,GAAI0vB,EAAK6I,WAAW,KAAM,CAGxB,MAAMh0C,EAAQmrC,EAAKlhC,MAAM,GAGzB,OADAnH,KAAKmzC,KAAKnlB,IAAIvjB,EAAM,MAAOvN,GACpB,CAAEmrC,OAAM+K,IAAK3oC,EAAK4oC,OAAQn2C,EACnC,CAAO,CAEL,MAAMA,EAAQmrC,EAAKlhC,MAAM,EAAGvI,GAG5B,OAFA6L,EAAM49B,EAAKlhC,MAAMvI,EAAI,GACrBoB,KAAKmzC,KAAKnlB,IAAIvjB,EAAKvN,GACZ,CAAEmrC,OAAM+K,IAAK3oC,EAAK8lC,IAAKrzC,EAChC,GAEN,CACA,OAAO8C,IACT,CAEA,WAAOgN,CAAK8G,GACV,OAAO,IAAIo/B,EAAcp/B,EAC3B,CAEA,OAAOs/B,GACLpzC,KAAKmoC,aAAenoC,KAAKmoC,aAAajrB,OAAO2yB,GAASA,EAAMuD,MAAQA,GACpEpzC,KAAKmzC,KAAKpD,OAAOqD,EACnB,CAEA,QAAA5xC,GACE,OAAOxB,KAAKmoC,aAAaC,IAAI,EAAGC,UAAWA,GAAMtrB,KAAK,MAAQ,IAChE,EC1CK,MAAMu2B,EACX,WAAA35B,EAAY,WAAE45B,EAAU,UAAEC,EAAS,MAAEC,EAAK,YAAEC,IAC1CrqC,OAAOyL,OAAO9U,KAAM,CAClBuzC,aACAC,YACAC,QACAC,eAEJ,CAEA,WAAO1mC,CAAK2mC,GACV,MAAOC,EAAYL,EAAYM,EAAiBL,EAAWM,GACzDH,EAAQ1rC,MAAM,gCAAgCd,MAAM,GAChDssC,EAAuB,MAAfG,EACRG,EAAmC,MAApBF,EAIrB,GAAIE,KAHmC,MAAnBD,GAIlB,MAAM,IAAI,EAAc,mBAE1B,OAAO,IAAIR,EAAW,CACpBC,aACAC,YACAC,QACAC,YAAaK,GAGjB,CAEA,SAAAC,CAAUC,GACR,GAAIj0C,KAAK0zC,aACP,GAAIO,EAAa/C,WAAWlxC,KAAKuzC,YAC/B,OAAOvzC,KAAKwzC,UAAYS,EAAahtC,QAAQjH,KAAKuzC,WAAY,SAGhE,GAAIU,IAAiBj0C,KAAKuzC,WAAY,OAAOvzC,KAAKwzC,UAEpD,OAAO,IACT,CAEA,gBAAAU,CAAiBC,GACf,GAAIn0C,KAAK0zC,aACP,GAAIS,EAAYjD,WAAWlxC,KAAKwzC,WAC9B,OAAOxzC,KAAKuzC,WAAaY,EAAYltC,QAAQjH,KAAKwzC,UAAW,SAG/D,GAAIW,IAAgBn0C,KAAKwzC,UAAW,OAAOxzC,KAAKuzC,WAElD,OAAO,IACT,EClDK,MAAMa,EACX,WAAAz6B,CAAY06B,EAAQ,IAClBr0C,KAAKq0C,MAAQA,CACf,CAEA,WAAOrnC,CAAKsnC,GACV,MAAMD,EAAQ,GACd,IAAK,MAAMV,KAAWW,EACpBD,EAAMloC,KAAKmnC,EAAWtmC,KAAK2mC,IAE7B,OAAO,IAAIS,EAAcC,EAC3B,CAEA,GAAAr4B,CAAI23B,GACF,MAAMn4B,EAAO83B,EAAWtmC,KAAK2mC,GAC7B3zC,KAAKq0C,MAAMloC,KAAKqP,EAClB,CAEA,SAAAw4B,CAAUO,GACR,MAAMvsC,EAAS,GACf,IAAK,MAAMwT,KAAQxb,KAAKq0C,MACtB,IAAK,MAAMG,KAAaD,EAAY,CAClC,MAAME,EAAWj5B,EAAKw4B,UAAUQ,GAC5BC,GACFzsC,EAAOmE,KAAK,CAACqoC,EAAWC,GAE5B,CAEF,OAAOzsC,CACT,CAEA,YAAA0sC,CAAaF,GACX,IAAIxsC,EAAS,KACb,IAAK,MAAMwT,KAAQxb,KAAKq0C,MAAO,CAC7B,MAAMI,EAAWj5B,EAAKw4B,UAAUQ,GAC5BC,IACFzsC,EAASysC,EAEb,CACA,OAAOzsC,CACT,CAEA,eAAA2sC,GACE,OAAO30C,KAAKq0C,MACTn3B,OAAO1B,GAAQA,EAAKk4B,aACpBtL,IAAI5sB,GAAQA,EAAKg4B,UAAUvsC,QAAQ,MAAO,IAC/C,EChDK,SAAS2tC,EAAgBrpB,EAAGP,GAEjC,MAAMC,EAAKM,EAAEtkB,QAAQ,UAAW,IAC1BikB,EAAKF,EAAE/jB,QAAQ,UAAW,IAC1BiqB,IAAQjG,EAAKC,MAASD,EAAKC,GACjC,OAAY,IAARgG,EACK3F,EAAEub,SAAS,OAAS,GAAK,EAE3B5V,CACT,CCOA,MAAM2jB,EAAWzB,GAAO,CACtB,GAAGA,IACH,QAAQA,IACR,aAAaA,IACb,cAAcA,IACd,gBAAgBA,IAChB,gBAAgBA,UAIZ0B,EAAY,CAAC,SAAU,cAAe,QAAS,UAAW,aAEhE,IAAI,EAEJvG,eAAewG,EAAY3B,EAAK5J,GAE9B,YADa7nC,IAAT,IAAoB,EAAO,IAAI,GAC5B,EAAK6I,QAAQ4oC,EAAK5J,EAC3B,CAKO,MAAMwL,EAgBX,6BAAaC,EAAiB,GAC5B/K,EAAE,OACFC,EAAM,OACN6I,EAAM,KACNG,EAAI,QACJ+B,EAAO,KACPC,EAAI,SACJb,EAAoB,MACpBc,GAAQ,EAAK,UACbC,GAAY,IAGZ,IAAK,MAAMn4C,KAASi2C,EAAKzC,SACvB,IAAKxzC,EAAM+K,MAAM,gBACf,MAAM,IAAI6qC,EAAgB51C,GAG9B,MAAMisC,QAAec,EAAiBtnC,IAAI,CAAEunC,KAAIC,WAChD,IAAKmK,EAAU,CAEb,GAAwB,KADxBA,QAAiBnL,EAAOH,OAAO,UAAUgK,YAC5B51C,OACX,MAAM,IAAI21C,EAAeC,GAG3BsB,EAASpoC,QAAQ,sBAAsB8mC,SACzC,CACA,MAAMW,EAAUS,EAAcpnC,KAAKsnC,GAC7BgB,EAAoB,IAAIpwC,IAE9B,GAAImwC,EAAW,CACb,MAAMF,QAAaH,EAAcO,SAAS,CACxCrL,KACAC,SACAgB,SAAU,oBAEN6J,EAAcQ,WAAW,CAC7BtL,KACAC,SACAgJ,KAAMgC,EAAK/M,IAAIna,GAAO,aAAaA,MAEvC,CAEA,GAAIknB,EACF,IAAK,MAAMM,KAAatC,EAAK/mC,OAC3B,GAAIqpC,EAAUvE,WAAW,eAAiBuE,EAAU3O,SAAS,eAE/CkO,EAAczJ,OAAO,CAAErB,KAAIC,SAAQiJ,IAAKqC,IAAe,CAEjE,MAAMlF,EAAM4C,EAAKxwC,IAAI8yC,GACrBH,EAAkBtnB,IAAIynB,EAAWlF,EACnC,CAKN,MAAMmF,EAAkB/B,EAAQK,UAAU,IAAIb,EAAK/mC,SACnD,IAAK,MAAOqpC,EAAWE,KAAkBD,EAAiB,CACxD,MAAMx4C,EAAQi2C,EAAKxwC,IAAI8yC,GACvBH,EAAkBtnB,IAAI2nB,EAAez4C,EACvC,CACA,MAAM04C,EAAqBjC,EAAQK,UAAU,IAAIkB,EAAQ9oC,SACzD,IAAK,MAAOqpC,EAAWE,KAAkBC,EAAoB,CAC3D,MAAM14C,EAAQg4C,EAAQvyC,IAAI8yC,GACpBI,EAAYlC,EAAQe,aAAax3C,GACnC24C,GACFP,EAAkBtnB,IAAI2nB,EAAe,QAAQE,IAEjD,CAEA,MAAMC,EAAS,GACf,GAAIV,EAAO,CACT,IAAK,MAAMjK,KAAYwI,EAAQgB,kBAAmB,CAChD,MAAMxB,SACE6B,EAAcO,SAAS,CAC3BrL,KACAC,SACAgB,cAEF/C,IAAIwD,GAAQ,GAAGT,KAAYS,KAC7B,IAAK,MAAMwH,KAAOD,EACXmC,EAAkBrE,IAAImC,IACzB0C,EAAO3pC,KAAKinC,EAGlB,CACI0C,EAAO14C,OAAS,SACZ43C,EAAcQ,WAAW,CAAEtL,KAAIC,SAAQgJ,KAAM2C,GAEvD,CAgBA,IAAK,MAAOrrC,EAAKvN,KAAUo4C,QACnBP,EAAYtqC,EAAK8jC,SACrBrE,EAAG/qC,MAAM,EAAKgrC,EAAQ1/B,GAAM,GAAGvN,EAAMg6B,WAAY,SAGrD,MAAO,CAAE4e,SACX,CAaA,qBAAaC,EAAS,GAAE7L,EAAE,OAAEC,EAAM,IAAEiJ,EAAG,MAAEl2C,IAEvC,IAAKA,EAAM+K,MAAM,gBACf,MAAM,IAAI6qC,EAAgB51C,SAEtB63C,EAAY3B,EAAK7E,SACrBrE,EAAG/qC,MAAM,EAAKgrC,EAAQiJ,GAAM,GAAGl2C,EAAMg6B,WAAY,QAErD,CAYA,6BAAa8e,EAAiB,GAAE9L,EAAE,OAAEC,EAAM,IAAEiJ,EAAG,MAAEl2C,UACzC63C,EAAY3B,EAAK7E,SACrBrE,EAAG/qC,MAAM,EAAKgrC,EAAQiJ,GAAgB,QAAGl2C,EAAMg6B,WAAY,QAE/D,CAWA,sBAAa+e,EAAU,GAAE/L,EAAE,OAAEC,EAAM,IAAEiJ,IACnC,OAAO4B,EAAcQ,WAAW,CAAEtL,KAAIC,SAAQgJ,KAAM,CAACC,IACvD,CAWA,uBAAaoC,EAAW,GAAEtL,EAAE,OAAEC,EAAM,KAAEgJ,UAE9B7tC,QAAQs+B,IAAIuP,EAAK/K,IAAIgL,GAAOlJ,EAAGgM,GAAG,EAAK/L,EAAQiJ,MAErD,IAAIt/B,QAAaihC,EAAY,cAAexG,SAC1CrE,EAAGlsC,KAAK,GAAGmsC,gBAAsB,CAAE98B,SAAU,UAE/C,MAAM8oC,EAASjD,EAAclmC,KAAK8G,GAC5BsiC,EAAaD,EAAOhD,KAAK/lC,KAC/B,IAAK,MAAMgmC,KAAOD,EACZgD,EAAOhD,KAAKlC,IAAImC,IAClB+C,EAAOpG,OAAOqD,GAGd+C,EAAOhD,KAAK/lC,KAAOgpC,IACrBtiC,EAAOqiC,EAAO30C,iBACRuzC,EAAY,cAAexG,SAC/BrE,EAAG/qC,MAAM,GAAGgrC,gBAAsBr2B,EAAM,CAAEzG,SAAU,UAG1D,CAYA,oBAAarC,EAAQ,GAAEk/B,EAAE,OAAEC,EAAM,IAAEiJ,EAAG,MAAE7sB,IACtC,QAAc5kB,IAAV4kB,IAEa,MADfA,EAEE,OAAO6sB,EAKX,GAAIA,EAAIlC,WAAW,SAEjB,OADAkC,EAAMA,EAAIjsC,MAAM,GACT6tC,EAAchqC,QAAQ,CAAEk/B,KAAIC,SAAQiJ,MAAK7sB,UAGlD,GAAmB,KAAf6sB,EAAIh2C,QAAiB,eAAewb,KAAKw6B,GAC3C,OAAOA,EAGT,MAAMiD,QAAkBrB,EAAcsB,WAAW,CAAEpM,KAAIC,WAEjDoM,EAAW1B,EAASzB,GAAKl2B,OAAOxC,IAAMo6B,EAAUtd,SAAS9c,IAE/D,IAAK,MAAM04B,KAAOmD,EAAU,CAC1B,MAAMC,QAAYzB,EAChB3B,EACA7E,eACSrE,EAAGlsC,KAAK,GAAGmsC,KAAUiJ,IAAO,CAAE/lC,SAAU,UAC/CgpC,EAAU1zC,IAAIywC,IAElB,GAAIoD,EACF,OAAOxB,EAAchqC,QAAQ,CAAEk/B,KAAIC,SAAQiJ,IAAKoD,EAAItf,OAAQ3Q,SAEhE,CAEA,MAAM,IAAI,EAAc6sB,EAC1B,CAWA,mBAAa7H,EAAO,GAAErB,EAAE,OAAEC,EAAM,IAAEiJ,IAChC,IAEE,aADM4B,EAAcyB,OAAO,CAAEvM,KAAIC,SAAQiJ,SAClC,CACT,CAAE,MAAO5nC,GACP,OAAO,CACT,CACF,CAWA,mBAAairC,EAAO,GAAEvM,EAAE,OAAEC,EAAM,IAAEiJ,IAEhC,GAAmB,KAAfA,EAAIh2C,QAAiB,eAAewb,KAAKw6B,GAC3C,OAAOA,EAGT,MAAMiD,QAAkBrB,EAAcsB,WAAW,CAAEpM,KAAIC,WAEjDoM,EAAW1B,EAASzB,GAC1B,IAAK,MAAMA,KAAOmD,EAAU,CAI1B,SAHwBxB,EAAY3B,EAAK7E,SACvCrE,EAAGqB,OAAO,GAAGpB,KAAUiJ,MAEV,OAAOA,EACtB,GAAIiD,EAAUpF,IAAImC,GAAM,OAAOA,CACjC,CAEA,MAAM,IAAI,EAAcA,EAC1B,CAUA,6BAAasD,EAAiB,IAAEtD,EAAG,IAAEhL,IAEnC,MAAMmO,EAAW1B,EAASzB,GAC1B,IAAK,MAAMA,KAAOmD,EAChB,SAAUnO,EAAI6I,IAAImC,GAAM,OAAOA,EAGjC,MAAM,IAAI,EAAcA,EAC1B,CAYA,wBAAOuD,EAAkB,IAAEvD,EAAG,QAAEwD,EAAUxD,EAAG,MAAE7sB,EAAiB,IAAE6hB,IAChE,QAAczmC,IAAV4kB,IAEa,MADfA,EAEE,MAAO,CAAEqwB,UAASrG,IAAK6C,GAI3B,GAAIA,EAAIlC,WAAW,SAEjB,OADAkC,EAAMA,EAAIjsC,MAAM,GACT6tC,EAAc2B,kBAAkB,CAAEvD,MAAKwD,UAASrwB,QAAO6hB,QAGhE,GAAmB,KAAfgL,EAAIh2C,QAAiB,eAAewb,KAAKw6B,GAC3C,MAAO,CAAEwD,UAASrG,IAAK6C,GAGzB,MAAMmD,EAAW1B,EAASzB,GAC1B,IAAK,MAAMA,KAAOmD,EAAU,CAC1B,MAAMC,EAAMpO,EAAIzlC,IAAIywC,GACpB,GAAIoD,EACF,OAAOxB,EAAc2B,kBAAkB,CACrCvD,IAAKoD,EAAItf,OACT0f,QAASxD,EACT7sB,QACA6hB,OAGN,CAEA,MAAM,IAAI,EAAcgL,EAC1B,CAUA,uBAAakD,EAAW,GAAEpM,EAAE,OAAEC,IAC5B,MAAMr2B,QAAaihC,EAAY,cAAexG,SAC5CrE,EAAGlsC,KAAK,GAAGmsC,gBAAsB,CAAE98B,SAAU,UAG/C,OADe6lC,EAAclmC,KAAK8G,GACpBq/B,IAChB,CAWA,qBAAaoC,EAAS,GAAErL,EAAE,OAAEC,EAAM,SAAEgB,IAClC,MAAMkL,EAAYrB,EAAcsB,WAAW,CAAEpM,KAAIC,WACjD,IAAI0M,EAAQ,KACZ,IACEA,QAAc3M,EAAG4M,YAAY,GAAG3M,KAAUgB,KAC1C0L,EAAQA,EAAMzO,IAAIroB,GAAKA,EAAE9Y,QAAQ,GAAGkjC,KAAUgB,KAAa,IAC7D,CAAE,MAAO3/B,GACPqrC,EAAQ,EACV,CAEA,IAAK,IAAIpsC,WAAc4rC,GAAWjqC,OAE5B3B,EAAIymC,WAAW/F,KAEjB1gC,EAAMA,EAAIxD,QAAQkkC,EAAW,IAAK,IAE7B0L,EAAMrf,SAAS/sB,IAClBosC,EAAM1qC,KAAK1B,IAMjB,OADAosC,EAAMlG,KAAKiE,GACJiC,CACT,CAWA,yBAAaE,EAAa,GAAE7M,EAAE,OAAEC,EAAM,OAAE6I,IACtC,OAAIA,EACKgC,EAAcO,SAAS,CAC5BrL,KACAC,SACAgB,SAAU,gBAAgB6H,MAGrBgC,EAAcO,SAAS,CAAErL,KAAIC,SAAQgB,SAAU,cAE1D,CAUA,qBAAa6L,EAAS,GAAE9M,EAAE,OAAEC,IAM1B,aALmB6K,EAAcO,SAAS,CACxCrL,KACAC,SACAgB,SAAU,eAEAjuB,OAAO6C,IAAMA,EAAE+mB,SAAS,OACtC,ECveK,MAAMmQ,UAAkBhL,EAM7B,WAAAtyB,CAAYu9B,EAAYC,EAAeC,GACrCza,MAAM,eAAeua,KAAcC,KACnCn3C,KAAKqlB,KAAOrlB,KAAKsG,KAAO2wC,EAAU5xB,KAClCrlB,KAAKO,KAAO,CAAE22C,aAAYC,gBAAeC,WAC3C,EAGFH,EAAU5xB,KAAO,YCbV,MAAMgyB,UAAuBpL,EAKlC,WAAAtyB,CAAY29B,EAASF,GACnBza,MACE,gHAAgH2a,KAElHt3C,KAAKqlB,KAAOrlB,KAAKsG,KAAO+wC,EAAehyB,KACvCrlB,KAAKO,KAAO,CAAE+2C,UAASF,WACzB,EAGFC,EAAehyB,KAAO,iBCdf,MAAMkyB,WAA0BtL,EACrC,WAAAtyB,GACEgjB,MAAM,+BACN38B,KAAKqlB,KAAOrlB,KAAKsG,KAAOixC,GAAkBlyB,KAC1CrlB,KAAKO,KAAO,CAAC,CACf,ECPK,SAASi3C,IAAyB,SAAEC,EAAW,GAAE,SAAEC,EAAW,KACnE,MAAO,SAAS/3C,OAAOqN,KAAK,GAAGyqC,KAAYC,KAAYl2C,SAAS,WAClE,CCAO,SAASm2C,GAAYC,GAC1B,OAAIA,EAASj0C,OAAOk0C,eACXD,EAASj0C,OAAOk0C,iBAErBD,EAASj0C,OAAOC,UACXg0C,EAASj0C,OAAOC,YAErBg0C,EAASvnC,KACJunC,ECRJ,SAAmB16C,GACxB,IAAI46C,EAAQ,CAAC56C,GACb,MAAO,CACLmT,KAAI,IACK/K,QAAQ0F,QAAQ,CAAEM,KAAuB,IAAjBwsC,EAAM16C,OAAcF,MAAO46C,EAAMj7B,QAElEk7B,OAAM,KACJD,EAAQ,GACD,CAAC,GAEV,CAACn0C,OAAOk0C,iBACN,OAAO73C,IACT,EAEJ,CDJSg4C,CAAUJ,EACnB,CEbO,SAASK,GAAmBC,GAMjC,IAAIC,EAAWD,EAAIjwC,MAAM,wBAEzB,GAAgB,MAAZkwC,EAAkB,MAAO,CAAED,MAAKE,KAAM,CAAC,GAC3CD,EAAWA,EAAS,GACpB,MAAOV,EAAUC,GAAYS,EAASl8B,MAAM,KAI5C,MAAO,CAAEi8B,IAFTA,EAAMA,EAAIjxC,QAAQ,GAAGkxC,KAAa,IAEpBC,KAAM,CAAEX,WAAUC,YAClC,CJLAH,GAAkBlyB,KAAO,oBKRlB,MAAMgzB,WAAiCpM,EAC5C,WAAAtyB,GACEgjB,MAAM,mCACN38B,KAAKqlB,KAAOrlB,KAAKsG,KAAO+xC,GAAyBhzB,KACjDrlB,KAAKO,KAAO,CAAC,CACf,EAGF83C,GAAyBhzB,KAAO,2BCRzB,MAAMizB,WAAmBrM,EAK9B,WAAAtyB,CAAY4+B,EAAUhmB,GACpBoK,MAAM,aAAa4b,oBAA2BhmB,OAC9CvyB,KAAKqlB,KAAOrlB,KAAKsG,KAAOgyC,GAAWjzB,KACnCrlB,KAAKO,KAAO,CAAEg4C,WAAUhmB,SAC1B,EAGF+lB,GAAWjzB,KAAO,aCXX,MAAMmzB,GACX,WAAA7+B,CAAY8+B,GAEV,GAAsB,oBAAX94C,OACT,MAAM,IAAI8B,MAAM,6BAElBzB,KAAKy4C,OAASd,GAAYc,GAC1Bz4C,KAAK/B,OAAS,KACd+B,KAAK04C,OAAS,EACd14C,KAAK24C,WAAa,EAClB34C,KAAK44C,SAAU,EACf54C,KAAK64C,QAAS,EACd74C,KAAK84C,gBAAkB,CACzB,CAEA,GAAAnM,GACE,OAAO3sC,KAAK64C,QAAU74C,KAAK04C,SAAW14C,KAAK/B,OAAOb,MACpD,CAEA,IAAAwvC,GACE,OAAO5sC,KAAK84C,gBAAkB94C,KAAK04C,MACrC,CAEA,UAAM7J,GACJ,IAAI7uC,KAAK2sC,QACJ3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,SAAW14C,KAAK/B,OAAOb,eACxB4C,KAAKg5C,aACPh5C,KAAK64C,SAGX,OADA74C,KAAKi5C,YAAY,GACVj5C,KAAK/B,OAAO+B,KAAK24C,WAC1B,CAEA,WAAMn2B,GACJ,IAAIxiB,KAAK2sC,QACJ3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,SAAW14C,KAAK/B,OAAOb,eACxB4C,KAAKg5C,aACPh5C,KAAK64C,SAGX,OADA74C,KAAKi5C,YAAYj5C,KAAK/B,OAAOb,QACtB4C,KAAK/B,OAAOkJ,MAAMnH,KAAK24C,WAAY34C,KAAK04C,OACjD,CAEA,UAAM16C,CAAKqV,GACT,IAAIrT,KAAK2sC,MAOT,OANK3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,OAASrlC,EAAIrT,KAAK/B,OAAOb,SAChC4C,KAAKk5C,cACCl5C,KAAKm5C,YAAY9lC,IAEzBrT,KAAKi5C,YAAY5lC,GACVrT,KAAK/B,OAAOkJ,MAAMnH,KAAK24C,WAAY34C,KAAK04C,OACjD,CAEA,UAAMU,CAAK/lC,GACLrT,KAAK2sC,QACJ3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,OAASrlC,EAAIrT,KAAK/B,OAAOb,SAChC4C,KAAKk5C,cACCl5C,KAAKm5C,YAAY9lC,IAEzBrT,KAAKi5C,YAAY5lC,GACnB,CAEA,UAAMgmC,GACJr5C,KAAK04C,OAAS14C,KAAK24C,UACrB,CAEA,WAAMW,GACJt5C,KAAK44C,SAAU,EACf,IAAI,KAAEttC,EAAI,MAAEpO,SAAgB8C,KAAKy4C,OAAOpoC,OACxC,OAAI/E,IACFtL,KAAK64C,QAAS,GACT37C,GAAcyC,OAAOO,MAAM,IAE9BhD,IACFA,EAAQyC,OAAOqN,KAAK9P,IAEfA,EACT,CAEA,KAAAg8C,GAGEl5C,KAAK/B,OAAS+B,KAAK/B,OAAOkJ,MAAMnH,KAAK24C,YACrC34C,KAAK04C,QAAU14C,KAAK24C,WACpB34C,KAAK84C,iBAAmB94C,KAAK24C,WAC7B34C,KAAK24C,WAAa,CACpB,CAEA,WAAAM,CAAY5lC,GACVrT,KAAK24C,WAAa34C,KAAK04C,OACvB14C,KAAK04C,QAAUrlC,EACXrT,KAAK04C,OAAS14C,KAAK/B,OAAOb,SAC5B4C,KAAK04C,OAAS14C,KAAK/B,OAAOb,OAE9B,CAEA,iBAAM+7C,CAAY9lC,GAChB,GAAIrT,KAAK64C,OAAQ,OAGjB,MAAMU,EAAU,CAACv5C,KAAK/B,QACtB,KAAO+B,KAAK04C,OAASrlC,EAAImmC,GAAcD,IAAU,CAC/C,MAAME,QAAmBz5C,KAAKs5C,QAC9B,GAAIt5C,KAAK64C,OAAQ,MACjBU,EAAQptC,KAAKstC,EACf,CACAz5C,KAAK/B,OAAS0B,OAAOkH,OAAO0yC,EAC9B,CAEA,eAAMP,GACJh5C,KAAK84C,iBAAmB94C,KAAK/B,OAAOb,OACpC4C,KAAK24C,WAAa,EAClB34C,KAAK04C,OAAS,EACd14C,KAAK/B,aAAe+B,KAAKs5C,OAC3B,CAEA,WAAMP,GACJ/4C,KAAK/B,aAAe+B,KAAKs5C,OAC3B,EAKF,SAASE,GAAcD,GACrB,OAAOA,EAAQ59B,OAAO,CAAC+9B,EAAKz7C,IAAWy7C,EAAMz7C,EAAOb,OAAQ,EAC9D,CC3EO,MAAMu8C,GACX,YAAOrnC,GACL,OAAO3S,OAAOqN,KAAK,OAAQ,OAC7B,CAEA,YAAO4sC,GACL,OAAOj6C,OAAOqN,KAAK,OAAQ,OAC7B,CAEA,aAAO6sC,CAAOxR,GACQ,iBAATA,IACTA,EAAO1oC,OAAOqN,KAAKq7B,IAErB,MACMyR,ECvEH,SAAgB9uB,EAAG3X,GACxB,MAAMvU,EAAIuU,EAAE7R,SAAS,IACrB,MAAO,IAAIu4C,ODqEgB,ECrELj7C,EAAE1B,QAAU0B,CACpC,CDoEsBk7C,CAAO,EADV3R,EAAKjrC,OAAS,GAE7B,OAAOuC,OAAOkH,OAAO,CAAClH,OAAOqN,KAAK8sC,EAAW,QAASzR,GACxD,CAEA,mBAAO4R,CAAaxB,GAClB,MAAMvI,EAAS,IAAIsI,GAAaC,GAChC,OAAOlK,iBACL,IACE,IAAInxC,QAAe8yC,EAAOlyC,KAAK,GAC/B,GAAc,MAAVZ,EAAgB,OAAO,EAE3B,GADAA,EAASiI,SAASjI,EAAOoE,SAAS,QAAS,IAC5B,IAAXpE,EAAc,OAAO,KACzB,GAAe,IAAXA,EAAc,OAAO,KACzB,MAAMa,QAAeiyC,EAAOlyC,KAAKZ,EAAS,GAC1C,OAAc,MAAVa,GACGA,CACT,CAAE,MAAOuN,GAEP,OADAitC,EAAOtyC,MAAQqF,GACR,CACT,CACF,CACF,EEvFK+iC,eAAe2L,GAAoBl8C,GAExC,MAAMm8C,EAAgB,CAAC,EAEvB,IAAI9R,EACJ,KACEA,QAAarqC,KACA,IAATqqC,GAFO,CAGX,GAAa,OAATA,EAAe,SACnBA,EAAOA,EAAK7mC,SAAS,QAAQyF,QAAQ,MAAO,IAC5C,MAAMrI,EAAIypC,EAAK1vB,QAAQ,KACvB,GAAI/Z,GAAK,EAAG,CACV,MAAM6L,EAAM49B,EAAKlhC,MAAM,EAAGvI,GACpB1B,EAAQmrC,EAAKlhC,MAAMvI,EAAI,GAC7Bu7C,EAAc1vC,GAAOvN,CACvB,MACEi9C,EAAc9R,IAAQ,CAE1B,CACA,MAAO,CAAE+R,gBAAiB,EAAGD,gBAC/B,CCpBO5L,eAAe8L,GAAoB5B,GAAQ,QAAE6B,IAClD,MAAMC,EAAe,IAAI70C,IACnBytC,EAAO,IAAIjuC,IACXgwC,EAAU,IAAIhwC,IAIdlH,EAAO27C,GAAWM,aAAaxB,GACrC,IAAI+B,QAAgBx8C,IAEpB,KAAmB,OAAZw8C,GAAkBA,QAAgBx8C,IAEzC,IAAgB,IAAZw8C,EAAkB,MAAM,IAAInC,GAGhC,GAAImC,EAAQhjB,SAAS,aACnB,OAAO0iB,GAAoBl8C,GAI7B,GAAIw8C,EAAQh5C,SAAS,QAAQyF,QAAQ,MAAO,MAAQ,aAAaqzC,IAC/D,MAAM,IAAIhC,GAAW,aAAagC,OAAcE,EAAQh5C,SAAS,SAEnE,IAAIi5C,QAAgBz8C,IAEpB,KAAmB,OAAZy8C,GAAkBA,QAAgBz8C,IAGzC,IAAgB,IAAZy8C,EAAkB,MAAO,CAAEF,eAAcpH,OAAM+B,WAInD,GAHAuF,EAAUA,EAAQj5C,SAAS,QAGvBi5C,EAAQjjB,SAAS,aACnB,OAAO0iB,GAAoBl8C,GAG7B,MAAO08C,EAAUC,GAAoBC,GAAeH,EAAS,KAAQ,SAGrE,GAFAE,EAAiB1+B,MAAM,KAAKmsB,IAAIroB,GAAKw6B,EAAav+B,IAAI+D,IAErC,6DAAb26B,EAAyE,CAC3E,MAAOtH,EAAK9sC,GAAQs0C,GAAeF,EAAU,IAAK,KAElD,IADAvH,EAAKnlB,IAAI1nB,EAAM8sC,KACF,CACX,MAAM/K,QAAarqC,IACnB,IAAa,IAATqqC,EAAe,MACnB,GAAa,OAATA,EAAe,CACjB,MAAO+K,EAAK9sC,GAAQs0C,GAAevS,EAAK7mC,SAAS,QAAS,IAAK,KAC/D2xC,EAAKnlB,IAAI1nB,EAAM8sC,EACjB,CACF,CACF,CAEA,IAAK,MAAMyH,KAAON,EAChB,GAAIM,EAAI3J,WAAW,WAAY,CAC7B,MAAM3yC,EAAIs8C,EAAI5yC,MAAM,uBACH,IAAb1J,EAAEnB,QACJ83C,EAAQlnB,IAAIzvB,EAAE,GAAIA,EAAE,GAExB,CAEF,MAAO,CAAE67C,gBAAiB,EAAGG,eAAcpH,OAAM+B,UACnD,CAEA,SAAS0F,GAAevS,EAAMyS,EAAKvC,GACjC,MAAMt8B,EAAQosB,EAAKnR,OAAOjb,MAAM6+B,GAChC,GAAqB,IAAjB7+B,EAAM7e,OACR,MAAM,IAAIk7C,GACR,6BAA6BC,KAC7BlQ,EAAK7mC,SAAS,SAGlB,OAAOya,CACT,CChEA,MAAM8+B,GAAc,CAACC,EAAW9C,IAC9B8C,EAAUlU,SAAS,KACf,GAAGkU,IAAY9C,IACf,GAAG8C,KAAa9C,EAAIjxC,QAAQ,eAAgB,MAE5Cg0C,GAAgB,CAACC,EAAS9C,MAE1BA,EAAKX,UAAYW,EAAKV,YACxBwD,EAAQC,cAAgB3D,GAAyBY,IAG/CA,EAAK8C,SACP7xC,OAAOyL,OAAOomC,EAAS9C,EAAK8C,UAS1BE,GAAgB7M,UACpB,IAEE,MAAMhuC,EAAOZ,OAAOqN,WCnCjBuhC,eAAuBqJ,GAC5B,IAAIxqC,EAAO,EACX,MAAMmsC,EAAU,SCDXhL,eAAwBqJ,EAAUltC,GACvC,MAAM2wC,EAAO1D,GAAYC,GACzB,OAAa,CACX,MAAM,MAAE16C,EAAK,KAAEoO,SAAe+vC,EAAKhrC,OAEnC,GADInT,SAAawN,EAAGxN,GAChBoO,EAAM,KACZ,CACI+vC,EAAKtD,QAAQsD,EAAKtD,QACxB,CDLQuD,CAAS1D,EAAU16C,IACvBq8C,EAAQptC,KAAKjP,GACbkQ,GAAQlQ,EAAM0vB,aAEhB,MAAM5kB,EAAS,IAAI3E,WAAW+J,GAC9B,IAAImuC,EAAY,EAChB,IAAK,MAAMt9C,KAAUs7C,EACnBvxC,EAAOgmB,IAAI/vB,EAAQs9C,GACnBA,GAAat9C,EAAO2uB,WAEtB,OAAO5kB,CACT,CDoBmCwzC,CAAQl2B,EAAIwsB,OACrCsF,EAAW72C,EAAKiB,SAAS,QAG/B,MAAO,CAAE81C,QADPF,EAASh6C,OAAS,IAAMg6C,EAAWA,EAASjwC,MAAM,EAAG,KAAO,MAC5CiwC,WAAU72C,OAC9B,CAAE,MAAOjC,GACP,MAAO,CAAC,CACV,GAGK,MAAMm9C,GAMX,yBAAalB,GACX,MAAO,CAAC,WAAY,UACtB,CAqBA,qBAAamB,EAAS,KACpBC,EAAI,WACJC,EAAU,OACVC,EAAM,cACNC,EAAa,cACbC,EAAa,UACbf,EAAS,QACTV,EACApC,IAAK8D,EAAQ,QACbd,EAAO,gBACPd,IAEA,IAAI,IAAElC,EAAG,KAAEE,GAASH,GAAmB+D,GACvC,MAAMC,EAAejB,EAAYD,GAAYC,EAAW9C,GAAOA,EAQ/D,IAAI5yB,EACA42B,GARA9D,EAAKX,UAAYW,EAAKV,YACxBwD,EAAQC,cAAgB3D,GAAyBY,IAE3B,IAApBgC,IACFc,EAAQ,gBAAkB,aAK5B,IAAIiB,GAAqB,EACzB,GAaE,GAZA72B,QAAYq2B,EAAKS,QAAQ,CACvBR,aACA16B,OAAQ,MACRg3B,IAAK,GAAG+D,uBAAkC3B,IAC1CY,YAIFgB,GAAW,EAIY,MAAnB52B,EAAI4xB,YAAyC,MAAnB5xB,EAAI4xB,WAAoB,CAGpD,MAAMmF,EAAUF,EAAqBJ,EAAgBF,EACrD,GAAIQ,EAAS,CAOX,GAJAjE,QAAaiE,EAAQnE,EAAK,IACrBE,EACH8C,QAAS,IAAKA,KAEZ9C,GAAQA,EAAKkE,OACf,MAAM,IAAI/E,GACDa,IACT6C,GAAcC,EAAS9C,GACvB+D,GAAqB,EACrBD,GAAW,EAEf,CACF,MACqB,MAAnB52B,EAAI4xB,YACJiF,GACAL,SAEMA,EAAc5D,EAAKE,SAEpB8D,GAET,GAAuB,MAAnB52B,EAAI4xB,WAAoB,CAC1B,MAAM,SAAEE,SAAmBgE,GAAc91B,GACzC,MAAM,IAAI2xB,EAAU3xB,EAAI4xB,WAAY5xB,EAAI6xB,cAAeC,EACzD,CAEA,GACE9xB,EAAI41B,QAAQ,kBAAoB,iBAAiBZ,kBACjD,CACA,MAAMiC,QAAmBlC,GAAoB/0B,EAAIwsB,KAAM,CAAEwI,YAEzD,OADAiC,EAAWnE,KAAOA,EACXmE,CACT,CAAO,CAIL,MAAM,QAAEjF,EAAO,SAAEF,EAAQ,KAAE72C,SAAe66C,GAAc91B,GAGxD,IACE,MAAMi3B,QAAmBlC,GAAoB,CAAC95C,GAAO,CAAE+5C,YAEvD,OADAiC,EAAWnE,KAAOA,EACXmE,CACT,CAAE,MAAOj+C,GACP,MAAM,IAAI+4C,EAAeC,EAASF,EACpC,CACF,CACF,CAiBA,oBAAaoF,EAAQ,KACnBb,EAAI,WACJC,EAAU,UACVZ,EAAS,QACTV,EAAO,IACPpC,EAAG,KACHE,EAAI,KACJtG,EAAI,QACJoJ,IAIA,MAAMuB,EAAUxE,GAAmBC,GAC/BuE,IAASvE,EAAMuE,EAAQvE,KAEvB8C,IAAW9C,EAAM6C,GAAYC,EAAW9C,IAE5CgD,EAAQ,gBAAkB,iBAAiBZ,YAC3CY,EAAQwB,OAAS,iBAAiBpC,WAClCW,GAAcC,EAAS9C,GAEvB,MAAM9yB,QAAYq2B,EAAKS,QAAQ,CAC7BR,aACA16B,OAAQ,OACRg3B,IAAK,GAAGA,KAAOoC,IACfxI,OACAoJ,YAEF,GAAuB,MAAnB51B,EAAI4xB,WAAoB,CAC1B,MAAM,SAAEE,GAAagE,GAAc91B,GACnC,MAAM,IAAI2xB,EAAU3xB,EAAI4xB,WAAY5xB,EAAI6xB,cAAeC,EACzD,CACA,OAAO9xB,CACT,EGvNK,MAAMq3B,WAA8B1Q,EAMzC,WAAAtyB,CAAYu+B,EAAK0E,EAAWC,GAC1BlgB,MACE,eAAeub,gDAAkD0E,MAEnE58C,KAAKqlB,KAAOrlB,KAAKsG,KAAOq2C,GAAsBt3B,KAC9CrlB,KAAKO,KAAO,CAAE23C,MAAK0E,YAAWC,aAChC,EAGFF,GAAsBt3B,KAAO,wBCftB,MAAMy3B,WAAsB7Q,EAIjC,WAAAtyB,CAAYu+B,GACVvb,MAAM,6BAA6Bub,MACnCl4C,KAAKqlB,KAAOrlB,KAAKsG,KAAOw2C,GAAcz3B,KACtCrlB,KAAKO,KAAO,CAAE23C,MAChB,EAGF4E,GAAcz3B,KAAO,gBCJd,MAAM03B,GAUX,yBAAOC,EAAmB,IAAE9E,IAE1B,MAAM+E,EAAgB,IAAI/3C,IAC1B+3C,EAAcjvB,IAAI,OAAQytB,IAC1BwB,EAAcjvB,IAAI,QAASytB,IAE3B,MAAM7zC,EAsBV,UAAwB,IAAEswC,IAExB,GAAIA,EAAIhH,WAAW,QACjB,MAAO,CACL0L,UAAW,MACXM,QAAShF,GAGb,MAAM9xB,EAAU8xB,EAAIjwC,MAAM,uBAC1B,OAAgB,OAAZme,EAQe,QAAfA,EAAQ,GACH,CACLw2B,UAAWx2B,EAAQ,GACnB82B,QAAS92B,EAAQ,IASF,OAAfA,EAAQ,GACH,CACLw2B,UAAWx2B,EAAQ,GACnB82B,QAAS92B,EAAQ,SAHrB,OApBA,CA0BF,CAzDkB+2B,CAAe,CAAEjF,QAC/B,IAAKtwC,EACH,MAAM,IAAIk1C,GAAc5E,GAE1B,GAAI+E,EAAchM,IAAIrpC,EAAMg1C,WAC1B,OAAOK,EAAct6C,IAAIiF,EAAMg1C,WAEjC,MAAM,IAAID,GACRzE,EACAtwC,EAAMg1C,UACc,QAApBh1C,EAAMg1C,UCnCL,SAA4B1E,GAKjC,OAHAA,EAAMA,EAAIjxC,QAAQ,gBAAiB,gBAEzBA,QAAQ,YAAa,WAEjC,CD6BkCm2C,CAAmBlF,QAAOv2C,EAE1D,EEhCF,IAAI,GAAO,KAEJ,MAAM07C,GASX,iBAAar/C,EAAK,GAAEksC,EAAE,OAAEC,IACT,OAAT,KAAe,GAAO,IAAI,GAC9B,MAAMgB,EAAW,EAAKhB,EAAQ,WACxBmT,EAAO,IAAI53C,IAUjB,aATM,GAAK8E,QAAQ2gC,EAAUoD,iBAC3B,MAAMz6B,QAAao2B,EAAGlsC,KAAKmtC,EAAU,CAAE99B,SAAU,SACjD,OAAa,OAATyG,GACgB,KAAhBA,EAAKojB,OADiBomB,OAE1BxpC,EACGojB,OACAjb,MAAM,MACNmsB,IAAImI,GAAO+M,EAAKthC,IAAIu0B,GACzB,GACO+M,CACT,CAYA,kBAAan+C,EAAM,GAAE+qC,EAAE,OAAEC,EAAM,KAAEmT,IAClB,OAAT,KAAe,GAAO,IAAI,GAC9B,MAAMnS,EAAW,EAAKhB,EAAQ,WAC9B,GAAImT,EAAKlwC,KAAO,EAAG,CACjB,MAAM0G,EAAO,IAAIwpC,GAAMvgC,KAAK,MAAQ,WAC9B,GAAKvS,QAAQ2gC,EAAUoD,uBACrBrE,EAAG/qC,MAAMgsC,EAAUr3B,EAAM,CAC7BzG,SAAU,QAEd,EACF,YAEQ,GAAK7C,QAAQ2gC,EAAUoD,uBACrBrE,EAAGgM,GAAG/K,EACd,EAEJ,ECxDK,MAAMoS,WAAwBtR,EAOnC,WAAAtyB,CAAY42B,EAAKhe,EAAQgmB,EAAUpN,GACjCxO,MACE,UAAU4T,KACRpF,EAAW,MAAMA,IAAa,6BACLoN,iBAAwBhmB,MAErDvyB,KAAKqlB,KAAOrlB,KAAKsG,KAAOi3C,GAAgBl4B,KACxCrlB,KAAKO,KAAO,CAAEgwC,MAAKhe,SAAQgmB,WAAUpN,WACvC,ECjBK,SAASqS,IAAa,KAAEl3C,EAAI,MAAEm3C,EAAK,UAAEC,EAAS,eAAEC,IAErD,MAAO,GAAGr3C,MAASm3C,MAAUC,KAD7BC,EAQF,SAA8BC,GAC5B,MAAMz7C,EAWR,SAAoBkR,GAClB,OAAOpU,KAAKkD,KAAKkR,KAAOhK,OAAOw0C,GAAGxqC,GAAI,IAAM,EAAI,EAClD,CAbeyqC,CAgBA,KADczqC,EAfiBuqC,GAgB3BvqC,GAAKA,GADxB,IAA6BA,EAd3BuqC,EAAU3+C,KAAKK,IAAIs+C,GACnB,MAAMG,EAAQ9+C,KAAKO,MAAMo+C,EAAU,IACnCA,GAAmB,GAARG,EACX,IAAIC,EAAWp4C,OAAOm4C,GAClBE,EAAar4C,OAAOg4C,GAGxB,OAFII,EAAS5gD,OAAS,IAAG4gD,EAAW,IAAMA,GACtCC,EAAW7gD,OAAS,IAAG6gD,EAAa,IAAMA,KAC5B,IAAV97C,EAAc,IAAM,KAAO67C,EAAWC,CAChD,CAlBmBC,CAAqBP,IAExC,CCHO,SAASQ,GAAkB5oC,GAOhC,OAHAA,GAFAA,EAAMA,EAAItO,QAAQ,MAAO,KAEfA,QAAQ,OAAQ,KAEhBA,QAAQ,OAAQ,IAAM,IAElC,CCRO,SAASm3C,GAAYC,GAC1B,MAAO,CAAE/3C,EAAMm3C,EAAOC,EAAWx/C,GAAUmgD,EAAOp2C,MAChD,2BAEF,MAAO,CACL3B,OACAm3C,QACAC,UAAWv4C,OAAOu4C,GAClBC,eAAgBW,GAAoBpgD,GAExC,CAMA,SAASogD,GAAoBpgD,GAC3B,IAAK,CAAEiE,EAAM47C,EAAOH,GAAW1/C,EAAO+J,MAAM,sBAE5C,OADA21C,GAAoB,MAATz7C,EAAe,GAAK,IAAsB,GAAhBgD,OAAO44C,GAAc54C,OAAOy4C,IAKpD,KADcvqC,EAHAuqC,GAIVvqC,GAAKA,EADxB,IAA6BA,CAF7B,CHAAkqC,GAAgBl4B,KAAO,kBIfhB,MAAMk5B,GACX,WAAA5kC,CAAYsU,GACV,GAAmB,iBAARA,EACTjuB,KAAKw+C,KAAOvwB,OACP,GAAItuB,OAAOqtB,SAASiB,GACzBjuB,KAAKw+C,KAAOvwB,EAAIzsB,SAAS,YACpB,IAAmB,iBAARysB,EAGhB,MAAM,IAAI,EACR,sDAHFjuB,KAAKw+C,KAAOD,GAAgBnN,OAAOnjB,EAKrC,CACF,CAEA,WAAOjhB,CAAKihB,GACV,OAAO,IAAIswB,GAAgBtwB,EAC7B,CAEA,aAAOmjB,CAAOp0C,GACZ,MAAO,UAAUA,EAAIojB,gBAClBpjB,EAAIwZ,aACLxZ,EAAIixB,eACDuvB,GAAaxgD,EAAIyhD,cAExBzhD,EAAIid,YACJjd,EAAI0hD,OAAS1hD,EAAI0hD,OAAS,IAC1B,CAEA,WAAAC,GACE,OAAO3+C,KAAKw+C,KAAKr3C,MAAM,EAAGnH,KAAKw+C,KAAK7lC,QAAQ,QAC9C,CAEA,OAAAsB,GACE,MAAMgU,EAAMjuB,KAAK4+C,mBACjB,OAAO3wB,EAAI9mB,MAAM8mB,EAAItV,QAAQ,QAAU,EACzC,CAEA,KAAAkmC,GACE,OAAOx1C,OAAOyL,OAAO9U,KAAKk7C,UAAW,CACnCjhC,QAASja,KAAKia,UACdykC,OAAQ1+C,KAAK0+C,UAEjB,CAEA,MAAAtN,GACE,OAAOpxC,KAAKw+C,IACd,CAEA,OAAAtD,GACE,MAAMA,EAAUl7C,KAAK2+C,cAAc1iC,MAAM,MACnC6iC,EAAK,GACX,IAAK,MAAMr3B,KAAKyzB,EACD,MAATzzB,EAAE,GAEJq3B,EAAGA,EAAG1hD,OAAS,IAAM,KAAOqqB,EAAEtgB,MAAM,GAEpC23C,EAAG3yC,KAAKsb,GAGZ,MAAMzqB,EAAM,CAAC,EACb,IAAK,MAAMyqB,KAAKq3B,EAAI,CAClB,MAAMr0C,EAAMgd,EAAEtgB,MAAM,EAAGsgB,EAAE9O,QAAQ,MAC3Bzb,EAAQuqB,EAAEtgB,MAAMsgB,EAAE9O,QAAQ,KAAO,GACnClV,MAAMkH,QAAQ3N,EAAIyN,IACpBzN,EAAIyN,GAAK0B,KAAKjP,GAEdF,EAAIyN,GAAOvN,CAEf,CAOA,OANIF,EAAIyhD,SACNzhD,EAAIyhD,OAASL,GAAYphD,EAAIyhD,SAE3BzhD,EAAI+hD,YACN/hD,EAAI+hD,UAAYX,GAAYphD,EAAI+hD,YAE3B/hD,CACT,CAEA,gBAAA4hD,GACE,MAAM3wB,EAAMkwB,GAAkBn+C,KAAKw+C,MACnC,OAAwD,IAApDvwB,EAAItV,QAAQ,mCAAkDsV,EAC3DA,EAAI9mB,MAAM,EAAG8mB,EAAIoG,YAAY,mCACtC,CAEA,MAAAqqB,GACE,IAA8D,IAA1D1+C,KAAKw+C,KAAK7lC,QAAQ,mCAMtB,OAAOwlC,GALWn+C,KAAKw+C,KAAKr3C,MAC1BnH,KAAKw+C,KAAK7lC,QAAQ,iCAClB3Y,KAAKw+C,KAAK7lC,QAAQ,+BAChB,IAGN,CAEA,OAAAqmC,GACE,OAAOh/C,KAAK4+C,mBAAqB,IACnC,CAEA,QAAAhN,GACE,OAAOjyC,OAAOqN,KAAKhN,KAAKw+C,KAAM,OAChC,CAEA,iBAAar8C,CAAK8rB,EAAK9rB,EAAM88C,GAC3B,MAAMD,EAAU/wB,EAAI+wB,UACpB,IAAI,UAAEE,SAAoB/8C,EAAK,CAAE68C,UAASC,cAE1CC,EAAYf,GAAkBe,GAC9B,MAAMC,EAAYH,EAAUE,EAE5B,OAAOX,GAAgBvxC,KAAKmyC,EAC9B,ECpHK,SAASC,GAAO7pC,GACrB,OACEA,EACG2hB,OACAjb,MAAM,MACNmsB,IAAIroB,GAAK,IAAMA,GACfhD,KAAK,MAAQ,IAEpB,CCDO,MAAMsiC,GACX,WAAA1lC,CAAY2lC,GACV,GAAsB,iBAAXA,EACTt/C,KAAKu/C,QAAUD,OACV,GAAI3/C,OAAOqtB,SAASsyB,GACzBt/C,KAAKu/C,QAAUD,EAAO99C,SAAS,YAC1B,IAAsB,iBAAX89C,EAGhB,MAAM,IAAI,EAAc,gDAFxBt/C,KAAKu/C,QAAUF,GAAUjO,OAAOkO,EAGlC,CACF,CAEA,2BAAOE,EAAqB,QAAER,EAAO,UAAEE,IACrC,MAAMhE,EAAUmE,GAAUV,YAAYK,GAChC/kC,EAAUolC,GAAUI,YAAYT,GAChCM,EAASnB,GACbjD,EAAU,WAAakE,GAAOF,GAAa,KAAOjlC,GAEpD,OAAO,IAAIolC,GAAUC,EACvB,CAEA,WAAOtyC,CAAKsyC,GACV,OAAO,IAAID,GAAUC,EACvB,CAEA,QAAA1N,GACE,OAAOjyC,OAAOqN,KAAKhN,KAAKu/C,QAAS,OACnC,CAGA,OAAArE,GACE,OAAOl7C,KAAK0/C,cACd,CAGA,OAAAzlC,GACE,OAAOolC,GAAUI,YAAYz/C,KAAKu/C,QACpC,CAEA,KAAAV,GACE,OAAOx1C,OAAOyL,OAAO,CAAEmF,QAASja,KAAKia,WAAaja,KAAKk7C,UACzD,CAEA,kBAAOuE,CAAYH,GACjB,OAAOnB,GAAkBmB,EAAOn4C,MAAMm4C,EAAO3mC,QAAQ,QAAU,GACjE,CAEA,kBAAOgmC,CAAYW,GACjB,OAAOA,EAAOn4C,MAAM,EAAGm4C,EAAO3mC,QAAQ,QACxC,CAEA,YAAA+mC,GACE,MAAMxE,EAAUmE,GAAUV,YAAY3+C,KAAKu/C,SAAStjC,MAAM,MACpD6iC,EAAK,GACX,IAAK,MAAMr3B,KAAKyzB,EACD,MAATzzB,EAAE,GAEJq3B,EAAGA,EAAG1hD,OAAS,IAAM,KAAOqqB,EAAEtgB,MAAM,GAEpC23C,EAAG3yC,KAAKsb,GAGZ,MAAMzqB,EAAM,CACV8f,OAAQ,IAEV,IAAK,MAAM2K,KAAKq3B,EAAI,CAClB,MAAMr0C,EAAMgd,EAAEtgB,MAAM,EAAGsgB,EAAE9O,QAAQ,MAC3Bzb,EAAQuqB,EAAEtgB,MAAMsgB,EAAE9O,QAAQ,KAAO,GACnClV,MAAMkH,QAAQ3N,EAAIyN,IACpBzN,EAAIyN,GAAK0B,KAAKjP,GAEdF,EAAIyN,GAAOvN,CAEf,CAOA,OANIF,EAAIqhD,SACNrhD,EAAIqhD,OAASD,GAAYphD,EAAIqhD,SAE3BrhD,EAAI+hD,YACN/hD,EAAI+hD,UAAYX,GAAYphD,EAAI+hD,YAE3B/hD,CACT,CAEA,oBAAO2iD,CAAc3iD,GACnB,IAAIk+C,EAAU,GAMd,GALIl+C,EAAImoB,KACN+1B,GAAW,QAAQl+C,EAAImoB,SAEvB+1B,GAAW,kDAETl+C,EAAI8f,OAAQ,CACd,QAA0Bnb,IAAtB3E,EAAI8f,OAAO1f,OACb,MAAM,IAAI,EAAc,+CAE1B,IAAK,MAAMsd,KAAK1d,EAAI8f,OAClBo+B,GAAW,UAAUxgC,KAEzB,CAQA,OANAwgC,GAAW,UAAUsC,GADNxgD,EAAIqhD,YAGnBnD,GAAW,aAAasC,GADNxgD,EAAI+hD,WAAa/hD,EAAIqhD,YAEnCrhD,EAAI0hD,SACNxD,GAAW,SAAWkE,GAAOpiD,EAAI0hD,SAE5BxD,CACT,CAEA,aAAO9J,CAAOp0C,GACZ,OAAOqiD,GAAUM,cAAc3iD,GAAO,KAAOmhD,GAAkBnhD,EAAIid,QACrE,CAEA,MAAAm3B,GACE,OAAOpxC,KAAKu/C,OACd,CAEA,gBAAAX,GACE,MAAMU,EAASnB,GAAkBn+C,KAAKu/C,SACtC,OAAoC,IAAhCD,EAAO3mC,QAAQ,YAA2B2mC,EAMvCnB,GALSmB,EAAOn4C,MAAM,EAAGm4C,EAAO3mC,QAAQ,aAKZ,KAJnB2mC,EAAOn4C,MACrBm4C,EAAO3mC,QAAQ,iCACb,IAGN,CAEA,gBAAAinC,GAME,OALkB5/C,KAAKu/C,QAAQp4C,MAC7BnH,KAAKu/C,QAAQ5mC,QAAQ,iCACrB3Y,KAAKu/C,QAAQ5mC,QAAQ,+BACnB,ICzIHsD,MAAM,MACNmsB,IAAIroB,GAAKA,EAAE9Y,QAAQ,KAAM,KACzB8V,KAAK,KD0IR,CAEA,iBAAa5a,CAAKm9C,EAAQn9C,EAAM88C,GAC9B,MAAMD,EAAUM,EAAOV,mBACjB3kC,EAAUolC,GAAUI,YAAYH,EAAOC,SAC7C,IAAI,UAAEL,SAAoB/8C,EAAK,CAAE68C,UAASC,cAE1CC,EAAYf,GAAkBe,GAC9B,MACMW,EADUR,GAAUV,YAAYW,EAAOC,SAE3CrE,WAA4BkE,GAAOF,GAAa,KAAOjlC,EAEzD,OAAOolC,GAAUryC,KAAK6yC,EACxB,EErJK,MAAMC,GASX,WAAO/wC,EAAK,KAAEyH,EAAI,OAAE4J,IAClB,MAAMyB,EAAS,GAAGrL,KAAQ4J,EAAOhjB,WAC3B2iD,EAAYl+B,EAAOzkB,OACnB4iD,EAAcD,EAAY3/B,EAAOhjB,OAGjC6iD,EAAgB,IAAI58C,WAAW28C,GACrC,IAAK,IAAIphD,EAAI,EAAGA,EAAImhD,EAAWnhD,IAC7BqhD,EAAcrhD,GAAKijB,EAAOjM,WAAWhX,GAIvC,OAFAqhD,EAAcjyB,IAAI5N,EAAQ2/B,GAEnBE,CACT,CASA,aAAOC,CAAOjiD,GACZ,MAAMa,EAAIb,EAAO0a,QAAQ,IACnB/Z,EAAIX,EAAO0a,QAAQ,GACnBnC,EAAOvY,EAAOkJ,MAAM,EAAGrI,GAAG0C,SAAS,QACnCpE,EAASa,EAAOkJ,MAAMrI,EAAI,EAAGF,GAAG4C,SAAS,QACzC2+C,EAAeliD,EAAOb,QAAUwB,EAAI,GAE1C,GAAIyG,SAASjI,KAAY+iD,EACvB,MAAM,IAAI,EACR,6BAA6B/iD,mBAAwB+iD,cAGzD,MAAO,CACL3pC,OACA4J,OAAQzgB,OAAOqN,KAAK/O,EAAOkJ,MAAMvI,EAAI,IAEzC,E,eCTF,SAASwhD,GAAalQ,GACpB,IAAIloC,EAAS,EACT2D,EAAQ,EACRkjC,EAAO,KACX,GACEA,EAAOqB,EAAOnX,YACd/wB,IAAkB,IAAP6mC,IAAsBljC,EACjCA,GAAS,QACK,IAAPkjC,GACT,OAAO7mC,CACT,CAEA,SAASq4C,GAAcnQ,EAAQjhC,EAAO7B,GACpC,IAAIpF,EAAS,EACT2D,EAAQ,EACZ,KAAOyB,KACO,EAAR6B,IACFjH,GAAUkoC,EAAOnX,aAAeptB,GAElCsD,IAAU,EACVtD,GAAS,EAEX,OAAO3D,CACT,CAEA,SAASs4C,GAAOpQ,EAAQx0B,GAEtB,MAAMmzB,EAAOqB,EAAOnX,YAIpB,GAHa,IAGT8V,EAAa,CAEf,MAAM3wC,EAASmiD,GAAcnQ,EAJlB,GAI0BrB,EAAa,GAClD,IAAIzhC,EAAOizC,GAAcnQ,GAJd,IAIuBrB,IAAgB,EAAG,GAGrD,OADa,IAATzhC,IAAYA,EAAO,OAChBsO,EAAOvU,MAAMjJ,EAAQA,EAASkP,EACvC,CAEE,OAAO8iC,EAAO/oC,MAAM0nC,EAExB,C,eCvBAN,eAAegS,GAAYrQ,GAEzB,IAAIrB,QAAaqB,EAAOrB,OACxB,MAAMr4B,EAAQq4B,GAAQ,EAAK,EAG3B,IAYI2R,EACAC,EAbArjD,EAAgB,GAAPyxC,EAGb,GAAW,IAAPA,EAAmB,CACrB,IAAIljC,EAAQ,EACZ,GACEkjC,QAAaqB,EAAOrB,OACpBzxC,IAAkB,IAAPyxC,IAAsBljC,EACjCA,GAAS,QACK,IAAPkjC,EACX,CAIA,GAAa,IAATr4B,EAAY,CACd,IAAI7K,EAAQ,EACZ60C,EAAM,EACN,MAAM5oB,EAAQ,GACd,GACEiX,QAAaqB,EAAOrB,OACpB2R,IAAe,IAAP3R,IAAsBljC,EAC9BA,GAAS,EACTisB,EAAMzrB,KAAK0iC,SACG,IAAPA,GACT4R,EAAY9gD,OAAOqN,KAAK4qB,EAC1B,CAKA,OAJa,IAATphB,IAEFiqC,QADkBvQ,EAAOlyC,KAAK,KAGzB,CAAEwY,OAAMpZ,SAAQojD,MAAKC,YAC9B,CChGA,IAAIC,IAA8B,EAE3BnS,eAAel8B,GAAQpU,GAI5B,OAHoC,OAAhCyiD,KACFA,GAaJ,WACE,IAEE,GADW,IAAIC,oBAAoB,WAC3B,OAAO,CACjB,CAAE,MAAO9yC,GAET,CACA,OAAO,CACT,CArBkC+yC,IAEzBF,GAKTnS,eAA8BtwC,GAC5B,MAAM4iD,EAAK,IAAIF,oBAAoB,WAC7B9hD,EAAI,IAAIiiD,KAAK,CAAC7iD,IAASw6C,SAASsI,YAAYF,GAClD,OAAO,IAAIx9C,iBAAiB,IAAI29C,SAASniD,GAAGoiD,cAC9C,CARMC,CAAejjD,GACf4W,GAAKxC,QAAQpU,EACnB,CC8BO,MAAMkjD,GACX,WAAAxnC,CAAYynC,GACV/3C,OAAOyL,OAAO9U,KAAMohD,GACpBphD,KAAKqhD,YAAc,CAAC,CACtB,CAEA,oBAAaC,EAAQ,IAAE/Z,EAAG,oBAAEga,IAC1B,MAAMrR,EAAS,IAAIzD,EAAalF,GAGhC,GAAc,aAFA2I,EAAO/oC,MAAM,GAAG3F,SAAS,OAGrC,OAEF,MAAMqc,EAAUqyB,EAAO5W,eACvB,GAAgB,IAAZzb,EACF,MAAM,IAAI,EACR,0BAA0BA,8CAG9B,GAAI0pB,EAAI3a,WAAa,WACnB,MAAM,IAAI,EACR,uHAIJsjB,EAAOrD,KAAKqD,EAAOtD,OAAS,MAE5B,MAAMx/B,EAAO8iC,EAAO5W,eACdkoB,EAAS,GACf,IAAK,IAAI5iD,EAAI,EAAGA,EAAIwO,EAAMxO,IAAK,CAC7B,MAAM0C,EAAO4uC,EAAO/oC,MAAM,IAAI3F,SAAS,OACvCggD,EAAO5iD,GAAK0C,CACd,CACA4uC,EAAOrD,KAAKqD,EAAOtD,OAAS,EAAIx/B,GAGhC,MAAMq0C,EAAU,IAAIv8C,IACpB,IAAK,IAAItG,EAAI,EAAGA,EAAIwO,EAAMxO,IACxB6iD,EAAQzzB,IAAIwzB,EAAO5iD,GAAIsxC,EAAO5W,gBAEhC,MAAMooB,EAAcxR,EAAO/oC,MAAM,IAAI3F,SAAS,OAC9C,OAAO,IAAI2/C,GAAa,CACtBK,SACAG,KAAM,CAAC,EACPF,UACAC,cACAH,uBAEJ,CAEA,qBAAaK,EAAS,KAAEC,EAAI,oBAAEN,EAAmB,WAAE3F,IACjD,MAAMkG,EAAgB,CACpB,EAAG,SACH,EAAG,OACH,EAAG,OACH,EAAG,MACH,EAAG,YACH,EAAG,aAECC,EAAiB,CAAC,EAKlBL,EAAcG,EAAK16C,OAAO,IAAI3F,SAAS,OAEvCggD,EAAS,GACTG,EAAO,CAAC,EACRF,EAAU,IAAIv8C,IACpB,IAAI88C,EAAmB,KACnBC,EAAc,WFzGf1T,eAAwBkK,EAAQn2B,GACrC,MAAM4tB,EAAS,IAAIsI,GAAaC,GAChC,IAAIyJ,QAAahS,EAAOlyC,KAAK,GAE7B,GADAkkD,EAAOA,EAAK1gD,SAAS,QACR,SAAT0gD,EACF,MAAM,IAAI,EAAc,wBAAwBA,MAGlD,IAAIrkC,QAAgBqyB,EAAOlyC,KAAK,GAEhC,GADA6f,EAAUA,EAAQyb,aAAa,GACf,IAAZzb,EACF,MAAM,IAAI,EAAc,6BAA6BA,KAGvD,IAAIskC,QAAmBjS,EAAOlyC,KAAK,GAGnC,GAFAmkD,EAAaA,EAAW7oB,aAAa,KAEjC6oB,EAAa,GAEjB,MAAQjS,EAAOvD,OAASwV,KAAc,CACpC,MAAMjkD,EAASgyC,EAAOtD,QAChB,KAAEp2B,EAAI,OAAEpZ,EAAM,IAAEojD,EAAG,UAAEC,SAAoBF,GAAYrQ,GACrD9gB,EAAW,IAAIva,GAAKqa,QAC1B,MAAQE,EAASpnB,QAAQ,CACvB,MAAMwa,QAAc0tB,EAAO1tB,QAC3B,IAAKA,EAAO,MAEZ,GADA4M,EAASjjB,KAAKqW,GAAO,GACjB4M,EAAS5jB,IACX,MAAM,IAAI,EAAc,eAAe4jB,EAASje,OAElD,GAAIie,EAASpnB,OAAQ,CACnB,GAAIonB,EAASpnB,OAAO5K,SAAWA,EAC7B,MAAM,IAAI,EACR,yEAKE8yC,EAAOmJ,aACPnJ,EAAOlyC,KAAKwkB,EAAMplB,OAASgyB,EAASre,KAAK0C,UAC/C,MAAM1B,EAAMm+B,EAAOtD,aACbtqB,EAAO,CACX/hB,KAAM6uB,EAASpnB,OACfwO,OACAoU,IAAKu3B,EACLjkD,SACA6T,MACA0uC,YACAD,OAEJ,CACF,CACF,CACF,CEsDU4B,CAAS,CAACP,GAAOtT,OAAShuC,OAAMiW,OAAMiqC,YAAWviD,SAAQ0sB,UACpC,OAArBo3B,IAA2BA,EAAmBp3B,GAClD,MAAMy3B,EAAUpjD,KAAKO,MACS,KAA1BwiD,EAAmBp3B,GAAco3B,GAEjCK,IAAYJ,GACVrG,SACIA,EAAW,CACf0G,MAAO,oBACPC,OAAQP,EAAmBp3B,EAC3Bxb,MAAO4yC,IAIbC,EAAcI,GAIV,CAAC,SAAU,OAAQ,OAAQ,OAAO7qB,SAFtChhB,EAAOsrC,EAActrC,KAOD,cAATA,GAKS,cAATA,KATTurC,EAAe7jD,GAAU,CACvBsY,OACAtY,aAgBN,MAAMskD,EAAcn5C,OAAO+C,KAAK21C,GAAgB3Z,IAAIjjC,QACpD,IAAK,MAAOvG,EAAGuxB,KAAUqyB,EAAYjT,UAAW,CAC9C,MAAMx9B,EACJnT,EAAI,IAAM4jD,EAAYplD,OAASykD,EAAKj1B,WAAa,GAAK41B,EAAY5jD,EAAI,GAClEunC,EAAI4b,EAAe5xB,GACnB/D,EAAM/d,GAAMf,IAAIu0C,EAAK16C,MAAMgpB,EAAOpe,MAAU,EAClDo0B,EAAEp0B,IAAMA,EACRo0B,EAAE/Z,IAAMA,CACV,CAGA,MAAM1R,EAAI,IAAIymC,GAAa,CACzBU,KAAMv8C,QAAQ0F,QAAQ62C,GACtBH,cACAC,OACAH,SACAC,UACAF,wBAIFU,EAAc,KACd,IAAI3qC,EAAQ,EACZ,MAAMmrC,EAAiB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACzD,IAAK,IAAIvkD,KAAU6jD,EAAgB,CACjC7jD,EAASiH,OAAOjH,GAChB,MAAMmkD,EAAUpjD,KAAKO,MAAe,IAAR8X,EAAe0qC,GACvCK,IAAYJ,GACVrG,SACIA,EAAW,CACf0G,MAAO,mBACPC,OAAQjrC,EACRlI,MAAO4yC,IAIb1qC,IACA2qC,EAAcI,EAEd,MAAMlc,EAAI4b,EAAe7jD,GACzB,IAAIioC,EAAEoK,IACN,IACE71B,EAAEgoC,UAAY,EACdhoC,EAAEioC,kBAAoB,EACtB,MAAM,KAAEnsC,EAAI,OAAE4J,SAAiB1F,EAAEkoC,UAAU,CAAEzyB,MAAOjyB,IACpDukD,EAAe/nC,EAAEgoC,YAAc,EAC/B,MAAMnS,QAAY/B,EAAOsR,GAAU/wC,KAAK,CAAEyH,OAAM4J,YAChD+lB,EAAEoK,IAAMA,EACRiR,EAAOr1C,KAAKokC,GACZkR,EAAQzzB,IAAIuiB,EAAKryC,GACjByjD,EAAKpR,GAAOpK,EAAE/Z,GAChB,CAAE,MAAO5gB,GACP,QACF,CACF,CAGA,OADAg2C,EAAO7Q,OACAj2B,CACT,CAEA,cAAM9a,GACJ,MAAM25C,EAAU,GACVp6C,EAAQ,CAACoW,EAAKlI,KAClBksC,EAAQptC,KAAKxM,OAAOqN,KAAKuI,EAAKlI,KAGhClO,EAAM,WAAY,OAElBA,EAAM,WAAY,OAElB,MAAM0jD,EAAe,IAAIpW,EAAa9sC,OAAOO,MAAM,OACnD,IAAK,IAAItB,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,IAAI0Y,EAAQ,EACZ,IAAK,MAAMhW,KAAQtB,KAAKwhD,OAClBn8C,SAAS/D,EAAK6F,MAAM,EAAG,GAAI,KAAOvI,GAAG0Y,IAE3CurC,EAAa1hD,cAAcmW,EAC7B,CACAiiC,EAAQptC,KAAK02C,EAAa5kD,QAE1B,IAAK,MAAMqD,KAAQtB,KAAKwhD,OACtBriD,EAAMmC,EAAM,OAGd,MAAMwhD,EAAa,IAAIrW,EAAa9sC,OAAOO,MAA2B,EAArBF,KAAKwhD,OAAOpkD,SAC7D,IAAK,MAAMkE,KAAQtB,KAAKwhD,OACtBsB,EAAW3hD,cAAcnB,KAAK2hD,KAAKrgD,IAErCi4C,EAAQptC,KAAK22C,EAAW7kD,QAExB,MAAM8kD,EAAgB,IAAItW,EAAa9sC,OAAOO,MAA2B,EAArBF,KAAKwhD,OAAOpkD,SAChE,IAAK,MAAMkE,KAAQtB,KAAKwhD,OACtBuB,EAAc5hD,cAAcnB,KAAKyhD,QAAQ9+C,IAAIrB,IAE/Ci4C,EAAQptC,KAAK42C,EAAc9kD,QAE3BkB,EAAMa,KAAK0hD,YAAa,OAExB,MAAMsB,EAAcrjD,OAAOkH,OAAO0yC,GAC5B/C,QAAYhI,EAAOwU,GACnBC,EAAYtjD,OAAOO,MAAM,IAE/B,OADA+iD,EAAU9jD,MAAMq3C,EAAK,OACd72C,OAAOkH,OAAO,CAACm8C,EAAaC,GACrC,CAEA,UAAMC,EAAK,KAAErB,IACX7hD,KAAK6hD,KAAOA,CACd,CAEA,YAAMsB,GACJnjD,KAAK6hD,KAAO,IACd,CAEA,UAAM7jD,EAAK,IAAEuyC,IACX,IAAKvwC,KAAKyhD,QAAQ9+C,IAAI4tC,GAAM,CAC1B,GAAIvwC,KAAKuhD,oBAEP,OADAvhD,KAAK2iD,oBACE3iD,KAAKuhD,oBAAoBhR,GAEhC,MAAM,IAAI,EAAc,yBAAyBA,kBAErD,CACA,MAAMpgB,EAAQnwB,KAAKyhD,QAAQ9+C,IAAI4tC,GAC/B,OAAOvwC,KAAK4iD,UAAU,CAAEzyB,SAC1B,CAEA,eAAMyyB,EAAU,MAAEzyB,IAChB,GAAInwB,KAAKqhD,YAAYlxB,GACnB,OAAO9mB,OAAOyL,OAAO,CAAC,EAAG9U,KAAKqhD,YAAYlxB,IAW5C,GATAnwB,KAAK0iD,aASA1iD,KAAK6hD,KACR,MAAM,IAAI,EACR,yEAGJ,MAAMtgC,SAAavhB,KAAK6hD,MAAM16C,MAAMgpB,GAC9B+f,EAAS,IAAIzD,EAAalrB,GAC1BstB,EAAOqB,EAAOnX,YAEdqqB,EAAe,IAAPvU,EACd,IAAIr4B,EAlBU,CACZ,GAAW,SACX,GAAW,OACX,GAAW,OACX,GAAW,MACX,GAAW,YACX,IAAW,aAYI4sC,GACjB,QAAazhD,IAAT6U,EACF,MAAM,IAAI,EAAc,wBAA0B4sC,EAAM5hD,SAAS,IAInE,MAAM6hD,EAAkB,GAAPxU,EACjB,IAAIzxC,EAASimD,EAGY,IAAPxU,IAEhBzxC,EA1RN,SAA2B8yC,EAAQoT,GACjC,IAAIt7C,EAASs7C,EACT33C,EAAQ,EACRkjC,EAAO,KACX,GACEA,EAAOqB,EAAOnX,YACd/wB,IAAkB,IAAP6mC,IAAsBljC,EACjCA,GAAS,QACK,IAAPkjC,GACT,OAAO7mC,CACT,CAgReu7C,CAAkBrT,EAAQmT,IAErC,IAAIjsC,EAAO,KACPgJ,EAAS,KAEb,GAAa,cAAT5J,EAAsB,CACxB,MAAMtY,EArTZ,SAAsBgyC,GACpB,MAAMtY,EAAQ,GACd,IAAIiX,EAAO,EACP2U,EAAY,EAChB,EAAG,CACD3U,EAAOqB,EAAOnX,YAEd,MAAM0qB,EAAmB,IAAP5U,EAClBjX,EAAMzrB,KAAKs3C,GAGXD,EAAmB,IAAP3U,CACd,OAAS2U,GAIT,OAAO5rB,EAAMjc,OAAO,CAAC4P,EAAGP,IAAQO,EAAI,GAAM,EAAKP,GAAI,EACrD,CAoSqB04B,CAAaxT,GACtByT,EAAaxzB,EAAQjyB,IACvBkiB,OAAQhJ,EAAMZ,cAAexW,KAAK4iD,UAAU,CAAEzyB,MAAOwzB,IAC3D,CACA,GAAa,cAATntC,EAAsB,CACxB,MAAM+5B,EAAML,EAAO/oC,MAAM,IAAI3F,SAAS,SAClC4e,OAAQhJ,EAAMZ,cAAexW,KAAKhC,KAAK,CAAEuyC,QAC/C,CAEA,MAAMtyC,EAASsjB,EAAIpa,MAAM+oC,EAAOtD,QAGhC,GAFAxsB,EAASzgB,OAAOqN,WAAWqF,GAAQpU,IAE/BmiB,EAAOwM,aAAexvB,EACxB,MAAM,IAAI,EACR,6CAA6CA,uBAA4BgjB,EAAOwM,cAWpF,OARIxV,IACFgJ,EAASzgB,OAAOqN,KHzUf,SAAoB42C,EAAOloC,GAChC,MAAMw0B,EAAS,IAAIzD,EAAamX,GAC1BC,EAAazD,GAAalQ,GAEhC,GAAI2T,IAAenoC,EAAOkR,WACxB,MAAM,IAAI,EACR,2CAA2Ci3B,uCAAgDnoC,EAAOte,gBAGtG,MAAM0mD,EAAa1D,GAAalQ,GAChC,IAAI/Y,EAEJ,MAAM4sB,EAAUzD,GAAOpQ,EAAQx0B,GAE/B,GAAIqoC,EAAQn3B,aAAek3B,EACzB3sB,EAAS4sB,MACJ,CAEL5sB,EAASx3B,OAAOO,MAAM4jD,GACtB,MAAMrS,EAAS,IAAIhF,EAAatV,GAGhC,IAFAsa,EAAOz/B,KAAK+xC,IAEJ7T,EAAOvD,OACb8E,EAAOz/B,KAAKsuC,GAAOpQ,EAAQx0B,IAG7B,MAAMkxB,EAAO6E,EAAO7E,OACpB,GAAIkX,IAAelX,EACjB,MAAM,IAAI,EACR,2CAA2CkX,wCAAiDlX,UAGlG,CACA,OAAOzV,CACT,CGuS2B6sB,CAAW5jC,EAAQhJ,KAGtCpX,KAAK0iD,UAAY,IAEnB1iD,KAAKqhD,YAAYlxB,GAAS,CAAE3Z,OAAM4J,WAE7B,CAAE5J,OAAMytC,OAAQ,UAAW7jC,SACpC,ECvVF,MAAM8jC,GAAgBvgD,OAAO,iBAatB,SAASwgD,IAAc,GAC5Bja,EAAE,MACFxtB,EAAK,SACL0nC,EAAQ,oBACR7C,EAAmB,QACnB8C,EAAO,cACPC,IAGK5nC,EAAMwnC,MAAgBxnC,EAAMwnC,IAAiB,IAAIh/C,KACtD,IAAIwV,EAAIgC,EAAMwnC,IAAevhD,IAAIyhD,GAWjC,OAVK1pC,IACHA,EAvBJ6zB,gBAA6B,GAC3BrE,EAAE,SACFka,EAAQ,oBACR7C,EAAmB,QACnB8C,EAAO,cACPC,IAEA,MAAM/c,QAAY2C,EAAGlsC,KAAKomD,GAC1B,OAAOjD,GAAaG,QAAQ,CAAE/Z,MAAKga,uBACrC,CAcQgD,CAAc,CAChBra,KACAka,WACA7C,sBACA8C,UACAC,kBAEF5nC,EAAMwnC,IAAel2B,IAAIo2B,EAAU1pC,IAE9BA,CACT,CCrBO6zB,eAAe,IAAY,GAChCrE,EAAE,MACFxtB,EAAK,OACLytB,EAAM,IACNoG,EAAG,OACH0T,EAAS,YAIT,MAAM1C,EAAsBhR,GAAO,GAAY,CAAErG,KAAIxtB,QAAOytB,SAAQoG,QAEpE,IAAIvoC,EAYJ,GARY,6CAARuoC,IACFvoC,EAAS,CAAEi8C,OAAQ,UAAW7jC,OAAQzgB,OAAOqN,KAAK,cAG/ChF,IACHA,QCpCGumC,gBAA+B,GAAErE,EAAE,OAAEC,EAAM,IAAEoG,IAClD,MAAM70B,EAAS,WAAW60B,EAAIppC,MAAM,EAAG,MAAMopC,EAAIppC,MAAM,KACjDykC,QAAa1B,EAAGlsC,KAAK,GAAGmsC,KAAUzuB,KACxC,OAAKkwB,EAGE,CAAExrB,OAAQwrB,EAAMqY,OAAQ,WAAYvoC,UAFlC,IAGX,CD6BmB,CAAgB,CAAEwuB,KAAIC,SAAQoG,UAG1CvoC,EAAQ,CASX,GARAA,QEnCGumC,gBAAgC,GACrCrE,EAAE,MACFxtB,EAAK,OACLytB,EAAM,IACNoG,EAAG,OACH0T,EAAS,UAAS,oBAClB1C,IAIA,IAAI3hC,QAAasqB,EAAGsa,QAAQ,EAAKra,EAAQ,iBACzCvqB,EAAOA,EAAK1C,OAAO6C,GAAKA,EAAE+mB,SAAS,SACnC,IAAK,MAAMsd,KAAYxkC,EAAM,CAC3B,MAAM6kC,EAAY,GAAGta,kBAAuBia,IACtC1pC,QAAUypC,GAAc,CAC5Bja,KACAxtB,QACA0nC,SAAUK,EACVlD,wBAEF,GAAI7mC,EAAEvU,MAAO,MAAM,IAAI,EAAcuU,EAAEvU,OAEvC,GAAIuU,EAAE+mC,QAAQxQ,IAAIV,GAAM,CAEtB,IAAK71B,EAAEmnC,KAAM,CACX,MAAM6C,EAAWD,EAAUx9C,QAAQ,OAAQ,QAC3CyT,EAAEmnC,KAAO3X,EAAGlsC,KAAK0mD,EACnB,CACA,MAAM7C,QAAannC,EAAEmnC,KAIrB,IAAKnnC,EAAEiqC,kBAAmB,CACxB,MAAMC,EAAuBlqC,EAAEgnC,YAIzBmD,EAAchD,EAAKzsC,UAAU,IAC7B0vC,EAAiBrhD,MAAMuJ,KAAK63C,GAC/Bzc,IAAIpd,GAAKA,EAAExpB,SAAS,IAAIujD,SAAS,EAAG,MACpChoC,KAAK,IACR,GAAI+nC,IAAmBF,EACrB,MAAM,IAAI,EACR,uCAAuCA,UAA6BE,qCAOxE,MAAM9F,EAAU6C,EAAKzsC,SAAS,GAAI,IAC5B4vC,QAAyBxW,EAAOwQ,GACtC,GAAIgG,IAAqBJ,EACvB,MAAM,IAAI,EACR,0CAA0CI,kBAAiCJ,gDAK/ElqC,EAAEiqC,mBAAoB,CACxB,CAEA,MAAM38C,QAAe0S,EAAE1c,KAAK,CAAEuyC,MAAKgR,wBAGnC,OAFAv5C,EAAOi8C,OAAS,UAChBj8C,EAAO0T,OAAS,gBAAgB0oC,EAASn9C,QAAQ,OAAQ,UAClDe,CACT,CACF,CAEA,OAAO,IACT,CFnCmBi9C,CAAiB,CAC9B/a,KACAxtB,QACAytB,SACAoG,MACAgR,yBAGGv5C,EACH,MAAM,IAAI,EAAcuoC,GAI1B,OAAOvoC,CACT,CAGA,GAAe,aAAXi8C,EACF,OAAOj8C,EAST,GALsB,aAAlBA,EAAOi8C,SACTj8C,EAAOoY,OAASzgB,OAAOqN,WAAWqF,GAAQrK,EAAOoY,SACjDpY,EAAOi8C,OAAS,WAGH,YAAXA,EACF,OAAOj8C,EAGT,MAAMwuC,QAAYhI,EAAOxmC,EAAOoY,QAChC,GAAIo2B,IAAQjG,EACV,MAAM,IAAI,EACR,8BAA8BA,eAAiBiG,KAGnD,MAAM,OAAEp2B,EAAM,KAAE5J,GAASspC,GAAUI,OAAOl4C,EAAOoY,QAKjD,GAJApY,EAAOwO,KAAOA,EACdxO,EAAOoY,OAASA,EAChBpY,EAAOi8C,OAAS,UAED,YAAXA,EACF,OAAOj8C,EAGT,MAAM,IAAI,EAAc,6BAA6Bi8C,KACvD,CGlFO1V,eAAe2W,IAAc,GAAEhb,EAAE,MAAExtB,EAAK,OAAEytB,EAAM,IAAEoG,IACvD,MAAM,KAAE/5B,EAAI,OAAE4J,SAAiB,GAAW,CAAE8pB,KAAIxtB,QAAOytB,SAAQoG,QAE/D,GAAa,QAAT/5B,EAEF,OAAO0uC,GAAc,CAAEhb,KAAIxtB,QAAOytB,SAAQoG,IAD1CA,EAAMgO,GAAgBvxC,KAAKoT,GAAQy+B,QAAQz+B,SAG7C,GAAa,WAAT5J,EACF,MAAM,IAAI+mC,GAAgBhN,EAAK/5B,EAAM,UAEvC,MAAO,CAAE8oC,OAAQD,GAAUryC,KAAKoT,GAASmwB,MAC3C,CCZA,ICmBI,GDnBA4U,GAA4B,KECzB5W,eAAe,IAAa,GACjCrE,EAAE,OACFC,EAAM,KACN3zB,EAAI,OACJ4J,EAAM,OACN6jC,EAAS,UAAS,IAClB1T,EAAe,OACf6U,GAAS,IAYT,MAVe,aAAXnB,IACa,YAAXA,IACF7jC,EAAS0/B,GAAU/wC,KAAK,CAAEyH,OAAM4J,YAElCmwB,QAAY/B,EAAOpuB,GACnBA,EAASzgB,OAAOqN,WFbbuhC,eAAuBtwC,GAI5B,OAHkC,OAA9BknD,KACFA,GAaJ,WACE,IAME,OALW,IAAIE,kBAAkB,WAC9BznD,SAASub,QAEG,IAAI2nC,KAAK,IAAIrI,SACrB6D,UACA,CACT,CAAE,MAAOzuC,GACP,OAAO,CACT,CACF,CAxBgCy3C,IAEvBH,GAKT5W,eAA8BtwC,GAC5B,MAAMsnD,EAAK,IAAIF,kBAAkB,WAC3BjmD,EAAI,IAAI0hD,KAAK,CAAC7iD,IAASw6C,SAASsI,YAAYwE,GAClD,OAAO,IAAIliD,iBAAiB,IAAI29C,SAAS5hD,GAAG6hD,cAC9C,CARMuE,CAAevnD,GACf4W,GAAKqN,QAAQjkB,EACnB,CEM+BikB,CAAQ9B,KAEhCglC,SCnBA7W,gBAAgC,GAAErE,EAAE,OAAEC,EAAM,OAAE/pB,EAAM,OAAE6jC,EAAM,IAAE1T,IACnE,GAAe,aAAX0T,EACF,MAAM,IAAI,EACR,yEAGJ,MACM9Y,EAAW,GAAGhB,aADMoG,EAAIppC,MAAM,EAAG,MAAMopC,EAAIppC,MAAM,WAK3C+iC,EAAGqB,OAAOJ,UAAkBjB,EAAG/qC,MAAMgsC,EAAU/qB,EAC7D,CDQUqlC,CAAiB,CAAEvb,KAAIC,SAAQ/pB,SAAQ6jC,OAAQ,WAAY1T,QAE5DA,CACT,CEvBO,MAAMmV,WAA4BzZ,EAMvC,WAAAtyB,CAAYy5B,EAAKyJ,GACflgB,MACE,IAAIyW,8EAAgFyJ,QAEtF78C,KAAKqlB,KAAOrlB,KAAKsG,KAAOo/C,GAAoBrgC,KAC5CrlB,KAAKO,KAAO,CAAE6yC,MAAKyJ,aACrB,EAGF6I,GAAoBrgC,KAAO,sBCfpB,MAAMsgC,WAAyB1Z,EAIpC,WAAAtyB,CAAYisC,GACVjpB,MACE,4BAA4BipB,iDAE9B5lD,KAAKqlB,KAAOrlB,KAAKsG,KAAOq/C,GAAiBtgC,KACzCrlB,KAAKO,KAAO,CAAEqlD,OAChB,EAGFD,GAAiBtgC,KAAO,mBCfjB,MAAMwgC,GAGX,uCAAWC,GACT,MAAMC,GAAgB,IAAI5hD,MAAO6hD,oBAC3BC,EAAchnD,KAAKK,IAAIL,KAAKO,MAAMumD,EAAgB,KAClDG,EAAyBjnD,KAAKK,IAAIymD,EAAgB,IACrDvkD,WACAujD,SAAS,EAAG,KAEf,MAAO,GADMgB,EAAgB,EAAI,IAAM,MACtBE,EACdzkD,WACAujD,SAAS,EAAG,OAAOmB,GACxB,CAEA,6BAAOC,CAAuB9H,EAAQ+H,EAAansC,GACjD,MAAMosC,EAAchI,EAAO/3C,KAAKW,QAAQ,MAAO,IAEzCy2C,EAAYz+C,KAAKO,MAAM2E,KAAKmiD,MAAQ,KACpC3I,EAAiBkI,GAAYC,6BACnC,MAAO,4CAAUM,KAAeC,KAAehI,EAAOZ,SAASC,KAAaC,MAAmB1jC,KACjG,CAEA,0BAAOssC,CAAoBC,EAAc1xB,GAAS,GAQhD,OAPoB0xB,EAAavqC,MAAM,MAEpCiB,OAAOsoB,GAAKA,GACZihB,UACAre,IAAI,CAACC,EAAMd,IACVzS,EAAS,UAAUyS,OAASc,EAAKpsB,MAAM,MAAM,KAAOosB,EAG1D,ECVKkG,eAAemY,IAAW,GAAExc,EAAE,OAAEC,EAAM,KAAE/vB,IAE7C,aADqB6vB,EAAiBtnC,IAAI,CAAEunC,KAAIC,YAClCxnC,IAAIyX,EACpB,CCpB6BzW,OAAO,iBCQ7B,MAAMgjD,GASX,WAAAhtC,EAAY,GAAEuwB,EAAE,IAAE/V,EAAG,OAAEgW,EAAS,EAAKhW,EAAK,UACxC9qB,OAAOyL,OAAO9U,KAAM,CAClBkqC,KACA/V,MACAgW,SACAyc,QAAS,MAEb,CAOA,mBAAWC,GACT,MAAO,YACT,CAOA,uBAAWC,GACT,MAAO,iBACT,CAOA,gBAAIC,GACF,OAAO,EAAK/mD,KAAKmqC,OAAQwc,GAAgBE,SAC3C,CAOA,oBAAIG,GACF,OAAO,EAAKhnD,KAAKmqC,OAAQwc,GAAgBG,aAC3C,CAQA,eAAMG,GACJ,IAAKjnD,KAAK4mD,UACR5mD,KAAK4mD,cCxDJrY,gBAAqC,GAAErE,EAAE,OAAEC,EAAM,OAAEkU,EAAM,OAAEiB,IAChE,MAAM5B,EAAYz+C,KAAKO,MAAM2E,KAAKmiD,MAAQ,KAapCY,EC/BD,SAAuB/vB,KAAWgO,GACvC,IAAK,MAAMzpB,KAAUypB,EACnB,GAAIzpB,EACF,IAAK,MAAMjR,KAAOpB,OAAO+C,KAAKsP,GAAS,CACrC,MAAMwY,EAAMxY,EAAOjR,QACP9I,IAARuyB,IACFiD,EAAO1sB,GAAOypB,EAElB,CAGJ,OAAOiD,CACT,CDmB2BgwB,CACvB,CAAC,EAZmB,CACpB7gD,WAAYogD,GAAW,CAAExc,KAAIC,SAAQ/vB,KAAM,cAC3CqjC,YAAciJ,GAAW,CAAExc,KAAIC,SAAQ/vB,KAAM,gBAAoB,GACjEsjC,YACAC,eAAgB,IAAIx5C,KAAiB,IAAZu5C,GAAkBsI,qBAU3C1G,EAASA,EAAOjB,YAAS18C,EACzB08C,GAGF,QAA8B18C,IAA1BulD,EAAiB5gD,KAIrB,OAAO4gD,CACT,CD8B2BE,CAAsB,CACzCld,GAAIlqC,KAAKkqC,GACTC,OAAQnqC,KAAKmqC,OACbkU,OAAQ,CAAC,KAENr+C,KAAK4mD,SAAS,MAAM,IAAIjB,GAAiB,UAEhD,OAAO3lD,KAAK4mD,OACd,CASA,iBAAMS,CAAYC,EAAQC,GACxB,aAAYvnD,KAAKkqC,GAAGqB,OAAOvrC,KAAK+mD,eAK9BQ,SAAuBvnD,KAAKwnD,iBAAiB,CAAE1yB,QAAQ,KAC1CwyB,GAAQrrC,MAAM,KAAK,GALzB,IAMX,CAWA,sBAAMwrC,EAAiB,QAAExtC,EAAO,KAAEkL,EAAI,OAAErI,IACtC,OGhGGyxB,gBAA4B,GAAErE,EAAE,OAAEC,EAAM,OAAEmV,IAE/C,MAAMl/B,EAASi/B,GAAUryC,KAAKsyC,GAAQ1N,WAQtC,aAPkB,GAAY,CAC5B1H,KACAC,SACA3zB,KAAM,SACN4J,SACA6jC,OAAQ,WAGZ,CHqFWyD,CAAa,CAClBxd,GAAIlqC,KAAKkqC,GACTC,OAAQnqC,KAAKmqC,OACbmV,OAAQ,CACNrlC,UACAkL,OACArI,SACAuhC,aAAcr+C,KAAKinD,YACnBlI,gBAAiB/+C,KAAKinD,cAG5B,CASA,qBAAMU,CAAgBL,GACpB,MAAMC,QAAqBvnD,KAAKwnD,iBAAiB,CAAE1yB,QAAQ,IAC3D,GAAe,IAAXwyB,IAEEA,EAAS,GAAKA,EAASC,EAAanqD,OAAS,GAC/C,MAAM,IAAIsoD,GACR,SAAS4B,IACT,uDAKN,MAAMM,QAAiB5nD,KAAKqnD,YAAYC,EAAQC,GAChD,OAAKK,EIhIFrZ,gBAA2B,GAAErE,EAAE,MAAExtB,EAAK,OAAEytB,EAAM,IAAEoG,IACrD,MAAM,OAAE+O,EAAQ/O,IAAKsX,SAAoB3C,GAAc,CACrDhb,KACAxtB,QACAytB,SACAoG,QAQF,MANe,CACbA,IAAKsX,EACLvI,OAAQA,EAAOT,QACfG,QAASM,EAAOV,mBAIpB,CJuHWkJ,CAAY,CACjB5d,GAAIlqC,KAAKkqC,GACTxtB,MAAO,CAAC,EACRytB,OAAQnqC,KAAKmqC,OACboG,IAAKqX,IARE,CAAC,CAUZ,CAQA,mBAAMG,CAAc3B,GAClB,OAAOpR,EAAce,SAAS,CAC5B7L,GAAIlqC,KAAKkqC,GACTC,OAAQnqC,KAAKmqC,OACbiJ,IAAKuT,GAAgBE,SACrB3pD,MAAOkpD,GAEX,CAUA,2BAAM4B,EAAsB,YAAE5B,EAAW,QAAEnsC,IACzC,MAAMokC,QAAer+C,KAAKinD,YACpBpX,EAAQgW,GAAYM,uBACxB9H,EACA+H,EACAnsC,GAEIkxB,EAAWnrC,KAAKgnD,uBRpKnBzY,eAA2B6E,EAAK5J,GAErC,YADa7nC,IAAT,KAAoB,GAAO,IAAI,GAC5B,GAAK6I,QAAQ4oC,EAAK5J,EAC3B,CQmKU,CAAY,CAAE2B,WAAU0E,SAAStB,UACrC,MAAM0Z,QAAkBjoD,KAAKkqC,GAAGqB,OAAOJ,SAC7BnrC,KAAKkqC,GAAGlsC,KAAKmtC,EAAU,QAC7B,SACEnrC,KAAKkqC,GAAG/qC,MAAMgsC,EAAU8c,EAAWpY,EAAO,SAEpD,CASA,sBAAM2X,EAAiB,OAAE1yB,GAAS,IAChC,UAAY90B,KAAKkqC,GAAGqB,OAAOvrC,KAAKgnD,kBAC9B,MAAO,GAGT,MAAMR,QAAqBxmD,KAAKkqC,GAAGlsC,KAAKgC,KAAKgnD,iBAAkB,QAE/D,OAAOnB,GAAYU,oBAAoBC,EAAc1xB,EACvD,E","sources":["webpack://git/webpack/universalModuleDefinition","webpack://git/./node_modules/define-data-property/index.js","webpack://git/./node_modules/call-bind-apply-helpers/functionCall.js","webpack://git/./node_modules/ieee754/index.js","webpack://git/./node_modules/sha.js/hash.js","webpack://git/./node_modules/math-intrinsics/round.js","webpack://git/./node_modules/get-intrinsic/index.js","webpack://git/./node_modules/call-bind/index.js","webpack://git/./node_modules/has-property-descriptors/index.js","webpack://git/./node_modules/es-define-property/index.js","webpack://git/./node_modules/async-lock/lib/index.js","webpack://git/./node_modules/to-buffer/node_modules/safe-buffer/index.js","webpack://git/./node_modules/call-bind-apply-helpers/functionApply.js","webpack://git/./node_modules/get-proto/Object.getPrototypeOf.js","webpack://git/./node_modules/es-errors/eval.js","webpack://git/./node_modules/has-symbols/shams.js","webpack://git/./node_modules/pako/lib/zlib/inflate.js","webpack://git/./node_modules/math-intrinsics/abs.js","webpack://git/./node_modules/pako/index.js","webpack://git/./node_modules/pako/lib/utils/strings.js","webpack://git/./node_modules/pako/lib/zlib/inftrees.js","webpack://git/./node_modules/call-bind-apply-helpers/applyBind.js","webpack://git/./node_modules/ignore/index.js","webpack://git/./node_modules/crc-32/crc32.js","webpack://git/./node_modules/for-each/index.js","webpack://git/./node_modules/math-intrinsics/sign.js","webpack://git/./node_modules/call-bind-apply-helpers/index.js","webpack://git/./node_modules/call-bind-apply-helpers/actualApply.js","webpack://git/./node_modules/pako/lib/zlib/adler32.js","webpack://git/./node_modules/pako/lib/deflate.js","webpack://git/./node_modules/get-proto/index.js","webpack://git/./node_modules/pako/lib/zlib/trees.js","webpack://git/./node_modules/sha.js/sha1.js","webpack://git/./node_modules/has-symbols/index.js","webpack://git/./node_modules/typed-array-buffer/index.js","webpack://git/./node_modules/pako/lib/zlib/zstream.js","webpack://git/./node_modules/math-intrinsics/isNaN.js","webpack://git/./node_modules/isarray/index.js","webpack://git/./node_modules/pako/lib/zlib/messages.js","webpack://git/./node_modules/pako/lib/zlib/crc32.js","webpack://git/./node_modules/es-errors/uri.js","webpack://git/./node_modules/to-buffer/index.js","webpack://git/./node_modules/is-typed-array/index.js","webpack://git/./node_modules/which-typed-array/index.js","webpack://git/./node_modules/gopd/index.js","webpack://git/./node_modules/math-intrinsics/pow.js","webpack://git/./node_modules/math-intrinsics/max.js","webpack://git/./node_modules/gopd/gOPD.js","webpack://git/./node_modules/call-bound/index.js","webpack://git/./node_modules/possible-typed-array-names/index.js","webpack://git/./node_modules/inherits/inherits_browser.js","webpack://git/./node_modules/function-bind/index.js","webpack://git/./node_modules/set-function-length/index.js","webpack://git/./node_modules/pako/lib/inflate.js","webpack://git/./node_modules/call-bind-apply-helpers/reflectApply.js","webpack://git/./node_modules/dunder-proto/get.js","webpack://git/./node_modules/pako/lib/zlib/inffast.js","webpack://git/./node_modules/pako/lib/zlib/gzheader.js","webpack://git/./node_modules/base64-js/index.js","webpack://git/./node_modules/math-intrinsics/min.js","webpack://git/./node_modules/es-errors/syntax.js","webpack://git/./node_modules/sha.js/node_modules/safe-buffer/index.js","webpack://git/./node_modules/buffer/index.js","webpack://git/./node_modules/pako/lib/zlib/deflate.js","webpack://git/./node_modules/async-lock/index.js","webpack://git/./node_modules/get-proto/Reflect.getPrototypeOf.js","webpack://git/./node_modules/math-intrinsics/floor.js","webpack://git/./node_modules/has-tostringtag/shams.js","webpack://git/./node_modules/available-typed-arrays/index.js","webpack://git/./node_modules/es-errors/range.js","webpack://git/./node_modules/function-bind/implementation.js","webpack://git/./node_modules/es-errors/index.js","webpack://git/./node_modules/es-errors/ref.js","webpack://git/./node_modules/is-callable/index.js","webpack://git/./node_modules/es-object-atoms/index.js","webpack://git/./node_modules/es-errors/type.js","webpack://git/./node_modules/pako/lib/zlib/constants.js","webpack://git/./node_modules/pako/lib/utils/common.js","webpack://git/./node_modules/hasown/index.js","webpack://git/webpack/bootstrap","webpack://git/webpack/runtime/define property getters","webpack://git/webpack/runtime/global","webpack://git/webpack/runtime/hasOwnProperty shorthand","webpack://git/webpack/runtime/make namespace object","webpack://git/./src/models/GitConfig.js","webpack://git/./src/managers/GitConfigManager.js","webpack://git/./src/utils/dirname.js","webpack://git/./src/utils/join.js","webpack://git/./src/managers/GitIgnoreManager.js","webpack://git/./src/utils/basename.js","webpack://git/./src/errors/BaseError.js","webpack://git/./src/errors/UnmergedPathsError.js","webpack://git/./src/errors/InternalError.js","webpack://git/./src/errors/UnsafeFilepathError.js","webpack://git/./src/utils/BufferCursor.js","webpack://git/./src/utils/comparePath.js","webpack://git/./src/utils/compareStrings.js","webpack://git/./src/utils/normalizeMode.js","webpack://git/./src/utils/normalizeStats.js","webpack://git/./src/utils/shasum.js","webpack://git/./src/utils/toHex.js","webpack://git/./src/models/GitIndex.js","webpack://git/./src/managers/GitIndexManager.js","webpack://git/./src/utils/compareStats.js","webpack://git/./src/errors/InvalidOidError.js","webpack://git/./src/errors/NoRefspecError.js","webpack://git/./src/errors/NotFoundError.js","webpack://git/./src/models/GitPackedRefs.js","webpack://git/./src/models/GitRefSpec.js","webpack://git/./src/models/GitRefSpecSet.js","webpack://git/./src/utils/compareRefNames.js","webpack://git/./src/managers/GitRefManager.js","webpack://git/./src/errors/HttpError.js","webpack://git/./src/errors/SmartHttpError.js","webpack://git/./src/errors/UserCanceledError.js","webpack://git/./src/utils/calculateBasicAuthHeader.js","webpack://git/./src/utils/getIterator.js","webpack://git/./src/utils/fromValue.js","webpack://git/./src/utils/extractAuthFromUrl.js","webpack://git/./src/errors/EmptyServerResponseError.js","webpack://git/./src/errors/ParseError.js","webpack://git/./src/utils/StreamReader.js","webpack://git/./src/models/GitPktLine.js","webpack://git/./src/utils/padHex.js","webpack://git/./src/wire/parseCapabilitiesV2.js","webpack://git/./src/wire/parseRefsAdResponse.js","webpack://git/./src/managers/GitRemoteHTTP.js","webpack://git/./src/utils/collect.js","webpack://git/./src/utils/forAwait.js","webpack://git/./src/errors/UnknownTransportError.js","webpack://git/./src/errors/UrlParseError.js","webpack://git/./src/managers/GitRemoteManager.js","webpack://git/./src/utils/translateSSHtoHTTP.js","webpack://git/./src/managers/GitShallowManager.js","webpack://git/./src/errors/ObjectTypeError.js","webpack://git/./src/utils/formatAuthor.js","webpack://git/./src/utils/normalizeNewlines.js","webpack://git/./src/utils/parseAuthor.js","webpack://git/./src/models/GitAnnotatedTag.js","webpack://git/./src/utils/indent.js","webpack://git/./src/models/GitCommit.js","webpack://git/./src/utils/outdent.js","webpack://git/./src/models/GitObject.js","webpack://git/./src/utils/applyDelta.js","webpack://git/./src/utils/git-list-pack.js","webpack://git/./src/utils/inflate.js","webpack://git/./src/models/GitPackIndex.js","webpack://git/./src/storage/readPackIndex.js","webpack://git/./src/storage/readObject.js","webpack://git/./src/storage/readObjectLoose.js","webpack://git/./src/storage/readObjectPacked.js","webpack://git/./src/utils/resolveCommit.js","webpack://git/./src/utils/deflate.js","webpack://git/./src/utils/walkerToTreeEntryMap.js","webpack://git/./src/storage/writeObject.js","webpack://git/./src/storage/writeObjectLoose.js","webpack://git/./src/errors/InvalidRefNameError.js","webpack://git/./src/errors/MissingNameError.js","webpack://git/./src/models/GitRefStash.js","webpack://git/./src/commands/getConfig.js","webpack://git/./src/utils/symbols.js","webpack://git/./src/managers/GitStashManager.js","webpack://git/./src/utils/normalizeAuthorObject.js","webpack://git/./src/utils/assignDefined.js","webpack://git/./src/commands/writeCommit.js","webpack://git/./src/commands/readCommit.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"git\"] = factory();\n\telse\n\t\troot[\"git\"] = factory();\n})(self, () => {\nreturn ","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\n\nvar gopd = require('gopd');\n\n/** @type {import('.')} */\nmodule.exports = function defineDataProperty(\n\tobj,\n\tproperty,\n\tvalue\n) {\n\tif (!obj || (typeof obj !== 'object' && typeof obj !== 'function')) {\n\t\tthrow new $TypeError('`obj` must be an object or a function`');\n\t}\n\tif (typeof property !== 'string' && typeof property !== 'symbol') {\n\t\tthrow new $TypeError('`property` must be a string or a symbol`');\n\t}\n\tif (arguments.length > 3 && typeof arguments[3] !== 'boolean' && arguments[3] !== null) {\n\t\tthrow new $TypeError('`nonEnumerable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 4 && typeof arguments[4] !== 'boolean' && arguments[4] !== null) {\n\t\tthrow new $TypeError('`nonWritable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 5 && typeof arguments[5] !== 'boolean' && arguments[5] !== null) {\n\t\tthrow new $TypeError('`nonConfigurable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 6 && typeof arguments[6] !== 'boolean') {\n\t\tthrow new $TypeError('`loose`, if provided, must be a boolean');\n\t}\n\n\tvar nonEnumerable = arguments.length > 3 ? arguments[3] : null;\n\tvar nonWritable = arguments.length > 4 ? arguments[4] : null;\n\tvar nonConfigurable = arguments.length > 5 ? arguments[5] : null;\n\tvar loose = arguments.length > 6 ? arguments[6] : false;\n\n\t/* @type {false | TypedPropertyDescriptor<unknown>} */\n\tvar desc = !!gopd && gopd(obj, property);\n\n\tif ($defineProperty) {\n\t\t$defineProperty(obj, property, {\n\t\t\tconfigurable: nonConfigurable === null && desc ? desc.configurable : !nonConfigurable,\n\t\t\tenumerable: nonEnumerable === null && desc ? desc.enumerable : !nonEnumerable,\n\t\t\tvalue: value,\n\t\t\twritable: nonWritable === null && desc ? desc.writable : !nonWritable\n\t\t});\n\t} else if (loose || (!nonEnumerable && !nonWritable && !nonConfigurable)) {\n\t\t// must fall back to [[Set]], and was not explicitly asked to make non-enumerable, non-writable, or non-configurable\n\t\tobj[property] = value; // eslint-disable-line no-param-reassign\n\t} else {\n\t\tthrow new $SyntaxError('This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.');\n\t}\n};\n","'use strict';\n\n/** @type {import('./functionCall')} */\nmodule.exports = Function.prototype.call;\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar toBuffer = require('to-buffer');\n\n// prototype class for hash functions\nfunction Hash(blockSize, finalSize) {\n\tthis._block = Buffer.alloc(blockSize);\n\tthis._finalSize = finalSize;\n\tthis._blockSize = blockSize;\n\tthis._len = 0;\n}\n\nHash.prototype.update = function (data, enc) {\n\t/* eslint no-param-reassign: 0 */\n\tdata = toBuffer(data, enc || 'utf8');\n\n\tvar block = this._block;\n\tvar blockSize = this._blockSize;\n\tvar length = data.length;\n\tvar accum = this._len;\n\n\tfor (var offset = 0; offset < length;) {\n\t\tvar assigned = accum % blockSize;\n\t\tvar remainder = Math.min(length - offset, blockSize - assigned);\n\n\t\tfor (var i = 0; i < remainder; i++) {\n\t\t\tblock[assigned + i] = data[offset + i];\n\t\t}\n\n\t\taccum += remainder;\n\t\toffset += remainder;\n\n\t\tif ((accum % blockSize) === 0) {\n\t\t\tthis._update(block);\n\t\t}\n\t}\n\n\tthis._len += length;\n\treturn this;\n};\n\nHash.prototype.digest = function (enc) {\n\tvar rem = this._len % this._blockSize;\n\n\tthis._block[rem] = 0x80;\n\n\t/*\n\t * zero (rem + 1) trailing bits, where (rem + 1) is the smallest\n\t * non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize\n\t */\n\tthis._block.fill(0, rem + 1);\n\n\tif (rem >= this._finalSize) {\n\t\tthis._update(this._block);\n\t\tthis._block.fill(0);\n\t}\n\n\tvar bits = this._len * 8;\n\n\t// uint32\n\tif (bits <= 0xffffffff) {\n\t\tthis._block.writeUInt32BE(bits, this._blockSize - 4);\n\n\t\t// uint64\n\t} else {\n\t\tvar lowBits = (bits & 0xffffffff) >>> 0;\n\t\tvar highBits = (bits - lowBits) / 0x100000000;\n\n\t\tthis._block.writeUInt32BE(highBits, this._blockSize - 8);\n\t\tthis._block.writeUInt32BE(lowBits, this._blockSize - 4);\n\t}\n\n\tthis._update(this._block);\n\tvar hash = this._hash();\n\n\treturn enc ? hash.toString(enc) : hash;\n};\n\nHash.prototype._update = function () {\n\tthrow new Error('_update must be implemented by subclass');\n};\n\nmodule.exports = Hash;\n","'use strict';\n\n/** @type {import('./round')} */\nmodule.exports = Math.round;\n","'use strict';\n\nvar undefined;\n\nvar $Object = require('es-object-atoms');\n\nvar $Error = require('es-errors');\nvar $EvalError = require('es-errors/eval');\nvar $RangeError = require('es-errors/range');\nvar $ReferenceError = require('es-errors/ref');\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\nvar $URIError = require('es-errors/uri');\n\nvar abs = require('math-intrinsics/abs');\nvar floor = require('math-intrinsics/floor');\nvar max = require('math-intrinsics/max');\nvar min = require('math-intrinsics/min');\nvar pow = require('math-intrinsics/pow');\nvar round = require('math-intrinsics/round');\nvar sign = require('math-intrinsics/sign');\n\nvar $Function = Function;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = require('gopd');\nvar $defineProperty = require('es-define-property');\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = require('get-proto');\nvar $ObjectGPO = require('get-proto/Object.getPrototypeOf');\nvar $ReflectGPO = require('get-proto/Reflect.getPrototypeOf');\n\nvar $apply = require('call-bind-apply-helpers/functionApply');\nvar $call = require('call-bind-apply-helpers/functionCall');\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t__proto__: null,\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': $Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': $EvalError,\n\t'%Float16Array%': typeof Float16Array === 'undefined' ? undefined : Float16Array,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': $Object,\n\t'%Object.getOwnPropertyDescriptor%': $gOPD,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': $RangeError,\n\t'%ReferenceError%': $ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': $URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet,\n\n\t'%Function.prototype.call%': $call,\n\t'%Function.prototype.apply%': $apply,\n\t'%Object.defineProperty%': $defineProperty,\n\t'%Object.getPrototypeOf%': $ObjectGPO,\n\t'%Math.abs%': abs,\n\t'%Math.floor%': floor,\n\t'%Math.max%': max,\n\t'%Math.min%': min,\n\t'%Math.pow%': pow,\n\t'%Math.round%': round,\n\t'%Math.sign%': sign,\n\t'%Reflect.getPrototypeOf%': $ReflectGPO\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t__proto__: null,\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('hasown');\nvar $concat = bind.call($call, Array.prototype.concat);\nvar $spliceApply = bind.call($apply, Array.prototype.splice);\nvar $replace = bind.call($call, String.prototype.replace);\nvar $strSlice = bind.call($call, String.prototype.slice);\nvar $exec = bind.call($call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar setFunctionLength = require('set-function-length');\n\nvar $defineProperty = require('es-define-property');\n\nvar callBindBasic = require('call-bind-apply-helpers');\nvar applyBind = require('call-bind-apply-helpers/applyBind');\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = callBindBasic(arguments);\n\tvar adjustedLength = originalFunction.length - (arguments.length - 1);\n\treturn setFunctionLength(\n\t\tfunc,\n\t\t1 + (adjustedLength > 0 ? adjustedLength : 0),\n\t\ttrue\n\t);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar hasPropertyDescriptors = function hasPropertyDescriptors() {\n\treturn !!$defineProperty;\n};\n\nhasPropertyDescriptors.hasArrayLengthDefineBug = function hasArrayLengthDefineBug() {\n\t// node v0.6 has a bug where array lengths can be Set but not Defined\n\tif (!$defineProperty) {\n\t\treturn null;\n\t}\n\ttry {\n\t\treturn $defineProperty([], 'length', { value: 1 }).length !== 1;\n\t} catch (e) {\n\t\t// In Firefox 4-22, defining length on an array throws an exception.\n\t\treturn true;\n\t}\n};\n\nmodule.exports = hasPropertyDescriptors;\n","'use strict';\n\n/** @type {import('.')} */\nvar $defineProperty = Object.defineProperty || false;\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = false;\n\t}\n}\n\nmodule.exports = $defineProperty;\n","'use strict';\n\nvar AsyncLock = function (opts) {\n\topts = opts || {};\n\n\tthis.Promise = opts.Promise || Promise;\n\n\t// format: {key : [fn, fn]}\n\t// queues[key] = null indicates no job running for key\n\tthis.queues = Object.create(null);\n\n\t// lock is reentrant for same domain\n\tthis.domainReentrant = opts.domainReentrant || false;\n\tif (this.domainReentrant) {\n\t\tif (typeof process === 'undefined' || typeof process.domain === 'undefined') {\n\t\t\tthrow new Error(\n\t\t\t\t'Domain-reentrant locks require `process.domain` to exist. Please flip `opts.domainReentrant = false`, ' +\n\t\t\t\t'use a NodeJS version that still implements Domain, or install a browser polyfill.');\n\t\t}\n\t\t// domain of current running func {key : fn}\n\t\tthis.domains = Object.create(null);\n\t}\n\n\tthis.timeout = opts.timeout || AsyncLock.DEFAULT_TIMEOUT;\n\tthis.maxOccupationTime = opts.maxOccupationTime || AsyncLock.DEFAULT_MAX_OCCUPATION_TIME;\n\tthis.maxExecutionTime = opts.maxExecutionTime || AsyncLock.DEFAULT_MAX_EXECUTION_TIME;\n\tif (opts.maxPending === Infinity || (Number.isInteger(opts.maxPending) && opts.maxPending >= 0)) {\n\t\tthis.maxPending = opts.maxPending;\n\t} else {\n\t\tthis.maxPending = AsyncLock.DEFAULT_MAX_PENDING;\n\t}\n};\n\nAsyncLock.DEFAULT_TIMEOUT = 0; //Never\nAsyncLock.DEFAULT_MAX_OCCUPATION_TIME = 0; //Never\nAsyncLock.DEFAULT_MAX_EXECUTION_TIME = 0; //Never\nAsyncLock.DEFAULT_MAX_PENDING = 1000;\n\n/**\n * Acquire Locks\n *\n * @param {String|Array} key \tresource key or keys to lock\n * @param {function} fn \tasync function\n * @param {function} cb \tcallback function, otherwise will return a promise\n * @param {Object} opts \toptions\n */\nAsyncLock.prototype.acquire = function (key, fn, cb, opts) {\n\tif (Array.isArray(key)) {\n\t\treturn this._acquireBatch(key, fn, cb, opts);\n\t}\n\n\tif (typeof (fn) !== 'function') {\n\t\tthrow new Error('You must pass a function to execute');\n\t}\n\n\t// faux-deferred promise using new Promise() (as Promise.defer is deprecated)\n\tvar deferredResolve = null;\n\tvar deferredReject = null;\n\tvar deferred = null;\n\n\tif (typeof (cb) !== 'function') {\n\t\topts = cb;\n\t\tcb = null;\n\n\t\t// will return a promise\n\t\tdeferred = new this.Promise(function(resolve, reject) {\n\t\t\tdeferredResolve = resolve;\n\t\t\tdeferredReject = reject;\n\t\t});\n\t}\n\n\topts = opts || {};\n\n\tvar resolved = false;\n\tvar timer = null;\n\tvar occupationTimer = null;\n\tvar executionTimer = null;\n\tvar self = this;\n\n\tvar done = function (locked, err, ret) {\n\n\t\tif (occupationTimer) {\n\t\t\tclearTimeout(occupationTimer);\n\t\t\toccupationTimer = null;\n\t\t}\n\n\t\tif (executionTimer) {\n\t\t\tclearTimeout(executionTimer);\n\t\t\texecutionTimer = null;\n\t\t}\n\n\t\tif (locked) {\n\t\t\tif (!!self.queues[key] && self.queues[key].length === 0) {\n\t\t\t\tdelete self.queues[key];\n\t\t\t}\n\t\t\tif (self.domainReentrant) {\n\t\t\t\tdelete self.domains[key];\n\t\t\t}\n\t\t}\n\n\t\tif (!resolved) {\n\t\t\tif (!deferred) {\n\t\t\t\tif (typeof (cb) === 'function') {\n\t\t\t\t\tcb(err, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t//promise mode\n\t\t\t\tif (err) {\n\t\t\t\t\tdeferredReject(err);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdeferredResolve(ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\tresolved = true;\n\t\t}\n\n\t\tif (locked) {\n\t\t\t//run next func\n\t\t\tif (!!self.queues[key] && self.queues[key].length > 0) {\n\t\t\t\tself.queues[key].shift()();\n\t\t\t}\n\t\t}\n\t};\n\n\tvar exec = function (locked) {\n\t\tif (resolved) { // may due to timed out\n\t\t\treturn done(locked);\n\t\t}\n\n\t\tif (timer) {\n\t\t\tclearTimeout(timer);\n\t\t\ttimer = null;\n\t\t}\n\n\t\tif (self.domainReentrant && locked) {\n\t\t\tself.domains[key] = process.domain;\n\t\t}\n\n\t\tvar maxExecutionTime = opts.maxExecutionTime || self.maxExecutionTime;\n\t\tif (maxExecutionTime) {\n\t\t\texecutionTimer = setTimeout(function () {\n\t\t\t\tif (!!self.queues[key]) {\n\t\t\t\t\tdone(locked, new Error('Maximum execution time is exceeded ' + key));\n\t\t\t\t}\n\t\t\t}, maxExecutionTime);\n\t\t}\n\n\t\t// Callback mode\n\t\tif (fn.length === 1) {\n\t\t\tvar called = false;\n\t\t\ttry {\n\t\t\t\tfn(function (err, ret) {\n\t\t\t\t\tif (!called) {\n\t\t\t\t\t\tcalled = true;\n\t\t\t\t\t\tdone(locked, err, ret);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t} catch (err) {\n\t\t\t\t// catching error thrown in user function fn\n\t\t\t\tif (!called) {\n\t\t\t\t\tcalled = true;\n\t\t\t\t\tdone(locked, err);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// Promise mode\n\t\t\tself._promiseTry(function () {\n\t\t\t\treturn fn();\n\t\t\t})\n\t\t\t.then(function(ret){\n\t\t\t\tdone(locked, undefined, ret);\n\t\t\t}, function(error){\n\t\t\t\tdone(locked, error);\n\t\t\t});\n\t\t}\n\t};\n\n\tif (self.domainReentrant && !!process.domain) {\n\t\texec = process.domain.bind(exec);\n\t}\n\n\tvar maxPending = opts.maxPending || self.maxPending;\n\n\tif (!self.queues[key]) {\n\t\tself.queues[key] = [];\n\t\texec(true);\n\t}\n\telse if (self.domainReentrant && !!process.domain && process.domain === self.domains[key]) {\n\t\t// If code is in the same domain of current running task, run it directly\n\t\t// Since lock is re-enterable\n\t\texec(false);\n\t}\n\telse if (self.queues[key].length >= maxPending) {\n\t\tdone(false, new Error('Too many pending tasks in queue ' + key));\n\t}\n\telse {\n\t\tvar taskFn = function () {\n\t\t\texec(true);\n\t\t};\n\t\tif (opts.skipQueue) {\n\t\t\tself.queues[key].unshift(taskFn);\n\t\t} else {\n\t\t\tself.queues[key].push(taskFn);\n\t\t}\n\n\t\tvar timeout = opts.timeout || self.timeout;\n\t\tif (timeout) {\n\t\t\ttimer = setTimeout(function () {\n\t\t\t\ttimer = null;\n\t\t\t\tdone(false, new Error('async-lock timed out in queue ' + key));\n\t\t\t}, timeout);\n\t\t}\n\t}\n\n\tvar maxOccupationTime = opts.maxOccupationTime || self.maxOccupationTime;\n\t\tif (maxOccupationTime) {\n\t\t\toccupationTimer = setTimeout(function () {\n\t\t\t\tif (!!self.queues[key]) {\n\t\t\t\t\tdone(false, new Error('Maximum occupation time is exceeded in queue ' + key));\n\t\t\t\t}\n\t\t\t}, maxOccupationTime);\n\t\t}\n\n\tif (deferred) {\n\t\treturn deferred;\n\t}\n};\n\n/*\n * Below is how this function works:\n *\n * Equivalent code:\n * self.acquire(key1, function(cb){\n * self.acquire(key2, function(cb){\n * self.acquire(key3, fn, cb);\n * }, cb);\n * }, cb);\n *\n * Equivalent code:\n * var fn3 = getFn(key3, fn);\n * var fn2 = getFn(key2, fn3);\n * var fn1 = getFn(key1, fn2);\n * fn1(cb);\n */\nAsyncLock.prototype._acquireBatch = function (keys, fn, cb, opts) {\n\tif (typeof (cb) !== 'function') {\n\t\topts = cb;\n\t\tcb = null;\n\t}\n\n\tvar self = this;\n\tvar getFn = function (key, fn) {\n\t\treturn function (cb) {\n\t\t\tself.acquire(key, fn, cb, opts);\n\t\t};\n\t};\n\n\tvar fnx = keys.reduceRight(function (prev, key) {\n\t\treturn getFn(key, prev);\n\t}, fn);\n\n\tif (typeof (cb) === 'function') {\n\t\tfnx(cb);\n\t}\n\telse {\n\t\treturn new this.Promise(function (resolve, reject) {\n\t\t\t// check for promise mode in case keys is empty array\n\t\t\tif (fnx.length === 1) {\n\t\t\t\tfnx(function (err, ret) {\n\t\t\t\t\tif (err) {\n\t\t\t\t\t\treject(err);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tresolve(ret);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tresolve(fnx());\n\t\t\t}\n\t\t});\n\t}\n};\n\n/*\n *\tWhether there is any running or pending asyncFunc\n *\n *\t@param {String} key\n */\nAsyncLock.prototype.isBusy = function (key) {\n\tif (!key) {\n\t\treturn Object.keys(this.queues).length > 0;\n\t}\n\telse {\n\t\treturn !!this.queues[key];\n\t}\n};\n\n/**\n * Promise.try() implementation to become independent of Q-specific methods\n */\nAsyncLock.prototype._promiseTry = function(fn) {\n\ttry {\n\t\treturn this.Promise.resolve(fn());\n\t} catch (e) {\n\t\treturn this.Promise.reject(e);\n\t}\n};\n\nmodule.exports = AsyncLock;\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","'use strict';\n\n/** @type {import('./functionApply')} */\nmodule.exports = Function.prototype.apply;\n","'use strict';\n\nvar $Object = require('es-object-atoms');\n\n/** @type {import('./Object.getPrototypeOf')} */\nmodule.exports = $Object.getPrototypeOf || null;\n","'use strict';\n\n/** @type {import('./eval')} */\nmodule.exports = EvalError;\n","'use strict';\n\n/** @type {import('./shams')} */\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\t/** @type {{ [k in symbol]?: unknown }} */\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (var _ in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\t// eslint-disable-next-line no-extra-parens\n\t\tvar descriptor = /** @type {PropertyDescriptor} */ (Object.getOwnPropertyDescriptor(obj, sym));\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\n//var Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window, src, end - copy, copy, 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* permutation of code lengths */\n [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n utils.arraySet(output, input, next, copy, put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inflate_fast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n/** @type {import('./abs')} */\nmodule.exports = Math.abs;\n","// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign = require('./lib/utils/common').assign;\n\nvar deflate = require('./lib/deflate');\nvar inflate = require('./lib/inflate');\nvar constants = require('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n","// String encode/decode helpers\n'use strict';\n\n\nvar utils = require('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new utils.Buf8(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nexports.utf8border = function (buf, max) {\n var pos;\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar $apply = require('./functionApply');\nvar actualApply = require('./actualApply');\n\n/** @type {import('./applyBind')} */\nmodule.exports = function applyBind() {\n\treturn actualApply(bind, $apply, arguments);\n};\n","// A simple implementation of make-array\nfunction makeArray (subject) {\n return Array.isArray(subject)\n ? subject\n : [subject]\n}\n\nconst EMPTY = ''\nconst SPACE = ' '\nconst ESCAPE = '\\\\'\nconst REGEX_TEST_BLANK_LINE = /^\\s+$/\nconst REGEX_INVALID_TRAILING_BACKSLASH = /(?:[^\\\\]|^)\\\\$/\nconst REGEX_REPLACE_LEADING_EXCAPED_EXCLAMATION = /^\\\\!/\nconst REGEX_REPLACE_LEADING_EXCAPED_HASH = /^\\\\#/\nconst REGEX_SPLITALL_CRLF = /\\r?\\n/g\n// /foo,\n// ./foo,\n// ../foo,\n// .\n// ..\nconst REGEX_TEST_INVALID_PATH = /^\\.*\\/|^\\.+$/\n\nconst SLASH = '/'\n\n// Do not use ternary expression here, since \"istanbul ignore next\" is buggy\nlet TMP_KEY_IGNORE = 'node-ignore'\n/* istanbul ignore else */\nif (typeof Symbol !== 'undefined') {\n TMP_KEY_IGNORE = Symbol.for('node-ignore')\n}\nconst KEY_IGNORE = TMP_KEY_IGNORE\n\nconst define = (object, key, value) =>\n Object.defineProperty(object, key, {value})\n\nconst REGEX_REGEXP_RANGE = /([0-z])-([0-z])/g\n\nconst RETURN_FALSE = () => false\n\n// Sanitize the range of a regular expression\n// The cases are complicated, see test cases for details\nconst sanitizeRange = range => range.replace(\n REGEX_REGEXP_RANGE,\n (match, from, to) => from.charCodeAt(0) <= to.charCodeAt(0)\n ? match\n // Invalid range (out of order) which is ok for gitignore rules but\n // fatal for JavaScript regular expression, so eliminate it.\n : EMPTY\n)\n\n// See fixtures #59\nconst cleanRangeBackSlash = slashes => {\n const {length} = slashes\n return slashes.slice(0, length - length % 2)\n}\n\n// > If the pattern ends with a slash,\n// > it is removed for the purpose of the following description,\n// > but it would only find a match with a directory.\n// > In other words, foo/ will match a directory foo and paths underneath it,\n// > but will not match a regular file or a symbolic link foo\n// > (this is consistent with the way how pathspec works in general in Git).\n// '`foo/`' will not match regular file '`foo`' or symbolic link '`foo`'\n// -> ignore-rules will not deal with it, because it costs extra `fs.stat` call\n// you could use option `mark: true` with `glob`\n\n// '`foo/`' should not continue with the '`..`'\nconst REPLACERS = [\n\n [\n // remove BOM\n // TODO:\n // Other similar zero-width characters?\n /^\\uFEFF/,\n () => EMPTY\n ],\n\n // > Trailing spaces are ignored unless they are quoted with backslash (\"\\\")\n [\n // (a\\ ) -> (a )\n // (a ) -> (a)\n // (a ) -> (a)\n // (a \\ ) -> (a )\n /((?:\\\\\\\\)*?)(\\\\?\\s+)$/,\n (_, m1, m2) => m1 + (\n m2.indexOf('\\\\') === 0\n ? SPACE\n : EMPTY\n )\n ],\n\n // replace (\\ ) with ' '\n // (\\ ) -> ' '\n // (\\\\ ) -> '\\\\ '\n // (\\\\\\ ) -> '\\\\ '\n [\n /(\\\\+?)\\s/g,\n (_, m1) => {\n const {length} = m1\n return m1.slice(0, length - length % 2) + SPACE\n }\n ],\n\n // Escape metacharacters\n // which is written down by users but means special for regular expressions.\n\n // > There are 12 characters with special meanings:\n // > - the backslash \\,\n // > - the caret ^,\n // > - the dollar sign $,\n // > - the period or dot .,\n // > - the vertical bar or pipe symbol |,\n // > - the question mark ?,\n // > - the asterisk or star *,\n // > - the plus sign +,\n // > - the opening parenthesis (,\n // > - the closing parenthesis ),\n // > - and the opening square bracket [,\n // > - the opening curly brace {,\n // > These special characters are often called \"metacharacters\".\n [\n /[\\\\$.|*+(){^]/g,\n match => `\\\\${match}`\n ],\n\n [\n // > a question mark (?) matches a single character\n /(?!\\\\)\\?/g,\n () => '[^/]'\n ],\n\n // leading slash\n [\n\n // > A leading slash matches the beginning of the pathname.\n // > For example, \"/*.c\" matches \"cat-file.c\" but not \"mozilla-sha1/sha1.c\".\n // A leading slash matches the beginning of the pathname\n /^\\//,\n () => '^'\n ],\n\n // replace special metacharacter slash after the leading slash\n [\n /\\//g,\n () => '\\\\/'\n ],\n\n [\n // > A leading \"**\" followed by a slash means match in all directories.\n // > For example, \"**/foo\" matches file or directory \"foo\" anywhere,\n // > the same as pattern \"foo\".\n // > \"**/foo/bar\" matches file or directory \"bar\" anywhere that is directly\n // > under directory \"foo\".\n // Notice that the '*'s have been replaced as '\\\\*'\n /^\\^*\\\\\\*\\\\\\*\\\\\\//,\n\n // '**/foo' <-> 'foo'\n () => '^(?:.*\\\\/)?'\n ],\n\n // starting\n [\n // there will be no leading '/'\n // (which has been replaced by section \"leading slash\")\n // If starts with '**', adding a '^' to the regular expression also works\n /^(?=[^^])/,\n function startingReplacer () {\n // If has a slash `/` at the beginning or middle\n return !/\\/(?!$)/.test(this)\n // > Prior to 2.22.1\n // > If the pattern does not contain a slash /,\n // > Git treats it as a shell glob pattern\n // Actually, if there is only a trailing slash,\n // git also treats it as a shell glob pattern\n\n // After 2.22.1 (compatible but clearer)\n // > If there is a separator at the beginning or middle (or both)\n // > of the pattern, then the pattern is relative to the directory\n // > level of the particular .gitignore file itself.\n // > Otherwise the pattern may also match at any level below\n // > the .gitignore level.\n ? '(?:^|\\\\/)'\n\n // > Otherwise, Git treats the pattern as a shell glob suitable for\n // > consumption by fnmatch(3)\n : '^'\n }\n ],\n\n // two globstars\n [\n // Use lookahead assertions so that we could match more than one `'/**'`\n /\\\\\\/\\\\\\*\\\\\\*(?=\\\\\\/|$)/g,\n\n // Zero, one or several directories\n // should not use '*', or it will be replaced by the next replacer\n\n // Check if it is not the last `'/**'`\n (_, index, str) => index + 6 < str.length\n\n // case: /**/\n // > A slash followed by two consecutive asterisks then a slash matches\n // > zero or more directories.\n // > For example, \"a/**/b\" matches \"a/b\", \"a/x/b\", \"a/x/y/b\" and so on.\n // '/**/'\n ? '(?:\\\\/[^\\\\/]+)*'\n\n // case: /**\n // > A trailing `\"/**\"` matches everything inside.\n\n // #21: everything inside but it should not include the current folder\n : '\\\\/.+'\n ],\n\n // normal intermediate wildcards\n [\n // Never replace escaped '*'\n // ignore rule '\\*' will match the path '*'\n\n // 'abc.*/' -> go\n // 'abc.*' -> skip this rule,\n // coz trailing single wildcard will be handed by [trailing wildcard]\n /(^|[^\\\\]+)(\\\\\\*)+(?=.+)/g,\n\n // '*.js' matches '.js'\n // '*.js' doesn't match 'abc'\n (_, p1, p2) => {\n // 1.\n // > An asterisk \"*\" matches anything except a slash.\n // 2.\n // > Other consecutive asterisks are considered regular asterisks\n // > and will match according to the previous rules.\n const unescaped = p2.replace(/\\\\\\*/g, '[^\\\\/]*')\n return p1 + unescaped\n }\n ],\n\n [\n // unescape, revert step 3 except for back slash\n // For example, if a user escape a '\\\\*',\n // after step 3, the result will be '\\\\\\\\\\\\*'\n /\\\\\\\\\\\\(?=[$.|*+(){^])/g,\n () => ESCAPE\n ],\n\n [\n // '\\\\\\\\' -> '\\\\'\n /\\\\\\\\/g,\n () => ESCAPE\n ],\n\n [\n // > The range notation, e.g. [a-zA-Z],\n // > can be used to match one of the characters in a range.\n\n // `\\` is escaped by step 3\n /(\\\\)?\\[([^\\]/]*?)(\\\\*)($|\\])/g,\n (match, leadEscape, range, endEscape, close) => leadEscape === ESCAPE\n // '\\\\[bar]' -> '\\\\\\\\[bar\\\\]'\n ? `\\\\[${range}${cleanRangeBackSlash(endEscape)}${close}`\n : close === ']'\n ? endEscape.length % 2 === 0\n // A normal case, and it is a range notation\n // '[bar]'\n // '[bar\\\\\\\\]'\n ? `[${sanitizeRange(range)}${endEscape}]`\n // Invalid range notaton\n // '[bar\\\\]' -> '[bar\\\\\\\\]'\n : '[]'\n : '[]'\n ],\n\n // ending\n [\n // 'js' will not match 'js.'\n // 'ab' will not match 'abc'\n /(?:[^*])$/,\n\n // WTF!\n // https://git-scm.com/docs/gitignore\n // changes in [2.22.1](https://git-scm.com/docs/gitignore/2.22.1)\n // which re-fixes #24, #38\n\n // > If there is a separator at the end of the pattern then the pattern\n // > will only match directories, otherwise the pattern can match both\n // > files and directories.\n\n // 'js*' will not match 'a.js'\n // 'js/' will not match 'a.js'\n // 'js' will match 'a.js' and 'a.js/'\n match => /\\/$/.test(match)\n // foo/ will not match 'foo'\n ? `${match}$`\n // foo matches 'foo' and 'foo/'\n : `${match}(?=$|\\\\/$)`\n ],\n\n // trailing wildcard\n [\n /(\\^|\\\\\\/)?\\\\\\*$/,\n (_, p1) => {\n const prefix = p1\n // '\\^':\n // '/*' does not match EMPTY\n // '/*' does not match everything\n\n // '\\\\\\/':\n // 'abc/*' does not match 'abc/'\n ? `${p1}[^/]+`\n\n // 'a*' matches 'a'\n // 'a*' matches 'aa'\n : '[^/]*'\n\n return `${prefix}(?=$|\\\\/$)`\n }\n ],\n]\n\n// A simple cache, because an ignore rule only has only one certain meaning\nconst regexCache = Object.create(null)\n\n// @param {pattern}\nconst makeRegex = (pattern, ignoreCase) => {\n let source = regexCache[pattern]\n\n if (!source) {\n source = REPLACERS.reduce(\n (prev, [matcher, replacer]) =>\n prev.replace(matcher, replacer.bind(pattern)),\n pattern\n )\n regexCache[pattern] = source\n }\n\n return ignoreCase\n ? new RegExp(source, 'i')\n : new RegExp(source)\n}\n\nconst isString = subject => typeof subject === 'string'\n\n// > A blank line matches no files, so it can serve as a separator for readability.\nconst checkPattern = pattern => pattern\n && isString(pattern)\n && !REGEX_TEST_BLANK_LINE.test(pattern)\n && !REGEX_INVALID_TRAILING_BACKSLASH.test(pattern)\n\n // > A line starting with # serves as a comment.\n && pattern.indexOf('#') !== 0\n\nconst splitPattern = pattern => pattern.split(REGEX_SPLITALL_CRLF)\n\nclass IgnoreRule {\n constructor (\n origin,\n pattern,\n negative,\n regex\n ) {\n this.origin = origin\n this.pattern = pattern\n this.negative = negative\n this.regex = regex\n }\n}\n\nconst createRule = (pattern, ignoreCase) => {\n const origin = pattern\n let negative = false\n\n // > An optional prefix \"!\" which negates the pattern;\n if (pattern.indexOf('!') === 0) {\n negative = true\n pattern = pattern.substr(1)\n }\n\n pattern = pattern\n // > Put a backslash (\"\\\") in front of the first \"!\" for patterns that\n // > begin with a literal \"!\", for example, `\"\\!important!.txt\"`.\n .replace(REGEX_REPLACE_LEADING_EXCAPED_EXCLAMATION, '!')\n // > Put a backslash (\"\\\") in front of the first hash for patterns that\n // > begin with a hash.\n .replace(REGEX_REPLACE_LEADING_EXCAPED_HASH, '#')\n\n const regex = makeRegex(pattern, ignoreCase)\n\n return new IgnoreRule(\n origin,\n pattern,\n negative,\n regex\n )\n}\n\nconst throwError = (message, Ctor) => {\n throw new Ctor(message)\n}\n\nconst checkPath = (path, originalPath, doThrow) => {\n if (!isString(path)) {\n return doThrow(\n `path must be a string, but got \\`${originalPath}\\``,\n TypeError\n )\n }\n\n // We don't know if we should ignore EMPTY, so throw\n if (!path) {\n return doThrow(`path must not be empty`, TypeError)\n }\n\n // Check if it is a relative path\n if (checkPath.isNotRelative(path)) {\n const r = '`path.relative()`d'\n return doThrow(\n `path should be a ${r} string, but got \"${originalPath}\"`,\n RangeError\n )\n }\n\n return true\n}\n\nconst isNotRelative = path => REGEX_TEST_INVALID_PATH.test(path)\n\ncheckPath.isNotRelative = isNotRelative\ncheckPath.convert = p => p\n\nclass Ignore {\n constructor ({\n ignorecase = true,\n ignoreCase = ignorecase,\n allowRelativePaths = false\n } = {}) {\n define(this, KEY_IGNORE, true)\n\n this._rules = []\n this._ignoreCase = ignoreCase\n this._allowRelativePaths = allowRelativePaths\n this._initCache()\n }\n\n _initCache () {\n this._ignoreCache = Object.create(null)\n this._testCache = Object.create(null)\n }\n\n _addPattern (pattern) {\n // #32\n if (pattern && pattern[KEY_IGNORE]) {\n this._rules = this._rules.concat(pattern._rules)\n this._added = true\n return\n }\n\n if (checkPattern(pattern)) {\n const rule = createRule(pattern, this._ignoreCase)\n this._added = true\n this._rules.push(rule)\n }\n }\n\n // @param {Array<string> | string | Ignore} pattern\n add (pattern) {\n this._added = false\n\n makeArray(\n isString(pattern)\n ? splitPattern(pattern)\n : pattern\n ).forEach(this._addPattern, this)\n\n // Some rules have just added to the ignore,\n // making the behavior changed.\n if (this._added) {\n this._initCache()\n }\n\n return this\n }\n\n // legacy\n addPattern (pattern) {\n return this.add(pattern)\n }\n\n // | ignored : unignored\n // negative | 0:0 | 0:1 | 1:0 | 1:1\n // -------- | ------- | ------- | ------- | --------\n // 0 | TEST | TEST | SKIP | X\n // 1 | TESTIF | SKIP | TEST | X\n\n // - SKIP: always skip\n // - TEST: always test\n // - TESTIF: only test if checkUnignored\n // - X: that never happen\n\n // @param {boolean} whether should check if the path is unignored,\n // setting `checkUnignored` to `false` could reduce additional\n // path matching.\n\n // @returns {TestResult} true if a file is ignored\n _testOne (path, checkUnignored) {\n let ignored = false\n let unignored = false\n\n this._rules.forEach(rule => {\n const {negative} = rule\n if (\n unignored === negative && ignored !== unignored\n || negative && !ignored && !unignored && !checkUnignored\n ) {\n return\n }\n\n const matched = rule.regex.test(path)\n\n if (matched) {\n ignored = !negative\n unignored = negative\n }\n })\n\n return {\n ignored,\n unignored\n }\n }\n\n // @returns {TestResult}\n _test (originalPath, cache, checkUnignored, slices) {\n const path = originalPath\n // Supports nullable path\n && checkPath.convert(originalPath)\n\n checkPath(\n path,\n originalPath,\n this._allowRelativePaths\n ? RETURN_FALSE\n : throwError\n )\n\n return this._t(path, cache, checkUnignored, slices)\n }\n\n _t (path, cache, checkUnignored, slices) {\n if (path in cache) {\n return cache[path]\n }\n\n if (!slices) {\n // path/to/a.js\n // ['path', 'to', 'a.js']\n slices = path.split(SLASH)\n }\n\n slices.pop()\n\n // If the path has no parent directory, just test it\n if (!slices.length) {\n return cache[path] = this._testOne(path, checkUnignored)\n }\n\n const parent = this._t(\n slices.join(SLASH) + SLASH,\n cache,\n checkUnignored,\n slices\n )\n\n // If the path contains a parent directory, check the parent first\n return cache[path] = parent.ignored\n // > It is not possible to re-include a file if a parent directory of\n // > that file is excluded.\n ? parent\n : this._testOne(path, checkUnignored)\n }\n\n ignores (path) {\n return this._test(path, this._ignoreCache, false).ignored\n }\n\n createFilter () {\n return path => !this.ignores(path)\n }\n\n filter (paths) {\n return makeArray(paths).filter(this.createFilter())\n }\n\n // @returns {TestResult}\n test (path) {\n return this._test(path, this._testCache, true)\n }\n}\n\nconst factory = options => new Ignore(options)\n\nconst isPathValid = path =>\n checkPath(path && checkPath.convert(path), path, RETURN_FALSE)\n\nfactory.isPathValid = isPathValid\n\n// Fixes typescript\nfactory.default = factory\n\nmodule.exports = factory\n\n// Windows\n// --------------------------------------------------------------\n/* istanbul ignore if */\nif (\n // Detect `process` so that it can run in browsers.\n typeof process !== 'undefined'\n && (\n process.env && process.env.IGNORE_TEST_WIN32\n || process.platform === 'win32'\n )\n) {\n /* eslint no-control-regex: \"off\" */\n const makePosix = str => /^\\\\\\\\\\?\\\\/.test(str)\n || /[\"<>|\\u0000-\\u001F]+/u.test(str)\n ? str\n : str.replace(/\\\\/g, '/')\n\n checkPath.convert = makePosix\n\n // 'C:\\\\foo' <- 'C:\\\\foo' has been converted to 'C:/'\n // 'd:\\\\foo'\n const REGIX_IS_WINDOWS_PATH_ABSOLUTE = /^[a-z]:\\//i\n checkPath.isNotRelative = path =>\n REGIX_IS_WINDOWS_PATH_ABSOLUTE.test(path)\n || isNotRelative(path)\n}\n","/*! crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */\n/* vim: set ts=2: */\n/*exported CRC32 */\nvar CRC32;\n(function (factory) {\n\t/*jshint ignore:start */\n\t/*eslint-disable */\n\tif(typeof DO_NOT_EXPORT_CRC === 'undefined') {\n\t\tif('object' === typeof exports) {\n\t\t\tfactory(exports);\n\t\t} else if ('function' === typeof define && define.amd) {\n\t\t\tdefine(function () {\n\t\t\t\tvar module = {};\n\t\t\t\tfactory(module);\n\t\t\t\treturn module;\n\t\t\t});\n\t\t} else {\n\t\t\tfactory(CRC32 = {});\n\t\t}\n\t} else {\n\t\tfactory(CRC32 = {});\n\t}\n\t/*eslint-enable */\n\t/*jshint ignore:end */\n}(function(CRC32) {\nCRC32.version = '1.2.2';\n/*global Int32Array */\nfunction signed_crc_table() {\n\tvar c = 0, table = new Array(256);\n\n\tfor(var n =0; n != 256; ++n){\n\t\tc = n;\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\ttable[n] = c;\n\t}\n\n\treturn typeof Int32Array !== 'undefined' ? new Int32Array(table) : table;\n}\n\nvar T0 = signed_crc_table();\nfunction slice_by_16_tables(T) {\n\tvar c = 0, v = 0, n = 0, table = typeof Int32Array !== 'undefined' ? new Int32Array(4096) : new Array(4096) ;\n\n\tfor(n = 0; n != 256; ++n) table[n] = T[n];\n\tfor(n = 0; n != 256; ++n) {\n\t\tv = T[n];\n\t\tfor(c = 256 + n; c < 4096; c += 256) v = table[c] = (v >>> 8) ^ T[v & 0xFF];\n\t}\n\tvar out = [];\n\tfor(n = 1; n != 16; ++n) out[n - 1] = typeof Int32Array !== 'undefined' ? table.subarray(n * 256, n * 256 + 256) : table.slice(n * 256, n * 256 + 256);\n\treturn out;\n}\nvar TT = slice_by_16_tables(T0);\nvar T1 = TT[0], T2 = TT[1], T3 = TT[2], T4 = TT[3], T5 = TT[4];\nvar T6 = TT[5], T7 = TT[6], T8 = TT[7], T9 = TT[8], Ta = TT[9];\nvar Tb = TT[10], Tc = TT[11], Td = TT[12], Te = TT[13], Tf = TT[14];\nfunction crc32_bstr(bstr, seed) {\n\tvar C = seed ^ -1;\n\tfor(var i = 0, L = bstr.length; i < L;) C = (C>>>8) ^ T0[(C^bstr.charCodeAt(i++))&0xFF];\n\treturn ~C;\n}\n\nfunction crc32_buf(B, seed) {\n\tvar C = seed ^ -1, L = B.length - 15, i = 0;\n\tfor(; i < L;) C =\n\t\tTf[B[i++] ^ (C & 255)] ^\n\t\tTe[B[i++] ^ ((C >> 8) & 255)] ^\n\t\tTd[B[i++] ^ ((C >> 16) & 255)] ^\n\t\tTc[B[i++] ^ (C >>> 24)] ^\n\t\tTb[B[i++]] ^ Ta[B[i++]] ^ T9[B[i++]] ^ T8[B[i++]] ^\n\t\tT7[B[i++]] ^ T6[B[i++]] ^ T5[B[i++]] ^ T4[B[i++]] ^\n\t\tT3[B[i++]] ^ T2[B[i++]] ^ T1[B[i++]] ^ T0[B[i++]];\n\tL += 15;\n\twhile(i < L) C = (C>>>8) ^ T0[(C^B[i++])&0xFF];\n\treturn ~C;\n}\n\nfunction crc32_str(str, seed) {\n\tvar C = seed ^ -1;\n\tfor(var i = 0, L = str.length, c = 0, d = 0; i < L;) {\n\t\tc = str.charCodeAt(i++);\n\t\tif(c < 0x80) {\n\t\t\tC = (C>>>8) ^ T0[(C^c)&0xFF];\n\t\t} else if(c < 0x800) {\n\t\t\tC = (C>>>8) ^ T0[(C ^ (192|((c>>6)&31)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|(c&63)))&0xFF];\n\t\t} else if(c >= 0xD800 && c < 0xE000) {\n\t\t\tc = (c&1023)+64; d = str.charCodeAt(i++)&1023;\n\t\t\tC = (C>>>8) ^ T0[(C ^ (240|((c>>8)&7)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|((c>>2)&63)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|((d>>6)&15)|((c&3)<<4)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|(d&63)))&0xFF];\n\t\t} else {\n\t\t\tC = (C>>>8) ^ T0[(C ^ (224|((c>>12)&15)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|((c>>6)&63)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|(c&63)))&0xFF];\n\t\t}\n\t}\n\treturn ~C;\n}\nCRC32.table = T0;\n// $FlowIgnore\nCRC32.bstr = crc32_bstr;\n// $FlowIgnore\nCRC32.buf = crc32_buf;\n// $FlowIgnore\nCRC32.str = crc32_str;\n}));\n","'use strict';\n\nvar isCallable = require('is-callable');\n\nvar toStr = Object.prototype.toString;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\n/** @type {<This, A extends readonly unknown[]>(arr: A, iterator: (this: This | void, value: A[number], index: number, arr: A) => void, receiver: This | undefined) => void} */\nvar forEachArray = function forEachArray(array, iterator, receiver) {\n for (var i = 0, len = array.length; i < len; i++) {\n if (hasOwnProperty.call(array, i)) {\n if (receiver == null) {\n iterator(array[i], i, array);\n } else {\n iterator.call(receiver, array[i], i, array);\n }\n }\n }\n};\n\n/** @type {<This, S extends string>(string: S, iterator: (this: This | void, value: S[number], index: number, string: S) => void, receiver: This | undefined) => void} */\nvar forEachString = function forEachString(string, iterator, receiver) {\n for (var i = 0, len = string.length; i < len; i++) {\n // no such thing as a sparse string.\n if (receiver == null) {\n iterator(string.charAt(i), i, string);\n } else {\n iterator.call(receiver, string.charAt(i), i, string);\n }\n }\n};\n\n/** @type {<This, O>(obj: O, iterator: (this: This | void, value: O[keyof O], index: keyof O, obj: O) => void, receiver: This | undefined) => void} */\nvar forEachObject = function forEachObject(object, iterator, receiver) {\n for (var k in object) {\n if (hasOwnProperty.call(object, k)) {\n if (receiver == null) {\n iterator(object[k], k, object);\n } else {\n iterator.call(receiver, object[k], k, object);\n }\n }\n }\n};\n\n/** @type {(x: unknown) => x is readonly unknown[]} */\nfunction isArray(x) {\n return toStr.call(x) === '[object Array]';\n}\n\n/** @type {import('.')._internal} */\nmodule.exports = function forEach(list, iterator, thisArg) {\n if (!isCallable(iterator)) {\n throw new TypeError('iterator must be a function');\n }\n\n var receiver;\n if (arguments.length >= 3) {\n receiver = thisArg;\n }\n\n if (isArray(list)) {\n forEachArray(list, iterator, receiver);\n } else if (typeof list === 'string') {\n forEachString(list, iterator, receiver);\n } else {\n forEachObject(list, iterator, receiver);\n }\n};\n","'use strict';\n\nvar $isNaN = require('./isNaN');\n\n/** @type {import('./sign')} */\nmodule.exports = function sign(number) {\n\tif ($isNaN(number) || number === 0) {\n\t\treturn number;\n\t}\n\treturn number < 0 ? -1 : +1;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar $TypeError = require('es-errors/type');\n\nvar $call = require('./functionCall');\nvar $actualApply = require('./actualApply');\n\n/** @type {(args: [Function, thisArg?: unknown, ...args: unknown[]]) => Function} TODO FIXME, find a way to use import('.') */\nmodule.exports = function callBindBasic(args) {\n\tif (args.length < 1 || typeof args[0] !== 'function') {\n\t\tthrow new $TypeError('a function is required');\n\t}\n\treturn $actualApply(bind, $call, args);\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nvar $apply = require('./functionApply');\nvar $call = require('./functionCall');\nvar $reflectApply = require('./reflectApply');\n\n/** @type {import('./actualApply')} */\nmodule.exports = $reflectApply || bind.call($call, $apply);\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n","'use strict';\n\n\nvar zlib_deflate = require('./zlib/deflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH = 0;\nvar Z_FINISH = 4;\n\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_SYNC_FLUSH = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY = 0;\n\nvar Z_DEFLATED = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n if (!(this instanceof Deflate)) return new Deflate(options);\n\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_deflate.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n var dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var status, _mode;\n\n if (this.ended) { return false; }\n\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n status = zlib_deflate.deflate(strm, _mode); /* no bad return value */\n\n if (status !== Z_STREAM_END && status !== Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n if (this.options.to === 'string') {\n this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n // Finalize on the last chunk.\n if (_mode === Z_FINISH) {\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === Z_SYNC_FLUSH) {\n this.onEnd(Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n var deflator = new Deflate(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n","'use strict';\n\nvar reflectGetProto = require('./Reflect.getPrototypeOf');\nvar originalGetProto = require('./Object.getPrototypeOf');\n\nvar getDunderProto = require('dunder-proto/get');\n\n/** @type {import('.')} */\nmodule.exports = reflectGetProto\n\t? function getProto(O) {\n\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\treturn reflectGetProto(O);\n\t}\n\t: originalGetProto\n\t\t? function getProto(O) {\n\t\t\tif (!O || (typeof O !== 'object' && typeof O !== 'function')) {\n\t\t\t\tthrow new TypeError('getProto: not an object');\n\t\t\t}\n\t\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\t\treturn originalGetProto(O);\n\t\t}\n\t\t: getDunderProto\n\t\t\t? function getProto(O) {\n\t\t\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\t\t\treturn getDunderProto(O);\n\t\t\t}\n\t\t\t: null;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits = /* extra bits for each length code */\n [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];\n\nvar extra_dbits = /* extra bits for each distance code */\n [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];\n\nvar extra_blbits = /* extra bits for each bit length code */\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short(s, w) {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n}\n\n\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nfunction gen_bitlen(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n{\n var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS; bits++) {\n next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n var len = tree[n * 2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n var n; /* iterates over tree elements */\n var bits; /* bit counter */\n var length; /* length value */\n var code; /* code value */\n var dist; /* distance index */\n var bl_count = new Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n{\n var v = s.heap[k];\n var j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n var black_mask = 0xf3ffc07f;\n var n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //var out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize - 1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n}\n\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [\n\t0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n];\n\nvar W = new Array(80);\n\nfunction Sha1() {\n\tthis.init();\n\tthis._w = W;\n\n\tHash.call(this, 64, 56);\n}\n\ninherits(Sha1, Hash);\n\nSha1.prototype.init = function () {\n\tthis._a = 0x67452301;\n\tthis._b = 0xefcdab89;\n\tthis._c = 0x98badcfe;\n\tthis._d = 0x10325476;\n\tthis._e = 0xc3d2e1f0;\n\n\treturn this;\n};\n\nfunction rotl1(num) {\n\treturn (num << 1) | (num >>> 31);\n}\n\nfunction rotl5(num) {\n\treturn (num << 5) | (num >>> 27);\n}\n\nfunction rotl30(num) {\n\treturn (num << 30) | (num >>> 2);\n}\n\nfunction ft(s, b, c, d) {\n\tif (s === 0) {\n\t\treturn (b & c) | (~b & d);\n\t}\n\tif (s === 2) {\n\t\treturn (b & c) | (b & d) | (c & d);\n\t}\n\treturn b ^ c ^ d;\n}\n\nSha1.prototype._update = function (M) {\n\tvar w = this._w;\n\n\tvar a = this._a | 0;\n\tvar b = this._b | 0;\n\tvar c = this._c | 0;\n\tvar d = this._d | 0;\n\tvar e = this._e | 0;\n\n\tfor (var i = 0; i < 16; ++i) {\n\t\tw[i] = M.readInt32BE(i * 4);\n\t}\n\tfor (; i < 80; ++i) {\n\t\tw[i] = rotl1(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);\n\t}\n\n\tfor (var j = 0; j < 80; ++j) {\n\t\tvar s = ~~(j / 20);\n\t\tvar t = (rotl5(a) + ft(s, b, c, d) + e + w[j] + K[s]) | 0;\n\n\t\te = d;\n\t\td = c;\n\t\tc = rotl30(b);\n\t\tb = a;\n\t\ta = t;\n\t}\n\n\tthis._a = (a + this._a) | 0;\n\tthis._b = (b + this._b) | 0;\n\tthis._c = (c + this._c) | 0;\n\tthis._d = (d + this._d) | 0;\n\tthis._e = (e + this._e) | 0;\n};\n\nSha1.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(20);\n\n\tH.writeInt32BE(this._a | 0, 0);\n\tH.writeInt32BE(this._b | 0, 4);\n\tH.writeInt32BE(this._c | 0, 8);\n\tH.writeInt32BE(this._d | 0, 12);\n\tH.writeInt32BE(this._e | 0, 16);\n\n\treturn H;\n};\n\nmodule.exports = Sha1;\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\nvar $TypeError = require('es-errors/type');\n\nvar callBound = require('call-bound');\n\n/** @type {undefined | ((thisArg: import('.').TypedArray) => Buffer<ArrayBufferLike>)} */\nvar $typedArrayBuffer = callBound('TypedArray.prototype.buffer', true);\n\nvar isTypedArray = require('is-typed-array');\n\n/** @type {import('.')} */\n// node <= 0.10, < 0.11.4 has a nonconfigurable own property instead of a prototype getter\nmodule.exports = $typedArrayBuffer || function typedArrayBuffer(x) {\n\tif (!isTypedArray(x)) {\n\t\tthrow new $TypeError('Not a Typed Array');\n\t}\n\treturn x.buffer;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","'use strict';\n\n/** @type {import('./isNaN')} */\nmodule.exports = Number.isNaN || function isNaN(a) {\n\treturn a !== a;\n};\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\n crc ^= -1;\n\n for (var i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n","'use strict';\n\n/** @type {import('./uri')} */\nmodule.exports = URIError;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar isArray = require('isarray');\nvar typedArrayBuffer = require('typed-array-buffer');\n\nvar isView = ArrayBuffer.isView || function isView(obj) {\n\ttry {\n\t\ttypedArrayBuffer(obj);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\n\nvar useUint8Array = typeof Uint8Array !== 'undefined';\nvar useArrayBuffer = typeof ArrayBuffer !== 'undefined'\n\t&& typeof Uint8Array !== 'undefined';\nvar useFromArrayBuffer = useArrayBuffer && (Buffer.prototype instanceof Uint8Array || Buffer.TYPED_ARRAY_SUPPORT);\n\nmodule.exports = function toBuffer(data, encoding) {\n\t/*\n\t * No need to do anything for exact instance\n\t * This is only valid when safe-buffer.Buffer === buffer.Buffer, i.e. when Buffer.from/Buffer.alloc existed\n\t */\n\tif (data instanceof Buffer) {\n\t\treturn data;\n\t}\n\n\tif (typeof data === 'string') {\n\t\treturn Buffer.from(data, encoding);\n\t}\n\n\t/*\n\t * Wrap any TypedArray instances and DataViews\n\t * Makes sense only on engines with full TypedArray support -- let Buffer detect that\n\t */\n\tif (useArrayBuffer && isView(data)) {\n\t\t// Bug in Node.js <6.3.1, which treats this as out-of-bounds\n\t\tif (data.byteLength === 0) {\n\t\t\treturn Buffer.alloc(0);\n\t\t}\n\n\t\t// When Buffer is based on Uint8Array, we can just construct it from ArrayBuffer\n\t\tif (useFromArrayBuffer) {\n\t\t\tvar res = Buffer.from(data.buffer, data.byteOffset, data.byteLength);\n\t\t\t/*\n\t\t\t * Recheck result size, as offset/length doesn't work on Node.js <5.10\n\t\t\t * We just go to Uint8Array case if this fails\n\t\t\t */\n\t\t\tif (res.byteLength === data.byteLength) {\n\t\t\t\treturn res;\n\t\t\t}\n\t\t}\n\n\t\t// Convert to Uint8Array bytes and then to Buffer\n\t\tvar uint8 = data instanceof Uint8Array ? data : new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\tvar result = Buffer.from(uint8);\n\n\t\t/*\n\t\t * Let's recheck that conversion succeeded\n\t\t * We have .length but not .byteLength when useFromArrayBuffer is false\n\t\t */\n\t\tif (result.length === data.byteLength) {\n\t\t\treturn result;\n\t\t}\n\t}\n\n\t/*\n\t * Uint8Array in engines where Buffer.from might not work with ArrayBuffer, just copy over\n\t * Doesn't make sense with other TypedArray instances\n\t */\n\tif (useUint8Array && data instanceof Uint8Array) {\n\t\treturn Buffer.from(data);\n\t}\n\n\tvar isArr = isArray(data);\n\tif (isArr) {\n\t\tfor (var i = 0; i < data.length; i += 1) {\n\t\t\tvar x = data[i];\n\t\t\tif (\n\t\t\t\ttypeof x !== 'number'\n\t\t\t\t|| x < 0\n\t\t\t\t|| x > 255\n\t\t\t\t|| ~~x !== x // NaN and integer check\n\t\t\t) {\n\t\t\t\tthrow new RangeError('Array items must be numbers in the range 0-255.');\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t * Old Buffer polyfill on an engine that doesn't have TypedArray support\n\t * Also, this is from a different Buffer polyfill implementation then we have, as instanceof check failed\n\t * Convert to our current Buffer implementation\n\t */\n\tif (\n\t\tisArr || (\n\t\t\tBuffer.isBuffer(data)\n\t\t\t\t&& data.constructor\n\t\t\t\t&& typeof data.constructor.isBuffer === 'function'\n\t\t\t\t&& data.constructor.isBuffer(data)\n\t\t)\n\t) {\n\t\treturn Buffer.from(data);\n\t}\n\n\tthrow new TypeError('The \"data\" argument must be a string, an Array, a Buffer, a Uint8Array, or a DataView.');\n};\n","'use strict';\n\nvar whichTypedArray = require('which-typed-array');\n\n/** @type {import('.')} */\nmodule.exports = function isTypedArray(value) {\n\treturn !!whichTypedArray(value);\n};\n","'use strict';\n\nvar forEach = require('for-each');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBind = require('call-bind');\nvar callBound = require('call-bound');\nvar gOPD = require('gopd');\nvar getProto = require('get-proto');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\n\n/** @type {<T = unknown>(array: readonly T[], value: unknown) => number} */\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\n\n/** @typedef {import('./types').Getter} Getter */\n/** @type {import('./types').Cache} */\nvar cache = { __proto__: null };\nif (hasToStringTag && gOPD && getProto) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr && getProto) {\n\t\t\tvar proto = getProto(arr);\n\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor && proto) {\n\t\t\t\tvar superProto = getProto(proto);\n\t\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(descriptor.get);\n\t\t}\n\t});\n} else {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tvar fn = arr.slice || arr.set;\n\t\tif (fn) {\n\t\t\tcache[\n\t\t\t\t/** @type {`$${import('.').TypedArrayName}`} */ ('$' + typedArray)\n\t\t\t] = /** @type {import('./types').BoundSlice | import('./types').BoundSet} */ (\n\t\t\t\t// @ts-expect-error TODO FIXME\n\t\t\t\tcallBind(fn)\n\t\t\t);\n\t\t}\n\t});\n}\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\t/** @type {ReturnType<typeof tryAllTypedArrays>} */ var found = false;\n\tforEach(\n\t\t/** @type {Record<`\\$${import('.').TypedArrayName}`, Getter>} */ (cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */\n\t\tfunction (getter, typedArray) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error a throw is fine here\n\t\t\t\t\tif ('$' + getter(value) === typedArray) {\n\t\t\t\t\t\tfound = /** @type {import('.').TypedArrayName} */ ($slice(typedArray, 1));\n\t\t\t\t\t}\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar trySlices = function tryAllSlices(value) {\n\t/** @type {ReturnType<typeof tryAllSlices>} */ var found = false;\n\tforEach(\n\t\t/** @type {Record<`\\$${import('.').TypedArrayName}`, Getter>} */(cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */ function (getter, name) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error a throw is fine here\n\t\t\t\t\tgetter(value);\n\t\t\t\t\tfound = /** @type {import('.').TypedArrayName} */ ($slice(name, 1));\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {import('.')} */\nmodule.exports = function whichTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\t/** @type {string} */\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\tif ($indexOf(typedArrays, tag) > -1) {\n\t\t\treturn tag;\n\t\t}\n\t\tif (tag !== 'Object') {\n\t\t\treturn false;\n\t\t}\n\t\t// node < 0.6 hits here on real Typed Arrays\n\t\treturn trySlices(value);\n\t}\n\tif (!gOPD) { return null; } // unknown engine\n\treturn tryTypedArrays(value);\n};\n","'use strict';\n\n/** @type {import('.')} */\nvar $gOPD = require('./gOPD');\n\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","'use strict';\n\n/** @type {import('./pow')} */\nmodule.exports = Math.pow;\n","'use strict';\n\n/** @type {import('./max')} */\nmodule.exports = Math.max;\n","'use strict';\n\n/** @type {import('./gOPD')} */\nmodule.exports = Object.getOwnPropertyDescriptor;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBindBasic = require('call-bind-apply-helpers');\n\n/** @type {(thisArg: string, searchString: string, position?: number) => number} */\nvar $indexOf = callBindBasic([GetIntrinsic('%String.prototype.indexOf%')]);\n\n/** @type {import('.')} */\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\t/* eslint no-extra-parens: 0 */\n\n\tvar intrinsic = /** @type {(this: unknown, ...args: unknown[]) => unknown} */ (GetIntrinsic(name, !!allowMissing));\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBindBasic(/** @type {const} */ ([intrinsic]));\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = [\n\t'Float16Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int8Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'BigInt64Array',\n\t'BigUint64Array'\n];\n","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n })\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\nvar define = require('define-data-property');\nvar hasDescriptors = require('has-property-descriptors')();\nvar gOPD = require('gopd');\n\nvar $TypeError = require('es-errors/type');\nvar $floor = GetIntrinsic('%Math.floor%');\n\n/** @type {import('.')} */\nmodule.exports = function setFunctionLength(fn, length) {\n\tif (typeof fn !== 'function') {\n\t\tthrow new $TypeError('`fn` is not a function');\n\t}\n\tif (typeof length !== 'number' || length < 0 || length > 0xFFFFFFFF || $floor(length) !== length) {\n\t\tthrow new $TypeError('`length` must be a positive 32-bit integer');\n\t}\n\n\tvar loose = arguments.length > 2 && !!arguments[2];\n\n\tvar functionLengthIsConfigurable = true;\n\tvar functionLengthIsWritable = true;\n\tif ('length' in fn && gOPD) {\n\t\tvar desc = gOPD(fn, 'length');\n\t\tif (desc && !desc.configurable) {\n\t\t\tfunctionLengthIsConfigurable = false;\n\t\t}\n\t\tif (desc && !desc.writable) {\n\t\t\tfunctionLengthIsWritable = false;\n\t\t}\n\t}\n\n\tif (functionLengthIsConfigurable || functionLengthIsWritable || !loose) {\n\t\tif (hasDescriptors) {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length, true, true);\n\t\t} else {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length);\n\t\t}\n\t}\n\treturn fn;\n};\n","'use strict';\n\n\nvar zlib_inflate = require('./zlib/inflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar c = require('./zlib/constants');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\nvar GZheader = require('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n if (!(this instanceof Inflate)) return new Inflate(options);\n\n this.options = utils.assign({\n chunkSize: 16384,\n windowBits: 0,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_inflate.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new GZheader();\n\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var dictionary = this.options.dictionary;\n var status, _mode;\n var next_out_utf8, tail, utf8str;\n\n // Flag to properly process Z_BUF_ERROR on testing inflate call\n // when we check that all output data was flushed.\n var allowBufError = false;\n\n if (this.ended) { return false; }\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // Only binary strings can be decompressed on practice\n strm.input = strings.binstring2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */\n\n if (status === c.Z_NEED_DICT && dictionary) {\n status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);\n }\n\n if (status === c.Z_BUF_ERROR && allowBufError === true) {\n status = c.Z_OK;\n allowBufError = false;\n }\n\n if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n if (this.options.to === 'string') {\n\n next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n tail = strm.next_out - next_out_utf8;\n utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n this.onData(utf8str);\n\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n }\n\n // When no more input data, we should check that internal inflate buffers\n // are flushed. The only way to do it when avail_out = 0 - run one more\n // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n // Here we set flag to process this error properly.\n //\n // NOTE. Deflate does not return error in this case and does not needs such\n // logic.\n if (strm.avail_in === 0 && strm.avail_out === 0) {\n allowBufError = true;\n }\n\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n if (status === c.Z_STREAM_END) {\n _mode = c.Z_FINISH;\n }\n\n // Finalize on the last chunk.\n if (_mode === c.Z_FINISH) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === c.Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === c.Z_SYNC_FLUSH) {\n this.onEnd(c.Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === c.Z_OK) {\n if (this.options.to === 'string') {\n // Glue & convert here, until we teach pako to send\n // utf8 aligned strings to onData\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n * , output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err)\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n var inflator = new Inflate(options);\n\n inflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip = inflate;\n","'use strict';\n\n/** @type {import('./reflectApply')} */\nmodule.exports = typeof Reflect !== 'undefined' && Reflect && Reflect.apply;\n","'use strict';\n\nvar callBind = require('call-bind-apply-helpers');\nvar gOPD = require('gopd');\n\nvar hasProtoAccessor;\ntry {\n\t// eslint-disable-next-line no-extra-parens, no-proto\n\thasProtoAccessor = /** @type {{ __proto__?: typeof Array.prototype }} */ ([]).__proto__ === Array.prototype;\n} catch (e) {\n\tif (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {\n\t\tthrow e;\n\t}\n}\n\n// eslint-disable-next-line no-extra-parens\nvar desc = !!hasProtoAccessor && gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));\n\nvar $Object = Object;\nvar $getPrototypeOf = $Object.getPrototypeOf;\n\n/** @type {import('./get')} */\nmodule.exports = desc && typeof desc.get === 'function'\n\t? callBind([desc.get])\n\t: typeof $getPrototypeOf === 'function'\n\t\t? /** @type {import('./get')} */ function getDunder(value) {\n\t\t\t// eslint-disable-next-line eqeqeq\n\t\t\treturn $getPrototypeOf(value == null ? value : $Object(value));\n\t\t}\n\t\t: false;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nmodule.exports = GZheader;\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","'use strict';\n\n/** @type {import('./min')} */\nmodule.exports = Math.min;\n","'use strict';\n\n/** @type {import('./syntax')} */\nmodule.exports = SyntaxError;\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.write(string, encoding)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n let i\n if (dir) {\n let foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8'\n\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n case 'latin1':\n case 'binary':\n return asciiWrite(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\n end = this.length\n }\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar trees = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY = 0;\n//var Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction flush_block_only(s, last) {\n trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n// put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n var strend = s.strstart + MAX_MATCH;\n var scan_end1 = _win[scan + best_len - 1];\n var scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// var curr = s.strstart + s.lookahead;\n// var init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n var max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n var max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* scan goes up to strend for length of run */\n\n var _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);\n this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);\n this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\nfunction deflateResetKeep(strm) {\n var s;\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new utils.Buf8(s.w_size * 2);\n s.head = new utils.Buf16(s.hash_size);\n s.prev = new utils.Buf16(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n s = strm.state;\n\n if (!strm.output ||\n (!strm.input && strm.avail_in !== 0) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n s.strm = strm; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n else // DEFLATE header\n {\n var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n var level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush));\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n trees._tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var s;\n var str, n;\n var wrap;\n var avail;\n var next;\n var input;\n var tmpDict;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n s = strm.state;\n wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n tmpDict = new utils.Buf8(s.w_size);\n utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n avail = strm.avail_in;\n next = strm.next_in;\n input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n str = s.strstart;\n n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","'use strict';\nmodule.exports = require('./lib');\n","'use strict';\n\n/** @type {import('./Reflect.getPrototypeOf')} */\nmodule.exports = (typeof Reflect !== 'undefined' && Reflect.getPrototypeOf) || null;\n","'use strict';\n\n/** @type {import('./floor')} */\nmodule.exports = Math.floor;\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","'use strict';\n\nvar possibleNames = require('possible-typed-array-names');\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\n\n/** @type {import('.')} */\nmodule.exports = function availableTypedArrays() {\n\tvar /** @type {ReturnType<typeof availableTypedArrays>} */ out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\t// @ts-expect-error\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict';\n\n/** @type {import('./range')} */\nmodule.exports = RangeError;\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar toStr = Object.prototype.toString;\nvar max = Math.max;\nvar funcType = '[object Function]';\n\nvar concatty = function concatty(a, b) {\n var arr = [];\n\n for (var i = 0; i < a.length; i += 1) {\n arr[i] = a[i];\n }\n for (var j = 0; j < b.length; j += 1) {\n arr[j + a.length] = b[j];\n }\n\n return arr;\n};\n\nvar slicy = function slicy(arrLike, offset) {\n var arr = [];\n for (var i = offset || 0, j = 0; i < arrLike.length; i += 1, j += 1) {\n arr[j] = arrLike[i];\n }\n return arr;\n};\n\nvar joiny = function (arr, joiner) {\n var str = '';\n for (var i = 0; i < arr.length; i += 1) {\n str += arr[i];\n if (i + 1 < arr.length) {\n str += joiner;\n }\n }\n return str;\n};\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.apply(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slicy(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n concatty(args, arguments)\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n }\n return target.apply(\n that,\n concatty(args, arguments)\n );\n\n };\n\n var boundLength = max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs[i] = '$' + i;\n }\n\n bound = Function('binder', 'return function (' + joiny(boundArgs, ',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Error;\n","'use strict';\n\n/** @type {import('./ref')} */\nmodule.exports = ReferenceError;\n","'use strict';\n\nvar fnToStr = Function.prototype.toString;\nvar reflectApply = typeof Reflect === 'object' && Reflect !== null && Reflect.apply;\nvar badArrayLike;\nvar isCallableMarker;\nif (typeof reflectApply === 'function' && typeof Object.defineProperty === 'function') {\n\ttry {\n\t\tbadArrayLike = Object.defineProperty({}, 'length', {\n\t\t\tget: function () {\n\t\t\t\tthrow isCallableMarker;\n\t\t\t}\n\t\t});\n\t\tisCallableMarker = {};\n\t\t// eslint-disable-next-line no-throw-literal\n\t\treflectApply(function () { throw 42; }, null, badArrayLike);\n\t} catch (_) {\n\t\tif (_ !== isCallableMarker) {\n\t\t\treflectApply = null;\n\t\t}\n\t}\n} else {\n\treflectApply = null;\n}\n\nvar constructorRegex = /^\\s*class\\b/;\nvar isES6ClassFn = function isES6ClassFunction(value) {\n\ttry {\n\t\tvar fnStr = fnToStr.call(value);\n\t\treturn constructorRegex.test(fnStr);\n\t} catch (e) {\n\t\treturn false; // not a function\n\t}\n};\n\nvar tryFunctionObject = function tryFunctionToStr(value) {\n\ttry {\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tfnToStr.call(value);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\nvar toStr = Object.prototype.toString;\nvar objectClass = '[object Object]';\nvar fnClass = '[object Function]';\nvar genClass = '[object GeneratorFunction]';\nvar ddaClass = '[object HTMLAllCollection]'; // IE 11\nvar ddaClass2 = '[object HTML document.all class]';\nvar ddaClass3 = '[object HTMLCollection]'; // IE 9-10\nvar hasToStringTag = typeof Symbol === 'function' && !!Symbol.toStringTag; // better: use `has-tostringtag`\n\nvar isIE68 = !(0 in [,]); // eslint-disable-line no-sparse-arrays, comma-spacing\n\nvar isDDA = function isDocumentDotAll() { return false; };\nif (typeof document === 'object') {\n\t// Firefox 3 canonicalizes DDA to undefined when it's not accessed directly\n\tvar all = document.all;\n\tif (toStr.call(all) === toStr.call(document.all)) {\n\t\tisDDA = function isDocumentDotAll(value) {\n\t\t\t/* globals document: false */\n\t\t\t// in IE 6-8, typeof document.all is \"object\" and it's truthy\n\t\t\tif ((isIE68 || !value) && (typeof value === 'undefined' || typeof value === 'object')) {\n\t\t\t\ttry {\n\t\t\t\t\tvar str = toStr.call(value);\n\t\t\t\t\treturn (\n\t\t\t\t\t\tstr === ddaClass\n\t\t\t\t\t\t|| str === ddaClass2\n\t\t\t\t\t\t|| str === ddaClass3 // opera 12.16\n\t\t\t\t\t\t|| str === objectClass // IE 6-8\n\t\t\t\t\t) && value('') == null; // eslint-disable-line eqeqeq\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t}\n}\n\nmodule.exports = reflectApply\n\t? function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\ttry {\n\t\t\treflectApply(value, null, badArrayLike);\n\t\t} catch (e) {\n\t\t\tif (e !== isCallableMarker) { return false; }\n\t\t}\n\t\treturn !isES6ClassFn(value) && tryFunctionObject(value);\n\t}\n\t: function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\tif (hasToStringTag) { return tryFunctionObject(value); }\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tvar strClass = toStr.call(value);\n\t\tif (strClass !== fnClass && strClass !== genClass && !(/^\\[object HTML/).test(strClass)) { return false; }\n\t\treturn tryFunctionObject(value);\n\t};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Object;\n","'use strict';\n\n/** @type {import('./type')} */\nmodule.exports = TypeError;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n return;\n }\n // Fallback to ordinary array\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n};\n\nvar fnUntyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n};\n\nexports.setTyped(TYPED_OK);\n","'use strict';\n\nvar call = Function.prototype.call;\nvar $hasOwn = Object.prototype.hasOwnProperty;\nvar bind = require('function-bind');\n\n/** @type {import('.')} */\nmodule.exports = bind.call(call, $hasOwn);\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","// This is straight from parse_unit_factor in config.c of canonical git\nconst num = val => {\n if (typeof val === 'number') {\n return val\n }\n\n val = val.toLowerCase()\n let n = parseInt(val)\n if (val.endsWith('k')) n *= 1024\n if (val.endsWith('m')) n *= 1024 * 1024\n if (val.endsWith('g')) n *= 1024 * 1024 * 1024\n return n\n}\n\n// This is straight from git_parse_maybe_bool_text in config.c of canonical git\nconst bool = val => {\n if (typeof val === 'boolean') {\n return val\n }\n\n val = val.trim().toLowerCase()\n if (val === 'true' || val === 'yes' || val === 'on') return true\n if (val === 'false' || val === 'no' || val === 'off') return false\n throw Error(\n `Expected 'true', 'false', 'yes', 'no', 'on', or 'off', but got ${val}`\n )\n}\n\nconst schema = {\n core: {\n filemode: bool,\n bare: bool,\n logallrefupdates: bool,\n symlinks: bool,\n ignorecase: bool,\n bigFileThreshold: num,\n },\n}\n\n// https://git-scm.com/docs/git-config#_syntax\n\n// section starts with [ and ends with ]\n// section is alphanumeric (ASCII) with - and .\n// section is case insensitive\n// subsection is optional\n// subsection is specified after section and one or more spaces\n// subsection is specified between double quotes\nconst SECTION_LINE_REGEX = /^\\[([A-Za-z0-9-.]+)(?: \"(.*)\")?\\]$/\nconst SECTION_REGEX = /^[A-Za-z0-9-.]+$/\n\n// variable lines contain a name, and equal sign and then a value\n// variable lines can also only contain a name (the implicit value is a boolean true)\n// variable name is alphanumeric (ASCII) with -\n// variable name starts with an alphabetic character\n// variable name is case insensitive\nconst VARIABLE_LINE_REGEX = /^([A-Za-z][A-Za-z-]*)(?: *= *(.*))?$/\nconst VARIABLE_NAME_REGEX = /^[A-Za-z][A-Za-z-]*$/\n\n// Comments start with either # or ; and extend to the end of line\nconst VARIABLE_VALUE_COMMENT_REGEX = /^(.*?)( *[#;].*)$/\n\nconst extractSectionLine = line => {\n const matches = SECTION_LINE_REGEX.exec(line)\n if (matches != null) {\n const [section, subsection] = matches.slice(1)\n return [section, subsection]\n }\n return null\n}\n\nconst extractVariableLine = line => {\n const matches = VARIABLE_LINE_REGEX.exec(line)\n if (matches != null) {\n const [name, rawValue = 'true'] = matches.slice(1)\n const valueWithoutComments = removeComments(rawValue)\n const valueWithoutQuotes = removeQuotes(valueWithoutComments)\n return [name, valueWithoutQuotes]\n }\n return null\n}\n\nconst removeComments = rawValue => {\n const commentMatches = VARIABLE_VALUE_COMMENT_REGEX.exec(rawValue)\n if (commentMatches == null) {\n return rawValue\n }\n const [valueWithoutComment, comment] = commentMatches.slice(1)\n // if odd number of quotes before and after comment => comment is escaped\n if (\n hasOddNumberOfQuotes(valueWithoutComment) &&\n hasOddNumberOfQuotes(comment)\n ) {\n return `${valueWithoutComment}${comment}`\n }\n return valueWithoutComment\n}\n\nconst hasOddNumberOfQuotes = text => {\n const numberOfQuotes = (text.match(/(?:^|[^\\\\])\"/g) || []).length\n return numberOfQuotes % 2 !== 0\n}\n\nconst removeQuotes = text => {\n return text.split('').reduce((newText, c, idx, text) => {\n const isQuote = c === '\"' && text[idx - 1] !== '\\\\'\n const isEscapeForQuote = c === '\\\\' && text[idx + 1] === '\"'\n if (isQuote || isEscapeForQuote) {\n return newText\n }\n return newText + c\n }, '')\n}\n\nconst lower = text => {\n return text != null ? text.toLowerCase() : null\n}\n\nconst getPath = (section, subsection, name) => {\n return [lower(section), subsection, lower(name)]\n .filter(a => a != null)\n .join('.')\n}\n\nconst normalizePath = path => {\n const pathSegments = path.split('.')\n const section = pathSegments.shift()\n const name = pathSegments.pop()\n const subsection = pathSegments.length ? pathSegments.join('.') : undefined\n\n return {\n section,\n subsection,\n name,\n path: getPath(section, subsection, name),\n sectionPath: getPath(section, subsection, null),\n isSection: !!section,\n }\n}\n\nconst findLastIndex = (array, callback) => {\n return array.reduce((lastIndex, item, index) => {\n return callback(item) ? index : lastIndex\n }, -1)\n}\n\n// Note: there are a LOT of edge cases that aren't covered (e.g. keys in sections that also\n// have subsections, [include] directives, etc.\nexport class GitConfig {\n constructor(text) {\n let section = null\n let subsection = null\n this.parsedConfig = text\n ? text.split('\\n').map(line => {\n let name = null\n let value = null\n\n const trimmedLine = line.trim()\n const extractedSection = extractSectionLine(trimmedLine)\n const isSection = extractedSection != null\n if (isSection) {\n ;[section, subsection] = extractedSection\n } else {\n const extractedVariable = extractVariableLine(trimmedLine)\n const isVariable = extractedVariable != null\n if (isVariable) {\n ;[name, value] = extractedVariable\n }\n }\n\n const path = getPath(section, subsection, name)\n return { line, isSection, section, subsection, name, value, path }\n })\n : []\n }\n\n static from(text) {\n return new GitConfig(text)\n }\n\n async get(path, getall = false) {\n const normalizedPath = normalizePath(path).path\n const allValues = this.parsedConfig\n .filter(config => config.path === normalizedPath)\n .map(({ section, name, value }) => {\n const fn = schema[section] && schema[section][name]\n return fn ? fn(value) : value\n })\n return getall ? allValues : allValues.pop()\n }\n\n async getall(path) {\n return this.get(path, true)\n }\n\n async getSubsections(section) {\n return this.parsedConfig\n .filter(config => config.isSection && config.section === section)\n .map(config => config.subsection)\n }\n\n async deleteSection(section, subsection) {\n this.parsedConfig = this.parsedConfig.filter(\n config =>\n !(config.section === section && config.subsection === subsection)\n )\n }\n\n async append(path, value) {\n return this.set(path, value, true)\n }\n\n async set(path, value, append = false) {\n const {\n section,\n subsection,\n name,\n path: normalizedPath,\n sectionPath,\n isSection,\n } = normalizePath(path)\n\n const configIndex = findLastIndex(\n this.parsedConfig,\n config => config.path === normalizedPath\n )\n if (value == null) {\n if (configIndex !== -1) {\n this.parsedConfig.splice(configIndex, 1)\n }\n } else {\n if (configIndex !== -1) {\n const config = this.parsedConfig[configIndex]\n // Name should be overwritten in case the casing changed\n const modifiedConfig = Object.assign({}, config, {\n name,\n value,\n modified: true,\n })\n if (append) {\n this.parsedConfig.splice(configIndex + 1, 0, modifiedConfig)\n } else {\n this.parsedConfig[configIndex] = modifiedConfig\n }\n } else {\n const sectionIndex = this.parsedConfig.findIndex(\n config => config.path === sectionPath\n )\n const newConfig = {\n section,\n subsection,\n name,\n value,\n modified: true,\n path: normalizedPath,\n }\n if (SECTION_REGEX.test(section) && VARIABLE_NAME_REGEX.test(name)) {\n if (sectionIndex >= 0) {\n // Reuse existing section\n this.parsedConfig.splice(sectionIndex + 1, 0, newConfig)\n } else {\n // Add a new section\n const newSection = {\n isSection,\n section,\n subsection,\n modified: true,\n path: sectionPath,\n }\n this.parsedConfig.push(newSection, newConfig)\n }\n }\n }\n }\n }\n\n toString() {\n return this.parsedConfig\n .map(({ line, section, subsection, name, value, modified = false }) => {\n if (!modified) {\n return line\n }\n if (name != null && value != null) {\n if (typeof value === 'string' && /[#;]/.test(value)) {\n // A `#` or `;` symbol denotes a comment, so we have to wrap it in double quotes\n return `\\t${name} = \"${value}\"`\n }\n return `\\t${name} = ${value}`\n }\n if (subsection != null) {\n return `[${section} \"${subsection}\"]`\n }\n return `[${section}]`\n })\n .join('\\n')\n }\n}\n","import '../typedefs.js'\n\nimport { GitConfig } from '../models/GitConfig.js'\n\n/**\n * Manages access to the Git configuration file, providing methods to read and save configurations.\n */\nexport class GitConfigManager {\n /**\n * Reads the Git configuration file from the specified `.git` directory.\n *\n * @param {object} opts - Options for reading the Git configuration.\n * @param {FSClient} opts.fs - A file system implementation.\n * @param {string} opts.gitdir - The path to the `.git` directory.\n * @returns {Promise<GitConfig>} A `GitConfig` object representing the parsed configuration.\n */\n static async get({ fs, gitdir }) {\n // We can improve efficiency later if needed.\n // TODO: read from full list of git config files\n const text = await fs.read(`${gitdir}/config`, { encoding: 'utf8' })\n return GitConfig.from(text)\n }\n\n /**\n * Saves the provided Git configuration to the specified `.git` directory.\n *\n * @param {object} opts - Options for saving the Git configuration.\n * @param {FSClient} opts.fs - A file system implementation.\n * @param {string} opts.gitdir - The path to the `.git` directory.\n * @param {GitConfig} opts.config - The `GitConfig` object to save.\n * @returns {Promise<void>} Resolves when the configuration has been successfully saved.\n */\n static async save({ fs, gitdir, config }) {\n // We can improve efficiency later if needed.\n // TODO: handle saving to the correct global/user/repo location\n await fs.write(`${gitdir}/config`, config.toString(), {\n encoding: 'utf8',\n })\n }\n}\n","export function dirname(path) {\n const last = Math.max(path.lastIndexOf('/'), path.lastIndexOf('\\\\'))\n if (last === -1) return '.'\n if (last === 0) return '/'\n return path.slice(0, last)\n}\n","/*!\n * This code for `path.join` is directly copied from @zenfs/core/path for bundle size improvements.\n * SPDX-License-Identifier: LGPL-3.0-or-later\n * Copyright (c) James Prevett and other ZenFS contributors.\n */\n\nfunction normalizeString(path, aar) {\n let res = ''\n let lastSegmentLength = 0\n let lastSlash = -1\n let dots = 0\n let char = '\\x00'\n for (let i = 0; i <= path.length; ++i) {\n if (i < path.length) char = path[i]\n else if (char === '/') break\n else char = '/'\n\n if (char === '/') {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (dots === 2) {\n if (\n res.length < 2 ||\n lastSegmentLength !== 2 ||\n res.at(-1) !== '.' ||\n res.at(-2) !== '.'\n ) {\n if (res.length > 2) {\n const lastSlashIndex = res.lastIndexOf('/')\n if (lastSlashIndex === -1) {\n res = ''\n lastSegmentLength = 0\n } else {\n res = res.slice(0, lastSlashIndex)\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/')\n }\n lastSlash = i\n dots = 0\n continue\n } else if (res.length !== 0) {\n res = ''\n lastSegmentLength = 0\n lastSlash = i\n dots = 0\n continue\n }\n }\n if (aar) {\n res += res.length > 0 ? '/..' : '..'\n lastSegmentLength = 2\n }\n } else {\n if (res.length > 0) res += '/' + path.slice(lastSlash + 1, i)\n else res = path.slice(lastSlash + 1, i)\n lastSegmentLength = i - lastSlash - 1\n }\n lastSlash = i\n dots = 0\n } else if (char === '.' && dots !== -1) {\n ++dots\n } else {\n dots = -1\n }\n }\n return res\n}\n\nfunction normalize(path) {\n if (!path.length) return '.'\n\n const isAbsolute = path[0] === '/'\n const trailingSeparator = path.at(-1) === '/'\n\n path = normalizeString(path, !isAbsolute)\n\n if (!path.length) {\n if (isAbsolute) return '/'\n return trailingSeparator ? './' : '.'\n }\n if (trailingSeparator) path += '/'\n\n return isAbsolute ? `/${path}` : path\n}\n\nexport function join(...args) {\n if (args.length === 0) return '.'\n let joined\n for (let i = 0; i < args.length; ++i) {\n const arg = args[i]\n if (arg.length > 0) {\n if (joined === undefined) joined = arg\n else joined += '/' + arg\n }\n }\n if (joined === undefined) return '.'\n return normalize(joined)\n}\n","import '../typedefs.js'\n\nimport ignore from 'ignore'\n\nimport { basename } from '../utils/basename.js'\nimport { dirname } from '../utils/dirname.js'\nimport { join } from '../utils/join.js'\n\n// I'm putting this in a Manager because I reckon it could benefit\n// from a LOT of caching.\nexport class GitIgnoreManager {\n /**\n * Determines whether a given file is ignored based on `.gitignore` rules and exclusion files.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} args.dir - The working directory.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.filepath - The path of the file to check.\n * @returns {Promise<boolean>} - `true` if the file is ignored, `false` otherwise.\n */\n static async isIgnored({ fs, dir, gitdir = join(dir, '.git'), filepath }) {\n // ALWAYS ignore \".git\" folders.\n if (basename(filepath) === '.git') return true\n // '.' is not a valid gitignore entry, so '.' is never ignored\n if (filepath === '.') return false\n // Check and load exclusion rules from project exclude file (.git/info/exclude)\n let excludes = ''\n const excludesFile = join(gitdir, 'info', 'exclude')\n if (await fs.exists(excludesFile)) {\n excludes = await fs.read(excludesFile, 'utf8')\n }\n // Find all the .gitignore files that could affect this file\n const pairs = [\n {\n gitignore: join(dir, '.gitignore'),\n filepath,\n },\n ]\n const pieces = filepath.split('/').filter(Boolean)\n for (let i = 1; i < pieces.length; i++) {\n const folder = pieces.slice(0, i).join('/')\n const file = pieces.slice(i).join('/')\n pairs.push({\n gitignore: join(dir, folder, '.gitignore'),\n filepath: file,\n })\n }\n let ignoredStatus = false\n for (const p of pairs) {\n let file\n try {\n file = await fs.read(p.gitignore, 'utf8')\n } catch (err) {\n if (err.code === 'NOENT') continue\n }\n const ign = ignore().add(excludes)\n ign.add(file)\n // If the parent directory is excluded, we are done.\n // \"It is not possible to re-include a file if a parent directory of that file is excluded. Git doesn’t list excluded directories for performance reasons, so any patterns on contained files have no effect, no matter where they are defined.\"\n // source: https://git-scm.com/docs/gitignore\n const parentdir = dirname(p.filepath)\n if (parentdir !== '.' && ign.ignores(parentdir)) return true\n // If the file is currently ignored, test for UNignoring.\n if (ignoredStatus) {\n ignoredStatus = !ign.test(p.filepath).unignored\n } else {\n ignoredStatus = ign.test(p.filepath).ignored\n }\n }\n return ignoredStatus\n }\n}\n","export function basename(path) {\n const last = Math.max(path.lastIndexOf('/'), path.lastIndexOf('\\\\'))\n if (last > -1) {\n path = path.slice(last + 1)\n }\n return path\n}\n","export class BaseError extends Error {\n constructor(message) {\n super(message)\n // Setting this here allows TS to infer that all git errors have a `caller` property and\n // that its type is string.\n this.caller = ''\n }\n\n toJSON() {\n // Error objects aren't normally serializable. So we do something about that.\n return {\n code: this.code,\n data: this.data,\n caller: this.caller,\n message: this.message,\n stack: this.stack,\n }\n }\n\n fromJSON(json) {\n const e = new BaseError(json.message)\n e.code = json.code\n e.data = json.data\n e.caller = json.caller\n e.stack = json.stack\n return e\n }\n\n get isIsomorphicGitError() {\n return true\n }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class UnmergedPathsError extends BaseError {\n /**\n * @param {Array<string>} filepaths\n */\n constructor(filepaths) {\n super(\n `Modifying the index is not possible because you have unmerged files: ${filepaths.toString}. Fix them up in the work tree, and then use 'git add/rm as appropriate to mark resolution and make a commit.`\n )\n this.code = this.name = UnmergedPathsError.code\n this.data = { filepaths }\n }\n}\n/** @type {'UnmergedPathsError'} */\nUnmergedPathsError.code = 'UnmergedPathsError'\n","import { BaseError } from './BaseError.js'\n\nexport class InternalError extends BaseError {\n /**\n * @param {string} message\n */\n constructor(message) {\n super(\n `An internal error caused this command to fail.\\n\\nIf you're not a developer, report the bug to the developers of the application you're using. If this is a bug in isomorphic-git then you should create a proper bug yourselves. The bug should include a minimal reproduction and details about the version and environment.\\n\\nPlease file a bug report at https://github.com/isomorphic-git/isomorphic-git/issues with this error message: ${message}`\n )\n this.code = this.name = InternalError.code\n this.data = { message }\n }\n}\n/** @type {'InternalError'} */\nInternalError.code = 'InternalError'\n","import { BaseError } from './BaseError.js'\n\nexport class UnsafeFilepathError extends BaseError {\n /**\n * @param {string} filepath\n */\n constructor(filepath) {\n super(`The filepath \"${filepath}\" contains unsafe character sequences`)\n this.code = this.name = UnsafeFilepathError.code\n this.data = { filepath }\n }\n}\n/** @type {'UnsafeFilepathError'} */\nUnsafeFilepathError.code = 'UnsafeFilepathError'\n","// Modeled after https://github.com/tjfontaine/node-buffercursor\n// but with the goal of being much lighter weight.\nexport class BufferCursor {\n constructor(buffer) {\n this.buffer = buffer\n this._start = 0\n }\n\n eof() {\n return this._start >= this.buffer.length\n }\n\n tell() {\n return this._start\n }\n\n seek(n) {\n this._start = n\n }\n\n slice(n) {\n const r = this.buffer.slice(this._start, this._start + n)\n this._start += n\n return r\n }\n\n toString(enc, length) {\n const r = this.buffer.toString(enc, this._start, this._start + length)\n this._start += length\n return r\n }\n\n write(value, length, enc) {\n const r = this.buffer.write(value, this._start, length, enc)\n this._start += length\n return r\n }\n\n copy(source, start, end) {\n const r = source.copy(this.buffer, this._start, start, end)\n this._start += r\n return r\n }\n\n readUInt8() {\n const r = this.buffer.readUInt8(this._start)\n this._start += 1\n return r\n }\n\n writeUInt8(value) {\n const r = this.buffer.writeUInt8(value, this._start)\n this._start += 1\n return r\n }\n\n readUInt16BE() {\n const r = this.buffer.readUInt16BE(this._start)\n this._start += 2\n return r\n }\n\n writeUInt16BE(value) {\n const r = this.buffer.writeUInt16BE(value, this._start)\n this._start += 2\n return r\n }\n\n readUInt32BE() {\n const r = this.buffer.readUInt32BE(this._start)\n this._start += 4\n return r\n }\n\n writeUInt32BE(value) {\n const r = this.buffer.writeUInt32BE(value, this._start)\n this._start += 4\n return r\n }\n}\n","import { compareStrings } from './compareStrings.js'\n\nexport function comparePath(a, b) {\n // https://stackoverflow.com/a/40355107/2168416\n return compareStrings(a.path, b.path)\n}\n","export function compareStrings(a, b) {\n // https://stackoverflow.com/a/40355107/2168416\n return -(a < b) || +(a > b)\n}\n","/**\n * From https://github.com/git/git/blob/master/Documentation/technical/index-format.txt\n *\n * 32-bit mode, split into (high to low bits)\n *\n * 4-bit object type\n * valid values in binary are 1000 (regular file), 1010 (symbolic link)\n * and 1110 (gitlink)\n *\n * 3-bit unused\n *\n * 9-bit unix permission. Only 0755 and 0644 are valid for regular files.\n * Symbolic links and gitlinks have value 0 in this field.\n */\nexport function normalizeMode(mode) {\n // Note: BrowserFS will use -1 for \"unknown\"\n // I need to make it non-negative for these bitshifts to work.\n let type = mode > 0 ? mode >> 12 : 0\n // If it isn't valid, assume it as a \"regular file\"\n // 0100 = directory\n // 1000 = regular file\n // 1010 = symlink\n // 1110 = gitlink\n if (\n type !== 0b0100 &&\n type !== 0b1000 &&\n type !== 0b1010 &&\n type !== 0b1110\n ) {\n type = 0b1000\n }\n let permissions = mode & 0o777\n // Is the file executable? then 755. Else 644.\n if (permissions & 0b001001001) {\n permissions = 0o755\n } else {\n permissions = 0o644\n }\n // If it's not a regular file, scrub all permissions\n if (type !== 0b1000) permissions = 0\n return (type << 12) + permissions\n}\n","import { normalizeMode } from './normalizeMode.js'\n\nconst MAX_UINT32 = 2 ** 32\n\nfunction SecondsNanoseconds(\n givenSeconds,\n givenNanoseconds,\n milliseconds,\n date\n) {\n if (givenSeconds !== undefined && givenNanoseconds !== undefined) {\n return [givenSeconds, givenNanoseconds]\n }\n if (milliseconds === undefined) {\n milliseconds = date.valueOf()\n }\n const seconds = Math.floor(milliseconds / 1000)\n const nanoseconds = (milliseconds - seconds * 1000) * 1000000\n return [seconds, nanoseconds]\n}\n\nexport function normalizeStats(e) {\n const [ctimeSeconds, ctimeNanoseconds] = SecondsNanoseconds(\n e.ctimeSeconds,\n e.ctimeNanoseconds,\n e.ctimeMs,\n e.ctime\n )\n const [mtimeSeconds, mtimeNanoseconds] = SecondsNanoseconds(\n e.mtimeSeconds,\n e.mtimeNanoseconds,\n e.mtimeMs,\n e.mtime\n )\n\n return {\n ctimeSeconds: ctimeSeconds % MAX_UINT32,\n ctimeNanoseconds: ctimeNanoseconds % MAX_UINT32,\n mtimeSeconds: mtimeSeconds % MAX_UINT32,\n mtimeNanoseconds: mtimeNanoseconds % MAX_UINT32,\n dev: e.dev % MAX_UINT32,\n ino: e.ino % MAX_UINT32,\n mode: normalizeMode(e.mode % MAX_UINT32),\n uid: e.uid % MAX_UINT32,\n gid: e.gid % MAX_UINT32,\n // size of -1 happens over a BrowserFS HTTP Backend that doesn't serve Content-Length headers\n // (like the Karma webserver) because BrowserFS HTTP Backend uses HTTP HEAD requests to do fs.stat\n size: e.size > -1 ? e.size % MAX_UINT32 : 0,\n }\n}\n","/* eslint-env node, browser */\nimport Hash from 'sha.js/sha1.js'\n\nimport { toHex } from './toHex.js'\n\nlet supportsSubtleSHA1 = null\n\nexport async function shasum(buffer) {\n if (supportsSubtleSHA1 === null) {\n supportsSubtleSHA1 = await testSubtleSHA1()\n }\n return supportsSubtleSHA1 ? subtleSHA1(buffer) : shasumSync(buffer)\n}\n\n// This is modeled after @dominictarr's \"shasum\" module,\n// but without the 'json-stable-stringify' dependency and\n// extra type-casting features.\nfunction shasumSync(buffer) {\n return new Hash().update(buffer).digest('hex')\n}\n\nasync function subtleSHA1(buffer) {\n const hash = await crypto.subtle.digest('SHA-1', buffer)\n return toHex(hash)\n}\n\nasync function testSubtleSHA1() {\n // I'm using a rather crude method of progressive enhancement, because\n // some browsers that have crypto.subtle.digest don't actually implement SHA-1.\n try {\n const hash = await subtleSHA1(new Uint8Array([]))\n return hash === 'da39a3ee5e6b4b0d3255bfef95601890afd80709'\n } catch (_) {\n // no bother\n }\n return false\n}\n","export function toHex(buffer) {\n let hex = ''\n for (const byte of new Uint8Array(buffer)) {\n if (byte < 16) hex += '0'\n hex += byte.toString(16)\n }\n return hex\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { UnsafeFilepathError } from '../errors/UnsafeFilepathError.js'\nimport { BufferCursor } from '../utils/BufferCursor.js'\nimport { comparePath } from '../utils/comparePath.js'\nimport { normalizeStats } from '../utils/normalizeStats.js'\nimport { shasum } from '../utils/shasum.js'\n\n// Extract 1-bit assume-valid, 1-bit extended flag, 2-bit merge state flag, 12-bit path length flag\nfunction parseCacheEntryFlags(bits) {\n return {\n assumeValid: Boolean(bits & 0b1000000000000000),\n extended: Boolean(bits & 0b0100000000000000),\n stage: (bits & 0b0011000000000000) >> 12,\n nameLength: bits & 0b0000111111111111,\n }\n}\n\nfunction renderCacheEntryFlags(entry) {\n const flags = entry.flags\n // 1-bit extended flag (must be zero in version 2)\n flags.extended = false\n // 12-bit name length if the length is less than 0xFFF; otherwise 0xFFF\n // is stored in this field.\n flags.nameLength = Math.min(Buffer.from(entry.path).length, 0xfff)\n return (\n (flags.assumeValid ? 0b1000000000000000 : 0) +\n (flags.extended ? 0b0100000000000000 : 0) +\n ((flags.stage & 0b11) << 12) +\n (flags.nameLength & 0b111111111111)\n )\n}\n\nexport class GitIndex {\n /*::\n _entries: Map<string, CacheEntry>\n _dirty: boolean // Used to determine if index needs to be saved to filesystem\n */\n constructor(entries, unmergedPaths) {\n this._dirty = false\n this._unmergedPaths = unmergedPaths || new Set()\n this._entries = entries || new Map()\n }\n\n _addEntry(entry) {\n if (entry.flags.stage === 0) {\n entry.stages = [entry]\n this._entries.set(entry.path, entry)\n this._unmergedPaths.delete(entry.path)\n } else {\n let existingEntry = this._entries.get(entry.path)\n if (!existingEntry) {\n this._entries.set(entry.path, entry)\n existingEntry = entry\n }\n existingEntry.stages[entry.flags.stage] = entry\n this._unmergedPaths.add(entry.path)\n }\n }\n\n static async from(buffer) {\n if (Buffer.isBuffer(buffer)) {\n return GitIndex.fromBuffer(buffer)\n } else if (buffer === null) {\n return new GitIndex(null)\n } else {\n throw new InternalError('invalid type passed to GitIndex.from')\n }\n }\n\n static async fromBuffer(buffer) {\n if (buffer.length === 0) {\n throw new InternalError('Index file is empty (.git/index)')\n }\n\n const index = new GitIndex()\n const reader = new BufferCursor(buffer)\n const magic = reader.toString('utf8', 4)\n if (magic !== 'DIRC') {\n throw new InternalError(`Invalid dircache magic file number: ${magic}`)\n }\n\n // Verify shasum after we ensured that the file has a magic number\n const shaComputed = await shasum(buffer.slice(0, -20))\n const shaClaimed = buffer.slice(-20).toString('hex')\n if (shaClaimed !== shaComputed) {\n throw new InternalError(\n `Invalid checksum in GitIndex buffer: expected ${shaClaimed} but saw ${shaComputed}`\n )\n }\n\n const version = reader.readUInt32BE()\n if (version !== 2) {\n throw new InternalError(`Unsupported dircache version: ${version}`)\n }\n const numEntries = reader.readUInt32BE()\n let i = 0\n while (!reader.eof() && i < numEntries) {\n const entry = {}\n entry.ctimeSeconds = reader.readUInt32BE()\n entry.ctimeNanoseconds = reader.readUInt32BE()\n entry.mtimeSeconds = reader.readUInt32BE()\n entry.mtimeNanoseconds = reader.readUInt32BE()\n entry.dev = reader.readUInt32BE()\n entry.ino = reader.readUInt32BE()\n entry.mode = reader.readUInt32BE()\n entry.uid = reader.readUInt32BE()\n entry.gid = reader.readUInt32BE()\n entry.size = reader.readUInt32BE()\n entry.oid = reader.slice(20).toString('hex')\n const flags = reader.readUInt16BE()\n entry.flags = parseCacheEntryFlags(flags)\n // TODO: handle if (version === 3 && entry.flags.extended)\n const pathlength = buffer.indexOf(0, reader.tell() + 1) - reader.tell()\n if (pathlength < 1) {\n throw new InternalError(`Got a path length of: ${pathlength}`)\n }\n // TODO: handle pathnames larger than 12 bits\n entry.path = reader.toString('utf8', pathlength)\n\n // Prevent malicious paths like \"..\\foo\"\n if (entry.path.includes('..\\\\') || entry.path.includes('../')) {\n throw new UnsafeFilepathError(entry.path)\n }\n\n // The next bit is awkward. We expect 1 to 8 null characters\n // such that the total size of the entry is a multiple of 8 bits.\n // (Hence subtract 12 bytes for the header.)\n let padding = 8 - ((reader.tell() - 12) % 8)\n if (padding === 0) padding = 8\n while (padding--) {\n const tmp = reader.readUInt8()\n if (tmp !== 0) {\n throw new InternalError(\n `Expected 1-8 null characters but got '${tmp}' after ${entry.path}`\n )\n } else if (reader.eof()) {\n throw new InternalError('Unexpected end of file')\n }\n }\n // end of awkward part\n entry.stages = []\n\n index._addEntry(entry)\n\n i++\n }\n return index\n }\n\n get unmergedPaths() {\n return [...this._unmergedPaths]\n }\n\n get entries() {\n return [...this._entries.values()].sort(comparePath)\n }\n\n get entriesMap() {\n return this._entries\n }\n\n get entriesFlat() {\n return [...this.entries].flatMap(entry => {\n return entry.stages.length > 1 ? entry.stages.filter(x => x) : entry\n })\n }\n\n *[Symbol.iterator]() {\n for (const entry of this.entries) {\n yield entry\n }\n }\n\n insert({ filepath, stats, oid, stage = 0 }) {\n if (!stats) {\n stats = {\n ctimeSeconds: 0,\n ctimeNanoseconds: 0,\n mtimeSeconds: 0,\n mtimeNanoseconds: 0,\n dev: 0,\n ino: 0,\n mode: 0,\n uid: 0,\n gid: 0,\n size: 0,\n }\n }\n stats = normalizeStats(stats)\n const bfilepath = Buffer.from(filepath)\n const entry = {\n ctimeSeconds: stats.ctimeSeconds,\n ctimeNanoseconds: stats.ctimeNanoseconds,\n mtimeSeconds: stats.mtimeSeconds,\n mtimeNanoseconds: stats.mtimeNanoseconds,\n dev: stats.dev,\n ino: stats.ino,\n // We provide a fallback value for `mode` here because not all fs\n // implementations assign it, but we use it in GitTree.\n // '100644' is for a \"regular non-executable file\"\n mode: stats.mode || 0o100644,\n uid: stats.uid,\n gid: stats.gid,\n size: stats.size,\n path: filepath,\n oid,\n flags: {\n assumeValid: false,\n extended: false,\n stage,\n nameLength: bfilepath.length < 0xfff ? bfilepath.length : 0xfff,\n },\n stages: [],\n }\n\n this._addEntry(entry)\n\n this._dirty = true\n }\n\n delete({ filepath }) {\n if (this._entries.has(filepath)) {\n this._entries.delete(filepath)\n } else {\n for (const key of this._entries.keys()) {\n if (key.startsWith(filepath + '/')) {\n this._entries.delete(key)\n }\n }\n }\n\n if (this._unmergedPaths.has(filepath)) {\n this._unmergedPaths.delete(filepath)\n }\n this._dirty = true\n }\n\n clear() {\n this._entries.clear()\n this._dirty = true\n }\n\n has({ filepath }) {\n return this._entries.has(filepath)\n }\n\n render() {\n return this.entries\n .map(entry => `${entry.mode.toString(8)} ${entry.oid} ${entry.path}`)\n .join('\\n')\n }\n\n static async _entryToBuffer(entry) {\n const bpath = Buffer.from(entry.path)\n // the fixed length + the filename + at least one null char => align by 8\n const length = Math.ceil((62 + bpath.length + 1) / 8) * 8\n const written = Buffer.alloc(length)\n const writer = new BufferCursor(written)\n const stat = normalizeStats(entry)\n writer.writeUInt32BE(stat.ctimeSeconds)\n writer.writeUInt32BE(stat.ctimeNanoseconds)\n writer.writeUInt32BE(stat.mtimeSeconds)\n writer.writeUInt32BE(stat.mtimeNanoseconds)\n writer.writeUInt32BE(stat.dev)\n writer.writeUInt32BE(stat.ino)\n writer.writeUInt32BE(stat.mode)\n writer.writeUInt32BE(stat.uid)\n writer.writeUInt32BE(stat.gid)\n writer.writeUInt32BE(stat.size)\n writer.write(entry.oid, 20, 'hex')\n writer.writeUInt16BE(renderCacheEntryFlags(entry))\n writer.write(entry.path, bpath.length, 'utf8')\n return written\n }\n\n async toObject() {\n const header = Buffer.alloc(12)\n const writer = new BufferCursor(header)\n writer.write('DIRC', 4, 'utf8')\n writer.writeUInt32BE(2)\n writer.writeUInt32BE(this.entriesFlat.length)\n\n let entryBuffers = []\n for (const entry of this.entries) {\n entryBuffers.push(GitIndex._entryToBuffer(entry))\n if (entry.stages.length > 1) {\n for (const stage of entry.stages) {\n if (stage && stage !== entry) {\n entryBuffers.push(GitIndex._entryToBuffer(stage))\n }\n }\n }\n }\n entryBuffers = await Promise.all(entryBuffers)\n\n const body = Buffer.concat(entryBuffers)\n const main = Buffer.concat([header, body])\n const sum = await shasum(main)\n return Buffer.concat([main, Buffer.from(sum, 'hex')])\n }\n}\n","import '../typedefs.js'\n\n// import LockManager from 'travix-lock-manager'\nimport AsyncLock from 'async-lock'\n\nimport { UnmergedPathsError } from '../errors/UnmergedPathsError.js'\nimport { GitIndex } from '../models/GitIndex.js'\nimport { compareStats } from '../utils/compareStats.js'\n\n// import Lock from '../utils.js'\n\n// const lm = new LockManager()\nlet lock = null\n\nconst IndexCache = Symbol('IndexCache')\n\n/**\n * Creates a cache object to store GitIndex and file stats.\n * @returns {object} A cache object with `map` and `stats` properties.\n */\nfunction createCache() {\n return {\n map: new Map(),\n stats: new Map(),\n }\n}\n\n/**\n * Updates the cached index file by reading the file system and parsing the Git index.\n * @param {FSClient} fs - A file system implementation.\n * @param {string} filepath - The path to the Git index file.\n * @param {object} cache - The cache object to update.\n * @returns {Promise<void>}\n */\nasync function updateCachedIndexFile(fs, filepath, cache) {\n const [stat, rawIndexFile] = await Promise.all([\n fs.lstat(filepath),\n fs.read(filepath),\n ])\n\n const index = await GitIndex.from(rawIndexFile)\n // cache the GitIndex object so we don't need to re-read it every time.\n cache.map.set(filepath, index)\n // Save the stat data for the index so we know whether the cached file is stale (modified by an outside process).\n cache.stats.set(filepath, stat)\n}\n\n/**\n * Determines whether the cached index file is stale by comparing file stats.\n * @param {FSClient} fs - A file system implementation.\n * @param {string} filepath - The path to the Git index file.\n * @param {object} cache - The cache object containing file stats.\n * @returns {Promise<boolean>} `true` if the index file is stale, otherwise `false`.\n */\nasync function isIndexStale(fs, filepath, cache) {\n const savedStats = cache.stats.get(filepath)\n if (savedStats === undefined) return true\n if (savedStats === null) return false\n\n const currStats = await fs.lstat(filepath)\n if (currStats === null) return false\n return compareStats(savedStats, currStats)\n}\n\nexport class GitIndexManager {\n /**\n * Manages access to the Git index file, ensuring thread-safe operations and caching.\n *\n * @param {object} opts - Options for acquiring the Git index.\n * @param {FSClient} opts.fs - A file system implementation.\n * @param {string} opts.gitdir - The path to the `.git` directory.\n * @param {object} opts.cache - A shared cache object for storing index data.\n * @param {boolean} [opts.allowUnmerged=true] - Whether to allow unmerged paths in the index.\n * @param {function(GitIndex): any} closure - A function to execute with the Git index.\n * @returns {Promise<any>} The result of the closure function.\n * @throws {UnmergedPathsError} If unmerged paths exist and `allowUnmerged` is `false`.\n */\n static async acquire({ fs, gitdir, cache, allowUnmerged = true }, closure) {\n if (!cache[IndexCache]) {\n cache[IndexCache] = createCache()\n }\n\n const filepath = `${gitdir}/index`\n if (lock === null) lock = new AsyncLock({ maxPending: Infinity })\n let result\n let unmergedPaths = []\n await lock.acquire(filepath, async () => {\n // Acquire a file lock while we're reading the index\n // to make sure other processes aren't writing to it\n // simultaneously, which could result in a corrupted index.\n // const fileLock = await Lock(filepath)\n const theIndexCache = cache[IndexCache]\n if (await isIndexStale(fs, filepath, theIndexCache)) {\n await updateCachedIndexFile(fs, filepath, theIndexCache)\n }\n const index = theIndexCache.map.get(filepath)\n unmergedPaths = index.unmergedPaths\n\n if (unmergedPaths.length && !allowUnmerged)\n throw new UnmergedPathsError(unmergedPaths)\n\n result = await closure(index)\n if (index._dirty) {\n // Acquire a file lock while we're writing the index file\n // let fileLock = await Lock(filepath)\n const buffer = await index.toObject()\n await fs.write(filepath, buffer)\n // Update cached stat value\n theIndexCache.stats.set(filepath, await fs.lstat(filepath))\n index._dirty = false\n }\n })\n\n return result\n }\n}\n","import { normalizeStats } from './normalizeStats.js'\n\nexport function compareStats(entry, stats, filemode = true, trustino = true) {\n // Comparison based on the description in Paragraph 4 of\n // https://www.kernel.org/pub/software/scm/git/docs/technical/racy-git.txt\n const e = normalizeStats(entry)\n const s = normalizeStats(stats)\n const staleness =\n (filemode && e.mode !== s.mode) ||\n e.mtimeSeconds !== s.mtimeSeconds ||\n e.ctimeSeconds !== s.ctimeSeconds ||\n e.uid !== s.uid ||\n e.gid !== s.gid ||\n (trustino && e.ino !== s.ino) ||\n e.size !== s.size\n return staleness\n}\n","import { BaseError } from './BaseError.js'\n\nexport class InvalidOidError extends BaseError {\n /**\n * @param {string} value\n */\n constructor(value) {\n super(`Expected a 40-char hex object id but saw \"${value}\".`)\n this.code = this.name = InvalidOidError.code\n this.data = { value }\n }\n}\n/** @type {'InvalidOidError'} */\nInvalidOidError.code = 'InvalidOidError'\n","import { BaseError } from './BaseError.js'\n\nexport class NoRefspecError extends BaseError {\n /**\n * @param {string} remote\n */\n constructor(remote) {\n super(`Could not find a fetch refspec for remote \"${remote}\". Make sure the config file has an entry like the following:\n[remote \"${remote}\"]\n\\tfetch = +refs/heads/*:refs/remotes/origin/*\n`)\n this.code = this.name = NoRefspecError.code\n this.data = { remote }\n }\n}\n/** @type {'NoRefspecError'} */\nNoRefspecError.code = 'NoRefspecError'\n","import { BaseError } from './BaseError.js'\n\nexport class NotFoundError extends BaseError {\n /**\n * @param {string} what\n */\n constructor(what) {\n super(`Could not find ${what}.`)\n this.code = this.name = NotFoundError.code\n this.data = { what }\n }\n}\n/** @type {'NotFoundError'} */\nNotFoundError.code = 'NotFoundError'\n","export class GitPackedRefs {\n constructor(text) {\n this.refs = new Map()\n this.parsedConfig = []\n if (text) {\n let key = null\n this.parsedConfig = text\n .trim()\n .split('\\n')\n .map(line => {\n if (/^\\s*#/.test(line)) {\n return { line, comment: true }\n }\n const i = line.indexOf(' ')\n if (line.startsWith('^')) {\n // This is a oid for the commit associated with the annotated tag immediately preceding this line.\n // Trim off the '^'\n const value = line.slice(1)\n // The tagname^{} syntax is based on the output of `git show-ref --tags -d`\n this.refs.set(key + '^{}', value)\n return { line, ref: key, peeled: value }\n } else {\n // This is an oid followed by the ref name\n const value = line.slice(0, i)\n key = line.slice(i + 1)\n this.refs.set(key, value)\n return { line, ref: key, oid: value }\n }\n })\n }\n return this\n }\n\n static from(text) {\n return new GitPackedRefs(text)\n }\n\n delete(ref) {\n this.parsedConfig = this.parsedConfig.filter(entry => entry.ref !== ref)\n this.refs.delete(ref)\n }\n\n toString() {\n return this.parsedConfig.map(({ line }) => line).join('\\n') + '\\n'\n }\n}\n","import { InternalError } from '../errors/InternalError.js'\n\nexport class GitRefSpec {\n constructor({ remotePath, localPath, force, matchPrefix }) {\n Object.assign(this, {\n remotePath,\n localPath,\n force,\n matchPrefix,\n })\n }\n\n static from(refspec) {\n const [forceMatch, remotePath, remoteGlobMatch, localPath, localGlobMatch] =\n refspec.match(/^(\\+?)(.*?)(\\*?):(.*?)(\\*?)$/).slice(1)\n const force = forceMatch === '+'\n const remoteIsGlob = remoteGlobMatch === '*'\n const localIsGlob = localGlobMatch === '*'\n // validate\n // TODO: Make this check more nuanced, and depend on whether this is a fetch refspec or a push refspec\n if (remoteIsGlob !== localIsGlob) {\n throw new InternalError('Invalid refspec')\n }\n return new GitRefSpec({\n remotePath,\n localPath,\n force,\n matchPrefix: remoteIsGlob,\n })\n // TODO: We need to run resolveRef on both paths to expand them to their full name.\n }\n\n translate(remoteBranch) {\n if (this.matchPrefix) {\n if (remoteBranch.startsWith(this.remotePath)) {\n return this.localPath + remoteBranch.replace(this.remotePath, '')\n }\n } else {\n if (remoteBranch === this.remotePath) return this.localPath\n }\n return null\n }\n\n reverseTranslate(localBranch) {\n if (this.matchPrefix) {\n if (localBranch.startsWith(this.localPath)) {\n return this.remotePath + localBranch.replace(this.localPath, '')\n }\n } else {\n if (localBranch === this.localPath) return this.remotePath\n }\n return null\n }\n}\n","import { GitRefSpec } from './GitRefSpec.js'\n\nexport class GitRefSpecSet {\n constructor(rules = []) {\n this.rules = rules\n }\n\n static from(refspecs) {\n const rules = []\n for (const refspec of refspecs) {\n rules.push(GitRefSpec.from(refspec)) // might throw\n }\n return new GitRefSpecSet(rules)\n }\n\n add(refspec) {\n const rule = GitRefSpec.from(refspec) // might throw\n this.rules.push(rule)\n }\n\n translate(remoteRefs) {\n const result = []\n for (const rule of this.rules) {\n for (const remoteRef of remoteRefs) {\n const localRef = rule.translate(remoteRef)\n if (localRef) {\n result.push([remoteRef, localRef])\n }\n }\n }\n return result\n }\n\n translateOne(remoteRef) {\n let result = null\n for (const rule of this.rules) {\n const localRef = rule.translate(remoteRef)\n if (localRef) {\n result = localRef\n }\n }\n return result\n }\n\n localNamespaces() {\n return this.rules\n .filter(rule => rule.matchPrefix)\n .map(rule => rule.localPath.replace(/\\/$/, ''))\n }\n}\n","export function compareRefNames(a, b) {\n // https://stackoverflow.com/a/40355107/2168416\n const _a = a.replace(/\\^\\{\\}$/, '')\n const _b = b.replace(/\\^\\{\\}$/, '')\n const tmp = -(_a < _b) || +(_a > _b)\n if (tmp === 0) {\n return a.endsWith('^{}') ? 1 : -1\n }\n return tmp\n}\n","import '../typedefs.js'\n\n// This is a convenience wrapper for reading and writing files in the 'refs' directory.\nimport AsyncLock from 'async-lock'\n\nimport { InvalidOidError } from '../errors/InvalidOidError.js'\nimport { NoRefspecError } from '../errors/NoRefspecError.js'\nimport { NotFoundError } from '../errors/NotFoundError.js'\nimport { GitPackedRefs } from '../models/GitPackedRefs.js'\nimport { GitRefSpecSet } from '../models/GitRefSpecSet.js'\nimport { compareRefNames } from '../utils/compareRefNames.js'\nimport { join } from '../utils/join.js'\n\nimport { GitConfigManager } from './GitConfigManager.js'\n\n// @see https://git-scm.com/docs/git-rev-parse.html#_specifying_revisions\nconst refpaths = ref => [\n `${ref}`,\n `refs/${ref}`,\n `refs/tags/${ref}`,\n `refs/heads/${ref}`,\n `refs/remotes/${ref}`,\n `refs/remotes/${ref}/HEAD`,\n]\n\n// @see https://git-scm.com/docs/gitrepository-layout\nconst GIT_FILES = ['config', 'description', 'index', 'shallow', 'commondir']\n\nlet lock\n\nasync function acquireLock(ref, callback) {\n if (lock === undefined) lock = new AsyncLock()\n return lock.acquire(ref, callback)\n}\n\n/**\n * A class for managing Git references, including reading, writing, deleting, and resolving refs.\n */\nexport class GitRefManager {\n /**\n * Updates remote refs based on the provided refspecs and options.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.remote - The name of the remote.\n * @param {Map<string, string>} args.refs - A map of refs to their object IDs.\n * @param {Map<string, string>} args.symrefs - A map of symbolic refs.\n * @param {boolean} args.tags - Whether to fetch tags.\n * @param {string[]} [args.refspecs = undefined] - The refspecs to use.\n * @param {boolean} [args.prune = false] - Whether to prune stale refs.\n * @param {boolean} [args.pruneTags = false] - Whether to prune tags.\n * @returns {Promise<Object>} - An object containing pruned refs.\n */\n static async updateRemoteRefs({\n fs,\n gitdir,\n remote,\n refs,\n symrefs,\n tags,\n refspecs = undefined,\n prune = false,\n pruneTags = false,\n }) {\n // Validate input\n for (const value of refs.values()) {\n if (!value.match(/[0-9a-f]{40}/)) {\n throw new InvalidOidError(value)\n }\n }\n const config = await GitConfigManager.get({ fs, gitdir })\n if (!refspecs) {\n refspecs = await config.getall(`remote.${remote}.fetch`)\n if (refspecs.length === 0) {\n throw new NoRefspecError(remote)\n }\n // There's some interesting behavior with HEAD that doesn't follow the refspec.\n refspecs.unshift(`+HEAD:refs/remotes/${remote}/HEAD`)\n }\n const refspec = GitRefSpecSet.from(refspecs)\n const actualRefsToWrite = new Map()\n // Delete all current tags if the pruneTags argument is true.\n if (pruneTags) {\n const tags = await GitRefManager.listRefs({\n fs,\n gitdir,\n filepath: 'refs/tags',\n })\n await GitRefManager.deleteRefs({\n fs,\n gitdir,\n refs: tags.map(tag => `refs/tags/${tag}`),\n })\n }\n // Add all tags if the fetch tags argument is true.\n if (tags) {\n for (const serverRef of refs.keys()) {\n if (serverRef.startsWith('refs/tags') && !serverRef.endsWith('^{}')) {\n // Git's behavior is to only fetch tags that do not conflict with tags already present.\n if (!(await GitRefManager.exists({ fs, gitdir, ref: serverRef }))) {\n // Always use the object id of the tag itself, and not the peeled object id.\n const oid = refs.get(serverRef)\n actualRefsToWrite.set(serverRef, oid)\n }\n }\n }\n }\n // Combine refs and symrefs giving symrefs priority\n const refTranslations = refspec.translate([...refs.keys()])\n for (const [serverRef, translatedRef] of refTranslations) {\n const value = refs.get(serverRef)\n actualRefsToWrite.set(translatedRef, value)\n }\n const symrefTranslations = refspec.translate([...symrefs.keys()])\n for (const [serverRef, translatedRef] of symrefTranslations) {\n const value = symrefs.get(serverRef)\n const symtarget = refspec.translateOne(value)\n if (symtarget) {\n actualRefsToWrite.set(translatedRef, `ref: ${symtarget}`)\n }\n }\n // If `prune` argument is true, clear out the existing local refspec roots\n const pruned = []\n if (prune) {\n for (const filepath of refspec.localNamespaces()) {\n const refs = (\n await GitRefManager.listRefs({\n fs,\n gitdir,\n filepath,\n })\n ).map(file => `${filepath}/${file}`)\n for (const ref of refs) {\n if (!actualRefsToWrite.has(ref)) {\n pruned.push(ref)\n }\n }\n }\n if (pruned.length > 0) {\n await GitRefManager.deleteRefs({ fs, gitdir, refs: pruned })\n }\n }\n // Update files\n // TODO: For large repos with a history of thousands of pull requests\n // (i.e. gitlab-ce) it would be vastly more efficient to write them\n // to .git/packed-refs.\n // The trick is to make sure we a) don't write a packed ref that is\n // already shadowed by a loose ref and b) don't loose any refs already\n // in packed-refs. Doing this efficiently may be difficult. A\n // solution that might work is\n // a) load the current packed-refs file\n // b) add actualRefsToWrite, overriding the existing values if present\n // c) enumerate all the loose refs currently in .git/refs/remotes/${remote}\n // d) overwrite their value with the new value.\n // Examples of refs we need to avoid writing in loose format for efficieny's sake\n // are .git/refs/remotes/origin/refs/remotes/remote_mirror_3059\n // and .git/refs/remotes/origin/refs/merge-requests\n for (const [key, value] of actualRefsToWrite) {\n await acquireLock(key, async () =>\n fs.write(join(gitdir, key), `${value.trim()}\\n`, 'utf8')\n )\n }\n return { pruned }\n }\n\n /**\n * Writes a ref to the file system.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to write.\n * @param {string} args.value - The object ID to write.\n * @returns {Promise<void>}\n */\n // TODO: make this less crude?\n static async writeRef({ fs, gitdir, ref, value }) {\n // Validate input\n if (!value.match(/[0-9a-f]{40}/)) {\n throw new InvalidOidError(value)\n }\n await acquireLock(ref, async () =>\n fs.write(join(gitdir, ref), `${value.trim()}\\n`, 'utf8')\n )\n }\n\n /**\n * Writes a symbolic ref to the file system.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to write.\n * @param {string} args.value - The target ref.\n * @returns {Promise<void>}\n */\n static async writeSymbolicRef({ fs, gitdir, ref, value }) {\n await acquireLock(ref, async () =>\n fs.write(join(gitdir, ref), 'ref: ' + `${value.trim()}\\n`, 'utf8')\n )\n }\n\n /**\n * Deletes a single ref.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to delete.\n * @returns {Promise<void>}\n */\n static async deleteRef({ fs, gitdir, ref }) {\n return GitRefManager.deleteRefs({ fs, gitdir, refs: [ref] })\n }\n\n /**\n * Deletes multiple refs.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string[]} args.refs - The refs to delete.\n * @returns {Promise<void>}\n */\n static async deleteRefs({ fs, gitdir, refs }) {\n // Delete regular ref\n await Promise.all(refs.map(ref => fs.rm(join(gitdir, ref))))\n // Delete any packed ref\n let text = await acquireLock('packed-refs', async () =>\n fs.read(`${gitdir}/packed-refs`, { encoding: 'utf8' })\n )\n const packed = GitPackedRefs.from(text)\n const beforeSize = packed.refs.size\n for (const ref of refs) {\n if (packed.refs.has(ref)) {\n packed.delete(ref)\n }\n }\n if (packed.refs.size < beforeSize) {\n text = packed.toString()\n await acquireLock('packed-refs', async () =>\n fs.write(`${gitdir}/packed-refs`, text, { encoding: 'utf8' })\n )\n }\n }\n\n /**\n * Resolves a ref to its object ID.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to resolve.\n * @param {number} [args.depth = undefined] - The maximum depth to resolve symbolic refs.\n * @returns {Promise<string>} - The resolved object ID.\n */\n static async resolve({ fs, gitdir, ref, depth = undefined }) {\n if (depth !== undefined) {\n depth--\n if (depth === -1) {\n return ref\n }\n }\n\n // Is it a ref pointer?\n if (ref.startsWith('ref: ')) {\n ref = ref.slice('ref: '.length)\n return GitRefManager.resolve({ fs, gitdir, ref, depth })\n }\n // Is it a complete and valid SHA?\n if (ref.length === 40 && /[0-9a-f]{40}/.test(ref)) {\n return ref\n }\n // We need to alternate between the file system and the packed-refs\n const packedMap = await GitRefManager.packedRefs({ fs, gitdir })\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref).filter(p => !GIT_FILES.includes(p)) // exclude git system files (#709)\n\n for (const ref of allpaths) {\n const sha = await acquireLock(\n ref,\n async () =>\n (await fs.read(`${gitdir}/${ref}`, { encoding: 'utf8' })) ||\n packedMap.get(ref)\n )\n if (sha) {\n return GitRefManager.resolve({ fs, gitdir, ref: sha.trim(), depth })\n }\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Checks if a ref exists.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to check.\n * @returns {Promise<boolean>} - True if the ref exists, false otherwise.\n */\n static async exists({ fs, gitdir, ref }) {\n try {\n await GitRefManager.expand({ fs, gitdir, ref })\n return true\n } catch (err) {\n return false\n }\n }\n\n /**\n * Expands a ref to its full name.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to expand.\n * @returns {Promise<string>} - The full ref name.\n */\n static async expand({ fs, gitdir, ref }) {\n // Is it a complete and valid SHA?\n if (ref.length === 40 && /[0-9a-f]{40}/.test(ref)) {\n return ref\n }\n // We need to alternate between the file system and the packed-refs\n const packedMap = await GitRefManager.packedRefs({ fs, gitdir })\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref)\n for (const ref of allpaths) {\n const refExists = await acquireLock(ref, async () =>\n fs.exists(`${gitdir}/${ref}`)\n )\n if (refExists) return ref\n if (packedMap.has(ref)) return ref\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Expands a ref against a provided map.\n *\n * @param {Object} args\n * @param {string} args.ref - The ref to expand.\n * @param {Map<string, string>} args.map - The map of refs.\n * @returns {Promise<string>} - The expanded ref.\n */\n static async expandAgainstMap({ ref, map }) {\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref)\n for (const ref of allpaths) {\n if (await map.has(ref)) return ref\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Resolves a ref against a provided map.\n *\n * @param {Object} args\n * @param {string} args.ref - The ref to resolve.\n * @param {string} [args.fullref = args.ref] - The full ref name.\n * @param {number} [args.depth = undefined] - The maximum depth to resolve symbolic refs.\n * @param {Map<string, string>} args.map - The map of refs.\n * @returns {Object} - An object containing the full ref and its object ID.\n */\n static resolveAgainstMap({ ref, fullref = ref, depth = undefined, map }) {\n if (depth !== undefined) {\n depth--\n if (depth === -1) {\n return { fullref, oid: ref }\n }\n }\n // Is it a ref pointer?\n if (ref.startsWith('ref: ')) {\n ref = ref.slice('ref: '.length)\n return GitRefManager.resolveAgainstMap({ ref, fullref, depth, map })\n }\n // Is it a complete and valid SHA?\n if (ref.length === 40 && /[0-9a-f]{40}/.test(ref)) {\n return { fullref, oid: ref }\n }\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref)\n for (const ref of allpaths) {\n const sha = map.get(ref)\n if (sha) {\n return GitRefManager.resolveAgainstMap({\n ref: sha.trim(),\n fullref: ref,\n depth,\n map,\n })\n }\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Reads the packed refs file and returns a map of refs.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @returns {Promise<Map<string, string>>} - A map of packed refs.\n */\n static async packedRefs({ fs, gitdir }) {\n const text = await acquireLock('packed-refs', async () =>\n fs.read(`${gitdir}/packed-refs`, { encoding: 'utf8' })\n )\n const packed = GitPackedRefs.from(text)\n return packed.refs\n }\n\n /**\n * Lists all refs matching a given filepath prefix.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.filepath - The filepath prefix to match.\n * @returns {Promise<string[]>} - A sorted list of refs.\n */\n static async listRefs({ fs, gitdir, filepath }) {\n const packedMap = GitRefManager.packedRefs({ fs, gitdir })\n let files = null\n try {\n files = await fs.readdirDeep(`${gitdir}/${filepath}`)\n files = files.map(x => x.replace(`${gitdir}/${filepath}/`, ''))\n } catch (err) {\n files = []\n }\n\n for (let key of (await packedMap).keys()) {\n // filter by prefix\n if (key.startsWith(filepath)) {\n // remove prefix\n key = key.replace(filepath + '/', '')\n // Don't include duplicates; the loose files have precedence anyway\n if (!files.includes(key)) {\n files.push(key)\n }\n }\n }\n // since we just appended things onto an array, we need to sort them now\n files.sort(compareRefNames)\n return files\n }\n\n /**\n * Lists all branches, optionally filtered by remote.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} [args.remote] - The remote to filter branches by.\n * @returns {Promise<string[]>} - A list of branch names.\n */\n static async listBranches({ fs, gitdir, remote }) {\n if (remote) {\n return GitRefManager.listRefs({\n fs,\n gitdir,\n filepath: `refs/remotes/${remote}`,\n })\n } else {\n return GitRefManager.listRefs({ fs, gitdir, filepath: `refs/heads` })\n }\n }\n\n /**\n * Lists all tags.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @returns {Promise<string[]>} - A list of tag names.\n */\n static async listTags({ fs, gitdir }) {\n const tags = await GitRefManager.listRefs({\n fs,\n gitdir,\n filepath: `refs/tags`,\n })\n return tags.filter(x => !x.endsWith('^{}'))\n }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class HttpError extends BaseError {\n /**\n * @param {number} statusCode\n * @param {string} statusMessage\n * @param {string} response\n */\n constructor(statusCode, statusMessage, response) {\n super(`HTTP Error: ${statusCode} ${statusMessage}`)\n this.code = this.name = HttpError.code\n this.data = { statusCode, statusMessage, response }\n }\n}\n/** @type {'HttpError'} */\nHttpError.code = 'HttpError'\n","import { BaseError } from './BaseError.js'\n\nexport class SmartHttpError extends BaseError {\n /**\n * @param {string} preview\n * @param {string} response\n */\n constructor(preview, response) {\n super(\n `Remote did not reply using the \"smart\" HTTP protocol. Expected \"001e# service=git-upload-pack\" but received: ${preview}`\n )\n this.code = this.name = SmartHttpError.code\n this.data = { preview, response }\n }\n}\n/** @type {'SmartHttpError'} */\nSmartHttpError.code = 'SmartHttpError'\n","import { BaseError } from './BaseError.js'\n\nexport class UserCanceledError extends BaseError {\n constructor() {\n super(`The operation was canceled.`)\n this.code = this.name = UserCanceledError.code\n this.data = {}\n }\n}\n/** @type {'UserCanceledError'} */\nUserCanceledError.code = 'UserCanceledError'\n","export function calculateBasicAuthHeader({ username = '', password = '' }) {\n return `Basic ${Buffer.from(`${username}:${password}`).toString('base64')}`\n}\n","import { fromValue } from '../utils/fromValue.js'\n\nexport function getIterator(iterable) {\n if (iterable[Symbol.asyncIterator]) {\n return iterable[Symbol.asyncIterator]()\n }\n if (iterable[Symbol.iterator]) {\n return iterable[Symbol.iterator]()\n }\n if (iterable.next) {\n return iterable\n }\n return fromValue(iterable)\n}\n","// Convert a value to an Async Iterator\n// This will be easier with async generator functions.\nexport function fromValue(value) {\n let queue = [value]\n return {\n next() {\n return Promise.resolve({ done: queue.length === 0, value: queue.pop() })\n },\n return() {\n queue = []\n return {}\n },\n [Symbol.asyncIterator]() {\n return this\n },\n }\n}\n","export function extractAuthFromUrl(url) {\n // For whatever reason, the `fetch` API does not convert credentials embedded in the URL\n // into Basic Authentication headers automatically. Instead it throws an error!\n // So we must manually parse the URL, rip out the user:password portion if it is present\n // and compute the Authorization header.\n // Note: I tried using new URL(url) but that throws a security exception in Edge. :rolleyes:\n let userpass = url.match(/^https?:\\/\\/([^/]+)@/)\n // No credentials, return the url unmodified and an empty auth object\n if (userpass == null) return { url, auth: {} }\n userpass = userpass[1]\n const [username, password] = userpass.split(':')\n // Remove credentials from URL\n url = url.replace(`${userpass}@`, '')\n // Has credentials, return the fetch-safe URL and the parsed credentials\n return { url, auth: { username, password } }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class EmptyServerResponseError extends BaseError {\n constructor() {\n super(`Empty response from git server.`)\n this.code = this.name = EmptyServerResponseError.code\n this.data = {}\n }\n}\n/** @type {'EmptyServerResponseError'} */\nEmptyServerResponseError.code = 'EmptyServerResponseError'\n","import { BaseError } from './BaseError.js'\n\nexport class ParseError extends BaseError {\n /**\n * @param {string} expected\n * @param {string} actual\n */\n constructor(expected, actual) {\n super(`Expected \"${expected}\" but received \"${actual}\".`)\n this.code = this.name = ParseError.code\n this.data = { expected, actual }\n }\n}\n/** @type {'ParseError'} */\nParseError.code = 'ParseError'\n","import { getIterator } from './getIterator.js'\n\n// inspired by 'gartal' but lighter-weight and more battle-tested.\nexport class StreamReader {\n constructor(stream) {\n // TODO: fix usage in bundlers before Buffer dependency is removed #1855\n if (typeof Buffer === 'undefined') {\n throw new Error('Missing Buffer dependency')\n }\n this.stream = getIterator(stream)\n this.buffer = null\n this.cursor = 0\n this.undoCursor = 0\n this.started = false\n this._ended = false\n this._discardedBytes = 0\n }\n\n eof() {\n return this._ended && this.cursor === this.buffer.length\n }\n\n tell() {\n return this._discardedBytes + this.cursor\n }\n\n async byte() {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor === this.buffer.length) {\n await this._loadnext()\n if (this._ended) return\n }\n this._moveCursor(1)\n return this.buffer[this.undoCursor]\n }\n\n async chunk() {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor === this.buffer.length) {\n await this._loadnext()\n if (this._ended) return\n }\n this._moveCursor(this.buffer.length)\n return this.buffer.slice(this.undoCursor, this.cursor)\n }\n\n async read(n) {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor + n > this.buffer.length) {\n this._trim()\n await this._accumulate(n)\n }\n this._moveCursor(n)\n return this.buffer.slice(this.undoCursor, this.cursor)\n }\n\n async skip(n) {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor + n > this.buffer.length) {\n this._trim()\n await this._accumulate(n)\n }\n this._moveCursor(n)\n }\n\n async undo() {\n this.cursor = this.undoCursor\n }\n\n async _next() {\n this.started = true\n let { done, value } = await this.stream.next()\n if (done) {\n this._ended = true\n if (!value) return Buffer.alloc(0)\n }\n if (value) {\n value = Buffer.from(value)\n }\n return value\n }\n\n _trim() {\n // Throw away parts of the buffer we don't need anymore\n // assert(this.cursor <= this.buffer.length)\n this.buffer = this.buffer.slice(this.undoCursor)\n this.cursor -= this.undoCursor\n this._discardedBytes += this.undoCursor\n this.undoCursor = 0\n }\n\n _moveCursor(n) {\n this.undoCursor = this.cursor\n this.cursor += n\n if (this.cursor > this.buffer.length) {\n this.cursor = this.buffer.length\n }\n }\n\n async _accumulate(n) {\n if (this._ended) return\n // Expand the buffer until we have N bytes of data\n // or we've reached the end of the stream\n const buffers = [this.buffer]\n while (this.cursor + n > lengthBuffers(buffers)) {\n const nextbuffer = await this._next()\n if (this._ended) break\n buffers.push(nextbuffer)\n }\n this.buffer = Buffer.concat(buffers)\n }\n\n async _loadnext() {\n this._discardedBytes += this.buffer.length\n this.undoCursor = 0\n this.cursor = 0\n this.buffer = await this._next()\n }\n\n async _init() {\n this.buffer = await this._next()\n }\n}\n\n// This helper function helps us postpone concatenating buffers, which\n// would create intermediate buffer objects,\nfunction lengthBuffers(buffers) {\n return buffers.reduce((acc, buffer) => acc + buffer.length, 0)\n}\n","/**\npkt-line Format\n---------------\n\nMuch (but not all) of the payload is described around pkt-lines.\n\nA pkt-line is a variable length binary string. The first four bytes\nof the line, the pkt-len, indicates the total length of the line,\nin hexadecimal. The pkt-len includes the 4 bytes used to contain\nthe length's hexadecimal representation.\n\nA pkt-line MAY contain binary data, so implementers MUST ensure\npkt-line parsing/formatting routines are 8-bit clean.\n\nA non-binary line SHOULD BE terminated by an LF, which if present\nMUST be included in the total length. Receivers MUST treat pkt-lines\nwith non-binary data the same whether or not they contain the trailing\nLF (stripping the LF if present, and not complaining when it is\nmissing).\n\nThe maximum length of a pkt-line's data component is 65516 bytes.\nImplementations MUST NOT send pkt-line whose length exceeds 65520\n(65516 bytes of payload + 4 bytes of length data).\n\nImplementations SHOULD NOT send an empty pkt-line (\"0004\").\n\nA pkt-line with a length field of 0 (\"0000\"), called a flush-pkt,\nis a special case and MUST be handled differently than an empty\npkt-line (\"0004\").\n\n----\n pkt-line = data-pkt / flush-pkt\n\n data-pkt = pkt-len pkt-payload\n pkt-len = 4*(HEXDIG)\n pkt-payload = (pkt-len - 4)*(OCTET)\n\n flush-pkt = \"0000\"\n----\n\nExamples (as C-style strings):\n\n----\n pkt-line actual value\n ---------------------------------\n \"0006a\\n\" \"a\\n\"\n \"0005a\" \"a\"\n \"000bfoobar\\n\" \"foobar\\n\"\n \"0004\" \"\"\n----\n*/\nimport { StreamReader } from '../utils/StreamReader.js'\nimport { padHex } from '../utils/padHex.js'\n\n// I'm really using this more as a namespace.\n// There's not a lot of \"state\" in a pkt-line\n\nexport class GitPktLine {\n static flush() {\n return Buffer.from('0000', 'utf8')\n }\n\n static delim() {\n return Buffer.from('0001', 'utf8')\n }\n\n static encode(line) {\n if (typeof line === 'string') {\n line = Buffer.from(line)\n }\n const length = line.length + 4\n const hexlength = padHex(4, length)\n return Buffer.concat([Buffer.from(hexlength, 'utf8'), line])\n }\n\n static streamReader(stream) {\n const reader = new StreamReader(stream)\n return async function read() {\n try {\n let length = await reader.read(4)\n if (length == null) return true\n length = parseInt(length.toString('utf8'), 16)\n if (length === 0) return null\n if (length === 1) return null // delim packets\n const buffer = await reader.read(length - 4)\n if (buffer == null) return true\n return buffer\n } catch (err) {\n stream.error = err\n return true\n }\n }\n }\n}\n","export function padHex(b, n) {\n const s = n.toString(16)\n return '0'.repeat(b - s.length) + s\n}\n","// @ts-check\n\n/**\n * @param {function} read\n */\nexport async function parseCapabilitiesV2(read) {\n /** @type {Object<string, string | true>} */\n const capabilities2 = {}\n\n let line\n while (true) {\n line = await read()\n if (line === true) break\n if (line === null) continue\n line = line.toString('utf8').replace(/\\n$/, '')\n const i = line.indexOf('=')\n if (i > -1) {\n const key = line.slice(0, i)\n const value = line.slice(i + 1)\n capabilities2[key] = value\n } else {\n capabilities2[line] = true\n }\n }\n return { protocolVersion: 2, capabilities2 }\n}\n","import { EmptyServerResponseError } from '../errors/EmptyServerResponseError.js'\nimport { ParseError } from '../errors/ParseError.js'\nimport { GitPktLine } from '../models/GitPktLine.js'\nimport { parseCapabilitiesV2 } from '../wire/parseCapabilitiesV2.js'\n\nexport async function parseRefsAdResponse(stream, { service }) {\n const capabilities = new Set()\n const refs = new Map()\n const symrefs = new Map()\n\n // There is probably a better way to do this, but for now\n // let's just throw the result parser inline here.\n const read = GitPktLine.streamReader(stream)\n let lineOne = await read()\n // skip past any flushes\n while (lineOne === null) lineOne = await read()\n\n if (lineOne === true) throw new EmptyServerResponseError()\n\n // Handle protocol v2 responses (Bitbucket Server doesn't include a `# service=` line)\n if (lineOne.includes('version 2')) {\n return parseCapabilitiesV2(read)\n }\n\n // Clients MUST ignore an LF at the end of the line.\n if (lineOne.toString('utf8').replace(/\\n$/, '') !== `# service=${service}`) {\n throw new ParseError(`# service=${service}\\\\n`, lineOne.toString('utf8'))\n }\n let lineTwo = await read()\n // skip past any flushes\n while (lineTwo === null) lineTwo = await read()\n // In the edge case of a brand new repo, zero refs (and zero capabilities)\n // are returned.\n if (lineTwo === true) return { capabilities, refs, symrefs }\n lineTwo = lineTwo.toString('utf8')\n\n // Handle protocol v2 responses\n if (lineTwo.includes('version 2')) {\n return parseCapabilitiesV2(read)\n }\n\n const [firstRef, capabilitiesLine] = splitAndAssert(lineTwo, '\\x00', '\\\\x00')\n capabilitiesLine.split(' ').map(x => capabilities.add(x))\n // see no-refs in https://git-scm.com/docs/pack-protocol#_reference_discovery (since git 2.41.0)\n if (firstRef !== '0000000000000000000000000000000000000000 capabilities^{}') {\n const [ref, name] = splitAndAssert(firstRef, ' ', ' ')\n refs.set(name, ref)\n while (true) {\n const line = await read()\n if (line === true) break\n if (line !== null) {\n const [ref, name] = splitAndAssert(line.toString('utf8'), ' ', ' ')\n refs.set(name, ref)\n }\n }\n }\n // Symrefs are thrown into the \"capabilities\" unfortunately.\n for (const cap of capabilities) {\n if (cap.startsWith('symref=')) {\n const m = cap.match(/symref=([^:]+):(.*)/)\n if (m.length === 3) {\n symrefs.set(m[1], m[2])\n }\n }\n }\n return { protocolVersion: 1, capabilities, refs, symrefs }\n}\n\nfunction splitAndAssert(line, sep, expected) {\n const split = line.trim().split(sep)\n if (split.length !== 2) {\n throw new ParseError(\n `Two strings separated by '${expected}'`,\n line.toString('utf8')\n )\n }\n return split\n}\n","import '../typedefs.js'\n\nimport { HttpError } from '../errors/HttpError.js'\nimport { SmartHttpError } from '../errors/SmartHttpError.js'\nimport { UserCanceledError } from '../errors/UserCanceledError.js'\nimport { calculateBasicAuthHeader } from '../utils/calculateBasicAuthHeader.js'\nimport { collect } from '../utils/collect.js'\nimport { extractAuthFromUrl } from '../utils/extractAuthFromUrl.js'\nimport { parseRefsAdResponse } from '../wire/parseRefsAdResponse.js'\n\n// Try to accommodate known CORS proxy implementations:\n// - https://jcubic.pl/proxy.php? <-- uses query string\n// - https://cors.isomorphic-git.org <-- uses path\nconst corsProxify = (corsProxy, url) =>\n corsProxy.endsWith('?')\n ? `${corsProxy}${url}`\n : `${corsProxy}/${url.replace(/^https?:\\/\\//, '')}`\n\nconst updateHeaders = (headers, auth) => {\n // Update the basic auth header\n if (auth.username || auth.password) {\n headers.Authorization = calculateBasicAuthHeader(auth)\n }\n // but any manually provided headers take precedence\n if (auth.headers) {\n Object.assign(headers, auth.headers)\n }\n}\n\n/**\n * @param {GitHttpResponse} res\n *\n * @returns {{ preview: string, response: string, data: Buffer }}\n */\nconst stringifyBody = async res => {\n try {\n // Some services provide a meaningful error message in the body of 403s like \"token lacks the scopes necessary to perform this action\"\n const data = Buffer.from(await collect(res.body))\n const response = data.toString('utf8')\n const preview =\n response.length < 256 ? response : response.slice(0, 256) + '...'\n return { preview, response, data }\n } catch (e) {\n return {}\n }\n}\n\nexport class GitRemoteHTTP {\n /**\n * Returns the capabilities of the GitRemoteHTTP class.\n *\n * @returns {Promise<string[]>} - An array of supported capabilities.\n */\n static async capabilities() {\n return ['discover', 'connect']\n }\n\n /**\n * Discovers references from a remote Git repository.\n *\n * @param {Object} args\n * @param {HttpClient} args.http - The HTTP client to use for requests.\n * @param {ProgressCallback} [args.onProgress] - Callback for progress updates.\n * @param {AuthCallback} [args.onAuth] - Callback for providing authentication credentials.\n * @param {AuthFailureCallback} [args.onAuthFailure] - Callback for handling authentication failures.\n * @param {AuthSuccessCallback} [args.onAuthSuccess] - Callback for handling successful authentication.\n * @param {string} [args.corsProxy] - Optional CORS proxy URL.\n * @param {string} args.service - The Git service (e.g., \"git-upload-pack\").\n * @param {string} args.url - The URL of the remote repository.\n * @param {Object<string, string>} args.headers - HTTP headers to include in the request.\n * @param {1 | 2} args.protocolVersion - The Git protocol version to use.\n * @returns {Promise<Object>} - The parsed response from the remote repository.\n * @throws {HttpError} - If the HTTP request fails.\n * @throws {SmartHttpError} - If the response cannot be parsed.\n * @throws {UserCanceledError} - If the user cancels the operation.\n */\n static async discover({\n http,\n onProgress,\n onAuth,\n onAuthSuccess,\n onAuthFailure,\n corsProxy,\n service,\n url: _origUrl,\n headers,\n protocolVersion,\n }) {\n let { url, auth } = extractAuthFromUrl(_origUrl)\n const proxifiedURL = corsProxy ? corsProxify(corsProxy, url) : url\n if (auth.username || auth.password) {\n headers.Authorization = calculateBasicAuthHeader(auth)\n }\n if (protocolVersion === 2) {\n headers['Git-Protocol'] = 'version=2'\n }\n\n let res\n let tryAgain\n let providedAuthBefore = false\n do {\n res = await http.request({\n onProgress,\n method: 'GET',\n url: `${proxifiedURL}/info/refs?service=${service}`,\n headers,\n })\n\n // the default loop behavior\n tryAgain = false\n\n // 401 is the \"correct\" response for access denied. 203 is Non-Authoritative Information and comes from Azure DevOps, which\n // apparently doesn't realize this is a git request and is returning the HTML for the \"Azure DevOps Services | Sign In\" page.\n if (res.statusCode === 401 || res.statusCode === 203) {\n // On subsequent 401s, call `onAuthFailure` instead of `onAuth`.\n // This is so that naive `onAuth` callbacks that return a fixed value don't create an infinite loop of retrying.\n const getAuth = providedAuthBefore ? onAuthFailure : onAuth\n if (getAuth) {\n // Acquire credentials and try again\n // TODO: read `useHttpPath` value from git config and pass along?\n auth = await getAuth(url, {\n ...auth,\n headers: { ...headers },\n })\n if (auth && auth.cancel) {\n throw new UserCanceledError()\n } else if (auth) {\n updateHeaders(headers, auth)\n providedAuthBefore = true\n tryAgain = true\n }\n }\n } else if (\n res.statusCode === 200 &&\n providedAuthBefore &&\n onAuthSuccess\n ) {\n await onAuthSuccess(url, auth)\n }\n } while (tryAgain)\n\n if (res.statusCode !== 200) {\n const { response } = await stringifyBody(res)\n throw new HttpError(res.statusCode, res.statusMessage, response)\n }\n // Git \"smart\" HTTP servers should respond with the correct Content-Type header.\n if (\n res.headers['content-type'] === `application/x-${service}-advertisement`\n ) {\n const remoteHTTP = await parseRefsAdResponse(res.body, { service })\n remoteHTTP.auth = auth\n return remoteHTTP\n } else {\n // If they don't send the correct content-type header, that's a good indicator it is either a \"dumb\" HTTP\n // server, or the user specified an incorrect remote URL and the response is actually an HTML page.\n // In this case, we save the response as plain text so we can generate a better error message if needed.\n const { preview, response, data } = await stringifyBody(res)\n // For backwards compatibility, try to parse it anyway.\n // TODO: maybe just throw instead of trying?\n try {\n const remoteHTTP = await parseRefsAdResponse([data], { service })\n remoteHTTP.auth = auth\n return remoteHTTP\n } catch (e) {\n throw new SmartHttpError(preview, response)\n }\n }\n }\n\n /**\n * Connects to a remote Git repository and sends a request.\n *\n * @param {Object} args\n * @param {HttpClient} args.http - The HTTP client to use for requests.\n * @param {ProgressCallback} [args.onProgress] - Callback for progress updates.\n * @param {string} [args.corsProxy] - Optional CORS proxy URL.\n * @param {string} args.service - The Git service (e.g., \"git-upload-pack\").\n * @param {string} args.url - The URL of the remote repository.\n * @param {Object<string, string>} [args.headers] - HTTP headers to include in the request.\n * @param {any} args.body - The request body to send.\n * @param {any} args.auth - Authentication credentials.\n * @returns {Promise<GitHttpResponse>} - The HTTP response from the remote repository.\n * @throws {HttpError} - If the HTTP request fails.\n */\n static async connect({\n http,\n onProgress,\n corsProxy,\n service,\n url,\n auth,\n body,\n headers,\n }) {\n // We already have the \"correct\" auth value at this point, but\n // we need to strip out the username/password from the URL yet again.\n const urlAuth = extractAuthFromUrl(url)\n if (urlAuth) url = urlAuth.url\n\n if (corsProxy) url = corsProxify(corsProxy, url)\n\n headers['content-type'] = `application/x-${service}-request`\n headers.accept = `application/x-${service}-result`\n updateHeaders(headers, auth)\n\n const res = await http.request({\n onProgress,\n method: 'POST',\n url: `${url}/${service}`,\n body,\n headers,\n })\n if (res.statusCode !== 200) {\n const { response } = stringifyBody(res)\n throw new HttpError(res.statusCode, res.statusMessage, response)\n }\n return res\n }\n}\n","import { forAwait } from './forAwait.js'\n\nexport async function collect(iterable) {\n let size = 0\n const buffers = []\n // This will be easier once `for await ... of` loops are available.\n await forAwait(iterable, value => {\n buffers.push(value)\n size += value.byteLength\n })\n const result = new Uint8Array(size)\n let nextIndex = 0\n for (const buffer of buffers) {\n result.set(buffer, nextIndex)\n nextIndex += buffer.byteLength\n }\n return result\n}\n","import { getIterator } from './getIterator.js'\n\n// Currently 'for await' upsets my linters.\nexport async function forAwait(iterable, cb) {\n const iter = getIterator(iterable)\n while (true) {\n const { value, done } = await iter.next()\n if (value) await cb(value)\n if (done) break\n }\n if (iter.return) iter.return()\n}\n","import { BaseError } from './BaseError.js'\n\nexport class UnknownTransportError extends BaseError {\n /**\n * @param {string} url\n * @param {string} transport\n * @param {string} [suggestion]\n */\n constructor(url, transport, suggestion) {\n super(\n `Git remote \"${url}\" uses an unrecognized transport protocol: \"${transport}\"`\n )\n this.code = this.name = UnknownTransportError.code\n this.data = { url, transport, suggestion }\n }\n}\n/** @type {'UnknownTransportError'} */\nUnknownTransportError.code = 'UnknownTransportError'\n","import { BaseError } from './BaseError.js'\n\nexport class UrlParseError extends BaseError {\n /**\n * @param {string} url\n */\n constructor(url) {\n super(`Cannot parse remote URL: \"${url}\"`)\n this.code = this.name = UrlParseError.code\n this.data = { url }\n }\n}\n/** @type {'UrlParseError'} */\nUrlParseError.code = 'UrlParseError'\n","import { UnknownTransportError } from '../errors/UnknownTransportError.js'\nimport { UrlParseError } from '../errors/UrlParseError.js'\nimport { translateSSHtoHTTP } from '../utils/translateSSHtoHTTP.js'\n\nimport { GitRemoteHTTP } from './GitRemoteHTTP.js'\n\n/**\n * A class for managing Git remotes and determining the appropriate remote helper for a given URL.\n */\nexport class GitRemoteManager {\n /**\n * Determines the appropriate remote helper for the given URL.\n *\n * @param {Object} args\n * @param {string} args.url - The URL of the remote repository.\n * @returns {Object} - The remote helper class for the specified transport.\n * @throws {UrlParseError} - If the URL cannot be parsed.\n * @throws {UnknownTransportError} - If the transport is not supported.\n */\n static getRemoteHelperFor({ url }) {\n // TODO: clean up the remoteHelper API and move into PluginCore\n const remoteHelpers = new Map()\n remoteHelpers.set('http', GitRemoteHTTP)\n remoteHelpers.set('https', GitRemoteHTTP)\n\n const parts = parseRemoteUrl({ url })\n if (!parts) {\n throw new UrlParseError(url)\n }\n if (remoteHelpers.has(parts.transport)) {\n return remoteHelpers.get(parts.transport)\n }\n throw new UnknownTransportError(\n url,\n parts.transport,\n parts.transport === 'ssh' ? translateSSHtoHTTP(url) : undefined\n )\n }\n}\n\n/**\n * Parses a remote URL and extracts its transport and address.\n *\n * @param {Object} args\n * @param {string} args.url - The URL of the remote repository.\n * @returns {Object|undefined} - An object containing the transport and address, or undefined if parsing fails.\n */\nfunction parseRemoteUrl({ url }) {\n // the stupid \"shorter scp-like syntax\"\n if (url.startsWith('git@')) {\n return {\n transport: 'ssh',\n address: url,\n }\n }\n const matches = url.match(/(\\w+)(:\\/\\/|::)(.*)/)\n if (matches === null) return\n /*\n * When git encounters a URL of the form <transport>://<address>, where <transport> is\n * a protocol that it cannot handle natively, it automatically invokes git remote-<transport>\n * with the full URL as the second argument.\n *\n * @see https://git-scm.com/docs/git-remote-helpers\n */\n if (matches[2] === '://') {\n return {\n transport: matches[1],\n address: matches[0],\n }\n }\n /*\n * A URL of the form <transport>::<address> explicitly instructs git to invoke\n * git remote-<transport> with <address> as the second argument.\n *\n * @see https://git-scm.com/docs/git-remote-helpers\n */\n if (matches[2] === '::') {\n return {\n transport: matches[1],\n address: matches[3],\n }\n }\n}\n","export function translateSSHtoHTTP(url) {\n // handle \"shorter scp-like syntax\"\n url = url.replace(/^git@([^:]+):/, 'https://$1/')\n // handle proper SSH URLs\n url = url.replace(/^ssh:\\/\\//, 'https://')\n return url\n}\n","import '../typedefs.js'\nimport AsyncLock from 'async-lock'\n\nimport { join } from '../utils/join.js'\n\nlet lock = null\n\nexport class GitShallowManager {\n /**\n * Reads the `shallow` file in the Git repository and returns a set of object IDs (OIDs).\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @returns {Promise<Set<string>>} - A set of shallow object IDs.\n */\n static async read({ fs, gitdir }) {\n if (lock === null) lock = new AsyncLock()\n const filepath = join(gitdir, 'shallow')\n const oids = new Set()\n await lock.acquire(filepath, async function () {\n const text = await fs.read(filepath, { encoding: 'utf8' })\n if (text === null) return oids // no file\n if (text.trim() === '') return oids // empty file\n text\n .trim()\n .split('\\n')\n .map(oid => oids.add(oid))\n })\n return oids\n }\n\n /**\n * Writes a set of object IDs (OIDs) to the `shallow` file in the Git repository.\n * If the set is empty, the `shallow` file is removed.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {Set<string>} args.oids - A set of shallow object IDs to write.\n * @returns {Promise<void>}\n */\n static async write({ fs, gitdir, oids }) {\n if (lock === null) lock = new AsyncLock()\n const filepath = join(gitdir, 'shallow')\n if (oids.size > 0) {\n const text = [...oids].join('\\n') + '\\n'\n await lock.acquire(filepath, async function () {\n await fs.write(filepath, text, {\n encoding: 'utf8',\n })\n })\n } else {\n // No shallows\n await lock.acquire(filepath, async function () {\n await fs.rm(filepath)\n })\n }\n }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class ObjectTypeError extends BaseError {\n /**\n * @param {string} oid\n * @param {'blob'|'commit'|'tag'|'tree'} actual\n * @param {'blob'|'commit'|'tag'|'tree'} expected\n * @param {string} [filepath]\n */\n constructor(oid, actual, expected, filepath) {\n super(\n `Object ${oid} ${\n filepath ? `at ${filepath}` : ''\n }was anticipated to be a ${expected} but it is a ${actual}.`\n )\n this.code = this.name = ObjectTypeError.code\n this.data = { oid, actual, expected, filepath }\n }\n}\n/** @type {'ObjectTypeError'} */\nObjectTypeError.code = 'ObjectTypeError'\n","export function formatAuthor({ name, email, timestamp, timezoneOffset }) {\n timezoneOffset = formatTimezoneOffset(timezoneOffset)\n return `${name} <${email}> ${timestamp} ${timezoneOffset}`\n}\n\n// The amount of effort that went into crafting these cases to handle\n// -0 (just so we don't lose that information when parsing and reconstructing)\n// but can also default to +0 was extraordinary.\n\nfunction formatTimezoneOffset(minutes) {\n const sign = simpleSign(negateExceptForZero(minutes))\n minutes = Math.abs(minutes)\n const hours = Math.floor(minutes / 60)\n minutes -= hours * 60\n let strHours = String(hours)\n let strMinutes = String(minutes)\n if (strHours.length < 2) strHours = '0' + strHours\n if (strMinutes.length < 2) strMinutes = '0' + strMinutes\n return (sign === -1 ? '-' : '+') + strHours + strMinutes\n}\n\nfunction simpleSign(n) {\n return Math.sign(n) || (Object.is(n, -0) ? -1 : 1)\n}\n\nfunction negateExceptForZero(n) {\n return n === 0 ? n : -n\n}\n","export function normalizeNewlines(str) {\n // remove all <CR>\n str = str.replace(/\\r/g, '')\n // no extra newlines up front\n str = str.replace(/^\\n+/, '')\n // and a single newline at the end\n str = str.replace(/\\n+$/, '') + '\\n'\n return str\n}\n","export function parseAuthor(author) {\n const [, name, email, timestamp, offset] = author.match(\n /^(.*) <(.*)> (.*) (.*)$/\n )\n return {\n name,\n email,\n timestamp: Number(timestamp),\n timezoneOffset: parseTimezoneOffset(offset),\n }\n}\n\n// The amount of effort that went into crafting these cases to handle\n// -0 (just so we don't lose that information when parsing and reconstructing)\n// but can also default to +0 was extraordinary.\n\nfunction parseTimezoneOffset(offset) {\n let [, sign, hours, minutes] = offset.match(/(\\+|-)(\\d\\d)(\\d\\d)/)\n minutes = (sign === '+' ? 1 : -1) * (Number(hours) * 60 + Number(minutes))\n return negateExceptForZero(minutes)\n}\n\nfunction negateExceptForZero(n) {\n return n === 0 ? n : -n\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { formatAuthor } from '../utils/formatAuthor.js'\nimport { normalizeNewlines } from '../utils/normalizeNewlines.js'\nimport { parseAuthor } from '../utils/parseAuthor.js'\n\nexport class GitAnnotatedTag {\n constructor(tag) {\n if (typeof tag === 'string') {\n this._tag = tag\n } else if (Buffer.isBuffer(tag)) {\n this._tag = tag.toString('utf8')\n } else if (typeof tag === 'object') {\n this._tag = GitAnnotatedTag.render(tag)\n } else {\n throw new InternalError(\n 'invalid type passed to GitAnnotatedTag constructor'\n )\n }\n }\n\n static from(tag) {\n return new GitAnnotatedTag(tag)\n }\n\n static render(obj) {\n return `object ${obj.object}\ntype ${obj.type}\ntag ${obj.tag}\ntagger ${formatAuthor(obj.tagger)}\n\n${obj.message}\n${obj.gpgsig ? obj.gpgsig : ''}`\n }\n\n justHeaders() {\n return this._tag.slice(0, this._tag.indexOf('\\n\\n'))\n }\n\n message() {\n const tag = this.withoutSignature()\n return tag.slice(tag.indexOf('\\n\\n') + 2)\n }\n\n parse() {\n return Object.assign(this.headers(), {\n message: this.message(),\n gpgsig: this.gpgsig(),\n })\n }\n\n render() {\n return this._tag\n }\n\n headers() {\n const headers = this.justHeaders().split('\\n')\n const hs = []\n for (const h of headers) {\n if (h[0] === ' ') {\n // combine with previous header (without space indent)\n hs[hs.length - 1] += '\\n' + h.slice(1)\n } else {\n hs.push(h)\n }\n }\n const obj = {}\n for (const h of hs) {\n const key = h.slice(0, h.indexOf(' '))\n const value = h.slice(h.indexOf(' ') + 1)\n if (Array.isArray(obj[key])) {\n obj[key].push(value)\n } else {\n obj[key] = value\n }\n }\n if (obj.tagger) {\n obj.tagger = parseAuthor(obj.tagger)\n }\n if (obj.committer) {\n obj.committer = parseAuthor(obj.committer)\n }\n return obj\n }\n\n withoutSignature() {\n const tag = normalizeNewlines(this._tag)\n if (tag.indexOf('\\n-----BEGIN PGP SIGNATURE-----') === -1) return tag\n return tag.slice(0, tag.lastIndexOf('\\n-----BEGIN PGP SIGNATURE-----'))\n }\n\n gpgsig() {\n if (this._tag.indexOf('\\n-----BEGIN PGP SIGNATURE-----') === -1) return\n const signature = this._tag.slice(\n this._tag.indexOf('-----BEGIN PGP SIGNATURE-----'),\n this._tag.indexOf('-----END PGP SIGNATURE-----') +\n '-----END PGP SIGNATURE-----'.length\n )\n return normalizeNewlines(signature)\n }\n\n payload() {\n return this.withoutSignature() + '\\n'\n }\n\n toObject() {\n return Buffer.from(this._tag, 'utf8')\n }\n\n static async sign(tag, sign, secretKey) {\n const payload = tag.payload()\n let { signature } = await sign({ payload, secretKey })\n // renormalize the line endings to the one true line-ending\n signature = normalizeNewlines(signature)\n const signedTag = payload + signature\n // return a new tag object\n return GitAnnotatedTag.from(signedTag)\n }\n}\n","export function indent(str) {\n return (\n str\n .trim()\n .split('\\n')\n .map(x => ' ' + x)\n .join('\\n') + '\\n'\n )\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { formatAuthor } from '../utils/formatAuthor.js'\nimport { indent } from '../utils/indent.js'\nimport { normalizeNewlines } from '../utils/normalizeNewlines.js'\nimport { outdent } from '../utils/outdent.js'\nimport { parseAuthor } from '../utils/parseAuthor.js'\n\nexport class GitCommit {\n constructor(commit) {\n if (typeof commit === 'string') {\n this._commit = commit\n } else if (Buffer.isBuffer(commit)) {\n this._commit = commit.toString('utf8')\n } else if (typeof commit === 'object') {\n this._commit = GitCommit.render(commit)\n } else {\n throw new InternalError('invalid type passed to GitCommit constructor')\n }\n }\n\n static fromPayloadSignature({ payload, signature }) {\n const headers = GitCommit.justHeaders(payload)\n const message = GitCommit.justMessage(payload)\n const commit = normalizeNewlines(\n headers + '\\ngpgsig' + indent(signature) + '\\n' + message\n )\n return new GitCommit(commit)\n }\n\n static from(commit) {\n return new GitCommit(commit)\n }\n\n toObject() {\n return Buffer.from(this._commit, 'utf8')\n }\n\n // Todo: allow setting the headers and message\n headers() {\n return this.parseHeaders()\n }\n\n // Todo: allow setting the headers and message\n message() {\n return GitCommit.justMessage(this._commit)\n }\n\n parse() {\n return Object.assign({ message: this.message() }, this.headers())\n }\n\n static justMessage(commit) {\n return normalizeNewlines(commit.slice(commit.indexOf('\\n\\n') + 2))\n }\n\n static justHeaders(commit) {\n return commit.slice(0, commit.indexOf('\\n\\n'))\n }\n\n parseHeaders() {\n const headers = GitCommit.justHeaders(this._commit).split('\\n')\n const hs = []\n for (const h of headers) {\n if (h[0] === ' ') {\n // combine with previous header (without space indent)\n hs[hs.length - 1] += '\\n' + h.slice(1)\n } else {\n hs.push(h)\n }\n }\n const obj = {\n parent: [],\n }\n for (const h of hs) {\n const key = h.slice(0, h.indexOf(' '))\n const value = h.slice(h.indexOf(' ') + 1)\n if (Array.isArray(obj[key])) {\n obj[key].push(value)\n } else {\n obj[key] = value\n }\n }\n if (obj.author) {\n obj.author = parseAuthor(obj.author)\n }\n if (obj.committer) {\n obj.committer = parseAuthor(obj.committer)\n }\n return obj\n }\n\n static renderHeaders(obj) {\n let headers = ''\n if (obj.tree) {\n headers += `tree ${obj.tree}\\n`\n } else {\n headers += `tree 4b825dc642cb6eb9a060e54bf8d69288fbee4904\\n` // the null tree\n }\n if (obj.parent) {\n if (obj.parent.length === undefined) {\n throw new InternalError(`commit 'parent' property should be an array`)\n }\n for (const p of obj.parent) {\n headers += `parent ${p}\\n`\n }\n }\n const author = obj.author\n headers += `author ${formatAuthor(author)}\\n`\n const committer = obj.committer || obj.author\n headers += `committer ${formatAuthor(committer)}\\n`\n if (obj.gpgsig) {\n headers += 'gpgsig' + indent(obj.gpgsig)\n }\n return headers\n }\n\n static render(obj) {\n return GitCommit.renderHeaders(obj) + '\\n' + normalizeNewlines(obj.message)\n }\n\n render() {\n return this._commit\n }\n\n withoutSignature() {\n const commit = normalizeNewlines(this._commit)\n if (commit.indexOf('\\ngpgsig') === -1) return commit\n const headers = commit.slice(0, commit.indexOf('\\ngpgsig'))\n const message = commit.slice(\n commit.indexOf('-----END PGP SIGNATURE-----\\n') +\n '-----END PGP SIGNATURE-----\\n'.length\n )\n return normalizeNewlines(headers + '\\n' + message)\n }\n\n isolateSignature() {\n const signature = this._commit.slice(\n this._commit.indexOf('-----BEGIN PGP SIGNATURE-----'),\n this._commit.indexOf('-----END PGP SIGNATURE-----') +\n '-----END PGP SIGNATURE-----'.length\n )\n return outdent(signature)\n }\n\n static async sign(commit, sign, secretKey) {\n const payload = commit.withoutSignature()\n const message = GitCommit.justMessage(commit._commit)\n let { signature } = await sign({ payload, secretKey })\n // renormalize the line endings to the one true line-ending\n signature = normalizeNewlines(signature)\n const headers = GitCommit.justHeaders(commit._commit)\n const signedCommit =\n headers + '\\n' + 'gpgsig' + indent(signature) + '\\n' + message\n // return a new commit object\n return GitCommit.from(signedCommit)\n }\n}\n","export function outdent(str) {\n return str\n .split('\\n')\n .map(x => x.replace(/^ /, ''))\n .join('\\n')\n}\n","import { InternalError } from '../errors/InternalError.js'\n\n/**\n * Represents a Git object and provides methods to wrap and unwrap Git objects\n * according to the Git object format.\n */\nexport class GitObject {\n /**\n * Wraps a raw object with a Git header.\n *\n * @param {Object} params - The parameters for wrapping.\n * @param {string} params.type - The type of the Git object (e.g., 'blob', 'tree', 'commit').\n * @param {Uint8Array} params.object - The raw object data to wrap.\n * @returns {Uint8Array} The wrapped Git object as a single buffer.\n */\n static wrap({ type, object }) {\n const header = `${type} ${object.length}\\x00`\n const headerLen = header.length\n const totalLength = headerLen + object.length\n\n // Allocate a single buffer for the header and object, rather than create multiple buffers\n const wrappedObject = new Uint8Array(totalLength)\n for (let i = 0; i < headerLen; i++) {\n wrappedObject[i] = header.charCodeAt(i)\n }\n wrappedObject.set(object, headerLen)\n\n return wrappedObject\n }\n\n /**\n * Unwraps a Git object buffer into its type and raw object data.\n *\n * @param {Buffer|Uint8Array} buffer - The buffer containing the wrapped Git object.\n * @returns {{ type: string, object: Buffer }} An object containing the type and the raw object data.\n * @throws {InternalError} If the length specified in the header does not match the actual object length.\n */\n static unwrap(buffer) {\n const s = buffer.indexOf(32) // first space\n const i = buffer.indexOf(0) // first null value\n const type = buffer.slice(0, s).toString('utf8') // get type of object\n const length = buffer.slice(s + 1, i).toString('utf8') // get type of object\n const actualLength = buffer.length - (i + 1)\n // verify length\n if (parseInt(length) !== actualLength) {\n throw new InternalError(\n `Length mismatch: expected ${length} bytes but got ${actualLength} instead.`\n )\n }\n return {\n type,\n object: Buffer.from(buffer.slice(i + 1)),\n }\n }\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { BufferCursor } from '../utils/BufferCursor.js'\n\n/**\n * @param {Buffer} delta\n * @param {Buffer} source\n * @returns {Buffer}\n */\nexport function applyDelta(delta, source) {\n const reader = new BufferCursor(delta)\n const sourceSize = readVarIntLE(reader)\n\n if (sourceSize !== source.byteLength) {\n throw new InternalError(\n `applyDelta expected source buffer to be ${sourceSize} bytes but the provided buffer was ${source.length} bytes`\n )\n }\n const targetSize = readVarIntLE(reader)\n let target\n\n const firstOp = readOp(reader, source)\n // Speed optimization - return raw buffer if it's just single simple copy\n if (firstOp.byteLength === targetSize) {\n target = firstOp\n } else {\n // Otherwise, allocate a fresh buffer and slices\n target = Buffer.alloc(targetSize)\n const writer = new BufferCursor(target)\n writer.copy(firstOp)\n\n while (!reader.eof()) {\n writer.copy(readOp(reader, source))\n }\n\n const tell = writer.tell()\n if (targetSize !== tell) {\n throw new InternalError(\n `applyDelta expected target buffer to be ${targetSize} bytes but the resulting buffer was ${tell} bytes`\n )\n }\n }\n return target\n}\n\nfunction readVarIntLE(reader) {\n let result = 0\n let shift = 0\n let byte = null\n do {\n byte = reader.readUInt8()\n result |= (byte & 0b01111111) << shift\n shift += 7\n } while (byte & 0b10000000)\n return result\n}\n\nfunction readCompactLE(reader, flags, size) {\n let result = 0\n let shift = 0\n while (size--) {\n if (flags & 0b00000001) {\n result |= reader.readUInt8() << shift\n }\n flags >>= 1\n shift += 8\n }\n return result\n}\n\nfunction readOp(reader, source) {\n /** @type {number} */\n const byte = reader.readUInt8()\n const COPY = 0b10000000\n const OFFS = 0b00001111\n const SIZE = 0b01110000\n if (byte & COPY) {\n // copy consists of 4 byte offset, 3 byte size (in LE order)\n const offset = readCompactLE(reader, byte & OFFS, 4)\n let size = readCompactLE(reader, (byte & SIZE) >> 4, 3)\n // Yup. They really did this optimization.\n if (size === 0) size = 0x10000\n return source.slice(offset, offset + size)\n } else {\n // insert\n return reader.slice(byte)\n }\n}\n","// My version of git-list-pack - roughly 15x faster than the original\n// It's used slightly differently - instead of returning a through stream it wraps a stream.\n// (I tried to make it API identical, but that ended up being 2x slower than this version.)\nimport pako from 'pako'\n\nimport { InternalError } from '../errors/InternalError.js'\nimport { StreamReader } from '../utils/StreamReader.js'\n\nexport async function listpack(stream, onData) {\n const reader = new StreamReader(stream)\n let PACK = await reader.read(4)\n PACK = PACK.toString('utf8')\n if (PACK !== 'PACK') {\n throw new InternalError(`Invalid PACK header '${PACK}'`)\n }\n\n let version = await reader.read(4)\n version = version.readUInt32BE(0)\n if (version !== 2) {\n throw new InternalError(`Invalid packfile version: ${version}`)\n }\n\n let numObjects = await reader.read(4)\n numObjects = numObjects.readUInt32BE(0)\n // If (for some godforsaken reason) this is an empty packfile, abort now.\n if (numObjects < 1) return\n\n while (!reader.eof() && numObjects--) {\n const offset = reader.tell()\n const { type, length, ofs, reference } = await parseHeader(reader)\n const inflator = new pako.Inflate()\n while (!inflator.result) {\n const chunk = await reader.chunk()\n if (!chunk) break\n inflator.push(chunk, false)\n if (inflator.err) {\n throw new InternalError(`Pako error: ${inflator.msg}`)\n }\n if (inflator.result) {\n if (inflator.result.length !== length) {\n throw new InternalError(\n `Inflated object size is different from that stated in packfile.`\n )\n }\n\n // Backtrack parser to where deflated data ends\n await reader.undo()\n await reader.read(chunk.length - inflator.strm.avail_in)\n const end = reader.tell()\n await onData({\n data: inflator.result,\n type,\n num: numObjects,\n offset,\n end,\n reference,\n ofs,\n })\n }\n }\n }\n}\n\nasync function parseHeader(reader) {\n // Object type is encoded in bits 654\n let byte = await reader.byte()\n const type = (byte >> 4) & 0b111\n // The length encoding get complicated.\n // Last four bits of length is encoded in bits 3210\n let length = byte & 0b1111\n // Whether the next byte is part of the variable-length encoded number\n // is encoded in bit 7\n if (byte & 0b10000000) {\n let shift = 4\n do {\n byte = await reader.byte()\n length |= (byte & 0b01111111) << shift\n shift += 7\n } while (byte & 0b10000000)\n }\n // Handle deltified objects\n let ofs\n let reference\n if (type === 6) {\n let shift = 0\n ofs = 0\n const bytes = []\n do {\n byte = await reader.byte()\n ofs |= (byte & 0b01111111) << shift\n shift += 7\n bytes.push(byte)\n } while (byte & 0b10000000)\n reference = Buffer.from(bytes)\n }\n if (type === 7) {\n const buf = await reader.read(20)\n reference = buf\n }\n return { type, length, ofs, reference }\n}\n","/* eslint-env node, browser */\n/* global DecompressionStream */\nimport pako from 'pako'\n\nlet supportsDecompressionStream = false\n\nexport async function inflate(buffer) {\n if (supportsDecompressionStream === null) {\n supportsDecompressionStream = testDecompressionStream()\n }\n return supportsDecompressionStream\n ? browserInflate(buffer)\n : pako.inflate(buffer)\n}\n\nasync function browserInflate(buffer) {\n const ds = new DecompressionStream('deflate')\n const d = new Blob([buffer]).stream().pipeThrough(ds)\n return new Uint8Array(await new Response(d).arrayBuffer())\n}\n\nfunction testDecompressionStream() {\n try {\n const ds = new DecompressionStream('deflate')\n if (ds) return true\n } catch (_) {\n // no bother\n }\n return false\n}\n","import crc32 from 'crc-32'\n\nimport { InternalError } from '../errors/InternalError.js'\nimport { GitObject } from '../models/GitObject.js'\nimport { BufferCursor } from '../utils/BufferCursor.js'\nimport { applyDelta } from '../utils/applyDelta.js'\nimport { listpack } from '../utils/git-list-pack.js'\nimport { inflate } from '../utils/inflate.js'\nimport { shasum } from '../utils/shasum.js'\n\nfunction decodeVarInt(reader) {\n const bytes = []\n let byte = 0\n let multibyte = 0\n do {\n byte = reader.readUInt8()\n // We keep bits 6543210\n const lastSeven = byte & 0b01111111\n bytes.push(lastSeven)\n // Whether the next byte is part of the variable-length encoded number\n // is encoded in bit 7\n multibyte = byte & 0b10000000\n } while (multibyte)\n // Now that all the bytes are in big-endian order,\n // alternate shifting the bits left by 7 and OR-ing the next byte.\n // And... do a weird increment-by-one thing that I don't quite understand.\n return bytes.reduce((a, b) => ((a + 1) << 7) | b, -1)\n}\n\n// I'm pretty much copying this one from the git C source code,\n// because it makes no sense.\nfunction otherVarIntDecode(reader, startWith) {\n let result = startWith\n let shift = 4\n let byte = null\n do {\n byte = reader.readUInt8()\n result |= (byte & 0b01111111) << shift\n shift += 7\n } while (byte & 0b10000000)\n return result\n}\n\nexport class GitPackIndex {\n constructor(stuff) {\n Object.assign(this, stuff)\n this.offsetCache = {}\n }\n\n static async fromIdx({ idx, getExternalRefDelta }) {\n const reader = new BufferCursor(idx)\n const magic = reader.slice(4).toString('hex')\n // Check for IDX v2 magic number\n if (magic !== 'ff744f63') {\n return // undefined\n }\n const version = reader.readUInt32BE()\n if (version !== 2) {\n throw new InternalError(\n `Unable to read version ${version} packfile IDX. (Only version 2 supported)`\n )\n }\n if (idx.byteLength > 2048 * 1024 * 1024) {\n throw new InternalError(\n `To keep implementation simple, I haven't implemented the layer 5 feature needed to support packfiles > 2GB in size.`\n )\n }\n // Skip over fanout table\n reader.seek(reader.tell() + 4 * 255)\n // Get hashes\n const size = reader.readUInt32BE()\n const hashes = []\n for (let i = 0; i < size; i++) {\n const hash = reader.slice(20).toString('hex')\n hashes[i] = hash\n }\n reader.seek(reader.tell() + 4 * size)\n // Skip over CRCs\n // Get offsets\n const offsets = new Map()\n for (let i = 0; i < size; i++) {\n offsets.set(hashes[i], reader.readUInt32BE())\n }\n const packfileSha = reader.slice(20).toString('hex')\n return new GitPackIndex({\n hashes,\n crcs: {},\n offsets,\n packfileSha,\n getExternalRefDelta,\n })\n }\n\n static async fromPack({ pack, getExternalRefDelta, onProgress }) {\n const listpackTypes = {\n 1: 'commit',\n 2: 'tree',\n 3: 'blob',\n 4: 'tag',\n 6: 'ofs-delta',\n 7: 'ref-delta',\n }\n const offsetToObject = {}\n\n // Older packfiles do NOT use the shasum of the pack itself,\n // so it is recommended to just use whatever bytes are in the trailer.\n // Source: https://github.com/git/git/commit/1190a1acf800acdcfd7569f87ac1560e2d077414\n const packfileSha = pack.slice(-20).toString('hex')\n\n const hashes = []\n const crcs = {}\n const offsets = new Map()\n let totalObjectCount = null\n let lastPercent = null\n\n await listpack([pack], async ({ data, type, reference, offset, num }) => {\n if (totalObjectCount === null) totalObjectCount = num\n const percent = Math.floor(\n ((totalObjectCount - num) * 100) / totalObjectCount\n )\n if (percent !== lastPercent) {\n if (onProgress) {\n await onProgress({\n phase: 'Receiving objects',\n loaded: totalObjectCount - num,\n total: totalObjectCount,\n })\n }\n }\n lastPercent = percent\n // Change type from a number to a meaningful string\n type = listpackTypes[type]\n\n if (['commit', 'tree', 'blob', 'tag'].includes(type)) {\n offsetToObject[offset] = {\n type,\n offset,\n }\n } else if (type === 'ofs-delta') {\n offsetToObject[offset] = {\n type,\n offset,\n }\n } else if (type === 'ref-delta') {\n offsetToObject[offset] = {\n type,\n offset,\n }\n }\n })\n\n // We need to know the lengths of the slices to compute the CRCs.\n const offsetArray = Object.keys(offsetToObject).map(Number)\n for (const [i, start] of offsetArray.entries()) {\n const end =\n i + 1 === offsetArray.length ? pack.byteLength - 20 : offsetArray[i + 1]\n const o = offsetToObject[start]\n const crc = crc32.buf(pack.slice(start, end)) >>> 0\n o.end = end\n o.crc = crc\n }\n\n // We don't have the hashes yet. But we can generate them using the .readSlice function!\n const p = new GitPackIndex({\n pack: Promise.resolve(pack),\n packfileSha,\n crcs,\n hashes,\n offsets,\n getExternalRefDelta,\n })\n\n // Resolve deltas and compute the oids\n lastPercent = null\n let count = 0\n const objectsByDepth = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n for (let offset in offsetToObject) {\n offset = Number(offset)\n const percent = Math.floor((count * 100) / totalObjectCount)\n if (percent !== lastPercent) {\n if (onProgress) {\n await onProgress({\n phase: 'Resolving deltas',\n loaded: count,\n total: totalObjectCount,\n })\n }\n }\n count++\n lastPercent = percent\n\n const o = offsetToObject[offset]\n if (o.oid) continue\n try {\n p.readDepth = 0\n p.externalReadDepth = 0\n const { type, object } = await p.readSlice({ start: offset })\n objectsByDepth[p.readDepth] += 1\n const oid = await shasum(GitObject.wrap({ type, object }))\n o.oid = oid\n hashes.push(oid)\n offsets.set(oid, offset)\n crcs[oid] = o.crc\n } catch (err) {\n continue\n }\n }\n\n hashes.sort()\n return p\n }\n\n async toBuffer() {\n const buffers = []\n const write = (str, encoding) => {\n buffers.push(Buffer.from(str, encoding))\n }\n // Write out IDX v2 magic number\n write('ff744f63', 'hex')\n // Write out version number 2\n write('00000002', 'hex')\n // Write fanout table\n const fanoutBuffer = new BufferCursor(Buffer.alloc(256 * 4))\n for (let i = 0; i < 256; i++) {\n let count = 0\n for (const hash of this.hashes) {\n if (parseInt(hash.slice(0, 2), 16) <= i) count++\n }\n fanoutBuffer.writeUInt32BE(count)\n }\n buffers.push(fanoutBuffer.buffer)\n // Write out hashes\n for (const hash of this.hashes) {\n write(hash, 'hex')\n }\n // Write out crcs\n const crcsBuffer = new BufferCursor(Buffer.alloc(this.hashes.length * 4))\n for (const hash of this.hashes) {\n crcsBuffer.writeUInt32BE(this.crcs[hash])\n }\n buffers.push(crcsBuffer.buffer)\n // Write out offsets\n const offsetsBuffer = new BufferCursor(Buffer.alloc(this.hashes.length * 4))\n for (const hash of this.hashes) {\n offsetsBuffer.writeUInt32BE(this.offsets.get(hash))\n }\n buffers.push(offsetsBuffer.buffer)\n // Write out packfile checksum\n write(this.packfileSha, 'hex')\n // Write out shasum\n const totalBuffer = Buffer.concat(buffers)\n const sha = await shasum(totalBuffer)\n const shaBuffer = Buffer.alloc(20)\n shaBuffer.write(sha, 'hex')\n return Buffer.concat([totalBuffer, shaBuffer])\n }\n\n async load({ pack }) {\n this.pack = pack\n }\n\n async unload() {\n this.pack = null\n }\n\n async read({ oid }) {\n if (!this.offsets.get(oid)) {\n if (this.getExternalRefDelta) {\n this.externalReadDepth++\n return this.getExternalRefDelta(oid)\n } else {\n throw new InternalError(`Could not read object ${oid} from packfile`)\n }\n }\n const start = this.offsets.get(oid)\n return this.readSlice({ start })\n }\n\n async readSlice({ start }) {\n if (this.offsetCache[start]) {\n return Object.assign({}, this.offsetCache[start])\n }\n this.readDepth++\n const types = {\n 0b0010000: 'commit',\n 0b0100000: 'tree',\n 0b0110000: 'blob',\n 0b1000000: 'tag',\n 0b1100000: 'ofs_delta',\n 0b1110000: 'ref_delta',\n }\n if (!this.pack) {\n throw new InternalError(\n 'Tried to read from a GitPackIndex with no packfile loaded into memory'\n )\n }\n const raw = (await this.pack).slice(start)\n const reader = new BufferCursor(raw)\n const byte = reader.readUInt8()\n // Object type is encoded in bits 654\n const btype = byte & 0b1110000\n let type = types[btype]\n if (type === undefined) {\n throw new InternalError('Unrecognized type: 0b' + btype.toString(2))\n }\n // The length encoding get complicated.\n // Last four bits of length is encoded in bits 3210\n const lastFour = byte & 0b1111\n let length = lastFour\n // Whether the next byte is part of the variable-length encoded number\n // is encoded in bit 7\n const multibyte = byte & 0b10000000\n if (multibyte) {\n length = otherVarIntDecode(reader, lastFour)\n }\n let base = null\n let object = null\n // Handle deltified objects\n if (type === 'ofs_delta') {\n const offset = decodeVarInt(reader)\n const baseOffset = start - offset\n ;({ object: base, type } = await this.readSlice({ start: baseOffset }))\n }\n if (type === 'ref_delta') {\n const oid = reader.slice(20).toString('hex')\n ;({ object: base, type } = await this.read({ oid }))\n }\n // Handle undeltified objects\n const buffer = raw.slice(reader.tell())\n object = Buffer.from(await inflate(buffer))\n // Assert that the object length is as expected.\n if (object.byteLength !== length) {\n throw new InternalError(\n `Packfile told us object would have length ${length} but it had length ${object.byteLength}`\n )\n }\n if (base) {\n object = Buffer.from(applyDelta(object, base))\n }\n // Cache the result based on depth.\n if (this.readDepth > 3) {\n // hand tuned for speed / memory usage tradeoff\n this.offsetCache[start] = { type, object }\n }\n return { type, format: 'content', object }\n }\n}\n","import { GitPackIndex } from '../models/GitPackIndex.js'\n\nconst PackfileCache = Symbol('PackfileCache')\n\nasync function loadPackIndex({\n fs,\n filename,\n getExternalRefDelta,\n emitter,\n emitterPrefix,\n}) {\n const idx = await fs.read(filename)\n return GitPackIndex.fromIdx({ idx, getExternalRefDelta })\n}\n\nexport function readPackIndex({\n fs,\n cache,\n filename,\n getExternalRefDelta,\n emitter,\n emitterPrefix,\n}) {\n // Try to get the packfile index from the in-memory cache\n if (!cache[PackfileCache]) cache[PackfileCache] = new Map()\n let p = cache[PackfileCache].get(filename)\n if (!p) {\n p = loadPackIndex({\n fs,\n filename,\n getExternalRefDelta,\n emitter,\n emitterPrefix,\n })\n cache[PackfileCache].set(filename, p)\n }\n return p\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { NotFoundError } from '../errors/NotFoundError.js'\nimport { GitObject } from '../models/GitObject.js'\nimport { readObjectLoose } from '../storage/readObjectLoose.js'\nimport { readObjectPacked } from '../storage/readObjectPacked.js'\nimport { inflate } from '../utils/inflate.js'\nimport { shasum } from '../utils/shasum.js'\n\n/**\n * @param {object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {any} args.cache\n * @param {string} args.gitdir\n * @param {string} args.oid\n * @param {string} [args.format]\n */\nexport async function _readObject({\n fs,\n cache,\n gitdir,\n oid,\n format = 'content',\n}) {\n // Curry the current read method so that the packfile un-deltification\n // process can acquire external ref-deltas.\n const getExternalRefDelta = oid => _readObject({ fs, cache, gitdir, oid })\n\n let result\n // Empty tree - hard-coded so we can use it as a shorthand.\n // Note: I think the canonical git implementation must do this too because\n // `git cat-file -t 4b825dc642cb6eb9a060e54bf8d69288fbee4904` prints \"tree\" even in empty repos.\n if (oid === '4b825dc642cb6eb9a060e54bf8d69288fbee4904') {\n result = { format: 'wrapped', object: Buffer.from(`tree 0\\x00`) }\n }\n // Look for it in the loose object directory.\n if (!result) {\n result = await readObjectLoose({ fs, gitdir, oid })\n }\n // Check to see if it's in a packfile.\n if (!result) {\n result = await readObjectPacked({\n fs,\n cache,\n gitdir,\n oid,\n getExternalRefDelta,\n })\n\n if (!result) {\n throw new NotFoundError(oid)\n }\n\n // Directly return packed result, as specified: packed objects always return the 'content' format.\n return result\n }\n\n // Loose objects are always deflated, return early\n if (format === 'deflated') {\n return result\n }\n\n // All loose objects are deflated but the hard-coded empty tree is `wrapped` so we have to check if we need to inflate the object.\n if (result.format === 'deflated') {\n result.object = Buffer.from(await inflate(result.object))\n result.format = 'wrapped'\n }\n\n if (format === 'wrapped') {\n return result\n }\n\n const sha = await shasum(result.object)\n if (sha !== oid) {\n throw new InternalError(\n `SHA check failed! Expected ${oid}, computed ${sha}`\n )\n }\n const { object, type } = GitObject.unwrap(result.object)\n result.type = type\n result.object = object\n result.format = 'content'\n\n if (format === 'content') {\n return result\n }\n\n throw new InternalError(`invalid requested format \"${format}\"`)\n}\n","export async function readObjectLoose({ fs, gitdir, oid }) {\n const source = `objects/${oid.slice(0, 2)}/${oid.slice(2)}`\n const file = await fs.read(`${gitdir}/${source}`)\n if (!file) {\n return null\n }\n return { object: file, format: 'deflated', source }\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { readPackIndex } from '../storage/readPackIndex.js'\nimport { join } from '../utils/join.js'\nimport { shasum } from '../utils/shasum.js'\n\nexport async function readObjectPacked({\n fs,\n cache,\n gitdir,\n oid,\n format = 'content',\n getExternalRefDelta,\n}) {\n // Check to see if it's in a packfile.\n // Iterate through all the .idx files\n let list = await fs.readdir(join(gitdir, 'objects/pack'))\n list = list.filter(x => x.endsWith('.idx'))\n for (const filename of list) {\n const indexFile = `${gitdir}/objects/pack/${filename}`\n const p = await readPackIndex({\n fs,\n cache,\n filename: indexFile,\n getExternalRefDelta,\n })\n if (p.error) throw new InternalError(p.error)\n // If the packfile DOES have the oid we're looking for...\n if (p.offsets.has(oid)) {\n // Get the resolved git object from the packfile\n if (!p.pack) {\n const packFile = indexFile.replace(/idx$/, 'pack')\n p.pack = fs.read(packFile)\n }\n const pack = await p.pack\n\n // === Packfile Integrity Verification ===\n // Performance optimization: use _checksumVerified flag to verify only once per packfile\n if (!p._checksumVerified) {\n const expectedShaFromIndex = p.packfileSha\n\n // 1. Fast Check: Verify packfile trailer matches index record\n // Use subarray instead of slice to avoid memory copy (zero-copy for large packfiles)\n const packTrailer = pack.subarray(-20)\n const packTrailerSha = Array.from(packTrailer)\n .map(b => b.toString(16).padStart(2, '0'))\n .join('')\n if (packTrailerSha !== expectedShaFromIndex) {\n throw new InternalError(\n `Packfile trailer mismatch: expected ${expectedShaFromIndex}, got ${packTrailerSha}. The packfile may be corrupted.`\n )\n }\n\n // 2. Deep Integrity Check: Calculate actual SHA-1 of packfile payload\n // This ensures true data integrity by verifying the entire packfile content\n // Use subarray for zero-copy reading of large files\n const payload = pack.subarray(0, -20)\n const actualPayloadSha = await shasum(payload)\n if (actualPayloadSha !== expectedShaFromIndex) {\n throw new InternalError(\n `Packfile payload corrupted: calculated ${actualPayloadSha} but expected ${expectedShaFromIndex}. The packfile may have been tampered with.`\n )\n }\n\n // Mark as verified to prevent performance regression on subsequent reads\n p._checksumVerified = true\n }\n\n const result = await p.read({ oid, getExternalRefDelta })\n result.format = 'content'\n result.source = `objects/pack/${filename.replace(/idx$/, 'pack')}`\n return result\n }\n }\n // Failed to find it\n return null\n}\n","import { ObjectTypeError } from '../errors/ObjectTypeError.js'\nimport { GitAnnotatedTag } from '../models/GitAnnotatedTag.js'\nimport { GitCommit } from '../models/GitCommit.js'\nimport { _readObject as readObject } from '../storage/readObject.js'\n\nexport async function resolveCommit({ fs, cache, gitdir, oid }) {\n const { type, object } = await readObject({ fs, cache, gitdir, oid })\n // Resolve annotated tag objects to whatever\n if (type === 'tag') {\n oid = GitAnnotatedTag.from(object).parse().object\n return resolveCommit({ fs, cache, gitdir, oid })\n }\n if (type !== 'commit') {\n throw new ObjectTypeError(oid, type, 'commit')\n }\n return { commit: GitCommit.from(object), oid }\n}\n","/* eslint-env node, browser */\n/* global CompressionStream */\nimport pako from 'pako'\n\nlet supportsCompressionStream = null\n\nexport async function deflate(buffer) {\n if (supportsCompressionStream === null) {\n supportsCompressionStream = testCompressionStream()\n }\n return supportsCompressionStream\n ? browserDeflate(buffer)\n : pako.deflate(buffer)\n}\n\nasync function browserDeflate(buffer) {\n const cs = new CompressionStream('deflate')\n const c = new Blob([buffer]).stream().pipeThrough(cs)\n return new Uint8Array(await new Response(c).arrayBuffer())\n}\n\nfunction testCompressionStream() {\n try {\n const cs = new CompressionStream('deflate')\n cs.writable.close()\n // Test if `Blob.stream` is present. React Native does not have the `stream` method\n const stream = new Blob([]).stream()\n stream.cancel()\n return true\n } catch (_) {\n return false\n }\n}\n","import AsyncLock from 'async-lock'\n\nimport { STAGE } from '../commands/STAGE.js'\nimport { TREE } from '../commands/TREE.js'\nimport { WORKDIR } from '../commands/WORKDIR.js'\nimport { _walk } from '../commands/walk.js'\nimport { _writeTree } from '../commands/writeTree.js'\nimport { InternalError } from '../errors/InternalError.js'\nimport { NotFoundError } from '../errors/NotFoundError.js'\nimport { GitIgnoreManager } from '../managers/GitIgnoreManager.js'\nimport { GitIndexManager } from '../managers/GitIndexManager.js'\nimport { _readObject } from '../storage/readObject.js'\nimport { readObjectLoose } from '../storage/readObjectLoose.js'\nimport { _writeObject } from '../storage/writeObject.js'\n\nimport { join } from './join.js'\nimport { posixifyPathBuffer } from './posixifyPathBuffer.js'\n\nconst _TreeMap = {\n stage: STAGE,\n workdir: WORKDIR,\n}\n\nlet lock\nexport async function acquireLock(ref, callback) {\n if (lock === undefined) lock = new AsyncLock()\n return lock.acquire(ref, callback)\n}\n\n// make sure filepath, blob type and blob object (from loose objects) plus oid are in sync and valid\nasync function checkAndWriteBlob(fs, gitdir, dir, filepath, oid = null) {\n const currentFilepath = join(dir, filepath)\n const stats = await fs.lstat(currentFilepath)\n if (!stats) throw new NotFoundError(currentFilepath)\n if (stats.isDirectory())\n throw new InternalError(\n `${currentFilepath}: file expected, but found directory`\n )\n\n // Look for it in the loose object directory.\n const objContent = oid\n ? await readObjectLoose({ fs, gitdir, oid })\n : undefined\n let retOid = objContent ? oid : undefined\n if (!objContent) {\n await acquireLock({ fs, gitdir, currentFilepath }, async () => {\n const object = stats.isSymbolicLink()\n ? await fs.readlink(currentFilepath).then(posixifyPathBuffer)\n : await fs.read(currentFilepath)\n\n if (object === null) throw new NotFoundError(currentFilepath)\n\n retOid = await _writeObject({ fs, gitdir, type: 'blob', object })\n })\n }\n\n return retOid\n}\n\nasync function processTreeEntries({ fs, dir, gitdir, entries }) {\n // make sure each tree entry has valid oid\n async function processTreeEntry(entry) {\n if (entry.type === 'tree') {\n if (!entry.oid) {\n // Process children entries if the current entry is a tree\n const children = await Promise.all(entry.children.map(processTreeEntry))\n // Write the tree with the processed children\n entry.oid = await _writeTree({\n fs,\n gitdir,\n tree: children,\n })\n entry.mode = 0o40000 // directory\n }\n } else if (entry.type === 'blob') {\n entry.oid = await checkAndWriteBlob(\n fs,\n gitdir,\n dir,\n entry.path,\n entry.oid\n )\n entry.mode = 0o100644 // file\n }\n\n // remove path from entry.path\n entry.path = entry.path.split('/').pop()\n return entry\n }\n\n return Promise.all(entries.map(processTreeEntry))\n}\n\nexport async function writeTreeChanges({\n fs,\n dir,\n gitdir,\n treePair, // [TREE({ ref: 'HEAD' }), 'STAGE'] would be the equivalent of `git write-tree`\n}) {\n const isStage = treePair[1] === 'stage'\n const trees = treePair.map(t => (typeof t === 'string' ? _TreeMap[t]() : t))\n\n const changedEntries = []\n // transform WalkerEntry objects into the desired format\n const map = async (filepath, [head, stage]) => {\n if (\n filepath === '.' ||\n (await GitIgnoreManager.isIgnored({ fs, dir, gitdir, filepath }))\n ) {\n return\n }\n\n if (stage) {\n if (\n !head ||\n ((await head.oid()) !== (await stage.oid()) &&\n (await stage.oid()) !== undefined)\n ) {\n changedEntries.push([head, stage])\n }\n return {\n mode: await stage.mode(),\n path: filepath,\n oid: await stage.oid(),\n type: await stage.type(),\n }\n }\n }\n\n // combine mapped entries with their parent results\n const reduce = async (parent, children) => {\n children = children.filter(Boolean) // Remove undefined entries\n if (!parent) {\n return children.length > 0 ? children : undefined\n } else {\n parent.children = children\n return parent\n }\n }\n\n // if parent is skipped, skip the children\n const iterate = async (walk, children) => {\n const filtered = []\n for (const child of children) {\n const [head, stage] = child\n if (isStage) {\n if (stage) {\n // for deleted file in work dir, it also needs to be added on stage\n if (await fs.exists(`${dir}/${stage.toString()}`)) {\n filtered.push(child)\n } else {\n changedEntries.push([null, stage]) // record the change (deletion) while stop the iteration\n }\n }\n } else if (head) {\n // for deleted file in workdir, \"stage\" (workdir in our case) will be undefined\n if (!stage) {\n changedEntries.push([head, null]) // record the change (deletion) while stop the iteration\n } else {\n filtered.push(child) // workdir, tracked only\n }\n }\n }\n return filtered.length ? Promise.all(filtered.map(walk)) : []\n }\n\n const entries = await _walk({\n fs,\n cache: {},\n dir,\n gitdir,\n trees,\n map,\n reduce,\n iterate,\n })\n\n if (changedEntries.length === 0 || entries.length === 0) {\n return null // no changes found to stash\n }\n\n const processedEntries = await processTreeEntries({\n fs,\n dir,\n gitdir,\n entries,\n })\n\n const treeEntries = processedEntries.filter(Boolean).map(entry => ({\n mode: entry.mode,\n path: entry.path,\n oid: entry.oid,\n type: entry.type,\n }))\n\n return _writeTree({ fs, gitdir, tree: treeEntries })\n}\n\nexport async function applyTreeChanges({\n fs,\n dir,\n gitdir,\n stashCommit,\n parentCommit,\n wasStaged,\n}) {\n const dirRemoved = []\n const stageUpdated = []\n\n // analyze the changes\n const ops = await _walk({\n fs,\n cache: {},\n dir,\n gitdir,\n trees: [TREE({ ref: parentCommit }), TREE({ ref: stashCommit })],\n map: async (filepath, [parent, stash]) => {\n if (\n filepath === '.' ||\n (await GitIgnoreManager.isIgnored({ fs, dir, gitdir, filepath }))\n ) {\n return\n }\n const type = stash ? await stash.type() : await parent.type()\n if (type !== 'tree' && type !== 'blob') {\n return\n }\n\n // deleted tree or blob\n if (!stash && parent) {\n const method = type === 'tree' ? 'rmdir' : 'rm'\n if (type === 'tree') dirRemoved.push(filepath)\n if (type === 'blob' && wasStaged)\n stageUpdated.push({ filepath, oid: await parent.oid() }) // stats is undefined, will stage the deletion with index.insert\n return { method, filepath }\n }\n\n const oid = await stash.oid()\n if (!parent || (await parent.oid()) !== oid) {\n // only apply changes if changed from the parent commit or doesn't exist in the parent commit\n if (type === 'tree') {\n return { method: 'mkdir', filepath }\n } else {\n if (wasStaged)\n stageUpdated.push({\n filepath,\n oid,\n stats: await fs.lstat(join(dir, filepath)),\n })\n return {\n method: 'write',\n filepath,\n oid,\n }\n }\n }\n },\n })\n\n // apply the changes to work dir\n await acquireLock({ fs, gitdir, dirRemoved, ops }, async () => {\n for (const op of ops) {\n const currentFilepath = join(dir, op.filepath)\n switch (op.method) {\n case 'rmdir':\n await fs.rmdir(currentFilepath)\n break\n case 'mkdir':\n await fs.mkdir(currentFilepath)\n break\n case 'rm':\n await fs.rm(currentFilepath)\n break\n case 'write':\n // only writes if file is not in the removedDirs\n if (\n !dirRemoved.some(removedDir =>\n currentFilepath.startsWith(removedDir)\n )\n ) {\n const { object } = await _readObject({\n fs,\n cache: {},\n gitdir,\n oid: op.oid,\n })\n // just like checkout, since mode only applicable to create, not update, delete first\n if (await fs.exists(currentFilepath)) {\n await fs.rm(currentFilepath)\n }\n await fs.write(currentFilepath, object) // only handles regular files for now\n }\n break\n }\n }\n })\n\n // update the stage\n await GitIndexManager.acquire({ fs, gitdir, cache: {} }, async index => {\n stageUpdated.forEach(({ filepath, stats, oid }) => {\n index.insert({ filepath, stats, oid })\n })\n })\n}\n","import { GitObject } from '../models/GitObject.js'\nimport { writeObjectLoose } from '../storage/writeObjectLoose.js'\nimport { deflate } from '../utils/deflate.js'\nimport { shasum } from '../utils/shasum.js'\n\nexport async function _writeObject({\n fs,\n gitdir,\n type,\n object,\n format = 'content',\n oid = undefined,\n dryRun = false,\n}) {\n if (format !== 'deflated') {\n if (format !== 'wrapped') {\n object = GitObject.wrap({ type, object })\n }\n oid = await shasum(object)\n object = Buffer.from(await deflate(object))\n }\n if (!dryRun) {\n await writeObjectLoose({ fs, gitdir, object, format: 'deflated', oid })\n }\n return oid\n}\n","import { InternalError } from '../errors/InternalError.js'\n\nexport async function writeObjectLoose({ fs, gitdir, object, format, oid }) {\n if (format !== 'deflated') {\n throw new InternalError(\n 'GitObjectStoreLoose expects objects to write to be in deflated format'\n )\n }\n const source = `objects/${oid.slice(0, 2)}/${oid.slice(2)}`\n const filepath = `${gitdir}/${source}`\n // Don't overwrite existing git objects - this helps avoid EPERM errors.\n // Although I don't know how we'd fix corrupted objects then. Perhaps delete them\n // on read?\n if (!(await fs.exists(filepath))) await fs.write(filepath, object)\n}\n","import { BaseError } from './BaseError.js'\n\nexport class InvalidRefNameError extends BaseError {\n /**\n * @param {string} ref\n * @param {string} suggestion\n * @param {boolean} canForce\n */\n constructor(ref, suggestion) {\n super(\n `\"${ref}\" would be an invalid git reference. (Hint: a valid alternative would be \"${suggestion}\".)`\n )\n this.code = this.name = InvalidRefNameError.code\n this.data = { ref, suggestion }\n }\n}\n/** @type {'InvalidRefNameError'} */\nInvalidRefNameError.code = 'InvalidRefNameError'\n","import { BaseError } from './BaseError.js'\n\nexport class MissingNameError extends BaseError {\n /**\n * @param {'author'|'committer'|'tagger'} role\n */\n constructor(role) {\n super(\n `No name was provided for ${role} in the argument or in the .git/config file.`\n )\n this.code = this.name = MissingNameError.code\n this.data = { role }\n }\n}\n/** @type {'MissingNameError'} */\nMissingNameError.code = 'MissingNameError'\n","export class GitRefStash {\n // constructor removed\n\n static get timezoneOffsetForRefLogEntry() {\n const offsetMinutes = new Date().getTimezoneOffset()\n const offsetHours = Math.abs(Math.floor(offsetMinutes / 60))\n const offsetMinutesFormatted = Math.abs(offsetMinutes % 60)\n .toString()\n .padStart(2, '0')\n const sign = offsetMinutes > 0 ? '-' : '+'\n return `${sign}${offsetHours\n .toString()\n .padStart(2, '0')}${offsetMinutesFormatted}`\n }\n\n static createStashReflogEntry(author, stashCommit, message) {\n const nameNoSpace = author.name.replace(/\\s/g, '')\n const z40 = '0000000000000000000000000000000000000000' // hard code for now, works with `git stash list`\n const timestamp = Math.floor(Date.now() / 1000)\n const timezoneOffset = GitRefStash.timezoneOffsetForRefLogEntry\n return `${z40} ${stashCommit} ${nameNoSpace} ${author.email} ${timestamp} ${timezoneOffset}\\t${message}\\n`\n }\n\n static getStashReflogEntry(reflogString, parsed = false) {\n const reflogLines = reflogString.split('\\n')\n const entries = reflogLines\n .filter(l => l)\n .reverse()\n .map((line, idx) =>\n parsed ? `stash@{${idx}}: ${line.split('\\t')[1]}` : line\n )\n return entries\n }\n}\n","// @ts-check\nimport '../typedefs.js'\n\nimport { GitConfigManager } from '../managers/GitConfigManager.js'\n\n/**\n * @param {Object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {string} args.gitdir\n * @param {string} args.path\n *\n * @returns {Promise<any>} Resolves with the config value\n *\n * @example\n * // Read config value\n * let value = await git.getConfig({\n * dir: '$input((/))',\n * path: '$input((user.name))'\n * })\n * console.log(value)\n *\n */\nexport async function _getConfig({ fs, gitdir, path }) {\n const config = await GitConfigManager.get({ fs, gitdir })\n return config.get(path)\n}\n","// This is part of an elaborate system to facilitate code-splitting / tree-shaking.\n// commands/walk.js can depend on only this, and the actual Walker classes exported\n// can be opaque - only having a single property (this symbol) that is not enumerable,\n// and thus the constructor can be passed as an argument to walk while being \"unusable\"\n// outside of it.\nexport const GitWalkSymbol = Symbol('GitWalkSymbol')\n","import '../typedefs.js'\n\nimport { _readCommit } from '../commands/readCommit.js'\nimport { _writeCommit } from '../commands/writeCommit.js'\nimport { InvalidRefNameError } from '../errors/InvalidRefNameError.js'\nimport { MissingNameError } from '../errors/MissingNameError.js'\nimport { GitRefStash } from '../models/GitRefStash.js'\nimport { join } from '../utils/join.js'\nimport { normalizeAuthorObject } from '../utils/normalizeAuthorObject.js'\nimport { acquireLock } from '../utils/walkerToTreeEntryMap.js'\n\nimport { GitRefManager } from './GitRefManager.js'\n\nexport class GitStashManager {\n /**\n * Creates an instance of GitStashManager.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} args.dir - The working directory.\n * @param {string}[args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n */\n constructor({ fs, dir, gitdir = join(dir, '.git') }) {\n Object.assign(this, {\n fs,\n dir,\n gitdir,\n _author: null,\n })\n }\n\n /**\n * Gets the reference name for the stash.\n *\n * @returns {string} - The stash reference name.\n */\n static get refStash() {\n return 'refs/stash'\n }\n\n /**\n * Gets the reference name for the stash reflogs.\n *\n * @returns {string} - The stash reflogs reference name.\n */\n static get refLogsStash() {\n return 'logs/refs/stash'\n }\n\n /**\n * Gets the file path for the stash reference.\n *\n * @returns {string} - The file path for the stash reference.\n */\n get refStashPath() {\n return join(this.gitdir, GitStashManager.refStash)\n }\n\n /**\n * Gets the file path for the stash reflogs.\n *\n * @returns {string} - The file path for the stash reflogs.\n */\n get refLogsStashPath() {\n return join(this.gitdir, GitStashManager.refLogsStash)\n }\n\n /**\n * Retrieves the author information for the stash.\n *\n * @returns {Promise<Object>} - The author object.\n * @throws {MissingNameError} - If the author name is missing.\n */\n async getAuthor() {\n if (!this._author) {\n this._author = await normalizeAuthorObject({\n fs: this.fs,\n gitdir: this.gitdir,\n author: {},\n })\n if (!this._author) throw new MissingNameError('author')\n }\n return this._author\n }\n\n /**\n * Gets the SHA of a stash entry by its index.\n *\n * @param {number} refIdx - The index of the stash entry.\n * @param {string[]} [stashEntries] - Optional preloaded stash entries.\n * @returns {Promise<string|null>} - The SHA of the stash entry or `null` if not found.\n */\n async getStashSHA(refIdx, stashEntries) {\n if (!(await this.fs.exists(this.refStashPath))) {\n return null\n }\n\n const entries =\n stashEntries || (await this.readStashReflogs({ parsed: false }))\n return entries[refIdx].split(' ')[1]\n }\n\n /**\n * Writes a stash commit to the repository.\n *\n * @param {Object} args\n * @param {string} args.message - The commit message.\n * @param {string} args.tree - The tree object ID.\n * @param {string[]} args.parent - The parent commit object IDs.\n * @returns {Promise<string>} - The object ID of the written commit.\n */\n async writeStashCommit({ message, tree, parent }) {\n return _writeCommit({\n fs: this.fs,\n gitdir: this.gitdir,\n commit: {\n message,\n tree,\n parent,\n author: await this.getAuthor(),\n committer: await this.getAuthor(),\n },\n })\n }\n\n /**\n * Reads a stash commit by its index.\n *\n * @param {number} refIdx - The index of the stash entry.\n * @returns {Promise<Object>} - The stash commit object.\n * @throws {InvalidRefNameError} - If the index is invalid.\n */\n async readStashCommit(refIdx) {\n const stashEntries = await this.readStashReflogs({ parsed: false })\n if (refIdx !== 0) {\n // non-default case, throw exceptions if not valid\n if (refIdx < 0 || refIdx > stashEntries.length - 1) {\n throw new InvalidRefNameError(\n `stash@${refIdx}`,\n 'number that is in range of [0, num of stash pushed]'\n )\n }\n }\n\n const stashSHA = await this.getStashSHA(refIdx, stashEntries)\n if (!stashSHA) {\n return {} // no stash found\n }\n\n // get the stash commit object\n return _readCommit({\n fs: this.fs,\n cache: {},\n gitdir: this.gitdir,\n oid: stashSHA,\n })\n }\n\n /**\n * Writes a stash reference to the repository.\n *\n * @param {string} stashCommit - The object ID of the stash commit.\n * @returns {Promise<void>}\n */\n async writeStashRef(stashCommit) {\n return GitRefManager.writeRef({\n fs: this.fs,\n gitdir: this.gitdir,\n ref: GitStashManager.refStash,\n value: stashCommit,\n })\n }\n\n /**\n * Writes a reflog entry for a stash commit.\n *\n * @param {Object} args\n * @param {string} args.stashCommit - The object ID of the stash commit.\n * @param {string} args.message - The reflog message.\n * @returns {Promise<void>}\n */\n async writeStashReflogEntry({ stashCommit, message }) {\n const author = await this.getAuthor()\n const entry = GitRefStash.createStashReflogEntry(\n author,\n stashCommit,\n message\n )\n const filepath = this.refLogsStashPath\n\n await acquireLock({ filepath, entry }, async () => {\n const appendTo = (await this.fs.exists(filepath))\n ? await this.fs.read(filepath, 'utf8')\n : ''\n await this.fs.write(filepath, appendTo + entry, 'utf8')\n })\n }\n\n /**\n * Reads the stash reflogs.\n *\n * @param {Object} args\n * @param {boolean} [args.parsed=false] - Whether to parse the reflog entries.\n * @returns {Promise<string[]|Object[]>} - The reflog entries as strings or parsed objects.\n */\n async readStashReflogs({ parsed = false }) {\n if (!(await this.fs.exists(this.refLogsStashPath))) {\n return []\n }\n\n const reflogString = await this.fs.read(this.refLogsStashPath, 'utf8')\n\n return GitRefStash.getStashReflogEntry(reflogString, parsed)\n }\n}\n","import '../typedefs.js'\nimport { _getConfig } from '../commands/getConfig.js'\n\nimport { assignDefined } from './assignDefined.js'\n\n/**\n * Return author object by using properties following this priority:\n * (1) provided author object\n * -> (2) author of provided commit object\n * -> (3) Config and current date/time\n *\n * @param {Object} args\n * @param {FsClient} args.fs - a file system implementation\n * @param {string} [args.gitdir] - The [git directory](dir-vs-gitdir.md) path\n * @param {Object} [args.author] - The author object.\n * @param {CommitObject} [args.commit] - A commit object.\n *\n * @returns {Promise<void | {name: string, email: string, timestamp: number, timezoneOffset: number }>}\n */\nexport async function normalizeAuthorObject({ fs, gitdir, author, commit }) {\n const timestamp = Math.floor(Date.now() / 1000)\n\n const defaultAuthor = {\n name: await _getConfig({ fs, gitdir, path: 'user.name' }),\n email: (await _getConfig({ fs, gitdir, path: 'user.email' })) || '', // author.email is allowed to be empty string\n timestamp,\n timezoneOffset: new Date(timestamp * 1000).getTimezoneOffset(),\n }\n\n // Populate author object by using properties with this priority:\n // (1) provided author object\n // -> (2) author of provided commit object\n // -> (3) default author\n const normalizedAuthor = assignDefined(\n {},\n defaultAuthor,\n commit ? commit.author : undefined,\n author\n )\n\n if (normalizedAuthor.name === undefined) {\n return undefined\n }\n\n return normalizedAuthor\n}\n","// Like Object.assign but ignore properties with undefined values\n// ref: https://stackoverflow.com/q/39513815\nexport function assignDefined(target, ...sources) {\n for (const source of sources) {\n if (source) {\n for (const key of Object.keys(source)) {\n const val = source[key]\n if (val !== undefined) {\n target[key] = val\n }\n }\n }\n }\n return target\n}\n","// @ts-check\nimport '../typedefs.js'\n\nimport { GitCommit } from '../models/GitCommit.js'\nimport { _writeObject as writeObject } from '../storage/writeObject.js'\n\n/**\n * @param {object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {string} args.gitdir\n * @param {CommitObject} args.commit\n *\n * @returns {Promise<string>}\n * @see CommitObject\n *\n */\nexport async function _writeCommit({ fs, gitdir, commit }) {\n // Convert object to buffer\n const object = GitCommit.from(commit).toObject()\n const oid = await writeObject({\n fs,\n gitdir,\n type: 'commit',\n object,\n format: 'content',\n })\n return oid\n}\n","// @ts-check\nimport '../typedefs.js'\n\nimport { resolveCommit } from '../utils/resolveCommit.js'\n\n/**\n * @param {object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {any} args.cache\n * @param {string} args.gitdir\n * @param {string} args.oid\n *\n * @returns {Promise<ReadCommitResult>} Resolves successfully with a git commit object\n * @see ReadCommitResult\n * @see CommitObject\n *\n */\nexport async function _readCommit({ fs, cache, gitdir, oid }) {\n const { commit, oid: commitOid } = await resolveCommit({\n fs,\n cache,\n gitdir,\n oid,\n })\n const result = {\n oid: commitOid,\n commit: commit.parse(),\n payload: commit.withoutSignature(),\n }\n // @ts-ignore\n return result\n}\n"],"names":["root","factory","exports","module","define","amd","self","$defineProperty","$SyntaxError","$TypeError","gopd","obj","property","value","arguments","length","nonEnumerable","nonWritable","nonConfigurable","loose","desc","configurable","enumerable","writable","Function","prototype","call","read","buffer","offset","isLE","mLen","nBytes","e","m","eLen","eMax","eBias","nBits","i","d","s","NaN","Infinity","Math","pow","write","c","rt","abs","isNaN","floor","log","LN2","Buffer","toBuffer","Hash","blockSize","finalSize","this","_block","alloc","_finalSize","_blockSize","_len","update","data","enc","block","accum","assigned","remainder","min","_update","digest","rem","fill","bits","writeUInt32BE","lowBits","highBits","hash","_hash","toString","Error","round","undefined","$Object","$Error","$EvalError","$RangeError","$ReferenceError","$URIError","max","sign","$Function","getEvalledConstructor","expressionSyntax","$gOPD","throwTypeError","ThrowTypeError","calleeThrows","get","gOPDthrows","hasSymbols","getProto","$ObjectGPO","$ReflectGPO","$apply","$call","needsEval","TypedArray","Uint8Array","INTRINSICS","__proto__","AggregateError","Array","ArrayBuffer","Symbol","iterator","Atomics","BigInt","BigInt64Array","BigUint64Array","Boolean","DataView","Date","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","eval","Float16Array","Float32Array","Float64Array","FinalizationRegistry","Int8Array","Int16Array","Int32Array","isFinite","JSON","Map","Number","parseFloat","parseInt","Promise","Proxy","Reflect","RegExp","Set","SharedArrayBuffer","String","Uint8ClampedArray","Uint16Array","Uint32Array","WeakMap","WeakRef","WeakSet","error","errorProto","doEval","name","fn","gen","LEGACY_ALIASES","bind","hasOwn","$concat","concat","$spliceApply","splice","$replace","replace","$strSlice","slice","$exec","exec","rePropName","reEscapeChar","getBaseIntrinsic","allowMissing","alias","intrinsicName","parts","string","first","last","result","match","number","quote","subString","stringToPath","intrinsicBaseName","intrinsic","intrinsicRealName","skipFurtherCaching","isOwn","part","setFunctionLength","callBindBasic","applyBind","originalFunction","func","adjustedLength","apply","hasPropertyDescriptors","hasArrayLengthDefineBug","Object","defineProperty","AsyncLock","opts","queues","create","domainReentrant","process","domain","domains","timeout","DEFAULT_TIMEOUT","maxOccupationTime","DEFAULT_MAX_OCCUPATION_TIME","maxExecutionTime","DEFAULT_MAX_EXECUTION_TIME","maxPending","isInteger","DEFAULT_MAX_PENDING","acquire","key","cb","isArray","_acquireBatch","deferredResolve","deferredReject","deferred","resolve","reject","resolved","timer","occupationTimer","executionTimer","done","locked","err","ret","clearTimeout","shift","setTimeout","called","_promiseTry","then","taskFn","skipQueue","unshift","push","keys","fnx","reduceRight","prev","getFn","isBusy","copyProps","src","dst","SafeBuffer","arg","encodingOrOffset","from","allocUnsafe","allocUnsafeSlow","TypeError","size","encoding","buf","SlowBuffer","getPrototypeOf","EvalError","getOwnPropertySymbols","sym","symObj","_","getOwnPropertyNames","syms","propertyIsEnumerable","getOwnPropertyDescriptor","descriptor","utils","adler32","crc32","inflate_fast","inflate_table","Z_STREAM_ERROR","TYPE","BAD","zswap32","q","InflateState","mode","wrap","havedict","flags","dmax","check","total","head","wbits","wsize","whave","wnext","window","hold","extra","lencode","distcode","lenbits","distbits","ncode","nlen","ndist","have","next","lens","Buf16","work","lendyn","distdyn","sane","back","was","inflateResetKeep","strm","state","total_in","total_out","msg","adler","Buf32","inflateReset","inflateReset2","windowBits","inflateInit2","lenfix","distfix","virgin","fixedtables","updatewindow","end","copy","dist","Buf8","arraySet","inflateInit","inflate","flush","input","output","put","left","_in","_out","from_source","here_bits","here_op","here_val","last_bits","last_op","last_val","len","n","here","hbuf","order","avail_in","next_out","avail_out","next_in","inf_leave","text","time","xflags","os","extra_len","fromCharCode","comment","hcrc","data_type","inflateEnd","inflateGetHeader","inflateSetDictionary","dictionary","dictLength","inflateInfo","pako","assign","STR_APPLY_OK","STR_APPLY_UIA_OK","__","_utf8len","buf2binstring","subarray","shrinkBuf","string2buf","str","c2","m_pos","str_len","buf_len","charCodeAt","binstring2buf","buf2string","out","c_len","utf16buf","utf8border","pos","lbase","lext","dbase","dext","type","lens_index","codes","table","table_index","incr","low","mask","curr","drop","used","huff","base","base_index","count","MAXBITS","offs","extra_index","actualApply","makeArray","subject","REGEX_TEST_BLANK_LINE","REGEX_INVALID_TRAILING_BACKSLASH","REGEX_REPLACE_LEADING_EXCAPED_EXCLAMATION","REGEX_REPLACE_LEADING_EXCAPED_HASH","REGEX_SPLITALL_CRLF","REGEX_TEST_INVALID_PATH","TMP_KEY_IGNORE","for","KEY_IGNORE","REGEX_REGEXP_RANGE","RETURN_FALSE","REPLACERS","m1","m2","indexOf","test","index","p1","p2","leadEscape","range","endEscape","close","slashes","cleanRangeBackSlash","to","sanitizeRange","regexCache","isString","IgnoreRule","constructor","origin","pattern","negative","regex","throwError","message","Ctor","checkPath","path","originalPath","doThrow","isNotRelative","RangeError","convert","p","Ignore","ignorecase","ignoreCase","allowRelativePaths","_rules","_ignoreCase","_allowRelativePaths","_initCache","_ignoreCache","_testCache","_addPattern","_added","checkPattern","rule","substr","source","reduce","matcher","replacer","makeRegex","createRule","add","split","splitPattern","forEach","addPattern","_testOne","checkUnignored","ignored","unignored","_test","cache","slices","_t","pop","parent","join","ignores","createFilter","filter","paths","options","isPathValid","default","env","IGNORE_TEST_WIN32","platform","makePosix","REGIX_IS_WINDOWS_PATH_ABSOLUTE","CRC32","version","T0","signed_crc_table","TT","T","v","slice_by_16_tables","T1","T2","T3","T4","T5","T6","T7","T8","T9","Ta","Tb","Tc","Td","Te","Tf","bstr","seed","C","L","B","DO_NOT_EXPORT_CRC","isCallable","toStr","hasOwnProperty","list","thisArg","receiver","x","array","forEachArray","charAt","forEachString","object","k","forEachObject","$isNaN","$actualApply","args","$reflectApply","s1","s2","zlib_deflate","strings","ZStream","Deflate","level","method","chunkSize","memLevel","strategy","opt","raw","gzip","ended","chunks","status","deflateInit2","header","deflateSetHeader","dict","deflateSetDictionary","_dict_set","deflate","deflator","_mode","onEnd","onData","deflateEnd","chunk","flattenChunks","deflateRaw","reflectGetProto","originalGetProto","getDunderProto","O","zero","extra_lbits","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","D_CODES","_dist_code","_length_code","MAX_MATCH","base_length","static_l_desc","static_d_desc","static_bl_desc","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","TreeDesc","dyn_tree","stat_desc","max_code","d_code","put_short","w","pending_buf","pending","send_bits","bi_valid","bi_buf","send_code","tree","bi_reverse","code","res","gen_codes","bl_count","next_code","MAX_BITS","init_block","LITERALS","dyn_ltree","dyn_dtree","bl_tree","END_BLOCK","opt_len","static_len","last_lit","matches","bi_windup","smaller","depth","_n2","_m2","pqdownheap","heap","j","heap_len","compress_block","ltree","dtree","lc","lx","d_buf","l_buf","build_tree","node","stree","heap_max","h","xbits","f","overflow","gen_bitlen","scan_tree","curlen","prevlen","nextlen","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","_tr_stored_block","stored_len","copy_block","_tr_init","LENGTH_CODES","L_CODES","tr_static_init","l_desc","d_desc","bl_desc","_tr_flush_block","opt_lenb","static_lenb","max_blindex","black_mask","detect_data_type","BL_CODES","build_bl_tree","lcodes","dcodes","blcodes","rank","send_all_trees","_tr_tally","lit_bufsize","_tr_align","STATIC_TREES","bi_flush","inherits","K","W","Sha1","init","_w","rotl1","num","rotl5","rotl30","ft","b","_a","_b","_c","_d","_e","M","a","readInt32BE","t","H","writeInt32BE","origSymbol","hasSymbolSham","$typedArrayBuffer","callBound","isTypedArray","arr","crcTable","makeTable","crc","URIError","typedArrayBuffer","isView","useUint8Array","useArrayBuffer","useFromArrayBuffer","TYPED_ARRAY_SUPPORT","byteLength","byteOffset","uint8","isArr","isBuffer","whichTypedArray","availableTypedArrays","callBind","gOPD","$toString","hasToStringTag","g","globalThis","typedArrays","$slice","$indexOf","typedArray","toStringTag","proto","superProto","set","tag","found","getter","trySlices","tryTypedArrays","GetIntrinsic","ctor","superCtor","super_","TempCtor","implementation","hasDescriptors","$floor","functionLengthIsConfigurable","functionLengthIsWritable","zlib_inflate","GZheader","Inflate","Z_OK","inflator","next_out_utf8","tail","utf8str","allowBufError","Z_FINISH","Z_NO_FLUSH","Z_NEED_DICT","Z_BUF_ERROR","Z_STREAM_END","Z_SYNC_FLUSH","inflateRaw","ungzip","hasProtoAccessor","$getPrototypeOf","start","beg","s_window","lcode","dcode","lmask","dmask","op","top","dolen","b64","getLens","validLen","placeHoldersLen","toByteArray","tmp","Arr","_byteLength","curByte","revLookup","fromByteArray","extraBytes","maxChunkLength","len2","encodeChunk","lookup","tripletToBase64","SyntaxError","base64","ieee754","customInspectSymbol","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","setPrototypeOf","isEncoding","actual","fromString","arrayView","isInstance","fromArrayBuffer","fromArrayLike","fromArrayView","valueOf","checked","numberIsNaN","fromObject","toPrimitive","assertSize","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","toLowerCase","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","val","dir","arrayIndexOf","lastIndexOf","indexSize","arrLength","valLength","readUInt16BE","foundIndex","hexWrite","remaining","strLen","parsed","utf8Write","blitBuffer","asciiWrite","byteArray","asciiToBytes","base64Write","ucs2Write","units","hi","lo","utf16leToBytes","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","codePoints","MAX_ARGUMENTS_LENGTH","decodeCodePointsArray","kMaxLength","foo","typedArraySupport","console","poolSize","_isBuffer","compare","y","swap16","swap32","swap64","toLocaleString","equals","inspect","trim","target","thisStart","thisEnd","thisCopy","targetCopy","includes","toJSON","_arr","hexSliceLookupTable","bytes","checkOffset","ext","checkInt","wrtBigUInt64LE","checkIntBI","wrtBigUInt64BE","checkIEEE754","writeFloat","littleEndian","noAssert","writeDouble","newBuf","readUintLE","readUIntLE","mul","readUintBE","readUIntBE","readUint8","readUInt8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUInt32LE","readUint32BE","readUInt32BE","readBigUInt64LE","defineBigIntMethod","validateNumber","boundsError","readBigUInt64BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readBigInt64LE","readBigInt64BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUintLE","writeUIntLE","writeUintBE","writeUIntBE","writeUint8","writeUInt8","writeUint16LE","writeUInt16LE","writeUint16BE","writeUInt16BE","writeUint32LE","writeUInt32LE","writeUint32BE","writeBigUInt64LE","writeBigUInt64BE","writeIntLE","limit","sub","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeBigInt64LE","writeBigInt64BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","copyWithin","errors","E","getMessage","Base","super","stack","addNumericalSeparator","ERR_OUT_OF_RANGE","checkBounds","ERR_INVALID_ARG_TYPE","ERR_BUFFER_OUT_OF_BOUNDS","received","INVALID_BASE64_RE","leadSurrogate","base64clean","alphabet","i16","BufferBigIntNotDefined","configuration_table","trees","MIN_LOOKAHEAD","HCRC_STATE","BUSY_STATE","FINISH_STATE","errorCode","flush_pending","pending_out","flush_block_only","block_start","strstart","put_byte","putShortMSB","read_buf","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","w_size","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","more","_w_size","window_size","hash_size","insert","ins_h","hash_shift","hash_mask","deflate_fast","hash_head","bflush","match_length","max_lazy_match","MIN_MATCH","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","DeflateState","pending_buf_size","gzhead","gzindex","last_flush","w_bits","hash_bits","HEAP_SIZE","deflateResetKeep","deflateReset","max_block_size","max_start","deflateInit","old_flush","bstate","deflate_huff","deflate_rle","avail","tmpDict","deflateInfo","possibleNames","concatty","that","bound","arrLike","slicy","boundLength","boundArgs","joiny","Empty","ReferenceError","badArrayLike","isCallableMarker","fnToStr","reflectApply","constructorRegex","isES6ClassFn","fnStr","tryFunctionObject","isIE68","isDDA","document","all","strClass","Z_PARTIAL_FLUSH","Z_FULL_FLUSH","Z_BLOCK","Z_TREES","Z_ERRNO","Z_DATA_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_BINARY","Z_TEXT","Z_UNKNOWN","Z_DEFLATED","TYPED_OK","_has","sources","fnTyped","dest","src_offs","dest_offs","l","fnUntyped","setTyped","on","$hasOwn","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","definition","o","prop","r","bool","schema","core","filemode","bare","logallrefupdates","symlinks","bigFileThreshold","endsWith","SECTION_LINE_REGEX","SECTION_REGEX","VARIABLE_LINE_REGEX","VARIABLE_NAME_REGEX","VARIABLE_VALUE_COMMENT_REGEX","hasOddNumberOfQuotes","removeQuotes","newText","idx","isQuote","isEscapeForQuote","lower","getPath","section","subsection","normalizePath","pathSegments","sectionPath","isSection","GitConfig","parsedConfig","map","line","trimmedLine","extractedSection","extractSectionLine","extractedVariable","rawValue","valueWithoutComments","commentMatches","valueWithoutComment","removeComments","extractVariableLine","getall","normalizedPath","allValues","config","getSubsections","deleteSection","append","configIndex","callback","lastIndex","item","modifiedConfig","modified","sectionIndex","findIndex","newConfig","newSection","GitConfigManager","fs","gitdir","save","dirname","joined","isAbsolute","trailingSeparator","at","aar","lastSegmentLength","lastSlash","dots","char","lastSlashIndex","normalizeString","normalize","isIgnored","filepath","basename","excludes","excludesFile","exists","pairs","gitignore","pieces","folder","file","ignoredStatus","ign","ignore","parentdir","BaseError","caller","fromJSON","json","isIsomorphicGitError","UnmergedPathsError","filepaths","UnsafeFilepathError","BufferCursor","_start","eof","tell","seek","comparePath","compareStrings","normalizeMode","permissions","MAX_UINT32","SecondsNanoseconds","givenSeconds","givenNanoseconds","milliseconds","date","seconds","normalizeStats","ctimeSeconds","ctimeNanoseconds","ctimeMs","ctime","mtimeSeconds","mtimeNanoseconds","mtimeMs","mtime","dev","ino","uid","gid","supportsSubtleSHA1","async","shasum","subtleSHA1","testSubtleSHA1","shasumSync","hex","byte","toHex","crypto","subtle","parseCacheEntryFlags","assumeValid","extended","stage","nameLength","GitIndex","entries","unmergedPaths","_dirty","_unmergedPaths","_entries","_addEntry","entry","stages","delete","existingEntry","fromBuffer","reader","magic","shaComputed","shaClaimed","numEntries","oid","pathlength","padding","values","sort","entriesMap","entriesFlat","flatMap","stats","bfilepath","has","startsWith","clear","render","_entryToBuffer","bpath","ceil","written","writer","stat","renderCacheEntryFlags","toObject","entryBuffers","body","main","sum","lock","IndexCache","allowUnmerged","closure","theIndexCache","savedStats","currStats","lstat","trustino","compareStats","isIndexStale","rawIndexFile","updateCachedIndexFile","InvalidOidError","NoRefspecError","remote","what","GitPackedRefs","refs","ref","peeled","GitRefSpec","remotePath","localPath","force","matchPrefix","refspec","forceMatch","remoteGlobMatch","localGlobMatch","remoteIsGlob","translate","remoteBranch","reverseTranslate","localBranch","GitRefSpecSet","rules","refspecs","remoteRefs","remoteRef","localRef","translateOne","localNamespaces","compareRefNames","refpaths","GIT_FILES","acquireLock","GitRefManager","updateRemoteRefs","symrefs","tags","prune","pruneTags","actualRefsToWrite","listRefs","deleteRefs","serverRef","refTranslations","translatedRef","symrefTranslations","symtarget","pruned","writeRef","writeSymbolicRef","deleteRef","rm","packed","beforeSize","packedMap","packedRefs","allpaths","sha","expand","expandAgainstMap","resolveAgainstMap","fullref","files","readdirDeep","listBranches","listTags","HttpError","statusCode","statusMessage","response","SmartHttpError","preview","UserCanceledError","calculateBasicAuthHeader","username","password","getIterator","iterable","asyncIterator","queue","return","fromValue","extractAuthFromUrl","url","userpass","auth","EmptyServerResponseError","ParseError","expected","StreamReader","stream","cursor","undoCursor","started","_ended","_discardedBytes","_init","_loadnext","_moveCursor","_trim","_accumulate","skip","undo","_next","buffers","lengthBuffers","nextbuffer","acc","GitPktLine","delim","encode","hexlength","repeat","padHex","streamReader","parseCapabilitiesV2","capabilities2","protocolVersion","parseRefsAdResponse","service","capabilities","lineOne","lineTwo","firstRef","capabilitiesLine","splitAndAssert","cap","sep","corsProxify","corsProxy","updateHeaders","headers","Authorization","stringifyBody","iter","forAwait","nextIndex","collect","GitRemoteHTTP","discover","http","onProgress","onAuth","onAuthSuccess","onAuthFailure","_origUrl","proxifiedURL","tryAgain","providedAuthBefore","request","getAuth","cancel","remoteHTTP","connect","urlAuth","accept","UnknownTransportError","transport","suggestion","UrlParseError","GitRemoteManager","getRemoteHelperFor","remoteHelpers","address","parseRemoteUrl","translateSSHtoHTTP","GitShallowManager","oids","ObjectTypeError","formatAuthor","email","timestamp","timezoneOffset","minutes","is","simpleSign","hours","strHours","strMinutes","formatTimezoneOffset","normalizeNewlines","parseAuthor","author","parseTimezoneOffset","GitAnnotatedTag","_tag","tagger","gpgsig","justHeaders","withoutSignature","parse","hs","committer","payload","secretKey","signature","signedTag","indent","GitCommit","commit","_commit","fromPayloadSignature","justMessage","parseHeaders","renderHeaders","isolateSignature","signedCommit","GitObject","headerLen","totalLength","wrappedObject","unwrap","actualLength","readVarIntLE","readCompactLE","readOp","parseHeader","ofs","reference","supportsDecompressionStream","DecompressionStream","testDecompressionStream","ds","Blob","pipeThrough","Response","arrayBuffer","browserInflate","GitPackIndex","stuff","offsetCache","fromIdx","getExternalRefDelta","hashes","offsets","packfileSha","crcs","fromPack","pack","listpackTypes","offsetToObject","totalObjectCount","lastPercent","PACK","numObjects","listpack","percent","phase","loaded","offsetArray","objectsByDepth","readDepth","externalReadDepth","readSlice","fanoutBuffer","crcsBuffer","offsetsBuffer","totalBuffer","shaBuffer","load","unload","btype","lastFour","startWith","otherVarIntDecode","multibyte","lastSeven","decodeVarInt","baseOffset","delta","sourceSize","targetSize","firstOp","applyDelta","format","PackfileCache","readPackIndex","filename","emitter","emitterPrefix","loadPackIndex","readdir","indexFile","packFile","_checksumVerified","expectedShaFromIndex","packTrailer","packTrailerSha","padStart","actualPayloadSha","readObjectPacked","resolveCommit","supportsCompressionStream","dryRun","CompressionStream","testCompressionStream","cs","browserDeflate","writeObjectLoose","InvalidRefNameError","MissingNameError","role","GitRefStash","timezoneOffsetForRefLogEntry","offsetMinutes","getTimezoneOffset","offsetHours","offsetMinutesFormatted","createStashReflogEntry","stashCommit","nameNoSpace","now","getStashReflogEntry","reflogString","reverse","_getConfig","GitStashManager","_author","refStash","refLogsStash","refStashPath","refLogsStashPath","getAuthor","normalizedAuthor","assignDefined","normalizeAuthorObject","getStashSHA","refIdx","stashEntries","readStashReflogs","writeStashCommit","_writeCommit","readStashCommit","stashSHA","commitOid","_readCommit","writeStashRef","writeStashReflogEntry","appendTo"],"sourceRoot":""}
1
+ {"version":3,"file":"managers/index.umd.min.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAa,IAAID,IAEjBD,EAAU,IAAIC,GACf,CATD,CASGK,KAAM,I,uCCPT,IAAIC,EAAkB,EAAQ,KAE1BC,EAAe,EAAQ,MACvBC,EAAa,EAAQ,MAErBC,EAAO,EAAQ,MAGnBP,EAAOD,QAAU,SAChBS,EACAC,EACAC,GAEA,IAAKF,GAAuB,iBAARA,GAAmC,mBAARA,EAC9C,MAAM,IAAIF,EAAW,0CAEtB,GAAwB,iBAAbG,GAA6C,iBAAbA,EAC1C,MAAM,IAAIH,EAAW,4CAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,IAAqC,OAAjBA,UAAU,GAC1E,MAAM,IAAIL,EAAW,2DAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,IAAqC,OAAjBA,UAAU,GAC1E,MAAM,IAAIL,EAAW,yDAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,IAAqC,OAAjBA,UAAU,GAC1E,MAAM,IAAIL,EAAW,6DAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBD,UAAU,GAC5C,MAAM,IAAIL,EAAW,2CAGtB,IAAIO,EAAgBF,UAAUC,OAAS,EAAID,UAAU,GAAK,KACtDG,EAAcH,UAAUC,OAAS,EAAID,UAAU,GAAK,KACpDI,EAAkBJ,UAAUC,OAAS,EAAID,UAAU,GAAK,KACxDK,EAAQL,UAAUC,OAAS,GAAID,UAAU,GAGzCM,IAASV,GAAQA,EAAKC,EAAKC,GAE/B,GAAIL,EACHA,EAAgBI,EAAKC,EAAU,CAC9BS,aAAkC,OAApBH,GAA4BE,EAAOA,EAAKC,cAAgBH,EACtEI,WAA8B,OAAlBN,GAA0BI,EAAOA,EAAKE,YAAcN,EAChEH,MAAOA,EACPU,SAA0B,OAAhBN,GAAwBG,EAAOA,EAAKG,UAAYN,QAErD,KAAIE,IAAWH,GAAkBC,GAAgBC,GAIvD,MAAM,IAAIV,EAAa,+GAFvBG,EAAIC,GAAYC,CAGjB,CACD,C,sBCpDAV,EAAOD,QAAUsB,SAASC,UAAUC,I,cCFpCxB,EAAQyB,KAAO,SAAUC,EAAQC,EAAQC,EAAMC,EAAMC,GACnD,IAAIC,EAAGC,EACHC,EAAiB,EAATH,EAAcD,EAAO,EAC7BK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTC,EAAIT,EAAQE,EAAS,EAAK,EAC1BQ,EAAIV,GAAQ,EAAI,EAChBW,EAAIb,EAAOC,EAASU,GAOxB,IALAA,GAAKC,EAELP,EAAIQ,GAAM,IAAOH,GAAU,EAC3BG,KAAQH,EACRA,GAASH,EACFG,EAAQ,EAAGL,EAAS,IAAJA,EAAWL,EAAOC,EAASU,GAAIA,GAAKC,EAAGF,GAAS,GAKvE,IAHAJ,EAAID,GAAM,IAAOK,GAAU,EAC3BL,KAAQK,EACRA,GAASP,EACFO,EAAQ,EAAGJ,EAAS,IAAJA,EAAWN,EAAOC,EAASU,GAAIA,GAAKC,EAAGF,GAAS,GAEvE,GAAU,IAANL,EACFA,EAAI,EAAII,MACH,IAAIJ,IAAMG,EACf,OAAOF,EAAIQ,IAAsBC,KAAdF,GAAK,EAAI,GAE5BP,GAAQU,KAAKC,IAAI,EAAGd,GACpBE,GAAQI,CACV,CACA,OAAQI,GAAK,EAAI,GAAKP,EAAIU,KAAKC,IAAI,EAAGZ,EAAIF,EAC5C,EAEA7B,EAAQ4C,MAAQ,SAAUlB,EAAQf,EAAOgB,EAAQC,EAAMC,EAAMC,GAC3D,IAAIC,EAAGC,EAAGa,EACNZ,EAAiB,EAATH,EAAcD,EAAO,EAC7BK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBY,EAAe,KAATjB,EAAca,KAAKC,IAAI,GAAI,IAAMD,KAAKC,IAAI,GAAI,IAAM,EAC1DN,EAAIT,EAAO,EAAKE,EAAS,EACzBQ,EAAIV,EAAO,GAAK,EAChBW,EAAI5B,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQ+B,KAAKK,IAAIpC,GAEbqC,MAAMrC,IAAUA,IAAU8B,KAC5BT,EAAIgB,MAAMrC,GAAS,EAAI,EACvBoB,EAAIG,IAEJH,EAAIW,KAAKO,MAAMP,KAAKQ,IAAIvC,GAAS+B,KAAKS,KAClCxC,GAASkC,EAAIH,KAAKC,IAAI,GAAIZ,IAAM,IAClCA,IACAc,GAAK,IAGLlC,GADEoB,EAAII,GAAS,EACNW,EAAKD,EAELC,EAAKJ,KAAKC,IAAI,EAAG,EAAIR,IAEpBU,GAAK,IACfd,IACAc,GAAK,GAGHd,EAAII,GAASD,GACfF,EAAI,EACJD,EAAIG,GACKH,EAAII,GAAS,GACtBH,GAAMrB,EAAQkC,EAAK,GAAKH,KAAKC,IAAI,EAAGd,GACpCE,GAAQI,IAERH,EAAIrB,EAAQ+B,KAAKC,IAAI,EAAGR,EAAQ,GAAKO,KAAKC,IAAI,EAAGd,GACjDE,EAAI,IAIDF,GAAQ,EAAGH,EAAOC,EAASU,GAAS,IAAJL,EAAUK,GAAKC,EAAGN,GAAK,IAAKH,GAAQ,GAI3E,IAFAE,EAAKA,GAAKF,EAAQG,EAClBC,GAAQJ,EACDI,EAAO,EAAGP,EAAOC,EAASU,GAAS,IAAJN,EAAUM,GAAKC,EAAGP,GAAK,IAAKE,GAAQ,GAE1EP,EAAOC,EAASU,EAAIC,IAAU,IAAJC,CAC5B,C,6BClFA,IAAIa,EAAS,eACTC,EAAW,EAAQ,MAGvB,SAASC,EAAKC,EAAWC,GACxBC,KAAKC,OAASN,EAAOO,MAAMJ,GAC3BE,KAAKG,WAAaJ,EAClBC,KAAKI,WAAaN,EAClBE,KAAKK,KAAO,CACb,CAEAR,EAAK/B,UAAUwC,OAAS,SAAUC,EAAMC,GAEvCD,EAAOX,EAASW,EAAMC,GAAO,QAO7B,IALA,IAAIC,EAAQT,KAAKC,OACbH,EAAYE,KAAKI,WACjBhD,EAASmD,EAAKnD,OACdsD,EAAQV,KAAKK,KAERnC,EAAS,EAAGA,EAASd,GAAS,CAItC,IAHA,IAAIuD,EAAWD,EAAQZ,EACnBc,EAAY3B,KAAK4B,IAAIzD,EAASc,EAAQ4B,EAAYa,GAE7C/B,EAAI,EAAGA,EAAIgC,EAAWhC,IAC9B6B,EAAME,EAAW/B,GAAK2B,EAAKrC,EAASU,GAIrCV,GAAU0C,GADVF,GAASE,GAGId,IAAe,GAC3BE,KAAKc,QAAQL,EAEf,CAGA,OADAT,KAAKK,MAAQjD,EACN4C,IACR,EAEAH,EAAK/B,UAAUiD,OAAS,SAAUP,GACjC,IAAIQ,EAAMhB,KAAKK,KAAOL,KAAKI,WAE3BJ,KAAKC,OAAOe,GAAO,IAMnBhB,KAAKC,OAAOgB,KAAK,EAAGD,EAAM,GAEtBA,GAAOhB,KAAKG,aACfH,KAAKc,QAAQd,KAAKC,QAClBD,KAAKC,OAAOgB,KAAK,IAGlB,IAAIC,EAAmB,EAAZlB,KAAKK,KAGhB,GAAIa,GAAQ,WACXlB,KAAKC,OAAOkB,cAAcD,EAAMlB,KAAKI,WAAa,OAG5C,CACN,IAAIgB,GAAkB,WAAPF,KAAuB,EAClCG,GAAYH,EAAOE,GAAW,WAElCpB,KAAKC,OAAOkB,cAAcE,EAAUrB,KAAKI,WAAa,GACtDJ,KAAKC,OAAOkB,cAAcC,EAASpB,KAAKI,WAAa,EACtD,CAEAJ,KAAKc,QAAQd,KAAKC,QAClB,IAAIqB,EAAOtB,KAAKuB,QAEhB,OAAOf,EAAMc,EAAKE,SAAShB,GAAOc,CACnC,EAEAzB,EAAK/B,UAAUgD,QAAU,WACxB,MAAM,IAAIW,MAAM,0CACjB,EAEAjF,EAAOD,QAAUsD,C,uBChFjBrD,EAAOD,QAAU0C,KAAKyC,K,6BCDtB,IAAIC,EAEAC,EAAU,EAAQ,MAElBC,EAAS,EAAQ,MACjBC,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MACtBC,EAAkB,EAAQ,MAC1BnF,EAAe,EAAQ,MACvBC,EAAa,EAAQ,MACrBmF,EAAY,EAAQ,MAEpB3C,EAAM,EAAQ,MACdE,EAAQ,EAAQ,MAChB0C,EAAM,EAAQ,MACdrB,EAAM,EAAQ,MACd3B,EAAM,EAAQ,MACdwC,EAAQ,EAAQ,KAChBS,EAAO,EAAQ,MAEfC,EAAYvE,SAGZwE,EAAwB,SAAUC,GACrC,IACC,OAAOF,EAAU,yBAA2BE,EAAmB,iBAAxDF,EACR,CAAE,MAAO9D,GAAI,CACd,EAEIiE,EAAQ,EAAQ,MAChB3F,EAAkB,EAAQ,KAE1B4F,EAAiB,WACpB,MAAM,IAAI1F,CACX,EACI2F,EAAiBF,EACjB,WACF,IAGC,OAAOC,CACR,CAAE,MAAOE,GACR,IAEC,OAAOH,EAAMpF,UAAW,UAAUwF,GACnC,CAAE,MAAOC,GACR,OAAOJ,CACR,CACD,CACD,CAbE,GAcAA,EAECK,EAAa,EAAQ,KAAR,GAEbC,EAAW,EAAQ,MACnBC,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MAEtBC,EAAS,EAAQ,MACjBC,EAAQ,EAAQ,IAEhBC,EAAY,CAAC,EAEbC,EAAmC,oBAAfC,YAA+BP,EAAuBA,EAASO,YAArB1B,EAE9D2B,EAAa,CAChBC,UAAW,KACX,mBAA8C,oBAAnBC,eAAiC7B,EAAY6B,eACxE,UAAWC,MACX,gBAAwC,oBAAhBC,YAA8B/B,EAAY+B,YAClE,2BAA4Bb,GAAcC,EAAWA,EAAS,GAAGa,OAAOC,aAAejC,EACvF,mCAAoCA,EACpC,kBAAmBwB,EACnB,mBAAoBA,EACpB,2BAA4BA,EAC5B,2BAA4BA,EAC5B,YAAgC,oBAAZU,QAA0BlC,EAAYkC,QAC1D,WAA8B,oBAAXC,OAAyBnC,EAAYmC,OACxD,kBAA4C,oBAAlBC,cAAgCpC,EAAYoC,cACtE,mBAA8C,oBAAnBC,eAAiCrC,EAAYqC,eACxE,YAAaC,QACb,aAAkC,oBAAbC,SAA2BvC,EAAYuC,SAC5D,SAAUC,KACV,cAAeC,UACf,uBAAwBC,mBACxB,cAAeC,UACf,uBAAwBC,mBACxB,UAAW1C,EACX,SAAU2C,KACV,cAAe1C,EACf,iBAA0C,oBAAjB2C,aAA+B9C,EAAY8C,aACpE,iBAA0C,oBAAjBC,aAA+B/C,EAAY+C,aACpE,iBAA0C,oBAAjBC,aAA+BhD,EAAYgD,aACpE,yBAA0D,oBAAzBC,qBAAuCjD,EAAYiD,qBACpF,aAAcxC,EACd,sBAAuBe,EACvB,cAAoC,oBAAd0B,UAA4BlD,EAAYkD,UAC9D,eAAsC,oBAAfC,WAA6BnD,EAAYmD,WAChE,eAAsC,oBAAfC,WAA6BpD,EAAYoD,WAChE,aAAcC,SACd,UAAWzF,MACX,sBAAuBsD,GAAcC,EAAWA,EAASA,EAAS,GAAGa,OAAOC,cAAgBjC,EAC5F,SAA0B,iBAATsD,KAAoBA,KAAOtD,EAC5C,QAAwB,oBAARuD,IAAsBvD,EAAYuD,IAClD,yBAAyC,oBAARA,KAAwBrC,GAAeC,EAAuBA,GAAS,IAAIoC,KAAMvB,OAAOC,aAAtCjC,EACnF,SAAU1C,KACV,WAAYkG,OACZ,WAAYvD,EACZ,oCAAqCW,EACrC,eAAgB6C,WAChB,aAAcC,SACd,YAAgC,oBAAZC,QAA0B3D,EAAY2D,QAC1D,UAA4B,oBAAVC,MAAwB5D,EAAY4D,MACtD,eAAgBxD,EAChB,mBAAoBC,EACpB,YAAgC,oBAAZwD,QAA0B7D,EAAY6D,QAC1D,WAAYC,OACZ,QAAwB,oBAARC,IAAsB/D,EAAY+D,IAClD,yBAAyC,oBAARA,KAAwB7C,GAAeC,EAAuBA,GAAS,IAAI4C,KAAM/B,OAAOC,aAAtCjC,EACnF,sBAAoD,oBAAtBgE,kBAAoChE,EAAYgE,kBAC9E,WAAYC,OACZ,4BAA6B/C,GAAcC,EAAWA,EAAS,GAAGa,OAAOC,aAAejC,EACxF,WAAYkB,EAAac,OAAShC,EAClC,gBAAiB9E,EACjB,mBAAoB4F,EACpB,eAAgBW,EAChB,cAAetG,EACf,eAAsC,oBAAfuG,WAA6B1B,EAAY0B,WAChE,sBAAoD,oBAAtBwC,kBAAoClE,EAAYkE,kBAC9E,gBAAwC,oBAAhBC,YAA8BnE,EAAYmE,YAClE,gBAAwC,oBAAhBC,YAA8BpE,EAAYoE,YAClE,aAAc9D,EACd,YAAgC,oBAAZ+D,QAA0BrE,EAAYqE,QAC1D,YAAgC,oBAAZC,QAA0BtE,EAAYsE,QAC1D,YAAgC,oBAAZC,QAA0BvE,EAAYuE,QAE1D,4BAA6BhD,EAC7B,6BAA8BD,EAC9B,0BAA2BrG,EAC3B,0BAA2BmG,EAC3B,aAAczD,EACd,eAAgBE,EAChB,aAAc0C,EACd,aAAcrB,EACd,aAAc3B,EACd,eAAgBwC,EAChB,cAAeS,EACf,2BAA4Ba,GAG7B,GAAIF,EACH,IACC,KAAKqD,KACN,CAAE,MAAO7H,GAER,IAAI8H,EAAatD,EAASA,EAASxE,IACnCgF,EAAW,qBAAuB8C,CACnC,CAGD,IAAIC,EAAS,SAASA,EAAOC,GAC5B,IAAIpJ,EACJ,GAAa,oBAAToJ,EACHpJ,EAAQmF,EAAsB,6BACxB,GAAa,wBAATiE,EACVpJ,EAAQmF,EAAsB,wBACxB,GAAa,6BAATiE,EACVpJ,EAAQmF,EAAsB,8BACxB,GAAa,qBAATiE,EAA6B,CACvC,IAAIC,EAAKF,EAAO,4BACZE,IACHrJ,EAAQqJ,EAAGzI,UAEb,MAAO,GAAa,6BAATwI,EAAqC,CAC/C,IAAIE,EAAMH,EAAO,oBACbG,GAAO1D,IACV5F,EAAQ4F,EAAS0D,EAAI1I,WAEvB,CAIA,OAFAwF,EAAWgD,GAAQpJ,EAEZA,CACR,EAEIuJ,EAAiB,CACpBlD,UAAW,KACX,yBAA0B,CAAC,cAAe,aAC1C,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,QAAS,YAAa,WAC/C,uBAAwB,CAAC,QAAS,YAAa,WAC/C,oBAAqB,CAAC,QAAS,YAAa,QAC5C,sBAAuB,CAAC,QAAS,YAAa,UAC9C,2BAA4B,CAAC,gBAAiB,aAC9C,mBAAoB,CAAC,yBAA0B,aAC/C,4BAA6B,CAAC,yBAA0B,YAAa,aACrE,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,WAAY,aACpC,kBAAmB,CAAC,OAAQ,aAC5B,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,YAAa,aACtC,0BAA2B,CAAC,eAAgB,aAC5C,0BAA2B,CAAC,eAAgB,aAC5C,sBAAuB,CAAC,WAAY,aACpC,cAAe,CAAC,oBAAqB,aACrC,uBAAwB,CAAC,oBAAqB,YAAa,aAC3D,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,wBAAyB,CAAC,aAAc,aACxC,cAAe,CAAC,OAAQ,SACxB,kBAAmB,CAAC,OAAQ,aAC5B,iBAAkB,CAAC,MAAO,aAC1B,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,sBAAuB,CAAC,SAAU,YAAa,YAC/C,qBAAsB,CAAC,SAAU,YAAa,WAC9C,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,UAAW,YAAa,QAChD,gBAAiB,CAAC,UAAW,OAC7B,mBAAoB,CAAC,UAAW,UAChC,oBAAqB,CAAC,UAAW,WACjC,wBAAyB,CAAC,aAAc,aACxC,4BAA6B,CAAC,iBAAkB,aAChD,oBAAqB,CAAC,SAAU,aAChC,iBAAkB,CAAC,MAAO,aAC1B,+BAAgC,CAAC,oBAAqB,aACtD,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,yBAA0B,CAAC,cAAe,aAC1C,wBAAyB,CAAC,aAAc,aACxC,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,+BAAgC,CAAC,oBAAqB,aACtD,yBAA0B,CAAC,cAAe,aAC1C,yBAA0B,CAAC,cAAe,aAC1C,sBAAuB,CAAC,WAAY,aACpC,qBAAsB,CAAC,UAAW,aAClC,qBAAsB,CAAC,UAAW,cAG/BmD,EAAO,EAAQ,MACfC,EAAS,EAAQ,MACjBC,EAAUF,EAAK3I,KAAKmF,EAAOO,MAAM3F,UAAU+I,QAC3CC,EAAeJ,EAAK3I,KAAKkF,EAAQQ,MAAM3F,UAAUiJ,QACjDC,EAAWN,EAAK3I,KAAKmF,EAAO0C,OAAO9H,UAAUmJ,SAC7CC,EAAYR,EAAK3I,KAAKmF,EAAO0C,OAAO9H,UAAUqJ,OAC9CC,EAAQV,EAAK3I,KAAKmF,EAAOuC,OAAO3H,UAAUuJ,MAG1CC,EAAa,qGACbC,EAAe,WAiBfC,EAAmB,SAA0BlB,EAAMmB,GACtD,IACIC,EADAC,EAAgBrB,EAOpB,GALIK,EAAOF,EAAgBkB,KAE1BA,EAAgB,KADhBD,EAAQjB,EAAekB,IACK,GAAK,KAG9BhB,EAAOrD,EAAYqE,GAAgB,CACtC,IAAIzK,EAAQoG,EAAWqE,GAIvB,GAHIzK,IAAUiG,IACbjG,EAAQmJ,EAAOsB,SAEK,IAAVzK,IAA0BuK,EACpC,MAAM,IAAI3K,EAAW,aAAewJ,EAAO,wDAG5C,MAAO,CACNoB,MAAOA,EACPpB,KAAMqB,EACNzK,MAAOA,EAET,CAEA,MAAM,IAAIL,EAAa,aAAeyJ,EAAO,mBAC9C,EAEA9J,EAAOD,QAAU,SAAsB+J,EAAMmB,GAC5C,GAAoB,iBAATnB,GAAqC,IAAhBA,EAAKlJ,OACpC,MAAM,IAAIN,EAAW,6CAEtB,GAAIK,UAAUC,OAAS,GAA6B,kBAAjBqK,EAClC,MAAM,IAAI3K,EAAW,6CAGtB,GAAmC,OAA/BsK,EAAM,cAAed,GACxB,MAAM,IAAIzJ,EAAa,sFAExB,IAAI+K,EAtDc,SAAsBC,GACxC,IAAIC,EAAQZ,EAAUW,EAAQ,EAAG,GAC7BE,EAAOb,EAAUW,GAAS,GAC9B,GAAc,MAAVC,GAA0B,MAATC,EACpB,MAAM,IAAIlL,EAAa,kDACjB,GAAa,MAATkL,GAA0B,MAAVD,EAC1B,MAAM,IAAIjL,EAAa,kDAExB,IAAImL,EAAS,GAIb,OAHAhB,EAASa,EAAQP,EAAY,SAAUW,EAAOC,EAAQC,EAAOC,GAC5DJ,EAAOA,EAAO5K,QAAU+K,EAAQnB,EAASoB,EAAWb,EAAc,MAAQW,GAAUD,CACrF,GACOD,CACR,CAyCaK,CAAa/B,GACrBgC,EAAoBV,EAAMxK,OAAS,EAAIwK,EAAM,GAAK,GAElDW,EAAYf,EAAiB,IAAMc,EAAoB,IAAKb,GAC5De,EAAoBD,EAAUjC,KAC9BpJ,EAAQqL,EAAUrL,MAClBuL,GAAqB,EAErBf,EAAQa,EAAUb,MAClBA,IACHY,EAAoBZ,EAAM,GAC1BZ,EAAac,EAAOhB,EAAQ,CAAC,EAAG,GAAIc,KAGrC,IAAK,IAAI9I,EAAI,EAAG8J,GAAQ,EAAM9J,EAAIgJ,EAAMxK,OAAQwB,GAAK,EAAG,CACvD,IAAI+J,EAAOf,EAAMhJ,GACbkJ,EAAQZ,EAAUyB,EAAM,EAAG,GAC3BZ,EAAOb,EAAUyB,GAAO,GAC5B,IAEa,MAAVb,GAA2B,MAAVA,GAA2B,MAAVA,GACtB,MAATC,GAAyB,MAATA,GAAyB,MAATA,IAElCD,IAAUC,EAEb,MAAM,IAAIlL,EAAa,wDASxB,GAPa,gBAAT8L,GAA2BD,IAC9BD,GAAqB,GAMlB9B,EAAOrD,EAFXkF,EAAoB,KADpBF,GAAqB,IAAMK,GACmB,KAG7CzL,EAAQoG,EAAWkF,QACb,GAAa,MAATtL,EAAe,CACzB,KAAMyL,KAAQzL,GAAQ,CACrB,IAAKuK,EACJ,MAAM,IAAI3K,EAAW,sBAAwBwJ,EAAO,+CAErD,MACD,CACA,GAAI/D,GAAU3D,EAAI,GAAMgJ,EAAMxK,OAAQ,CACrC,IAAIK,EAAO8E,EAAMrF,EAAOyL,GAWvBzL,GAVDwL,IAAUjL,IASG,QAASA,KAAU,kBAAmBA,EAAKkF,KAC/ClF,EAAKkF,IAELzF,EAAMyL,EAEhB,MACCD,EAAQ/B,EAAOzJ,EAAOyL,GACtBzL,EAAQA,EAAMyL,GAGXD,IAAUD,IACbnF,EAAWkF,GAAqBtL,EAElC,CACD,CACA,OAAOA,CACR,C,6BCvXA,IAAI0L,EAAoB,EAAQ,MAE5BhM,EAAkB,EAAQ,KAE1BiM,EAAgB,EAAQ,MACxBC,EAAY,EAAQ,MAExBtM,EAAOD,QAAU,SAAkBwM,GAClC,IAAIC,EAAOH,EAAc1L,WACrB8L,EAAiBF,EAAiB3L,QAAUD,UAAUC,OAAS,GACnE,OAAOwL,EACNI,EACA,GAAKC,EAAiB,EAAIA,EAAiB,IAC3C,EAEF,EAEIrM,EACHA,EAAgBJ,EAAOD,QAAS,QAAS,CAAEW,MAAO4L,IAElDtM,EAAOD,QAAQ2M,MAAQJ,C,6BCpBxB,IAAIlM,EAAkB,EAAQ,KAE1BuM,EAAyB,WAC5B,QAASvM,CACV,EAEAuM,EAAuBC,wBAA0B,WAEhD,IAAKxM,EACJ,OAAO,KAER,IACC,OAA8D,IAAvDA,EAAgB,GAAI,SAAU,CAAEM,MAAO,IAAKE,MACpD,CAAE,MAAOkB,GAER,OAAO,CACR,CACD,EAEA9B,EAAOD,QAAU4M,C,uBClBjB,IAAIvM,EAAkByM,OAAOC,iBAAkB,EAC/C,GAAI1M,EACH,IACCA,EAAgB,CAAC,EAAG,IAAK,CAAEM,MAAO,GACnC,CAAE,MAAOoB,GAER1B,GAAkB,CACnB,CAGDJ,EAAOD,QAAUK,C,uBCXjB,IAAI2M,EAAY,SAAUC,GAWzB,GAVAA,EAAOA,GAAQ,CAAC,EAEhBxJ,KAAKsF,QAAUkE,EAAKlE,SAAWA,QAI/BtF,KAAKyJ,OAASJ,OAAOK,OAAO,MAG5B1J,KAAK2J,gBAAkBH,EAAKG,kBAAmB,EAC3C3J,KAAK2J,gBAAiB,CACzB,GAAuB,oBAAZC,cAAqD,IAAnBA,QAAQC,OACpD,MAAM,IAAIpI,MACT,2LAIFzB,KAAK8J,QAAUT,OAAOK,OAAO,KAC9B,CAEA1J,KAAK+J,QAAUP,EAAKO,SAAWR,EAAUS,gBACzChK,KAAKiK,kBAAoBT,EAAKS,mBAAqBV,EAAUW,4BAC7DlK,KAAKmK,iBAAmBX,EAAKW,kBAAoBZ,EAAUa,2BACvDZ,EAAKa,aAAerL,KAAamG,OAAOmF,UAAUd,EAAKa,aAAeb,EAAKa,YAAc,EAC5FrK,KAAKqK,WAAab,EAAKa,WAEvBrK,KAAKqK,WAAad,EAAUgB,mBAE9B,EAEAhB,EAAUS,gBAAkB,EAC5BT,EAAUW,4BAA8B,EACxCX,EAAUa,2BAA6B,EACvCb,EAAUgB,oBAAsB,IAUhChB,EAAUzL,UAAU0M,QAAU,SAAUC,EAAKlE,EAAImE,EAAIlB,GACpD,GAAI/F,MAAMkH,QAAQF,GACjB,OAAOzK,KAAK4K,cAAcH,EAAKlE,EAAImE,EAAIlB,GAGxC,GAAoB,mBAAT,EACV,MAAM,IAAI/H,MAAM,uCAIjB,IAAIoJ,EAAkB,KAClBC,EAAiB,KACjBC,EAAW,KAEK,mBAAT,IACVvB,EAAOkB,EACPA,EAAK,KAGLK,EAAW,IAAI/K,KAAKsF,QAAQ,SAAS0F,EAASC,GAC7CJ,EAAkBG,EAClBF,EAAiBG,CAClB,IAGDzB,EAAOA,GAAQ,CAAC,EAEhB,IAAI0B,GAAW,EACXC,EAAQ,KACRC,EAAkB,KAClBC,EAAiB,KACjB1O,EAAOqD,KAEPsL,EAAO,SAAUC,EAAQC,EAAKC,GAE7BL,IACHM,aAAaN,GACbA,EAAkB,MAGfC,IACHK,aAAaL,GACbA,EAAiB,MAGdE,IACG5O,EAAK8M,OAAOgB,IAAoC,IAA5B9N,EAAK8M,OAAOgB,GAAKrN,eACnCT,EAAK8M,OAAOgB,GAEhB9N,EAAKgN,wBACDhN,EAAKmN,QAAQW,IAIjBS,IACCH,EAOAS,EACHV,EAAeU,GAGfX,EAAgBY,GAVG,mBAAT,GACVf,EAAGc,EAAKC,GAYVP,GAAW,GAGRK,GAEG5O,EAAK8M,OAAOgB,IAAQ9N,EAAK8M,OAAOgB,GAAKrN,OAAS,GACnDT,EAAK8M,OAAOgB,GAAKkB,OAAjBhP,EAGH,EAEI0K,EAAO,SAAUkE,GACpB,GAAIL,EACH,OAAOI,EAAKC,GAGTJ,IACHO,aAAaP,GACbA,EAAQ,MAGLxO,EAAKgN,iBAAmB4B,IAC3B5O,EAAKmN,QAAQW,GAAOb,QAAQC,QAG7B,IAAIM,EAAmBX,EAAKW,kBAAoBxN,EAAKwN,iBAUrD,GATIA,IACHkB,EAAiBO,WAAW,WACrBjP,EAAK8M,OAAOgB,IACjBa,EAAKC,EAAQ,IAAI9J,MAAM,sCAAwCgJ,GAEjE,EAAGN,IAIc,IAAd5D,EAAGnJ,OAAc,CACpB,IAAIyO,GAAS,EACb,IACCtF,EAAG,SAAUiF,EAAKC,GACZI,IACJA,GAAS,EACTP,EAAKC,EAAQC,EAAKC,GAEpB,EACD,CAAE,MAAOD,GAEHK,IACJA,GAAS,EACTP,EAAKC,EAAQC,GAEf,CACD,MAGC7O,EAAKmP,YAAY,WAChB,OAAOvF,GACR,GACCwF,KAAK,SAASN,GACdH,EAAKC,OAAQ5J,EAAW8J,EACzB,EAAG,SAAStF,GACXmF,EAAKC,EAAQpF,EACd,EAEF,EAEIxJ,EAAKgN,iBAAqBC,QAAQC,SACrCxC,EAAOuC,QAAQC,OAAOnD,KAAKW,IAG5B,IAAIgD,EAAab,EAAKa,YAAc1N,EAAK0N,WAEzC,GAAK1N,EAAK8M,OAAOgB,GAIZ,GAAI9N,EAAKgN,iBAAqBC,QAAQC,QAAUD,QAAQC,SAAWlN,EAAKmN,QAAQW,GAGpFpD,GAAK,QAED,GAAI1K,EAAK8M,OAAOgB,GAAKrN,QAAUiN,EACnCiB,GAAK,EAAO,IAAI7J,MAAM,mCAAqCgJ,QAEvD,CACJ,IAAIuB,EAAS,WACZ3E,GAAK,EACN,EACImC,EAAKyC,UACRtP,EAAK8M,OAAOgB,GAAKyB,QAAQF,GAEzBrP,EAAK8M,OAAOgB,GAAK0B,KAAKH,GAGvB,IAAIjC,EAAUP,EAAKO,SAAWpN,EAAKoN,QAC/BA,IACHoB,EAAQS,WAAW,WAClBT,EAAQ,KACRG,GAAK,EAAO,IAAI7J,MAAM,iCAAmCgJ,GAC1D,EAAGV,GAEL,MA5BCpN,EAAK8M,OAAOgB,GAAO,GACnBpD,GAAK,GA6BN,IAAI4C,EAAoBT,EAAKS,mBAAqBtN,EAAKsN,kBASvD,OARKA,IACHmB,EAAkBQ,WAAW,WACtBjP,EAAK8M,OAAOgB,IACjBa,GAAK,EAAO,IAAI7J,MAAM,gDAAkDgJ,GAE1E,EAAGR,IAGDc,QAAJ,CAGD,EAkBAxB,EAAUzL,UAAU8M,cAAgB,SAAUwB,EAAM7F,EAAImE,EAAIlB,GACvC,mBAAT,IACVA,EAAOkB,EACPA,EAAK,MAGN,IAAI/N,EAAOqD,KAOPqM,EAAMD,EAAKE,YAAY,SAAUC,EAAM9B,GAC1C,OAPW,SAAUA,EAAKlE,GAC1B,OAAO,SAAUmE,GAChB/N,EAAK6N,QAAQC,EAAKlE,EAAImE,EAAIlB,EAC3B,CACD,CAGQgD,CAAM/B,EAAK8B,EACnB,EAAGhG,GAEH,GAAoB,mBAAT,EAIV,OAAO,IAAIvG,KAAKsF,QAAQ,SAAU0F,EAASC,GAEvB,IAAfoB,EAAIjP,OACPiP,EAAI,SAAUb,EAAKC,GACdD,EACHP,EAAOO,GAGPR,EAAQS,EAEV,GAEAT,EAAQqB,IAEV,GAjBAA,EAAI3B,EAmBN,EAOAnB,EAAUzL,UAAU2O,OAAS,SAAUhC,GACtC,OAAKA,IAIKzK,KAAKyJ,OAAOgB,GAHdpB,OAAO+C,KAAKpM,KAAKyJ,QAAQrM,OAAS,CAK3C,EAKAmM,EAAUzL,UAAUgO,YAAc,SAASvF,GAC1C,IACC,OAAOvG,KAAKsF,QAAQ0F,QAAQzE,IAC7B,CAAE,MAAOjI,GACR,OAAO0B,KAAKsF,QAAQ2F,OAAO3M,EAC5B,CACD,EAEA9B,EAAOD,QAAUgN,C,gBCrTjB,IAAItL,EAAS,EAAQ,MACjB0B,EAAS1B,EAAO0B,OAGpB,SAAS+M,EAAWC,EAAKC,GACvB,IAAK,IAAInC,KAAOkC,EACdC,EAAInC,GAAOkC,EAAIlC,EAEnB,CASA,SAASoC,EAAYC,EAAKC,EAAkB3P,GAC1C,OAAOuC,EAAOmN,EAAKC,EAAkB3P,EACvC,CAVIuC,EAAOqN,MAAQrN,EAAOO,OAASP,EAAOsN,aAAetN,EAAOuN,gBAC9D1Q,EAAOD,QAAU0B,GAGjByO,EAAUzO,EAAQ1B,GAClBA,EAAQoD,OAASkN,GAOnBA,EAAW/O,UAAYuL,OAAOK,OAAO/J,EAAO7B,WAG5C4O,EAAU/M,EAAQkN,GAElBA,EAAWG,KAAO,SAAUF,EAAKC,EAAkB3P,GACjD,GAAmB,iBAAR0P,EACT,MAAM,IAAIK,UAAU,iCAEtB,OAAOxN,EAAOmN,EAAKC,EAAkB3P,EACvC,EAEAyP,EAAW3M,MAAQ,SAAUkN,EAAMnM,EAAMoM,GACvC,GAAoB,iBAATD,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAIG,EAAM3N,EAAOyN,GAUjB,YATazL,IAATV,EACsB,iBAAboM,EACTC,EAAIrM,KAAKA,EAAMoM,GAEfC,EAAIrM,KAAKA,GAGXqM,EAAIrM,KAAK,GAEJqM,CACT,EAEAT,EAAWI,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOxN,EAAOyN,EAChB,EAEAP,EAAWK,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOlP,EAAOsP,WAAWH,EAC3B,C,wBC7DA5Q,EAAOD,QAAUsB,SAASC,UAAUoL,K,8BCDpC,IAAItH,EAAU,EAAQ,MAGtBpF,EAAOD,QAAUqF,EAAQ4L,gBAAkB,I,wBCF3ChR,EAAOD,QAAUkR,S,wBCCjBjR,EAAOD,QAAU,WAChB,GAAsB,mBAAXoH,QAAiE,mBAAjC0F,OAAOqE,sBAAwC,OAAO,EACjG,GAA+B,iBAApB/J,OAAOC,SAAyB,OAAO,EAGlD,IAAI5G,EAAM,CAAC,EACP2Q,EAAMhK,OAAO,QACbiK,EAASvE,OAAOsE,GACpB,GAAmB,iBAARA,EAAoB,OAAO,EAEtC,GAA4C,oBAAxCtE,OAAOvL,UAAU0D,SAASzD,KAAK4P,GAA8B,OAAO,EACxE,GAA+C,oBAA3CtE,OAAOvL,UAAU0D,SAASzD,KAAK6P,GAAiC,OAAO,EAY3E,IAAK,IAAIC,KADT7Q,EAAI2Q,GADS,GAEC3Q,EAAO,OAAO,EAC5B,GAA2B,mBAAhBqM,OAAO+C,MAAmD,IAA5B/C,OAAO+C,KAAKpP,GAAKI,OAAgB,OAAO,EAEjF,GAA0C,mBAA/BiM,OAAOyE,qBAAiF,IAA3CzE,OAAOyE,oBAAoB9Q,GAAKI,OAAgB,OAAO,EAE/G,IAAI2Q,EAAO1E,OAAOqE,sBAAsB1Q,GACxC,GAAoB,IAAhB+Q,EAAK3Q,QAAgB2Q,EAAK,KAAOJ,EAAO,OAAO,EAEnD,IAAKtE,OAAOvL,UAAUkQ,qBAAqBjQ,KAAKf,EAAK2Q,GAAQ,OAAO,EAEpE,GAA+C,mBAApCtE,OAAO4E,yBAAyC,CAE1D,IAAIC,EAAgD7E,OAAO4E,yBAAyBjR,EAAK2Q,GACzF,GAfY,KAeRO,EAAWhR,QAA8C,IAA1BgR,EAAWvQ,WAAuB,OAAO,CAC7E,CAEA,OAAO,CACR,C,8BCvBA,IAAIwQ,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MA2BxBC,GAAmB,EAyBZC,EAAO,GAkBXC,EAAM,GAiBb,SAASC,EAAQC,GACf,OAAWA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,GACzB,CAGA,SAASC,IACP7O,KAAK8O,KAAO,EACZ9O,KAAK+H,MAAO,EACZ/H,KAAK+O,KAAO,EACZ/O,KAAKgP,UAAW,EAChBhP,KAAKiP,MAAQ,EACbjP,KAAKkP,KAAO,EACZlP,KAAKmP,MAAQ,EACbnP,KAAKoP,MAAQ,EAEbpP,KAAKqP,KAAO,KAGZrP,KAAKsP,MAAQ,EACbtP,KAAKuP,MAAQ,EACbvP,KAAKwP,MAAQ,EACbxP,KAAKyP,MAAQ,EACbzP,KAAK0P,OAAS,KAGd1P,KAAK2P,KAAO,EACZ3P,KAAKkB,KAAO,EAGZlB,KAAK5C,OAAS,EACd4C,KAAK9B,OAAS,EAGd8B,KAAK4P,MAAQ,EAGb5P,KAAK6P,QAAU,KACf7P,KAAK8P,SAAW,KAChB9P,KAAK+P,QAAU,EACf/P,KAAKgQ,SAAW,EAGhBhQ,KAAKiQ,MAAQ,EACbjQ,KAAKkQ,KAAO,EACZlQ,KAAKmQ,MAAQ,EACbnQ,KAAKoQ,KAAO,EACZpQ,KAAKqQ,KAAO,KAEZrQ,KAAKsQ,KAAO,IAAInC,EAAMoC,MAAM,KAC5BvQ,KAAKwQ,KAAO,IAAIrC,EAAMoC,MAAM,KAO5BvQ,KAAKyQ,OAAS,KACdzQ,KAAK0Q,QAAU,KACf1Q,KAAK2Q,KAAO,EACZ3Q,KAAK4Q,KAAO,EACZ5Q,KAAK6Q,IAAM,CACb,CAEA,SAASC,EAAiBC,GACxB,IAAIC,EAEJ,OAAKD,GAASA,EAAKC,OACnBA,EAAQD,EAAKC,MACbD,EAAKE,SAAWF,EAAKG,UAAYF,EAAM5B,MAAQ,EAC/C2B,EAAKI,IAAM,GACPH,EAAMjC,OACRgC,EAAKK,MAAqB,EAAbJ,EAAMjC,MAErBiC,EAAMlC,KA1HM,EA2HZkC,EAAMjJ,KAAO,EACbiJ,EAAMhC,SAAW,EACjBgC,EAAM9B,KAAO,MACb8B,EAAM3B,KAAO,KACb2B,EAAMrB,KAAO,EACbqB,EAAM9P,KAAO,EAEb8P,EAAMnB,QAAUmB,EAAMP,OAAS,IAAItC,EAAMkD,MA7FzB,KA8FhBL,EAAMlB,SAAWkB,EAAMN,QAAU,IAAIvC,EAAMkD,MA7F1B,KA+FjBL,EAAML,KAAO,EACbK,EAAMJ,MAAQ,EAxJM,GAqIepC,CAsBrC,CAEA,SAAS8C,EAAaP,GACpB,IAAIC,EAEJ,OAAKD,GAASA,EAAKC,QACnBA,EAAQD,EAAKC,OACPzB,MAAQ,EACdyB,EAAMxB,MAAQ,EACdwB,EAAMvB,MAAQ,EACPqB,EAAiBC,IALWvC,CAOrC,CAEA,SAAS+C,EAAcR,EAAMS,GAC3B,IAAIzC,EACAiC,EAGJ,OAAKD,GAASA,EAAKC,OACnBA,EAAQD,EAAKC,MAGTQ,EAAa,GACfzC,EAAO,EACPyC,GAAcA,IAGdzC,EAA2B,GAAnByC,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzChD,GAEY,OAAjBwC,EAAMtB,QAAmBsB,EAAM1B,QAAUkC,IAC3CR,EAAMtB,OAAS,MAIjBsB,EAAMjC,KAAOA,EACbiC,EAAM1B,MAAQkC,EACPF,EAAaP,KA1BevC,CA2BrC,CAEA,SAASiD,EAAaV,EAAMS,GAC1B,IAAI/F,EACAuF,EAEJ,OAAKD,GAGLC,EAAQ,IAAInC,EAIZkC,EAAKC,MAAQA,EACbA,EAAMtB,OAAS,KAvNK,KAwNpBjE,EAAM8F,EAAcR,EAAMS,MAExBT,EAAKC,MAAQ,MAERvF,GAba+C,CActB,CAiBA,IAEIkD,EAAQC,EAFRC,GAAS,EAIb,SAASC,EAAYb,GAEnB,GAAIY,EAAQ,CACV,IAAIjE,EAOJ,IALA+D,EAAS,IAAIvD,EAAMkD,MAAM,KACzBM,EAAU,IAAIxD,EAAMkD,MAAM,IAG1B1D,EAAM,EACCA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EACxC,KAAOA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EACxC,KAAOA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EACxC,KAAOA,EAAM,KAAOqD,EAAMV,KAAK3C,KAAS,EAMxC,IAJAY,EArRO,EAqRcyC,EAAMV,KAAM,EAAG,IAAKoB,EAAU,EAAGV,EAAMR,KAAM,CAAEtP,KAAM,IAG1EyM,EAAM,EACCA,EAAM,IAAMqD,EAAMV,KAAK3C,KAAS,EAEvCY,EA1RQ,EA0RayC,EAAMV,KAAM,EAAG,GAAMqB,EAAS,EAAGX,EAAMR,KAAM,CAAEtP,KAAM,IAG1E0Q,GAAS,CACX,CAEAZ,EAAMnB,QAAU6B,EAChBV,EAAMjB,QAAU,EAChBiB,EAAMlB,SAAW6B,EACjBX,EAAMhB,SAAW,CACnB,CAiBA,SAAS8B,EAAaf,EAAMpE,EAAKoF,EAAKC,GACpC,IAAIC,EACAjB,EAAQD,EAAKC,MAqCjB,OAlCqB,OAAjBA,EAAMtB,SACRsB,EAAMzB,MAAQ,GAAKyB,EAAM1B,MACzB0B,EAAMvB,MAAQ,EACduB,EAAMxB,MAAQ,EAEdwB,EAAMtB,OAAS,IAAIvB,EAAM+D,KAAKlB,EAAMzB,QAIlCyC,GAAQhB,EAAMzB,OAChBpB,EAAMgE,SAASnB,EAAMtB,OAAQ/C,EAAKoF,EAAMf,EAAMzB,MAAOyB,EAAMzB,MAAO,GAClEyB,EAAMvB,MAAQ,EACduB,EAAMxB,MAAQwB,EAAMzB,SAGpB0C,EAAOjB,EAAMzB,MAAQyB,EAAMvB,OAChBuC,IACTC,EAAOD,GAGT7D,EAAMgE,SAASnB,EAAMtB,OAAQ/C,EAAKoF,EAAMC,EAAMC,EAAMjB,EAAMvB,QAC1DuC,GAAQC,IAGN9D,EAAMgE,SAASnB,EAAMtB,OAAQ/C,EAAKoF,EAAMC,EAAMA,EAAM,GACpDhB,EAAMvB,MAAQuC,EACdhB,EAAMxB,MAAQwB,EAAMzB,QAGpByB,EAAMvB,OAASwC,EACXjB,EAAMvB,QAAUuB,EAAMzB,QAASyB,EAAMvB,MAAQ,GAC7CuB,EAAMxB,MAAQwB,EAAMzB,QAASyB,EAAMxB,OAASyC,KAG7C,CACT,CAsoCA1V,EAAQ+U,aAAeA,EACvB/U,EAAQgV,cAAgBA,EACxBhV,EAAQuU,iBAAmBA,EAC3BvU,EAAQ6V,YApvCR,SAAqBrB,GACnB,OAAOU,EAAaV,EArKN,GAsKhB,EAmvCAxU,EAAQkV,aAAeA,EACvBlV,EAAQ8V,QAzoCR,SAAiBtB,EAAMuB,GACrB,IAAItB,EACAuB,EAAOC,EACPnC,EACAoC,EACArC,EAAMsC,EACN/C,EACAzO,EACAyR,EAAKC,EACLZ,EACAhF,EACA6F,EAEAC,EAAWC,EAASC,EAEpBC,EAAWC,EAASC,EACpBC,EACA3H,EAEAjC,EAEA6J,EATAC,EAAO,EAMPC,EAAO,IAAIpF,EAAM+D,KAAK,GAKtBsB,EACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAGlE,IAAKzC,IAASA,EAAKC,QAAUD,EAAKyB,SAC5BzB,EAAKwB,OAA2B,IAAlBxB,EAAK0C,SACvB,OAAOjF,GAGTwC,EAAQD,EAAKC,OACHlC,OAASL,IAAQuC,EAAMlC,KA/Uf,IAmVlB2D,EAAM1B,EAAK2C,SACXlB,EAASzB,EAAKyB,OACdE,EAAO3B,EAAK4C,UACZtD,EAAOU,EAAK6C,QACZrB,EAAQxB,EAAKwB,MACbnC,EAAOW,EAAK0C,SACZ9D,EAAOqB,EAAMrB,KACbzO,EAAO8P,EAAM9P,KAGbyR,EAAMvC,EACNwC,EAAOF,EACPjH,EA7XoB,EA+XpBoI,EACA,OACE,OAAQ7C,EAAMlC,MACZ,KAhXQ,EAiXN,GAAmB,IAAfkC,EAAMjC,KAAY,CACpBiC,EAAMlC,KAtWI,GAuWV,KACF,CAEA,KAAO5N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb8P,EAAMjC,MAAsB,QAATY,EAAiB,CACvCqB,EAAM7B,MAAQ,EAEdoE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,GAI1C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAxYD,EAyYL,KACF,CAKA,GAJAkC,EAAM/B,MAAQ,EACV+B,EAAM3B,OACR2B,EAAM3B,KAAK/D,MAAO,KAED,EAAb0F,EAAMjC,UACA,IAAPY,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtDoB,EAAKI,IAAM,yBACXH,EAAMlC,KAAOJ,EACb,KACF,CACA,GA7ZU,IA6ZE,GAAPiB,GAAwC,CAC3CoB,EAAKI,IAAM,6BACXH,EAAMlC,KAAOJ,EACb,KACF,CAMA,GAHAxN,GAAQ,EAERkS,EAAiC,GAAnB,IAHdzD,KAAU,IAIU,IAAhBqB,EAAM1B,MACR0B,EAAM1B,MAAQ8D,OAEX,GAAIA,EAAMpC,EAAM1B,MAAO,CAC1ByB,EAAKI,IAAM,sBACXH,EAAMlC,KAAOJ,EACb,KACF,CACAsC,EAAM9B,KAAO,GAAKkE,EAElBrC,EAAKK,MAAQJ,EAAM7B,MAAQ,EAC3B6B,EAAMlC,KAAc,IAAPa,EAlaL,GAka6BlB,EAErCkB,EAAO,EACPzO,EAAO,EAEP,MACF,KAhbS,EAkbP,KAAOA,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAGA,GADA8P,EAAM/B,MAAQU,EAjcJ,IAkcS,IAAdqB,EAAM/B,OAA8B,CACvC8B,EAAKI,IAAM,6BACXH,EAAMlC,KAAOJ,EACb,KACF,CACA,GAAkB,MAAdsC,EAAM/B,MAAgB,CACxB8B,EAAKI,IAAM,2BACXH,EAAMlC,KAAOJ,EACb,KACF,CACIsC,EAAM3B,OACR2B,EAAM3B,KAAKyE,KAASnE,GAAQ,EAAK,GAEjB,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAjdA,EAmdR,KAndQ,EAqdN,KAAO5N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEI8P,EAAM3B,OACR2B,EAAM3B,KAAK0E,KAAOpE,GAEF,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzB4D,EAAK,GAAM5D,IAAS,GAAM,IAC1B4D,EAAK,GAAM5D,IAAS,GAAM,IAC1BqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KA3eF,EA6eN,KA7eM,EA+eJ,KAAO5N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEI8P,EAAM3B,OACR2B,EAAM3B,KAAK2E,OAAiB,IAAPrE,EACrBqB,EAAM3B,KAAK4E,GAAMtE,GAAQ,GAET,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KApgBC,EAsgBT,KAtgBS,EAugBP,GAAkB,KAAdkC,EAAM/B,MAAgB,CAExB,KAAO/N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAM5T,OAASuS,EACXqB,EAAM3B,OACR2B,EAAM3B,KAAK6E,UAAYvE,GAEP,IAAdqB,EAAM/B,QAERsE,EAAK,GAAY,IAAP5D,EACV4D,EAAK,GAAM5D,IAAS,EAAK,IACzBqB,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoE,EAAM,EAAG,IAI5C5D,EAAO,EACPzO,EAAO,CAET,MACS8P,EAAM3B,OACb2B,EAAM3B,KAAKO,MAAQ,MAErBoB,EAAMlC,KAliBC,EAoiBT,KApiBS,EAqiBP,GAAkB,KAAdkC,EAAM/B,SACR+C,EAAOhB,EAAM5T,QACFgT,IAAQ4B,EAAO5B,GACtB4B,IACEhB,EAAM3B,OACR+D,EAAMpC,EAAM3B,KAAK6E,UAAYlD,EAAM5T,OAC9B4T,EAAM3B,KAAKO,QAEdoB,EAAM3B,KAAKO,MAAQ,IAAInM,MAAMuN,EAAM3B,KAAK6E,YAE1C/F,EAAMgE,SACJnB,EAAM3B,KAAKO,MACX2C,EACAlC,EAGA2B,EAEAoB,IAMc,IAAdpC,EAAM/B,QACR+B,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoD,EAAOP,EAAM3B,IAEhDD,GAAQ4B,EACR3B,GAAQ2B,EACRhB,EAAM5T,QAAU4U,GAEdhB,EAAM5T,QAAU,MAAMyW,EAE5B7C,EAAM5T,OAAS,EACf4T,EAAMlC,KAtkBA,EAwkBR,KAxkBQ,EAykBN,GAAkB,KAAdkC,EAAM/B,MAAgB,CACxB,GAAa,IAATmB,EAAc,MAAMyD,EACxB7B,EAAO,EACP,GAEEoB,EAAMb,EAAMlC,EAAO2B,KAEfhB,EAAM3B,MAAQ+D,GACbpC,EAAM5T,OAAS,QAClB4T,EAAM3B,KAAK/I,MAAQV,OAAOuO,aAAaf,UAElCA,GAAOpB,EAAO5B,GAOvB,GALkB,IAAdY,EAAM/B,QACR+B,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoD,EAAOP,EAAM3B,IAEhDD,GAAQ4B,EACR3B,GAAQ2B,EACJoB,EAAO,MAAMS,CACnB,MACS7C,EAAM3B,OACb2B,EAAM3B,KAAK/I,KAAO,MAEpB0K,EAAM5T,OAAS,EACf4T,EAAMlC,KAhmBG,EAkmBX,KAlmBW,EAmmBT,GAAkB,KAAdkC,EAAM/B,MAAgB,CACxB,GAAa,IAATmB,EAAc,MAAMyD,EACxB7B,EAAO,EACP,GACEoB,EAAMb,EAAMlC,EAAO2B,KAEfhB,EAAM3B,MAAQ+D,GACbpC,EAAM5T,OAAS,QAClB4T,EAAM3B,KAAK+E,SAAWxO,OAAOuO,aAAaf,UAErCA,GAAOpB,EAAO5B,GAMvB,GALkB,IAAdY,EAAM/B,QACR+B,EAAM7B,MAAQd,EAAM2C,EAAM7B,MAAOoD,EAAOP,EAAM3B,IAEhDD,GAAQ4B,EACR3B,GAAQ2B,EACJoB,EAAO,MAAMS,CACnB,MACS7C,EAAM3B,OACb2B,EAAM3B,KAAK+E,QAAU,MAEvBpD,EAAMlC,KAvnBA,EAynBR,KAznBQ,EA0nBN,GAAkB,IAAdkC,EAAM/B,MAAgB,CAExB,KAAO/N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,GAAIyO,KAAwB,MAAdqB,EAAM7B,OAAiB,CACnC4B,EAAKI,IAAM,sBACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAiB,EAAO,EACPzO,EAAO,CAET,CACI8P,EAAM3B,OACR2B,EAAM3B,KAAKgF,KAASrD,EAAM/B,OAAS,EAAK,EACxC+B,EAAM3B,KAAK/D,MAAO,GAEpByF,EAAKK,MAAQJ,EAAM7B,MAAQ,EAC3B6B,EAAMlC,KAAOL,EACb,MACF,KAnpBU,GAqpBR,KAAOvN,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA6P,EAAKK,MAAQJ,EAAM7B,MAAQR,EAAQgB,GAEnCA,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAhqBA,GAkqBR,KAlqBQ,GAmqBN,GAAuB,IAAnBkC,EAAMhC,SASR,OAPA+B,EAAK2C,SAAWjB,EAChB1B,EAAK4C,UAAYjB,EACjB3B,EAAK6C,QAAUvD,EACfU,EAAK0C,SAAWrD,EAChBY,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,EApsBD,EAwsBd6P,EAAKK,MAAQJ,EAAM7B,MAAQ,EAC3B6B,EAAMlC,KAAOL,EAEf,KAAKA,EACH,GArtBc,IAqtBV6D,GAptBU,IAotBWA,EAAqB,MAAMuB,EAEtD,KAlrBc,GAmrBZ,GAAI7C,EAAMjJ,KAAM,CAEd4H,KAAiB,EAAPzO,EACVA,GAAe,EAAPA,EAER8P,EAAMlC,KA1qBD,GA2qBL,KACF,CAEA,KAAO5N,EAAO,GAAG,CACf,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAQA,OANA8P,EAAMjJ,KAAe,EAAP4H,EAGdzO,GAAQ,EAGQ,GAJhByO,KAAU,IAKR,KAAK,EAGHqB,EAAMlC,KA5sBE,GA6sBR,MACF,KAAK,EAKH,GAJA+C,EAAYb,GAGZA,EAAMlC,KA5sBI,GA3CA,IAwvBNwD,EAAmB,CAErB3C,KAAU,EACVzO,GAAQ,EAER,MAAM2S,CACR,CACA,MACF,KAAK,EAGH7C,EAAMlC,KA3tBC,GA4tBP,MACF,KAAK,EACHiC,EAAKI,IAAM,qBACXH,EAAMlC,KAAOJ,EAGjBiB,KAAU,EACVzO,GAAQ,EAER,MACF,KAzuBc,GA+uBZ,IAJAyO,KAAiB,EAAPzO,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,IAAY,MAAPyO,KAAqBA,IAAS,GAAM,OAAS,CAChDoB,EAAKI,IAAM,+BACXH,EAAMlC,KAAOJ,EACb,KACF,CASA,GARAsC,EAAM5T,OAAgB,MAAPuS,EAIfA,EAAO,EACPzO,EAAO,EAEP8P,EAAMlC,KAjwBK,GAtCG,IAwyBVwD,EAAqB,MAAMuB,EAEjC,KApwBa,GAqwBX7C,EAAMlC,KApwBI,GAswBZ,KAtwBY,GAwwBV,GADAkD,EAAOhB,EAAM5T,OACH,CAGR,GAFI4U,EAAO5B,IAAQ4B,EAAO5B,GACtB4B,EAAOU,IAAQV,EAAOU,GACb,IAATV,EAAc,MAAM6B,EAExB1F,EAAMgE,SAASK,EAAQD,EAAOlC,EAAM2B,EAAMS,GAE1CrC,GAAQ4B,EACR3B,GAAQ2B,EACRU,GAAQV,EACRS,GAAOT,EACPhB,EAAM5T,QAAU4U,EAChB,KACF,CAEAhB,EAAMlC,KAAOL,EACb,MACF,KAxxBa,GA0xBX,KAAOvN,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAkBA,GAhBA8P,EAAMd,KAAkC,KAAnB,GAAPP,GAEdA,KAAU,EACVzO,GAAQ,EAER8P,EAAMb,MAAmC,GAAnB,GAAPR,GAEfA,KAAU,EACVzO,GAAQ,EAER8P,EAAMf,MAAmC,GAAnB,GAAPN,GAEfA,KAAU,EACVzO,GAAQ,EAGJ8P,EAAMd,KAAO,KAAOc,EAAMb,MAAQ,GAAI,CACxCY,EAAKI,IAAM,sCACXH,EAAMlC,KAAOJ,EACb,KACF,CAGAsC,EAAMZ,KAAO,EACbY,EAAMlC,KAxzBO,GA0zBf,KA1zBe,GA2zBb,KAAOkC,EAAMZ,KAAOY,EAAMf,OAAO,CAE/B,KAAO/O,EAAO,GAAG,CACf,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAMV,KAAKkD,EAAMxC,EAAMZ,SAAmB,EAAPT,EAEnCA,KAAU,EACVzO,GAAQ,CAEV,CACA,KAAO8P,EAAMZ,KAAO,IAClBY,EAAMV,KAAKkD,EAAMxC,EAAMZ,SAAW,EAapC,GAPAY,EAAMnB,QAAUmB,EAAMP,OACtBO,EAAMjB,QAAU,EAEhBvG,EAAO,CAAEtI,KAAM8P,EAAMjB,SACrBtE,EAAM8C,EA74BF,EA64BuByC,EAAMV,KAAM,EAAG,GAAIU,EAAMnB,QAAS,EAAGmB,EAAMR,KAAMhH,GAC5EwH,EAAMjB,QAAUvG,EAAKtI,KAEjBuK,EAAK,CACPsF,EAAKI,IAAM,2BACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAsC,EAAMZ,KAAO,EACbY,EAAMlC,KA91BQ,GAg2BhB,KAh2BgB,GAi2Bd,KAAOkC,EAAMZ,KAAOY,EAAMd,KAAOc,EAAMb,OAAO,CAC5C,KAGE4C,GAFAO,EAAOtC,EAAMnB,QAAQF,GAAS,GAAKqB,EAAMjB,SAAW,MAEhC,GAAM,IAC1BiD,EAAkB,MAAPM,KAFXR,EAAYQ,IAAS,KAIFpS,IANZ,CAQP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CACA,GAAI8R,EAAW,GAEbrD,KAAUmD,EACV5R,GAAQ4R,EAER9B,EAAMV,KAAKU,EAAMZ,QAAU4C,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADAK,EAAIP,EAAY,EACT5R,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAMA,GAHAyO,KAAUmD,EACV5R,GAAQ4R,EAEW,IAAf9B,EAAMZ,KAAY,CACpBW,EAAKI,IAAM,4BACXH,EAAMlC,KAAOJ,EACb,KACF,CACA0E,EAAMpC,EAAMV,KAAKU,EAAMZ,KAAO,GAC9B4B,EAAO,GAAY,EAAPrC,GAEZA,KAAU,EACVzO,GAAQ,CAEV,MACK,GAAiB,KAAb8R,EAAiB,CAGxB,IADAK,EAAIP,EAAY,EACT5R,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAIAA,GAAQ4R,EAERM,EAAM,EACNpB,EAAO,GAAY,GAJnBrC,KAAUmD,IAMVnD,KAAU,EACVzO,GAAQ,CAEV,KACK,CAGH,IADAmS,EAAIP,EAAY,EACT5R,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAIAA,GAAQ4R,EAERM,EAAM,EACNpB,EAAO,IAAa,KAJpBrC,KAAUmD,IAMVnD,KAAU,EACVzO,GAAQ,CAEV,CACA,GAAI8P,EAAMZ,KAAO4B,EAAOhB,EAAMd,KAAOc,EAAMb,MAAO,CAChDY,EAAKI,IAAM,4BACXH,EAAMlC,KAAOJ,EACb,KACF,CACA,KAAOsD,KACLhB,EAAMV,KAAKU,EAAMZ,QAAUgD,CAE/B,CACF,CAGA,GAAIpC,EAAMlC,OAASJ,EAAO,MAG1B,GAAwB,IAApBsC,EAAMV,KAAK,KAAY,CACzBS,EAAKI,IAAM,uCACXH,EAAMlC,KAAOJ,EACb,KACF,CAcA,GATAsC,EAAMjB,QAAU,EAEhBvG,EAAO,CAAEtI,KAAM8P,EAAMjB,SACrBtE,EAAM8C,EA/gCH,EA+gCuByC,EAAMV,KAAM,EAAGU,EAAMd,KAAMc,EAAMnB,QAAS,EAAGmB,EAAMR,KAAMhH,GAGnFwH,EAAMjB,QAAUvG,EAAKtI,KAGjBuK,EAAK,CACPsF,EAAKI,IAAM,8BACXH,EAAMlC,KAAOJ,EACb,KACF,CAaA,GAXAsC,EAAMhB,SAAW,EAGjBgB,EAAMlB,SAAWkB,EAAMN,QACvBlH,EAAO,CAAEtI,KAAM8P,EAAMhB,UACrBvE,EAAM8C,EA/hCF,EA+hCuByC,EAAMV,KAAMU,EAAMd,KAAMc,EAAMb,MAAOa,EAAMlB,SAAU,EAAGkB,EAAMR,KAAMhH,GAG/FwH,EAAMhB,SAAWxG,EAAKtI,KAGlBuK,EAAK,CACPsF,EAAKI,IAAM,wBACXH,EAAMlC,KAAOJ,EACb,KACF,CAGA,GADAsC,EAAMlC,KAn/BQ,GA3CA,IA+hCVwD,EAAqB,MAAMuB,EAEjC,KAt/BgB,GAu/Bd7C,EAAMlC,KAt/BO,GAw/Bf,KAx/Be,GAy/Bb,GAAIsB,GAAQ,GAAKsC,GAAQ,IAAK,CAE5B3B,EAAK2C,SAAWjB,EAChB1B,EAAK4C,UAAYjB,EACjB3B,EAAK6C,QAAUvD,EACfU,EAAK0C,SAAWrD,EAChBY,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,EAEboN,EAAayC,EAAM6B,GAEnBH,EAAM1B,EAAK2C,SACXlB,EAASzB,EAAKyB,OACdE,EAAO3B,EAAK4C,UACZtD,EAAOU,EAAK6C,QACZrB,EAAQxB,EAAKwB,MACbnC,EAAOW,EAAK0C,SACZ9D,EAAOqB,EAAMrB,KACbzO,EAAO8P,EAAM9P,KAGT8P,EAAMlC,OAASL,IACjBuC,EAAMJ,MAAQ,GAEhB,KACF,CAEA,IADAI,EAAMJ,KAAO,EAIXmC,GAFAO,EAAOtC,EAAMnB,QAAQF,GAAS,GAAKqB,EAAMjB,SAAW,MAEhC,GAAM,IAC1BiD,EAAkB,MAAPM,KAFXR,EAAYQ,IAAS,KAIJpS,IANV,CAQP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CACA,GAAI6R,KAAsB,IAAVA,GAAuB,CAIrC,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAKTD,GAHAO,EAAOtC,EAAMnB,QAAQsD,IACXxD,GAAS,GAAMsD,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BD,EAAkB,MAAPM,IAENL,GAJLH,EAAYQ,IAAS,KAIUpS,IAPxB,CASP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CAEAyO,KAAUsD,EACV/R,GAAQ+R,EAERjC,EAAMJ,MAAQqC,CAChB,CAOA,GALAtD,KAAUmD,EACV5R,GAAQ4R,EAER9B,EAAMJ,MAAQkC,EACd9B,EAAM5T,OAAS4V,EACC,IAAZD,EAAe,CAIjB/B,EAAMlC,KAhkCK,GAikCX,KACF,CACA,GAAc,GAAViE,EAAc,CAEhB/B,EAAMJ,MAAQ,EACdI,EAAMlC,KAAOL,EACb,KACF,CACA,GAAc,GAAVsE,EAAc,CAChBhC,EAAKI,IAAM,8BACXH,EAAMlC,KAAOJ,EACb,KACF,CACAsC,EAAMpB,MAAkB,GAAVmD,EACd/B,EAAMlC,KAnlCU,GAqlClB,KArlCkB,GAslChB,GAAIkC,EAAMpB,MAAO,CAGf,IADAyD,EAAIrC,EAAMpB,MACH1O,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAM5T,QAAUuS,GAAS,GAAKqB,EAAMpB,OAAS,EAE7CD,KAAUqB,EAAMpB,MAChB1O,GAAQ8P,EAAMpB,MAEdoB,EAAMJ,MAAQI,EAAMpB,KACtB,CAEAoB,EAAMH,IAAMG,EAAM5T,OAClB4T,EAAMlC,KAxmCQ,GA0mChB,KA1mCgB,GA2mCd,KAGEiE,GAFAO,EAAOtC,EAAMlB,SAASH,GAAS,GAAKqB,EAAMhB,UAAY,MAElC,GAAM,IAC1BgD,EAAkB,MAAPM,KAFXR,EAAYQ,IAAS,KAIFpS,IANZ,CAQP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CACA,KAAe,IAAV6R,GAAuB,CAI1B,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAKTD,GAHAO,EAAOtC,EAAMlB,SAASqD,IACZxD,GAAS,GAAMsD,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BD,EAAkB,MAAPM,IAENL,GAJLH,EAAYQ,IAAS,KAIUpS,IAPxB,CASP,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CAEV,CAEAyO,KAAUsD,EACV/R,GAAQ+R,EAERjC,EAAMJ,MAAQqC,CAChB,CAMA,GAJAtD,KAAUmD,EACV5R,GAAQ4R,EAER9B,EAAMJ,MAAQkC,EACA,GAAVC,EAAc,CAChBhC,EAAKI,IAAM,wBACXH,EAAMlC,KAAOJ,EACb,KACF,CACAsC,EAAM9S,OAAS8U,EACfhC,EAAMpB,MAAoB,GAAZ,EACdoB,EAAMlC,KA7pCW,GA+pCnB,KA/pCmB,GAgqCjB,GAAIkC,EAAMpB,MAAO,CAGf,IADAyD,EAAIrC,EAAMpB,MACH1O,EAAOmS,GAAG,CACf,GAAa,IAATjD,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA8P,EAAM9S,QAAUyR,GAAS,GAAKqB,EAAMpB,OAAS,EAE7CD,KAAUqB,EAAMpB,MAChB1O,GAAQ8P,EAAMpB,MAEdoB,EAAMJ,MAAQI,EAAMpB,KACtB,CAEA,GAAIoB,EAAM9S,OAAS8S,EAAM9B,KAAM,CAC7B6B,EAAKI,IAAM,gCACXH,EAAMlC,KAAOJ,EACb,KACF,CAGAsC,EAAMlC,KAxrCS,GA0rCjB,KA1rCiB,GA2rCf,GAAa,IAAT4D,EAAc,MAAMmB,EAExB,GADA7B,EAAOY,EAAOF,EACV1B,EAAM9S,OAAS8T,EAAM,CAEvB,IADAA,EAAOhB,EAAM9S,OAAS8T,GACXhB,EAAMxB,OACXwB,EAAML,KAAM,CACdI,EAAKI,IAAM,gCACXH,EAAMlC,KAAOJ,EACb,KACF,CAiBEsD,EAAOhB,EAAMvB,OACfuC,GAAQhB,EAAMvB,MACdzC,EAAOgE,EAAMzB,MAAQyC,GAGrBhF,EAAOgE,EAAMvB,MAAQuC,EAEnBA,EAAOhB,EAAM5T,SAAU4U,EAAOhB,EAAM5T,QACxCyV,EAAc7B,EAAMtB,MACtB,MAEEmD,EAAcL,EACdxF,EAAOyF,EAAMzB,EAAM9S,OACnB8T,EAAOhB,EAAM5T,OAEX4U,EAAOU,IAAQV,EAAOU,GAC1BA,GAAQV,EACRhB,EAAM5T,QAAU4U,EAChB,GACEQ,EAAOC,KAASI,EAAY7F,aACnBgF,GACU,IAAjBhB,EAAM5T,SAAgB4T,EAAMlC,KA9uCnB,IA+uCb,MACF,KA3uCe,GA4uCb,GAAa,IAAT4D,EAAc,MAAMmB,EACxBrB,EAAOC,KAASzB,EAAM5T,OACtBsV,IACA1B,EAAMlC,KApvCO,GAqvCb,MACF,KAhvCS,GAivCP,GAAIkC,EAAMjC,KAAM,CAEd,KAAO7N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IAEAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAaA,GAXA0R,GAAQF,EACR3B,EAAKG,WAAa0B,EAClB5B,EAAM5B,OAASwD,EACXA,IACF7B,EAAKK,MAAQJ,EAAM7B,MAEd6B,EAAM/B,MAAQZ,EAAM2C,EAAM7B,MAAOqD,EAAQI,EAAMH,EAAMG,GAAQxE,EAAQ4C,EAAM7B,MAAOqD,EAAQI,EAAMH,EAAMG,IAG7GA,EAAOF,GAEF1B,EAAM/B,MAAQU,EAAOhB,EAAQgB,MAAWqB,EAAM7B,MAAO,CACxD4B,EAAKI,IAAM,uBACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAiB,EAAO,EACPzO,EAAO,CAGT,CACA8P,EAAMlC,KAhxCE,GAkxCV,KAlxCU,GAmxCR,GAAIkC,EAAMjC,MAAQiC,EAAM/B,MAAO,CAE7B,KAAO/N,EAAO,IAAI,CAChB,GAAa,IAATkP,EAAc,MAAMyD,EACxBzD,IACAT,GAAQ4C,EAAMlC,MAAWnP,EACzBA,GAAQ,CACV,CAEA,GAAIyO,KAAwB,WAAdqB,EAAM5B,OAAqB,CACvC2B,EAAKI,IAAM,yBACXH,EAAMlC,KAAOJ,EACb,KACF,CAEAiB,EAAO,EACPzO,EAAO,CAGT,CACA8P,EAAMlC,KAtyCA,GAwyCR,KAxyCQ,GAyyCNrD,EAt1Cc,EAu1Cd,MAAMoI,EACR,KAAKnF,EACHjD,GAr1Cc,EAs1Cd,MAAMoI,EACR,KA5yCO,GA6yCL,OAv1Cc,EA01ChB,QACE,OAAOrF,EAsBb,OARAuC,EAAK2C,SAAWjB,EAChB1B,EAAK4C,UAAYjB,EACjB3B,EAAK6C,QAAUvD,EACfU,EAAK0C,SAAWrD,EAChBY,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,GAGT8P,EAAMzB,OAAUqD,IAAS7B,EAAK4C,WAAa3C,EAAMlC,KAAOJ,IACvCsC,EAAMlC,KA50Cd,IApDO,IAg4CuBwD,KACrCR,EAAaf,EAAMA,EAAKyB,OAAQzB,EAAK2C,SAAUd,EAAO7B,EAAK4C,YAC7D3C,EAAMlC,KA10CC,IA1CS,IAw3CpB6D,GAAO5B,EAAK0C,SACZb,GAAQ7B,EAAK4C,UACb5C,EAAKE,UAAY0B,EACjB5B,EAAKG,WAAa0B,EAClB5B,EAAM5B,OAASwD,EACX5B,EAAMjC,MAAQ6D,IAChB7B,EAAKK,MAAQJ,EAAM7B,MAChB6B,EAAM/B,MAAQZ,EAAM2C,EAAM7B,MAAOqD,EAAQI,EAAM7B,EAAK2C,SAAWd,GAAQxE,EAAQ4C,EAAM7B,MAAOqD,EAAQI,EAAM7B,EAAK2C,SAAWd,IAE/H7B,EAAKuD,UAAYtD,EAAM9P,MAAQ8P,EAAMjJ,KAAO,GAAK,IAC9BiJ,EAAMlC,OAASL,EAAO,IAAM,IAn2C3B,KAo2CDuC,EAAMlC,MAz2CR,KAy2CyBkC,EAAMlC,KAAiB,IAAM,IACzD,IAAR6D,GAAsB,IAATC,GAl5CC,IAk5CcN,IA14Cd,IA04CqC7G,IACvDA,GAp4CkB,GAs4CbA,EACT,EAwEAlP,EAAQgY,WAtER,SAAoBxD,GAElB,IAAKA,IAASA,EAAKC,MACjB,OAAOxC,EAGT,IAAIwC,EAAQD,EAAKC,MAKjB,OAJIA,EAAMtB,SACRsB,EAAMtB,OAAS,MAEjBqB,EAAKC,MAAQ,KA15CO,CA45CtB,EA2DAzU,EAAQiY,iBAzDR,SAA0BzD,EAAM1B,GAC9B,IAAI2B,EAGJ,OAAKD,GAASA,EAAKC,OAED,GADlBA,EAAQD,EAAKC,OACFjC,MAGXiC,EAAM3B,KAAOA,EACbA,EAAK/D,MAAO,EAx6CQ,GAk6CekD,CAQrC,EA8CAjS,EAAQkY,qBA5CR,SAA8B1D,EAAM2D,GAClC,IAEI1D,EAFA2D,EAAaD,EAAWtX,OAO5B,OAAK2T,GAAyBA,EAAKC,MAGhB,KAFnBA,EAAQD,EAAKC,OAEHjC,MA35CE,KA25CYiC,EAAMlC,KACrBN,EA55CG,KAg6CRwC,EAAMlC,MAGCV,EAFA,EAEgBsG,EAAYC,EAAY,KAClC3D,EAAM7B,OA37CH,EAi8Cd2C,EAAaf,EAAM2D,EAAYC,EAAYA,IAE/C3D,EAAMlC,KAx5CG,IA1CS,IAq8CpBkC,EAAMhC,SAAW,EA38CG,GAo7C+CR,CA0BrE,EAWAjS,EAAQqY,YAAc,oC,wBCtgDtBpY,EAAOD,QAAU0C,KAAKK,G,8BCAtB,IAMIuV,EAAO,CAAC,GAEZC,EARgB,gBAQTD,EANS,EAAQ,MACR,EAAQ,MACR,EAAQ,OAMxBrY,EAAOD,QAAUsY,C,8BCTjB,IAAI1G,EAAQ,EAAQ,MAQhB4G,GAAe,EACfC,GAAmB,EAEvB,IAAMpP,OAAOuO,aAAajL,MAAM,KAAM,CAAE,GAAM,CAAE,MAAO+L,GAAMF,GAAe,CAAO,CACnF,IAAMnP,OAAOuO,aAAajL,MAAM,KAAM,IAAI7F,WAAW,GAAK,CAAE,MAAO4R,GAAMD,GAAmB,CAAO,CAOnG,IADA,IAAIE,EAAW,IAAI/G,EAAM+D,KAAK,KACrBtD,EAAI,EAAGA,EAAI,IAAKA,IACvBsG,EAAStG,GAAMA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EA4D5F,SAASuG,EAAc7H,EAAK8F,GAI1B,GAAIA,EAAM,QACH9F,EAAI8H,UAAYJ,IAAuB1H,EAAI8H,UAAYL,GAC1D,OAAOnP,OAAOuO,aAAajL,MAAM,KAAMiF,EAAMkH,UAAU/H,EAAK8F,IAKhE,IADA,IAAIpL,EAAS,GACJpJ,EAAI,EAAGA,EAAIwU,EAAKxU,IACvBoJ,GAAUpC,OAAOuO,aAAa7G,EAAI1O,IAEpC,OAAOoJ,CACT,CAzEAkN,EAAS,KAAOA,EAAS,KAAO,EAIhC3Y,EAAQ+Y,WAAa,SAAUC,GAC7B,IAAIjI,EAAKlO,EAAGoW,EAAIC,EAAO7W,EAAG8W,EAAUH,EAAInY,OAAQuY,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAEV,QAAZ,OADTrW,EAAImW,EAAIK,WAAWH,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKD,EAAIK,WAAWH,EAAQ,OAE1BrW,EAAI,OAAYA,EAAI,OAAW,KAAOoW,EAAK,OAC3CC,KAGJE,GAAWvW,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHAkO,EAAM,IAAIa,EAAM+D,KAAKyD,GAGhB/W,EAAI,EAAG6W,EAAQ,EAAG7W,EAAI+W,EAASF,IAEb,QAAZ,OADTrW,EAAImW,EAAIK,WAAWH,MACaA,EAAQ,EAAIC,GAEpB,QAAZ,OADVF,EAAKD,EAAIK,WAAWH,EAAQ,OAE1BrW,EAAI,OAAYA,EAAI,OAAW,KAAOoW,EAAK,OAC3CC,KAGArW,EAAI,IAENkO,EAAI1O,KAAOQ,EACFA,EAAI,MAEbkO,EAAI1O,KAAO,IAAQQ,IAAM,EACzBkO,EAAI1O,KAAO,IAAY,GAAJQ,GACVA,EAAI,OAEbkO,EAAI1O,KAAO,IAAQQ,IAAM,GACzBkO,EAAI1O,KAAO,IAAQQ,IAAM,EAAI,GAC7BkO,EAAI1O,KAAO,IAAY,GAAJQ,IAGnBkO,EAAI1O,KAAO,IAAQQ,IAAM,GACzBkO,EAAI1O,KAAO,IAAQQ,IAAM,GAAK,GAC9BkO,EAAI1O,KAAO,IAAQQ,IAAM,EAAI,GAC7BkO,EAAI1O,KAAO,IAAY,GAAJQ,GAIvB,OAAOkO,CACT,EAsBA/Q,EAAQ4Y,cAAgB,SAAU7H,GAChC,OAAO6H,EAAc7H,EAAKA,EAAIlQ,OAChC,EAIAb,EAAQsZ,cAAgB,SAAUN,GAEhC,IADA,IAAIjI,EAAM,IAAIa,EAAM+D,KAAKqD,EAAInY,QACpBwB,EAAI,EAAGwU,EAAM9F,EAAIlQ,OAAQwB,EAAIwU,EAAKxU,IACzC0O,EAAI1O,GAAK2W,EAAIK,WAAWhX,GAE1B,OAAO0O,CACT,EAIA/Q,EAAQuZ,WAAa,SAAUxI,EAAKpL,GAClC,IAAItD,EAAGmX,EAAK3W,EAAG4W,EACX5C,EAAMlR,GAAOoL,EAAIlQ,OAKjB6Y,EAAW,IAAIxS,MAAY,EAAN2P,GAEzB,IAAK2C,EAAM,EAAGnX,EAAI,EAAGA,EAAIwU,GAGvB,IAFAhU,EAAIkO,EAAI1O,MAEA,IAAQqX,EAASF,KAAS3W,OAIlC,IAFA4W,EAAQd,EAAS9V,IAEL,EAAK6W,EAASF,KAAS,MAAQnX,GAAKoX,EAAQ,MAAxD,CAKA,IAFA5W,GAAe,IAAV4W,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAKpX,EAAIwU,GACtBhU,EAAKA,GAAK,EAAiB,GAAXkO,EAAI1O,KACpBoX,IAIEA,EAAQ,EAAKC,EAASF,KAAS,MAE/B3W,EAAI,MACN6W,EAASF,KAAS3W,GAElBA,GAAK,MACL6W,EAASF,KAAS,MAAW3W,GAAK,GAAM,KACxC6W,EAASF,KAAS,MAAc,KAAJ3W,EAlBuC,CAsBvE,OAAO+V,EAAcc,EAAUF,EACjC,EASAxZ,EAAQ2Z,WAAa,SAAU5I,EAAKpL,GAClC,IAAIiU,EAOJ,KALAjU,EAAMA,GAAOoL,EAAIlQ,QACPkQ,EAAIlQ,SAAU8E,EAAMoL,EAAIlQ,QAGlC+Y,EAAMjU,EAAM,EACLiU,GAAO,GAA2B,MAAV,IAAX7I,EAAI6I,KAAyBA,IAIjD,OAAIA,EAAM,GAIE,IAARA,EAJkBjU,EAMdiU,EAAMjB,EAAS5H,EAAI6I,IAAQjU,EAAOiU,EAAMjU,CAClD,C,8BCrKA,IAAIiM,EAAQ,EAAQ,MAWhBiI,EAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,GAG3DC,EAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtDC,EAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,GAG5BC,EAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtB/Z,EAAOD,QAAU,SAAuBia,EAAMlG,EAAMmG,EAAYC,EAAOC,EAAOC,EAAapG,EAAMhH,GAE/F,IAYIqN,EACA5V,EACA6V,EACAC,EACA1G,EAIA0B,EAMAe,EAAWC,EAASC,EA1BpB9R,EAAOsI,EAAKtI,KAGZkS,EAAM,EACNzF,EAAM,EACN9M,EAAM,EAAGqB,EAAM,EACf7F,EAAO,EACP2a,EAAO,EACPC,EAAO,EACPvE,EAAO,EACPwE,EAAO,EACPC,EAAO,EAMPC,EAAO,KACPC,EAAa,EAGbC,EAAQ,IAAInJ,EAAMoC,MAAMgH,IACxBC,EAAO,IAAIrJ,EAAMoC,MAAMgH,IACvB3H,EAAQ,KACR6H,EAAc,EAoClB,IAAKrE,EAAM,EAAGA,GA7FF,GA6FkBA,IAC5BkE,EAAMlE,GAAO,EAEf,IAAKzF,EAAM,EAAGA,EAAM+I,EAAO/I,IACzB2J,EAAMhH,EAAKmG,EAAa9I,MAK1B,IADAtR,EAAO6E,EACFgB,EAtGO,GAsGQA,GAAO,GACN,IAAfoV,EAAMpV,GADkBA,KAM9B,GAHI7F,EAAO6F,IACT7F,EAAO6F,GAEG,IAARA,EAaF,OATAyU,EAAMC,KAAiB,SAMvBD,EAAMC,KAAiB,SAEvBpN,EAAKtI,KAAO,EACL,EAET,IAAKL,EAAM,EAAGA,EAAMqB,GACC,IAAfoV,EAAMzW,GADaA,KASzB,IANIxE,EAAOwE,IACTxE,EAAOwE,GAIT6R,EAAO,EACFU,EAAM,EAAGA,GApIF,GAoIkBA,IAG5B,GAFAV,IAAS,GACTA,GAAQ4E,EAAMlE,IACH,EACT,OAAQ,EAGZ,GAAIV,EAAO,IAtID,IAsIO8D,GAA0B,IAARtU,GACjC,OAAQ,EAKV,IADAsV,EAAK,GAAK,EACLpE,EAAM,EAAGA,EAjJF,GAiJiBA,IAC3BoE,EAAKpE,EAAM,GAAKoE,EAAKpE,GAAOkE,EAAMlE,GAIpC,IAAKzF,EAAM,EAAGA,EAAM+I,EAAO/I,IACM,IAA3B2C,EAAKmG,EAAa9I,KACpB6C,EAAKgH,EAAKlH,EAAKmG,EAAa9I,OAAWA,GAmE3C,GAtNU,IAyLN6I,GACFY,EAAOxH,EAAQY,EACfuB,EAAM,IA1LC,IA4LEyE,GACTY,EAAOhB,EACPiB,GAAc,IACdzH,EAAQyG,EACRoB,GAAe,IACf1F,EAAM,MAGNqF,EAAOd,EACP1G,EAAQ2G,EACRxE,GAAO,GAIToF,EAAO,EACPxJ,EAAM,EACNyF,EAAMvS,EACNwP,EAAOuG,EACPI,EAAO3a,EACP4a,EAAO,EACPH,GAAO,EAEPC,GADAG,EAAO,GAAK7a,GACE,EAlNL,IAqNJma,GAAiBU,EA1NN,KAMN,IAqNPV,GAAkBU,EA1NJ,IA2Nf,OAAO,EAIT,OAAS,CAEPpE,EAAYM,EAAM6D,EACdzG,EAAK7C,GAAOoE,GACdgB,EAAU,EACVC,EAAWxC,EAAK7C,IAET6C,EAAK7C,GAAOoE,GACnBgB,EAAUnD,EAAM6H,EAAcjH,EAAK7C,IACnCqF,EAAWoE,EAAKC,EAAa7G,EAAK7C,MAGlCoF,EAAU,GACVC,EAAW,GAIb6D,EAAO,GAAMzD,EAAM6D,EAEnBpW,EADAI,EAAO,GAAK+V,EAEZ,GAEEL,EAAMtG,GAAQ8G,GAAQF,IADtBhW,GAAQ4V,IAC+B/D,GAAa,GAAOC,GAAW,GAAMC,QAC5D,IAAT/R,GAIT,IADA4V,EAAO,GAAMzD,EAAM,EACZ+D,EAAON,GACZA,IAAS,EAWX,GATa,IAATA,GACFM,GAAQN,EAAO,EACfM,GAAQN,GAERM,EAAO,EAITxJ,IACqB,MAAf2J,EAAMlE,GAAY,CACtB,GAAIA,IAAQlR,EAAO,MACnBkR,EAAM9C,EAAKmG,EAAajG,EAAK7C,GAC/B,CAGA,GAAIyF,EAAM/W,IAAS8a,EAAOJ,KAAUD,EAAK,CAYvC,IAVa,IAATG,IACFA,EAAO5a,GAITgU,GAAQxP,EAIR6R,EAAO,IADPsE,EAAO5D,EAAM6D,GAEND,EAAOC,EAAO/U,MACnBwQ,GAAQ4E,EAAMN,EAAOC,KACT,IACZD,IACAtE,IAAS,EAKX,GADAwE,GAAQ,GAAKF,EA5RR,IA6RAR,GAAiBU,EAlSV,KAMN,IA6RHV,GAAkBU,EAlSR,IAmSX,OAAO,EAQTP,EAJAG,EAAMK,EAAOJ,GAIC1a,GAAQ,GAAO2a,GAAQ,GAAO3G,EAAOuG,CACrD,CACF,CAeA,OAVa,IAATO,IAIFR,EAAMtG,EAAO8G,GAAU/D,EAAM6D,GAAS,GAAO,IAAM,IAKrDzN,EAAKtI,KAAO7E,EACL,CACT,C,8BCpVA,IAAIqK,EAAO,EAAQ,MACfzD,EAAS,EAAQ,MACjByU,EAAc,EAAQ,MAG1Blb,EAAOD,QAAU,WAChB,OAAOmb,EAAYhR,EAAMzD,EAAQ9F,UAClC,C,WCRA,SAASwa,EAAWC,GAClB,OAAOnU,MAAMkH,QAAQiN,GACjBA,EACA,CAACA,EACP,CAEA,MAGMC,EAAwB,QACxBC,EAAmC,iBACnCC,EAA4C,OAC5CC,EAAqC,OACrCC,EAAsB,SAMtBC,EAA0B,eAKhC,IAAIC,EAAiB,cAEC,oBAAXxU,SACTwU,EAAiBxU,OAAOyU,IAAI,gBAE9B,MAAMC,EAAaF,EAKbG,EAAqB,mBAErBC,EAAe,KAAM,EA8BrBC,EAAY,CAEhB,CAIE,UACA,IAnEU,IAuEZ,CAKE,wBACA,CAAC3K,EAAG4K,EAAIC,IAAOD,GACQ,IAArBC,EAAGC,QAAQ,MA7EH,IADA,KAwFZ,CACE,YACA,CAAC9K,EAAG4K,KACF,MAAM,OAACrb,GAAUqb,EACjB,OAAOA,EAAGtR,MAAM,EAAG/J,EAASA,EAAS,GA3F7B,MAgHZ,CACE,iBACA6K,GAAS,KAAKA,KAGhB,CAEE,YACA,IAAM,QAIR,CAKE,MACA,IAAM,KAIR,CACE,MACA,IAAM,OAGR,CAOE,mBAGA,IAAM,eAIR,CAIE,YACA,WAEE,MAAQ,UAAU2Q,KAAK5Y,MAiBnB,IAJA,WAKN,GAIF,CAEE,0BAMA,CAAC6N,EAAGgL,EAAOtD,IAAQsD,EAAQ,EAAItD,EAAInY,OAO/B,kBAMA,SAIN,CAOE,2BAIA,CAACyQ,EAAGiL,EAAIC,IAOCD,EADWC,EAAG9R,QAAQ,QAAS,YAK1C,CAIE,yBACA,IAzOW,MA4Ob,CAEE,QACA,IA/OW,MAkPb,CAKE,gCACA,CAACgB,EAAO+Q,EAAYC,EAAOC,EAAWC,IAxP3B,OAwPqCH,EAE5C,MAAMC,IAhNcG,KAC1B,MAAM,OAAChc,GAAUgc,EACjB,OAAOA,EAAQjS,MAAM,EAAG/J,EAASA,EAAS,IA8MtBic,CAAoBH,KAAaC,IACrC,MAAVA,GACED,EAAU9b,OAAS,GAAM,EAIvB,IAhOU6b,IAASA,EAAMhS,QACnCqR,EACA,CAACrQ,EAAO+E,EAAMsM,IAAOtM,EAAK4I,WAAW,IAAM0D,EAAG1D,WAAW,GACrD3N,EArCQ,IAkQEsR,CAAcN,KAASC,KAI7B,MAIR,CAGE,YAcAjR,GAAS,MAAM2Q,KAAK3Q,GAEhB,GAAGA,KAEH,GAAGA,eAIT,CACE,kBACA,CAAC4F,EAAGiL,KACaA,EAOX,GAAGA,SAIH,SAEG,eAMPU,EAAanQ,OAAOK,OAAO,MAoB3B+P,EAAW7B,GAA8B,iBAAZA,EAanC,MAAM8B,EACJ,WAAAC,CACEC,EACAC,EACAC,EACAC,GAEA/Z,KAAK4Z,OAASA,EACd5Z,KAAK6Z,QAAUA,EACf7Z,KAAK8Z,SAAWA,EAChB9Z,KAAK+Z,MAAQA,CACf,EAGF,MA4BMC,EAAa,CAACC,EAASC,KAC3B,MAAM,IAAIA,EAAKD,IAGXE,EAAY,CAACC,EAAMC,EAAcC,IAChCb,EAASW,GAQTA,GAKDD,EAAUI,cAAcH,IAEnBE,EACL,0DAA0CD,KAC1CG,YARKF,EAAQ,yBAA0BnN,WARlCmN,EACL,oCAAoCD,MACpClN,WAqBAoN,EAAgBH,GAAQlC,EAAwBU,KAAKwB,GAE3DD,EAAUI,cAAgBA,EAC1BJ,EAAUM,QAAUC,GAAKA,EAEzB,MAAMC,EACJ,WAAAhB,EAAa,WACXiB,GAAa,EAAI,WACjBC,EAAaD,EAAU,mBACvBE,GAAqB,GACnB,CAAC,GAlZQ,IAASrQ,IAmZP4N,EAlZfhP,OAAOC,eAkZEtJ,KAlZqByK,EAAK,CAACvN,MAkZT,OAEzB8C,KAAK+a,OAAS,GACd/a,KAAKgb,YAAcH,EACnB7a,KAAKib,oBAAsBH,EAC3B9a,KAAKkb,YACP,CAEA,UAAAA,GACElb,KAAKmb,aAAe9R,OAAOK,OAAO,MAClC1J,KAAKob,WAAa/R,OAAOK,OAAO,KAClC,CAEA,WAAA2R,CAAaxB,GAEX,GAAIA,GAAWA,EAAQxB,GAGrB,OAFArY,KAAK+a,OAAS/a,KAAK+a,OAAOlU,OAAOgT,EAAQkB,aACzC/a,KAAKsb,QAAS,GAIhB,GAjHiBzB,IAAWA,GAC3BJ,EAASI,KACRhC,EAAsBe,KAAKiB,KAC3B/B,EAAiCc,KAAKiB,IAGd,IAAzBA,EAAQlB,QAAQ,KA2Gb4C,CAAa1B,GAAU,CACzB,MAAM2B,EA1FO,EAAC3B,EAASgB,KAC3B,MAAMjB,EAASC,EACf,IAAIC,GAAW,EAGc,IAAzBD,EAAQlB,QAAQ,OAClBmB,GAAW,EACXD,EAAUA,EAAQ4B,OAAO,IAW3B,MAAM1B,EA9DU,EAACF,EAASgB,KAC1B,IAAIa,EAASlC,EAAWK,GAWxB,OATK6B,IACHA,EAASlD,EAAUmD,OACjB,CAACpP,GAAOqP,EAASC,KACftP,EAAKtF,QAAQ2U,EAASC,EAASnV,KAAKmT,IACtCA,GAEFL,EAAWK,GAAW6B,GAGjBb,EACH,IAAIpV,OAAOiW,EAAQ,KACnB,IAAIjW,OAAOiW,IAgDDI,CARdjC,EAAUA,EAGT5S,QAAQ8Q,EAA2C,KAGnD9Q,QAAQ+Q,EAAoC,KAEZ6C,GAEjC,OAAO,IAAInB,EACTE,EACAC,EACAC,EACAC,IAkEegC,CAAWlC,EAAS7Z,KAAKgb,aACtChb,KAAKsb,QAAS,EACdtb,KAAK+a,OAAO5O,KAAKqP,EACnB,CACF,CAGA,GAAAQ,CAAKnC,GAeH,OAdA7Z,KAAKsb,QAAS,EAEd3D,EACE8B,EAASI,GArHMA,IAAWA,EAAQoC,MAAMhE,GAsHpCiE,CAAarC,GACbA,GACJsC,QAAQnc,KAAKqb,YAAarb,MAIxBA,KAAKsb,QACPtb,KAAKkb,aAGAlb,IACT,CAGA,UAAAoc,CAAYvC,GACV,OAAO7Z,KAAKgc,IAAInC,EAClB,CAkBA,QAAAwC,CAAUjC,EAAMkC,GACd,IAAIC,GAAU,EACVC,GAAY,EAmBhB,OAjBAxc,KAAK+a,OAAOoB,QAAQX,IAClB,MAAM,SAAC1B,GAAY0B,EAEjBgB,IAAc1C,GAAYyC,IAAYC,GACnC1C,IAAayC,IAAYC,IAAcF,GAK5Bd,EAAKzB,MAAMnB,KAAKwB,KAG9BmC,GAAWzC,EACX0C,EAAY1C,KAIT,CACLyC,UACAC,YAEJ,CAGA,KAAAC,CAAOpC,EAAcqC,EAAOJ,EAAgBK,GAC1C,MAAMvC,EAAOC,GAERF,EAAUM,QAAQJ,GAUvB,OARAF,EACEC,EACAC,EACAra,KAAKib,oBACD1C,EACAyB,GAGCha,KAAK4c,GAAGxC,EAAMsC,EAAOJ,EAAgBK,EAC9C,CAEA,EAAAC,CAAIxC,EAAMsC,EAAOJ,EAAgBK,GAC/B,GAAIvC,KAAQsC,EACV,OAAOA,EAAMtC,GAYf,GATKuC,IAGHA,EAASvC,EAAK6B,MArhBN,MAwhBVU,EAAOE,OAGFF,EAAOvf,OACV,OAAOsf,EAAMtC,GAAQpa,KAAKqc,SAASjC,EAAMkC,GAG3C,MAAMQ,EAAS9c,KAAK4c,GAClBD,EAAOI,KAhiBC,SAiiBRL,EACAJ,EACAK,GAIF,OAAOD,EAAMtC,GAAQ0C,EAAOP,QAGxBO,EACA9c,KAAKqc,SAASjC,EAAMkC,EAC1B,CAEA,OAAAU,CAAS5C,GACP,OAAOpa,KAAKyc,MAAMrC,EAAMpa,KAAKmb,cAAc,GAAOoB,OACpD,CAEA,YAAAU,GACE,OAAO7C,IAASpa,KAAKgd,QAAQ5C,EAC/B,CAEA,MAAA8C,CAAQC,GACN,OAAOxF,EAAUwF,GAAOD,OAAOld,KAAKid,eACtC,CAGA,IAAArE,CAAMwB,GACJ,OAAOpa,KAAKyc,MAAMrC,EAAMpa,KAAKob,YAAY,EAC3C,EAGF,MAAM9e,EAAU8gB,GAAW,IAAIzC,EAAOyC,GAetC,GAVA9gB,EAAQ+gB,YAHYjD,GAClBD,EAAUC,GAAQD,EAAUM,QAAQL,GAAOA,EAAM7B,GAKnDjc,EAAQghB,QAAUhhB,EAElBE,EAAOD,QAAUD,EAOI,oBAAZsN,UAELA,QAAQ2T,KAAO3T,QAAQ2T,IAAIC,mBACH,UAArB5T,QAAQ6T,UAEb,CAEA,MAAMC,EAAYnI,GAAO,YAAYqD,KAAKrD,IACvC,wBAAwBqD,KAAKrD,GAC5BA,EACAA,EAAItO,QAAQ,MAAO,KAEvBkT,EAAUM,QAAUiD,EAIpB,MAAMC,EAAiC,aACvCxD,EAAUI,cAAgBH,GACxBuD,EAA+B/E,KAAKwB,IACjCG,EAAcH,EACrB,C,eCxnBA,IACW9d,IAoBT,SAASshB,GACXA,EAAMC,QAAU,QAqBhB,IAAIC,EAnBJ,WAGC,IAFA,IAAI1e,EAAI,EAAGuX,EAAQ,IAAIlT,MAAM,KAErB4P,EAAG,EAAQ,KAALA,IAAYA,EASzBjU,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAQ,GADRA,EAAIiU,IACW,UAAajU,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,IAChC,UAAaA,IAAM,EAAOA,IAAM,EAC/CuX,EAAMtD,GAAKjU,EAGZ,MAA6B,oBAAf2F,WAA6B,IAAIA,WAAW4R,GAASA,CACpE,CAESoH,GAaLC,EAZJ,SAA4BC,GAC3B,IAAI7e,EAAI,EAAG8e,EAAI,EAAG7K,EAAI,EAAGsD,EAA8B,oBAAf5R,WAA6B,IAAIA,WAAW,MAAQ,IAAItB,MAAM,MAEtG,IAAI4P,EAAI,EAAQ,KAALA,IAAYA,EAAGsD,EAAMtD,GAAK4K,EAAE5K,GACvC,IAAIA,EAAI,EAAQ,KAALA,IAAYA,EAEtB,IADA6K,EAAID,EAAE5K,GACFjU,EAAI,IAAMiU,EAAGjU,EAAI,KAAMA,GAAK,IAAK8e,EAAIvH,EAAMvX,GAAM8e,IAAM,EAAKD,EAAM,IAAJC,GAEnE,IAAInI,EAAM,GACV,IAAI1C,EAAI,EAAQ,IAALA,IAAWA,EAAG0C,EAAI1C,EAAI,GAA2B,oBAAftO,WAA6B4R,EAAMvB,SAAa,IAAJ/B,EAAa,IAAJA,EAAU,KAAOsD,EAAMxP,MAAU,IAAJkM,EAAa,IAAJA,EAAU,KAClJ,OAAO0C,CACR,CACSoI,CAAmBL,GACxBM,EAAKJ,EAAG,GAAKK,EAAKL,EAAG,GAAKM,EAAKN,EAAG,GAAKO,EAAKP,EAAG,GAAKQ,EAAKR,EAAG,GAC5DS,EAAKT,EAAG,GAAKU,EAAKV,EAAG,GAAKW,EAAKX,EAAG,GAAKY,EAAKZ,EAAG,GAAKa,EAAKb,EAAG,GAC5Dc,EAAKd,EAAG,IAAKe,EAAKf,EAAG,IAAKgB,EAAKhB,EAAG,IAAKiB,EAAKjB,EAAG,IAAKkB,EAAKlB,EAAG,IA6ChEJ,EAAMjH,MAAQmH,EAEdF,EAAMuB,KA9CN,SAAoBA,EAAMC,GAEzB,IADA,IAAIC,GAAY,EAARD,EACAxgB,EAAI,EAAG0gB,EAAIH,EAAK/hB,OAAQwB,EAAI0gB,GAAID,EAAKA,IAAI,EAAKvB,EAA4B,KAAxBuB,EAAEF,EAAKvJ,WAAWhX,OAC5E,OAAQygB,CACT,EA4CAzB,EAAMtQ,IA1CN,SAAmBiS,EAAGH,GAErB,IADA,IAAIC,GAAY,EAARD,EAAWE,EAAIC,EAAEniB,OAAS,GAAIwB,EAAI,EACpCA,EAAI0gB,GAAID,EACbH,EAAGK,EAAE3gB,KAAY,IAAJygB,GACbJ,EAAGM,EAAE3gB,KAASygB,GAAK,EAAK,KACxBL,EAAGO,EAAE3gB,KAASygB,GAAK,GAAM,KACzBN,EAAGQ,EAAE3gB,KAAQygB,IAAM,IACnBP,EAAGS,EAAE3gB,MAAQigB,EAAGU,EAAE3gB,MAAQggB,EAAGW,EAAE3gB,MAAQ+f,EAAGY,EAAE3gB,MAC5C8f,EAAGa,EAAE3gB,MAAQ6f,EAAGc,EAAE3gB,MAAQ4f,EAAGe,EAAE3gB,MAAQ2f,EAAGgB,EAAE3gB,MAC5C0f,EAAGiB,EAAE3gB,MAAQyf,EAAGkB,EAAE3gB,MAAQwf,EAAGmB,EAAE3gB,MAAQkf,EAAGyB,EAAE3gB,MAE7C,IADA0gB,GAAK,GACC1gB,EAAI0gB,GAAGD,EAAKA,IAAI,EAAKvB,EAAc,KAAVuB,EAAEE,EAAE3gB,OACnC,OAAQygB,CACT,EA+BAzB,EAAMrI,IA7BN,SAAmBA,EAAK6J,GAEvB,IADA,IAAIC,GAAY,EAARD,EACAxgB,EAAI,EAAG0gB,EAAI/J,EAAInY,OAAQgC,EAAI,EAAGP,EAAI,EAAGD,EAAI0gB,IAChDlgB,EAAImW,EAAIK,WAAWhX,MACZ,IACNygB,EAAKA,IAAI,EAAKvB,EAAS,KAALuB,EAAEjgB,IACXA,EAAI,KAEbigB,GADAA,EAAKA,IAAI,EAAKvB,EAA2B,KAAvBuB,GAAK,IAAMjgB,GAAG,EAAG,SAC1B,EAAK0e,EAAsB,KAAlBuB,GAAK,IAAO,GAAFjgB,KACnBA,GAAK,OAAUA,EAAI,OAC5BA,EAAa,IAAN,KAAFA,GAAYP,EAAwB,KAApB0W,EAAIK,WAAWhX,KAIpCygB,GADAA,GADAA,GADAA,EAAKA,IAAI,EAAKvB,EAA0B,KAAtBuB,GAAK,IAAMjgB,GAAG,EAAG,QAC1B,EAAK0e,EAA2B,KAAvBuB,GAAK,IAAMjgB,GAAG,EAAG,SAC1B,EAAK0e,EAAsC,KAAlCuB,GAAK,IAAMxgB,GAAG,EAAG,IAAQ,EAAFO,IAAM,QACtC,EAAK0e,EAAsB,KAAlBuB,GAAK,IAAO,GAAFxgB,MAI5BwgB,GADAA,GADAA,EAAKA,IAAI,EAAKvB,EAA4B,KAAxBuB,GAAK,IAAMjgB,GAAG,GAAI,SAC3B,EAAK0e,EAA2B,KAAvBuB,GAAK,IAAMjgB,GAAG,EAAG,SAC1B,EAAK0e,EAAsB,KAAlBuB,GAAK,IAAO,GAAFjgB,KAG9B,OAAQigB,CACT,CAQA,EA3GiC,oBAAtBG,kBAERljB,EAAQC,GAWTD,EAAgB,CAAC,E,8BClBnB,IAAImjB,EAAa,EAAQ,MAErBC,EAAQrW,OAAOvL,UAAU0D,SACzBme,EAAiBtW,OAAOvL,UAAU6hB,eA8CtCnjB,EAAOD,QAAU,SAAiBqjB,EAAMhc,EAAUic,GAC9C,IAAKJ,EAAW7b,GACZ,MAAM,IAAIuJ,UAAU,+BAGxB,IAAI2S,EAVSC,EAWT5iB,UAAUC,QAAU,IACpB0iB,EAAWD,GAZFE,EAeDH,EAda,mBAAlBF,EAAM3hB,KAAKgiB,GAvCH,SAAsBC,EAAOpc,EAAUkc,GACtD,IAAK,IAAIlhB,EAAI,EAAGwU,EAAM4M,EAAM5iB,OAAQwB,EAAIwU,EAAKxU,IACrC+gB,EAAe5hB,KAAKiiB,EAAOphB,KACX,MAAZkhB,EACAlc,EAASoc,EAAMphB,GAAIA,EAAGohB,GAEtBpc,EAAS7F,KAAK+hB,EAAUE,EAAMphB,GAAIA,EAAGohB,GAIrD,CA4CQC,CAAaL,EAAMhc,EAAUkc,GACN,iBAATF,EA1CF,SAAuB/X,EAAQjE,EAAUkc,GACzD,IAAK,IAAIlhB,EAAI,EAAGwU,EAAMvL,EAAOzK,OAAQwB,EAAIwU,EAAKxU,IAE1B,MAAZkhB,EACAlc,EAASiE,EAAOqY,OAAOthB,GAAIA,EAAGiJ,GAE9BjE,EAAS7F,KAAK+hB,EAAUjY,EAAOqY,OAAOthB,GAAIA,EAAGiJ,EAGzD,CAkCQsY,CAAcP,EAAMhc,EAAUkc,GA/BlB,SAAuBM,EAAQxc,EAAUkc,GACzD,IAAK,IAAIO,KAAKD,EACNT,EAAe5hB,KAAKqiB,EAAQC,KACZ,MAAZP,EACAlc,EAASwc,EAAOC,GAAIA,EAAGD,GAEvBxc,EAAS7F,KAAK+hB,EAAUM,EAAOC,GAAIA,EAAGD,GAItD,CAuBQE,CAAcV,EAAMhc,EAAUkc,EAEtC,C,8BClEA,IAAIS,EAAS,EAAQ,MAGrB/jB,EAAOD,QAAU,SAAc2L,GAC9B,OAAIqY,EAAOrY,IAAsB,IAAXA,EACdA,EAEDA,EAAS,GAAK,EAAI,CAC1B,C,8BCRA,IAAIxB,EAAO,EAAQ,MACf5J,EAAa,EAAQ,MAErBoG,EAAQ,EAAQ,IAChBsd,EAAe,EAAQ,MAG3BhkB,EAAOD,QAAU,SAAuBkkB,GACvC,GAAIA,EAAKrjB,OAAS,GAAwB,mBAAZqjB,EAAK,GAClC,MAAM,IAAI3jB,EAAW,0BAEtB,OAAO0jB,EAAa9Z,EAAMxD,EAAOud,EAClC,C,8BCZA,IAAI/Z,EAAO,EAAQ,MAEfzD,EAAS,EAAQ,MACjBC,EAAQ,EAAQ,IAChBwd,EAAgB,EAAQ,MAG5BlkB,EAAOD,QAAUmkB,GAAiBha,EAAK3I,KAAKmF,EAAOD,E,wBCyCnDzG,EAAOD,QAzBP,SAAiB6U,EAAO9D,EAAK8F,EAAK+C,GAKhC,IAJA,IAAIwK,EAAc,MAARvP,EACNwP,EAAOxP,IAAU,GAAM,MACvBiC,EAAI,EAEO,IAARD,GAAW,CAKhBA,GADAC,EAAID,EAAM,IAAO,IAAOA,EAGxB,GAEEwN,EAAMA,GADND,EAAMA,EAAKrT,EAAI6I,KAAS,GACR,UACP9C,GAEXsN,GAAM,MACNC,GAAM,KACR,CAEA,OAAQD,EAAMC,GAAM,EACtB,C,8BC5CA,IAAIC,EAAe,EAAQ,MACvB1S,EAAe,EAAQ,MACvB2S,EAAe,EAAQ,MACvB3P,EAAe,EAAQ,MACvB4P,EAAe,EAAQ,MAEvBvf,EAAW6H,OAAOvL,UAAU0D,SA8GhC,SAASwf,EAAQ5D,GACf,KAAMpd,gBAAgBghB,GAAU,OAAO,IAAIA,EAAQ5D,GAEnDpd,KAAKod,QAAUjP,EAAM2G,OAAO,CAC1BmM,OAtGwB,EAuGxBC,OAnGc,EAoGdC,UAAW,MACX3P,WAAY,GACZ4P,SAAU,EACVC,SAzGwB,EA0GxB/H,GAAI,IACH8D,GAAW,CAAC,GAEf,IAAIkE,EAAMthB,KAAKod,QAEXkE,EAAIC,KAAQD,EAAI9P,WAAa,EAC/B8P,EAAI9P,YAAc8P,EAAI9P,WAGf8P,EAAIE,MAASF,EAAI9P,WAAa,GAAO8P,EAAI9P,WAAa,KAC7D8P,EAAI9P,YAAc,IAGpBxR,KAAKwL,IAAS,EACdxL,KAAKmR,IAAS,GACdnR,KAAKyhB,OAAS,EACdzhB,KAAK0hB,OAAS,GAEd1hB,KAAK+Q,KAAO,IAAIgQ,EAChB/gB,KAAK+Q,KAAK4C,UAAY,EAEtB,IAAIgO,EAASd,EAAae,aACxB5hB,KAAK+Q,KACLuQ,EAAIL,MACJK,EAAIJ,OACJI,EAAI9P,WACJ8P,EAAIF,SACJE,EAAID,UAGN,GA9IoB,IA8IhBM,EACF,MAAM,IAAIlgB,MAAM0P,EAAIwQ,IAOtB,GAJIL,EAAIO,QACNhB,EAAaiB,iBAAiB9hB,KAAK+Q,KAAMuQ,EAAIO,QAG3CP,EAAI5M,WAAY,CAClB,IAAIqN,EAaJ,GATEA,EAF4B,iBAAnBT,EAAI5M,WAENoM,EAAQxL,WAAWgM,EAAI5M,YACa,yBAAlClT,EAASzD,KAAKujB,EAAI5M,YACpB,IAAIrR,WAAWie,EAAI5M,YAEnB4M,EAAI5M,WA/JK,KAkKlBiN,EAASd,EAAamB,qBAAqBhiB,KAAK+Q,KAAMgR,IAGpD,MAAM,IAAItgB,MAAM0P,EAAIwQ,IAGtB3hB,KAAKiiB,WAAY,CACnB,CACF,CAuKA,SAASC,EAAQ3P,EAAO6K,GACtB,IAAI+E,EAAW,IAAInB,EAAQ5D,GAK3B,GAHA+E,EAAShW,KAAKoG,GAAO,GAGjB4P,EAAS3W,IAAO,MAAM2W,EAAShR,KAAOA,EAAIgR,EAAS3W,KAEvD,OAAO2W,EAASna,MAClB,CAjJAgZ,EAAQljB,UAAUqO,KAAO,SAAU5L,EAAMuO,GACvC,IAEI6S,EAAQS,EAFRrR,EAAO/Q,KAAK+Q,KACZoQ,EAAYnhB,KAAKod,QAAQ+D,UAG7B,GAAInhB,KAAKyhB,MAAS,OAAO,EAEzBW,EAAStT,MAAWA,EAAQA,GAAkB,IAATA,EAlNjB,EADA,EAsNA,iBAATvO,EAETwQ,EAAKwB,MAAQuO,EAAQxL,WAAW/U,GACC,yBAAxBiB,EAASzD,KAAKwC,GACvBwQ,EAAKwB,MAAQ,IAAIlP,WAAW9C,GAE5BwQ,EAAKwB,MAAQhS,EAGfwQ,EAAK6C,QAAU,EACf7C,EAAK0C,SAAW1C,EAAKwB,MAAMnV,OAE3B,EAAG,CAQD,GAPuB,IAAnB2T,EAAK4C,YACP5C,EAAKyB,OAAS,IAAIrE,EAAM+D,KAAKiP,GAC7BpQ,EAAK2C,SAAW,EAChB3C,EAAK4C,UAAYwN,GAlOD,KAoOlBQ,EAASd,EAAaqB,QAAQnR,EAAMqR,KArOlB,IAuOaT,EAG7B,OAFA3hB,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,GACN,EAEc,IAAnB1Q,EAAK4C,YAAsC,IAAlB5C,EAAK0C,UA9OhB,IA8OmC2O,GA1OnC,IA0OyDA,KACjD,WAApBpiB,KAAKod,QAAQ9D,GACftZ,KAAKsiB,OAAOxB,EAAQ3L,cAAchH,EAAMkH,UAAUtE,EAAKyB,OAAQzB,EAAK2C,YAEpE1T,KAAKsiB,OAAOnU,EAAMkH,UAAUtE,EAAKyB,OAAQzB,EAAK2C,WAGpD,QAAU3C,EAAK0C,SAAW,GAAwB,IAAnB1C,EAAK4C,YAlPhB,IAkPoCgO,GAGxD,OAxPoB,IAwPhBS,GACFT,EAASd,EAAa0B,WAAWviB,KAAK+Q,MACtC/Q,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,EAzPK,IA0PXE,GAxPW,IA4PhBS,IACFpiB,KAAKqiB,MA/Pa,GAgQlBtR,EAAK4C,UAAY,GACV,EAIX,EAYAqN,EAAQljB,UAAUwkB,OAAS,SAAUE,GACnCxiB,KAAK0hB,OAAOvV,KAAKqW,EACnB,EAaAxB,EAAQljB,UAAUukB,MAAQ,SAAUV,GAhSd,IAkShBA,IACsB,WAApB3hB,KAAKod,QAAQ9D,GACftZ,KAAKgI,OAAShI,KAAK0hB,OAAO3E,KAAK,IAE/B/c,KAAKgI,OAASmG,EAAMsU,cAAcziB,KAAK0hB,SAG3C1hB,KAAK0hB,OAAS,GACd1hB,KAAKwL,IAAMmW,EACX3hB,KAAKmR,IAAMnR,KAAK+Q,KAAKI,GACvB,EA+EA5U,EAAQykB,QAAUA,EAClBzkB,EAAQ2lB,QAAUA,EAClB3lB,EAAQmmB,WAxBR,SAAoBnQ,EAAO6K,GAGzB,OAFAA,EAAUA,GAAW,CAAC,GACdmE,KAAM,EACPW,EAAQ3P,EAAO6K,EACxB,EAqBA7gB,EAAQilB,KAVR,SAAcjP,EAAO6K,GAGnB,OAFAA,EAAUA,GAAW,CAAC,GACdoE,MAAO,EACRU,EAAQ3P,EAAO6K,EACxB,C,8BCvYA,IAAIuF,EAAkB,EAAQ,MAC1BC,EAAmB,EAAQ,MAE3BC,EAAiB,EAAQ,MAG7BrmB,EAAOD,QAAUomB,EACd,SAAkBG,GAEnB,OAAOH,EAAgBG,EACxB,EACEF,EACC,SAAkBE,GACnB,IAAKA,GAAmB,iBAANA,GAA+B,mBAANA,EAC1C,MAAM,IAAI3V,UAAU,2BAGrB,OAAOyV,EAAiBE,EACzB,EACED,EACC,SAAkBC,GAEnB,OAAOD,EAAeC,EACvB,EACE,I,8BCHL,IAAI3U,EAAQ,EAAQ,MAqBpB,SAAS4U,EAAKzV,GAA6B,IAAtB,IAAI8F,EAAM9F,EAAIlQ,SAAiBgW,GAAO,GAAK9F,EAAI8F,GAAO,CAAK,CAIhF,IA2DI4P,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEvDC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAEhEC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEnCC,EACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAgB3CC,EAAgB,IAAI3f,MAAM,KAC9Bsf,EAAKK,GAOL,IAAIC,EAAgB,IAAI5f,MAAM6f,IAC9BP,EAAKM,GAKL,IAAIE,EAAgB,IAAI9f,MAjBJ,KAkBpBsf,EAAKQ,GAML,IAAIC,EAAgB,IAAI/f,MAAMggB,KAC9BV,EAAKS,GAGL,IAAIE,EAAgB,IAAIjgB,MAhGJ,IAiGpBsf,EAAKW,GAGL,IAkBIC,EACAC,EACAC,EApBAC,EAAgB,IAAIrgB,MA3FJ,IAgGpB,SAASsgB,EAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElEpkB,KAAKgkB,YAAeA,EACpBhkB,KAAKikB,WAAeA,EACpBjkB,KAAKkkB,WAAeA,EACpBlkB,KAAKmkB,MAAeA,EACpBnkB,KAAKokB,WAAeA,EAGpBpkB,KAAKqkB,UAAeL,GAAeA,EAAY5mB,MACjD,CAQA,SAASknB,EAASC,EAAUC,GAC1BxkB,KAAKukB,SAAWA,EAChBvkB,KAAKykB,SAAW,EAChBzkB,KAAKwkB,UAAYA,CACnB,CAIA,SAASE,EAAOzS,GACd,OAAOA,EAAO,IAAMsR,EAAWtR,GAAQsR,EAAW,KAAOtR,IAAS,GACpE,CAOA,SAAS0S,EAAU7lB,EAAG8lB,GAGpB9lB,EAAE+lB,YAAY/lB,EAAEgmB,WAAmB,IAAN,EAC7BhmB,EAAE+lB,YAAY/lB,EAAEgmB,WAAcF,IAAM,EAAK,GAC3C,CAOA,SAASG,EAAUjmB,EAAG5B,EAAOE,GACvB0B,EAAEkmB,SApIY,GAoIW5nB,GAC3B0B,EAAEmmB,QAAW/nB,GAAS4B,EAAEkmB,SAAY,MACpCL,EAAU7lB,EAAGA,EAAEmmB,QACfnmB,EAAEmmB,OAAS/nB,GAvIK,GAuIgB4B,EAAEkmB,SAClClmB,EAAEkmB,UAAY5nB,EAxIE,KA0IhB0B,EAAEmmB,QAAW/nB,GAAS4B,EAAEkmB,SAAY,MACpClmB,EAAEkmB,UAAY5nB,EAElB,CAGA,SAAS8nB,EAAUpmB,EAAGM,EAAG+lB,GACvBJ,EAAUjmB,EAAGqmB,EAAS,EAAJ/lB,GAAiB+lB,EAAS,EAAJ/lB,EAAQ,GAClD,CAQA,SAASgmB,EAAWC,EAAMjS,GACxB,IAAIkS,EAAM,EACV,GACEA,GAAc,EAAPD,EACPA,KAAU,EACVC,IAAQ,UACClS,EAAM,GACjB,OAAOkS,IAAQ,CACjB,CA+HA,SAASC,EAAUJ,EAAMV,EAAUe,GAKjC,IAEItkB,EACAmS,EAHAoS,EAAY,IAAIhiB,MAAMiiB,IACtBL,EAAO,EAOX,IAAKnkB,EAAO,EAAGA,GAjTG,GAiTeA,IAC/BukB,EAAUvkB,GAAQmkB,EAAQA,EAAOG,EAAStkB,EAAO,IAAO,EAS1D,IAAKmS,EAAI,EAAIA,GAAKoR,EAAUpR,IAAK,CAC/B,IAAID,EAAM+R,EAAS,EAAJ9R,EAAQ,GACX,IAARD,IAEJ+R,EAAS,EAAJ9R,GAAkB+R,EAAWK,EAAUrS,KAAQA,GAItD,CACF,CA8GA,SAASuS,EAAW7mB,GAClB,IAAIuU,EAGJ,IAAKA,EAAI,EAAGA,EAlcMuS,IAkcQvS,IAAOvU,EAAE+mB,UAAc,EAAJxS,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EAhcM,GAgcQA,IAAOvU,EAAEgnB,UAAc,EAAJzS,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EA9bM,GA8bQA,IAAOvU,EAAEinB,QAAY,EAAJ1S,GAAkB,EAE7DvU,EAAE+mB,UAAUG,KAA0B,EACtClnB,EAAEmnB,QAAUnnB,EAAEonB,WAAa,EAC3BpnB,EAAEqnB,SAAWrnB,EAAEsnB,QAAU,CAC3B,CAMA,SAASC,EAAUvnB,GAEbA,EAAEkmB,SAAW,EACfL,EAAU7lB,EAAGA,EAAEmmB,QACNnmB,EAAEkmB,SAAW,IAEtBlmB,EAAE+lB,YAAY/lB,EAAEgmB,WAAahmB,EAAEmmB,QAEjCnmB,EAAEmmB,OAAS,EACXnmB,EAAEkmB,SAAW,CACf,CA6BA,SAASsB,EAAQnB,EAAM9R,EAAG9U,EAAGgoB,GAC3B,IAAIC,EAAU,EAAJnT,EACNoT,EAAU,EAAJloB,EACV,OAAQ4mB,EAAKqB,GAAgBrB,EAAKsB,IAC1BtB,EAAKqB,KAAkBrB,EAAKsB,IAAiBF,EAAMlT,IAAMkT,EAAMhoB,EACzE,CAQA,SAASmoB,EAAW5nB,EAAGqmB,EAAM9E,GAO3B,IAFA,IAAInC,EAAIpf,EAAE6nB,KAAKtG,GACXuG,EAAIvG,GAAK,EACNuG,GAAK9nB,EAAE+nB,WAERD,EAAI9nB,EAAE+nB,UACRP,EAAQnB,EAAMrmB,EAAE6nB,KAAKC,EAAI,GAAI9nB,EAAE6nB,KAAKC,GAAI9nB,EAAEynB,QAC1CK,KAGEN,EAAQnB,EAAMjH,EAAGpf,EAAE6nB,KAAKC,GAAI9nB,EAAEynB,SAGlCznB,EAAE6nB,KAAKtG,GAAKvhB,EAAE6nB,KAAKC,GACnBvG,EAAIuG,EAGJA,IAAM,EAER9nB,EAAE6nB,KAAKtG,GAAKnC,CACd,CASA,SAAS4I,EAAehoB,EAAGioB,EAAOC,GAKhC,IAAI/U,EACAgV,EAEA5B,EACAzV,EAFAsX,EAAK,EAIT,GAAmB,IAAfpoB,EAAEqnB,SACJ,GACElU,EAAQnT,EAAE+lB,YAAY/lB,EAAEqoB,MAAa,EAALD,IAAW,EAAMpoB,EAAE+lB,YAAY/lB,EAAEqoB,MAAa,EAALD,EAAS,GAClFD,EAAKnoB,EAAE+lB,YAAY/lB,EAAEsoB,MAAQF,GAC7BA,IAEa,IAATjV,EACFiT,EAAUpmB,EAAGmoB,EAAIF,IAKjB7B,EAAUpmB,GADVumB,EAAO7B,EAAayD,IA7jBR,IA8jBmB,EAAGF,GAEpB,KADdnX,EAAQoT,EAAYqC,KAGlBN,EAAUjmB,EADVmoB,GAAMvD,EAAY2B,GACDzV,GAMnBsV,EAAUpmB,EAHVumB,EAAOX,IADPzS,GAImB+U,GAEL,KADdpX,EAAQqT,EAAYoC,KAGlBN,EAAUjmB,EADVmT,GAAQ6R,EAAUuB,GACCzV,UAQhBsX,EAAKpoB,EAAEqnB,UAGlBjB,EAAUpmB,EA1jBM,IA0jBQioB,EAC1B,CAWA,SAASM,EAAWvoB,EAAGrB,GAIrB,IAII4V,EAAG9U,EAEH+oB,EANAnC,EAAW1nB,EAAK8mB,SAChBgD,EAAW9pB,EAAK+mB,UAAUR,YAC1BK,EAAY5mB,EAAK+mB,UAAUH,UAC3BF,EAAW1mB,EAAK+mB,UAAUL,MAE1BM,GAAY,EAUhB,IAHA3lB,EAAE+nB,SAAW,EACb/nB,EAAE0oB,SAxmBgB,IA0mBbnU,EAAI,EAAGA,EAAI8Q,EAAO9Q,IACQ,IAAzB8R,EAAS,EAAJ9R,IACPvU,EAAE6nB,OAAO7nB,EAAE+nB,UAAYpC,EAAWpR,EAClCvU,EAAEynB,MAAMlT,GAAK,GAGb8R,EAAS,EAAJ9R,EAAQ,GAAa,EAS9B,KAAOvU,EAAE+nB,SAAW,GAElB1B,EAAY,GADZmC,EAAOxoB,EAAE6nB,OAAO7nB,EAAE+nB,UAAapC,EAAW,IAAMA,EAAW,IACjC,EAC1B3lB,EAAEynB,MAAMe,GAAQ,EAChBxoB,EAAEmnB,UAEE5B,IACFvlB,EAAEonB,YAAcqB,EAAa,EAAPD,EAAW,IASrC,IALA7pB,EAAKgnB,SAAWA,EAKXpR,EAAKvU,EAAE+nB,UAAY,EAAcxT,GAAK,EAAGA,IAAOqT,EAAW5nB,EAAGqmB,EAAM9R,GAKzEiU,EAAOnD,EACP,GAGE9Q,EAAIvU,EAAE6nB,KAAK,GACX7nB,EAAE6nB,KAAK,GAAiB7nB,EAAE6nB,KAAK7nB,EAAE+nB,YACjCH,EAAW5nB,EAAGqmB,EAAM,GAGpB5mB,EAAIO,EAAE6nB,KAAK,GAEX7nB,EAAE6nB,OAAO7nB,EAAE0oB,UAAYnU,EACvBvU,EAAE6nB,OAAO7nB,EAAE0oB,UAAYjpB,EAGvB4mB,EAAY,EAAPmC,GAAqBnC,EAAS,EAAJ9R,GAAkB8R,EAAS,EAAJ5mB,GACtDO,EAAEynB,MAAMe,IAASxoB,EAAEynB,MAAMlT,IAAMvU,EAAEynB,MAAMhoB,GAAKO,EAAEynB,MAAMlT,GAAKvU,EAAEynB,MAAMhoB,IAAM,EACvE4mB,EAAS,EAAJ9R,EAAQ,GAAa8R,EAAS,EAAJ5mB,EAAQ,GAAa+oB,EAGpDxoB,EAAE6nB,KAAK,GAAiBW,IACxBZ,EAAW5nB,EAAGqmB,EAAM,SAEbrmB,EAAE+nB,UAAY,GAEvB/nB,EAAE6nB,OAAO7nB,EAAE0oB,UAAY1oB,EAAE6nB,KAAK,GAjehC,SAAoB7nB,EAAGrB,GAIrB,IAOIgqB,EACApU,EAAG9U,EACH2C,EACAwmB,EACAC,EAXAxC,EAAkB1nB,EAAK8mB,SACvBE,EAAkBhnB,EAAKgnB,SACvB8C,EAAkB9pB,EAAK+mB,UAAUR,YACjCK,EAAkB5mB,EAAK+mB,UAAUH,UACjCzU,EAAkBnS,EAAK+mB,UAAUP,WACjC7M,EAAkB3Z,EAAK+mB,UAAUN,WACjCE,EAAkB3mB,EAAK+mB,UAAUJ,WAMjCwD,EAAW,EAEf,IAAK1mB,EAAO,EAAGA,GArNG,GAqNeA,IAC/BpC,EAAE0mB,SAAStkB,GAAQ,EAQrB,IAFAikB,EAA0B,EAArBrmB,EAAE6nB,KAAK7nB,EAAE0oB,UAAgB,GAAa,EAEtCC,EAAI3oB,EAAE0oB,SAAW,EAAGC,EAjOP,IAiOsBA,KAEtCvmB,EAAOikB,EAA+B,EAA1BA,EAAS,GADrB9R,EAAIvU,EAAE6nB,KAAKc,IACc,GAAiB,GAAa,GAC5CrD,IACTljB,EAAOkjB,EACPwD,KAEFzC,EAAS,EAAJ9R,EAAQ,GAAanS,EAGtBmS,EAAIoR,IAER3lB,EAAE0mB,SAAStkB,KACXwmB,EAAQ,EACJrU,GAAK+D,IACPsQ,EAAQ9X,EAAMyD,EAAI+D,IAEpBuQ,EAAIxC,EAAS,EAAJ9R,GACTvU,EAAEmnB,SAAW0B,GAAKzmB,EAAOwmB,GACrBrD,IACFvlB,EAAEonB,YAAcyB,GAAKJ,EAAU,EAAJlU,EAAQ,GAAaqU,KAGpD,GAAiB,IAAbE,EAAJ,CAMA,EAAG,CAED,IADA1mB,EAAOkjB,EAAa,EACQ,IAArBtlB,EAAE0mB,SAAStkB,IAAeA,IACjCpC,EAAE0mB,SAAStkB,KACXpC,EAAE0mB,SAAStkB,EAAO,IAAM,EACxBpC,EAAE0mB,SAASpB,KAIXwD,GAAY,CACd,OAASA,EAAW,GAOpB,IAAK1mB,EAAOkjB,EAAqB,IAATljB,EAAYA,IAElC,IADAmS,EAAIvU,EAAE0mB,SAAStkB,GACF,IAANmS,IACL9U,EAAIO,EAAE6nB,OAAOc,IACLhD,IACJU,EAAS,EAAJ5mB,EAAQ,KAAe2C,IAE9BpC,EAAEmnB,UAAY/kB,EAAOikB,EAAS,EAAJ5mB,EAAQ,IAAc4mB,EAAS,EAAJ5mB,GACrD4mB,EAAS,EAAJ5mB,EAAQ,GAAa2C,GAE5BmS,IAjC0B,CAoChC,CAgZEwU,CAAW/oB,EAAGrB,GAGd8nB,EAAUJ,EAAMV,EAAU3lB,EAAE0mB,SAC9B,CAOA,SAASsC,EAAUhpB,EAAGqmB,EAAMV,GAK1B,IAAIpR,EAEA0U,EADAC,GAAW,EAGXC,EAAU9C,EAAK,GAEf7N,EAAQ,EACR4Q,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAEdhD,EAAsB,GAAhBV,EAAW,GAAS,GAAa,MAElCpR,EAAI,EAAGA,GAAKoR,EAAUpR,IACzB0U,EAASE,EACTA,EAAU9C,EAAe,GAAT9R,EAAI,GAAS,KAEvBiE,EAAQ4Q,GAAaH,IAAWE,IAG3B3Q,EAAQ6Q,EACjBrpB,EAAEinB,QAAiB,EAATgC,IAAwBzQ,EAEd,IAAXyQ,GAELA,IAAWC,GAAWlpB,EAAEinB,QAAiB,EAATgC,KACpCjpB,EAAEinB,QAAQqC,OAED9Q,GAAS,GAClBxY,EAAEinB,QAAQsC,MAGVvpB,EAAEinB,QAAQuC,MAGZhR,EAAQ,EACR0Q,EAAUD,EAEM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,CAOA,SAASI,EAAUzpB,EAAGqmB,EAAMV,GAK1B,IAAIpR,EAEA0U,EADAC,GAAW,EAGXC,EAAU9C,EAAK,GAEf7N,EAAQ,EACR4Q,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAGT9U,EAAI,EAAGA,GAAKoR,EAAUpR,IAIzB,GAHA0U,EAASE,EACTA,EAAU9C,EAAe,GAAT9R,EAAI,GAAS,OAEvBiE,EAAQ4Q,GAAaH,IAAWE,GAAtC,CAGO,GAAI3Q,EAAQ6Q,EACjB,GAAKjD,EAAUpmB,EAAGipB,EAAQjpB,EAAEinB,eAA+B,MAAVzO,QAE7B,IAAXyQ,GACLA,IAAWC,IACb9C,EAAUpmB,EAAGipB,EAAQjpB,EAAEinB,SACvBzO,KAGF4N,EAAUpmB,EA1wBE,GA0wBUA,EAAEinB,SACxBhB,EAAUjmB,EAAGwY,EAAQ,EAAG,IAEfA,GAAS,IAClB4N,EAAUpmB,EA3wBE,GA2wBYA,EAAEinB,SAC1BhB,EAAUjmB,EAAGwY,EAAQ,EAAG,KAGxB4N,EAAUpmB,EA5wBE,GA4wBcA,EAAEinB,SAC5BhB,EAAUjmB,EAAGwY,EAAQ,GAAI,IAG3BA,EAAQ,EACR0Q,EAAUD,EACM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,EAdd,CAiBJ,CAnuBApF,EAAKe,GAu1BL,IAAI0E,GAAmB,EA4BvB,SAASC,EAAiB3pB,EAAGwO,EAAKob,EAAY3gB,GAM5Cgd,EAAUjmB,EAAG,GAAuBiJ,EAAO,EAAI,GAAI,GAzfrD,SAAoBjJ,EAAGwO,EAAK8F,GAM1BiT,EAAUvnB,GAGR6lB,EAAU7lB,EAAGsU,GACbuR,EAAU7lB,GAAIsU,GAKhBjF,EAAMgE,SAASrT,EAAE+lB,YAAa/lB,EAAE4Q,OAAQpC,EAAK8F,EAAKtU,EAAEgmB,SACpDhmB,EAAEgmB,SAAW1R,CACf,CAyeEuV,CAAW7pB,EAAGwO,EAAKob,EACrB,CAmKAnsB,EAAQqsB,SAlMR,SAAkB9pB,GAGX0pB,IAxmBP,WACE,IAAInV,EACAnS,EACA9D,EACAioB,EACApT,EACAuT,EAAW,IAAI/hB,MAAMiiB,IAiBzB,IADAtoB,EAAS,EACJioB,EAAO,EAAGA,EAAOwD,GAAkBxD,IAEtC,IADA3B,EAAY2B,GAAQjoB,EACfiW,EAAI,EAAGA,EAAK,GAAK2P,EAAYqC,GAAQhS,IACxCmQ,EAAapmB,KAAYioB,EAY7B,IAJA7B,EAAapmB,EAAS,GAAKioB,EAG3BpT,EAAO,EACFoT,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAvB,EAAUuB,GAAQpT,EACboB,EAAI,EAAGA,EAAK,GAAK4P,EAAYoC,GAAQhS,IACxCkQ,EAAWtR,KAAUoT,EAKzB,IADApT,IAAS,EACFoT,EAjYW,GAiYKA,IAErB,IADAvB,EAAUuB,GAAQpT,GAAQ,EACrBoB,EAAI,EAAGA,EAAK,GAAM4P,EAAYoC,GAAQ,EAAKhS,IAC9CkQ,EAAW,IAAMtR,KAAUoT,EAM/B,IAAKnkB,EAAO,EAAGA,GAjYG,GAiYeA,IAC/BskB,EAAStkB,GAAQ,EAInB,IADAmS,EAAI,EACGA,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KAEX,KAAOnS,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KAEX,KAAOnS,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KAEX,KAAOnS,GAAK,KACV+P,EAAiB,EAAJ/P,EAAQ,GAAa,EAClCA,IACAmS,EAAS,KASX,IAHAD,EAAUnC,EAAc0F,IAAatD,GAGhCnS,EAAI,EAAGA,EA1aM,GA0aOA,IACvBgQ,EAAiB,EAAJhQ,EAAQ,GAAa,EAClCgQ,EAAiB,EAAJhQ,GAAkB+R,EAAW/R,EAAG,GAI/CsQ,EAAgB,IAAII,EAAeX,EAAcJ,EAAa4C,IAnb5CA,IAYA,IAwalBhC,EAAgB,IAAIG,EAAeV,EAAcJ,EAAa,EAjb5C,GASA,IAyalBY,EAAiB,IAAIE,EAAe,IAAItgB,MAAM,GAAIyf,EAAc,EA/a9C,GAiBF,EAialB,CAugBI6F,GACAP,GAAmB,GAGrB1pB,EAAEkqB,OAAU,IAAI1E,EAASxlB,EAAE+mB,UAAWlC,GACtC7kB,EAAEmqB,OAAU,IAAI3E,EAASxlB,EAAEgnB,UAAWlC,GACtC9kB,EAAEoqB,QAAU,IAAI5E,EAASxlB,EAAEinB,QAASlC,GAEpC/kB,EAAEmmB,OAAS,EACXnmB,EAAEkmB,SAAW,EAGbW,EAAW7mB,EACb,EAkLAvC,EAAQksB,iBAAmBA,EAC3BlsB,EAAQ4sB,gBAnJR,SAAyBrqB,EAAGwO,EAAKob,EAAY3gB,GAM3C,IAAIqhB,EAAUC,EACVC,EAAc,EAGdxqB,EAAEmiB,MAAQ,GAnhCY,IAshCpBniB,EAAEiS,KAAKuD,YACTxV,EAAEiS,KAAKuD,UArGb,SAA0BxV,GAKxB,IACIuU,EADAkW,EAAa,WAIjB,IAAKlW,EAAI,EAAGA,GAAK,GAAIA,IAAKkW,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhCzqB,EAAE+mB,UAAc,EAAJxS,GACnC,OAh8BsB,EAq8B1B,GAAoC,IAAhCvU,EAAE+mB,UAAU,KAA0D,IAAjC/mB,EAAE+mB,UAAU,KAChB,IAAjC/mB,EAAE+mB,UAAU,IACd,OAt8BwB,EAw8B1B,IAAKxS,EAAI,GAAIA,EA56BK,IA46BSA,IACzB,GAAoC,IAAhCvU,EAAE+mB,UAAc,EAAJxS,GACd,OA18BsB,EAi9B1B,OAl9B0B,CAm9B5B,CAuEyBmW,CAAiB1qB,IAItCuoB,EAAWvoB,EAAGA,EAAEkqB,QAIhB3B,EAAWvoB,EAAGA,EAAEmqB,QAUhBK,EAnMJ,SAAuBxqB,GACrB,IAAIwqB,EAgBJ,IAbAxB,EAAUhpB,EAAGA,EAAE+mB,UAAW/mB,EAAEkqB,OAAOvE,UACnCqD,EAAUhpB,EAAGA,EAAEgnB,UAAWhnB,EAAEmqB,OAAOxE,UAGnC4C,EAAWvoB,EAAGA,EAAEoqB,SASXI,EAAcG,GAAcH,GAAe,GACW,IAArDxqB,EAAEinB,QAAgC,EAAxB5C,EAASmG,GAAmB,GADOA,KAUnD,OAJAxqB,EAAEmnB,SAAW,GAAKqD,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,CAuKkBI,CAAc5qB,GAG5BsqB,EAAYtqB,EAAEmnB,QAAU,EAAI,IAAO,GACnCoD,EAAevqB,EAAEonB,WAAa,EAAI,IAAO,IAMtBkD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcX,EAAa,EAGnCA,EAAa,GAAKU,IAAuB,IAAT9b,EASnCmb,EAAiB3pB,EAAGwO,EAAKob,EAAY3gB,GA1kCb,IA4kCfjJ,EAAEuiB,UAAwBgI,IAAgBD,GAEnDrE,EAAUjmB,EAAG,GAAuBiJ,EAAO,EAAI,GAAI,GACnD+e,EAAehoB,EAAGskB,EAAcC,KAGhC0B,EAAUjmB,EAAG,GAAoBiJ,EAAO,EAAI,GAAI,GAjMpD,SAAwBjJ,EAAG6qB,EAAQC,EAAQC,GAIzC,IAAIC,EASJ,IAHA/E,EAAUjmB,EAAG6qB,EAAS,IAAK,GAC3B5E,EAAUjmB,EAAG8qB,EAAS,EAAK,GAC3B7E,EAAUjmB,EAAG+qB,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B/E,EAAUjmB,EAAGA,EAAEinB,QAAyB,EAAjB5C,EAAS2G,GAAY,GAAY,GAI1DvB,EAAUzpB,EAAGA,EAAE+mB,UAAW8D,EAAS,GAGnCpB,EAAUzpB,EAAGA,EAAEgnB,UAAW8D,EAAS,EAErC,CA0KIG,CAAejrB,EAAGA,EAAEkqB,OAAOvE,SAAW,EAAG3lB,EAAEmqB,OAAOxE,SAAW,EAAG6E,EAAc,GAC9ExC,EAAehoB,EAAGA,EAAE+mB,UAAW/mB,EAAEgnB,YAMnCH,EAAW7mB,GAEPiJ,GACFse,EAAUvnB,EAId,EAmEAvC,EAAQytB,UA7DR,SAAmBlrB,EAAGmT,EAAMgV,GAmD1B,OA5CAnoB,EAAE+lB,YAAY/lB,EAAEqoB,MAAqB,EAAbroB,EAAEqnB,UAAqBlU,IAAS,EAAK,IAC7DnT,EAAE+lB,YAAY/lB,EAAEqoB,MAAqB,EAAbroB,EAAEqnB,SAAe,GAAY,IAAPlU,EAE9CnT,EAAE+lB,YAAY/lB,EAAEsoB,MAAQtoB,EAAEqnB,UAAiB,IAALc,EACtCnoB,EAAEqnB,WAEW,IAATlU,EAEFnT,EAAE+mB,UAAe,EAALoB,MAEZnoB,EAAEsnB,UAEFnU,IAKAnT,EAAE+mB,UAA8C,GAAnCrC,EAAayD,GA9lCV,IA8lC2B,MAC3CnoB,EAAEgnB,UAAyB,EAAfpB,EAAOzS,OA0BbnT,EAAEqnB,WAAarnB,EAAEmrB,YAAc,CAKzC,EAMA1tB,EAAQ2tB,UAhKR,SAAmBprB,GACjBimB,EAAUjmB,EAAGqrB,EAAmB,GAChCjF,EAAUpmB,EAz8BM,IAy8BQskB,GA5yB1B,SAAkBtkB,GACG,KAAfA,EAAEkmB,UACJL,EAAU7lB,EAAGA,EAAEmmB,QACfnmB,EAAEmmB,OAAS,EACXnmB,EAAEkmB,SAAW,GAEJlmB,EAAEkmB,UAAY,IACvBlmB,EAAE+lB,YAAY/lB,EAAEgmB,WAAwB,IAAXhmB,EAAEmmB,OAC/BnmB,EAAEmmB,SAAW,EACbnmB,EAAEkmB,UAAY,EAElB,CAkyBEoF,CAAStrB,EACX,C,8BC9hCA,IAAIurB,EAAW,EAAQ,MACnBxqB,EAAO,EAAQ,KACfF,EAAS,eAET2qB,EAAI,CACP,WAAY,YAAY,YAAgB,WAGrCC,EAAI,IAAI9mB,MAAM,IAElB,SAAS+mB,IACRxqB,KAAKyqB,OACLzqB,KAAK0qB,GAAKH,EAEV1qB,EAAK9B,KAAKiC,KAAM,GAAI,GACrB,CAcA,SAAS2qB,EAAMC,GACd,OAAQA,GAAO,EAAMA,IAAQ,EAC9B,CAEA,SAASC,EAAMD,GACd,OAAQA,GAAO,EAAMA,IAAQ,EAC9B,CAEA,SAASE,EAAOF,GACf,OAAQA,GAAO,GAAOA,IAAQ,CAC/B,CAEA,SAASG,EAAGjsB,EAAGksB,EAAG5rB,EAAGP,GACpB,OAAU,IAANC,EACKksB,EAAI5rB,GAAO4rB,EAAInsB,EAEd,IAANC,EACKksB,EAAI5rB,EAAM4rB,EAAInsB,EAAMO,EAAIP,EAE1BmsB,EAAI5rB,EAAIP,CAChB,CAhCAwrB,EAASG,EAAM3qB,GAEf2qB,EAAK1sB,UAAU2sB,KAAO,WAOrB,OANAzqB,KAAKirB,GAAK,WACVjrB,KAAKkrB,GAAK,WACVlrB,KAAKmrB,GAAK,WACVnrB,KAAKorB,GAAK,UACVprB,KAAKqrB,GAAK,WAEHrrB,IACR,EAwBAwqB,EAAK1sB,UAAUgD,QAAU,SAAUwqB,GASlC,IARA,IAAI1G,EAAI5kB,KAAK0qB,GAETa,EAAc,EAAVvrB,KAAKirB,GACTD,EAAc,EAAVhrB,KAAKkrB,GACT9rB,EAAc,EAAVY,KAAKmrB,GACTtsB,EAAc,EAAVmB,KAAKorB,GACT9sB,EAAc,EAAV0B,KAAKqrB,GAEJzsB,EAAI,EAAGA,EAAI,KAAMA,EACzBgmB,EAAEhmB,GAAK0sB,EAAEE,YAAgB,EAAJ5sB,GAEtB,KAAOA,EAAI,KAAMA,EAChBgmB,EAAEhmB,GAAK+rB,EAAM/F,EAAEhmB,EAAI,GAAKgmB,EAAEhmB,EAAI,GAAKgmB,EAAEhmB,EAAI,IAAMgmB,EAAEhmB,EAAI,KAGtD,IAAK,IAAIgoB,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC5B,IAAI9nB,KAAO8nB,EAAI,IACX6E,EAAKZ,EAAMU,GAAKR,EAAGjsB,EAAGksB,EAAG5rB,EAAGP,GAAKP,EAAIsmB,EAAEgC,GAAK0D,EAAExrB,GAAM,EAExDR,EAAIO,EACJA,EAAIO,EACJA,EAAI0rB,EAAOE,GACXA,EAAIO,EACJA,EAAIE,CACL,CAEAzrB,KAAKirB,GAAMM,EAAIvrB,KAAKirB,GAAM,EAC1BjrB,KAAKkrB,GAAMF,EAAIhrB,KAAKkrB,GAAM,EAC1BlrB,KAAKmrB,GAAM/rB,EAAIY,KAAKmrB,GAAM,EAC1BnrB,KAAKorB,GAAMvsB,EAAImB,KAAKorB,GAAM,EAC1BprB,KAAKqrB,GAAM/sB,EAAI0B,KAAKqrB,GAAM,CAC3B,EAEAb,EAAK1sB,UAAUyD,MAAQ,WACtB,IAAImqB,EAAI/rB,EAAOsN,YAAY,IAQ3B,OANAye,EAAEC,aAAuB,EAAV3rB,KAAKirB,GAAQ,GAC5BS,EAAEC,aAAuB,EAAV3rB,KAAKkrB,GAAQ,GAC5BQ,EAAEC,aAAuB,EAAV3rB,KAAKmrB,GAAQ,GAC5BO,EAAEC,aAAuB,EAAV3rB,KAAKorB,GAAQ,IAC5BM,EAAEC,aAAuB,EAAV3rB,KAAKqrB,GAAQ,IAErBK,CACR,EAEAlvB,EAAOD,QAAUiuB,C,8BC1GjB,IAAIoB,EAA+B,oBAAXjoB,QAA0BA,OAC9CkoB,EAAgB,EAAQ,MAG5BrvB,EAAOD,QAAU,WAChB,MAA0B,mBAAfqvB,GACW,mBAAXjoB,QACsB,iBAAtBioB,EAAW,QACO,iBAAlBjoB,OAAO,QAEXkoB,GACR,C,8BCXA,IAAI/uB,EAAa,EAAQ,MAKrBgvB,EAHY,EAAQ,KAGAC,CAAU,+BAA+B,GAE7DC,EAAe,EAAQ,MAI3BxvB,EAAOD,QAAUuvB,GAAqB,SAA0B/L,GAC/D,IAAKiM,EAAajM,GACjB,MAAM,IAAIjjB,EAAW,qBAEtB,OAAOijB,EAAE9hB,MACV,C,wBC4BAzB,EAAOD,QAzBP,WAEEyD,KAAKuS,MAAQ,KACbvS,KAAK4T,QAAU,EAEf5T,KAAKyT,SAAW,EAEhBzT,KAAKiR,SAAW,EAEhBjR,KAAKwS,OAAS,KACdxS,KAAK0T,SAAW,EAEhB1T,KAAK2T,UAAY,EAEjB3T,KAAKkR,UAAY,EAEjBlR,KAAKmR,IAAM,GAEXnR,KAAKgR,MAAQ,KAEbhR,KAAKsU,UAAY,EAEjBtU,KAAKoR,MAAQ,CACf,C,wBCzCA5U,EAAOD,QAAU4I,OAAO5F,OAAS,SAAegsB,GAC/C,OAAOA,GAAMA,CACd,C,WCLA,IAAI/pB,EAAW,CAAC,EAAEA,SAElBhF,EAAOD,QAAUkH,MAAMkH,SAAW,SAAUshB,GAC1C,MAA6B,kBAAtBzqB,EAASzD,KAAKkuB,EACvB,C,wBCiBAzvB,EAAOD,QAAU,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,uB,wBCWV,IAAI2vB,EAfJ,WAGE,IAFA,IAAI9sB,EAAGuX,EAAQ,GAENtD,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BjU,EAAIiU,EACJ,IAAK,IAAIgN,EAAI,EAAGA,EAAI,EAAGA,IACrBjhB,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnDuX,EAAMtD,GAAKjU,CACb,CAEA,OAAOuX,CACT,CAGewV,GAiBf3vB,EAAOD,QAdP,SAAe6vB,EAAK9e,EAAK8F,EAAK+C,GAC5B,IAAIsV,EAAIS,EACJna,EAAMoE,EAAM/C,EAEhBgZ,IAAQ,EAER,IAAK,IAAIxtB,EAAIuX,EAAKvX,EAAImT,EAAKnT,IACzBwtB,EAAOA,IAAQ,EAAKX,EAAmB,KAAhBW,EAAM9e,EAAI1O,KAGnC,OAAgB,EAARwtB,CACV,C,wBCpDA5vB,EAAOD,QAAU8vB,Q,8BCDjB,IAAI1sB,EAAS,cACTgL,EAAU,EAAQ,MAClB2hB,EAAmB,EAAQ,MAE3BC,EAAS7oB,YAAY6oB,QAAU,SAAgBvvB,GAClD,IAEC,OADAsvB,EAAiBtvB,IACV,CACR,CAAE,MAAOsB,GACR,OAAO,CACR,CACD,EAEIkuB,EAAsC,oBAAfnpB,WACvBopB,EAAwC,oBAAhB/oB,aACF,oBAAfL,WACPqpB,EAAqBD,IAAmB9sB,EAAO7B,qBAAqBuF,YAAc1D,EAAOgtB,qBAE7FnwB,EAAOD,QAAU,SAAkBgE,EAAM8M,GAKxC,GAAI9M,aAAgBZ,EACnB,OAAOY,EAGR,GAAoB,iBAATA,EACV,OAAOZ,EAAOqN,KAAKzM,EAAM8M,GAO1B,GAAIof,GAAkBF,EAAOhsB,GAAO,CAEnC,GAAwB,IAApBA,EAAKqsB,WACR,OAAOjtB,EAAOO,MAAM,GAIrB,GAAIwsB,EAAoB,CACvB,IAAIpH,EAAM3lB,EAAOqN,KAAKzM,EAAKtC,OAAQsC,EAAKssB,WAAYtsB,EAAKqsB,YAKzD,GAAItH,EAAIsH,aAAersB,EAAKqsB,WAC3B,OAAOtH,CAET,CAGA,IAAIwH,EAAQvsB,aAAgB8C,WAAa9C,EAAO,IAAI8C,WAAW9C,EAAKtC,OAAQsC,EAAKssB,WAAYtsB,EAAKqsB,YAC9F5kB,EAASrI,EAAOqN,KAAK8f,GAMzB,GAAI9kB,EAAO5K,SAAWmD,EAAKqsB,WAC1B,OAAO5kB,CAET,CAMA,GAAIwkB,GAAiBjsB,aAAgB8C,WACpC,OAAO1D,EAAOqN,KAAKzM,GAGpB,IAAIwsB,EAAQpiB,EAAQpK,GACpB,GAAIwsB,EACH,IAAK,IAAInuB,EAAI,EAAGA,EAAI2B,EAAKnD,OAAQwB,GAAK,EAAG,CACxC,IAAImhB,EAAIxf,EAAK3B,GACb,GACc,iBAANmhB,GACJA,EAAI,GACJA,EAAI,OACFA,IAAMA,EAEX,MAAM,IAAIvF,WAAW,kDAEvB,CAQD,GACCuS,GACCptB,EAAOqtB,SAASzsB,IACZA,EAAKoZ,aACgC,mBAA9BpZ,EAAKoZ,YAAYqT,UACxBzsB,EAAKoZ,YAAYqT,SAASzsB,GAG/B,OAAOZ,EAAOqN,KAAKzM,GAGpB,MAAM,IAAI4M,UAAU,yFACrB,C,8BC1GA,IAAI8f,EAAkB,EAAQ,MAG9BzwB,EAAOD,QAAU,SAAsBW,GACtC,QAAS+vB,EAAgB/vB,EAC1B,C,8BCLA,IAAIif,EAAU,EAAQ,MAClB+Q,EAAuB,EAAQ,MAC/BC,EAAW,EAAQ,KACnBpB,EAAY,EAAQ,MACpBqB,EAAO,EAAQ,MACftqB,EAAW,EAAQ,MAEnBuqB,EAAYtB,EAAU,6BACtBuB,EAAiB,EAAQ,KAAR,GAEjBC,EAA0B,oBAAfC,WAA6B,EAAAD,EAASC,WACjDC,EAAcP,IAEdQ,EAAS3B,EAAU,0BAGnB4B,EAAW5B,EAAU,2BAA2B,IAAS,SAAiB/L,EAAO9iB,GACpF,IAAK,IAAI0B,EAAI,EAAGA,EAAIohB,EAAM5iB,OAAQwB,GAAK,EACtC,GAAIohB,EAAMphB,KAAO1B,EAChB,OAAO0B,EAGT,OAAQ,CACT,EAII8d,EAAQ,CAAEnZ,UAAW,MAExB4Y,EAAQsR,EADLH,GAAkBF,GAAQtqB,EACR,SAAU8qB,GAC9B,IAAI3B,EAAM,IAAIsB,EAAEK,GAChB,GAAIjqB,OAAOkqB,eAAe5B,GAAOnpB,EAAU,CAC1C,IAAIgrB,EAAQhrB,EAASmpB,GAEjB/d,EAAakf,EAAKU,EAAOnqB,OAAOkqB,aACpC,IAAK3f,GAAc4f,EAAO,CACzB,IAAIC,EAAajrB,EAASgrB,GAE1B5f,EAAakf,EAAKW,EAAYpqB,OAAOkqB,YACtC,CAEAnR,EAAM,IAAMkR,GAAcT,EAASjf,EAAWvL,IAC/C,CACD,EAEqB,SAAUirB,GAC9B,IAAI3B,EAAM,IAAIsB,EAAEK,GACZrnB,EAAK0lB,EAAI9kB,OAAS8kB,EAAI+B,IACtBznB,IACHmW,EACkD,IAAMkR,GAGvDT,EAAS5mB,GAGZ,GA0CD/J,EAAOD,QAAU,SAAyBW,GACzC,IAAKA,GAA0B,iBAAVA,EAAsB,OAAO,EAClD,IAAKowB,EAAgB,CAEpB,IAAIW,EAAMP,EAAOL,EAAUnwB,GAAQ,GAAI,GACvC,OAAIywB,EAASF,EAAaQ,IAAQ,EAC1BA,EAEI,WAARA,GA1BU,SAAsB/wB,GACU,IAAIgxB,GAAQ,EAa3D,OAZA/R,EACiE,EACiB,SAAUgS,EAAQ7nB,GAClG,IAAK4nB,EACJ,IAECC,EAAOjxB,GACPgxB,EAAmDR,EAAOpnB,EAAM,EACjE,CAAE,MAAOhI,GAAU,CAErB,GAEM4vB,CACR,CAeSE,CAAUlxB,EAClB,CACA,OAAKkwB,EApDe,SAA2BlwB,GACK,IAAIgxB,GAAQ,EAehE,OAdA/R,EACkE,EAEjE,SAAUgS,EAAQP,GACjB,IAAKM,EACJ,IAEK,IAAMC,EAAOjxB,KAAW0wB,IAC3BM,EAAmDR,EAAOE,EAAY,GAExE,CAAE,MAAOtvB,GAAU,CAErB,GAEM4vB,CACR,CAoCQG,CAAenxB,GADF,IAErB,C,8BCjHA,IAAIqF,EAAQ,EAAQ,MAEpB,GAAIA,EACH,IACCA,EAAM,GAAI,SACX,CAAE,MAAOjE,GAERiE,EAAQ,IACT,CAGD/F,EAAOD,QAAUgG,C,wBCXjB/F,EAAOD,QAAU0C,KAAKC,G,wBCAtB1C,EAAOD,QAAU0C,KAAKiD,G,wBCAtB1F,EAAOD,QAAU8M,OAAO4E,wB,8BCDxB,IAAIqgB,EAAe,EAAQ,KAEvBzlB,EAAgB,EAAQ,MAGxB8kB,EAAW9kB,EAAc,CAACylB,EAAa,gCAG3C9xB,EAAOD,QAAU,SAA4B+J,EAAMmB,GAGlD,IAAIc,EAA2E+lB,EAAahoB,IAAQmB,GACpG,MAAyB,mBAAdc,GAA4BolB,EAASrnB,EAAM,gBAAkB,EAChEuC,EAAmC,CAAEN,IAEtCA,CACR,C,wBCfA/L,EAAOD,QAAU,CAChB,eACA,eACA,eACA,YACA,aACA,aACA,aACA,oBACA,cACA,cACA,gBACA,iB,WCf4B,mBAAlB8M,OAAOK,OAEhBlN,EAAOD,QAAU,SAAkBgyB,EAAMC,GACnCA,IACFD,EAAKE,OAASD,EACdD,EAAKzwB,UAAYuL,OAAOK,OAAO8kB,EAAU1wB,UAAW,CAClD6b,YAAa,CACXzc,MAAOqxB,EACP5wB,YAAY,EACZC,UAAU,EACVF,cAAc,KAItB,EAGAlB,EAAOD,QAAU,SAAkBgyB,EAAMC,GACvC,GAAIA,EAAW,CACbD,EAAKE,OAASD,EACd,IAAIE,EAAW,WAAa,EAC5BA,EAAS5wB,UAAY0wB,EAAU1wB,UAC/BywB,EAAKzwB,UAAY,IAAI4wB,EACrBH,EAAKzwB,UAAU6b,YAAc4U,CAC/B,CACF,C,8BCvBF,IAAII,EAAiB,EAAQ,MAE7BnyB,EAAOD,QAAUsB,SAASC,UAAU4I,MAAQioB,C,8BCF5C,IAAIL,EAAe,EAAQ,KACvB7xB,EAAS,EAAQ,IACjBmyB,EAAiB,EAAQ,IAAR,GACjBxB,EAAO,EAAQ,MAEftwB,EAAa,EAAQ,MACrB+xB,EAASP,EAAa,gBAG1B9xB,EAAOD,QAAU,SAA2BgK,EAAInJ,GAC/C,GAAkB,mBAAPmJ,EACV,MAAM,IAAIzJ,EAAW,0BAEtB,GAAsB,iBAAXM,GAAuBA,EAAS,GAAKA,EAAS,YAAcyxB,EAAOzxB,KAAYA,EACzF,MAAM,IAAIN,EAAW,8CAGtB,IAAIU,EAAQL,UAAUC,OAAS,KAAOD,UAAU,GAE5C2xB,GAA+B,EAC/BC,GAA2B,EAC/B,GAAI,WAAYxoB,GAAM6mB,EAAM,CAC3B,IAAI3vB,EAAO2vB,EAAK7mB,EAAI,UAChB9I,IAASA,EAAKC,eACjBoxB,GAA+B,GAE5BrxB,IAASA,EAAKG,WACjBmxB,GAA2B,EAE7B,CASA,OAPID,GAAgCC,IAA6BvxB,KAC5DoxB,EACHnyB,EAA4C,EAAM,SAAUW,GAAQ,GAAM,GAE1EX,EAA4C,EAAM,SAAUW,IAGvDmJ,CACR,C,8BCtCA,IAAIyoB,EAAe,EAAQ,MACvB7gB,EAAe,EAAQ,MACvB2S,EAAe,EAAQ,MACvB1hB,EAAe,EAAQ,MACvB+R,EAAe,EAAQ,MACvB4P,EAAe,EAAQ,MACvBkO,EAAe,EAAQ,MAEvBztB,EAAW6H,OAAOvL,UAAU0D,SAiFhC,SAAS0tB,EAAQ9R,GACf,KAAMpd,gBAAgBkvB,GAAU,OAAO,IAAIA,EAAQ9R,GAEnDpd,KAAKod,QAAUjP,EAAM2G,OAAO,CAC1BqM,UAAW,MACX3P,WAAY,EACZ8H,GAAI,IACH8D,GAAW,CAAC,GAEf,IAAIkE,EAAMthB,KAAKod,QAIXkE,EAAIC,KAAQD,EAAI9P,YAAc,GAAO8P,EAAI9P,WAAa,KACxD8P,EAAI9P,YAAc8P,EAAI9P,WACC,IAAnB8P,EAAI9P,aAAoB8P,EAAI9P,YAAc,OAI3C8P,EAAI9P,YAAc,GAAO8P,EAAI9P,WAAa,KACzC4L,GAAWA,EAAQ5L,aACvB8P,EAAI9P,YAAc,IAKf8P,EAAI9P,WAAa,IAAQ8P,EAAI9P,WAAa,KAGvB,GAAjB8P,EAAI9P,aACP8P,EAAI9P,YAAc,KAItBxR,KAAKwL,IAAS,EACdxL,KAAKmR,IAAS,GACdnR,KAAKyhB,OAAS,EACdzhB,KAAK0hB,OAAS,GAEd1hB,KAAK+Q,KAAS,IAAIgQ,EAClB/gB,KAAK+Q,KAAK4C,UAAY,EAEtB,IAAIgO,EAAUqN,EAAavd,aACzBzR,KAAK+Q,KACLuQ,EAAI9P,YAGN,GAAImQ,IAAWviB,EAAE+vB,KACf,MAAM,IAAI1tB,MAAM0P,EAAIwQ,IAQtB,GALA3hB,KAAK6hB,OAAS,IAAIoN,EAElBD,EAAaxa,iBAAiBxU,KAAK+Q,KAAM/Q,KAAK6hB,QAG1CP,EAAI5M,aAEwB,iBAAnB4M,EAAI5M,WACb4M,EAAI5M,WAAaoM,EAAQxL,WAAWgM,EAAI5M,YACG,yBAAlClT,EAASzD,KAAKujB,EAAI5M,cAC3B4M,EAAI5M,WAAa,IAAIrR,WAAWie,EAAI5M,aAElC4M,EAAIC,MACNI,EAASqN,EAAava,qBAAqBzU,KAAK+Q,KAAMuQ,EAAI5M,eAC3CtV,EAAE+vB,MACf,MAAM,IAAI1tB,MAAM0P,EAAIwQ,GAI5B,CA4NA,SAAStP,EAAQE,EAAO6K,GACtB,IAAIgS,EAAW,IAAIF,EAAQ9R,GAK3B,GAHAgS,EAASjjB,KAAKoG,GAAO,GAGjB6c,EAAS5jB,IAAO,MAAM4jB,EAASje,KAAOA,EAAIie,EAAS5jB,KAEvD,OAAO4jB,EAASpnB,MAClB,CAvMAknB,EAAQpxB,UAAUqO,KAAO,SAAU5L,EAAMuO,GACvC,IAGI6S,EAAQS,EACRiN,EAAeC,EAAMC,EAJrBxe,EAAO/Q,KAAK+Q,KACZoQ,EAAYnhB,KAAKod,QAAQ+D,UACzBzM,EAAa1U,KAAKod,QAAQ1I,WAM1B8a,GAAgB,EAEpB,GAAIxvB,KAAKyhB,MAAS,OAAO,EACzBW,EAAStT,MAAWA,EAAQA,GAAkB,IAATA,EAAiB1P,EAAEqwB,SAAWrwB,EAAEswB,WAGjD,iBAATnvB,EAETwQ,EAAKwB,MAAQuO,EAAQjL,cAActV,GACF,yBAAxBiB,EAASzD,KAAKwC,GACvBwQ,EAAKwB,MAAQ,IAAIlP,WAAW9C,GAE5BwQ,EAAKwB,MAAQhS,EAGfwQ,EAAK6C,QAAU,EACf7C,EAAK0C,SAAW1C,EAAKwB,MAAMnV,OAE3B,EAAG,CAkBD,GAjBuB,IAAnB2T,EAAK4C,YACP5C,EAAKyB,OAAS,IAAIrE,EAAM+D,KAAKiP,GAC7BpQ,EAAK2C,SAAW,EAChB3C,EAAK4C,UAAYwN,IAGnBQ,EAASqN,EAAa3c,QAAQtB,EAAM3R,EAAEswB,eAEvBtwB,EAAEuwB,aAAejb,IAC9BiN,EAASqN,EAAava,qBAAqBzU,KAAK+Q,KAAM2D,IAGpDiN,IAAWviB,EAAEwwB,cAAiC,IAAlBJ,IAC9B7N,EAASviB,EAAE+vB,KACXK,GAAgB,GAGd7N,IAAWviB,EAAEywB,cAAgBlO,IAAWviB,EAAE+vB,KAG5C,OAFAnvB,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,GACN,EAGL1Q,EAAK2C,WACgB,IAAnB3C,EAAK4C,WAAmBgO,IAAWviB,EAAEywB,eAAmC,IAAlB9e,EAAK0C,UAAmB2O,IAAUhjB,EAAEqwB,UAAYrN,IAAUhjB,EAAE0wB,gBAE5F,WAApB9vB,KAAKod,QAAQ9D,IAEf+V,EAAgBvO,EAAQ5K,WAAWnF,EAAKyB,OAAQzB,EAAK2C,UAErD4b,EAAOve,EAAK2C,SAAW2b,EACvBE,EAAUzO,EAAQhL,WAAW/E,EAAKyB,OAAQ6c,GAG1Cte,EAAK2C,SAAW4b,EAChBve,EAAK4C,UAAYwN,EAAYmO,EACzBA,GAAQnhB,EAAMgE,SAASpB,EAAKyB,OAAQzB,EAAKyB,OAAQ6c,EAAeC,EAAM,GAE1EtvB,KAAKsiB,OAAOiN,IAGZvvB,KAAKsiB,OAAOnU,EAAMkH,UAAUtE,EAAKyB,OAAQzB,EAAK2C,aAY9B,IAAlB3C,EAAK0C,UAAqC,IAAnB1C,EAAK4C,YAC9B6b,GAAgB,EAGpB,QAAUze,EAAK0C,SAAW,GAAwB,IAAnB1C,EAAK4C,YAAoBgO,IAAWviB,EAAEywB,cAOrE,OALIlO,IAAWviB,EAAEywB,eACfzN,EAAQhjB,EAAEqwB,UAIRrN,IAAUhjB,EAAEqwB,UACd9N,EAASqN,EAAaza,WAAWvU,KAAK+Q,MACtC/Q,KAAKqiB,MAAMV,GACX3hB,KAAKyhB,OAAQ,EACNE,IAAWviB,EAAE+vB,MAIlB/M,IAAUhjB,EAAE0wB,eACd9vB,KAAKqiB,MAAMjjB,EAAE+vB,MACbpe,EAAK4C,UAAY,GACV,EAIX,EAYAub,EAAQpxB,UAAUwkB,OAAS,SAAUE,GACnCxiB,KAAK0hB,OAAOvV,KAAKqW,EACnB,EAaA0M,EAAQpxB,UAAUukB,MAAQ,SAAUV,GAE9BA,IAAWviB,EAAE+vB,OACS,WAApBnvB,KAAKod,QAAQ9D,GAGftZ,KAAKgI,OAAShI,KAAK0hB,OAAO3E,KAAK,IAE/B/c,KAAKgI,OAASmG,EAAMsU,cAAcziB,KAAK0hB,SAG3C1hB,KAAK0hB,OAAS,GACd1hB,KAAKwL,IAAMmW,EACX3hB,KAAKmR,IAAMnR,KAAK+Q,KAAKI,GACvB,EA+EA5U,EAAQ2yB,QAAUA,EAClB3yB,EAAQ8V,QAAUA,EAClB9V,EAAQwzB,WAnBR,SAAoBxd,EAAO6K,GAGzB,OAFAA,EAAUA,GAAW,CAAC,GACdmE,KAAM,EACPlP,EAAQE,EAAO6K,EACxB,EAgBA7gB,EAAQyzB,OAAU3d,C,wBCnalB7V,EAAOD,QAA6B,oBAAZiJ,SAA2BA,SAAWA,QAAQ0D,K,8BCDtE,IAGI+mB,EAHA9C,EAAW,EAAQ,MACnBC,EAAO,EAAQ,MAGnB,IAEC6C,EAAyE,GAAK1sB,YAAcE,MAAM3F,SACnG,CAAE,MAAOQ,GACR,IAAKA,GAAkB,iBAANA,KAAoB,SAAUA,IAAiB,qBAAXA,EAAE+mB,KACtD,MAAM/mB,CAER,CAGA,IAAIb,IAASwyB,GAAoB7C,GAAQA,EAAK/jB,OAAOvL,UAAwD,aAEzG8D,EAAUyH,OACV6mB,EAAkBtuB,EAAQ4L,eAG9BhR,EAAOD,QAAUkB,GAA4B,mBAAbA,EAAKkF,IAClCwqB,EAAS,CAAC1vB,EAAKkF,MACY,mBAApButB,GACyB,SAAmBhzB,GAEnD,OAAOgzB,EAAyB,MAAThzB,EAAgBA,EAAQ0E,EAAQ1E,GACxD,C,wBCgCFV,EAAOD,QAAU,SAAsBwU,EAAMof,GAC3C,IAAInf,EACA2B,EACA5K,EACA6K,EACAwd,EACAre,EAEA7C,EAEAK,EACAC,EACAC,EAEA4gB,EACA1gB,EACAzO,EACAovB,EACAC,EACAC,EACAC,EACAnd,EACAod,EAEAtd,EACAnB,EACAjF,EACA6F,EAGAN,EAAOC,EAGXxB,EAAQD,EAAKC,MAEb2B,EAAM5B,EAAK6C,QACXrB,EAAQxB,EAAKwB,MACbxK,EAAO4K,GAAO5B,EAAK0C,SAAW,GAC9Bb,EAAO7B,EAAK2C,SACZlB,EAASzB,EAAKyB,OACd4d,EAAMxd,GAAQud,EAAQpf,EAAK4C,WAC3B5B,EAAMa,GAAQ7B,EAAK4C,UAAY,KAE/BzE,EAAO8B,EAAM9B,KAEbK,EAAQyB,EAAMzB,MACdC,EAAQwB,EAAMxB,MACdC,EAAQuB,EAAMvB,MACd4gB,EAAWrf,EAAMtB,OACjBC,EAAOqB,EAAMrB,KACbzO,EAAO8P,EAAM9P,KACbovB,EAAQtf,EAAMnB,QACd0gB,EAAQvf,EAAMlB,SACd0gB,GAAS,GAAKxf,EAAMjB,SAAW,EAC/B0gB,GAAS,GAAKzf,EAAMhB,UAAY,EAMhC2gB,EACA,EAAG,CACGzvB,EAAO,KACTyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,EACRyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,GAGVoS,EAAOgd,EAAM3gB,EAAO6gB,GAEpBI,EACA,OAAS,CAKP,GAHAjhB,KADA+gB,EAAKpd,IAAS,GAEdpS,GAAQwvB,EAEG,IADXA,EAAMpd,IAAS,GAAM,KAKnBd,EAAOI,KAAiB,MAAPU,MAEd,MAAS,GAALod,GAwKJ,IAAU,GAALA,EAIL,IAAS,GAALA,EAAS,CAEhB1f,EAAMlC,KAtSH,GAuSH,MAAM6hB,CACR,CAEE5f,EAAKI,IAAM,8BACXH,EAAMlC,KA5SJ,GA6SF,MAAM6hB,CACR,CAZErd,EAAOgd,GAAc,MAAPhd,IAA8B3D,GAAS,GAAK+gB,GAAM,IAChE,SAASE,CAWX,CA/JE,IArBAxd,EAAa,MAAPE,GACNod,GAAM,MAEAxvB,EAAOwvB,IACT/gB,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,GAEVkS,GAAOzD,GAAS,GAAK+gB,GAAM,EAC3B/gB,KAAU+gB,EACVxvB,GAAQwvB,GAGNxvB,EAAO,KACTyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,EACRyO,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,GAEVoS,EAAOid,EAAM5gB,EAAO8gB,KAGX,CAMP,GAJA9gB,KADA+gB,EAAKpd,IAAS,GAEdpS,GAAQwvB,EAGC,IAFTA,EAAMpd,IAAS,GAAM,KAErB,CAaE,GAZArB,EAAc,MAAPqB,EAEHpS,GADJwvB,GAAM,MAEJ/gB,GAAQ4C,EAAMI,MAAUzR,GACxBA,GAAQ,GACGwvB,IACT/gB,GAAQ4C,EAAMI,MAAUzR,EACxBA,GAAQ,KAGZ+Q,GAAQtC,GAAS,GAAK+gB,GAAM,GAEjBxhB,EAAM,CACf6B,EAAKI,IAAM,gCACXH,EAAMlC,KApKV,GAqKI,MAAM6hB,CACR,CAMA,GAJAhhB,KAAU+gB,EACVxvB,GAAQwvB,EAGJze,GADJye,EAAK9d,EAAOwd,GACG,CAEb,IADAM,EAAKze,EAAOye,GACHlhB,GACHwB,EAAML,KAAM,CACdI,EAAKI,IAAM,gCACXH,EAAMlC,KAjLd,GAkLQ,MAAM6hB,CACR,CA0BF,GAFA3jB,EAAO,EACP6F,EAAcwd,EACA,IAAV5gB,GAEF,GADAzC,GAAQuC,EAAQmhB,EACZA,EAAKtd,EAAK,CACZA,GAAOsd,EACP,GACEle,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GACX1jB,EAAO4F,EAAOX,EACdY,EAAcL,CAChB,OAEG,GAAI/C,EAAQihB,GAGf,GAFA1jB,GAAQuC,EAAQE,EAAQihB,GACxBA,GAAMjhB,GACG2D,EAAK,CACZA,GAAOsd,EACP,GACEle,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GAEX,GADA1jB,EAAO,EACHyC,EAAQ2D,EAAK,CAEfA,GADAsd,EAAKjhB,EAEL,GACE+C,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GACX1jB,EAAO4F,EAAOX,EACdY,EAAcL,CAChB,CACF,OAIA,GADAxF,GAAQyC,EAAQihB,EACZA,EAAKtd,EAAK,CACZA,GAAOsd,EACP,GACEle,EAAOI,KAAUyd,EAASrjB,aACjB0jB,GACX1jB,EAAO4F,EAAOX,EACdY,EAAcL,CAChB,CAEF,KAAOY,EAAM,GACXZ,EAAOI,KAAUC,EAAY7F,KAC7BwF,EAAOI,KAAUC,EAAY7F,KAC7BwF,EAAOI,KAAUC,EAAY7F,KAC7BoG,GAAO,EAELA,IACFZ,EAAOI,KAAUC,EAAY7F,KACzBoG,EAAM,IACRZ,EAAOI,KAAUC,EAAY7F,MAGnC,KACK,CACHA,EAAO4F,EAAOX,EACd,GACEO,EAAOI,KAAUJ,EAAOxF,KACxBwF,EAAOI,KAAUJ,EAAOxF,KACxBwF,EAAOI,KAAUJ,EAAOxF,KACxBoG,GAAO,QACAA,EAAM,GACXA,IACFZ,EAAOI,KAAUJ,EAAOxF,KACpBoG,EAAM,IACRZ,EAAOI,KAAUJ,EAAOxF,MAG9B,CAYF,KAFA,CARK,GAAU,GAAL0jB,EAIL,CACH3f,EAAKI,IAAM,wBACXH,EAAMlC,KA1RR,GA2RE,MAAM6hB,CACR,CAPErd,EAAOid,GAAc,MAAPjd,IAA8B3D,GAAS,GAAK+gB,GAAM,GAUpE,CAeF,CAEA,KACF,CACF,OAAS/d,EAAM5K,GAAQ6K,EAAOb,GAI9BY,GADAS,EAAMlS,GAAQ,EAGdyO,IAAS,IADTzO,GAAQkS,GAAO,IACO,EAGtBrC,EAAK6C,QAAUjB,EACf5B,EAAK2C,SAAWd,EAChB7B,EAAK0C,SAAYd,EAAM5K,EAAYA,EAAO4K,EAAZ,EAAmB,GAAKA,EAAM5K,GAC5DgJ,EAAK4C,UAAaf,EAAOb,EAAaA,EAAMa,EAAb,IAAqB,KAAOA,EAAOb,GAClEf,EAAMrB,KAAOA,EACbqB,EAAM9P,KAAOA,CAEf,C,wBC/RA1E,EAAOD,QApCP,WAEEyD,KAAK8T,KAAa,EAElB9T,KAAK+T,KAAa,EAElB/T,KAAKgU,OAAa,EAElBhU,KAAKiU,GAAa,EAElBjU,KAAK4P,MAAa,KAElB5P,KAAKkU,UAAa,EAWlBlU,KAAKsG,KAAa,GAIlBtG,KAAKoU,QAAa,GAIlBpU,KAAKqU,KAAa,EAElBrU,KAAKsL,MAAa,CACpB,C,4BCrDA/O,EAAQqwB,WAuCR,SAAqBiE,GACnB,IAAIvgB,EAAOwgB,EAAQD,GACfE,EAAWzgB,EAAK,GAChB0gB,EAAkB1gB,EAAK,GAC3B,OAAuC,GAA9BygB,EAAWC,GAAuB,EAAKA,CAClD,EA3CAz0B,EAAQ00B,YAiDR,SAAsBJ,GACpB,IAAIK,EAcAtyB,EAbA0R,EAAOwgB,EAAQD,GACfE,EAAWzgB,EAAK,GAChB0gB,EAAkB1gB,EAAK,GAEvB2b,EAAM,IAAIkF,EAVhB,SAAsBN,EAAKE,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,CAClD,CAQoBI,CAAYP,EAAKE,EAAUC,IAEzCK,EAAU,EAGVje,EAAM4d,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKnyB,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EACxBsyB,EACGI,EAAUT,EAAIjb,WAAWhX,KAAO,GAChC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,GACpC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACrC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,IAC/BqtB,EAAIoF,KAAcH,GAAO,GAAM,IAC/BjF,EAAIoF,KAAcH,GAAO,EAAK,IAC9BjF,EAAIoF,KAAmB,IAANH,EAmBnB,OAhBwB,IAApBF,IACFE,EACGI,EAAUT,EAAIjb,WAAWhX,KAAO,EAChC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACvCqtB,EAAIoF,KAAmB,IAANH,GAGK,IAApBF,IACFE,EACGI,EAAUT,EAAIjb,WAAWhX,KAAO,GAChC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACpC0yB,EAAUT,EAAIjb,WAAWhX,EAAI,KAAO,EACvCqtB,EAAIoF,KAAcH,GAAO,EAAK,IAC9BjF,EAAIoF,KAAmB,IAANH,GAGZjF,CACT,EA5FA1vB,EAAQg1B,cAkHR,SAAwBzE,GAQtB,IAPA,IAAIoE,EACA9d,EAAM0Z,EAAM1vB,OACZo0B,EAAape,EAAM,EACnBxL,EAAQ,GACR6pB,EAAiB,MAGZ7yB,EAAI,EAAG8yB,EAAOte,EAAMoe,EAAY5yB,EAAI8yB,EAAM9yB,GAAK6yB,EACtD7pB,EAAMuE,KAAKwlB,EAAY7E,EAAOluB,EAAIA,EAAI6yB,EAAkBC,EAAOA,EAAQ9yB,EAAI6yB,IAqB7E,OAjBmB,IAAfD,GACFN,EAAMpE,EAAM1Z,EAAM,GAClBxL,EAAMuE,KACJylB,EAAOV,GAAO,GACdU,EAAQV,GAAO,EAAK,IACpB,OAEsB,IAAfM,IACTN,GAAOpE,EAAM1Z,EAAM,IAAM,GAAK0Z,EAAM1Z,EAAM,GAC1CxL,EAAMuE,KACJylB,EAAOV,GAAO,IACdU,EAAQV,GAAO,EAAK,IACpBU,EAAQV,GAAO,EAAK,IACpB,MAIGtpB,EAAMmV,KAAK,GACpB,EA1IA,IALA,IAAI6U,EAAS,GACTN,EAAY,GACZH,EAA4B,oBAAf9tB,WAA6BA,WAAaI,MAEvD4hB,EAAO,mEACFzmB,EAAI,EAAsBA,EAAbymB,KAAwBzmB,EAC5CgzB,EAAOhzB,GAAKymB,EAAKzmB,GACjB0yB,EAAUjM,EAAKzP,WAAWhX,IAAMA,EAQlC,SAASkyB,EAASD,GAChB,IAAIzd,EAAMyd,EAAIzzB,OAEd,GAAIgW,EAAM,EAAI,EACZ,MAAM,IAAI3R,MAAM,kDAKlB,IAAIsvB,EAAWF,EAAIlY,QAAQ,KAO3B,OANkB,IAAdoY,IAAiBA,EAAW3d,GAMzB,CAAC2d,EAJcA,IAAa3d,EAC/B,EACA,EAAK2d,EAAW,EAGtB,CA4DA,SAASc,EAAiBjH,GACxB,OAAOgH,EAAOhH,GAAO,GAAK,IACxBgH,EAAOhH,GAAO,GAAK,IACnBgH,EAAOhH,GAAO,EAAI,IAClBgH,EAAa,GAANhH,EACX,CAEA,SAAS+G,EAAa7E,EAAOqD,EAAOpe,GAGlC,IAFA,IAAImf,EACA1e,EAAS,GACJ5T,EAAIuxB,EAAOvxB,EAAImT,EAAKnT,GAAK,EAChCsyB,GACIpE,EAAMluB,IAAM,GAAM,WAClBkuB,EAAMluB,EAAI,IAAM,EAAK,QACP,IAAfkuB,EAAMluB,EAAI,IACb4T,EAAOrG,KAAK0lB,EAAgBX,IAE9B,OAAO1e,EAAOuK,KAAK,GACrB,CAlGAuU,EAAU,IAAI1b,WAAW,IAAM,GAC/B0b,EAAU,IAAI1b,WAAW,IAAM,E,wBChB/BpZ,EAAOD,QAAU0C,KAAK4B,G,wBCAtBrE,EAAOD,QAAUu1B,W,iBCDjB,IAAI7zB,EAAS,EAAQ,MACjB0B,EAAS1B,EAAO0B,OAGpB,SAAS+M,EAAWC,EAAKC,GACvB,IAAK,IAAInC,KAAOkC,EACdC,EAAInC,GAAOkC,EAAIlC,EAEnB,CASA,SAASoC,EAAYC,EAAKC,EAAkB3P,GAC1C,OAAOuC,EAAOmN,EAAKC,EAAkB3P,EACvC,CAVIuC,EAAOqN,MAAQrN,EAAOO,OAASP,EAAOsN,aAAetN,EAAOuN,gBAC9D1Q,EAAOD,QAAU0B,GAGjByO,EAAUzO,EAAQ1B,GAClBA,EAAQoD,OAASkN,GAOnBA,EAAW/O,UAAYuL,OAAOK,OAAO/J,EAAO7B,WAG5C4O,EAAU/M,EAAQkN,GAElBA,EAAWG,KAAO,SAAUF,EAAKC,EAAkB3P,GACjD,GAAmB,iBAAR0P,EACT,MAAM,IAAIK,UAAU,iCAEtB,OAAOxN,EAAOmN,EAAKC,EAAkB3P,EACvC,EAEAyP,EAAW3M,MAAQ,SAAUkN,EAAMnM,EAAMoM,GACvC,GAAoB,iBAATD,EACT,MAAM,IAAID,UAAU,6BAEtB,IAAIG,EAAM3N,EAAOyN,GAUjB,YATazL,IAATV,EACsB,iBAAboM,EACTC,EAAIrM,KAAKA,EAAMoM,GAEfC,EAAIrM,KAAKA,GAGXqM,EAAIrM,KAAK,GAEJqM,CACT,EAEAT,EAAWI,YAAc,SAAUG,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOxN,EAAOyN,EAChB,EAEAP,EAAWK,gBAAkB,SAAUE,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,6BAEtB,OAAOlP,EAAOsP,WAAWH,EAC3B,C,8BCtDA,MAAM2kB,EAAS,EAAQ,MACjBC,EAAU,EAAQ,KAClBC,EACe,mBAAXtuB,QAAkD,mBAAlBA,OAAY,IAChDA,OAAY,IAAE,8BACd,KAENpH,EAAQoD,OAASA,EACjBpD,EAAQgR,WAyTR,SAAqBnQ,GAInB,OAHKA,GAAUA,IACbA,EAAS,GAEJuC,EAAOO,OAAO9C,EACvB,EA7TAb,EAAQ21B,kBAAoB,GAE5B,MAAMC,EAAe,WAwDrB,SAASC,EAAch1B,GACrB,GAAIA,EAAS+0B,EACX,MAAM,IAAI3X,WAAW,cAAgBpd,EAAS,kCAGhD,MAAMkQ,EAAM,IAAIjK,WAAWjG,GAE3B,OADAiM,OAAOgpB,eAAe/kB,EAAK3N,EAAO7B,WAC3BwP,CACT,CAYA,SAAS3N,EAAQmN,EAAKC,EAAkB3P,GAEtC,GAAmB,iBAAR0P,EAAkB,CAC3B,GAAgC,iBAArBC,EACT,MAAM,IAAII,UACR,sEAGJ,OAAOF,EAAYH,EACrB,CACA,OAAOE,EAAKF,EAAKC,EAAkB3P,EACrC,CAIA,SAAS4P,EAAM9P,EAAO6P,EAAkB3P,GACtC,GAAqB,iBAAVF,EACT,OAqHJ,SAAqB2K,EAAQwF,GAK3B,GAJwB,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,SAGR1N,EAAO2yB,WAAWjlB,GACrB,MAAM,IAAIF,UAAU,qBAAuBE,GAG7C,MAAMjQ,EAAwC,EAA/BwvB,EAAW/kB,EAAQwF,GAClC,IAAIC,EAAM8kB,EAAah1B,GAEvB,MAAMm1B,EAASjlB,EAAInO,MAAM0I,EAAQwF,GASjC,OAPIklB,IAAWn1B,IAIbkQ,EAAMA,EAAInG,MAAM,EAAGorB,IAGdjlB,CACT,CA3IWklB,CAAWt1B,EAAO6P,GAG3B,GAAIrJ,YAAY6oB,OAAOrvB,GACrB,OAkJJ,SAAwBu1B,GACtB,GAAIC,EAAWD,EAAWpvB,YAAa,CACrC,MAAM2O,EAAO,IAAI3O,WAAWovB,GAC5B,OAAOE,EAAgB3gB,EAAK/T,OAAQ+T,EAAK6a,WAAY7a,EAAK4a,WAC5D,CACA,OAAOgG,EAAcH,EACvB,CAxJWI,CAAc31B,GAGvB,GAAa,MAATA,EACF,MAAM,IAAIiQ,UACR,yHACiDjQ,GAIrD,GAAIw1B,EAAWx1B,EAAOwG,cACjBxG,GAASw1B,EAAWx1B,EAAMe,OAAQyF,aACrC,OAAOivB,EAAgBz1B,EAAO6P,EAAkB3P,GAGlD,GAAiC,oBAAtBuI,oBACN+sB,EAAWx1B,EAAOyI,oBAClBzI,GAASw1B,EAAWx1B,EAAMe,OAAQ0H,oBACrC,OAAOgtB,EAAgBz1B,EAAO6P,EAAkB3P,GAGlD,GAAqB,iBAAVF,EACT,MAAM,IAAIiQ,UACR,yEAIJ,MAAM2lB,EAAU51B,EAAM41B,SAAW51B,EAAM41B,UACvC,GAAe,MAAXA,GAAmBA,IAAY51B,EACjC,OAAOyC,EAAOqN,KAAK8lB,EAAS/lB,EAAkB3P,GAGhD,MAAM4tB,EAkJR,SAAqBhuB,GACnB,GAAI2C,EAAOqtB,SAAShwB,GAAM,CACxB,MAAMoW,EAA4B,EAAtB2f,EAAQ/1B,EAAII,QAClBkQ,EAAM8kB,EAAahf,GAEzB,OAAmB,IAAf9F,EAAIlQ,QAIRJ,EAAIgV,KAAK1E,EAAK,EAAG,EAAG8F,GAHX9F,CAKX,CAEA,YAAmB3L,IAAf3E,EAAII,OACoB,iBAAfJ,EAAII,QAAuB41B,EAAYh2B,EAAII,QAC7Cg1B,EAAa,GAEfQ,EAAc51B,GAGN,WAAbA,EAAIwZ,MAAqB/S,MAAMkH,QAAQ3N,EAAIuD,MACtCqyB,EAAc51B,EAAIuD,WAD3B,CAGF,CAzKY0yB,CAAW/1B,GACrB,GAAI8tB,EAAG,OAAOA,EAEd,GAAsB,oBAAXrnB,QAAgD,MAAtBA,OAAOuvB,aACH,mBAA9Bh2B,EAAMyG,OAAOuvB,aACtB,OAAOvzB,EAAOqN,KAAK9P,EAAMyG,OAAOuvB,aAAa,UAAWnmB,EAAkB3P,GAG5E,MAAM,IAAI+P,UACR,yHACiDjQ,EAErD,CAmBA,SAASi2B,EAAY/lB,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAID,UAAU,0CACf,GAAIC,EAAO,EAChB,MAAM,IAAIoN,WAAW,cAAgBpN,EAAO,iCAEhD,CA0BA,SAASH,EAAaG,GAEpB,OADA+lB,EAAW/lB,GACJglB,EAAahlB,EAAO,EAAI,EAAoB,EAAhB2lB,EAAQ3lB,GAC7C,CAuCA,SAASwlB,EAAe5S,GACtB,MAAM5iB,EAAS4iB,EAAM5iB,OAAS,EAAI,EAA4B,EAAxB21B,EAAQ/S,EAAM5iB,QAC9CkQ,EAAM8kB,EAAah1B,GACzB,IAAK,IAAIwB,EAAI,EAAGA,EAAIxB,EAAQwB,GAAK,EAC/B0O,EAAI1O,GAAgB,IAAXohB,EAAMphB,GAEjB,OAAO0O,CACT,CAUA,SAASqlB,EAAiB3S,EAAO6M,EAAYzvB,GAC3C,GAAIyvB,EAAa,GAAK7M,EAAM4M,WAAaC,EACvC,MAAM,IAAIrS,WAAW,wCAGvB,GAAIwF,EAAM4M,WAAaC,GAAczvB,GAAU,GAC7C,MAAM,IAAIod,WAAW,wCAGvB,IAAIlN,EAYJ,OAVEA,OADiB3L,IAAfkrB,QAAuClrB,IAAXvE,EACxB,IAAIiG,WAAW2c,QACDre,IAAXvE,EACH,IAAIiG,WAAW2c,EAAO6M,GAEtB,IAAIxpB,WAAW2c,EAAO6M,EAAYzvB,GAI1CiM,OAAOgpB,eAAe/kB,EAAK3N,EAAO7B,WAE3BwP,CACT,CA2BA,SAASylB,EAAS31B,GAGhB,GAAIA,GAAU+0B,EACZ,MAAM,IAAI3X,WAAW,0DACa2X,EAAa3wB,SAAS,IAAM,UAEhE,OAAgB,EAATpE,CACT,CAsGA,SAASwvB,EAAY/kB,EAAQwF,GAC3B,GAAI1N,EAAOqtB,SAASnlB,GAClB,OAAOA,EAAOzK,OAEhB,GAAIsG,YAAY6oB,OAAO1kB,IAAW6qB,EAAW7qB,EAAQnE,aACnD,OAAOmE,EAAO+kB,WAEhB,GAAsB,iBAAX/kB,EACT,MAAM,IAAIsF,UACR,kGAC0BtF,GAI9B,MAAMuL,EAAMvL,EAAOzK,OACbg2B,EAAaj2B,UAAUC,OAAS,IAAsB,IAAjBD,UAAU,GACrD,IAAKi2B,GAAqB,IAARhgB,EAAW,OAAO,EAGpC,IAAIigB,GAAc,EAClB,OACE,OAAQhmB,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAO+F,EACT,IAAK,OACL,IAAK,QACH,OAAOkgB,EAAYzrB,GAAQzK,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAANgW,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAOmgB,EAAc1rB,GAAQzK,OAC/B,QACE,GAAIi2B,EACF,OAAOD,GAAa,EAAIE,EAAYzrB,GAAQzK,OAE9CiQ,GAAY,GAAKA,GAAUmmB,cAC3BH,GAAc,EAGtB,CAGA,SAASI,EAAcpmB,EAAU8iB,EAAOpe,GACtC,IAAIshB,GAAc,EAclB,SALc1xB,IAAVwuB,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQnwB,KAAK5C,OACf,MAAO,GAOT,SAJYuE,IAARoQ,GAAqBA,EAAM/R,KAAK5C,UAClC2U,EAAM/R,KAAK5C,QAGT2U,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACToe,KAAW,GAGT,MAAO,GAKT,IAFK9iB,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAOqmB,EAAS1zB,KAAMmwB,EAAOpe,GAE/B,IAAK,OACL,IAAK,QACH,OAAO4hB,EAAU3zB,KAAMmwB,EAAOpe,GAEhC,IAAK,QACH,OAAO6hB,EAAW5zB,KAAMmwB,EAAOpe,GAEjC,IAAK,SACL,IAAK,SACH,OAAO8hB,EAAY7zB,KAAMmwB,EAAOpe,GAElC,IAAK,SACH,OAAO+hB,EAAY9zB,KAAMmwB,EAAOpe,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOgiB,EAAa/zB,KAAMmwB,EAAOpe,GAEnC,QACE,GAAIshB,EAAa,MAAM,IAAIlmB,UAAU,qBAAuBE,GAC5DA,GAAYA,EAAW,IAAImmB,cAC3BH,GAAc,EAGtB,CAUA,SAASW,EAAMhJ,EAAG3X,EAAG9U,GACnB,MAAMK,EAAIosB,EAAE3X,GACZ2X,EAAE3X,GAAK2X,EAAEzsB,GACTysB,EAAEzsB,GAAKK,CACT,CA2IA,SAASq1B,EAAsBh2B,EAAQi2B,EAAKrH,EAAYxf,EAAU8mB,GAEhE,GAAsB,IAAlBl2B,EAAOb,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAfyvB,GACTxf,EAAWwf,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAGZmG,EADJnG,GAAcA,KAGZA,EAAasH,EAAM,EAAKl2B,EAAOb,OAAS,GAItCyvB,EAAa,IAAGA,EAAa5uB,EAAOb,OAASyvB,GAC7CA,GAAc5uB,EAAOb,OAAQ,CAC/B,GAAI+2B,EAAK,OAAQ,EACZtH,EAAa5uB,EAAOb,OAAS,CACpC,MAAO,GAAIyvB,EAAa,EAAG,CACzB,IAAIsH,EACC,OAAQ,EADJtH,EAAa,CAExB,CAQA,GALmB,iBAARqH,IACTA,EAAMv0B,EAAOqN,KAAKknB,EAAK7mB,IAIrB1N,EAAOqtB,SAASkH,GAElB,OAAmB,IAAfA,EAAI92B,QACE,EAEHg3B,EAAan2B,EAAQi2B,EAAKrH,EAAYxf,EAAU8mB,GAClD,GAAmB,iBAARD,EAEhB,OADAA,GAAY,IACgC,mBAAjC7wB,WAAWvF,UAAU6a,QAC1Bwb,EACK9wB,WAAWvF,UAAU6a,QAAQ5a,KAAKE,EAAQi2B,EAAKrH,GAE/CxpB,WAAWvF,UAAUu2B,YAAYt2B,KAAKE,EAAQi2B,EAAKrH,GAGvDuH,EAAan2B,EAAQ,CAACi2B,GAAMrH,EAAYxf,EAAU8mB,GAG3D,MAAM,IAAIhnB,UAAU,uCACtB,CAEA,SAASinB,EAAcnI,EAAKiI,EAAKrH,EAAYxf,EAAU8mB,GACrD,IA0BIv1B,EA1BA01B,EAAY,EACZC,EAAYtI,EAAI7uB,OAChBo3B,EAAYN,EAAI92B,OAEpB,QAAiBuE,IAAb0L,IAEe,UADjBA,EAAWzH,OAAOyH,GAAUmmB,gBACY,UAAbnmB,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAI4e,EAAI7uB,OAAS,GAAK82B,EAAI92B,OAAS,EACjC,OAAQ,EAEVk3B,EAAY,EACZC,GAAa,EACbC,GAAa,EACb3H,GAAc,CAChB,CAGF,SAAS7uB,EAAMsP,EAAK1O,GAClB,OAAkB,IAAd01B,EACKhnB,EAAI1O,GAEJ0O,EAAImnB,aAAa71B,EAAI01B,EAEhC,CAGA,GAAIH,EAAK,CACP,IAAIO,GAAc,EAClB,IAAK91B,EAAIiuB,EAAYjuB,EAAI21B,EAAW31B,IAClC,GAAIZ,EAAKiuB,EAAKrtB,KAAOZ,EAAKk2B,GAAqB,IAAhBQ,EAAoB,EAAI91B,EAAI81B,IAEzD,IADoB,IAAhBA,IAAmBA,EAAa91B,GAChCA,EAAI81B,EAAa,IAAMF,EAAW,OAAOE,EAAaJ,OAEtC,IAAhBI,IAAmB91B,GAAKA,EAAI81B,GAChCA,GAAc,CAGpB,MAEE,IADI7H,EAAa2H,EAAYD,IAAW1H,EAAa0H,EAAYC,GAC5D51B,EAAIiuB,EAAYjuB,GAAK,EAAGA,IAAK,CAChC,IAAIsvB,GAAQ,EACZ,IAAK,IAAItH,EAAI,EAAGA,EAAI4N,EAAW5N,IAC7B,GAAI5oB,EAAKiuB,EAAKrtB,EAAIgoB,KAAO5oB,EAAKk2B,EAAKtN,GAAI,CACrCsH,GAAQ,EACR,KACF,CAEF,GAAIA,EAAO,OAAOtvB,CACpB,CAGF,OAAQ,CACV,CAcA,SAAS+1B,EAAUrnB,EAAKzF,EAAQ3J,EAAQd,GACtCc,EAASiH,OAAOjH,IAAW,EAC3B,MAAM02B,EAAYtnB,EAAIlQ,OAASc,EAC1Bd,GAGHA,EAAS+H,OAAO/H,IACHw3B,IACXx3B,EAASw3B,GAJXx3B,EAASw3B,EAQX,MAAMC,EAAShtB,EAAOzK,OAKtB,IAAIwB,EACJ,IAJIxB,EAASy3B,EAAS,IACpBz3B,EAASy3B,EAAS,GAGfj2B,EAAI,EAAGA,EAAIxB,IAAUwB,EAAG,CAC3B,MAAMk2B,EAASzvB,SAASwC,EAAO4T,OAAW,EAAJ7c,EAAO,GAAI,IACjD,GAAIo0B,EAAY8B,GAAS,OAAOl2B,EAChC0O,EAAIpP,EAASU,GAAKk2B,CACpB,CACA,OAAOl2B,CACT,CAEA,SAASm2B,EAAWznB,EAAKzF,EAAQ3J,EAAQd,GACvC,OAAO43B,EAAW1B,EAAYzrB,EAAQyF,EAAIlQ,OAASc,GAASoP,EAAKpP,EAAQd,EAC3E,CAEA,SAAS63B,EAAY3nB,EAAKzF,EAAQ3J,EAAQd,GACxC,OAAO43B,EAypCT,SAAuBzf,GACrB,MAAM2f,EAAY,GAClB,IAAK,IAAIt2B,EAAI,EAAGA,EAAI2W,EAAInY,SAAUwB,EAEhCs2B,EAAU/oB,KAAyB,IAApBoJ,EAAIK,WAAWhX,IAEhC,OAAOs2B,CACT,CAhqCoBC,CAAattB,GAASyF,EAAKpP,EAAQd,EACvD,CAEA,SAASg4B,EAAa9nB,EAAKzF,EAAQ3J,EAAQd,GACzC,OAAO43B,EAAWzB,EAAc1rB,GAASyF,EAAKpP,EAAQd,EACxD,CAEA,SAASi4B,EAAW/nB,EAAKzF,EAAQ3J,EAAQd,GACvC,OAAO43B,EA0pCT,SAAyBzf,EAAK+f,GAC5B,IAAIl2B,EAAGm2B,EAAIC,EACX,MAAMN,EAAY,GAClB,IAAK,IAAIt2B,EAAI,EAAGA,EAAI2W,EAAInY,WACjBk4B,GAAS,GAAK,KADa12B,EAGhCQ,EAAImW,EAAIK,WAAWhX,GACnB22B,EAAKn2B,GAAK,EACVo2B,EAAKp2B,EAAI,IACT81B,EAAU/oB,KAAKqpB,GACfN,EAAU/oB,KAAKopB,GAGjB,OAAOL,CACT,CAxqCoBO,CAAe5tB,EAAQyF,EAAIlQ,OAASc,GAASoP,EAAKpP,EAAQd,EAC9E,CA8EA,SAAS02B,EAAaxmB,EAAK6iB,EAAOpe,GAChC,OAAc,IAAVoe,GAAepe,IAAQzE,EAAIlQ,OACtB20B,EAAOR,cAAcjkB,GAErBykB,EAAOR,cAAcjkB,EAAInG,MAAMgpB,EAAOpe,GAEjD,CAEA,SAAS4hB,EAAWrmB,EAAK6iB,EAAOpe,GAC9BA,EAAM9S,KAAK4B,IAAIyM,EAAIlQ,OAAQ2U,GAC3B,MAAMuT,EAAM,GAEZ,IAAI1mB,EAAIuxB,EACR,KAAOvxB,EAAImT,GAAK,CACd,MAAM2jB,EAAYpoB,EAAI1O,GACtB,IAAI+2B,EAAY,KACZC,EAAoBF,EAAY,IAChC,EACCA,EAAY,IACT,EACCA,EAAY,IACT,EACA,EAEZ,GAAI92B,EAAIg3B,GAAoB7jB,EAAK,CAC/B,IAAI8jB,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EACHG,EAAavoB,EAAI1O,EAAI,GACO,MAAV,IAAbi3B,KACHG,GAA6B,GAAZN,IAAqB,EAAoB,GAAbG,EACzCG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAavoB,EAAI1O,EAAI,GACrBk3B,EAAYxoB,EAAI1O,EAAI,GACQ,MAAV,IAAbi3B,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZN,IAAoB,IAAoB,GAAbG,IAAsB,EAAmB,GAAZC,EACrEE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAavoB,EAAI1O,EAAI,GACrBk3B,EAAYxoB,EAAI1O,EAAI,GACpBm3B,EAAazoB,EAAI1O,EAAI,GACO,MAAV,IAAbi3B,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZN,IAAoB,IAAqB,GAAbG,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,EAClGC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,IAItB,CAEkB,OAAdL,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbrQ,EAAInZ,KAAKwpB,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvBrQ,EAAInZ,KAAKwpB,GACT/2B,GAAKg3B,CACP,CAEA,OAQF,SAAgCK,GAC9B,MAAM7iB,EAAM6iB,EAAW74B,OACvB,GAAIgW,GAAO8iB,EACT,OAAOtwB,OAAOuO,aAAajL,MAAMtD,OAAQqwB,GAI3C,IAAI3Q,EAAM,GACN1mB,EAAI,EACR,KAAOA,EAAIwU,GACTkS,GAAO1f,OAAOuO,aAAajL,MACzBtD,OACAqwB,EAAW9uB,MAAMvI,EAAGA,GAAKs3B,IAG7B,OAAO5Q,CACT,CAxBS6Q,CAAsB7Q,EAC/B,CA3+BA/oB,EAAQ65B,WAAajE,EAgBrBxyB,EAAOgtB,oBAUP,WAEE,IACE,MAAMV,EAAM,IAAI5oB,WAAW,GACrByqB,EAAQ,CAAEuI,IAAK,WAAc,OAAO,EAAG,GAG7C,OAFAhtB,OAAOgpB,eAAevE,EAAOzqB,WAAWvF,WACxCuL,OAAOgpB,eAAepG,EAAK6B,GACN,KAAd7B,EAAIoK,KACb,CAAE,MAAO/3B,GACP,OAAO,CACT,CACF,CArB6Bg4B,GAExB32B,EAAOgtB,qBAA0C,oBAAZ4J,SACb,mBAAlBA,QAAQpwB,OACjBowB,QAAQpwB,MACN,iJAkBJkD,OAAOC,eAAe3J,EAAO7B,UAAW,SAAU,CAChDH,YAAY,EACZgF,IAAK,WACH,GAAKhD,EAAOqtB,SAAShtB,MACrB,OAAOA,KAAK/B,MACd,IAGFoL,OAAOC,eAAe3J,EAAO7B,UAAW,SAAU,CAChDH,YAAY,EACZgF,IAAK,WACH,GAAKhD,EAAOqtB,SAAShtB,MACrB,OAAOA,KAAK6sB,UACd,IAoCFltB,EAAO62B,SAAW,KA8DlB72B,EAAOqN,KAAO,SAAU9P,EAAO6P,EAAkB3P,GAC/C,OAAO4P,EAAK9P,EAAO6P,EAAkB3P,EACvC,EAIAiM,OAAOgpB,eAAe1yB,EAAO7B,UAAWuF,WAAWvF,WACnDuL,OAAOgpB,eAAe1yB,EAAQ0D,YA8B9B1D,EAAOO,MAAQ,SAAUkN,EAAMnM,EAAMoM,GACnC,OArBF,SAAgBD,EAAMnM,EAAMoM,GAE1B,OADA8lB,EAAW/lB,GACPA,GAAQ,EACHglB,EAAahlB,QAETzL,IAATV,EAIyB,iBAAboM,EACV+kB,EAAahlB,GAAMnM,KAAKA,EAAMoM,GAC9B+kB,EAAahlB,GAAMnM,KAAKA,GAEvBmxB,EAAahlB,EACtB,CAOSlN,CAAMkN,EAAMnM,EAAMoM,EAC3B,EAUA1N,EAAOsN,YAAc,SAAUG,GAC7B,OAAOH,EAAYG,EACrB,EAIAzN,EAAOuN,gBAAkB,SAAUE,GACjC,OAAOH,EAAYG,EACrB,EA6GAzN,EAAOqtB,SAAW,SAAmBhC,GACnC,OAAY,MAALA,IAA6B,IAAhBA,EAAEyL,WACpBzL,IAAMrrB,EAAO7B,SACjB,EAEA6B,EAAO+2B,QAAU,SAAkBnL,EAAGP,GAGpC,GAFI0H,EAAWnH,EAAGloB,cAAakoB,EAAI5rB,EAAOqN,KAAKue,EAAGA,EAAErtB,OAAQqtB,EAAEqB,aAC1D8F,EAAW1H,EAAG3nB,cAAa2nB,EAAIrrB,EAAOqN,KAAKge,EAAGA,EAAE9sB,OAAQ8sB,EAAE4B,cACzDjtB,EAAOqtB,SAASzB,KAAO5rB,EAAOqtB,SAAShC,GAC1C,MAAM,IAAI7d,UACR,yEAIJ,GAAIoe,IAAMP,EAAG,OAAO,EAEpB,IAAIjL,EAAIwL,EAAEnuB,OACNu5B,EAAI3L,EAAE5tB,OAEV,IAAK,IAAIwB,EAAI,EAAGwU,EAAMnU,KAAK4B,IAAIkf,EAAG4W,GAAI/3B,EAAIwU,IAAOxU,EAC/C,GAAI2sB,EAAE3sB,KAAOosB,EAAEpsB,GAAI,CACjBmhB,EAAIwL,EAAE3sB,GACN+3B,EAAI3L,EAAEpsB,GACN,KACF,CAGF,OAAImhB,EAAI4W,GAAW,EACfA,EAAI5W,EAAU,EACX,CACT,EAEApgB,EAAO2yB,WAAa,SAAqBjlB,GACvC,OAAQzH,OAAOyH,GAAUmmB,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,EAEb,EAEA7zB,EAAOkH,OAAS,SAAiB+Y,EAAMxiB,GACrC,IAAKqG,MAAMkH,QAAQiV,GACjB,MAAM,IAAIzS,UAAU,+CAGtB,GAAoB,IAAhByS,EAAKxiB,OACP,OAAOuC,EAAOO,MAAM,GAGtB,IAAItB,EACJ,QAAe+C,IAAXvE,EAEF,IADAA,EAAS,EACJwB,EAAI,EAAGA,EAAIghB,EAAKxiB,SAAUwB,EAC7BxB,GAAUwiB,EAAKhhB,GAAGxB,OAItB,MAAMa,EAAS0B,EAAOsN,YAAY7P,GAClC,IAAI+Y,EAAM,EACV,IAAKvX,EAAI,EAAGA,EAAIghB,EAAKxiB,SAAUwB,EAAG,CAChC,IAAI0O,EAAMsS,EAAKhhB,GACf,GAAI8zB,EAAWplB,EAAKjK,YACd8S,EAAM7I,EAAIlQ,OAASa,EAAOb,QACvBuC,EAAOqtB,SAAS1f,KAAMA,EAAM3N,EAAOqN,KAAKM,IAC7CA,EAAI0E,KAAK/T,EAAQkY,IAEjB9S,WAAWvF,UAAUkwB,IAAIjwB,KACvBE,EACAqP,EACA6I,OAGC,KAAKxW,EAAOqtB,SAAS1f,GAC1B,MAAM,IAAIH,UAAU,+CAEpBG,EAAI0E,KAAK/T,EAAQkY,EACnB,CACAA,GAAO7I,EAAIlQ,MACb,CACA,OAAOa,CACT,EAiDA0B,EAAOitB,WAAaA,EA8EpBjtB,EAAO7B,UAAU24B,WAAY,EAQ7B92B,EAAO7B,UAAU84B,OAAS,WACxB,MAAMxjB,EAAMpT,KAAK5C,OACjB,GAAIgW,EAAM,GAAM,EACd,MAAM,IAAIoH,WAAW,6CAEvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EAC5Bo1B,EAAKh0B,KAAMpB,EAAGA,EAAI,GAEpB,OAAOoB,IACT,EAEAL,EAAO7B,UAAU+4B,OAAS,WACxB,MAAMzjB,EAAMpT,KAAK5C,OACjB,GAAIgW,EAAM,GAAM,EACd,MAAM,IAAIoH,WAAW,6CAEvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EAC5Bo1B,EAAKh0B,KAAMpB,EAAGA,EAAI,GAClBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GAExB,OAAOoB,IACT,EAEAL,EAAO7B,UAAUg5B,OAAS,WACxB,MAAM1jB,EAAMpT,KAAK5C,OACjB,GAAIgW,EAAM,GAAM,EACd,MAAM,IAAIoH,WAAW,6CAEvB,IAAK,IAAI5b,EAAI,EAAGA,EAAIwU,EAAKxU,GAAK,EAC5Bo1B,EAAKh0B,KAAMpB,EAAGA,EAAI,GAClBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GACtBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GACtBo1B,EAAKh0B,KAAMpB,EAAI,EAAGA,EAAI,GAExB,OAAOoB,IACT,EAEAL,EAAO7B,UAAU0D,SAAW,WAC1B,MAAMpE,EAAS4C,KAAK5C,OACpB,OAAe,IAAXA,EAAqB,GACA,IAArBD,UAAUC,OAAqBu2B,EAAU3zB,KAAM,EAAG5C,GAC/Cq2B,EAAavqB,MAAMlJ,KAAM7C,UAClC,EAEAwC,EAAO7B,UAAUi5B,eAAiBp3B,EAAO7B,UAAU0D,SAEnD7B,EAAO7B,UAAUk5B,OAAS,SAAiBhM,GACzC,IAAKrrB,EAAOqtB,SAAShC,GAAI,MAAM,IAAI7d,UAAU,6BAC7C,OAAInN,OAASgrB,GACsB,IAA5BrrB,EAAO+2B,QAAQ12B,KAAMgrB,EAC9B,EAEArrB,EAAO7B,UAAUm5B,QAAU,WACzB,IAAI1hB,EAAM,GACV,MAAMrT,EAAM3F,EAAQ21B,kBAGpB,OAFA3c,EAAMvV,KAAKwB,SAAS,MAAO,EAAGU,GAAK+E,QAAQ,UAAW,OAAOiwB,OACzDl3B,KAAK5C,OAAS8E,IAAKqT,GAAO,SACvB,WAAaA,EAAM,GAC5B,EACI0c,IACFtyB,EAAO7B,UAAUm0B,GAAuBtyB,EAAO7B,UAAUm5B,SAG3Dt3B,EAAO7B,UAAU44B,QAAU,SAAkBS,EAAQhH,EAAOpe,EAAKqlB,EAAWC,GAI1E,GAHI3E,EAAWyE,EAAQ9zB,cACrB8zB,EAASx3B,EAAOqN,KAAKmqB,EAAQA,EAAOj5B,OAAQi5B,EAAOvK,cAEhDjtB,EAAOqtB,SAASmK,GACnB,MAAM,IAAIhqB,UACR,wFAC2BgqB,GAiB/B,QAbcx1B,IAAVwuB,IACFA,EAAQ,QAEExuB,IAARoQ,IACFA,EAAMolB,EAASA,EAAO/5B,OAAS,QAEfuE,IAAdy1B,IACFA,EAAY,QAEEz1B,IAAZ01B,IACFA,EAAUr3B,KAAK5C,QAGb+yB,EAAQ,GAAKpe,EAAMolB,EAAO/5B,QAAUg6B,EAAY,GAAKC,EAAUr3B,KAAK5C,OACtE,MAAM,IAAIod,WAAW,sBAGvB,GAAI4c,GAAaC,GAAWlH,GAASpe,EACnC,OAAO,EAET,GAAIqlB,GAAaC,EACf,OAAQ,EAEV,GAAIlH,GAASpe,EACX,OAAO,EAQT,GAAI/R,OAASm3B,EAAQ,OAAO,EAE5B,IAAIpX,GAJJsX,KAAa,IADbD,KAAe,GAMXT,GAPJ5kB,KAAS,IADToe,KAAW,GASX,MAAM/c,EAAMnU,KAAK4B,IAAIkf,EAAG4W,GAElBW,EAAWt3B,KAAKmH,MAAMiwB,EAAWC,GACjCE,EAAaJ,EAAOhwB,MAAMgpB,EAAOpe,GAEvC,IAAK,IAAInT,EAAI,EAAGA,EAAIwU,IAAOxU,EACzB,GAAI04B,EAAS14B,KAAO24B,EAAW34B,GAAI,CACjCmhB,EAAIuX,EAAS14B,GACb+3B,EAAIY,EAAW34B,GACf,KACF,CAGF,OAAImhB,EAAI4W,GAAW,EACfA,EAAI5W,EAAU,EACX,CACT,EA2HApgB,EAAO7B,UAAU05B,SAAW,SAAmBtD,EAAKrH,EAAYxf,GAC9D,OAAoD,IAA7CrN,KAAK2Y,QAAQub,EAAKrH,EAAYxf,EACvC,EAEA1N,EAAO7B,UAAU6a,QAAU,SAAkBub,EAAKrH,EAAYxf,GAC5D,OAAO4mB,EAAqBj0B,KAAMk0B,EAAKrH,EAAYxf,GAAU,EAC/D,EAEA1N,EAAO7B,UAAUu2B,YAAc,SAAsBH,EAAKrH,EAAYxf,GACpE,OAAO4mB,EAAqBj0B,KAAMk0B,EAAKrH,EAAYxf,GAAU,EAC/D,EA4CA1N,EAAO7B,UAAUqB,MAAQ,SAAgB0I,EAAQ3J,EAAQd,EAAQiQ,GAE/D,QAAe1L,IAAXzD,EACFmP,EAAW,OACXjQ,EAAS4C,KAAK5C,OACdc,EAAS,OAEJ,QAAeyD,IAAXvE,GAA0C,iBAAXc,EACxCmP,EAAWnP,EACXd,EAAS4C,KAAK5C,OACdc,EAAS,MAEJ,KAAI8G,SAAS9G,GAUlB,MAAM,IAAIuD,MACR,2EAVFvD,KAAoB,EAChB8G,SAAS5H,IACXA,KAAoB,OACHuE,IAAb0L,IAAwBA,EAAW,UAEvCA,EAAWjQ,EACXA,OAASuE,EAMb,CAEA,MAAMizB,EAAY50B,KAAK5C,OAASc,EAGhC,SAFeyD,IAAXvE,GAAwBA,EAASw3B,KAAWx3B,EAASw3B,GAEpD/sB,EAAOzK,OAAS,IAAMA,EAAS,GAAKc,EAAS,IAAOA,EAAS8B,KAAK5C,OACrE,MAAM,IAAIod,WAAW,0CAGlBnN,IAAUA,EAAW,QAE1B,IAAIgmB,GAAc,EAClB,OACE,OAAQhmB,GACN,IAAK,MACH,OAAOsnB,EAAS30B,KAAM6H,EAAQ3J,EAAQd,GAExC,IAAK,OACL,IAAK,QACH,OAAO23B,EAAU/0B,KAAM6H,EAAQ3J,EAAQd,GAEzC,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAO63B,EAAWj1B,KAAM6H,EAAQ3J,EAAQd,GAE1C,IAAK,SAEH,OAAOg4B,EAAYp1B,KAAM6H,EAAQ3J,EAAQd,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOi4B,EAAUr1B,KAAM6H,EAAQ3J,EAAQd,GAEzC,QACE,GAAIi2B,EAAa,MAAM,IAAIlmB,UAAU,qBAAuBE,GAC5DA,GAAY,GAAKA,GAAUmmB,cAC3BH,GAAc,EAGtB,EAEA1zB,EAAO7B,UAAU25B,OAAS,WACxB,MAAO,CACLjhB,KAAM,SACNjW,KAAMkD,MAAM3F,UAAUqJ,MAAMpJ,KAAKiC,KAAK03B,MAAQ13B,KAAM,GAExD,EAyFA,MAAMk2B,EAAuB,KAoB7B,SAAStC,EAAYtmB,EAAK6iB,EAAOpe,GAC/B,IAAItG,EAAM,GACVsG,EAAM9S,KAAK4B,IAAIyM,EAAIlQ,OAAQ2U,GAE3B,IAAK,IAAInT,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EAC7B6M,GAAO7F,OAAOuO,aAAsB,IAAT7G,EAAI1O,IAEjC,OAAO6M,CACT,CAEA,SAASooB,EAAavmB,EAAK6iB,EAAOpe,GAChC,IAAItG,EAAM,GACVsG,EAAM9S,KAAK4B,IAAIyM,EAAIlQ,OAAQ2U,GAE3B,IAAK,IAAInT,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EAC7B6M,GAAO7F,OAAOuO,aAAa7G,EAAI1O,IAEjC,OAAO6M,CACT,CAEA,SAASioB,EAAUpmB,EAAK6iB,EAAOpe,GAC7B,MAAMqB,EAAM9F,EAAIlQ,SAEX+yB,GAASA,EAAQ,KAAGA,EAAQ,KAC5Bpe,GAAOA,EAAM,GAAKA,EAAMqB,KAAKrB,EAAMqB,GAExC,IAAI2C,EAAM,GACV,IAAK,IAAInX,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EAC7BmX,GAAO4hB,EAAoBrqB,EAAI1O,IAEjC,OAAOmX,CACT,CAEA,SAASge,EAAczmB,EAAK6iB,EAAOpe,GACjC,MAAM6lB,EAAQtqB,EAAInG,MAAMgpB,EAAOpe,GAC/B,IAAIuT,EAAM,GAEV,IAAK,IAAI1mB,EAAI,EAAGA,EAAIg5B,EAAMx6B,OAAS,EAAGwB,GAAK,EACzC0mB,GAAO1f,OAAOuO,aAAayjB,EAAMh5B,GAAqB,IAAfg5B,EAAMh5B,EAAI,IAEnD,OAAO0mB,CACT,CAiCA,SAASuS,EAAa35B,EAAQ45B,EAAK16B,GACjC,GAAKc,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAIsc,WAAW,sBAC3D,GAAItc,EAAS45B,EAAM16B,EAAQ,MAAM,IAAIod,WAAW,wCAClD,CAyQA,SAASud,EAAUzqB,EAAKpQ,EAAOgB,EAAQ45B,EAAK51B,EAAKrB,GAC/C,IAAKlB,EAAOqtB,SAAS1f,GAAM,MAAM,IAAIH,UAAU,+CAC/C,GAAIjQ,EAAQgF,GAAOhF,EAAQ2D,EAAK,MAAM,IAAI2Z,WAAW,qCACrD,GAAItc,EAAS45B,EAAMxqB,EAAIlQ,OAAQ,MAAM,IAAIod,WAAW,qBACtD,CA+FA,SAASwd,EAAgB1qB,EAAKpQ,EAAOgB,EAAQ2C,EAAKqB,GAChD+1B,EAAW/6B,EAAO2D,EAAKqB,EAAKoL,EAAKpP,EAAQ,GAEzC,IAAIs3B,EAAKrwB,OAAOjI,EAAQ4G,OAAO,aAC/BwJ,EAAIpP,KAAYs3B,EAChBA,IAAW,EACXloB,EAAIpP,KAAYs3B,EAChBA,IAAW,EACXloB,EAAIpP,KAAYs3B,EAChBA,IAAW,EACXloB,EAAIpP,KAAYs3B,EAChB,IAAID,EAAKpwB,OAAOjI,GAAS4G,OAAO,IAAMA,OAAO,aAQ7C,OAPAwJ,EAAIpP,KAAYq3B,EAChBA,IAAW,EACXjoB,EAAIpP,KAAYq3B,EAChBA,IAAW,EACXjoB,EAAIpP,KAAYq3B,EAChBA,IAAW,EACXjoB,EAAIpP,KAAYq3B,EACTr3B,CACT,CAEA,SAASg6B,EAAgB5qB,EAAKpQ,EAAOgB,EAAQ2C,EAAKqB,GAChD+1B,EAAW/6B,EAAO2D,EAAKqB,EAAKoL,EAAKpP,EAAQ,GAEzC,IAAIs3B,EAAKrwB,OAAOjI,EAAQ4G,OAAO,aAC/BwJ,EAAIpP,EAAS,GAAKs3B,EAClBA,IAAW,EACXloB,EAAIpP,EAAS,GAAKs3B,EAClBA,IAAW,EACXloB,EAAIpP,EAAS,GAAKs3B,EAClBA,IAAW,EACXloB,EAAIpP,EAAS,GAAKs3B,EAClB,IAAID,EAAKpwB,OAAOjI,GAAS4G,OAAO,IAAMA,OAAO,aAQ7C,OAPAwJ,EAAIpP,EAAS,GAAKq3B,EAClBA,IAAW,EACXjoB,EAAIpP,EAAS,GAAKq3B,EAClBA,IAAW,EACXjoB,EAAIpP,EAAS,GAAKq3B,EAClBA,IAAW,EACXjoB,EAAIpP,GAAUq3B,EACPr3B,EAAS,CAClB,CAkHA,SAASi6B,EAAc7qB,EAAKpQ,EAAOgB,EAAQ45B,EAAK51B,EAAKrB,GACnD,GAAI3C,EAAS45B,EAAMxqB,EAAIlQ,OAAQ,MAAM,IAAIod,WAAW,sBACpD,GAAItc,EAAS,EAAG,MAAM,IAAIsc,WAAW,qBACvC,CAEA,SAAS4d,EAAY9qB,EAAKpQ,EAAOgB,EAAQm6B,EAAcC,GAOrD,OANAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GACHH,EAAa7qB,EAAKpQ,EAAOgB,EAAQ,GAEnC8zB,EAAQ7yB,MAAMmO,EAAKpQ,EAAOgB,EAAQm6B,EAAc,GAAI,GAC7Cn6B,EAAS,CAClB,CAUA,SAASq6B,EAAajrB,EAAKpQ,EAAOgB,EAAQm6B,EAAcC,GAOtD,OANAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GACHH,EAAa7qB,EAAKpQ,EAAOgB,EAAQ,GAEnC8zB,EAAQ7yB,MAAMmO,EAAKpQ,EAAOgB,EAAQm6B,EAAc,GAAI,GAC7Cn6B,EAAS,CAClB,CAzkBAyB,EAAO7B,UAAUqJ,MAAQ,SAAgBgpB,EAAOpe,GAC9C,MAAMqB,EAAMpT,KAAK5C,QACjB+yB,IAAUA,GAGE,GACVA,GAAS/c,GACG,IAAG+c,EAAQ,GACdA,EAAQ/c,IACjB+c,EAAQ/c,IANVrB,OAAcpQ,IAARoQ,EAAoBqB,IAAQrB,GASxB,GACRA,GAAOqB,GACG,IAAGrB,EAAM,GACVA,EAAMqB,IACfrB,EAAMqB,GAGJrB,EAAMoe,IAAOpe,EAAMoe,GAEvB,MAAMqI,EAASx4B,KAAKoV,SAAS+a,EAAOpe,GAIpC,OAFA1I,OAAOgpB,eAAemG,EAAQ74B,EAAO7B,WAE9B06B,CACT,EAUA74B,EAAO7B,UAAU26B,WACjB94B,EAAO7B,UAAU46B,WAAa,SAAqBx6B,EAAQ0uB,EAAY0L,GACrEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAAUT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAEpD,IAAI82B,EAAMl0B,KAAK9B,GACXy6B,EAAM,EACN/5B,EAAI,EACR,OAASA,EAAIguB,IAAe+L,GAAO,MACjCzE,GAAOl0B,KAAK9B,EAASU,GAAK+5B,EAG5B,OAAOzE,CACT,EAEAv0B,EAAO7B,UAAU86B,WACjBj5B,EAAO7B,UAAU+6B,WAAa,SAAqB36B,EAAQ0uB,EAAY0L,GACrEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GACHT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAGvC,IAAI82B,EAAMl0B,KAAK9B,IAAW0uB,GACtB+L,EAAM,EACV,KAAO/L,EAAa,IAAM+L,GAAO,MAC/BzE,GAAOl0B,KAAK9B,IAAW0uB,GAAc+L,EAGvC,OAAOzE,CACT,EAEAv0B,EAAO7B,UAAUg7B,UACjBn5B,EAAO7B,UAAUi7B,UAAY,SAAoB76B,EAAQo6B,GAGvD,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC4C,KAAK9B,EACd,EAEAyB,EAAO7B,UAAUk7B,aACjBr5B,EAAO7B,UAAUm7B,aAAe,SAAuB/6B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC4C,KAAK9B,GAAW8B,KAAK9B,EAAS,IAAM,CAC7C,EAEAyB,EAAO7B,UAAUo7B,aACjBv5B,EAAO7B,UAAU22B,aAAe,SAAuBv2B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACnC4C,KAAK9B,IAAW,EAAK8B,KAAK9B,EAAS,EAC7C,EAEAyB,EAAO7B,UAAUq7B,aACjBx5B,EAAO7B,UAAUs7B,aAAe,SAAuBl7B,EAAQo6B,GAI7D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,SAElC4C,KAAK9B,GACT8B,KAAK9B,EAAS,IAAM,EACpB8B,KAAK9B,EAAS,IAAM,IACD,SAAnB8B,KAAK9B,EAAS,EACrB,EAEAyB,EAAO7B,UAAUu7B,aACjB15B,EAAO7B,UAAUw7B,aAAe,SAAuBp7B,EAAQo6B,GAI7D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAEpB,SAAf4C,KAAK9B,IACT8B,KAAK9B,EAAS,IAAM,GACrB8B,KAAK9B,EAAS,IAAM,EACrB8B,KAAK9B,EAAS,GAClB,EAEAyB,EAAO7B,UAAUy7B,gBAAkBC,EAAmB,SAA0Bt7B,GAE9Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAMo4B,EAAK1tB,EACQ,IAAjB9H,OAAO9B,GACU,MAAjB8B,OAAO9B,GACP8B,OAAO9B,GAAU,GAAK,GAElBq3B,EAAKv1B,OAAO9B,GACC,IAAjB8B,OAAO9B,GACU,MAAjB8B,OAAO9B,GACP6J,EAAO,GAAK,GAEd,OAAOjE,OAAO0xB,IAAO1xB,OAAOyxB,IAAOzxB,OAAO,IAC5C,GAEAnE,EAAO7B,UAAU67B,gBAAkBH,EAAmB,SAA0Bt7B,GAE9Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAMm4B,EAAKztB,EAAQ,GAAK,GACL,MAAjB9H,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP8B,OAAO9B,GAEHs3B,EAAKx1B,OAAO9B,GAAU,GAAK,GACd,MAAjB8B,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP6J,EAEF,OAAQjE,OAAOyxB,IAAOzxB,OAAO,KAAOA,OAAO0xB,EAC7C,GAEA71B,EAAO7B,UAAU87B,UAAY,SAAoB17B,EAAQ0uB,EAAY0L,GACnEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAAUT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAEpD,IAAI82B,EAAMl0B,KAAK9B,GACXy6B,EAAM,EACN/5B,EAAI,EACR,OAASA,EAAIguB,IAAe+L,GAAO,MACjCzE,GAAOl0B,KAAK9B,EAASU,GAAK+5B,EAM5B,OAJAA,GAAO,IAEHzE,GAAOyE,IAAKzE,GAAOj1B,KAAKC,IAAI,EAAG,EAAI0tB,IAEhCsH,CACT,EAEAv0B,EAAO7B,UAAU+7B,UAAY,SAAoB37B,EAAQ0uB,EAAY0L,GACnEp6B,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAAUT,EAAY35B,EAAQ0uB,EAAY5sB,KAAK5C,QAEpD,IAAIwB,EAAIguB,EACJ+L,EAAM,EACNzE,EAAMl0B,KAAK9B,IAAWU,GAC1B,KAAOA,EAAI,IAAM+5B,GAAO,MACtBzE,GAAOl0B,KAAK9B,IAAWU,GAAK+5B,EAM9B,OAJAA,GAAO,IAEHzE,GAAOyE,IAAKzE,GAAOj1B,KAAKC,IAAI,EAAG,EAAI0tB,IAEhCsH,CACT,EAEAv0B,EAAO7B,UAAUg8B,SAAW,SAAmB57B,EAAQo6B,GAGrD,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACtB,IAAf4C,KAAK9B,IAC0B,GAA5B,IAAO8B,KAAK9B,GAAU,GADK8B,KAAK9B,EAE3C,EAEAyB,EAAO7B,UAAUi8B,YAAc,SAAsB77B,EAAQo6B,GAC3Dp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAC3C,MAAM82B,EAAMl0B,KAAK9B,GAAW8B,KAAK9B,EAAS,IAAM,EAChD,OAAc,MAANg2B,EAAsB,WAANA,EAAmBA,CAC7C,EAEAv0B,EAAO7B,UAAUk8B,YAAc,SAAsB97B,EAAQo6B,GAC3Dp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAC3C,MAAM82B,EAAMl0B,KAAK9B,EAAS,GAAM8B,KAAK9B,IAAW,EAChD,OAAc,MAANg2B,EAAsB,WAANA,EAAmBA,CAC7C,EAEAv0B,EAAO7B,UAAUm8B,YAAc,SAAsB/7B,EAAQo6B,GAI3D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAEnC4C,KAAK9B,GACV8B,KAAK9B,EAAS,IAAM,EACpB8B,KAAK9B,EAAS,IAAM,GACpB8B,KAAK9B,EAAS,IAAM,EACzB,EAEAyB,EAAO7B,UAAU0tB,YAAc,SAAsBttB,EAAQo6B,GAI3D,OAHAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QAEnC4C,KAAK9B,IAAW,GACrB8B,KAAK9B,EAAS,IAAM,GACpB8B,KAAK9B,EAAS,IAAM,EACpB8B,KAAK9B,EAAS,EACnB,EAEAyB,EAAO7B,UAAUo8B,eAAiBV,EAAmB,SAAyBt7B,GAE5Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAM82B,EAAMl0B,KAAK9B,EAAS,GACL,IAAnB8B,KAAK9B,EAAS,GACK,MAAnB8B,KAAK9B,EAAS,IACb6J,GAAQ,IAEX,OAAQjE,OAAOowB,IAAQpwB,OAAO,KAC5BA,OAAOgE,EACU,IAAjB9H,OAAO9B,GACU,MAAjB8B,OAAO9B,GACP8B,OAAO9B,GAAU,GAAK,GAC1B,GAEAyB,EAAO7B,UAAUq8B,eAAiBX,EAAmB,SAAyBt7B,GAE5Eu7B,EADAv7B,KAAoB,EACG,UACvB,MAAM4J,EAAQ9H,KAAK9B,GACb6J,EAAO/H,KAAK9B,EAAS,QACbyD,IAAVmG,QAAgCnG,IAAToG,GACzB2xB,EAAYx7B,EAAQ8B,KAAK5C,OAAS,GAGpC,MAAM82B,GAAOpsB,GAAS,IACH,MAAjB9H,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP8B,OAAO9B,GAET,OAAQ4F,OAAOowB,IAAQpwB,OAAO,KAC5BA,OAAO9D,OAAO9B,GAAU,GAAK,GACZ,MAAjB8B,OAAO9B,GACU,IAAjB8B,OAAO9B,GACP6J,EACJ,GAEApI,EAAO7B,UAAUs8B,YAAc,SAAsBl8B,EAAQo6B,GAG3D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAM,GAAI,EAC9C,EAEAyB,EAAO7B,UAAUu8B,YAAc,SAAsBn8B,EAAQo6B,GAG3D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAO,GAAI,EAC/C,EAEAyB,EAAO7B,UAAUw8B,aAAe,SAAuBp8B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAM,GAAI,EAC9C,EAEAyB,EAAO7B,UAAUy8B,aAAe,SAAuBr8B,EAAQo6B,GAG7D,OAFAp6B,KAAoB,EACfo6B,GAAUT,EAAY35B,EAAQ,EAAG8B,KAAK5C,QACpC40B,EAAQh0B,KAAKgC,KAAM9B,GAAQ,EAAO,GAAI,EAC/C,EAQAyB,EAAO7B,UAAU08B,YACjB76B,EAAO7B,UAAU28B,YAAc,SAAsBv9B,EAAOgB,EAAQ0uB,EAAY0L,GAC9Ep7B,GAASA,EACTgB,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAEHP,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EADb3tB,KAAKC,IAAI,EAAG,EAAI0tB,GAAc,EACK,GAGtD,IAAI+L,EAAM,EACN/5B,EAAI,EAER,IADAoB,KAAK9B,GAAkB,IAARhB,IACN0B,EAAIguB,IAAe+L,GAAO,MACjC34B,KAAK9B,EAASU,GAAM1B,EAAQy7B,EAAO,IAGrC,OAAOz6B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU48B,YACjB/6B,EAAO7B,UAAU68B,YAAc,SAAsBz9B,EAAOgB,EAAQ0uB,EAAY0L,GAC9Ep7B,GAASA,EACTgB,KAAoB,EACpB0uB,KAA4B,EACvB0L,GAEHP,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EADb3tB,KAAKC,IAAI,EAAG,EAAI0tB,GAAc,EACK,GAGtD,IAAIhuB,EAAIguB,EAAa,EACjB+L,EAAM,EAEV,IADA34B,KAAK9B,EAASU,GAAa,IAAR1B,IACV0B,GAAK,IAAM+5B,GAAO,MACzB34B,KAAK9B,EAASU,GAAM1B,EAAQy7B,EAAO,IAGrC,OAAOz6B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU88B,WACjBj7B,EAAO7B,UAAU+8B,WAAa,SAAqB39B,EAAOgB,EAAQo6B,GAKhE,OAJAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,IAAM,GACtD8B,KAAK9B,GAAmB,IAARhB,EACTgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUg9B,cACjBn7B,EAAO7B,UAAUi9B,cAAgB,SAAwB79B,EAAOgB,EAAQo6B,GAMtE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,MAAQ,GACxD8B,KAAK9B,GAAmB,IAARhB,EAChB8C,KAAK9B,EAAS,GAAMhB,IAAU,EACvBgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUk9B,cACjBr7B,EAAO7B,UAAUm9B,cAAgB,SAAwB/9B,EAAOgB,EAAQo6B,GAMtE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,MAAQ,GACxD8B,KAAK9B,GAAWhB,IAAU,EAC1B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUo9B,cACjBv7B,EAAO7B,UAAUq9B,cAAgB,SAAwBj+B,EAAOgB,EAAQo6B,GAQtE,OAPAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,WAAY,GAC5D8B,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,GAAmB,IAARhB,EACTgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUs9B,cACjBz7B,EAAO7B,UAAUqD,cAAgB,SAAwBjE,EAAOgB,EAAQo6B,GAQtE,OAPAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,WAAY,GAC5D8B,KAAK9B,GAAWhB,IAAU,GAC1B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EA8CAyB,EAAO7B,UAAUu9B,iBAAmB7B,EAAmB,SAA2Bt8B,EAAOgB,EAAS,GAChG,OAAO85B,EAAeh4B,KAAM9C,EAAOgB,EAAQ4F,OAAO,GAAIA,OAAO,sBAC/D,GAEAnE,EAAO7B,UAAUw9B,iBAAmB9B,EAAmB,SAA2Bt8B,EAAOgB,EAAS,GAChG,OAAOg6B,EAAel4B,KAAM9C,EAAOgB,EAAQ4F,OAAO,GAAIA,OAAO,sBAC/D,GAEAnE,EAAO7B,UAAUy9B,WAAa,SAAqBr+B,EAAOgB,EAAQ0uB,EAAY0L,GAG5E,GAFAp7B,GAASA,EACTgB,KAAoB,GACfo6B,EAAU,CACb,MAAMkD,EAAQv8B,KAAKC,IAAI,EAAI,EAAI0tB,EAAc,GAE7CmL,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EAAY4O,EAAQ,GAAIA,EACxD,CAEA,IAAI58B,EAAI,EACJ+5B,EAAM,EACN8C,EAAM,EAEV,IADAz7B,KAAK9B,GAAkB,IAARhB,IACN0B,EAAIguB,IAAe+L,GAAO,MAC7Bz7B,EAAQ,GAAa,IAARu+B,GAAsC,IAAzBz7B,KAAK9B,EAASU,EAAI,KAC9C68B,EAAM,GAERz7B,KAAK9B,EAASU,IAAO1B,EAAQy7B,EAAQ,GAAK8C,EAAM,IAGlD,OAAOv9B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU49B,WAAa,SAAqBx+B,EAAOgB,EAAQ0uB,EAAY0L,GAG5E,GAFAp7B,GAASA,EACTgB,KAAoB,GACfo6B,EAAU,CACb,MAAMkD,EAAQv8B,KAAKC,IAAI,EAAI,EAAI0tB,EAAc,GAE7CmL,EAAS/3B,KAAM9C,EAAOgB,EAAQ0uB,EAAY4O,EAAQ,GAAIA,EACxD,CAEA,IAAI58B,EAAIguB,EAAa,EACjB+L,EAAM,EACN8C,EAAM,EAEV,IADAz7B,KAAK9B,EAASU,GAAa,IAAR1B,IACV0B,GAAK,IAAM+5B,GAAO,MACrBz7B,EAAQ,GAAa,IAARu+B,GAAsC,IAAzBz7B,KAAK9B,EAASU,EAAI,KAC9C68B,EAAM,GAERz7B,KAAK9B,EAASU,IAAO1B,EAAQy7B,EAAQ,GAAK8C,EAAM,IAGlD,OAAOv9B,EAAS0uB,CAClB,EAEAjtB,EAAO7B,UAAU69B,UAAY,SAAoBz+B,EAAOgB,EAAQo6B,GAM9D,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,KAAO,KACnDhB,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtC8C,KAAK9B,GAAmB,IAARhB,EACTgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAU89B,aAAe,SAAuB1+B,EAAOgB,EAAQo6B,GAMpE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,OAAS,OACzD8B,KAAK9B,GAAmB,IAARhB,EAChB8C,KAAK9B,EAAS,GAAMhB,IAAU,EACvBgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAU+9B,aAAe,SAAuB3+B,EAAOgB,EAAQo6B,GAMpE,OALAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,OAAS,OACzD8B,KAAK9B,GAAWhB,IAAU,EAC1B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUg+B,aAAe,SAAuB5+B,EAAOgB,EAAQo6B,GAQpE,OAPAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,YAAa,YAC7D8B,KAAK9B,GAAmB,IAARhB,EAChB8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,GACvBgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAU6tB,aAAe,SAAuBzuB,EAAOgB,EAAQo6B,GASpE,OARAp7B,GAASA,EACTgB,KAAoB,EACfo6B,GAAUP,EAAS/3B,KAAM9C,EAAOgB,EAAQ,EAAG,YAAa,YACzDhB,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5C8C,KAAK9B,GAAWhB,IAAU,GAC1B8C,KAAK9B,EAAS,GAAMhB,IAAU,GAC9B8C,KAAK9B,EAAS,GAAMhB,IAAU,EAC9B8C,KAAK9B,EAAS,GAAc,IAARhB,EACbgB,EAAS,CAClB,EAEAyB,EAAO7B,UAAUi+B,gBAAkBvC,EAAmB,SAA0Bt8B,EAAOgB,EAAS,GAC9F,OAAO85B,EAAeh4B,KAAM9C,EAAOgB,GAAS4F,OAAO,sBAAuBA,OAAO,sBACnF,GAEAnE,EAAO7B,UAAUk+B,gBAAkBxC,EAAmB,SAA0Bt8B,EAAOgB,EAAS,GAC9F,OAAOg6B,EAAel4B,KAAM9C,EAAOgB,GAAS4F,OAAO,sBAAuBA,OAAO,sBACnF,GAiBAnE,EAAO7B,UAAUm+B,aAAe,SAAuB/+B,EAAOgB,EAAQo6B,GACpE,OAAOF,EAAWp4B,KAAM9C,EAAOgB,GAAQ,EAAMo6B,EAC/C,EAEA34B,EAAO7B,UAAUo+B,aAAe,SAAuBh/B,EAAOgB,EAAQo6B,GACpE,OAAOF,EAAWp4B,KAAM9C,EAAOgB,GAAQ,EAAOo6B,EAChD,EAYA34B,EAAO7B,UAAUq+B,cAAgB,SAAwBj/B,EAAOgB,EAAQo6B,GACtE,OAAOC,EAAYv4B,KAAM9C,EAAOgB,GAAQ,EAAMo6B,EAChD,EAEA34B,EAAO7B,UAAUs+B,cAAgB,SAAwBl/B,EAAOgB,EAAQo6B,GACtE,OAAOC,EAAYv4B,KAAM9C,EAAOgB,GAAQ,EAAOo6B,EACjD,EAGA34B,EAAO7B,UAAUkU,KAAO,SAAemlB,EAAQkF,EAAalM,EAAOpe,GACjE,IAAKpS,EAAOqtB,SAASmK,GAAS,MAAM,IAAIhqB,UAAU,+BAQlD,GAPKgjB,IAAOA,EAAQ,GACfpe,GAAe,IAARA,IAAWA,EAAM/R,KAAK5C,QAC9Bi/B,GAAelF,EAAO/5B,SAAQi/B,EAAclF,EAAO/5B,QAClDi/B,IAAaA,EAAc,GAC5BtqB,EAAM,GAAKA,EAAMoe,IAAOpe,EAAMoe,GAG9Bpe,IAAQoe,EAAO,OAAO,EAC1B,GAAsB,IAAlBgH,EAAO/5B,QAAgC,IAAhB4C,KAAK5C,OAAc,OAAO,EAGrD,GAAIi/B,EAAc,EAChB,MAAM,IAAI7hB,WAAW,6BAEvB,GAAI2V,EAAQ,GAAKA,GAASnwB,KAAK5C,OAAQ,MAAM,IAAIod,WAAW,sBAC5D,GAAIzI,EAAM,EAAG,MAAM,IAAIyI,WAAW,2BAG9BzI,EAAM/R,KAAK5C,SAAQ2U,EAAM/R,KAAK5C,QAC9B+5B,EAAO/5B,OAASi/B,EAActqB,EAAMoe,IACtCpe,EAAMolB,EAAO/5B,OAASi/B,EAAclM,GAGtC,MAAM/c,EAAMrB,EAAMoe,EAalB,OAXInwB,OAASm3B,GAAqD,mBAApC9zB,WAAWvF,UAAUw+B,WAEjDt8B,KAAKs8B,WAAWD,EAAalM,EAAOpe,GAEpC1O,WAAWvF,UAAUkwB,IAAIjwB,KACvBo5B,EACAn3B,KAAKoV,SAAS+a,EAAOpe,GACrBsqB,GAIGjpB,CACT,EAMAzT,EAAO7B,UAAUmD,KAAO,SAAeizB,EAAK/D,EAAOpe,EAAK1E,GAEtD,GAAmB,iBAAR6mB,EAAkB,CAS3B,GARqB,iBAAV/D,GACT9iB,EAAW8iB,EACXA,EAAQ,EACRpe,EAAM/R,KAAK5C,QACa,iBAAR2U,IAChB1E,EAAW0E,EACXA,EAAM/R,KAAK5C,aAEIuE,IAAb0L,GAA8C,iBAAbA,EACnC,MAAM,IAAIF,UAAU,6BAEtB,GAAwB,iBAAbE,IAA0B1N,EAAO2yB,WAAWjlB,GACrD,MAAM,IAAIF,UAAU,qBAAuBE,GAE7C,GAAmB,IAAf6mB,EAAI92B,OAAc,CACpB,MAAMioB,EAAO6O,EAAIte,WAAW,IACV,SAAbvI,GAAuBgY,EAAO,KAClB,WAAbhY,KAEF6mB,EAAM7O,EAEV,CACF,KAA0B,iBAAR6O,EAChBA,GAAY,IACY,kBAARA,IAChBA,EAAM/uB,OAAO+uB,IAIf,GAAI/D,EAAQ,GAAKnwB,KAAK5C,OAAS+yB,GAASnwB,KAAK5C,OAAS2U,EACpD,MAAM,IAAIyI,WAAW,sBAGvB,GAAIzI,GAAOoe,EACT,OAAOnwB,KAQT,IAAIpB,EACJ,GANAuxB,KAAkB,EAClBpe,OAAcpQ,IAARoQ,EAAoB/R,KAAK5C,OAAS2U,IAAQ,EAE3CmiB,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKt1B,EAAIuxB,EAAOvxB,EAAImT,IAAOnT,EACzBoB,KAAKpB,GAAKs1B,MAEP,CACL,MAAM0D,EAAQj4B,EAAOqtB,SAASkH,GAC1BA,EACAv0B,EAAOqN,KAAKknB,EAAK7mB,GACf+F,EAAMwkB,EAAMx6B,OAClB,GAAY,IAARgW,EACF,MAAM,IAAIjG,UAAU,cAAgB+mB,EAClC,qCAEJ,IAAKt1B,EAAI,EAAGA,EAAImT,EAAMoe,IAASvxB,EAC7BoB,KAAKpB,EAAIuxB,GAASyH,EAAMh5B,EAAIwU,EAEhC,CAEA,OAAOpT,IACT,EAMA,MAAMu8B,EAAS,CAAC,EAChB,SAASC,EAAG7uB,EAAK8uB,EAAYC,GAC3BH,EAAO5uB,GAAO,cAAwB+uB,EACpC,WAAA/iB,GACEgjB,QAEAtzB,OAAOC,eAAetJ,KAAM,UAAW,CACrC9C,MAAOu/B,EAAWvzB,MAAMlJ,KAAM7C,WAC9BS,UAAU,EACVF,cAAc,IAIhBsC,KAAKsG,KAAO,GAAGtG,KAAKsG,SAASqH,KAG7B3N,KAAK48B,aAEE58B,KAAKsG,IACd,CAEA,QAAI+e,GACF,OAAO1X,CACT,CAEA,QAAI0X,CAAMnoB,GACRmM,OAAOC,eAAetJ,KAAM,OAAQ,CAClCtC,cAAc,EACdC,YAAY,EACZT,QACAU,UAAU,GAEd,CAEA,QAAA4D,GACE,MAAO,GAAGxB,KAAKsG,SAASqH,OAAS3N,KAAKia,SACxC,EAEJ,CA+BA,SAAS4iB,EAAuB3I,GAC9B,IAAI5O,EAAM,GACN1mB,EAAIs1B,EAAI92B,OACZ,MAAM+yB,EAAmB,MAAX+D,EAAI,GAAa,EAAI,EACnC,KAAOt1B,GAAKuxB,EAAQ,EAAGvxB,GAAK,EAC1B0mB,EAAM,IAAI4O,EAAI/sB,MAAMvI,EAAI,EAAGA,KAAK0mB,IAElC,MAAO,GAAG4O,EAAI/sB,MAAM,EAAGvI,KAAK0mB,GAC9B,CAYA,SAAS2S,EAAY/6B,EAAO2D,EAAKqB,EAAKoL,EAAKpP,EAAQ0uB,GACjD,GAAI1vB,EAAQgF,GAAOhF,EAAQ2D,EAAK,CAC9B,MAAMwS,EAAmB,iBAARxS,EAAmB,IAAM,GAC1C,IAAIoY,EAWJ,MARIA,EAFA2T,EAAa,EACH,IAAR/rB,GAAaA,IAAQiD,OAAO,GACtB,OAAOuP,YAAYA,QAA2B,GAAlBuZ,EAAa,KAASvZ,IAElD,SAASA,QAA2B,GAAlBuZ,EAAa,GAAS,IAAIvZ,iBACtB,GAAlBuZ,EAAa,GAAS,IAAIvZ,IAGhC,MAAMxS,IAAMwS,YAAYnR,IAAMmR,IAElC,IAAIkpB,EAAOO,iBAAiB,QAAS7jB,EAAO/b,EACpD,EAtBF,SAAsBoQ,EAAKpP,EAAQ0uB,GACjC6M,EAAev7B,EAAQ,eACHyD,IAAhB2L,EAAIpP,SAAsDyD,IAA7B2L,EAAIpP,EAAS0uB,IAC5C8M,EAAYx7B,EAAQoP,EAAIlQ,QAAUwvB,EAAa,GAEnD,CAkBEmQ,CAAYzvB,EAAKpP,EAAQ0uB,EAC3B,CAEA,SAAS6M,EAAgBv8B,EAAOoJ,GAC9B,GAAqB,iBAAVpJ,EACT,MAAM,IAAIq/B,EAAOS,qBAAqB12B,EAAM,SAAUpJ,EAE1D,CAEA,SAASw8B,EAAax8B,EAAOE,EAAQoZ,GACnC,GAAIvX,KAAKO,MAAMtC,KAAWA,EAExB,MADAu8B,EAAev8B,EAAOsZ,GAChB,IAAI+lB,EAAOO,iBAAiBtmB,GAAQ,SAAU,aAActZ,GAGpE,GAAIE,EAAS,EACX,MAAM,IAAIm/B,EAAOU,yBAGnB,MAAM,IAAIV,EAAOO,iBAAiBtmB,GAAQ,SACR,MAAMA,EAAO,EAAI,YAAYpZ,IAC7BF,EACpC,CAvFAs/B,EAAE,2BACA,SAAUl2B,GACR,OAAIA,EACK,GAAGA,gCAGL,gDACT,EAAGkU,YACLgiB,EAAE,uBACA,SAAUl2B,EAAMisB,GACd,MAAO,QAAQjsB,4DAA+DisB,GAChF,EAAGplB,WACLqvB,EAAE,mBACA,SAAUjnB,EAAK0D,EAAO1G,GACpB,IAAIpB,EAAM,iBAAiBoE,sBACvB2nB,EAAW3qB,EAWf,OAVIpN,OAAOmF,UAAUiI,IAAUtT,KAAKK,IAAIiT,GAAS,GAAK,GACpD2qB,EAAWL,EAAsBj3B,OAAO2M,IACd,iBAAVA,IAChB2qB,EAAWt3B,OAAO2M,IACdA,EAAQzO,OAAO,IAAMA,OAAO,KAAOyO,IAAUzO,OAAO,IAAMA,OAAO,QACnEo5B,EAAWL,EAAsBK,IAEnCA,GAAY,KAEd/rB,GAAO,eAAe8H,eAAmBikB,IAClC/rB,CACT,EAAGqJ,YAiEL,MAAM2iB,EAAoB,oBAgB1B,SAAS7J,EAAazrB,EAAQytB,GAE5B,IAAIK,EADJL,EAAQA,GAASt2B,IAEjB,MAAM5B,EAASyK,EAAOzK,OACtB,IAAIggC,EAAgB,KACpB,MAAMxF,EAAQ,GAEd,IAAK,IAAIh5B,EAAI,EAAGA,EAAIxB,IAAUwB,EAAG,CAI/B,GAHA+2B,EAAY9tB,EAAO+N,WAAWhX,GAG1B+2B,EAAY,OAAUA,EAAY,MAAQ,CAE5C,IAAKyH,EAAe,CAElB,GAAIzH,EAAY,MAAQ,EAEjBL,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAC9C,QACF,CAAO,GAAIvN,EAAI,IAAMxB,EAAQ,EAEtBk4B,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAC9C,QACF,CAGAixB,EAAgBzH,EAEhB,QACF,CAGA,GAAIA,EAAY,MAAQ,EACjBL,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAC9CixB,EAAgBzH,EAChB,QACF,CAGAA,EAAkE,OAArDyH,EAAgB,OAAU,GAAKzH,EAAY,MAC1D,MAAWyH,IAEJ9H,GAAS,IAAM,GAAGsC,EAAMzrB,KAAK,IAAM,IAAM,KAMhD,GAHAixB,EAAgB,KAGZzH,EAAY,IAAM,CACpB,IAAKL,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KAAKwpB,EACb,MAAO,GAAIA,EAAY,KAAO,CAC5B,IAAKL,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KACJwpB,GAAa,EAAM,IACP,GAAZA,EAAmB,IAEvB,MAAO,GAAIA,EAAY,MAAS,CAC9B,IAAKL,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KACJwpB,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAEvB,KAAO,MAAIA,EAAY,SASrB,MAAM,IAAIl0B,MAAM,sBARhB,IAAK6zB,GAAS,GAAK,EAAG,MACtBsC,EAAMzrB,KACJwpB,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAIvB,CACF,CAEA,OAAOiC,CACT,CA2BA,SAASrE,EAAehe,GACtB,OAAOwc,EAAOd,YAxHhB,SAAsB1b,GAMpB,IAFAA,GAFAA,EAAMA,EAAI0G,MAAM,KAAK,IAEXib,OAAOjwB,QAAQk2B,EAAmB,KAEpC//B,OAAS,EAAG,MAAO,GAE3B,KAAOmY,EAAInY,OAAS,GAAM,GACxBmY,GAAY,IAEd,OAAOA,CACT,CA4G4B8nB,CAAY9nB,GACxC,CAEA,SAASyf,EAAYroB,EAAKC,EAAK1O,EAAQd,GACrC,IAAIwB,EACJ,IAAKA,EAAI,EAAGA,EAAIxB,KACTwB,EAAIV,GAAU0O,EAAIxP,QAAYwB,GAAK+N,EAAIvP,UADpBwB,EAExBgO,EAAIhO,EAAIV,GAAUyO,EAAI/N,GAExB,OAAOA,CACT,CAKA,SAAS8zB,EAAY11B,EAAKwZ,GACxB,OAAOxZ,aAAewZ,GACZ,MAAPxZ,GAAkC,MAAnBA,EAAI2c,aAA+C,MAAxB3c,EAAI2c,YAAYrT,MACzDtJ,EAAI2c,YAAYrT,OAASkQ,EAAKlQ,IACpC,CACA,SAAS0sB,EAAah2B,GAEpB,OAAOA,GAAQA,CACjB,CAIA,MAAM26B,EAAsB,WAC1B,MAAM2F,EAAW,mBACX3mB,EAAQ,IAAIlT,MAAM,KACxB,IAAK,IAAI7E,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,MAAM2+B,EAAU,GAAJ3+B,EACZ,IAAK,IAAIgoB,EAAI,EAAGA,EAAI,KAAMA,EACxBjQ,EAAM4mB,EAAM3W,GAAK0W,EAAS1+B,GAAK0+B,EAAS1W,EAE5C,CACA,OAAOjQ,CACR,CAV2B,GAa5B,SAAS6iB,EAAoBjzB,GAC3B,MAAyB,oBAAXzC,OAAyB05B,EAAyBj3B,CAClE,CAEA,SAASi3B,IACP,MAAM,IAAI/7B,MAAM,uBAClB,C,8BCpiEA,IAkgCIg8B,EAlgCAtvB,EAAU,EAAQ,MAClBuvB,EAAU,EAAQ,MAClBtvB,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClB8C,EAAU,EAAQ,MAuBlB3C,GAAmB,EAwDnBiV,EAAY,IACZka,EAAgB,IAQhBC,EAAa,IACbC,EAAa,IACbC,EAAe,IASnB,SAAStyB,EAAIuF,EAAMgtB,GAEjB,OADAhtB,EAAKI,IAAMA,EAAI4sB,GACRA,CACT,CAEA,SAASjU,EAAKnC,GACZ,OAAQ,GAAO,IAAM,EAAM,EAAI,EAAI,EACrC,CAEA,SAAS5E,EAAKzV,GAA6B,IAAtB,IAAI8F,EAAM9F,EAAIlQ,SAAiBgW,GAAO,GAAK9F,EAAI8F,GAAO,CAAK,CAShF,SAAS4qB,EAAcjtB,GACrB,IAAIjS,EAAIiS,EAAKC,MAGToC,EAAMtU,EAAEgmB,QACR1R,EAAMrC,EAAK4C,YACbP,EAAMrC,EAAK4C,WAED,IAARP,IAEJjF,EAAMgE,SAASpB,EAAKyB,OAAQ1T,EAAE+lB,YAAa/lB,EAAEm/B,YAAa7qB,EAAKrC,EAAK2C,UACpE3C,EAAK2C,UAAYN,EACjBtU,EAAEm/B,aAAe7qB,EACjBrC,EAAKG,WAAakC,EAClBrC,EAAK4C,WAAaP,EAClBtU,EAAEgmB,SAAW1R,EACK,IAAdtU,EAAEgmB,UACJhmB,EAAEm/B,YAAc,GAEpB,CAGA,SAASC,EAAiBp/B,EAAGiJ,GAC3B21B,EAAMvU,gBAAgBrqB,EAAIA,EAAEq/B,aAAe,EAAIr/B,EAAEq/B,aAAe,EAAIr/B,EAAEs/B,SAAWt/B,EAAEq/B,YAAap2B,GAChGjJ,EAAEq/B,YAAcr/B,EAAEs/B,SAClBJ,EAAcl/B,EAAEiS,KAClB,CAGA,SAASstB,EAASv/B,EAAGksB,GACnBlsB,EAAE+lB,YAAY/lB,EAAEgmB,WAAakG,CAC/B,CAQA,SAASsT,EAAYx/B,EAAGksB,GAGtBlsB,EAAE+lB,YAAY/lB,EAAEgmB,WAAckG,IAAM,EAAK,IACzClsB,EAAE+lB,YAAY/lB,EAAEgmB,WAAiB,IAAJkG,CAC/B,CAUA,SAASuT,EAASxtB,EAAMzD,EAAK6iB,EAAO/iB,GAClC,IAAIgG,EAAMrC,EAAK0C,SAGf,OADIL,EAAMhG,IAAQgG,EAAMhG,GACZ,IAARgG,EAAoB,GAExBrC,EAAK0C,UAAYL,EAGjBjF,EAAMgE,SAAS7E,EAAKyD,EAAKwB,MAAOxB,EAAK6C,QAASR,EAAK+c,GAC3B,IAApBpf,EAAKC,MAAMjC,KACbgC,EAAKK,MAAQhD,EAAQ2C,EAAKK,MAAO9D,EAAK8F,EAAK+c,GAGhB,IAApBpf,EAAKC,MAAMjC,OAClBgC,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAO9D,EAAK8F,EAAK+c,IAG3Cpf,EAAK6C,SAAWR,EAChBrC,EAAKE,UAAYmC,EAEVA,EACT,CAYA,SAASorB,EAAc1/B,EAAG2/B,GACxB,IAEIx2B,EACAmL,EAHAsrB,EAAe5/B,EAAE6/B,iBACjBC,EAAO9/B,EAAEs/B,SAGTS,EAAW//B,EAAEggC,YACbC,EAAajgC,EAAEigC,WACfvD,EAAS18B,EAAEs/B,SAAYt/B,EAAEkgC,OAASrB,EAClC7+B,EAAEs/B,UAAYt/B,EAAEkgC,OAASrB,GAAiB,EAE1CsB,EAAOngC,EAAE4Q,OAETwvB,EAAQpgC,EAAEqgC,OACV5yB,EAAQzN,EAAEyN,KAMV6yB,EAAStgC,EAAEs/B,SAAW3a,EACtB4b,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,GAQzB//B,EAAEggC,aAAehgC,EAAEygC,aACrBb,IAAiB,GAKfK,EAAajgC,EAAE0gC,YAAaT,EAAajgC,EAAE0gC,WAI/C,GAaE,GAAIP,GAXJh3B,EAAQw2B,GAWSI,KAAkBS,GAC/BL,EAAKh3B,EAAQ42B,EAAW,KAAOQ,GAC/BJ,EAAKh3B,KAA0Bg3B,EAAKL,IACpCK,IAAOh3B,KAAwBg3B,EAAKL,EAAO,GAH/C,CAaAA,GAAQ,EACR32B,IAMA,UAESg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1Dg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1Dg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1Dg3B,IAAOL,KAAUK,IAAOh3B,IAAUg3B,IAAOL,KAAUK,IAAOh3B,IAC1D22B,EAAOQ,GAOhB,GAHAhsB,EAAMqQ,GAAa2b,EAASR,GAC5BA,EAAOQ,EAAS3b,EAEZrQ,EAAMyrB,EAAU,CAGlB,GAFA//B,EAAE2gC,YAAchB,EAChBI,EAAWzrB,EACPA,GAAO2rB,EACT,MAEFM,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,EAC3B,CApCA,SAqCQJ,EAAYlyB,EAAKkyB,EAAYS,IAAU1D,GAA4B,MAAjBkD,GAE5D,OAAIG,GAAY//B,EAAE0gC,UACTX,EAEF//B,EAAE0gC,SACX,CAaA,SAASE,EAAY5gC,GACnB,IACI4b,EAAGrH,EAAG9U,EAAGohC,EAAMpqB,EADfqqB,EAAU9gC,EAAEkgC,OAKhB,EAAG,CAqBD,GApBAW,EAAO7gC,EAAE+gC,YAAc/gC,EAAE0gC,UAAY1gC,EAAEs/B,SAoBnCt/B,EAAEs/B,UAAYwB,GAAWA,EAAUjC,GAAgB,CAErDxvB,EAAMgE,SAASrT,EAAE4Q,OAAQ5Q,EAAE4Q,OAAQkwB,EAASA,EAAS,GACrD9gC,EAAE2gC,aAAeG,EACjB9gC,EAAEs/B,UAAYwB,EAEd9gC,EAAEq/B,aAAeyB,EAUjBllB,EADArH,EAAIvU,EAAEghC,UAEN,GACEvhC,EAAIO,EAAEuQ,OAAOqL,GACb5b,EAAEuQ,KAAKqL,GAAMnc,GAAKqhC,EAAUrhC,EAAIqhC,EAAU,UACjCvsB,GAGXqH,EADArH,EAAIusB,EAEJ,GACErhC,EAAIO,EAAEyN,OAAOmO,GACb5b,EAAEyN,KAAKmO,GAAMnc,GAAKqhC,EAAUrhC,EAAIqhC,EAAU,UAIjCvsB,GAEXssB,GAAQC,CACV,CACA,GAAwB,IAApB9gC,EAAEiS,KAAK0C,SACT,MAmBF,GAJAJ,EAAIkrB,EAASz/B,EAAEiS,KAAMjS,EAAE4Q,OAAQ5Q,EAAEs/B,SAAWt/B,EAAE0gC,UAAWG,GACzD7gC,EAAE0gC,WAAansB,EAGXvU,EAAE0gC,UAAY1gC,EAAEihC,QAjUR,EA0UV,IARAxqB,EAAMzW,EAAEs/B,SAAWt/B,EAAEihC,OACrBjhC,EAAEkhC,MAAQlhC,EAAE4Q,OAAO6F,GAGnBzW,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO6F,EAAM,IAAMzW,EAAEohC,UAIvDphC,EAAEihC,SAEPjhC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO6F,EA5UxC,EA4U0D,IAAMzW,EAAEohC,UAE1EphC,EAAEyN,KAAKgJ,EAAMzW,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OAClClhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASzqB,EAClBA,IACAzW,EAAEihC,WACEjhC,EAAE0gC,UAAY1gC,EAAEihC,OAlVZ,MA2Vd,OAASjhC,EAAE0gC,UAAY7B,GAAqC,IAApB7+B,EAAEiS,KAAK0C,SAsCjD,CA6GA,SAAS0sB,EAAarhC,EAAGwT,GAIvB,IAHA,IAAI8tB,EACAC,IAEK,CAMP,GAAIvhC,EAAE0gC,UAAY7B,EAAe,CAE/B,GADA+B,EAAY5gC,GACRA,EAAE0gC,UAAY7B,GAjkBF,IAikBmBrrB,EACjC,OA7egB,EA+elB,GAAoB,IAAhBxT,EAAE0gC,UACJ,KAEJ,CAyBA,GApBAY,EAAY,EACRthC,EAAE0gC,WAtgBM,IAwgBV1gC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SAxgBxC,EAwgB+D,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,UAOJ,IAAdgC,GAA4BthC,EAAEs/B,SAAWgC,GAAethC,EAAEkgC,OAASrB,IAKrE7+B,EAAEwhC,aAAe9B,EAAc1/B,EAAGshC,IAGhCthC,EAAEwhC,cAzhBM,EAqiBV,GAPAD,EAAS3C,EAAM1T,UAAUlrB,EAAGA,EAAEs/B,SAAWt/B,EAAE2gC,YAAa3gC,EAAEwhC,aA9hBhD,GAgiBVxhC,EAAE0gC,WAAa1gC,EAAEwhC,aAKbxhC,EAAEwhC,cAAgBxhC,EAAEyhC,gBAAuCzhC,EAAE0gC,WAriBvD,EAqiB+E,CACvF1gC,EAAEwhC,eACF,GACExhC,EAAEs/B,WAEFt/B,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SA1iB5C,EA0iBmE,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,eAKQ,MAAnBt/B,EAAEwhC,cACbxhC,EAAEs/B,UACJ,MAEEt/B,EAAEs/B,UAAYt/B,EAAEwhC,aAChBxhC,EAAEwhC,aAAe,EACjBxhC,EAAEkhC,MAAQlhC,EAAE4Q,OAAO5Q,EAAEs/B,UAErBt/B,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SAAW,IAAMt/B,EAAEohC,eAavEG,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,WAE1Ct/B,EAAE0gC,YACF1gC,EAAEs/B,WAEJ,GAAIiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OAjkBgB,CAqkBtB,CAEA,OADA7U,EAAEihC,OAAWjhC,EAAEs/B,SAAW,EAAmBt/B,EAAEs/B,SAAWoC,EAvpBtC,IAwpBhBluB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UAxkBS,EACA,GA6kBlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WAnlBS,EACA,CAwlBxB,CAOA,SAAS8sB,EAAa3hC,EAAGwT,GAOvB,IANA,IAAI8tB,EACAC,EAEAK,IAGK,CAMP,GAAI5hC,EAAE0gC,UAAY7B,EAAe,CAE/B,GADA+B,EAAY5gC,GACRA,EAAE0gC,UAAY7B,GApsBF,IAosBmBrrB,EACjC,OAhnBgB,EAknBlB,GAAoB,IAAhBxT,EAAE0gC,UAAmB,KAC3B,CAyCA,GApCAY,EAAY,EACRthC,EAAE0gC,WAvoBM,IAyoBV1gC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SAzoBxC,EAyoB+D,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,UAMtBt/B,EAAEggC,YAAchgC,EAAEwhC,aAClBxhC,EAAE6hC,WAAa7hC,EAAE2gC,YACjB3gC,EAAEwhC,aAAeE,EAEC,IAAdJ,GAA0BthC,EAAEggC,YAAchgC,EAAEyhC,gBAC5CzhC,EAAEs/B,SAAWgC,GAActhC,EAAEkgC,OAASrB,IAKxC7+B,EAAEwhC,aAAe9B,EAAc1/B,EAAGshC,GAG9BthC,EAAEwhC,cAAgB,IAvsBA,IAwsBlBxhC,EAAEuiB,UA/pBI,IA+pBwBviB,EAAEwhC,cAA8BxhC,EAAEs/B,SAAWt/B,EAAE2gC,YAAc,QAK7F3gC,EAAEwhC,aAAeE,IAMjB1hC,EAAEggC,aA1qBM,GA0qBsBhgC,EAAEwhC,cAAgBxhC,EAAEggC,YAAa,CACjE4B,EAAa5hC,EAAEs/B,SAAWt/B,EAAE0gC,UA3qBlB,EAkrBVa,EAAS3C,EAAM1T,UAAUlrB,EAAGA,EAAEs/B,SAAW,EAAIt/B,EAAE6hC,WAAY7hC,EAAEggC,YAlrBnD,GAwrBVhgC,EAAE0gC,WAAa1gC,EAAEggC,YAAc,EAC/BhgC,EAAEggC,aAAe,EACjB,KACQhgC,EAAEs/B,UAAYsC,IAElB5hC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO5Q,EAAEs/B,SA7rB5C,EA6rBmE,IAAMt/B,EAAEohC,UACjFE,EAAYthC,EAAEyN,KAAKzN,EAAEs/B,SAAWt/B,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OACrDlhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASlhC,EAAEs/B,gBAGK,MAAlBt/B,EAAEggC,aAKb,GAJAhgC,EAAE8hC,gBAAkB,EACpB9hC,EAAEwhC,aAAeE,EACjB1hC,EAAEs/B,WAEEiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA7rBc,CAksBpB,MAAO,GAAI7U,EAAE8hC,iBAgBX,IATAP,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,SAAW,MAInDF,EAAiBp/B,GAAG,GAGtBA,EAAEs/B,WACFt/B,EAAE0gC,YACuB,IAArB1gC,EAAEiS,KAAK4C,UACT,OAntBgB,OAytBlB7U,EAAE8hC,gBAAkB,EACpB9hC,EAAEs/B,WACFt/B,EAAE0gC,WAEN,CAUA,OARI1gC,EAAE8hC,kBAGJP,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,SAAW,IAErDt/B,EAAE8hC,gBAAkB,GAEtB9hC,EAAEihC,OAASjhC,EAAEs/B,SAAWoC,EAAgB1hC,EAAEs/B,SAAWoC,EAvzBjC,IAwzBhBluB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UAxuBS,EACA,GA6uBlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WAnvBS,EACA,CAyvBxB,CAgKA,SAASktB,EAAOC,EAAaC,EAAUC,EAAaC,EAAWj4B,GAC7DhJ,KAAK8gC,YAAcA,EACnB9gC,KAAK+gC,SAAWA,EAChB/gC,KAAKghC,YAAcA,EACnBhhC,KAAKihC,UAAYA,EACjBjhC,KAAKgJ,KAAOA,CACd,CA8CA,SAASk4B,IACPlhC,KAAK+Q,KAAO,KACZ/Q,KAAK2hB,OAAS,EACd3hB,KAAK6kB,YAAc,KACnB7kB,KAAKmhC,iBAAmB,EACxBnhC,KAAKi+B,YAAc,EACnBj+B,KAAK8kB,QAAU,EACf9kB,KAAK+O,KAAO,EACZ/O,KAAKohC,OAAS,KACdphC,KAAKqhC,QAAU,EACfrhC,KAAKkhB,OAjgCW,EAkgChBlhB,KAAKshC,YAAc,EAEnBthC,KAAKg/B,OAAS,EACdh/B,KAAKuhC,OAAS,EACdvhC,KAAKm/B,OAAS,EAEdn/B,KAAK0P,OAAS,KAQd1P,KAAK6/B,YAAc,EAKnB7/B,KAAKuM,KAAO,KAMZvM,KAAKqP,KAAO,KAEZrP,KAAKggC,MAAQ,EACbhgC,KAAK8/B,UAAY,EACjB9/B,KAAKwhC,UAAY,EACjBxhC,KAAKkgC,UAAY,EAEjBlgC,KAAKigC,WAAa,EAOlBjgC,KAAKm+B,YAAc,EAKnBn+B,KAAKsgC,aAAe,EACpBtgC,KAAK2gC,WAAa,EAClB3gC,KAAK4gC,gBAAkB,EACvB5gC,KAAKo+B,SAAW,EAChBp+B,KAAKy/B,YAAc,EACnBz/B,KAAKw/B,UAAY,EAEjBx/B,KAAK8+B,YAAc,EAKnB9+B,KAAK2+B,iBAAmB,EAMxB3+B,KAAKugC,eAAiB,EAYtBvgC,KAAKihB,MAAQ,EACbjhB,KAAKqhB,SAAW,EAEhBrhB,KAAKu/B,WAAa,EAGlBv/B,KAAK++B,WAAa,EAYlB/+B,KAAK6lB,UAAa,IAAI1X,EAAMoC,MAAMkxB,MAClCzhC,KAAK8lB,UAAa,IAAI3X,EAAMoC,MAAM,KAClCvQ,KAAK+lB,QAAa,IAAI5X,EAAMoC,MAAM,IAClCwS,EAAK/iB,KAAK6lB,WACV9C,EAAK/iB,KAAK8lB,WACV/C,EAAK/iB,KAAK+lB,SAEV/lB,KAAKgpB,OAAW,KAChBhpB,KAAKipB,OAAW,KAChBjpB,KAAKkpB,QAAW,KAGhBlpB,KAAKwlB,SAAW,IAAIrX,EAAMoC,MAAMmV,IAIhC1lB,KAAK2mB,KAAO,IAAIxY,EAAMoC,MAAM,KAC5BwS,EAAK/iB,KAAK2mB,MAEV3mB,KAAK6mB,SAAW,EAChB7mB,KAAKwnB,SAAW,EAKhBxnB,KAAKumB,MAAQ,IAAIpY,EAAMoC,MAAM,KAC7BwS,EAAK/iB,KAAKumB,OAIVvmB,KAAKonB,MAAQ,EAEbpnB,KAAKiqB,YAAc,EAoBnBjqB,KAAKmmB,SAAW,EAEhBnmB,KAAKmnB,MAAQ,EAMbnnB,KAAKimB,QAAU,EACfjmB,KAAKkmB,WAAa,EAClBlmB,KAAKomB,QAAU,EACfpmB,KAAK+/B,OAAS,EAGd//B,KAAKilB,OAAS,EAIdjlB,KAAKglB,SAAW,CAalB,CAGA,SAAS0c,EAAiB3wB,GACxB,IAAIjS,EAEJ,OAAKiS,GAASA,EAAKC,OAInBD,EAAKE,SAAWF,EAAKG,UAAY,EACjCH,EAAKuD,UAhsCqB,GAksC1BxV,EAAIiS,EAAKC,OACP8T,QAAU,EACZhmB,EAAEm/B,YAAc,EAEZn/B,EAAEiQ,KAAO,IACXjQ,EAAEiQ,MAAQjQ,EAAEiQ,MAGdjQ,EAAE6iB,OAAU7iB,EAAEiQ,KArqCC,GAqqCmB8uB,EAClC9sB,EAAKK,MAAoB,IAAXtS,EAAEiQ,KACd,EAEA,EACFjQ,EAAEwiC,WAvvCkB,EAwvCpB5D,EAAM9U,SAAS9pB,GA5uCK,GAwtCX0M,EAAIuF,EAAMvC,EAsBrB,CAGA,SAASmzB,EAAa5wB,GACpB,IAlPejS,EAkPX2M,EAAMi2B,EAAiB3wB,GAI3B,OAtvCoB,IAmvChBtF,KAnPW3M,EAoPLiS,EAAKC,OAnPb6uB,YAAc,EAAI/gC,EAAEkgC,OAGtBjc,EAAKjkB,EAAEuQ,MAIPvQ,EAAEyhC,eAAiB9C,EAAoB3+B,EAAEmiB,OAAO8f,SAChDjiC,EAAEygC,WAAa9B,EAAoB3+B,EAAEmiB,OAAO6f,YAC5ChiC,EAAEigC,WAAatB,EAAoB3+B,EAAEmiB,OAAO+f,YAC5CliC,EAAE6/B,iBAAmBlB,EAAoB3+B,EAAEmiB,OAAOggB,UAElDniC,EAAEs/B,SAAW,EACbt/B,EAAEq/B,YAAc,EAChBr/B,EAAE0gC,UAAY,EACd1gC,EAAEihC,OAAS,EACXjhC,EAAEwhC,aAAexhC,EAAEggC,YAAc0B,EACjC1hC,EAAE8hC,gBAAkB,EACpB9hC,EAAEkhC,MAAQ,GAmOHv0B,CACT,CAWA,SAASmW,EAAa7Q,EAAMkQ,EAAOC,EAAQ1P,EAAY4P,EAAUC,GAC/D,IAAKtQ,EACH,OAAOvC,EAET,IAAIO,EAAO,EAiBX,IAxwC0B,IAyvCtBkS,IACFA,EAAQ,GAGNzP,EAAa,GACfzC,EAAO,EACPyC,GAAcA,GAGPA,EAAa,KACpBzC,EAAO,EACPyC,GAAc,IAIZ4P,EAAW,GAAKA,EAlvCF,GALF,IAuvCgCF,GAC9C1P,EAAa,GAAKA,EAAa,IAAMyP,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EApwCQ,EAqwCxB,OAAO7V,EAAIuF,EAAMvC,GAIA,IAAfgD,IACFA,EAAa,GAIf,IAAI1S,EAAI,IAAIoiC,EA0CZ,OAxCAnwB,EAAKC,MAAQlS,EACbA,EAAEiS,KAAOA,EAETjS,EAAEiQ,KAAOA,EACTjQ,EAAEsiC,OAAS,KACXtiC,EAAEyiC,OAAS/vB,EACX1S,EAAEkgC,OAAS,GAAKlgC,EAAEyiC,OAClBziC,EAAEqgC,OAASrgC,EAAEkgC,OAAS,EAEtBlgC,EAAE0iC,UAAYpgB,EAAW,EACzBtiB,EAAEghC,UAAY,GAAKhhC,EAAE0iC,UACrB1iC,EAAEohC,UAAYphC,EAAEghC,UAAY,EAC5BhhC,EAAEmhC,eAAiBnhC,EAAE0iC,UAtvCP,EAsvC+B,GAtvC/B,GAwvCd1iC,EAAE4Q,OAAS,IAAIvB,EAAM+D,KAAgB,EAAXpT,EAAEkgC,QAC5BlgC,EAAEuQ,KAAO,IAAIlB,EAAMoC,MAAMzR,EAAEghC,WAC3BhhC,EAAEyN,KAAO,IAAI4B,EAAMoC,MAAMzR,EAAEkgC,QAK3BlgC,EAAEmrB,YAAc,GAAM7I,EAAW,EAEjCtiB,EAAEqiC,iBAAmC,EAAhBriC,EAAEmrB,YAIvBnrB,EAAE+lB,YAAc,IAAI1W,EAAM+D,KAAKpT,EAAEqiC,kBAIjCriC,EAAEqoB,MAAQ,EAAIroB,EAAEmrB,YAGhBnrB,EAAEsoB,MAAQ,EAAUtoB,EAAEmrB,YAEtBnrB,EAAEmiB,MAAQA,EACVniB,EAAEuiB,SAAWA,EACbviB,EAAEoiB,OAASA,EAEJygB,EAAa5wB,EACtB,CAjWA0sB,EAAsB,CAEpB,IAAIoD,EAAO,EAAG,EAAG,EAAG,EAxiBtB,SAAwB/hC,EAAGwT,GAIzB,IAAIsvB,EAAiB,MAOrB,IALIA,EAAiB9iC,EAAEqiC,iBAAmB,IACxCS,EAAiB9iC,EAAEqiC,iBAAmB,KAI/B,CAEP,GAAIriC,EAAE0gC,WAAa,EAAG,CAUpB,GADAE,EAAY5gC,GACQ,IAAhBA,EAAE0gC,WA1eU,IA0eSltB,EACvB,OAtZgB,EAyZlB,GAAoB,IAAhBxT,EAAE0gC,UACJ,KAGJ,CAIA1gC,EAAEs/B,UAAYt/B,EAAE0gC,UAChB1gC,EAAE0gC,UAAY,EAGd,IAAIqC,EAAY/iC,EAAEq/B,YAAcyD,EAEhC,IAAmB,IAAf9iC,EAAEs/B,UAAkBt/B,EAAEs/B,UAAYyD,KAEpC/iC,EAAE0gC,UAAY1gC,EAAEs/B,SAAWyD,EAC3B/iC,EAAEs/B,SAAWyD,EAEb3D,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA9agB,EAubpB,GAAI7U,EAAEs/B,SAAWt/B,EAAEq/B,aAAgBr/B,EAAEkgC,OAASrB,IAE5CO,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA3bgB,CA+btB,CAIA,OAFA7U,EAAEihC,OAAS,EAlhBS,IAohBhBztB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UApcS,EACA,IA0clB7U,EAAEs/B,SAAWt/B,EAAEq/B,cAEjBD,EAAiBp/B,GAAG,GAChBA,EAAEiS,KAAK4C,WAhdS,EAudxB,GAgdE,IAAIktB,EAAO,EAAG,EAAG,EAAG,EAAGV,GACvB,IAAIU,EAAO,EAAG,EAAG,GAAI,EAAGV,GACxB,IAAIU,EAAO,EAAG,EAAG,GAAI,GAAIV,GAEzB,IAAIU,EAAO,EAAG,EAAG,GAAI,GAAIJ,GACzB,IAAII,EAAO,EAAG,GAAI,GAAI,GAAIJ,GAC1B,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,GAC5B,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,GAC5B,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,GAC/B,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,IA2xBjClkC,EAAQulC,YApcR,SAAqB/wB,EAAMkQ,GACzB,OAAOW,EAAa7Q,EAAMkQ,EAjzCV,EAOF,GAEI,EAnBQ,EA4zC5B,EAmcA1kB,EAAQqlB,aAAeA,EACvBrlB,EAAQolC,aAAeA,EACvBplC,EAAQmlC,iBAAmBA,EAC3BnlC,EAAQulB,iBA9hBR,SAA0B/Q,EAAM1B,GAC9B,OAAK0B,GAASA,EAAKC,MACK,IAApBD,EAAKC,MAAMjC,KAAqBP,GACpCuC,EAAKC,MAAMowB,OAAS/xB,EA7vCA,GA2vCeb,CAIrC,EA0hBAjS,EAAQ2lB,QApcR,SAAiBnR,EAAMuB,GACrB,IAAIyvB,EAAWjjC,EACXsxB,EAAK8D,EAET,IAAKnjB,IAASA,EAAKC,OACjBsB,EAj2CkB,GAi2CCA,EAAQ,EAC3B,OAAOvB,EAAOvF,EAAIuF,EAAMvC,GAAkBA,EAK5C,GAFA1P,EAAIiS,EAAKC,OAEJD,EAAKyB,SACJzB,EAAKwB,OAA2B,IAAlBxB,EAAK0C,UACpB3U,EAAE6iB,SAAWmc,GA12CE,IA02CcxrB,EAChC,OAAO9G,EAAIuF,EAA0B,IAAnBA,EAAK4C,WA51CL,EA41CsCnF,GAQ1D,GALA1P,EAAEiS,KAAOA,EACTgxB,EAAYjjC,EAAEwiC,WACdxiC,EAAEwiC,WAAahvB,EAvyCA,KA0yCXxT,EAAE6iB,OAEJ,GAAe,IAAX7iB,EAAEiQ,KACJgC,EAAKK,MAAQ,EACbitB,EAASv/B,EAAG,IACZu/B,EAASv/B,EAAG,KACZu/B,EAASv/B,EAAG,GACPA,EAAEsiC,QAaL/C,EAASv/B,GAAIA,EAAEsiC,OAAOttB,KAAO,EAAI,IACpBhV,EAAEsiC,OAAO/sB,KAAO,EAAI,IACnBvV,EAAEsiC,OAAOxxB,MAAY,EAAJ,IACjB9Q,EAAEsiC,OAAO96B,KAAW,EAAJ,IAChBxH,EAAEsiC,OAAOhtB,QAAc,GAAJ,IAEjCiqB,EAASv/B,EAAmB,IAAhBA,EAAEsiC,OAAOrtB,MACrBsqB,EAASv/B,EAAIA,EAAEsiC,OAAOrtB,MAAQ,EAAK,KACnCsqB,EAASv/B,EAAIA,EAAEsiC,OAAOrtB,MAAQ,GAAM,KACpCsqB,EAASv/B,EAAIA,EAAEsiC,OAAOrtB,MAAQ,GAAM,KACpCsqB,EAASv/B,EAAe,IAAZA,EAAEmiB,MAAc,EACfniB,EAAEuiB,UAv3CK,GAu3CyBviB,EAAEmiB,MAAQ,EAC1C,EAAI,GACjBod,EAASv/B,EAAiB,IAAdA,EAAEsiC,OAAOntB,IACjBnV,EAAEsiC,OAAOxxB,OAAS9Q,EAAEsiC,OAAOxxB,MAAMxS,SACnCihC,EAASv/B,EAA2B,IAAxBA,EAAEsiC,OAAOxxB,MAAMxS,QAC3BihC,EAASv/B,EAAIA,EAAEsiC,OAAOxxB,MAAMxS,QAAU,EAAK,MAEzC0B,EAAEsiC,OAAO/sB,OACXtD,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAS,IAE3DhmB,EAAEuiC,QAAU,EACZviC,EAAE6iB,OAn1CQ,KAizCV0c,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAG,GACZu/B,EAASv/B,EAAe,IAAZA,EAAEmiB,MAAc,EACfniB,EAAEuiB,UAt2CK,GAs2CyBviB,EAAEmiB,MAAQ,EAC1C,EAAI,GACjBod,EAASv/B,EA7yCH,GA8yCNA,EAAE6iB,OAASkc,OA6Bf,CACE,IAAIhc,EA13CQ,GA03CiB/iB,EAAEyiC,OAAS,GAAM,IAAO,EAYrD1f,IATI/iB,EAAEuiB,UA14CgB,GA04CcviB,EAAEmiB,MAAQ,EAC9B,EACLniB,EAAEmiB,MAAQ,EACL,EACO,IAAZniB,EAAEmiB,MACG,EAEA,IAEU,EACP,IAAfniB,EAAEs/B,WAAkBvc,GAx2CZ,IAy2CZA,GAAU,GAAMA,EAAS,GAEzB/iB,EAAE6iB,OAASkc,EACXS,EAAYx/B,EAAG+iB,GAGI,IAAf/iB,EAAEs/B,WACJE,EAAYx/B,EAAGiS,EAAKK,QAAU,IAC9BktB,EAAYx/B,EAAgB,MAAbiS,EAAKK,QAEtBL,EAAKK,MAAQ,CACf,CAIF,GAr3CgB,KAq3CZtS,EAAE6iB,OACJ,GAAI7iB,EAAEsiC,OAAOxxB,MAAqB,CAGhC,IAFAwgB,EAAMtxB,EAAEgmB,QAEDhmB,EAAEuiC,SAAmC,MAAxBviC,EAAEsiC,OAAOxxB,MAAMxS,UAC7B0B,EAAEgmB,UAAYhmB,EAAEqiC,mBACdriC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAEjE4N,EAAcjtB,GACdqf,EAAMtxB,EAAEgmB,QACJhmB,EAAEgmB,UAAYhmB,EAAEqiC,oBAItB9C,EAASv/B,EAA+B,IAA5BA,EAAEsiC,OAAOxxB,MAAM9Q,EAAEuiC,UAC7BviC,EAAEuiC,UAEAviC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAE7DtxB,EAAEuiC,UAAYviC,EAAEsiC,OAAOxxB,MAAMxS,SAC/B0B,EAAEuiC,QAAU,EACZviC,EAAE6iB,OA34CO,GA64Cb,MAEE7iB,EAAE6iB,OA/4CS,GAk5Cf,GAl5Ce,KAk5CX7iB,EAAE6iB,OACJ,GAAI7iB,EAAEsiC,OAAO96B,KAAoB,CAC/B8pB,EAAMtxB,EAAEgmB,QAGR,EAAG,CACD,GAAIhmB,EAAEgmB,UAAYhmB,EAAEqiC,mBACdriC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAEjE4N,EAAcjtB,GACdqf,EAAMtxB,EAAEgmB,QACJhmB,EAAEgmB,UAAYhmB,EAAEqiC,kBAAkB,CACpCjN,EAAM,EACN,KACF,CAIAA,EADEp1B,EAAEuiC,QAAUviC,EAAEsiC,OAAO96B,KAAKlJ,OACkB,IAAxC0B,EAAEsiC,OAAO96B,KAAKsP,WAAW9W,EAAEuiC,WAE3B,EAERhD,EAASv/B,EAAGo1B,EACd,OAAiB,IAARA,GAELp1B,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAErD,IAAR8D,IACFp1B,EAAEuiC,QAAU,EACZviC,EAAE6iB,OAh7CU,GAk7ChB,MAEE7iB,EAAE6iB,OAp7CY,GAu7ClB,GAv7CkB,KAu7Cd7iB,EAAE6iB,OACJ,GAAI7iB,EAAEsiC,OAAOhtB,QAAuB,CAClCgc,EAAMtxB,EAAEgmB,QAGR,EAAG,CACD,GAAIhmB,EAAEgmB,UAAYhmB,EAAEqiC,mBACdriC,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAEjE4N,EAAcjtB,GACdqf,EAAMtxB,EAAEgmB,QACJhmB,EAAEgmB,UAAYhmB,EAAEqiC,kBAAkB,CACpCjN,EAAM,EACN,KACF,CAIAA,EADEp1B,EAAEuiC,QAAUviC,EAAEsiC,OAAOhtB,QAAQhX,OACkB,IAA3C0B,EAAEsiC,OAAOhtB,QAAQwB,WAAW9W,EAAEuiC,WAE9B,EAERhD,EAASv/B,EAAGo1B,EACd,OAAiB,IAARA,GAELp1B,EAAEsiC,OAAO/sB,MAAQvV,EAAEgmB,QAAUsL,IAC/Brf,EAAKK,MAAQ/C,EAAM0C,EAAKK,MAAOtS,EAAE+lB,YAAa/lB,EAAEgmB,QAAUsL,EAAKA,IAErD,IAAR8D,IACFp1B,EAAE6iB,OAASic,EAEf,MAEE9+B,EAAE6iB,OAASic,EAsBf,GAnBI9+B,EAAE6iB,SAAWic,IACX9+B,EAAEsiC,OAAO/sB,MACPvV,EAAEgmB,QAAU,EAAIhmB,EAAEqiC,kBACpBnD,EAAcjtB,GAEZjS,EAAEgmB,QAAU,GAAKhmB,EAAEqiC,mBACrB9C,EAASv/B,EAAgB,IAAbiS,EAAKK,OACjBitB,EAASv/B,EAAIiS,EAAKK,OAAS,EAAK,KAChCL,EAAKK,MAAQ,EACbtS,EAAE6iB,OAASkc,IAIb/+B,EAAE6iB,OAASkc,GAMG,IAAd/+B,EAAEgmB,SAEJ,GADAkZ,EAAcjtB,GACS,IAAnBA,EAAK4C,UAQP,OADA7U,EAAEwiC,YAAc,EA5jDA,OAokDb,GAAsB,IAAlBvwB,EAAK0C,UAAkBqW,EAAKxX,IAAUwX,EAAKiY,IA5kDlC,IA6kDlBzvB,EACA,OAAO9G,EAAIuF,GA/jDO,GAmkDpB,GAAIjS,EAAE6iB,SAAWmc,GAAkC,IAAlB/sB,EAAK0C,SACpC,OAAOjI,EAAIuF,GApkDO,GAykDpB,GAAsB,IAAlBA,EAAK0C,UAAkC,IAAhB3U,EAAE0gC,WA5lDT,IA6lDjBltB,GAAwBxT,EAAE6iB,SAAWmc,EAAe,CACrD,IAAIkE,EA/jDoB,IA+jDVljC,EAAEuiB,SAxqBpB,SAAsBviB,EAAGwT,GAGvB,IAFA,IAAI+tB,IAEK,CAEP,GAAoB,IAAhBvhC,EAAE0gC,YACJE,EAAY5gC,GACQ,IAAhBA,EAAE0gC,WAAiB,CACrB,GA97Bc,IA87BVltB,EACF,OA12Bc,EA42BhB,KACF,CAUF,GANAxT,EAAEwhC,aAAe,EAGjBD,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,WAC1Ct/B,EAAE0gC,YACF1gC,EAAEs/B,WACEiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OA33BgB,CA+3BtB,CAEA,OADA7U,EAAEihC,OAAS,EAj9BS,IAk9BhBztB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UAl4BS,EACA,GAu4BlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WA74BS,EACA,CAk5BxB,CAsnBmDsuB,CAAanjC,EAAGwT,GA9jDvC,IA+jDrBxT,EAAEuiB,SAxwBT,SAAqBviB,EAAGwT,GAOtB,IANA,IAAI+tB,EACA9zB,EACAqyB,EAAMQ,EAENH,EAAOngC,EAAE4Q,SAEJ,CAKP,GAAI5Q,EAAE0gC,WAAa/b,EAAW,CAE5B,GADAic,EAAY5gC,GACRA,EAAE0gC,WAAa/b,GAr2BH,IAq2BgBnR,EAC9B,OAjxBgB,EAmxBlB,GAAoB,IAAhBxT,EAAE0gC,UAAmB,KAC3B,CAIA,GADA1gC,EAAEwhC,aAAe,EACbxhC,EAAE0gC,WAtyBM,GAsyBoB1gC,EAAEs/B,SAAW,IAE3C7xB,EAAO0yB,EADPL,EAAO9/B,EAAEs/B,SAAW,MAEPa,IAAOL,IAASryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,GAAO,CAC3EQ,EAAStgC,EAAEs/B,SAAW3a,EACtB,UAESlX,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCryB,IAAS0yB,IAAOL,IAASryB,IAAS0yB,IAAOL,IACzCA,EAAOQ,GAChBtgC,EAAEwhC,aAAe7c,GAAa2b,EAASR,GACnC9/B,EAAEwhC,aAAexhC,EAAE0gC,YACrB1gC,EAAEwhC,aAAexhC,EAAE0gC,UAEvB,CAuBF,GAlBI1gC,EAAEwhC,cA3zBM,GA+zBVD,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAEwhC,aA/zBvB,GAi0BVxhC,EAAE0gC,WAAa1gC,EAAEwhC,aACjBxhC,EAAEs/B,UAAYt/B,EAAEwhC,aAChBxhC,EAAEwhC,aAAe,IAKjBD,EAAS3C,EAAM1T,UAAUlrB,EAAG,EAAGA,EAAE4Q,OAAO5Q,EAAEs/B,WAE1Ct/B,EAAE0gC,YACF1gC,EAAEs/B,YAEAiC,IAEFnC,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WACT,OAn0BgB,CAu0BtB,CAEA,OADA7U,EAAEihC,OAAS,EAz5BS,IA05BhBztB,GAEF4rB,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,UA10BS,EACA,GA+0BlB7U,EAAEqnB,WAEJ+X,EAAiBp/B,GAAG,GACK,IAArBA,EAAEiS,KAAK4C,WAr1BS,EACA,CA01BxB,CA+qB8BuuB,CAAYpjC,EAAGwT,GACrCmrB,EAAoB3+B,EAAEmiB,OAAOjY,KAAKlK,EAAGwT,GAKzC,GA9gDoB,IA2gDhB0vB,GA1gDgB,IA0gDgBA,IAClCljC,EAAE6iB,OAASmc,GA9gDO,IAghDhBkE,GA9gDgB,IA8gDWA,EAK7B,OAJuB,IAAnBjxB,EAAK4C,YACP7U,EAAEwiC,YAAc,GA3lDF,EAumDlB,GA7hDoB,IA6hDhBU,IAlnDc,IAmnDZ1vB,EACForB,EAAMxT,UAAUprB,GAhnDF,IAknDPwT,IAEPorB,EAAMjV,iBAAiB3pB,EAAG,EAAG,GAAG,GAtnDlB,IA0nDVwT,IAEFyQ,EAAKjkB,EAAEuQ,MAEa,IAAhBvQ,EAAE0gC,YACJ1gC,EAAEs/B,SAAW,EACbt/B,EAAEq/B,YAAc,EAChBr/B,EAAEihC,OAAS,KAIjB/B,EAAcjtB,GACS,IAAnBA,EAAK4C,WAEP,OADA7U,EAAEwiC,YAAc,EA9nDF,CAkoDpB,CAIA,OA9oDoB,IA8oDhBhvB,EAtoDgB,EAuoDhBxT,EAAEiQ,MAAQ,EAtoDM,GAyoDL,IAAXjQ,EAAEiQ,MACJsvB,EAASv/B,EAAgB,IAAbiS,EAAKK,OACjBitB,EAASv/B,EAAIiS,EAAKK,OAAS,EAAK,KAChCitB,EAASv/B,EAAIiS,EAAKK,OAAS,GAAM,KACjCitB,EAASv/B,EAAIiS,EAAKK,OAAS,GAAM,KACjCitB,EAASv/B,EAAmB,IAAhBiS,EAAKE,UACjBotB,EAASv/B,EAAIiS,EAAKE,UAAY,EAAK,KACnCotB,EAASv/B,EAAIiS,EAAKE,UAAY,GAAM,KACpCotB,EAASv/B,EAAIiS,EAAKE,UAAY,GAAM,OAIpCqtB,EAAYx/B,EAAGiS,EAAKK,QAAU,IAC9BktB,EAAYx/B,EAAgB,MAAbiS,EAAKK,QAGtB4sB,EAAcjtB,GAIVjS,EAAEiQ,KAAO,IAAKjQ,EAAEiQ,MAAQjQ,EAAEiQ,MAET,IAAdjQ,EAAEgmB,QAhqDW,EACA,EAgqDtB,EAyHAvoB,EAAQgmB,WAvHR,SAAoBxR,GAClB,IAAI4Q,EAEJ,OAAK5Q,GAAsBA,EAAKC,MArmDjB,MAymDf2Q,EAAS5Q,EAAKC,MAAM2Q,SAxmDJ,KA0mDdA,GAzmDa,KA0mDbA,GAzmDgB,KA0mDhBA,GACAA,IAAWic,GACXjc,IAAWkc,GACXlc,IAAWmc,EAEJtyB,EAAIuF,EAAMvC,IAGnBuC,EAAKC,MAAQ,KAEN2Q,IAAWkc,EAAaryB,EAAIuF,GAnrDf,GALA,GAuqDXvC,CAkBX,EAkGAjS,EAAQylB,qBA3FR,SAA8BjR,EAAM2D,GAClC,IAEI5V,EACAyW,EAAKlC,EACLtE,EACAozB,EACA9xB,EACAkC,EACA6vB,EARAztB,EAAaD,EAAWtX,OAU5B,IAAK2T,IAAsBA,EAAKC,MAC9B,OAAOxC,EAMT,GAAa,KAFbO,GADAjQ,EAAIiS,EAAKC,OACAjC,OAEmB,IAATA,GAjpDJ,KAipDkBjQ,EAAE6iB,QAA0B7iB,EAAE0gC,UAC7D,OAAOhxB,EAmCT,IA/Ba,IAATO,IAEFgC,EAAKK,MAAQhD,EAAQ2C,EAAKK,MAAOsD,EAAYC,EAAY,IAG3D7V,EAAEiQ,KAAO,EAGL4F,GAAc7V,EAAEkgC,SACL,IAATjwB,IAEFgU,EAAKjkB,EAAEuQ,MACPvQ,EAAEs/B,SAAW,EACbt/B,EAAEq/B,YAAc,EAChBr/B,EAAEihC,OAAS,GAIbqC,EAAU,IAAIj0B,EAAM+D,KAAKpT,EAAEkgC,QAC3B7wB,EAAMgE,SAASiwB,EAAS1tB,EAAYC,EAAa7V,EAAEkgC,OAAQlgC,EAAEkgC,OAAQ,GACrEtqB,EAAa0tB,EACbztB,EAAa7V,EAAEkgC,QAGjBmD,EAAQpxB,EAAK0C,SACbpD,EAAOU,EAAK6C,QACZrB,EAAQxB,EAAKwB,MACbxB,EAAK0C,SAAWkB,EAChB5D,EAAK6C,QAAU,EACf7C,EAAKwB,MAAQmC,EACbgrB,EAAY5gC,GACLA,EAAE0gC,WA3rDK,GA2rDmB,CAC/BjqB,EAAMzW,EAAEs/B,SACR/qB,EAAIvU,EAAE0gC,UAAY,EAClB,GAEE1gC,EAAEkhC,OAAUlhC,EAAEkhC,OAASlhC,EAAEmhC,WAAcnhC,EAAE4Q,OAAO6F,EAhsDtC,EAgsDwD,IAAMzW,EAAEohC,UAE1EphC,EAAEyN,KAAKgJ,EAAMzW,EAAEqgC,QAAUrgC,EAAEuQ,KAAKvQ,EAAEkhC,OAElClhC,EAAEuQ,KAAKvQ,EAAEkhC,OAASzqB,EAClBA,YACSlC,GACXvU,EAAEs/B,SAAW7oB,EACbzW,EAAE0gC,UAAYgB,EACdd,EAAY5gC,EACd,CAWA,OAVAA,EAAEs/B,UAAYt/B,EAAE0gC,UAChB1gC,EAAEq/B,YAAcr/B,EAAEs/B,SAClBt/B,EAAEihC,OAASjhC,EAAE0gC,UACb1gC,EAAE0gC,UAAY,EACd1gC,EAAEwhC,aAAexhC,EAAEggC,YAAc0B,EACjC1hC,EAAE8hC,gBAAkB,EACpB7vB,EAAK6C,QAAUvD,EACfU,EAAKwB,MAAQA,EACbxB,EAAK0C,SAAW0uB,EAChBrjC,EAAEiQ,KAAOA,EA/wDW,CAixDtB,EAWAxS,EAAQ8lC,YAAc,oC,8BCv0DtB7lC,EAAOD,QAAU,EAAjB,I,wBCEAC,EAAOD,QAA8B,oBAAZiJ,SAA2BA,QAAQgI,gBAAmB,I,wBCA/EhR,EAAOD,QAAU0C,KAAKO,K,8BCDtB,IAAIqD,EAAa,EAAQ,MAGzBrG,EAAOD,QAAU,WAChB,OAAOsG,OAAkBc,OAAOkqB,WACjC,C,8BCLA,IAAIyU,EAAgB,EAAQ,MAExB/U,EAA0B,oBAAfC,WAA6B,EAAAD,EAASC,WAGrDhxB,EAAOD,QAAU,WAEhB,IADA,IAA2DwZ,EAAM,GACxDnX,EAAI,EAAGA,EAAI0jC,EAAcllC,OAAQwB,IACN,mBAAxB2uB,EAAE+U,EAAc1jC,MAE1BmX,EAAIA,EAAI3Y,QAAUklC,EAAc1jC,IAGlC,OAAOmX,CACR,C,wBCbAvZ,EAAOD,QAAUie,U,wBCCjB,IACIkF,EAAQrW,OAAOvL,UAAU0D,SACzBU,EAAMjD,KAAKiD,IAGXqgC,EAAW,SAAkBhX,EAAGP,GAGhC,IAFA,IAAIiB,EAAM,GAEDrtB,EAAI,EAAGA,EAAI2sB,EAAEnuB,OAAQwB,GAAK,EAC/BqtB,EAAIrtB,GAAK2sB,EAAE3sB,GAEf,IAAK,IAAIgoB,EAAI,EAAGA,EAAIoE,EAAE5tB,OAAQwpB,GAAK,EAC/BqF,EAAIrF,EAAI2E,EAAEnuB,QAAU4tB,EAAEpE,GAG1B,OAAOqF,CACX,EAqBAzvB,EAAOD,QAAU,SAAcimC,GAC3B,IAAIrL,EAASn3B,KACb,GAAsB,mBAAXm3B,GApCA,sBAoCyBzX,EAAMxW,MAAMiuB,GAC5C,MAAM,IAAIhqB,UAxCE,kDAwCwBgqB,GAyBxC,IAvBA,IAEIsL,EAFAhiB,EAxBI,SAAeiiB,GAEvB,IADA,IAAIzW,EAAM,GACDrtB,EAsBmB,EAtBFgoB,EAAI,EAAGhoB,EAAI8jC,EAAQtlC,OAAQwB,GAAK,EAAGgoB,GAAK,EAC9DqF,EAAIrF,GAAK8b,EAAQ9jC,GAErB,OAAOqtB,CACX,CAkBe0W,CAAMxlC,WAqBbylC,EAAc1gC,EAAI,EAAGi1B,EAAO/5B,OAASqjB,EAAKrjB,QAC1CylC,EAAY,GACPjkC,EAAI,EAAGA,EAAIgkC,EAAahkC,IAC7BikC,EAAUjkC,GAAK,IAAMA,EAKzB,GAFA6jC,EAAQ5kC,SAAS,SAAU,oBA3CnB,SAAUouB,GAElB,IADA,IAAI1W,EAAM,GACD3W,EAAI,EAAGA,EAAIqtB,EAAI7uB,OAAQwB,GAAK,EACjC2W,GAAO0W,EAAIrtB,GACPA,EAAI,EAAIqtB,EAAI7uB,SACZmY,GAsC0D,KAnClE,OAAOA,CACX,CAkCqDutB,CAAMD,GAAkB,4CAAjEhlC,CAxBK,WACT,GAAImC,gBAAgByiC,EAAO,CACvB,IAAIz6B,EAASmvB,EAAOjuB,MAChBlJ,KACAuiC,EAAS9hB,EAAMtjB,YAEnB,OAAIkM,OAAOrB,KAAYA,EACZA,EAEJhI,IACX,CACA,OAAOm3B,EAAOjuB,MACVs5B,EACAD,EAAS9hB,EAAMtjB,WAGvB,GAUIg6B,EAAOr5B,UAAW,CAClB,IAAIilC,EAAQ,WAAkB,EAC9BA,EAAMjlC,UAAYq5B,EAAOr5B,UACzB2kC,EAAM3kC,UAAY,IAAIilC,EACtBA,EAAMjlC,UAAY,IACtB,CAEA,OAAO2kC,CACX,C,wBChFAjmC,EAAOD,QAAUkF,K,wBCAjBjF,EAAOD,QAAUymC,c,wBCDjB,IAEIC,EACAC,EAHAC,EAAUtlC,SAASC,UAAU0D,SAC7B4hC,EAAkC,iBAAZ59B,SAAoC,OAAZA,SAAoBA,QAAQ0D,MAG9E,GAA4B,mBAAjBk6B,GAAgE,mBAA1B/5B,OAAOC,eACvD,IACC25B,EAAe55B,OAAOC,eAAe,CAAC,EAAG,SAAU,CAClD3G,IAAK,WACJ,MAAMugC,CACP,IAEDA,EAAmB,CAAC,EAEpBE,EAAa,WAAc,MAAM,EAAI,EAAG,KAAMH,EAC/C,CAAE,MAAOp1B,GACJA,IAAMq1B,IACTE,EAAe,KAEjB,MAEAA,EAAe,KAGhB,IAAIC,EAAmB,cACnBC,EAAe,SAA4BpmC,GAC9C,IACC,IAAIqmC,EAAQJ,EAAQplC,KAAKb,GACzB,OAAOmmC,EAAiBzqB,KAAK2qB,EAC9B,CAAE,MAAOjlC,GACR,OAAO,CACR,CACD,EAEIklC,EAAoB,SAA0BtmC,GACjD,IACC,OAAIomC,EAAapmC,KACjBimC,EAAQplC,KAAKb,IACN,EACR,CAAE,MAAOoB,GACR,OAAO,CACR,CACD,EACIohB,EAAQrW,OAAOvL,UAAU0D,SAOzB8rB,EAAmC,mBAAX3pB,UAA2BA,OAAOkqB,YAE1D4V,IAAW,IAAK,CAAC,IAEjBC,EAAQ,WAA8B,OAAO,CAAO,EACxD,GAAwB,iBAAbC,SAAuB,CAEjC,IAAIC,EAAMD,SAASC,IACflkB,EAAM3hB,KAAK6lC,KAASlkB,EAAM3hB,KAAK4lC,SAASC,OAC3CF,EAAQ,SAA0BxmC,GAGjC,IAAKumC,IAAWvmC,UAA4B,IAAVA,GAA0C,iBAAVA,GACjE,IACC,IAAIqY,EAAMmK,EAAM3hB,KAAKb,GACrB,OAlBU,+BAmBTqY,GAlBU,qCAmBPA,GAlBO,4BAmBPA,GAxBS,oBAyBTA,IACc,MAAbrY,EAAM,GACZ,CAAE,MAAOoB,GAAU,CAEpB,OAAO,CACR,EAEF,CAEA9B,EAAOD,QAAU6mC,EACd,SAAoBlmC,GACrB,GAAIwmC,EAAMxmC,GAAU,OAAO,EAC3B,IAAKA,EAAS,OAAO,EACrB,GAAqB,mBAAVA,GAAyC,iBAAVA,EAAsB,OAAO,EACvE,IACCkmC,EAAalmC,EAAO,KAAM+lC,EAC3B,CAAE,MAAO3kC,GACR,GAAIA,IAAM4kC,EAAoB,OAAO,CACtC,CACA,OAAQI,EAAapmC,IAAUsmC,EAAkBtmC,EAClD,EACE,SAAoBA,GACrB,GAAIwmC,EAAMxmC,GAAU,OAAO,EAC3B,IAAKA,EAAS,OAAO,EACrB,GAAqB,mBAAVA,GAAyC,iBAAVA,EAAsB,OAAO,EACvE,GAAIowB,EAAkB,OAAOkW,EAAkBtmC,GAC/C,GAAIomC,EAAapmC,GAAU,OAAO,EAClC,IAAI2mC,EAAWnkB,EAAM3hB,KAAKb,GAC1B,QApDY,sBAoDR2mC,GAnDS,+BAmDeA,IAA0B,iBAAmBjrB,KAAKirB,KACvEL,EAAkBtmC,EAC1B,C,wBCjGDV,EAAOD,QAAU8M,M,wBCAjB7M,EAAOD,QAAU4Q,S,wBCkBjB3Q,EAAOD,QAAU,CAGfmzB,WAAoB,EACpBoU,gBAAoB,EACpBhU,aAAoB,EACpBiU,aAAoB,EACpBtU,SAAoB,EACpBuU,QAAoB,EACpBC,QAAoB,EAKpB9U,KAAoB,EACpBU,aAAoB,EACpBF,YAAoB,EACpBuU,SAAoB,EACpB11B,gBAAoB,EACpB21B,cAAoB,EAEpBvU,aAAoB,EAIpBwU,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BC,uBAA0B,EAG1BC,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1BC,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1BC,WAA0B,E,4BC9D5B,IAAIC,EAAmC,oBAAf5hC,YACgB,oBAAhByC,aACe,oBAAff,WAExB,SAASmgC,EAAKloC,EAAKyN,GACjB,OAAOpB,OAAOvL,UAAU6hB,eAAe5hB,KAAKf,EAAKyN,EACnD,CAEAlO,EAAQuY,OAAS,SAAU9X,GAEzB,IADA,IAAImoC,EAAU1hC,MAAM3F,UAAUqJ,MAAMpJ,KAAKZ,UAAW,GAC7CgoC,EAAQ/nC,QAAQ,CACrB,IAAIse,EAASypB,EAAQx5B,QACrB,GAAK+P,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIvO,UAAUuO,EAAS,sBAG/B,IAAK,IAAIhB,KAAKgB,EACRwpB,EAAKxpB,EAAQhB,KACf1d,EAAI0d,GAAKgB,EAAOhB,GARK,CAW3B,CAEA,OAAO1d,CACT,EAIAT,EAAQ8Y,UAAY,SAAU/H,EAAKF,GACjC,OAAIE,EAAIlQ,SAAWgQ,EAAeE,EAC9BA,EAAI8H,SAAmB9H,EAAI8H,SAAS,EAAGhI,IAC3CE,EAAIlQ,OAASgQ,EACNE,EACT,EAGA,IAAI83B,EAAU,CACZjzB,SAAU,SAAUkzB,EAAM14B,EAAK24B,EAAUlyB,EAAKmyB,GAC5C,GAAI54B,EAAIyI,UAAYiwB,EAAKjwB,SACvBiwB,EAAKrX,IAAIrhB,EAAIyI,SAASkwB,EAAUA,EAAWlyB,GAAMmyB,QAInD,IAAK,IAAI3mC,EAAI,EAAGA,EAAIwU,EAAKxU,IACvBymC,EAAKE,EAAY3mC,GAAK+N,EAAI24B,EAAW1mC,EAEzC,EAEA6jB,cAAe,SAAUf,GACvB,IAAI9iB,EAAG4mC,EAAGpyB,EAAK+C,EAAKqM,EAAOxa,EAI3B,IADAoL,EAAM,EACDxU,EAAI,EAAG4mC,EAAI9jB,EAAOtkB,OAAQwB,EAAI4mC,EAAG5mC,IACpCwU,GAAOsO,EAAO9iB,GAAGxB,OAMnB,IAFA4K,EAAS,IAAI3E,WAAW+P,GACxB+C,EAAM,EACDvX,EAAI,EAAG4mC,EAAI9jB,EAAOtkB,OAAQwB,EAAI4mC,EAAG5mC,IACpC4jB,EAAQd,EAAO9iB,GACfoJ,EAAOgmB,IAAIxL,EAAOrM,GAClBA,GAAOqM,EAAMplB,OAGf,OAAO4K,CACT,GAGEy9B,EAAY,CACdtzB,SAAU,SAAUkzB,EAAM14B,EAAK24B,EAAUlyB,EAAKmyB,GAC5C,IAAK,IAAI3mC,EAAI,EAAGA,EAAIwU,EAAKxU,IACvBymC,EAAKE,EAAY3mC,GAAK+N,EAAI24B,EAAW1mC,EAEzC,EAEA6jB,cAAe,SAAUf,GACvB,MAAO,GAAG7a,OAAOqC,MAAM,GAAIwY,EAC7B,GAMFnlB,EAAQmpC,SAAW,SAAUC,GACvBA,GACFppC,EAAQ2V,KAAQ7O,WAChB9G,EAAQgU,MAAQzK,YAChBvJ,EAAQ8U,MAAQtM,WAChBxI,EAAQuY,OAAOvY,EAAS6oC,KAExB7oC,EAAQ2V,KAAQzO,MAChBlH,EAAQgU,MAAQ9M,MAChBlH,EAAQ8U,MAAQ5N,MAChBlH,EAAQuY,OAAOvY,EAASkpC,GAE5B,EAEAlpC,EAAQmpC,SAAST,E,8BCtGjB,IAAIlnC,EAAOF,SAASC,UAAUC,KAC1B6nC,EAAUv8B,OAAOvL,UAAU6hB,eAC3BjZ,EAAO,EAAQ,MAGnBlK,EAAOD,QAAUmK,EAAK3I,KAAKA,EAAM6nC,E,GCN7BC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBpkC,IAAjBqkC,EACH,OAAOA,EAAazpC,QAGrB,IAAIC,EAASqpC,EAAyBE,GAAY,CAGjDxpC,QAAS,CAAC,GAOX,OAHA0pC,EAAoBF,GAAUvpC,EAAQA,EAAOD,QAASupC,GAG/CtpC,EAAOD,OACf,CCrBAupC,EAAoBjnC,EAAI,CAACtC,EAAS2pC,KACjC,IAAI,IAAIz7B,KAAOy7B,EACXJ,EAAoBK,EAAED,EAAYz7B,KAASq7B,EAAoBK,EAAE5pC,EAASkO,IAC5EpB,OAAOC,eAAe/M,EAASkO,EAAK,CAAE9M,YAAY,EAAMgF,IAAKujC,EAAWz7B,MCJ3Eq7B,EAAoBvY,EAAI,WACvB,GAA0B,iBAAfC,WAAyB,OAAOA,WAC3C,IACC,OAAOxtB,MAAQ,IAAInC,SAAS,cAAb,EAChB,CAAE,MAAOS,GACR,GAAsB,iBAAXoR,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBo2B,EAAoBK,EAAI,CAACnpC,EAAKopC,IAAU/8B,OAAOvL,UAAU6hB,eAAe5hB,KAAKf,EAAKopC,GCClFN,EAAoBO,EAAK9pC,IACH,oBAAXoH,QAA0BA,OAAOkqB,aAC1CxkB,OAAOC,eAAe/M,EAASoH,OAAOkqB,YAAa,CAAE3wB,MAAO,WAE7DmM,OAAOC,eAAe/M,EAAS,aAAc,CAAEW,OAAO,K,uOCJvD,MAcMopC,EAAOpS,IACX,GAAmB,kBAARA,EACT,OAAOA,EAIT,GAAY,UADZA,EAAMA,EAAIgD,OAAO1D,gBACa,QAARU,GAAyB,OAARA,EAAc,OAAO,EAC5D,GAAY,UAARA,GAA2B,OAARA,GAAwB,QAARA,EAAe,OAAO,EAC7D,MAAMzyB,MACJ,kEAAkEyyB,MAIhEqS,EAAS,CACbC,KAAM,CACJC,SAAUH,EACVI,KAAMJ,EACNK,iBAAkBL,EAClBM,SAAUN,EACV1rB,WAAY0rB,EACZO,iBAlCQ3S,IACV,GAAmB,iBAARA,EACT,OAAOA,EAGTA,EAAMA,EAAIV,cACV,IAAIngB,EAAIhO,SAAS6uB,GAIjB,OAHIA,EAAI4S,SAAS,OAAMzzB,GAAK,MACxB6gB,EAAI4S,SAAS,OAAMzzB,GAAK,SACxB6gB,EAAI4S,SAAS,OAAMzzB,GAAK,YACrBA,KAoCH0zB,EAAqB,qCACrBC,EAAgB,mBAOhBC,EAAsB,uCACtBC,EAAsB,uBAGtBC,EAA+B,oBAsC/BC,EAAuBtzB,IACHA,EAAK7L,MAAM,kBAAoB,IAAI7K,OACnC,GAAM,EAG1BiqC,EAAevzB,GACZA,EAAKmI,MAAM,IAAIN,OAAO,CAAC2rB,EAASloC,EAAGmoC,EAAKzzB,KAC7C,MAAM0zB,EAAgB,MAANpoC,GAA+B,OAAlB0U,EAAKyzB,EAAM,GAClCE,EAAyB,OAANroC,GAAgC,MAAlB0U,EAAKyzB,EAAM,GAClD,OAAIC,GAAWC,EACNH,EAEFA,EAAUloC,GAChB,IAGCsoC,EAAQ5zB,GACG,MAARA,EAAeA,EAAK0f,cAAgB,KAGvCmU,EAAU,CAACC,EAASC,EAAYvhC,IAC7B,CAACohC,EAAME,GAAUC,EAAYH,EAAMphC,IACvC4W,OAAOqO,GAAU,MAALA,GACZxO,KAAK,KAGJ+qB,EAAgB1tB,IACpB,MAAM2tB,EAAe3tB,EAAK6B,MAAM,KAC1B2rB,EAAUG,EAAap8B,QACvBrF,EAAOyhC,EAAalrB,MACpBgrB,EAAaE,EAAa3qC,OAAS2qC,EAAahrB,KAAK,UAAOpb,EAElE,MAAO,CACLimC,UACAC,aACAvhC,OACA8T,KAAMutB,EAAQC,EAASC,EAAYvhC,GACnC0hC,YAAaL,EAAQC,EAASC,EAAY,MAC1CI,YAAaL,IAYV,MAAMM,EACX,WAAAvuB,CAAY7F,GACV,IAAI8zB,EAAU,KACVC,EAAa,KACjB7nC,KAAKmoC,aAAer0B,EAChBA,EAAKmI,MAAM,MAAMmsB,IAAIC,IACnB,IAAI/hC,EAAO,KACPpJ,EAAQ,KAEZ,MAAMorC,EAAcD,EAAKnR,OACnBqR,EAhGWF,KACzB,MAAMjiB,EAAU2gB,EAAmB1/B,KAAKghC,GACxC,GAAe,MAAXjiB,EAAiB,CACnB,MAAOwhB,EAASC,GAAczhB,EAAQjf,MAAM,GAC5C,MAAO,CAACygC,EAASC,EACnB,CACA,OAAO,MA0F0BW,CAAmBF,GACtCL,EAAgC,MAApBM,EAClB,GAAIN,GACAL,EAASC,GAAcU,MACpB,CACL,MAAME,EA5FUJ,KAC1B,MAAMjiB,EAAU6gB,EAAoB5/B,KAAKghC,GACzC,GAAe,MAAXjiB,EAAiB,CACnB,MAAO9f,EAAMoiC,EAAW,QAAUtiB,EAAQjf,MAAM,GAC1CwhC,EAOaD,KACrB,MAAME,EAAiBzB,EAA6B9/B,KAAKqhC,GACzD,GAAsB,MAAlBE,EACF,OAAOF,EAET,MAAOG,EAAqBz0B,GAAWw0B,EAAezhC,MAAM,GAE5D,OACEigC,EAAqByB,IACrBzB,EAAqBhzB,GAEd,GAAGy0B,IAAsBz0B,IAE3By0B,GApBwBC,CAAeJ,GAE5C,MAAO,CAACpiC,EADmB+gC,EAAasB,GAE1C,CACA,OAAO,MAoF6BI,CAAoBT,GACN,MAArBG,KAEfniC,EAAMpJ,GAASurC,EAErB,CAEA,MAAMruB,EAAOutB,EAAQC,EAASC,EAAYvhC,GAC1C,MAAO,CAAE+hC,OAAMJ,YAAWL,UAASC,aAAYvhC,OAAMpJ,QAAOkd,UAE9D,EACN,CAEA,WAAOpN,CAAK8G,GACV,OAAO,IAAIo0B,EAAUp0B,EACvB,CAEA,SAAMnR,CAAIyX,EAAM4uB,GAAS,GACvB,MAAMC,EAAiBnB,EAAc1tB,GAAMA,KACrC8uB,EAAYlpC,KAAKmoC,aACpBjrB,OAAOisB,GAAUA,EAAO/uB,OAAS6uB,GACjCb,IAAI,EAAGR,UAASthC,OAAMpJ,YACrB,MAAMqJ,EAAKggC,EAAOqB,IAAYrB,EAAOqB,GAASthC,GAC9C,OAAOC,EAAKA,EAAGrJ,GAASA,IAE5B,OAAO8rC,EAASE,EAAYA,EAAUrsB,KACxC,CAEA,YAAMmsB,CAAO5uB,GACX,OAAOpa,KAAK2C,IAAIyX,GAAM,EACxB,CAEA,oBAAMgvB,CAAexB,GACnB,OAAO5nC,KAAKmoC,aACTjrB,OAAOisB,GAAUA,EAAOlB,WAAakB,EAAOvB,UAAYA,GACxDQ,IAAIe,GAAUA,EAAOtB,WAC1B,CAEA,mBAAMwB,CAAczB,EAASC,GAC3B7nC,KAAKmoC,aAAenoC,KAAKmoC,aAAajrB,OACpCisB,KACIA,EAAOvB,UAAYA,GAAWuB,EAAOtB,aAAeA,GAE5D,CAEA,YAAMyB,CAAOlvB,EAAMld,GACjB,OAAO8C,KAAKguB,IAAI5T,EAAMld,GAAO,EAC/B,CAEA,SAAM8wB,CAAI5T,EAAMld,EAAOosC,GAAS,GAC9B,MAAM,QACJ1B,EAAO,WACPC,EAAU,KACVvhC,EACA8T,KAAM6uB,EAAc,YACpBjB,EAAW,UACXC,GACEH,EAAc1tB,GAEZmvB,GAlFavpB,EAmFjBhgB,KAAKmoC,aAnFmBqB,EAoFxBL,GAAUA,EAAO/uB,OAAS6uB,EAnFvBjpB,EAAMrE,OAAO,CAAC8tB,EAAWC,EAAM7wB,IAC7B2wB,EAASE,GAAQ7wB,EAAQ4wB,GAC9B,IAHgB,IAACzpB,EAAOwpB,EAsF1B,GAAa,MAATtsC,GACmB,IAAjBqsC,GACFvpC,KAAKmoC,aAAaphC,OAAOwiC,EAAa,QAGxC,IAAqB,IAAjBA,EAAoB,CACtB,MAAMJ,EAASnpC,KAAKmoC,aAAaoB,GAE3BI,EAAiBtgC,OAAOyL,OAAO,CAAC,EAAGq0B,EAAQ,CAC/C7iC,OACApJ,QACA0sC,UAAU,IAERN,EACFtpC,KAAKmoC,aAAaphC,OAAOwiC,EAAc,EAAG,EAAGI,GAE7C3pC,KAAKmoC,aAAaoB,GAAeI,CAErC,KAAO,CACL,MAAME,EAAe7pC,KAAKmoC,aAAa2B,UACrCX,GAAUA,EAAO/uB,OAAS4tB,GAEtB+B,EAAY,CAChBnC,UACAC,aACAvhC,OACApJ,QACA0sC,UAAU,EACVxvB,KAAM6uB,GAER,GAAIjC,EAAcpuB,KAAKgvB,IAAYV,EAAoBtuB,KAAKtS,GAC1D,GAAIujC,GAAgB,EAElB7pC,KAAKmoC,aAAaphC,OAAO8iC,EAAe,EAAG,EAAGE,OACzC,CAEL,MAAMC,EAAa,CACjB/B,YACAL,UACAC,aACA+B,UAAU,EACVxvB,KAAM4tB,GAERhoC,KAAKmoC,aAAah8B,KAAK69B,EAAYD,EACrC,CAEJ,CAEJ,CAEA,QAAAvoC,GACE,OAAOxB,KAAKmoC,aACTC,IAAI,EAAGC,OAAMT,UAASC,aAAYvhC,OAAMpJ,QAAO0sC,YAAW,KACpDA,EAGO,MAARtjC,GAAyB,MAATpJ,EACG,iBAAVA,GAAsB,OAAO0b,KAAK1b,GAEpC,KAAKoJ,QAAWpJ,KAElB,KAAKoJ,OAAUpJ,IAEN,MAAd2qC,EACK,IAAID,MAAYC,MAElB,IAAID,KAZFS,GAcVtrB,KAAK,KACV,EC/RK,MAAMktB,EASX,gBAAatnC,EAAI,GAAEunC,EAAE,OAAEC,IAGrB,MAAMr2B,QAAao2B,EAAGlsC,KAAK,GAAGmsC,WAAiB,CAAE98B,SAAU,SAC3D,OAAO66B,EAAUl7B,KAAK8G,EACxB,CAWA,iBAAas2B,EAAK,GAAEF,EAAE,OAAEC,EAAM,OAAEhB,UAGxBe,EAAG/qC,MAAM,GAAGgrC,WAAiBhB,EAAO3nC,WAAY,CACpD6L,SAAU,QAEd,E,cCtCK,SAASg9B,EAAQjwB,GACtB,MAAMrS,EAAO9I,KAAKiD,IAAIkY,EAAKia,YAAY,KAAMja,EAAKia,YAAY,OAC9D,OAAc,IAAVtsB,EAAoB,IACX,IAATA,EAAmB,IAChBqS,EAAKjT,MAAM,EAAGY,EACvB,CC+EO,SAAS,KAAQ0Y,GACtB,GAAoB,IAAhBA,EAAKrjB,OAAc,MAAO,IAC9B,IAAIktC,EACJ,IAAK,IAAI1rC,EAAI,EAAGA,EAAI6hB,EAAKrjB,SAAUwB,EAAG,CACpC,MAAMkO,EAAM2T,EAAK7hB,GACbkO,EAAI1P,OAAS,SACAuE,IAAX2oC,EAAsBA,EAASx9B,EAC9Bw9B,GAAU,IAAMx9B,EAEzB,CACA,YAAenL,IAAX2oC,EAA6B,IA3BnC,SAAmBlwB,GACjB,IAAKA,EAAKhd,OAAQ,MAAO,IAEzB,MAAMmtC,EAAyB,MAAZnwB,EAAK,GAClBowB,EAAoC,MAAhBpwB,EAAKqwB,IAAI,GAInC,OAFArwB,EAnEF,SAAyBA,EAAMswB,GAC7B,IAAIplB,EAAM,GACNqlB,EAAoB,EACpBC,GAAa,EACbC,EAAO,EACPC,EAAO,KACX,IAAK,IAAIlsC,EAAI,EAAGA,GAAKwb,EAAKhd,SAAUwB,EAAG,CACrC,GAAIA,EAAIwb,EAAKhd,OAAQ0tC,EAAO1wB,EAAKxb,OAC5B,IAAa,MAATksC,EAAc,MAClBA,EAAO,IAEZ,GAAa,MAATA,EAAc,CAChB,GAAIF,IAAchsC,EAAI,GAAc,IAATisC,QAEpB,GAAa,IAATA,EAAY,CACrB,GACEvlB,EAAIloB,OAAS,GACS,IAAtButC,GACe,MAAfrlB,EAAImlB,IAAI,IACO,MAAfnlB,EAAImlB,IAAI,GACR,CACA,GAAInlB,EAAIloB,OAAS,EAAG,CAClB,MAAM2tC,EAAiBzlB,EAAI+O,YAAY,MACf,IAApB0W,GACFzlB,EAAM,GACNqlB,EAAoB,IAEpBrlB,EAAMA,EAAIne,MAAM,EAAG4jC,GACnBJ,EAAoBrlB,EAAIloB,OAAS,EAAIkoB,EAAI+O,YAAY,MAEvDuW,EAAYhsC,EACZisC,EAAO,EACP,QACF,CAAO,GAAmB,IAAfvlB,EAAIloB,OAAc,CAC3BkoB,EAAM,GACNqlB,EAAoB,EACpBC,EAAYhsC,EACZisC,EAAO,EACP,QACF,CACF,CACIH,IACFplB,GAAOA,EAAIloB,OAAS,EAAI,MAAQ,KAChCutC,EAAoB,EAExB,MACMrlB,EAAIloB,OAAS,EAAGkoB,GAAO,IAAMlL,EAAKjT,MAAMyjC,EAAY,EAAGhsC,GACtD0mB,EAAMlL,EAAKjT,MAAMyjC,EAAY,EAAGhsC,GACrC+rC,EAAoB/rC,EAAIgsC,EAAY,EAEtCA,EAAYhsC,EACZisC,EAAO,CACT,KAAoB,MAATC,IAA0B,IAAVD,IACvBA,EAEFA,GAAQ,CAEZ,CACA,OAAOvlB,CACT,CAQS0lB,CAAgB5wB,GAAOmwB,IAEpBntC,QAINotC,IAAmBpwB,GAAQ,KAExBmwB,EAAa,IAAInwB,IAASA,GAL3BmwB,EAAmB,IAChBC,EAAoB,KAAO,GAKtC,CAaSS,CAAUX,EACnB,CCtFO,MAAM,EAWX,sBAAaY,EAAU,GAAEhB,EAAE,IAAE/V,EAAG,OAAEgW,EAAS,EAAKhW,EAAK,QAAO,SAAEgX,IAE5D,GAA2B,SCvBxB,SAAkB/wB,GACvB,MAAMrS,EAAO9I,KAAKiD,IAAIkY,EAAKia,YAAY,KAAMja,EAAKia,YAAY,OAI9D,OAHItsB,GAAQ,IACVqS,EAAOA,EAAKjT,MAAMY,EAAO,IAEpBqS,CACT,CDiBQgxB,CAASD,GAAsB,OAAO,EAE1C,GAAiB,MAAbA,EAAkB,OAAO,EAE7B,IAAIE,EAAW,GACf,MAAMC,EAAe,EAAKnB,EAAQ,OAAQ,iBAChCD,EAAGqB,OAAOD,KAClBD,QAAiBnB,EAAGlsC,KAAKstC,EAAc,SAGzC,MAAME,EAAQ,CACZ,CACEC,UAAW,EAAKtX,EAAK,cACrBgX,aAGEO,EAASP,EAASlvB,MAAM,KAAKiB,OAAOjZ,SAC1C,IAAK,IAAIrF,EAAI,EAAGA,EAAI8sC,EAAOtuC,OAAQwB,IAAK,CACtC,MAAM+sC,EAASD,EAAOvkC,MAAM,EAAGvI,GAAGme,KAAK,KACjC6uB,EAAOF,EAAOvkC,MAAMvI,GAAGme,KAAK,KAClCyuB,EAAMr/B,KAAK,CACTs/B,UAAW,EAAKtX,EAAKwX,EAAQ,cAC7BR,SAAUS,GAEd,CACA,IAAIC,GAAgB,EACpB,IAAK,MAAMnxB,KAAK8wB,EAAO,CACrB,IAAII,EACJ,IACEA,QAAa1B,EAAGlsC,KAAK0c,EAAE+wB,UAAW,OACpC,CAAE,MAAOjgC,GACP,GAAiB,UAAbA,EAAI6Z,KAAkB,QAC5B,CACA,MAAMymB,EAAMC,IAAS/vB,IAAIqvB,GACzBS,EAAI9vB,IAAI4vB,GAIR,MAAMI,EAAY3B,EAAQ3vB,EAAEywB,UAC5B,GAAkB,MAAda,GAAqBF,EAAI9uB,QAAQgvB,GAAY,OAAO,EAGtDH,EADEA,GACeC,EAAIlzB,KAAK8B,EAAEywB,UAAU3uB,UAEtBsvB,EAAIlzB,KAAK8B,EAAEywB,UAAU5uB,OAEzC,CACA,OAAOsvB,CACT,E,cEvEK,MAAMI,UAAkBxqC,MAC7B,WAAAkY,CAAYM,GACV0iB,MAAM1iB,GAGNja,KAAKksC,OAAS,EAChB,CAEA,MAAAzU,GAEE,MAAO,CACLpS,KAAMrlB,KAAKqlB,KACX9kB,KAAMP,KAAKO,KACX2rC,OAAQlsC,KAAKksC,OACbjyB,QAASja,KAAKia,QACd2iB,MAAO58B,KAAK48B,MAEhB,CAEA,QAAAuP,CAASC,GACP,MAAM9tC,EAAI,IAAI2tC,EAAUG,EAAKnyB,SAK7B,OAJA3b,EAAE+mB,KAAO+mB,EAAK/mB,KACd/mB,EAAEiC,KAAO6rC,EAAK7rC,KACdjC,EAAE4tC,OAASE,EAAKF,OAChB5tC,EAAEs+B,MAAQwP,EAAKxP,MACRt+B,CACT,CAEA,wBAAI+tC,GACF,OAAO,CACT,EC5BK,MAAMC,UAA2BL,EAItC,WAAAtyB,CAAY4yB,GACV5P,MACE,wEAAwE4P,EAAU/qC,yHAEpFxB,KAAKqlB,KAAOrlB,KAAKsG,KAAOgmC,EAAmBjnB,KAC3CrlB,KAAKO,KAAO,CAAEgsC,YAChB,EAGFD,EAAmBjnB,KAAO,qBCbnB,MAAM,UAAsB4mB,EAIjC,WAAAtyB,CAAYM,GACV0iB,MACE,kbAAkb1iB,KAEpbja,KAAKqlB,KAAOrlB,KAAKsG,KAAO,EAAc+e,KACtCrlB,KAAKO,KAAO,CAAE0Z,UAChB,EAGF,EAAcoL,KAAO,gBCbd,MAAMmnB,UAA4BP,EAIvC,WAAAtyB,CAAYwxB,GACVxO,MAAM,iBAAiBwO,0CACvBnrC,KAAKqlB,KAAOrlB,KAAKsG,KAAOkmC,EAAoBnnB,KAC5CrlB,KAAKO,KAAO,CAAE4qC,WAChB,EAGFqB,EAAoBnnB,KAAO,sBCXpB,MAAMonB,EACX,WAAA9yB,CAAY1b,GACV+B,KAAK/B,OAASA,EACd+B,KAAK0sC,OAAS,CAChB,CAEA,GAAAC,GACE,OAAO3sC,KAAK0sC,QAAU1sC,KAAK/B,OAAOb,MACpC,CAEA,IAAAwvC,GACE,OAAO5sC,KAAK0sC,MACd,CAEA,IAAAG,CAAKx5B,GACHrT,KAAK0sC,OAASr5B,CAChB,CAEA,KAAAlM,CAAMkM,GACJ,MAAMgzB,EAAIrmC,KAAK/B,OAAOkJ,MAAMnH,KAAK0sC,OAAQ1sC,KAAK0sC,OAASr5B,GAEvD,OADArT,KAAK0sC,QAAUr5B,EACRgzB,CACT,CAEA,QAAA7kC,CAAShB,EAAKpD,GACZ,MAAMipC,EAAIrmC,KAAK/B,OAAOuD,SAAShB,EAAKR,KAAK0sC,OAAQ1sC,KAAK0sC,OAAStvC,GAE/D,OADA4C,KAAK0sC,QAAUtvC,EACRipC,CACT,CAEA,KAAAlnC,CAAMjC,EAAOE,EAAQoD,GACnB,MAAM6lC,EAAIrmC,KAAK/B,OAAOkB,MAAMjC,EAAO8C,KAAK0sC,OAAQtvC,EAAQoD,GAExD,OADAR,KAAK0sC,QAAUtvC,EACRipC,CACT,CAEA,IAAAr0B,CAAK0J,EAAQyU,EAAOpe,GAClB,MAAMs0B,EAAI3qB,EAAO1J,KAAKhS,KAAK/B,OAAQ+B,KAAK0sC,OAAQvc,EAAOpe,GAEvD,OADA/R,KAAK0sC,QAAUrG,EACRA,CACT,CAEA,SAAAtN,GACE,MAAMsN,EAAIrmC,KAAK/B,OAAO86B,UAAU/4B,KAAK0sC,QAErC,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,UAAAxL,CAAW39B,GACT,MAAMmpC,EAAIrmC,KAAK/B,OAAO48B,WAAW39B,EAAO8C,KAAK0sC,QAE7C,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,YAAA5R,GACE,MAAM4R,EAAIrmC,KAAK/B,OAAOw2B,aAAaz0B,KAAK0sC,QAExC,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,aAAApL,CAAc/9B,GACZ,MAAMmpC,EAAIrmC,KAAK/B,OAAOg9B,cAAc/9B,EAAO8C,KAAK0sC,QAEhD,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,YAAA/M,GACE,MAAM+M,EAAIrmC,KAAK/B,OAAOq7B,aAAat5B,KAAK0sC,QAExC,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,CAEA,aAAAllC,CAAcjE,GACZ,MAAMmpC,EAAIrmC,KAAK/B,OAAOkD,cAAcjE,EAAO8C,KAAK0sC,QAEhD,OADA1sC,KAAK0sC,QAAU,EACRrG,CACT,EC5EK,SAASyG,EAAYvhB,EAAGP,GAE7B,OCJK,SAAwBO,EAAGP,GAEhC,QAASO,EAAIP,MAAQO,EAAIP,EAC3B,CDCS+hB,CAAexhB,EAAEnR,KAAM4Q,EAAE5Q,KAClC,CESO,SAAS4yB,EAAcl+B,GAG5B,IAAI0H,EAAO1H,EAAO,EAAIA,GAAQ,GAAK,EAOxB,IAAT0H,GACS,IAATA,GACS,KAATA,GACS,KAATA,IAEAA,EAAO,GAET,IAAIy2B,EAAqB,IAAPn+B,EASlB,OANEm+B,EADgB,GAAdA,EACY,IAEA,IAGH,IAATz2B,IAAiBy2B,EAAc,IAC3Bz2B,GAAQ,IAAMy2B,CACxB,CCvCA,MAAMC,EAAa,GAAK,GAExB,SAASC,EACPC,EACAC,EACAC,EACAC,GAEA,QAAqB5rC,IAAjByrC,QAAmDzrC,IAArB0rC,EAChC,MAAO,CAACD,EAAcC,QAEH1rC,IAAjB2rC,IACFA,EAAeC,EAAKza,WAEtB,MAAM0a,EAAUvuC,KAAKO,MAAM8tC,EAAe,KAE1C,MAAO,CAACE,EAD8C,KAAjCF,EAAyB,IAAVE,GAEtC,CAEO,SAASC,EAAenvC,GAC7B,MAAOovC,EAAcC,GAAoBR,EACvC7uC,EAAEovC,aACFpvC,EAAEqvC,iBACFrvC,EAAEsvC,QACFtvC,EAAEuvC,QAEGC,EAAcC,GAAoBZ,EACvC7uC,EAAEwvC,aACFxvC,EAAEyvC,iBACFzvC,EAAE0vC,QACF1vC,EAAE2vC,OAGJ,MAAO,CACLP,aAAcA,EAAeR,EAC7BS,iBAAkBA,EAAmBT,EACrCY,aAAcA,EAAeZ,EAC7Ba,iBAAkBA,EAAmBb,EACrCgB,IAAK5vC,EAAE4vC,IAAMhB,EACbiB,IAAK7vC,EAAE6vC,IAAMjB,EACbp+B,KAAMk+B,EAAc1uC,EAAEwQ,KAAOo+B,GAC7BkB,IAAK9vC,EAAE8vC,IAAMlB,EACbmB,IAAK/vC,EAAE+vC,IAAMnB,EAGb9/B,KAAM9O,EAAE8O,MAAQ,EAAI9O,EAAE8O,KAAO8/B,EAAa,EAE9C,C,cC5CA,IAAIoB,EAAqB,KAElBC,eAAeC,EAAOvwC,GAI3B,OAH2B,OAAvBqwC,IACFA,QAiBJC,iBAGE,IAEE,MAAgB,mDADGE,EAAW,IAAIprC,WAAW,IAE/C,CAAE,MAAOwK,GAET,CACA,OAAO,CACT,CA3B+B6gC,IAEtBJ,EAAqBG,EAAWxwC,GAMzC,SAAoBA,GAClB,OAAO,IAAI,GAAOqC,OAAOrC,GAAQ8C,OAAO,MAC1C,CARmD4tC,CAAW1wC,EAC9D,CASAswC,eAAeE,EAAWxwC,GAExB,OCvBK,SAAeA,GACpB,IAAI2wC,EAAM,GACV,IAAK,MAAMC,KAAQ,IAAIxrC,WAAWpF,GAC5B4wC,EAAO,KAAID,GAAO,KACtBA,GAAOC,EAAKrtC,SAAS,IAEvB,OAAOotC,CACT,CDgBSE,OADYC,OAAOC,OAAOjuC,OAAO,QAAS9C,GAEnD,CEhBA,SAASgxC,EAAqB/tC,GAC5B,MAAO,CACLguC,YAAajrC,QAAe,MAAP/C,GACrBiuC,SAAUlrC,QAAe,MAAP/C,GAClBkuC,OAAe,MAAPluC,IAA8B,GACtCmuC,WAAmB,KAAPnuC,EAEhB,CAiBO,MAAMouC,EAKX,WAAA31B,CAAY41B,EAASC,GACnBxvC,KAAKyvC,QAAS,EACdzvC,KAAK0vC,eAAiBF,GAAiB,IAAI9pC,IAC3C1F,KAAK2vC,SAAWJ,GAAW,IAAIrqC,GACjC,CAEA,SAAA0qC,CAAUC,GACR,GAA0B,IAAtBA,EAAM5gC,MAAMmgC,MACdS,EAAMC,OAAS,CAACD,GAChB7vC,KAAK2vC,SAAS3hB,IAAI6hB,EAAMz1B,KAAMy1B,GAC9B7vC,KAAK0vC,eAAeK,OAAOF,EAAMz1B,UAC5B,CACL,IAAI41B,EAAgBhwC,KAAK2vC,SAAShtC,IAAIktC,EAAMz1B,MACvC41B,IACHhwC,KAAK2vC,SAAS3hB,IAAI6hB,EAAMz1B,KAAMy1B,GAC9BG,EAAgBH,GAElBG,EAAcF,OAAOD,EAAM5gC,MAAMmgC,OAASS,EAC1C7vC,KAAK0vC,eAAe1zB,IAAI6zB,EAAMz1B,KAChC,CACF,CAEA,iBAAapN,CAAK/O,GAChB,GAAI0B,OAAOqtB,SAAS/uB,GAClB,OAAOqxC,EAASW,WAAWhyC,GACtB,GAAe,OAAXA,EACT,OAAO,IAAIqxC,EAAS,MAEpB,MAAM,IAAI,EAAc,uCAE5B,CAEA,uBAAaW,CAAWhyC,GACtB,GAAsB,IAAlBA,EAAOb,OACT,MAAM,IAAI,EAAc,oCAG1B,MAAMyb,EAAQ,IAAIy2B,EACZY,EAAS,IAAIzD,EAAaxuC,GAC1BkyC,EAAQD,EAAO1uC,SAAS,OAAQ,GACtC,GAAc,SAAV2uC,EACF,MAAM,IAAI,EAAc,uCAAuCA,KAIjE,MAAMC,QAAoB5B,EAAOvwC,EAAOkJ,MAAM,GAAI,KAC5CkpC,EAAapyC,EAAOkJ,OAAO,IAAI3F,SAAS,OAC9C,GAAI6uC,IAAeD,EACjB,MAAM,IAAI,EACR,iDAAiDC,aAAsBD,KAI3E,MAAMvyB,EAAUqyB,EAAO5W,eACvB,GAAgB,IAAZzb,EACF,MAAM,IAAI,EAAc,iCAAiCA,KAE3D,MAAMyyB,EAAaJ,EAAO5W,eAC1B,IAAI16B,EAAI,EACR,MAAQsxC,EAAOvD,OAAS/tC,EAAI0xC,GAAY,CACtC,MAAMT,EAAQ,CAAC,EACfA,EAAMnC,aAAewC,EAAO5W,eAC5BuW,EAAMlC,iBAAmBuC,EAAO5W,eAChCuW,EAAM/B,aAAeoC,EAAO5W,eAC5BuW,EAAM9B,iBAAmBmC,EAAO5W,eAChCuW,EAAM3B,IAAMgC,EAAO5W,eACnBuW,EAAM1B,IAAM+B,EAAO5W,eACnBuW,EAAM/gC,KAAOohC,EAAO5W,eACpBuW,EAAMzB,IAAM8B,EAAO5W,eACnBuW,EAAMxB,IAAM6B,EAAO5W,eACnBuW,EAAMziC,KAAO8iC,EAAO5W,eACpBuW,EAAMU,IAAML,EAAO/oC,MAAM,IAAI3F,SAAS,OACtC,MAAMyN,EAAQihC,EAAOzb,eACrBob,EAAM5gC,MAAQggC,EAAqBhgC,GAEnC,MAAMuhC,EAAavyC,EAAO0a,QAAQ,EAAGu3B,EAAOtD,OAAS,GAAKsD,EAAOtD,OACjE,GAAI4D,EAAa,EACf,MAAM,IAAI,EAAc,yBAAyBA,KAMnD,GAHAX,EAAMz1B,KAAO81B,EAAO1uC,SAAS,OAAQgvC,GAGjCX,EAAMz1B,KAAKod,SAAS,SAAWqY,EAAMz1B,KAAKod,SAAS,OACrD,MAAM,IAAIgV,EAAoBqD,EAAMz1B,MAMtC,IAAIq2B,EAAU,GAAMP,EAAOtD,OAAS,IAAM,EAE1C,IADgB,IAAZ6D,IAAeA,EAAU,GACtBA,KAAW,CAChB,MAAMvf,EAAMgf,EAAOnX,YACnB,GAAY,IAAR7H,EACF,MAAM,IAAI,EACR,yCAAyCA,YAAc2e,EAAMz1B,QAE1D,GAAI81B,EAAOvD,MAChB,MAAM,IAAI,EAAc,yBAE5B,CAEAkD,EAAMC,OAAS,GAEfj3B,EAAM+2B,UAAUC,GAEhBjxC,GACF,CACA,OAAOia,CACT,CAEA,iBAAI22B,GACF,MAAO,IAAIxvC,KAAK0vC,eAClB,CAEA,WAAIH,GACF,MAAO,IAAIvvC,KAAK2vC,SAASe,UAAUC,KAAK7D,EAC1C,CAEA,cAAI8D,GACF,OAAO5wC,KAAK2vC,QACd,CAEA,eAAIkB,GACF,MAAO,IAAI7wC,KAAKuvC,SAASuB,QAAQjB,GACxBA,EAAMC,OAAO1yC,OAAS,EAAIyyC,EAAMC,OAAO5yB,OAAO6C,GAAKA,GAAK8vB,EAEnE,CAEA,EAAElsC,OAAOC,YACP,IAAK,MAAMisC,KAAS7vC,KAAKuvC,cACjBM,CAEV,CAEA,MAAA9P,EAAO,SAAEoL,EAAQ,MAAE4F,EAAK,IAAER,EAAG,MAAEnB,EAAQ,IAChC2B,IACHA,EAAQ,CACNrD,aAAc,EACdC,iBAAkB,EAClBG,aAAc,EACdC,iBAAkB,EAClBG,IAAK,EACLC,IAAK,EACLr/B,KAAM,EACNs/B,IAAK,EACLC,IAAK,EACLjhC,KAAM,IAGV2jC,EAAQtD,EAAesD,GACvB,MAAMC,EAAYrxC,OAAOqN,KAAKm+B,GACxB0E,EAAQ,CACZnC,aAAcqD,EAAMrD,aACpBC,iBAAkBoD,EAAMpD,iBACxBG,aAAciD,EAAMjD,aACpBC,iBAAkBgD,EAAMhD,iBACxBG,IAAK6C,EAAM7C,IACXC,IAAK4C,EAAM5C,IAIXr/B,KAAMiiC,EAAMjiC,MAAQ,MACpBs/B,IAAK2C,EAAM3C,IACXC,IAAK0C,EAAM1C,IACXjhC,KAAM2jC,EAAM3jC,KACZgN,KAAM+wB,EACNoF,MACAthC,MAAO,CACLigC,aAAa,EACbC,UAAU,EACVC,QACAC,WAAY2B,EAAU5zC,OAAS,KAAQ4zC,EAAU5zC,OAAS,MAE5D0yC,OAAQ,IAGV9vC,KAAK4vC,UAAUC,GAEf7vC,KAAKyvC,QAAS,CAChB,CAEA,QAAO,SAAEtE,IACP,GAAInrC,KAAK2vC,SAASsB,IAAI9F,GACpBnrC,KAAK2vC,SAASI,OAAO5E,QAErB,IAAK,MAAM1gC,KAAOzK,KAAK2vC,SAASvjC,OAC1B3B,EAAIymC,WAAW/F,EAAW,MAC5BnrC,KAAK2vC,SAASI,OAAOtlC,GAKvBzK,KAAK0vC,eAAeuB,IAAI9F,IAC1BnrC,KAAK0vC,eAAeK,OAAO5E,GAE7BnrC,KAAKyvC,QAAS,CAChB,CAEA,KAAA0B,GACEnxC,KAAK2vC,SAASwB,QACdnxC,KAAKyvC,QAAS,CAChB,CAEA,GAAAwB,EAAI,SAAE9F,IACJ,OAAOnrC,KAAK2vC,SAASsB,IAAI9F,EAC3B,CAEA,MAAAiG,GACE,OAAOpxC,KAAKuvC,QACTnH,IAAIyH,GAAS,GAAGA,EAAM/gC,KAAKtN,SAAS,MAAMquC,EAAMU,UAAUV,EAAMz1B,QAChE2C,KAAK,KACV,CAEA,2BAAas0B,CAAexB,GAC1B,MAAMyB,EAAQ3xC,OAAOqN,KAAK6iC,EAAMz1B,MAE1Bhd,EAAkD,EAAzC6B,KAAKsyC,MAAM,GAAKD,EAAMl0C,OAAS,GAAK,GAC7Co0C,EAAU7xC,OAAOO,MAAM9C,GACvBq0C,EAAS,IAAIhF,EAAa+E,GAC1BE,EAAOjE,EAAeoC,GAc5B,OAbA4B,EAAOtwC,cAAcuwC,EAAKhE,cAC1B+D,EAAOtwC,cAAcuwC,EAAK/D,kBAC1B8D,EAAOtwC,cAAcuwC,EAAK5D,cAC1B2D,EAAOtwC,cAAcuwC,EAAK3D,kBAC1B0D,EAAOtwC,cAAcuwC,EAAKxD,KAC1BuD,EAAOtwC,cAAcuwC,EAAKvD,KAC1BsD,EAAOtwC,cAAcuwC,EAAK5iC,MAC1B2iC,EAAOtwC,cAAcuwC,EAAKtD,KAC1BqD,EAAOtwC,cAAcuwC,EAAKrD,KAC1BoD,EAAOtwC,cAAcuwC,EAAKtkC,MAC1BqkC,EAAOtyC,MAAM0wC,EAAMU,IAAK,GAAI,OAC5BkB,EAAOxW,cA7PX,SAA+B4U,GAC7B,MAAM5gC,EAAQ4gC,EAAM5gC,MAMpB,OAJAA,EAAMkgC,UAAW,EAGjBlgC,EAAMogC,WAAapwC,KAAK4B,IAAIlB,OAAOqN,KAAK6iC,EAAMz1B,MAAMhd,OAAQ,OAEzD6R,EAAMigC,YAAc,MAAqB,IACzCjgC,EAAMkgC,SAAW,MAAqB,KACvB,EAAdlgC,EAAMmgC,QAAiB,KACL,KAAnBngC,EAAMogC,WAEX,CAgPyBsC,CAAsB9B,IAC3C4B,EAAOtyC,MAAM0wC,EAAMz1B,KAAMk3B,EAAMl0C,OAAQ,QAChCo0C,CACT,CAEA,cAAMI,GACJ,MAAM/vB,EAASliB,OAAOO,MAAM,IACtBuxC,EAAS,IAAIhF,EAAa5qB,GAChC4vB,EAAOtyC,MAAM,OAAQ,EAAG,QACxBsyC,EAAOtwC,cAAc,GACrBswC,EAAOtwC,cAAcnB,KAAK6wC,YAAYzzC,QAEtC,IAAIy0C,EAAe,GACnB,IAAK,MAAMhC,KAAS7vC,KAAKuvC,QAEvB,GADAsC,EAAa1lC,KAAKmjC,EAAS+B,eAAexB,IACtCA,EAAMC,OAAO1yC,OAAS,EACxB,IAAK,MAAMgyC,KAASS,EAAMC,OACpBV,GAASA,IAAUS,GACrBgC,EAAa1lC,KAAKmjC,EAAS+B,eAAejC,IAKlDyC,QAAqBvsC,QAAQs+B,IAAIiO,GAEjC,MAAMC,EAAOnyC,OAAOkH,OAAOgrC,GACrBE,EAAOpyC,OAAOkH,OAAO,CAACgb,EAAQiwB,IAC9BE,QAAYxD,EAAOuD,GACzB,OAAOpyC,OAAOkH,OAAO,CAACkrC,EAAMpyC,OAAOqN,KAAKglC,EAAK,QAC/C,EC/RF,IAAIC,EAAO,KAEX,MAAMC,EAAavuC,OAAO,cAkDnB,MAAM,EAaX,oBAAa6G,EAAQ,GAAE0/B,EAAE,OAAEC,EAAM,MAAEztB,EAAK,cAAEy1B,GAAgB,GAAQC,GAC3D11B,EAAMw1B,KACTx1B,EAAMw1B,GA1DH,CACL9J,IAAK,IAAIljC,IACT6rC,MAAO,IAAI7rC,MA2DX,MAAMimC,EAAW,GAAGhB,UAEpB,IAAIniC,EADS,OAATiqC,IAAeA,EAAO,IAAI,EAAU,CAAE5nC,WAAYrL,OAEtD,IAAIwwC,EAAgB,GA4BpB,aA3BMyC,EAAKznC,QAAQ2gC,EAAUoD,UAK3B,MAAM8D,EAAgB31B,EAAMw1B,SArClC3D,eAA4BrE,EAAIiB,EAAUzuB,GACxC,MAAM41B,EAAa51B,EAAMq0B,MAAMpuC,IAAIwoC,GACnC,QAAmBxpC,IAAf2wC,EAA0B,OAAO,EACrC,GAAmB,OAAfA,EAAqB,OAAO,EAEhC,MAAMC,QAAkBrI,EAAGsI,MAAMrH,GACjC,OAAkB,OAAdoH,GC1DC,SAAsB1C,EAAOkB,EAAOtK,GAAW,EAAMgM,GAAW,GAGrE,MAAMn0C,EAAImvC,EAAeoC,GACnB/wC,EAAI2uC,EAAesD,GASzB,OAPGtK,GAAYnoC,EAAEwQ,OAAShQ,EAAEgQ,MAC1BxQ,EAAEwvC,eAAiBhvC,EAAEgvC,cACrBxvC,EAAEovC,eAAiB5uC,EAAE4uC,cACrBpvC,EAAE8vC,MAAQtvC,EAAEsvC,KACZ9vC,EAAE+vC,MAAQvvC,EAAEuvC,KACXoE,GAAYn0C,EAAE6vC,MAAQrvC,EAAEqvC,KACzB7vC,EAAE8O,OAAStO,EAAEsO,IAEjB,CD6CSslC,CAAaJ,EAAYC,EAClC,CA8BgBI,CAAazI,EAAIiB,EAAUkH,UA1D3C9D,eAAqCrE,EAAIiB,EAAUzuB,GACjD,MAAOg1B,EAAMkB,SAAsBttC,QAAQs+B,IAAI,CAC7CsG,EAAGsI,MAAMrH,GACTjB,EAAGlsC,KAAKmtC,KAGJtyB,QAAcy2B,EAAStiC,KAAK4lC,GAElCl2B,EAAM0rB,IAAIpa,IAAImd,EAAUtyB,GAExB6D,EAAMq0B,MAAM/iB,IAAImd,EAAUuG,EAC5B,CAgDcmB,CAAsB3I,EAAIiB,EAAUkH,GAE5C,MAAMx5B,EAAQw5B,EAAcjK,IAAIzlC,IAAIwoC,GAGpC,GAFAqE,EAAgB32B,EAAM22B,cAElBA,EAAcpyC,SAAW+0C,EAC3B,MAAM,IAAI7F,EAAmBkD,GAG/B,GADAxnC,QAAeoqC,EAAQv5B,GACnBA,EAAM42B,OAAQ,CAGhB,MAAMxxC,QAAe4a,EAAM+4B,iBACrB1H,EAAG/qC,MAAMgsC,EAAUltC,GAEzBo0C,EAActB,MAAM/iB,IAAImd,QAAgBjB,EAAGsI,MAAMrH,IACjDtyB,EAAM42B,QAAS,CACjB,IAGKznC,CACT,EEhHK,MAAM8qC,UAAwB7G,EAInC,WAAAtyB,CAAYzc,GACVy/B,MAAM,6CAA6Cz/B,OACnD8C,KAAKqlB,KAAOrlB,KAAKsG,KAAOwsC,EAAgBztB,KACxCrlB,KAAKO,KAAO,CAAErD,QAChB,EAGF41C,EAAgBztB,KAAO,kBCXhB,MAAM0tB,UAAuB9G,EAIlC,WAAAtyB,CAAYq5B,GACVrW,MAAM,8CAA8CqW,4EAC7CA,wDAGPhzC,KAAKqlB,KAAOrlB,KAAKsG,KAAOysC,EAAe1tB,KACvCrlB,KAAKO,KAAO,CAAEyyC,SAChB,EAGFD,EAAe1tB,KAAO,iBCdf,MAAM,UAAsB4mB,EAIjC,WAAAtyB,CAAYs5B,GACVtW,MAAM,kBAAkBsW,MACxBjzC,KAAKqlB,KAAOrlB,KAAKsG,KAAO,EAAc+e,KACtCrlB,KAAKO,KAAO,CAAE0yC,OAChB,EAGF,EAAc5tB,KAAO,gBCbd,MAAM6tB,EACX,WAAAv5B,CAAY7F,GAGV,GAFA9T,KAAKmzC,KAAO,IAAIjuC,IAChBlF,KAAKmoC,aAAe,GAChBr0B,EAAM,CACR,IAAIrJ,EAAM,KACVzK,KAAKmoC,aAAer0B,EACjBojB,OACAjb,MAAM,MACNmsB,IAAIC,IACH,GAAI,QAAQzvB,KAAKyvB,GACf,MAAO,CAAEA,OAAMj0B,SAAS,GAE1B,MAAMxV,EAAIypC,EAAK1vB,QAAQ,KACvB,GAAI0vB,EAAK6I,WAAW,KAAM,CAGxB,MAAMh0C,EAAQmrC,EAAKlhC,MAAM,GAGzB,OADAnH,KAAKmzC,KAAKnlB,IAAIvjB,EAAM,MAAOvN,GACpB,CAAEmrC,OAAM+K,IAAK3oC,EAAK4oC,OAAQn2C,EACnC,CAAO,CAEL,MAAMA,EAAQmrC,EAAKlhC,MAAM,EAAGvI,GAG5B,OAFA6L,EAAM49B,EAAKlhC,MAAMvI,EAAI,GACrBoB,KAAKmzC,KAAKnlB,IAAIvjB,EAAKvN,GACZ,CAAEmrC,OAAM+K,IAAK3oC,EAAK8lC,IAAKrzC,EAChC,GAEN,CACA,OAAO8C,IACT,CAEA,WAAOgN,CAAK8G,GACV,OAAO,IAAIo/B,EAAcp/B,EAC3B,CAEA,OAAOs/B,GACLpzC,KAAKmoC,aAAenoC,KAAKmoC,aAAajrB,OAAO2yB,GAASA,EAAMuD,MAAQA,GACpEpzC,KAAKmzC,KAAKpD,OAAOqD,EACnB,CAEA,QAAA5xC,GACE,OAAOxB,KAAKmoC,aAAaC,IAAI,EAAGC,UAAWA,GAAMtrB,KAAK,MAAQ,IAChE,EC1CK,MAAMu2B,EACX,WAAA35B,EAAY,WAAE45B,EAAU,UAAEC,EAAS,MAAEC,EAAK,YAAEC,IAC1CrqC,OAAOyL,OAAO9U,KAAM,CAClBuzC,aACAC,YACAC,QACAC,eAEJ,CAEA,WAAO1mC,CAAK2mC,GACV,MAAOC,EAAYL,EAAYM,EAAiBL,EAAWM,GACzDH,EAAQ1rC,MAAM,gCAAgCd,MAAM,GAChDssC,EAAuB,MAAfG,EACRG,EAAmC,MAApBF,EAIrB,GAAIE,KAHmC,MAAnBD,GAIlB,MAAM,IAAI,EAAc,mBAE1B,OAAO,IAAIR,EAAW,CACpBC,aACAC,YACAC,QACAC,YAAaK,GAGjB,CAEA,SAAAC,CAAUC,GACR,GAAIj0C,KAAK0zC,aACP,GAAIO,EAAa/C,WAAWlxC,KAAKuzC,YAC/B,OAAOvzC,KAAKwzC,UAAYS,EAAahtC,QAAQjH,KAAKuzC,WAAY,SAGhE,GAAIU,IAAiBj0C,KAAKuzC,WAAY,OAAOvzC,KAAKwzC,UAEpD,OAAO,IACT,CAEA,gBAAAU,CAAiBC,GACf,GAAIn0C,KAAK0zC,aACP,GAAIS,EAAYjD,WAAWlxC,KAAKwzC,WAC9B,OAAOxzC,KAAKuzC,WAAaY,EAAYltC,QAAQjH,KAAKwzC,UAAW,SAG/D,GAAIW,IAAgBn0C,KAAKwzC,UAAW,OAAOxzC,KAAKuzC,WAElD,OAAO,IACT,EClDK,MAAMa,EACX,WAAAz6B,CAAY06B,EAAQ,IAClBr0C,KAAKq0C,MAAQA,CACf,CAEA,WAAOrnC,CAAKsnC,GACV,MAAMD,EAAQ,GACd,IAAK,MAAMV,KAAWW,EACpBD,EAAMloC,KAAKmnC,EAAWtmC,KAAK2mC,IAE7B,OAAO,IAAIS,EAAcC,EAC3B,CAEA,GAAAr4B,CAAI23B,GACF,MAAMn4B,EAAO83B,EAAWtmC,KAAK2mC,GAC7B3zC,KAAKq0C,MAAMloC,KAAKqP,EAClB,CAEA,SAAAw4B,CAAUO,GACR,MAAMvsC,EAAS,GACf,IAAK,MAAMwT,KAAQxb,KAAKq0C,MACtB,IAAK,MAAMG,KAAaD,EAAY,CAClC,MAAME,EAAWj5B,EAAKw4B,UAAUQ,GAC5BC,GACFzsC,EAAOmE,KAAK,CAACqoC,EAAWC,GAE5B,CAEF,OAAOzsC,CACT,CAEA,YAAA0sC,CAAaF,GACX,IAAIxsC,EAAS,KACb,IAAK,MAAMwT,KAAQxb,KAAKq0C,MAAO,CAC7B,MAAMI,EAAWj5B,EAAKw4B,UAAUQ,GAC5BC,IACFzsC,EAASysC,EAEb,CACA,OAAOzsC,CACT,CAEA,eAAA2sC,GACE,OAAO30C,KAAKq0C,MACTn3B,OAAO1B,GAAQA,EAAKk4B,aACpBtL,IAAI5sB,GAAQA,EAAKg4B,UAAUvsC,QAAQ,MAAO,IAC/C,EChDK,SAAS2tC,EAAgBrpB,EAAGP,GAEjC,MAAMC,EAAKM,EAAEtkB,QAAQ,UAAW,IAC1BikB,EAAKF,EAAE/jB,QAAQ,UAAW,IAC1BiqB,IAAQjG,EAAKC,MAASD,EAAKC,GACjC,OAAY,IAARgG,EACK3F,EAAEub,SAAS,OAAS,GAAK,EAE3B5V,CACT,CCOA,MAAM2jB,EAAWzB,GAAO,CACtB,GAAGA,IACH,QAAQA,IACR,aAAaA,IACb,cAAcA,IACd,gBAAgBA,IAChB,gBAAgBA,UAIZ0B,EAAY,CAAC,SAAU,cAAe,QAAS,UAAW,aAEhE,IAAI,EAEJvG,eAAewG,EAAY3B,EAAK5J,GAE9B,YADa7nC,IAAT,IAAoB,EAAO,IAAI,GAC5B,EAAK6I,QAAQ4oC,EAAK5J,EAC3B,CAKO,MAAMwL,EAgBX,6BAAaC,EAAiB,GAC5B/K,EAAE,OACFC,EAAM,OACN6I,EAAM,KACNG,EAAI,QACJ+B,EAAO,KACPC,EAAI,SACJb,EAAoB,MACpBc,GAAQ,EAAK,UACbC,GAAY,IAGZ,IAAK,MAAMn4C,KAASi2C,EAAKzC,SACvB,IAAKxzC,EAAM+K,MAAM,gBACf,MAAM,IAAI6qC,EAAgB51C,GAG9B,MAAMisC,QAAec,EAAiBtnC,IAAI,CAAEunC,KAAIC,WAChD,IAAKmK,EAAU,CAEb,GAAwB,KADxBA,QAAiBnL,EAAOH,OAAO,UAAUgK,YAC5B51C,OACX,MAAM,IAAI21C,EAAeC,GAG3BsB,EAASpoC,QAAQ,sBAAsB8mC,SACzC,CACA,MAAMW,EAAUS,EAAcpnC,KAAKsnC,GAC7BgB,EAAoB,IAAIpwC,IAE9B,GAAImwC,EAAW,CACb,MAAMF,QAAaH,EAAcO,SAAS,CACxCrL,KACAC,SACAgB,SAAU,oBAEN6J,EAAcQ,WAAW,CAC7BtL,KACAC,SACAgJ,KAAMgC,EAAK/M,IAAIna,GAAO,aAAaA,MAEvC,CAEA,GAAIknB,EACF,IAAK,MAAMM,KAAatC,EAAK/mC,OAC3B,GAAIqpC,EAAUvE,WAAW,eAAiBuE,EAAU3O,SAAS,eAE/CkO,EAAczJ,OAAO,CAAErB,KAAIC,SAAQiJ,IAAKqC,IAAe,CAEjE,MAAMlF,EAAM4C,EAAKxwC,IAAI8yC,GACrBH,EAAkBtnB,IAAIynB,EAAWlF,EACnC,CAKN,MAAMmF,EAAkB/B,EAAQK,UAAU,IAAIb,EAAK/mC,SACnD,IAAK,MAAOqpC,EAAWE,KAAkBD,EAAiB,CACxD,MAAMx4C,EAAQi2C,EAAKxwC,IAAI8yC,GACvBH,EAAkBtnB,IAAI2nB,EAAez4C,EACvC,CACA,MAAM04C,EAAqBjC,EAAQK,UAAU,IAAIkB,EAAQ9oC,SACzD,IAAK,MAAOqpC,EAAWE,KAAkBC,EAAoB,CAC3D,MAAM14C,EAAQg4C,EAAQvyC,IAAI8yC,GACpBI,EAAYlC,EAAQe,aAAax3C,GACnC24C,GACFP,EAAkBtnB,IAAI2nB,EAAe,QAAQE,IAEjD,CAEA,MAAMC,EAAS,GACf,GAAIV,EAAO,CACT,IAAK,MAAMjK,KAAYwI,EAAQgB,kBAAmB,CAChD,MAAMxB,SACE6B,EAAcO,SAAS,CAC3BrL,KACAC,SACAgB,cAEF/C,IAAIwD,GAAQ,GAAGT,KAAYS,KAC7B,IAAK,MAAMwH,KAAOD,EACXmC,EAAkBrE,IAAImC,IACzB0C,EAAO3pC,KAAKinC,EAGlB,CACI0C,EAAO14C,OAAS,SACZ43C,EAAcQ,WAAW,CAAEtL,KAAIC,SAAQgJ,KAAM2C,GAEvD,CAgBA,IAAK,MAAOrrC,EAAKvN,KAAUo4C,QACnBP,EAAYtqC,EAAK8jC,SACrBrE,EAAG/qC,MAAM,EAAKgrC,EAAQ1/B,GAAM,GAAGvN,EAAMg6B,WAAY,SAGrD,MAAO,CAAE4e,SACX,CAaA,qBAAaC,EAAS,GAAE7L,EAAE,OAAEC,EAAM,IAAEiJ,EAAG,MAAEl2C,IAEvC,IAAKA,EAAM+K,MAAM,gBACf,MAAM,IAAI6qC,EAAgB51C,SAEtB63C,EAAY3B,EAAK7E,SACrBrE,EAAG/qC,MAAM,EAAKgrC,EAAQiJ,GAAM,GAAGl2C,EAAMg6B,WAAY,QAErD,CAYA,6BAAa8e,EAAiB,GAAE9L,EAAE,OAAEC,EAAM,IAAEiJ,EAAG,MAAEl2C,UACzC63C,EAAY3B,EAAK7E,SACrBrE,EAAG/qC,MAAM,EAAKgrC,EAAQiJ,GAAgB,QAAGl2C,EAAMg6B,WAAY,QAE/D,CAWA,sBAAa+e,EAAU,GAAE/L,EAAE,OAAEC,EAAM,IAAEiJ,IACnC,OAAO4B,EAAcQ,WAAW,CAAEtL,KAAIC,SAAQgJ,KAAM,CAACC,IACvD,CAWA,uBAAaoC,EAAW,GAAEtL,EAAE,OAAEC,EAAM,KAAEgJ,UAE9B7tC,QAAQs+B,IAAIuP,EAAK/K,IAAIgL,GAAOlJ,EAAGgM,GAAG,EAAK/L,EAAQiJ,MAErD,IAAIt/B,QAAaihC,EAAY,cAAexG,SAC1CrE,EAAGlsC,KAAK,GAAGmsC,gBAAsB,CAAE98B,SAAU,UAE/C,MAAM8oC,EAASjD,EAAclmC,KAAK8G,GAC5BsiC,EAAaD,EAAOhD,KAAK/lC,KAC/B,IAAK,MAAMgmC,KAAOD,EACZgD,EAAOhD,KAAKlC,IAAImC,IAClB+C,EAAOpG,OAAOqD,GAGd+C,EAAOhD,KAAK/lC,KAAOgpC,IACrBtiC,EAAOqiC,EAAO30C,iBACRuzC,EAAY,cAAexG,SAC/BrE,EAAG/qC,MAAM,GAAGgrC,gBAAsBr2B,EAAM,CAAEzG,SAAU,UAG1D,CAYA,oBAAarC,EAAQ,GAAEk/B,EAAE,OAAEC,EAAM,IAAEiJ,EAAG,MAAE7sB,IACtC,QAAc5kB,IAAV4kB,IAEa,MADfA,EAEE,OAAO6sB,EAKX,GAAIA,EAAIlC,WAAW,SAEjB,OADAkC,EAAMA,EAAIjsC,MAAM,GACT6tC,EAAchqC,QAAQ,CAAEk/B,KAAIC,SAAQiJ,MAAK7sB,UAGlD,GAAmB,KAAf6sB,EAAIh2C,QAAiB,eAAewb,KAAKw6B,GAC3C,OAAOA,EAGT,MAAMiD,QAAkBrB,EAAcsB,WAAW,CAAEpM,KAAIC,WAEjDoM,EAAW1B,EAASzB,GAAKl2B,OAAOxC,IAAMo6B,EAAUtd,SAAS9c,IAE/D,IAAK,MAAM04B,KAAOmD,EAAU,CAC1B,MAAMC,QAAYzB,EAChB3B,EACA7E,eACSrE,EAAGlsC,KAAK,GAAGmsC,KAAUiJ,IAAO,CAAE/lC,SAAU,UAC/CgpC,EAAU1zC,IAAIywC,IAElB,GAAIoD,EACF,OAAOxB,EAAchqC,QAAQ,CAAEk/B,KAAIC,SAAQiJ,IAAKoD,EAAItf,OAAQ3Q,SAEhE,CAEA,MAAM,IAAI,EAAc6sB,EAC1B,CAWA,mBAAa7H,EAAO,GAAErB,EAAE,OAAEC,EAAM,IAAEiJ,IAChC,IAEE,aADM4B,EAAcyB,OAAO,CAAEvM,KAAIC,SAAQiJ,SAClC,CACT,CAAE,MAAO5nC,GACP,OAAO,CACT,CACF,CAWA,mBAAairC,EAAO,GAAEvM,EAAE,OAAEC,EAAM,IAAEiJ,IAEhC,GAAmB,KAAfA,EAAIh2C,QAAiB,eAAewb,KAAKw6B,GAC3C,OAAOA,EAGT,MAAMiD,QAAkBrB,EAAcsB,WAAW,CAAEpM,KAAIC,WAEjDoM,EAAW1B,EAASzB,GAC1B,IAAK,MAAMA,KAAOmD,EAAU,CAI1B,SAHwBxB,EAAY3B,EAAK7E,SACvCrE,EAAGqB,OAAO,GAAGpB,KAAUiJ,MAEV,OAAOA,EACtB,GAAIiD,EAAUpF,IAAImC,GAAM,OAAOA,CACjC,CAEA,MAAM,IAAI,EAAcA,EAC1B,CAUA,6BAAasD,EAAiB,IAAEtD,EAAG,IAAEhL,IAEnC,MAAMmO,EAAW1B,EAASzB,GAC1B,IAAK,MAAMA,KAAOmD,EAChB,SAAUnO,EAAI6I,IAAImC,GAAM,OAAOA,EAGjC,MAAM,IAAI,EAAcA,EAC1B,CAYA,wBAAOuD,EAAkB,IAAEvD,EAAG,QAAEwD,EAAUxD,EAAG,MAAE7sB,EAAiB,IAAE6hB,IAChE,QAAczmC,IAAV4kB,IAEa,MADfA,EAEE,MAAO,CAAEqwB,UAASrG,IAAK6C,GAI3B,GAAIA,EAAIlC,WAAW,SAEjB,OADAkC,EAAMA,EAAIjsC,MAAM,GACT6tC,EAAc2B,kBAAkB,CAAEvD,MAAKwD,UAASrwB,QAAO6hB,QAGhE,GAAmB,KAAfgL,EAAIh2C,QAAiB,eAAewb,KAAKw6B,GAC3C,MAAO,CAAEwD,UAASrG,IAAK6C,GAGzB,MAAMmD,EAAW1B,EAASzB,GAC1B,IAAK,MAAMA,KAAOmD,EAAU,CAC1B,MAAMC,EAAMpO,EAAIzlC,IAAIywC,GACpB,GAAIoD,EACF,OAAOxB,EAAc2B,kBAAkB,CACrCvD,IAAKoD,EAAItf,OACT0f,QAASxD,EACT7sB,QACA6hB,OAGN,CAEA,MAAM,IAAI,EAAcgL,EAC1B,CAUA,uBAAakD,EAAW,GAAEpM,EAAE,OAAEC,IAC5B,MAAMr2B,QAAaihC,EAAY,cAAexG,SAC5CrE,EAAGlsC,KAAK,GAAGmsC,gBAAsB,CAAE98B,SAAU,UAG/C,OADe6lC,EAAclmC,KAAK8G,GACpBq/B,IAChB,CAWA,qBAAaoC,EAAS,GAAErL,EAAE,OAAEC,EAAM,SAAEgB,IAClC,MAAMkL,EAAYrB,EAAcsB,WAAW,CAAEpM,KAAIC,WACjD,IAAI0M,EAAQ,KACZ,IACEA,QAAc3M,EAAG4M,YAAY,GAAG3M,KAAUgB,KAC1C0L,EAAQA,EAAMzO,IAAIroB,GAAKA,EAAE9Y,QAAQ,GAAGkjC,KAAUgB,KAAa,IAC7D,CAAE,MAAO3/B,GACPqrC,EAAQ,EACV,CAEA,IAAK,IAAIpsC,WAAc4rC,GAAWjqC,OAE5B3B,EAAIymC,WAAW/F,KAEjB1gC,EAAMA,EAAIxD,QAAQkkC,EAAW,IAAK,IAE7B0L,EAAMrf,SAAS/sB,IAClBosC,EAAM1qC,KAAK1B,IAMjB,OADAosC,EAAMlG,KAAKiE,GACJiC,CACT,CAWA,yBAAaE,EAAa,GAAE7M,EAAE,OAAEC,EAAM,OAAE6I,IACtC,OAAIA,EACKgC,EAAcO,SAAS,CAC5BrL,KACAC,SACAgB,SAAU,gBAAgB6H,MAGrBgC,EAAcO,SAAS,CAAErL,KAAIC,SAAQgB,SAAU,cAE1D,CAUA,qBAAa6L,EAAS,GAAE9M,EAAE,OAAEC,IAM1B,aALmB6K,EAAcO,SAAS,CACxCrL,KACAC,SACAgB,SAAU,eAEAjuB,OAAO6C,IAAMA,EAAE+mB,SAAS,OACtC,ECveK,MAAMmQ,UAAkBhL,EAM7B,WAAAtyB,CAAYu9B,EAAYC,EAAeC,GACrCza,MAAM,eAAeua,KAAcC,KACnCn3C,KAAKqlB,KAAOrlB,KAAKsG,KAAO2wC,EAAU5xB,KAClCrlB,KAAKO,KAAO,CAAE22C,aAAYC,gBAAeC,WAC3C,EAGFH,EAAU5xB,KAAO,YCbV,MAAMgyB,UAAuBpL,EAKlC,WAAAtyB,CAAY29B,EAASF,GACnBza,MACE,gHAAgH2a,KAElHt3C,KAAKqlB,KAAOrlB,KAAKsG,KAAO+wC,EAAehyB,KACvCrlB,KAAKO,KAAO,CAAE+2C,UAASF,WACzB,EAGFC,EAAehyB,KAAO,iBCdf,MAAMkyB,WAA0BtL,EACrC,WAAAtyB,GACEgjB,MAAM,+BACN38B,KAAKqlB,KAAOrlB,KAAKsG,KAAOixC,GAAkBlyB,KAC1CrlB,KAAKO,KAAO,CAAC,CACf,ECPK,SAASi3C,IAAyB,SAAEC,EAAW,GAAE,SAAEC,EAAW,KACnE,MAAO,SAAS/3C,OAAOqN,KAAK,GAAGyqC,KAAYC,KAAYl2C,SAAS,WAClE,CCAO,SAASm2C,GAAYC,GAC1B,OAAIA,EAASj0C,OAAOk0C,eACXD,EAASj0C,OAAOk0C,iBAErBD,EAASj0C,OAAOC,UACXg0C,EAASj0C,OAAOC,YAErBg0C,EAASvnC,KACJunC,ECRJ,SAAmB16C,GACxB,IAAI46C,EAAQ,CAAC56C,GACb,MAAO,CACLmT,KAAI,IACK/K,QAAQ0F,QAAQ,CAAEM,KAAuB,IAAjBwsC,EAAM16C,OAAcF,MAAO46C,EAAMj7B,QAElEk7B,OAAM,KACJD,EAAQ,GACD,CAAC,GAEV,CAACn0C,OAAOk0C,iBACN,OAAO73C,IACT,EAEJ,CDJSg4C,CAAUJ,EACnB,CEbO,SAASK,GAAmBC,GAMjC,IAAIC,EAAWD,EAAIjwC,MAAM,wBAEzB,GAAgB,MAAZkwC,EAAkB,MAAO,CAAED,MAAKE,KAAM,CAAC,GAC3CD,EAAWA,EAAS,GACpB,MAAOV,EAAUC,GAAYS,EAASl8B,MAAM,KAI5C,MAAO,CAAEi8B,IAFTA,EAAMA,EAAIjxC,QAAQ,GAAGkxC,KAAa,IAEpBC,KAAM,CAAEX,WAAUC,YAClC,CJLAH,GAAkBlyB,KAAO,oBKRlB,MAAMgzB,WAAiCpM,EAC5C,WAAAtyB,GACEgjB,MAAM,mCACN38B,KAAKqlB,KAAOrlB,KAAKsG,KAAO+xC,GAAyBhzB,KACjDrlB,KAAKO,KAAO,CAAC,CACf,EAGF83C,GAAyBhzB,KAAO,2BCRzB,MAAMizB,WAAmBrM,EAK9B,WAAAtyB,CAAY4+B,EAAUhmB,GACpBoK,MAAM,aAAa4b,oBAA2BhmB,OAC9CvyB,KAAKqlB,KAAOrlB,KAAKsG,KAAOgyC,GAAWjzB,KACnCrlB,KAAKO,KAAO,CAAEg4C,WAAUhmB,SAC1B,EAGF+lB,GAAWjzB,KAAO,aCXX,MAAMmzB,GACX,WAAA7+B,CAAY8+B,GAEV,GAAsB,oBAAX94C,OACT,MAAM,IAAI8B,MAAM,6BAElBzB,KAAKy4C,OAASd,GAAYc,GAC1Bz4C,KAAK/B,OAAS,KACd+B,KAAK04C,OAAS,EACd14C,KAAK24C,WAAa,EAClB34C,KAAK44C,SAAU,EACf54C,KAAK64C,QAAS,EACd74C,KAAK84C,gBAAkB,CACzB,CAEA,GAAAnM,GACE,OAAO3sC,KAAK64C,QAAU74C,KAAK04C,SAAW14C,KAAK/B,OAAOb,MACpD,CAEA,IAAAwvC,GACE,OAAO5sC,KAAK84C,gBAAkB94C,KAAK04C,MACrC,CAEA,UAAM7J,GACJ,IAAI7uC,KAAK2sC,QACJ3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,SAAW14C,KAAK/B,OAAOb,eACxB4C,KAAKg5C,aACPh5C,KAAK64C,SAGX,OADA74C,KAAKi5C,YAAY,GACVj5C,KAAK/B,OAAO+B,KAAK24C,WAC1B,CAEA,WAAMn2B,GACJ,IAAIxiB,KAAK2sC,QACJ3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,SAAW14C,KAAK/B,OAAOb,eACxB4C,KAAKg5C,aACPh5C,KAAK64C,SAGX,OADA74C,KAAKi5C,YAAYj5C,KAAK/B,OAAOb,QACtB4C,KAAK/B,OAAOkJ,MAAMnH,KAAK24C,WAAY34C,KAAK04C,OACjD,CAEA,UAAM16C,CAAKqV,GACT,IAAIrT,KAAK2sC,MAOT,OANK3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,OAASrlC,EAAIrT,KAAK/B,OAAOb,SAChC4C,KAAKk5C,cACCl5C,KAAKm5C,YAAY9lC,IAEzBrT,KAAKi5C,YAAY5lC,GACVrT,KAAK/B,OAAOkJ,MAAMnH,KAAK24C,WAAY34C,KAAK04C,OACjD,CAEA,UAAMU,CAAK/lC,GACLrT,KAAK2sC,QACJ3sC,KAAK44C,eAAe54C,KAAK+4C,QAC1B/4C,KAAK04C,OAASrlC,EAAIrT,KAAK/B,OAAOb,SAChC4C,KAAKk5C,cACCl5C,KAAKm5C,YAAY9lC,IAEzBrT,KAAKi5C,YAAY5lC,GACnB,CAEA,UAAMgmC,GACJr5C,KAAK04C,OAAS14C,KAAK24C,UACrB,CAEA,WAAMW,GACJt5C,KAAK44C,SAAU,EACf,IAAI,KAAEttC,EAAI,MAAEpO,SAAgB8C,KAAKy4C,OAAOpoC,OACxC,OAAI/E,IACFtL,KAAK64C,QAAS,GACT37C,GAAcyC,OAAOO,MAAM,IAE9BhD,IACFA,EAAQyC,OAAOqN,KAAK9P,IAEfA,EACT,CAEA,KAAAg8C,GAGEl5C,KAAK/B,OAAS+B,KAAK/B,OAAOkJ,MAAMnH,KAAK24C,YACrC34C,KAAK04C,QAAU14C,KAAK24C,WACpB34C,KAAK84C,iBAAmB94C,KAAK24C,WAC7B34C,KAAK24C,WAAa,CACpB,CAEA,WAAAM,CAAY5lC,GACVrT,KAAK24C,WAAa34C,KAAK04C,OACvB14C,KAAK04C,QAAUrlC,EACXrT,KAAK04C,OAAS14C,KAAK/B,OAAOb,SAC5B4C,KAAK04C,OAAS14C,KAAK/B,OAAOb,OAE9B,CAEA,iBAAM+7C,CAAY9lC,GAChB,GAAIrT,KAAK64C,OAAQ,OAGjB,MAAMU,EAAU,CAACv5C,KAAK/B,QACtB,KAAO+B,KAAK04C,OAASrlC,EAAImmC,GAAcD,IAAU,CAC/C,MAAME,QAAmBz5C,KAAKs5C,QAC9B,GAAIt5C,KAAK64C,OAAQ,MACjBU,EAAQptC,KAAKstC,EACf,CACAz5C,KAAK/B,OAAS0B,OAAOkH,OAAO0yC,EAC9B,CAEA,eAAMP,GACJh5C,KAAK84C,iBAAmB94C,KAAK/B,OAAOb,OACpC4C,KAAK24C,WAAa,EAClB34C,KAAK04C,OAAS,EACd14C,KAAK/B,aAAe+B,KAAKs5C,OAC3B,CAEA,WAAMP,GACJ/4C,KAAK/B,aAAe+B,KAAKs5C,OAC3B,EAKF,SAASE,GAAcD,GACrB,OAAOA,EAAQ59B,OAAO,CAAC+9B,EAAKz7C,IAAWy7C,EAAMz7C,EAAOb,OAAQ,EAC9D,CC3EO,MAAMu8C,GACX,YAAOrnC,GACL,OAAO3S,OAAOqN,KAAK,OAAQ,OAC7B,CAEA,YAAO4sC,GACL,OAAOj6C,OAAOqN,KAAK,OAAQ,OAC7B,CAEA,aAAO6sC,CAAOxR,GACQ,iBAATA,IACTA,EAAO1oC,OAAOqN,KAAKq7B,IAErB,MACMyR,ECvEH,SAAgB9uB,EAAG3X,GACxB,MAAMvU,EAAIuU,EAAE7R,SAAS,IACrB,MAAO,IAAIu4C,ODqEgB,ECrELj7C,EAAE1B,QAAU0B,CACpC,CDoEsBk7C,CAAO,EADV3R,EAAKjrC,OAAS,GAE7B,OAAOuC,OAAOkH,OAAO,CAAClH,OAAOqN,KAAK8sC,EAAW,QAASzR,GACxD,CAEA,mBAAO4R,CAAaxB,GAClB,MAAMvI,EAAS,IAAIsI,GAAaC,GAChC,OAAOlK,iBACL,IACE,IAAInxC,QAAe8yC,EAAOlyC,KAAK,GAC/B,GAAc,MAAVZ,EAAgB,OAAO,EAE3B,GADAA,EAASiI,SAASjI,EAAOoE,SAAS,QAAS,IAC5B,IAAXpE,EAAc,OAAO,KACzB,GAAe,IAAXA,EAAc,OAAO,KACzB,MAAMa,QAAeiyC,EAAOlyC,KAAKZ,EAAS,GAC1C,OAAc,MAAVa,GACGA,CACT,CAAE,MAAOuN,GAEP,OADAitC,EAAOtyC,MAAQqF,GACR,CACT,CACF,CACF,EEvFK+iC,eAAe2L,GAAoBl8C,GAExC,MAAMm8C,EAAgB,CAAC,EAEvB,IAAI9R,EACJ,KACEA,QAAarqC,KACA,IAATqqC,GAFO,CAGX,GAAa,OAATA,EAAe,SACnBA,EAAOA,EAAK7mC,SAAS,QAAQyF,QAAQ,MAAO,IAC5C,MAAMrI,EAAIypC,EAAK1vB,QAAQ,KACvB,GAAI/Z,GAAK,EAAG,CACV,MAAM6L,EAAM49B,EAAKlhC,MAAM,EAAGvI,GACpB1B,EAAQmrC,EAAKlhC,MAAMvI,EAAI,GAC7Bu7C,EAAc1vC,GAAOvN,CACvB,MACEi9C,EAAc9R,IAAQ,CAE1B,CACA,MAAO,CAAE+R,gBAAiB,EAAGD,gBAC/B,CCpBO5L,eAAe8L,GAAoB5B,GAAQ,QAAE6B,IAClD,MAAMC,EAAe,IAAI70C,IACnBytC,EAAO,IAAIjuC,IACXgwC,EAAU,IAAIhwC,IAIdlH,EAAO27C,GAAWM,aAAaxB,GACrC,IAAI+B,QAAgBx8C,IAEpB,KAAmB,OAAZw8C,GAAkBA,QAAgBx8C,IAEzC,IAAgB,IAAZw8C,EAAkB,MAAM,IAAInC,GAGhC,GAAImC,EAAQhjB,SAAS,aACnB,OAAO0iB,GAAoBl8C,GAI7B,GAAIw8C,EAAQh5C,SAAS,QAAQyF,QAAQ,MAAO,MAAQ,aAAaqzC,IAC/D,MAAM,IAAIhC,GAAW,aAAagC,OAAcE,EAAQh5C,SAAS,SAEnE,IAAIi5C,QAAgBz8C,IAEpB,KAAmB,OAAZy8C,GAAkBA,QAAgBz8C,IAGzC,IAAgB,IAAZy8C,EAAkB,MAAO,CAAEF,eAAcpH,OAAM+B,WAInD,GAHAuF,EAAUA,EAAQj5C,SAAS,QAGvBi5C,EAAQjjB,SAAS,aACnB,OAAO0iB,GAAoBl8C,GAG7B,MAAO08C,EAAUC,GAAoBC,GAAeH,EAAS,KAAQ,SAGrE,GAFAE,EAAiB1+B,MAAM,KAAKmsB,IAAIroB,GAAKw6B,EAAav+B,IAAI+D,IAErC,6DAAb26B,EAAyE,CAC3E,MAAOtH,EAAK9sC,GAAQs0C,GAAeF,EAAU,IAAK,KAElD,IADAvH,EAAKnlB,IAAI1nB,EAAM8sC,KACF,CACX,MAAM/K,QAAarqC,IACnB,IAAa,IAATqqC,EAAe,MACnB,GAAa,OAATA,EAAe,CACjB,MAAO+K,EAAK9sC,GAAQs0C,GAAevS,EAAK7mC,SAAS,QAAS,IAAK,KAC/D2xC,EAAKnlB,IAAI1nB,EAAM8sC,EACjB,CACF,CACF,CAEA,IAAK,MAAMyH,KAAON,EAChB,GAAIM,EAAI3J,WAAW,WAAY,CAC7B,MAAM3yC,EAAIs8C,EAAI5yC,MAAM,uBACH,IAAb1J,EAAEnB,QACJ83C,EAAQlnB,IAAIzvB,EAAE,GAAIA,EAAE,GAExB,CAEF,MAAO,CAAE67C,gBAAiB,EAAGG,eAAcpH,OAAM+B,UACnD,CAEA,SAAS0F,GAAevS,EAAMyS,EAAKvC,GACjC,MAAMt8B,EAAQosB,EAAKnR,OAAOjb,MAAM6+B,GAChC,GAAqB,IAAjB7+B,EAAM7e,OACR,MAAM,IAAIk7C,GACR,6BAA6BC,KAC7BlQ,EAAK7mC,SAAS,SAGlB,OAAOya,CACT,CChEA,MAAM8+B,GAAc,CAACC,EAAW9C,IAC9B8C,EAAUlU,SAAS,KACf,GAAGkU,IAAY9C,IACf,GAAG8C,KAAa9C,EAAIjxC,QAAQ,eAAgB,MAE5Cg0C,GAAgB,CAACC,EAAS9C,MAE1BA,EAAKX,UAAYW,EAAKV,YACxBwD,EAAQC,cAAgB3D,GAAyBY,IAG/CA,EAAK8C,SACP7xC,OAAOyL,OAAOomC,EAAS9C,EAAK8C,UAS1BE,GAAgB7M,UACpB,IAEE,MAAMhuC,EAAOZ,OAAOqN,WCnCjBuhC,eAAuBqJ,GAC5B,IAAIxqC,EAAO,EACX,MAAMmsC,EAAU,SCDXhL,eAAwBqJ,EAAUltC,GACvC,MAAM2wC,EAAO1D,GAAYC,GACzB,OAAa,CACX,MAAM,MAAE16C,EAAK,KAAEoO,SAAe+vC,EAAKhrC,OAEnC,GADInT,SAAawN,EAAGxN,GAChBoO,EAAM,KACZ,CACI+vC,EAAKtD,QAAQsD,EAAKtD,QACxB,CDLQuD,CAAS1D,EAAU16C,IACvBq8C,EAAQptC,KAAKjP,GACbkQ,GAAQlQ,EAAM0vB,aAEhB,MAAM5kB,EAAS,IAAI3E,WAAW+J,GAC9B,IAAImuC,EAAY,EAChB,IAAK,MAAMt9C,KAAUs7C,EACnBvxC,EAAOgmB,IAAI/vB,EAAQs9C,GACnBA,GAAat9C,EAAO2uB,WAEtB,OAAO5kB,CACT,CDoBmCwzC,CAAQl2B,EAAIwsB,OACrCsF,EAAW72C,EAAKiB,SAAS,QAG/B,MAAO,CAAE81C,QADPF,EAASh6C,OAAS,IAAMg6C,EAAWA,EAASjwC,MAAM,EAAG,KAAO,MAC5CiwC,WAAU72C,OAC9B,CAAE,MAAOjC,GACP,MAAO,CAAC,CACV,GAGK,MAAMm9C,GAMX,yBAAalB,GACX,MAAO,CAAC,WAAY,UACtB,CAqBA,qBAAamB,EAAS,KACpBC,EAAI,WACJC,EAAU,OACVC,EAAM,cACNC,EAAa,cACbC,EAAa,UACbf,EAAS,QACTV,EACApC,IAAK8D,EAAQ,QACbd,EAAO,gBACPd,IAEA,IAAI,IAAElC,EAAG,KAAEE,GAASH,GAAmB+D,GACvC,MAAMC,EAAejB,EAAYD,GAAYC,EAAW9C,GAAOA,EAQ/D,IAAI5yB,EACA42B,GARA9D,EAAKX,UAAYW,EAAKV,YACxBwD,EAAQC,cAAgB3D,GAAyBY,IAE3B,IAApBgC,IACFc,EAAQ,gBAAkB,aAK5B,IAAIiB,GAAqB,EACzB,GAaE,GAZA72B,QAAYq2B,EAAKS,QAAQ,CACvBR,aACA16B,OAAQ,MACRg3B,IAAK,GAAG+D,uBAAkC3B,IAC1CY,YAIFgB,GAAW,EAIY,MAAnB52B,EAAI4xB,YAAyC,MAAnB5xB,EAAI4xB,WAAoB,CAGpD,MAAMmF,EAAUF,EAAqBJ,EAAgBF,EACrD,GAAIQ,EAAS,CAOX,GAJAjE,QAAaiE,EAAQnE,EAAK,IACrBE,EACH8C,QAAS,IAAKA,KAEZ9C,GAAQA,EAAKkE,OACf,MAAM,IAAI/E,GACDa,IACT6C,GAAcC,EAAS9C,GACvB+D,GAAqB,EACrBD,GAAW,EAEf,CACF,MACqB,MAAnB52B,EAAI4xB,YACJiF,GACAL,SAEMA,EAAc5D,EAAKE,SAEpB8D,GAET,GAAuB,MAAnB52B,EAAI4xB,WAAoB,CAC1B,MAAM,SAAEE,SAAmBgE,GAAc91B,GACzC,MAAM,IAAI2xB,EAAU3xB,EAAI4xB,WAAY5xB,EAAI6xB,cAAeC,EACzD,CAEA,GACE9xB,EAAI41B,QAAQ,kBAAoB,iBAAiBZ,kBACjD,CACA,MAAMiC,QAAmBlC,GAAoB/0B,EAAIwsB,KAAM,CAAEwI,YAEzD,OADAiC,EAAWnE,KAAOA,EACXmE,CACT,CAAO,CAIL,MAAM,QAAEjF,EAAO,SAAEF,EAAQ,KAAE72C,SAAe66C,GAAc91B,GAGxD,IACE,MAAMi3B,QAAmBlC,GAAoB,CAAC95C,GAAO,CAAE+5C,YAEvD,OADAiC,EAAWnE,KAAOA,EACXmE,CACT,CAAE,MAAOj+C,GACP,MAAM,IAAI+4C,EAAeC,EAASF,EACpC,CACF,CACF,CAiBA,oBAAaoF,EAAQ,KACnBb,EAAI,WACJC,EAAU,UACVZ,EAAS,QACTV,EAAO,IACPpC,EAAG,KACHE,EAAI,KACJtG,EAAI,QACJoJ,IAIA,MAAMuB,EAAUxE,GAAmBC,GAC/BuE,IAASvE,EAAMuE,EAAQvE,KAEvB8C,IAAW9C,EAAM6C,GAAYC,EAAW9C,IAE5CgD,EAAQ,gBAAkB,iBAAiBZ,YAC3CY,EAAQwB,OAAS,iBAAiBpC,WAClCW,GAAcC,EAAS9C,GAEvB,MAAM9yB,QAAYq2B,EAAKS,QAAQ,CAC7BR,aACA16B,OAAQ,OACRg3B,IAAK,GAAGA,KAAOoC,IACfxI,OACAoJ,YAEF,GAAuB,MAAnB51B,EAAI4xB,WAAoB,CAC1B,MAAM,SAAEE,GAAagE,GAAc91B,GACnC,MAAM,IAAI2xB,EAAU3xB,EAAI4xB,WAAY5xB,EAAI6xB,cAAeC,EACzD,CACA,OAAO9xB,CACT,EGvNK,MAAMq3B,WAA8B1Q,EAMzC,WAAAtyB,CAAYu+B,EAAK0E,EAAWC,GAC1BlgB,MACE,eAAeub,gDAAkD0E,MAEnE58C,KAAKqlB,KAAOrlB,KAAKsG,KAAOq2C,GAAsBt3B,KAC9CrlB,KAAKO,KAAO,CAAE23C,MAAK0E,YAAWC,aAChC,EAGFF,GAAsBt3B,KAAO,wBCftB,MAAMy3B,WAAsB7Q,EAIjC,WAAAtyB,CAAYu+B,GACVvb,MAAM,6BAA6Bub,MACnCl4C,KAAKqlB,KAAOrlB,KAAKsG,KAAOw2C,GAAcz3B,KACtCrlB,KAAKO,KAAO,CAAE23C,MAChB,EAGF4E,GAAcz3B,KAAO,gBCJd,MAAM03B,GAUX,yBAAOC,EAAmB,IAAE9E,IAE1B,MAAM+E,EAAgB,IAAI/3C,IAC1B+3C,EAAcjvB,IAAI,OAAQytB,IAC1BwB,EAAcjvB,IAAI,QAASytB,IAE3B,MAAM7zC,EAsBV,UAAwB,IAAEswC,IAExB,GAAIA,EAAIhH,WAAW,QACjB,MAAO,CACL0L,UAAW,MACXM,QAAShF,GAGb,MAAM9xB,EAAU8xB,EAAIjwC,MAAM,uBAC1B,OAAgB,OAAZme,EAQe,QAAfA,EAAQ,GACH,CACLw2B,UAAWx2B,EAAQ,GACnB82B,QAAS92B,EAAQ,IASF,OAAfA,EAAQ,GACH,CACLw2B,UAAWx2B,EAAQ,GACnB82B,QAAS92B,EAAQ,SAHrB,OApBA,CA0BF,CAzDkB+2B,CAAe,CAAEjF,QAC/B,IAAKtwC,EACH,MAAM,IAAIk1C,GAAc5E,GAE1B,GAAI+E,EAAchM,IAAIrpC,EAAMg1C,WAC1B,OAAOK,EAAct6C,IAAIiF,EAAMg1C,WAEjC,MAAM,IAAID,GACRzE,EACAtwC,EAAMg1C,UACc,QAApBh1C,EAAMg1C,UCnCL,SAA4B1E,GAKjC,OAHAA,EAAMA,EAAIjxC,QAAQ,gBAAiB,gBAEzBA,QAAQ,YAAa,WAEjC,CD6BkCm2C,CAAmBlF,QAAOv2C,EAE1D,EEhCF,IAAI,GAAO,KAEJ,MAAM07C,GASX,iBAAar/C,EAAK,GAAEksC,EAAE,OAAEC,IACT,OAAT,KAAe,GAAO,IAAI,GAC9B,MAAMgB,EAAW,EAAKhB,EAAQ,WACxBmT,EAAO,IAAI53C,IAUjB,aATM,GAAK8E,QAAQ2gC,EAAUoD,iBAC3B,MAAMz6B,QAAao2B,EAAGlsC,KAAKmtC,EAAU,CAAE99B,SAAU,SACjD,OAAa,OAATyG,GACgB,KAAhBA,EAAKojB,OADiBomB,OAE1BxpC,EACGojB,OACAjb,MAAM,MACNmsB,IAAImI,GAAO+M,EAAKthC,IAAIu0B,GACzB,GACO+M,CACT,CAYA,kBAAan+C,EAAM,GAAE+qC,EAAE,OAAEC,EAAM,KAAEmT,IAClB,OAAT,KAAe,GAAO,IAAI,GAC9B,MAAMnS,EAAW,EAAKhB,EAAQ,WAC9B,GAAImT,EAAKlwC,KAAO,EAAG,CACjB,MAAM0G,EAAO,IAAIwpC,GAAMvgC,KAAK,MAAQ,WAC9B,GAAKvS,QAAQ2gC,EAAUoD,uBACrBrE,EAAG/qC,MAAMgsC,EAAUr3B,EAAM,CAC7BzG,SAAU,QAEd,EACF,YAEQ,GAAK7C,QAAQ2gC,EAAUoD,uBACrBrE,EAAGgM,GAAG/K,EACd,EAEJ,ECxDK,MAAMoS,WAAwBtR,EAOnC,WAAAtyB,CAAY42B,EAAKhe,EAAQgmB,EAAUpN,GACjCxO,MACE,UAAU4T,KACRpF,EAAW,MAAMA,IAAa,6BACLoN,iBAAwBhmB,MAErDvyB,KAAKqlB,KAAOrlB,KAAKsG,KAAOi3C,GAAgBl4B,KACxCrlB,KAAKO,KAAO,CAAEgwC,MAAKhe,SAAQgmB,WAAUpN,WACvC,ECjBK,SAASqS,IAAa,KAAEl3C,EAAI,MAAEm3C,EAAK,UAAEC,EAAS,eAAEC,IAErD,MAAO,GAAGr3C,MAASm3C,MAAUC,KAD7BC,EAQF,SAA8BC,GAC5B,MAAMz7C,EAWR,SAAoBkR,GAClB,OAAOpU,KAAKkD,KAAKkR,KAAOhK,OAAOw0C,GAAGxqC,GAAI,IAAM,EAAI,EAClD,CAbeyqC,CAgBA,KADczqC,EAfiBuqC,GAgB3BvqC,GAAKA,GADxB,IAA6BA,EAd3BuqC,EAAU3+C,KAAKK,IAAIs+C,GACnB,MAAMG,EAAQ9+C,KAAKO,MAAMo+C,EAAU,IACnCA,GAAmB,GAARG,EACX,IAAIC,EAAWp4C,OAAOm4C,GAClBE,EAAar4C,OAAOg4C,GAGxB,OAFII,EAAS5gD,OAAS,IAAG4gD,EAAW,IAAMA,GACtCC,EAAW7gD,OAAS,IAAG6gD,EAAa,IAAMA,KAC5B,IAAV97C,EAAc,IAAM,KAAO67C,EAAWC,CAChD,CAlBmBC,CAAqBP,IAExC,CCHO,SAASQ,GAAkB5oC,GAOhC,OAHAA,GAFAA,EAAMA,EAAItO,QAAQ,MAAO,KAEfA,QAAQ,OAAQ,KAEhBA,QAAQ,OAAQ,IAAM,IAElC,CCRO,SAASm3C,GAAYC,GAC1B,MAAO,CAAE/3C,EAAMm3C,EAAOC,EAAWx/C,GAAUmgD,EAAOp2C,MAChD,2BAEF,MAAO,CACL3B,OACAm3C,QACAC,UAAWv4C,OAAOu4C,GAClBC,eAAgBW,GAAoBpgD,GAExC,CAMA,SAASogD,GAAoBpgD,GAC3B,IAAK,CAAEiE,EAAM47C,EAAOH,GAAW1/C,EAAO+J,MAAM,sBAE5C,OADA21C,GAAoB,MAATz7C,EAAe,GAAK,IAAsB,GAAhBgD,OAAO44C,GAAc54C,OAAOy4C,IAKpD,KADcvqC,EAHAuqC,GAIVvqC,GAAKA,EADxB,IAA6BA,CAF7B,CHAAkqC,GAAgBl4B,KAAO,kBIfhB,MAAMk5B,GACX,WAAA5kC,CAAYsU,GACV,GAAmB,iBAARA,EACTjuB,KAAKw+C,KAAOvwB,OACP,GAAItuB,OAAOqtB,SAASiB,GACzBjuB,KAAKw+C,KAAOvwB,EAAIzsB,SAAS,YACpB,IAAmB,iBAARysB,EAGhB,MAAM,IAAI,EACR,sDAHFjuB,KAAKw+C,KAAOD,GAAgBnN,OAAOnjB,EAKrC,CACF,CAEA,WAAOjhB,CAAKihB,GACV,OAAO,IAAIswB,GAAgBtwB,EAC7B,CAEA,aAAOmjB,CAAOp0C,GACZ,MAAO,UAAUA,EAAIojB,gBAClBpjB,EAAIwZ,aACLxZ,EAAIixB,eACDuvB,GAAaxgD,EAAIyhD,cAExBzhD,EAAIid,YACJjd,EAAI0hD,OAAS1hD,EAAI0hD,OAAS,IAC1B,CAEA,WAAAC,GACE,OAAO3+C,KAAKw+C,KAAKr3C,MAAM,EAAGnH,KAAKw+C,KAAK7lC,QAAQ,QAC9C,CAEA,OAAAsB,GACE,MAAMgU,EAAMjuB,KAAK4+C,mBACjB,OAAO3wB,EAAI9mB,MAAM8mB,EAAItV,QAAQ,QAAU,EACzC,CAEA,KAAAkmC,GACE,OAAOx1C,OAAOyL,OAAO9U,KAAKk7C,UAAW,CACnCjhC,QAASja,KAAKia,UACdykC,OAAQ1+C,KAAK0+C,UAEjB,CAEA,MAAAtN,GACE,OAAOpxC,KAAKw+C,IACd,CAEA,OAAAtD,GACE,MAAMA,EAAUl7C,KAAK2+C,cAAc1iC,MAAM,MACnC6iC,EAAK,GACX,IAAK,MAAMr3B,KAAKyzB,EACD,MAATzzB,EAAE,GAEJq3B,EAAGA,EAAG1hD,OAAS,IAAM,KAAOqqB,EAAEtgB,MAAM,GAEpC23C,EAAG3yC,KAAKsb,GAGZ,MAAMzqB,EAAM,CAAC,EACb,IAAK,MAAMyqB,KAAKq3B,EAAI,CAClB,MAAMr0C,EAAMgd,EAAEtgB,MAAM,EAAGsgB,EAAE9O,QAAQ,MAC3Bzb,EAAQuqB,EAAEtgB,MAAMsgB,EAAE9O,QAAQ,KAAO,GACnClV,MAAMkH,QAAQ3N,EAAIyN,IACpBzN,EAAIyN,GAAK0B,KAAKjP,GAEdF,EAAIyN,GAAOvN,CAEf,CAOA,OANIF,EAAIyhD,SACNzhD,EAAIyhD,OAASL,GAAYphD,EAAIyhD,SAE3BzhD,EAAI+hD,YACN/hD,EAAI+hD,UAAYX,GAAYphD,EAAI+hD,YAE3B/hD,CACT,CAEA,gBAAA4hD,GACE,MAAM3wB,EAAMkwB,GAAkBn+C,KAAKw+C,MACnC,OAAwD,IAApDvwB,EAAItV,QAAQ,mCAAkDsV,EAC3DA,EAAI9mB,MAAM,EAAG8mB,EAAIoG,YAAY,mCACtC,CAEA,MAAAqqB,GACE,IAA8D,IAA1D1+C,KAAKw+C,KAAK7lC,QAAQ,mCAMtB,OAAOwlC,GALWn+C,KAAKw+C,KAAKr3C,MAC1BnH,KAAKw+C,KAAK7lC,QAAQ,iCAClB3Y,KAAKw+C,KAAK7lC,QAAQ,+BAChB,IAGN,CAEA,OAAAqmC,GACE,OAAOh/C,KAAK4+C,mBAAqB,IACnC,CAEA,QAAAhN,GACE,OAAOjyC,OAAOqN,KAAKhN,KAAKw+C,KAAM,OAChC,CAEA,iBAAar8C,CAAK8rB,EAAK9rB,EAAM88C,GAC3B,MAAMD,EAAU/wB,EAAI+wB,UACpB,IAAI,UAAEE,SAAoB/8C,EAAK,CAAE68C,UAASC,cAE1CC,EAAYf,GAAkBe,GAC9B,MAAMC,EAAYH,EAAUE,EAE5B,OAAOX,GAAgBvxC,KAAKmyC,EAC9B,ECpHK,SAASC,GAAO7pC,GACrB,OACEA,EACG2hB,OACAjb,MAAM,MACNmsB,IAAIroB,GAAK,IAAMA,GACfhD,KAAK,MAAQ,IAEpB,CCDO,MAAMsiC,GACX,WAAA1lC,CAAY2lC,GACV,GAAsB,iBAAXA,EACTt/C,KAAKu/C,QAAUD,OACV,GAAI3/C,OAAOqtB,SAASsyB,GACzBt/C,KAAKu/C,QAAUD,EAAO99C,SAAS,YAC1B,IAAsB,iBAAX89C,EAGhB,MAAM,IAAI,EAAc,gDAFxBt/C,KAAKu/C,QAAUF,GAAUjO,OAAOkO,EAGlC,CACF,CAEA,2BAAOE,EAAqB,QAAER,EAAO,UAAEE,IACrC,MAAMhE,EAAUmE,GAAUV,YAAYK,GAChC/kC,EAAUolC,GAAUI,YAAYT,GAChCM,EAASnB,GACbjD,EAAU,WAAakE,GAAOF,GAAa,KAAOjlC,GAEpD,OAAO,IAAIolC,GAAUC,EACvB,CAEA,WAAOtyC,CAAKsyC,GACV,OAAO,IAAID,GAAUC,EACvB,CAEA,QAAA1N,GACE,OAAOjyC,OAAOqN,KAAKhN,KAAKu/C,QAAS,OACnC,CAGA,OAAArE,GACE,OAAOl7C,KAAK0/C,cACd,CAGA,OAAAzlC,GACE,OAAOolC,GAAUI,YAAYz/C,KAAKu/C,QACpC,CAEA,KAAAV,GACE,OAAOx1C,OAAOyL,OAAO,CAAEmF,QAASja,KAAKia,WAAaja,KAAKk7C,UACzD,CAEA,kBAAOuE,CAAYH,GACjB,OAAOnB,GAAkBmB,EAAOn4C,MAAMm4C,EAAO3mC,QAAQ,QAAU,GACjE,CAEA,kBAAOgmC,CAAYW,GACjB,OAAOA,EAAOn4C,MAAM,EAAGm4C,EAAO3mC,QAAQ,QACxC,CAEA,YAAA+mC,GACE,MAAMxE,EAAUmE,GAAUV,YAAY3+C,KAAKu/C,SAAStjC,MAAM,MACpD6iC,EAAK,GACX,IAAK,MAAMr3B,KAAKyzB,EACD,MAATzzB,EAAE,GAEJq3B,EAAGA,EAAG1hD,OAAS,IAAM,KAAOqqB,EAAEtgB,MAAM,GAEpC23C,EAAG3yC,KAAKsb,GAGZ,MAAMzqB,EAAM,CACV8f,OAAQ,IAEV,IAAK,MAAM2K,KAAKq3B,EAAI,CAClB,MAAMr0C,EAAMgd,EAAEtgB,MAAM,EAAGsgB,EAAE9O,QAAQ,MAC3Bzb,EAAQuqB,EAAEtgB,MAAMsgB,EAAE9O,QAAQ,KAAO,GACnClV,MAAMkH,QAAQ3N,EAAIyN,IACpBzN,EAAIyN,GAAK0B,KAAKjP,GAEdF,EAAIyN,GAAOvN,CAEf,CAOA,OANIF,EAAIqhD,SACNrhD,EAAIqhD,OAASD,GAAYphD,EAAIqhD,SAE3BrhD,EAAI+hD,YACN/hD,EAAI+hD,UAAYX,GAAYphD,EAAI+hD,YAE3B/hD,CACT,CAEA,oBAAO2iD,CAAc3iD,GACnB,IAAIk+C,EAAU,GAMd,GALIl+C,EAAImoB,KACN+1B,GAAW,QAAQl+C,EAAImoB,SAEvB+1B,GAAW,kDAETl+C,EAAI8f,OAAQ,CACd,QAA0Bnb,IAAtB3E,EAAI8f,OAAO1f,OACb,MAAM,IAAI,EAAc,+CAE1B,IAAK,MAAMsd,KAAK1d,EAAI8f,OAClBo+B,GAAW,UAAUxgC,KAEzB,CAQA,OANAwgC,GAAW,UAAUsC,GADNxgD,EAAIqhD,YAGnBnD,GAAW,aAAasC,GADNxgD,EAAI+hD,WAAa/hD,EAAIqhD,YAEnCrhD,EAAI0hD,SACNxD,GAAW,SAAWkE,GAAOpiD,EAAI0hD,SAE5BxD,CACT,CAEA,aAAO9J,CAAOp0C,GACZ,OAAOqiD,GAAUM,cAAc3iD,GAAO,KAAOmhD,GAAkBnhD,EAAIid,QACrE,CAEA,MAAAm3B,GACE,OAAOpxC,KAAKu/C,OACd,CAEA,gBAAAX,GACE,MAAMU,EAASnB,GAAkBn+C,KAAKu/C,SACtC,OAAoC,IAAhCD,EAAO3mC,QAAQ,YAA2B2mC,EAMvCnB,GALSmB,EAAOn4C,MAAM,EAAGm4C,EAAO3mC,QAAQ,aAKZ,KAJnB2mC,EAAOn4C,MACrBm4C,EAAO3mC,QAAQ,iCACb,IAGN,CAEA,gBAAAinC,GAME,OALkB5/C,KAAKu/C,QAAQp4C,MAC7BnH,KAAKu/C,QAAQ5mC,QAAQ,iCACrB3Y,KAAKu/C,QAAQ5mC,QAAQ,+BACnB,ICzIHsD,MAAM,MACNmsB,IAAIroB,GAAKA,EAAE9Y,QAAQ,KAAM,KACzB8V,KAAK,KD0IR,CAEA,iBAAa5a,CAAKm9C,EAAQn9C,EAAM88C,GAC9B,MAAMD,EAAUM,EAAOV,mBACjB3kC,EAAUolC,GAAUI,YAAYH,EAAOC,SAC7C,IAAI,UAAEL,SAAoB/8C,EAAK,CAAE68C,UAASC,cAE1CC,EAAYf,GAAkBe,GAC9B,MACMW,EADUR,GAAUV,YAAYW,EAAOC,SAE3CrE,WAA4BkE,GAAOF,GAAa,KAAOjlC,EAEzD,OAAOolC,GAAUryC,KAAK6yC,EACxB,EErJK,MAAMC,GASX,WAAO/wC,EAAK,KAAEyH,EAAI,OAAE4J,IAClB,MAAMyB,EAAS,GAAGrL,KAAQ4J,EAAOhjB,WAC3B2iD,EAAYl+B,EAAOzkB,OACnB4iD,EAAcD,EAAY3/B,EAAOhjB,OAGjC6iD,EAAgB,IAAI58C,WAAW28C,GACrC,IAAK,IAAIphD,EAAI,EAAGA,EAAImhD,EAAWnhD,IAC7BqhD,EAAcrhD,GAAKijB,EAAOjM,WAAWhX,GAIvC,OAFAqhD,EAAcjyB,IAAI5N,EAAQ2/B,GAEnBE,CACT,CASA,aAAOC,CAAOjiD,GACZ,MAAMa,EAAIb,EAAO0a,QAAQ,IACnB/Z,EAAIX,EAAO0a,QAAQ,GACnBnC,EAAOvY,EAAOkJ,MAAM,EAAGrI,GAAG0C,SAAS,QACnCpE,EAASa,EAAOkJ,MAAMrI,EAAI,EAAGF,GAAG4C,SAAS,QACzC2+C,EAAeliD,EAAOb,QAAUwB,EAAI,GAE1C,GAAIyG,SAASjI,KAAY+iD,EACvB,MAAM,IAAI,EACR,6BAA6B/iD,mBAAwB+iD,cAGzD,MAAO,CACL3pC,OACA4J,OAAQzgB,OAAOqN,KAAK/O,EAAOkJ,MAAMvI,EAAI,IAEzC,E,eCTF,SAASwhD,GAAalQ,GACpB,IAAIloC,EAAS,EACT2D,EAAQ,EACRkjC,EAAO,KACX,GACEA,EAAOqB,EAAOnX,YACd/wB,IAAkB,IAAP6mC,IAAsBljC,EACjCA,GAAS,QACK,IAAPkjC,GACT,OAAO7mC,CACT,CAEA,SAASq4C,GAAcnQ,EAAQjhC,EAAO7B,GACpC,IAAIpF,EAAS,EACT2D,EAAQ,EACZ,KAAOyB,KACO,EAAR6B,IACFjH,GAAUkoC,EAAOnX,aAAeptB,GAElCsD,IAAU,EACVtD,GAAS,EAEX,OAAO3D,CACT,CAEA,SAASs4C,GAAOpQ,EAAQx0B,GAEtB,MAAMmzB,EAAOqB,EAAOnX,YAIpB,GAHa,IAGT8V,EAAa,CAEf,MAAM3wC,EAASmiD,GAAcnQ,EAJlB,GAI0BrB,EAAa,GAClD,IAAIzhC,EAAOizC,GAAcnQ,GAJd,IAIuBrB,IAAgB,EAAG,GAGrD,OADa,IAATzhC,IAAYA,EAAO,OAChBsO,EAAOvU,MAAMjJ,EAAQA,EAASkP,EACvC,CAEE,OAAO8iC,EAAO/oC,MAAM0nC,EAExB,C,eCvBAN,eAAegS,GAAYrQ,GAEzB,IAAIrB,QAAaqB,EAAOrB,OACxB,MAAMr4B,EAAQq4B,GAAQ,EAAK,EAG3B,IAYI2R,EACAC,EAbArjD,EAAgB,GAAPyxC,EAGb,GAAW,IAAPA,EAAmB,CACrB,IAAIljC,EAAQ,EACZ,GACEkjC,QAAaqB,EAAOrB,OACpBzxC,IAAkB,IAAPyxC,IAAsBljC,EACjCA,GAAS,QACK,IAAPkjC,EACX,CAIA,GAAa,IAATr4B,EAAY,CACd,IAAI7K,EAAQ,EACZ60C,EAAM,EACN,MAAM5oB,EAAQ,GACd,GACEiX,QAAaqB,EAAOrB,OACpB2R,IAAe,IAAP3R,IAAsBljC,EAC9BA,GAAS,EACTisB,EAAMzrB,KAAK0iC,SACG,IAAPA,GACT4R,EAAY9gD,OAAOqN,KAAK4qB,EAC1B,CAKA,OAJa,IAATphB,IAEFiqC,QADkBvQ,EAAOlyC,KAAK,KAGzB,CAAEwY,OAAMpZ,SAAQojD,MAAKC,YAC9B,CChGA,IAAIC,IAA8B,EAE3BnS,eAAel8B,GAAQpU,GAI5B,OAHoC,OAAhCyiD,KACFA,GAaJ,WACE,IAEE,GADW,IAAIC,oBAAoB,WAC3B,OAAO,CACjB,CAAE,MAAO9yC,GAET,CACA,OAAO,CACT,CArBkC+yC,IAEzBF,GAKTnS,eAA8BtwC,GAC5B,MAAM4iD,EAAK,IAAIF,oBAAoB,WAC7B9hD,EAAI,IAAIiiD,KAAK,CAAC7iD,IAASw6C,SAASsI,YAAYF,GAClD,OAAO,IAAIx9C,iBAAiB,IAAI29C,SAASniD,GAAGoiD,cAC9C,CARMC,CAAejjD,GACf4W,GAAKxC,QAAQpU,EACnB,CC8BO,MAAMkjD,GACX,WAAAxnC,CAAYynC,GACV/3C,OAAOyL,OAAO9U,KAAMohD,GACpBphD,KAAKqhD,YAAc,CAAC,CACtB,CAEA,oBAAaC,EAAQ,IAAE/Z,EAAG,oBAAEga,IAC1B,MAAMrR,EAAS,IAAIzD,EAAalF,GAGhC,GAAc,aAFA2I,EAAO/oC,MAAM,GAAG3F,SAAS,OAGrC,OAEF,MAAMqc,EAAUqyB,EAAO5W,eACvB,GAAgB,IAAZzb,EACF,MAAM,IAAI,EACR,0BAA0BA,8CAG9B,GAAI0pB,EAAI3a,WAAa,WACnB,MAAM,IAAI,EACR,uHAIJsjB,EAAOrD,KAAKqD,EAAOtD,OAAS,MAE5B,MAAMx/B,EAAO8iC,EAAO5W,eACdkoB,EAAS,GACf,IAAK,IAAI5iD,EAAI,EAAGA,EAAIwO,EAAMxO,IAAK,CAC7B,MAAM0C,EAAO4uC,EAAO/oC,MAAM,IAAI3F,SAAS,OACvCggD,EAAO5iD,GAAK0C,CACd,CACA4uC,EAAOrD,KAAKqD,EAAOtD,OAAS,EAAIx/B,GAGhC,MAAMq0C,EAAU,IAAIv8C,IACpB,IAAK,IAAItG,EAAI,EAAGA,EAAIwO,EAAMxO,IACxB6iD,EAAQzzB,IAAIwzB,EAAO5iD,GAAIsxC,EAAO5W,gBAEhC,MAAMooB,EAAcxR,EAAO/oC,MAAM,IAAI3F,SAAS,OAC9C,OAAO,IAAI2/C,GAAa,CACtBK,SACAG,KAAM,CAAC,EACPF,UACAC,cACAH,uBAEJ,CAEA,qBAAaK,EAAS,KAAEC,EAAI,oBAAEN,EAAmB,WAAE3F,IACjD,MAAMkG,EAAgB,CACpB,EAAG,SACH,EAAG,OACH,EAAG,OACH,EAAG,MACH,EAAG,YACH,EAAG,aAECC,EAAiB,CAAC,EAKlBL,EAAcG,EAAK16C,OAAO,IAAI3F,SAAS,OAEvCggD,EAAS,GACTG,EAAO,CAAC,EACRF,EAAU,IAAIv8C,IACpB,IAAI88C,EAAmB,KACnBC,EAAc,WFzGf1T,eAAwBkK,EAAQn2B,GACrC,MAAM4tB,EAAS,IAAIsI,GAAaC,GAChC,IAAIyJ,QAAahS,EAAOlyC,KAAK,GAE7B,GADAkkD,EAAOA,EAAK1gD,SAAS,QACR,SAAT0gD,EACF,MAAM,IAAI,EAAc,wBAAwBA,MAGlD,IAAIrkC,QAAgBqyB,EAAOlyC,KAAK,GAEhC,GADA6f,EAAUA,EAAQyb,aAAa,GACf,IAAZzb,EACF,MAAM,IAAI,EAAc,6BAA6BA,KAGvD,IAAIskC,QAAmBjS,EAAOlyC,KAAK,GAGnC,GAFAmkD,EAAaA,EAAW7oB,aAAa,KAEjC6oB,EAAa,GAEjB,MAAQjS,EAAOvD,OAASwV,KAAc,CACpC,MAAMjkD,EAASgyC,EAAOtD,QAChB,KAAEp2B,EAAI,OAAEpZ,EAAM,IAAEojD,EAAG,UAAEC,SAAoBF,GAAYrQ,GACrD9gB,EAAW,IAAIva,GAAKqa,QAC1B,MAAQE,EAASpnB,QAAQ,CACvB,MAAMwa,QAAc0tB,EAAO1tB,QAC3B,IAAKA,EAAO,MAEZ,GADA4M,EAASjjB,KAAKqW,GAAO,GACjB4M,EAAS5jB,IACX,MAAM,IAAI,EAAc,eAAe4jB,EAASje,OAElD,GAAIie,EAASpnB,OAAQ,CACnB,GAAIonB,EAASpnB,OAAO5K,SAAWA,EAC7B,MAAM,IAAI,EACR,yEAKE8yC,EAAOmJ,aACPnJ,EAAOlyC,KAAKwkB,EAAMplB,OAASgyB,EAASre,KAAK0C,UAC/C,MAAM1B,EAAMm+B,EAAOtD,aACbtqB,EAAO,CACX/hB,KAAM6uB,EAASpnB,OACfwO,OACAoU,IAAKu3B,EACLjkD,SACA6T,MACA0uC,YACAD,OAEJ,CACF,CACF,CACF,CEsDU4B,CAAS,CAACP,GAAOtT,OAAShuC,OAAMiW,OAAMiqC,YAAWviD,SAAQ0sB,UACpC,OAArBo3B,IAA2BA,EAAmBp3B,GAClD,MAAMy3B,EAAUpjD,KAAKO,MACS,KAA1BwiD,EAAmBp3B,GAAco3B,GAEjCK,IAAYJ,GACVrG,SACIA,EAAW,CACf0G,MAAO,oBACPC,OAAQP,EAAmBp3B,EAC3Bxb,MAAO4yC,IAIbC,EAAcI,GAIV,CAAC,SAAU,OAAQ,OAAQ,OAAO7qB,SAFtChhB,EAAOsrC,EAActrC,KAOD,cAATA,GAKS,cAATA,KATTurC,EAAe7jD,GAAU,CACvBsY,OACAtY,aAgBN,MAAMskD,EAAcn5C,OAAO+C,KAAK21C,GAAgB3Z,IAAIjjC,QACpD,IAAK,MAAOvG,EAAGuxB,KAAUqyB,EAAYjT,UAAW,CAC9C,MAAMx9B,EACJnT,EAAI,IAAM4jD,EAAYplD,OAASykD,EAAKj1B,WAAa,GAAK41B,EAAY5jD,EAAI,GAClEunC,EAAI4b,EAAe5xB,GACnB/D,EAAM/d,GAAMf,IAAIu0C,EAAK16C,MAAMgpB,EAAOpe,MAAU,EAClDo0B,EAAEp0B,IAAMA,EACRo0B,EAAE/Z,IAAMA,CACV,CAGA,MAAM1R,EAAI,IAAIymC,GAAa,CACzBU,KAAMv8C,QAAQ0F,QAAQ62C,GACtBH,cACAC,OACAH,SACAC,UACAF,wBAIFU,EAAc,KACd,IAAI3qC,EAAQ,EACZ,MAAMmrC,EAAiB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACzD,IAAK,IAAIvkD,KAAU6jD,EAAgB,CACjC7jD,EAASiH,OAAOjH,GAChB,MAAMmkD,EAAUpjD,KAAKO,MAAe,IAAR8X,EAAe0qC,GACvCK,IAAYJ,GACVrG,SACIA,EAAW,CACf0G,MAAO,mBACPC,OAAQjrC,EACRlI,MAAO4yC,IAIb1qC,IACA2qC,EAAcI,EAEd,MAAMlc,EAAI4b,EAAe7jD,GACzB,IAAIioC,EAAEoK,IACN,IACE71B,EAAEgoC,UAAY,EACdhoC,EAAEioC,kBAAoB,EACtB,MAAM,KAAEnsC,EAAI,OAAE4J,SAAiB1F,EAAEkoC,UAAU,CAAEzyB,MAAOjyB,IACpDukD,EAAe/nC,EAAEgoC,YAAc,EAC/B,MAAMnS,QAAY/B,EAAOsR,GAAU/wC,KAAK,CAAEyH,OAAM4J,YAChD+lB,EAAEoK,IAAMA,EACRiR,EAAOr1C,KAAKokC,GACZkR,EAAQzzB,IAAIuiB,EAAKryC,GACjByjD,EAAKpR,GAAOpK,EAAE/Z,GAChB,CAAE,MAAO5gB,GACP,QACF,CACF,CAGA,OADAg2C,EAAO7Q,OACAj2B,CACT,CAEA,cAAM9a,GACJ,MAAM25C,EAAU,GACVp6C,EAAQ,CAACoW,EAAKlI,KAClBksC,EAAQptC,KAAKxM,OAAOqN,KAAKuI,EAAKlI,KAGhClO,EAAM,WAAY,OAElBA,EAAM,WAAY,OAElB,MAAM0jD,EAAe,IAAIpW,EAAa9sC,OAAOO,MAAM,OACnD,IAAK,IAAItB,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,IAAI0Y,EAAQ,EACZ,IAAK,MAAMhW,KAAQtB,KAAKwhD,OAClBn8C,SAAS/D,EAAK6F,MAAM,EAAG,GAAI,KAAOvI,GAAG0Y,IAE3CurC,EAAa1hD,cAAcmW,EAC7B,CACAiiC,EAAQptC,KAAK02C,EAAa5kD,QAE1B,IAAK,MAAMqD,KAAQtB,KAAKwhD,OACtBriD,EAAMmC,EAAM,OAGd,MAAMwhD,EAAa,IAAIrW,EAAa9sC,OAAOO,MAA2B,EAArBF,KAAKwhD,OAAOpkD,SAC7D,IAAK,MAAMkE,KAAQtB,KAAKwhD,OACtBsB,EAAW3hD,cAAcnB,KAAK2hD,KAAKrgD,IAErCi4C,EAAQptC,KAAK22C,EAAW7kD,QAExB,MAAM8kD,EAAgB,IAAItW,EAAa9sC,OAAOO,MAA2B,EAArBF,KAAKwhD,OAAOpkD,SAChE,IAAK,MAAMkE,KAAQtB,KAAKwhD,OACtBuB,EAAc5hD,cAAcnB,KAAKyhD,QAAQ9+C,IAAIrB,IAE/Ci4C,EAAQptC,KAAK42C,EAAc9kD,QAE3BkB,EAAMa,KAAK0hD,YAAa,OAExB,MAAMsB,EAAcrjD,OAAOkH,OAAO0yC,GAC5B/C,QAAYhI,EAAOwU,GACnBC,EAAYtjD,OAAOO,MAAM,IAE/B,OADA+iD,EAAU9jD,MAAMq3C,EAAK,OACd72C,OAAOkH,OAAO,CAACm8C,EAAaC,GACrC,CAEA,UAAMC,EAAK,KAAErB,IACX7hD,KAAK6hD,KAAOA,CACd,CAEA,YAAMsB,GACJnjD,KAAK6hD,KAAO,IACd,CAEA,UAAM7jD,EAAK,IAAEuyC,IACX,IAAKvwC,KAAKyhD,QAAQ9+C,IAAI4tC,GAAM,CAC1B,GAAIvwC,KAAKuhD,oBAEP,OADAvhD,KAAK2iD,oBACE3iD,KAAKuhD,oBAAoBhR,GAEhC,MAAM,IAAI,EAAc,yBAAyBA,kBAErD,CACA,MAAMpgB,EAAQnwB,KAAKyhD,QAAQ9+C,IAAI4tC,GAC/B,OAAOvwC,KAAK4iD,UAAU,CAAEzyB,SAC1B,CAEA,eAAMyyB,EAAU,MAAEzyB,IAChB,GAAInwB,KAAKqhD,YAAYlxB,GACnB,OAAO9mB,OAAOyL,OAAO,CAAC,EAAG9U,KAAKqhD,YAAYlxB,IAE5CnwB,KAAK0iD,YACL,MAQMb,QAAa7hD,KAAK6hD,KACxB,IAAKA,EACH,MAAM,IAAI,EACR,2GAGJ,MAAMtgC,EAAMsgC,EAAK16C,MAAMgpB,GACjB+f,EAAS,IAAIzD,EAAalrB,GAC1BstB,EAAOqB,EAAOnX,YAEdqqB,EAAe,IAAPvU,EACd,IAAIr4B,EAnBU,CACZ,GAAW,SACX,GAAW,OACX,GAAW,OACX,GAAW,MACX,GAAW,YACX,IAAW,aAaI4sC,GACjB,QAAazhD,IAAT6U,EACF,MAAM,IAAI,EAAc,wBAA0B4sC,EAAM5hD,SAAS,IAInE,MAAM6hD,EAAkB,GAAPxU,EACjB,IAAIzxC,EAASimD,EAGY,IAAPxU,IAEhBzxC,EA3RN,SAA2B8yC,EAAQoT,GACjC,IAAIt7C,EAASs7C,EACT33C,EAAQ,EACRkjC,EAAO,KACX,GACEA,EAAOqB,EAAOnX,YACd/wB,IAAkB,IAAP6mC,IAAsBljC,EACjCA,GAAS,QACK,IAAPkjC,GACT,OAAO7mC,CACT,CAiReu7C,CAAkBrT,EAAQmT,IAErC,IAAIjsC,EAAO,KACPgJ,EAAS,KAEb,GAAa,cAAT5J,EAAsB,CACxB,MAAMtY,EAtTZ,SAAsBgyC,GACpB,MAAMtY,EAAQ,GACd,IAAIiX,EAAO,EACP2U,EAAY,EAChB,EAAG,CACD3U,EAAOqB,EAAOnX,YAEd,MAAM0qB,EAAmB,IAAP5U,EAClBjX,EAAMzrB,KAAKs3C,GAGXD,EAAmB,IAAP3U,CACd,OAAS2U,GAIT,OAAO5rB,EAAMjc,OAAO,CAAC4P,EAAGP,IAAQO,EAAI,GAAM,EAAKP,GAAI,EACrD,CAqSqB04B,CAAaxT,GACtByT,EAAaxzB,EAAQjyB,IACvBkiB,OAAQhJ,EAAMZ,cAAexW,KAAK4iD,UAAU,CAAEzyB,MAAOwzB,IAC3D,CACA,GAAa,cAATntC,EAAsB,CACxB,MAAM+5B,EAAML,EAAO/oC,MAAM,IAAI3F,SAAS,SAClC4e,OAAQhJ,EAAMZ,cAAexW,KAAKhC,KAAK,CAAEuyC,QAC/C,CAEA,MAAMtyC,EAASsjB,EAAIpa,MAAM+oC,EAAOtD,QAGhC,GAFAxsB,EAASzgB,OAAOqN,WAAWqF,GAAQpU,IAE/BmiB,EAAOwM,aAAexvB,EACxB,MAAM,IAAI,EACR,6CAA6CA,uBAA4BgjB,EAAOwM,cAWpF,OARIxV,IACFgJ,EAASzgB,OAAOqN,KH1Uf,SAAoB42C,EAAOloC,GAChC,MAAMw0B,EAAS,IAAIzD,EAAamX,GAC1BC,EAAazD,GAAalQ,GAEhC,GAAI2T,IAAenoC,EAAOkR,WACxB,MAAM,IAAI,EACR,2CAA2Ci3B,uCAAgDnoC,EAAOte,gBAGtG,MAAM0mD,EAAa1D,GAAalQ,GAChC,IAAI/Y,EAEJ,MAAM4sB,EAAUzD,GAAOpQ,EAAQx0B,GAE/B,GAAIqoC,EAAQn3B,aAAek3B,EACzB3sB,EAAS4sB,MACJ,CAEL5sB,EAASx3B,OAAOO,MAAM4jD,GACtB,MAAMrS,EAAS,IAAIhF,EAAatV,GAGhC,IAFAsa,EAAOz/B,KAAK+xC,IAEJ7T,EAAOvD,OACb8E,EAAOz/B,KAAKsuC,GAAOpQ,EAAQx0B,IAG7B,MAAMkxB,EAAO6E,EAAO7E,OACpB,GAAIkX,IAAelX,EACjB,MAAM,IAAI,EACR,2CAA2CkX,wCAAiDlX,UAGlG,CACA,OAAOzV,CACT,CGwS2B6sB,CAAW5jC,EAAQhJ,KAGtCpX,KAAK0iD,UAAY,IAEnB1iD,KAAKqhD,YAAYlxB,GAAS,CAAE3Z,OAAM4J,WAE7B,CAAE5J,OAAMytC,OAAQ,UAAW7jC,SACpC,ECxVF,MAAM8jC,GAAgBvgD,OAAO,iBAatB,SAASwgD,IAAc,GAC5Bja,EAAE,MACFxtB,EAAK,SACL0nC,EAAQ,oBACR7C,EAAmB,QACnB8C,EAAO,cACPC,IAGK5nC,EAAMwnC,MAAgBxnC,EAAMwnC,IAAiB,IAAIh/C,KACtD,IAAIwV,EAAIgC,EAAMwnC,IAAevhD,IAAIyhD,GAWjC,OAVK1pC,IACHA,EAvBJ6zB,gBAA6B,GAC3BrE,EAAE,SACFka,EAAQ,oBACR7C,EAAmB,QACnB8C,EAAO,cACPC,IAEA,MAAM/c,QAAY2C,EAAGlsC,KAAKomD,GAC1B,OAAOjD,GAAaG,QAAQ,CAAE/Z,MAAKga,uBACrC,CAcQgD,CAAc,CAChBra,KACAka,WACA7C,sBACA8C,UACAC,kBAEF5nC,EAAMwnC,IAAel2B,IAAIo2B,EAAU1pC,IAE9BA,CACT,CCrBO6zB,eAAe,IAAY,GAChCrE,EAAE,MACFxtB,EAAK,OACLytB,EAAM,IACNoG,EAAG,OACH0T,EAAS,YAIT,MAAM1C,EAAsBhR,GAAO,GAAY,CAAErG,KAAIxtB,QAAOytB,SAAQoG,QAEpE,IAAIvoC,EAYJ,GARY,6CAARuoC,IACFvoC,EAAS,CAAEi8C,OAAQ,UAAW7jC,OAAQzgB,OAAOqN,KAAK,cAG/ChF,IACHA,QCpCGumC,gBAA+B,GAAErE,EAAE,OAAEC,EAAM,IAAEoG,IAClD,MAAM70B,EAAS,WAAW60B,EAAIppC,MAAM,EAAG,MAAMopC,EAAIppC,MAAM,KACjDykC,QAAa1B,EAAGlsC,KAAK,GAAGmsC,KAAUzuB,KACxC,OAAKkwB,EAGE,CAAExrB,OAAQwrB,EAAMqY,OAAQ,WAAYvoC,UAFlC,IAGX,CD6BmB,CAAgB,CAAEwuB,KAAIC,SAAQoG,UAG1CvoC,EAAQ,CASX,GARAA,QEnCGumC,gBAAgC,GACrCrE,EAAE,MACFxtB,EAAK,OACLytB,EAAM,IACNoG,EAAG,OACH0T,EAAS,UAAS,oBAClB1C,IAIA,IAAI3hC,QAAasqB,EAAGsa,QAAQ,EAAKra,EAAQ,iBACzCvqB,EAAOA,EAAK1C,OAAO6C,GAAKA,EAAE+mB,SAAS,SACnC,IAAK,MAAMsd,KAAYxkC,EAAM,CAC3B,MAAM6kC,EAAY,GAAGta,kBAAuBia,IACtC1pC,QAAUypC,GAAc,CAC5Bja,KACAxtB,QACA0nC,SAAUK,EACVlD,wBAEF,GAAI7mC,EAAEvU,MAAO,MAAM,IAAI,EAAcuU,EAAEvU,OAEvC,GAAIuU,EAAE+mC,QAAQxQ,IAAIV,GAAM,CAEtB,MAAMmU,EAAWD,EAAUx9C,QAAQ,OAAQ,QACtCyT,EAAEmnC,OACLnnC,EAAEmnC,KAAO3X,EAAGlsC,KAAK0mD,IAEnB,MAAM7C,QAAannC,EAAEmnC,KACrB,IAAKA,EAEH,MADAnnC,EAAEmnC,KAAO,KACH,IAAI,EACR,8BAA8B6C,4EAMlC,IAAKhqC,EAAEiqC,kBAAmB,CACxB,MAAMC,EAAuBlqC,EAAEgnC,YAIzBmD,EAAchD,EAAKzsC,UAAU,IAC7B0vC,EAAiBrhD,MAAMuJ,KAAK63C,GAC/Bzc,IAAIpd,GAAKA,EAAExpB,SAAS,IAAIujD,SAAS,EAAG,MACpChoC,KAAK,IACR,GAAI+nC,IAAmBF,EACrB,MAAM,IAAI,EACR,uCAAuCA,UAA6BE,qCAOxE,MAAM9F,EAAU6C,EAAKzsC,SAAS,GAAI,IAC5B4vC,QAAyBxW,EAAOwQ,GACtC,GAAIgG,IAAqBJ,EACvB,MAAM,IAAI,EACR,0CAA0CI,kBAAiCJ,gDAK/ElqC,EAAEiqC,mBAAoB,CACxB,CAEA,MAAM38C,QAAe0S,EAAE1c,KAAK,CAAEuyC,MAAKgR,wBAGnC,OAFAv5C,EAAOi8C,OAAS,UAChBj8C,EAAO0T,OAAS,gBAAgB0oC,EAASn9C,QAAQ,OAAQ,UAClDe,CACT,CACF,CAEA,OAAO,IACT,CFzCmBi9C,CAAiB,CAC9B/a,KACAxtB,QACAytB,SACAoG,MACAgR,yBAGGv5C,EACH,MAAM,IAAI,EAAcuoC,GAI1B,OAAOvoC,CACT,CAGA,GAAe,aAAXi8C,EACF,OAAOj8C,EAST,GALsB,aAAlBA,EAAOi8C,SACTj8C,EAAOoY,OAASzgB,OAAOqN,WAAWqF,GAAQrK,EAAOoY,SACjDpY,EAAOi8C,OAAS,WAGH,YAAXA,EACF,OAAOj8C,EAGT,MAAMwuC,QAAYhI,EAAOxmC,EAAOoY,QAChC,GAAIo2B,IAAQjG,EACV,MAAM,IAAI,EACR,8BAA8BA,eAAiBiG,KAGnD,MAAM,OAAEp2B,EAAM,KAAE5J,GAASspC,GAAUI,OAAOl4C,EAAOoY,QAKjD,GAJApY,EAAOwO,KAAOA,EACdxO,EAAOoY,OAASA,EAChBpY,EAAOi8C,OAAS,UAED,YAAXA,EACF,OAAOj8C,EAGT,MAAM,IAAI,EAAc,6BAA6Bi8C,KACvD,CGlFO1V,eAAe2W,IAAc,GAAEhb,EAAE,MAAExtB,EAAK,OAAEytB,EAAM,IAAEoG,IACvD,MAAM,KAAE/5B,EAAI,OAAE4J,SAAiB,GAAW,CAAE8pB,KAAIxtB,QAAOytB,SAAQoG,QAE/D,GAAa,QAAT/5B,EAEF,OAAO0uC,GAAc,CAAEhb,KAAIxtB,QAAOytB,SAAQoG,IAD1CA,EAAMgO,GAAgBvxC,KAAKoT,GAAQy+B,QAAQz+B,SAG7C,GAAa,WAAT5J,EACF,MAAM,IAAI+mC,GAAgBhN,EAAK/5B,EAAM,UAEvC,MAAO,CAAE8oC,OAAQD,GAAUryC,KAAKoT,GAASmwB,MAC3C,CCZA,ICmBI,GDnBA4U,GAA4B,KECzB5W,eAAe,IAAa,GACjCrE,EAAE,OACFC,EAAM,KACN3zB,EAAI,OACJ4J,EAAM,OACN6jC,EAAS,UAAS,IAClB1T,EAAe,OACf6U,GAAS,IAYT,MAVe,aAAXnB,IACa,YAAXA,IACF7jC,EAAS0/B,GAAU/wC,KAAK,CAAEyH,OAAM4J,YAElCmwB,QAAY/B,EAAOpuB,GACnBA,EAASzgB,OAAOqN,WFbbuhC,eAAuBtwC,GAI5B,OAHkC,OAA9BknD,KACFA,GAaJ,WACE,IAME,OALW,IAAIE,kBAAkB,WAC9BznD,SAASub,QAEG,IAAI2nC,KAAK,IAAIrI,SACrB6D,UACA,CACT,CAAE,MAAOzuC,GACP,OAAO,CACT,CACF,CAxBgCy3C,IAEvBH,GAKT5W,eAA8BtwC,GAC5B,MAAMsnD,EAAK,IAAIF,kBAAkB,WAC3BjmD,EAAI,IAAI0hD,KAAK,CAAC7iD,IAASw6C,SAASsI,YAAYwE,GAClD,OAAO,IAAIliD,iBAAiB,IAAI29C,SAAS5hD,GAAG6hD,cAC9C,CARMuE,CAAevnD,GACf4W,GAAKqN,QAAQjkB,EACnB,CEM+BikB,CAAQ9B,KAEhCglC,SCnBA7W,gBAAgC,GAAErE,EAAE,OAAEC,EAAM,OAAE/pB,EAAM,OAAE6jC,EAAM,IAAE1T,IACnE,GAAe,aAAX0T,EACF,MAAM,IAAI,EACR,yEAGJ,MACM9Y,EAAW,GAAGhB,aADMoG,EAAIppC,MAAM,EAAG,MAAMopC,EAAIppC,MAAM,WAK3C+iC,EAAGqB,OAAOJ,UAAkBjB,EAAG/qC,MAAMgsC,EAAU/qB,EAC7D,CDQUqlC,CAAiB,CAAEvb,KAAIC,SAAQ/pB,SAAQ6jC,OAAQ,WAAY1T,QAE5DA,CACT,CEvBO,MAAMmV,WAA4BzZ,EAMvC,WAAAtyB,CAAYy5B,EAAKyJ,GACflgB,MACE,IAAIyW,8EAAgFyJ,QAEtF78C,KAAKqlB,KAAOrlB,KAAKsG,KAAOo/C,GAAoBrgC,KAC5CrlB,KAAKO,KAAO,CAAE6yC,MAAKyJ,aACrB,EAGF6I,GAAoBrgC,KAAO,sBCfpB,MAAMsgC,WAAyB1Z,EAIpC,WAAAtyB,CAAYisC,GACVjpB,MACE,4BAA4BipB,iDAE9B5lD,KAAKqlB,KAAOrlB,KAAKsG,KAAOq/C,GAAiBtgC,KACzCrlB,KAAKO,KAAO,CAAEqlD,OAChB,EAGFD,GAAiBtgC,KAAO,mBCfjB,MAAMwgC,GAGX,uCAAWC,GACT,MAAMC,GAAgB,IAAI5hD,MAAO6hD,oBAC3BC,EAAchnD,KAAKK,IAAIL,KAAKO,MAAMumD,EAAgB,KAClDG,EAAyBjnD,KAAKK,IAAIymD,EAAgB,IACrDvkD,WACAujD,SAAS,EAAG,KAEf,MAAO,GADMgB,EAAgB,EAAI,IAAM,MACtBE,EACdzkD,WACAujD,SAAS,EAAG,OAAOmB,GACxB,CAEA,6BAAOC,CAAuB9H,EAAQ+H,EAAansC,GACjD,MAAMosC,EAAchI,EAAO/3C,KAAKW,QAAQ,MAAO,IAEzCy2C,EAAYz+C,KAAKO,MAAM2E,KAAKmiD,MAAQ,KACpC3I,EAAiBkI,GAAYC,6BACnC,MAAO,4CAAUM,KAAeC,KAAehI,EAAOZ,SAASC,KAAaC,MAAmB1jC,KACjG,CAEA,0BAAOssC,CAAoBC,EAAc1xB,GAAS,GAQhD,OAPoB0xB,EAAavqC,MAAM,MAEpCiB,OAAOsoB,GAAKA,GACZihB,UACAre,IAAI,CAACC,EAAMd,IACVzS,EAAS,UAAUyS,OAASc,EAAKpsB,MAAM,MAAM,KAAOosB,EAG1D,ECVKkG,eAAemY,IAAW,GAAExc,EAAE,OAAEC,EAAM,KAAE/vB,IAE7C,aADqB6vB,EAAiBtnC,IAAI,CAAEunC,KAAIC,YAClCxnC,IAAIyX,EACpB,CCpB6BzW,OAAO,iBCQ7B,MAAMgjD,GASX,WAAAhtC,EAAY,GAAEuwB,EAAE,IAAE/V,EAAG,OAAEgW,EAAS,EAAKhW,EAAK,UACxC9qB,OAAOyL,OAAO9U,KAAM,CAClBkqC,KACA/V,MACAgW,SACAyc,QAAS,MAEb,CAOA,mBAAWC,GACT,MAAO,YACT,CAOA,uBAAWC,GACT,MAAO,iBACT,CAOA,gBAAIC,GACF,OAAO,EAAK/mD,KAAKmqC,OAAQwc,GAAgBE,SAC3C,CAOA,oBAAIG,GACF,OAAO,EAAKhnD,KAAKmqC,OAAQwc,GAAgBG,aAC3C,CAQA,eAAMG,GACJ,IAAKjnD,KAAK4mD,UACR5mD,KAAK4mD,cCxDJrY,gBAAqC,GAAErE,EAAE,OAAEC,EAAM,OAAEkU,EAAM,OAAEiB,IAChE,MAAM5B,EAAYz+C,KAAKO,MAAM2E,KAAKmiD,MAAQ,KAapCY,EC/BD,SAAuB/vB,KAAWgO,GACvC,IAAK,MAAMzpB,KAAUypB,EACnB,GAAIzpB,EACF,IAAK,MAAMjR,KAAOpB,OAAO+C,KAAKsP,GAAS,CACrC,MAAMwY,EAAMxY,EAAOjR,QACP9I,IAARuyB,IACFiD,EAAO1sB,GAAOypB,EAElB,CAGJ,OAAOiD,CACT,CDmB2BgwB,CACvB,CAAC,EAZmB,CACpB7gD,WAAYogD,GAAW,CAAExc,KAAIC,SAAQ/vB,KAAM,cAC3CqjC,YAAciJ,GAAW,CAAExc,KAAIC,SAAQ/vB,KAAM,gBAAoB,GACjEsjC,YACAC,eAAgB,IAAIx5C,KAAiB,IAAZu5C,GAAkBsI,qBAU3C1G,EAASA,EAAOjB,YAAS18C,EACzB08C,GAGF,QAA8B18C,IAA1BulD,EAAiB5gD,KAIrB,OAAO4gD,CACT,CD8B2BE,CAAsB,CACzCld,GAAIlqC,KAAKkqC,GACTC,OAAQnqC,KAAKmqC,OACbkU,OAAQ,CAAC,KAENr+C,KAAK4mD,SAAS,MAAM,IAAIjB,GAAiB,UAEhD,OAAO3lD,KAAK4mD,OACd,CASA,iBAAMS,CAAYC,EAAQC,GACxB,aAAYvnD,KAAKkqC,GAAGqB,OAAOvrC,KAAK+mD,eAK9BQ,SAAuBvnD,KAAKwnD,iBAAiB,CAAE1yB,QAAQ,KAC1CwyB,GAAQrrC,MAAM,KAAK,GALzB,IAMX,CAWA,sBAAMwrC,EAAiB,QAAExtC,EAAO,KAAEkL,EAAI,OAAErI,IACtC,OGhGGyxB,gBAA4B,GAAErE,EAAE,OAAEC,EAAM,OAAEmV,IAE/C,MAAMl/B,EAASi/B,GAAUryC,KAAKsyC,GAAQ1N,WAQtC,aAPkB,GAAY,CAC5B1H,KACAC,SACA3zB,KAAM,SACN4J,SACA6jC,OAAQ,WAGZ,CHqFWyD,CAAa,CAClBxd,GAAIlqC,KAAKkqC,GACTC,OAAQnqC,KAAKmqC,OACbmV,OAAQ,CACNrlC,UACAkL,OACArI,SACAuhC,aAAcr+C,KAAKinD,YACnBlI,gBAAiB/+C,KAAKinD,cAG5B,CASA,qBAAMU,CAAgBL,GACpB,MAAMC,QAAqBvnD,KAAKwnD,iBAAiB,CAAE1yB,QAAQ,IAC3D,GAAe,IAAXwyB,IAEEA,EAAS,GAAKA,EAASC,EAAanqD,OAAS,GAC/C,MAAM,IAAIsoD,GACR,SAAS4B,IACT,uDAKN,MAAMM,QAAiB5nD,KAAKqnD,YAAYC,EAAQC,GAChD,OAAKK,EIhIFrZ,gBAA2B,GAAErE,EAAE,MAAExtB,EAAK,OAAEytB,EAAM,IAAEoG,IACrD,MAAM,OAAE+O,EAAQ/O,IAAKsX,SAAoB3C,GAAc,CACrDhb,KACAxtB,QACAytB,SACAoG,QAQF,MANe,CACbA,IAAKsX,EACLvI,OAAQA,EAAOT,QACfG,QAASM,EAAOV,mBAIpB,CJuHWkJ,CAAY,CACjB5d,GAAIlqC,KAAKkqC,GACTxtB,MAAO,CAAC,EACRytB,OAAQnqC,KAAKmqC,OACboG,IAAKqX,IARE,CAAC,CAUZ,CAQA,mBAAMG,CAAc3B,GAClB,OAAOpR,EAAce,SAAS,CAC5B7L,GAAIlqC,KAAKkqC,GACTC,OAAQnqC,KAAKmqC,OACbiJ,IAAKuT,GAAgBE,SACrB3pD,MAAOkpD,GAEX,CAUA,2BAAM4B,EAAsB,YAAE5B,EAAW,QAAEnsC,IACzC,MAAMokC,QAAer+C,KAAKinD,YACpBpX,EAAQgW,GAAYM,uBACxB9H,EACA+H,EACAnsC,GAEIkxB,EAAWnrC,KAAKgnD,uBRpKnBzY,eAA2B6E,EAAK5J,GAErC,YADa7nC,IAAT,KAAoB,GAAO,IAAI,GAC5B,GAAK6I,QAAQ4oC,EAAK5J,EAC3B,CQmKU,CAAY,CAAE2B,WAAU0E,SAAStB,UACrC,MAAM0Z,QAAkBjoD,KAAKkqC,GAAGqB,OAAOJ,SAC7BnrC,KAAKkqC,GAAGlsC,KAAKmtC,EAAU,QAC7B,SACEnrC,KAAKkqC,GAAG/qC,MAAMgsC,EAAU8c,EAAWpY,EAAO,SAEpD,CASA,sBAAM2X,EAAiB,OAAE1yB,GAAS,IAChC,UAAY90B,KAAKkqC,GAAGqB,OAAOvrC,KAAKgnD,kBAC9B,MAAO,GAGT,MAAMR,QAAqBxmD,KAAKkqC,GAAGlsC,KAAKgC,KAAKgnD,iBAAkB,QAE/D,OAAOnB,GAAYU,oBAAoBC,EAAc1xB,EACvD,E","sources":["webpack://git/webpack/universalModuleDefinition","webpack://git/./node_modules/define-data-property/index.js","webpack://git/./node_modules/call-bind-apply-helpers/functionCall.js","webpack://git/./node_modules/ieee754/index.js","webpack://git/./node_modules/sha.js/hash.js","webpack://git/./node_modules/math-intrinsics/round.js","webpack://git/./node_modules/get-intrinsic/index.js","webpack://git/./node_modules/call-bind/index.js","webpack://git/./node_modules/has-property-descriptors/index.js","webpack://git/./node_modules/es-define-property/index.js","webpack://git/./node_modules/async-lock/lib/index.js","webpack://git/./node_modules/to-buffer/node_modules/safe-buffer/index.js","webpack://git/./node_modules/call-bind-apply-helpers/functionApply.js","webpack://git/./node_modules/get-proto/Object.getPrototypeOf.js","webpack://git/./node_modules/es-errors/eval.js","webpack://git/./node_modules/has-symbols/shams.js","webpack://git/./node_modules/pako/lib/zlib/inflate.js","webpack://git/./node_modules/math-intrinsics/abs.js","webpack://git/./node_modules/pako/index.js","webpack://git/./node_modules/pako/lib/utils/strings.js","webpack://git/./node_modules/pako/lib/zlib/inftrees.js","webpack://git/./node_modules/call-bind-apply-helpers/applyBind.js","webpack://git/./node_modules/ignore/index.js","webpack://git/./node_modules/crc-32/crc32.js","webpack://git/./node_modules/for-each/index.js","webpack://git/./node_modules/math-intrinsics/sign.js","webpack://git/./node_modules/call-bind-apply-helpers/index.js","webpack://git/./node_modules/call-bind-apply-helpers/actualApply.js","webpack://git/./node_modules/pako/lib/zlib/adler32.js","webpack://git/./node_modules/pako/lib/deflate.js","webpack://git/./node_modules/get-proto/index.js","webpack://git/./node_modules/pako/lib/zlib/trees.js","webpack://git/./node_modules/sha.js/sha1.js","webpack://git/./node_modules/has-symbols/index.js","webpack://git/./node_modules/typed-array-buffer/index.js","webpack://git/./node_modules/pako/lib/zlib/zstream.js","webpack://git/./node_modules/math-intrinsics/isNaN.js","webpack://git/./node_modules/isarray/index.js","webpack://git/./node_modules/pako/lib/zlib/messages.js","webpack://git/./node_modules/pako/lib/zlib/crc32.js","webpack://git/./node_modules/es-errors/uri.js","webpack://git/./node_modules/to-buffer/index.js","webpack://git/./node_modules/is-typed-array/index.js","webpack://git/./node_modules/which-typed-array/index.js","webpack://git/./node_modules/gopd/index.js","webpack://git/./node_modules/math-intrinsics/pow.js","webpack://git/./node_modules/math-intrinsics/max.js","webpack://git/./node_modules/gopd/gOPD.js","webpack://git/./node_modules/call-bound/index.js","webpack://git/./node_modules/possible-typed-array-names/index.js","webpack://git/./node_modules/inherits/inherits_browser.js","webpack://git/./node_modules/function-bind/index.js","webpack://git/./node_modules/set-function-length/index.js","webpack://git/./node_modules/pako/lib/inflate.js","webpack://git/./node_modules/call-bind-apply-helpers/reflectApply.js","webpack://git/./node_modules/dunder-proto/get.js","webpack://git/./node_modules/pako/lib/zlib/inffast.js","webpack://git/./node_modules/pako/lib/zlib/gzheader.js","webpack://git/./node_modules/base64-js/index.js","webpack://git/./node_modules/math-intrinsics/min.js","webpack://git/./node_modules/es-errors/syntax.js","webpack://git/./node_modules/sha.js/node_modules/safe-buffer/index.js","webpack://git/./node_modules/buffer/index.js","webpack://git/./node_modules/pako/lib/zlib/deflate.js","webpack://git/./node_modules/async-lock/index.js","webpack://git/./node_modules/get-proto/Reflect.getPrototypeOf.js","webpack://git/./node_modules/math-intrinsics/floor.js","webpack://git/./node_modules/has-tostringtag/shams.js","webpack://git/./node_modules/available-typed-arrays/index.js","webpack://git/./node_modules/es-errors/range.js","webpack://git/./node_modules/function-bind/implementation.js","webpack://git/./node_modules/es-errors/index.js","webpack://git/./node_modules/es-errors/ref.js","webpack://git/./node_modules/is-callable/index.js","webpack://git/./node_modules/es-object-atoms/index.js","webpack://git/./node_modules/es-errors/type.js","webpack://git/./node_modules/pako/lib/zlib/constants.js","webpack://git/./node_modules/pako/lib/utils/common.js","webpack://git/./node_modules/hasown/index.js","webpack://git/webpack/bootstrap","webpack://git/webpack/runtime/define property getters","webpack://git/webpack/runtime/global","webpack://git/webpack/runtime/hasOwnProperty shorthand","webpack://git/webpack/runtime/make namespace object","webpack://git/./src/models/GitConfig.js","webpack://git/./src/managers/GitConfigManager.js","webpack://git/./src/utils/dirname.js","webpack://git/./src/utils/join.js","webpack://git/./src/managers/GitIgnoreManager.js","webpack://git/./src/utils/basename.js","webpack://git/./src/errors/BaseError.js","webpack://git/./src/errors/UnmergedPathsError.js","webpack://git/./src/errors/InternalError.js","webpack://git/./src/errors/UnsafeFilepathError.js","webpack://git/./src/utils/BufferCursor.js","webpack://git/./src/utils/comparePath.js","webpack://git/./src/utils/compareStrings.js","webpack://git/./src/utils/normalizeMode.js","webpack://git/./src/utils/normalizeStats.js","webpack://git/./src/utils/shasum.js","webpack://git/./src/utils/toHex.js","webpack://git/./src/models/GitIndex.js","webpack://git/./src/managers/GitIndexManager.js","webpack://git/./src/utils/compareStats.js","webpack://git/./src/errors/InvalidOidError.js","webpack://git/./src/errors/NoRefspecError.js","webpack://git/./src/errors/NotFoundError.js","webpack://git/./src/models/GitPackedRefs.js","webpack://git/./src/models/GitRefSpec.js","webpack://git/./src/models/GitRefSpecSet.js","webpack://git/./src/utils/compareRefNames.js","webpack://git/./src/managers/GitRefManager.js","webpack://git/./src/errors/HttpError.js","webpack://git/./src/errors/SmartHttpError.js","webpack://git/./src/errors/UserCanceledError.js","webpack://git/./src/utils/calculateBasicAuthHeader.js","webpack://git/./src/utils/getIterator.js","webpack://git/./src/utils/fromValue.js","webpack://git/./src/utils/extractAuthFromUrl.js","webpack://git/./src/errors/EmptyServerResponseError.js","webpack://git/./src/errors/ParseError.js","webpack://git/./src/utils/StreamReader.js","webpack://git/./src/models/GitPktLine.js","webpack://git/./src/utils/padHex.js","webpack://git/./src/wire/parseCapabilitiesV2.js","webpack://git/./src/wire/parseRefsAdResponse.js","webpack://git/./src/managers/GitRemoteHTTP.js","webpack://git/./src/utils/collect.js","webpack://git/./src/utils/forAwait.js","webpack://git/./src/errors/UnknownTransportError.js","webpack://git/./src/errors/UrlParseError.js","webpack://git/./src/managers/GitRemoteManager.js","webpack://git/./src/utils/translateSSHtoHTTP.js","webpack://git/./src/managers/GitShallowManager.js","webpack://git/./src/errors/ObjectTypeError.js","webpack://git/./src/utils/formatAuthor.js","webpack://git/./src/utils/normalizeNewlines.js","webpack://git/./src/utils/parseAuthor.js","webpack://git/./src/models/GitAnnotatedTag.js","webpack://git/./src/utils/indent.js","webpack://git/./src/models/GitCommit.js","webpack://git/./src/utils/outdent.js","webpack://git/./src/models/GitObject.js","webpack://git/./src/utils/applyDelta.js","webpack://git/./src/utils/git-list-pack.js","webpack://git/./src/utils/inflate.js","webpack://git/./src/models/GitPackIndex.js","webpack://git/./src/storage/readPackIndex.js","webpack://git/./src/storage/readObject.js","webpack://git/./src/storage/readObjectLoose.js","webpack://git/./src/storage/readObjectPacked.js","webpack://git/./src/utils/resolveCommit.js","webpack://git/./src/utils/deflate.js","webpack://git/./src/utils/walkerToTreeEntryMap.js","webpack://git/./src/storage/writeObject.js","webpack://git/./src/storage/writeObjectLoose.js","webpack://git/./src/errors/InvalidRefNameError.js","webpack://git/./src/errors/MissingNameError.js","webpack://git/./src/models/GitRefStash.js","webpack://git/./src/commands/getConfig.js","webpack://git/./src/utils/symbols.js","webpack://git/./src/managers/GitStashManager.js","webpack://git/./src/utils/normalizeAuthorObject.js","webpack://git/./src/utils/assignDefined.js","webpack://git/./src/commands/writeCommit.js","webpack://git/./src/commands/readCommit.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"git\"] = factory();\n\telse\n\t\troot[\"git\"] = factory();\n})(self, () => {\nreturn ","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\n\nvar gopd = require('gopd');\n\n/** @type {import('.')} */\nmodule.exports = function defineDataProperty(\n\tobj,\n\tproperty,\n\tvalue\n) {\n\tif (!obj || (typeof obj !== 'object' && typeof obj !== 'function')) {\n\t\tthrow new $TypeError('`obj` must be an object or a function`');\n\t}\n\tif (typeof property !== 'string' && typeof property !== 'symbol') {\n\t\tthrow new $TypeError('`property` must be a string or a symbol`');\n\t}\n\tif (arguments.length > 3 && typeof arguments[3] !== 'boolean' && arguments[3] !== null) {\n\t\tthrow new $TypeError('`nonEnumerable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 4 && typeof arguments[4] !== 'boolean' && arguments[4] !== null) {\n\t\tthrow new $TypeError('`nonWritable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 5 && typeof arguments[5] !== 'boolean' && arguments[5] !== null) {\n\t\tthrow new $TypeError('`nonConfigurable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 6 && typeof arguments[6] !== 'boolean') {\n\t\tthrow new $TypeError('`loose`, if provided, must be a boolean');\n\t}\n\n\tvar nonEnumerable = arguments.length > 3 ? arguments[3] : null;\n\tvar nonWritable = arguments.length > 4 ? arguments[4] : null;\n\tvar nonConfigurable = arguments.length > 5 ? arguments[5] : null;\n\tvar loose = arguments.length > 6 ? arguments[6] : false;\n\n\t/* @type {false | TypedPropertyDescriptor<unknown>} */\n\tvar desc = !!gopd && gopd(obj, property);\n\n\tif ($defineProperty) {\n\t\t$defineProperty(obj, property, {\n\t\t\tconfigurable: nonConfigurable === null && desc ? desc.configurable : !nonConfigurable,\n\t\t\tenumerable: nonEnumerable === null && desc ? desc.enumerable : !nonEnumerable,\n\t\t\tvalue: value,\n\t\t\twritable: nonWritable === null && desc ? desc.writable : !nonWritable\n\t\t});\n\t} else if (loose || (!nonEnumerable && !nonWritable && !nonConfigurable)) {\n\t\t// must fall back to [[Set]], and was not explicitly asked to make non-enumerable, non-writable, or non-configurable\n\t\tobj[property] = value; // eslint-disable-line no-param-reassign\n\t} else {\n\t\tthrow new $SyntaxError('This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.');\n\t}\n};\n","'use strict';\n\n/** @type {import('./functionCall')} */\nmodule.exports = Function.prototype.call;\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar toBuffer = require('to-buffer');\n\n// prototype class for hash functions\nfunction Hash(blockSize, finalSize) {\n\tthis._block = Buffer.alloc(blockSize);\n\tthis._finalSize = finalSize;\n\tthis._blockSize = blockSize;\n\tthis._len = 0;\n}\n\nHash.prototype.update = function (data, enc) {\n\t/* eslint no-param-reassign: 0 */\n\tdata = toBuffer(data, enc || 'utf8');\n\n\tvar block = this._block;\n\tvar blockSize = this._blockSize;\n\tvar length = data.length;\n\tvar accum = this._len;\n\n\tfor (var offset = 0; offset < length;) {\n\t\tvar assigned = accum % blockSize;\n\t\tvar remainder = Math.min(length - offset, blockSize - assigned);\n\n\t\tfor (var i = 0; i < remainder; i++) {\n\t\t\tblock[assigned + i] = data[offset + i];\n\t\t}\n\n\t\taccum += remainder;\n\t\toffset += remainder;\n\n\t\tif ((accum % blockSize) === 0) {\n\t\t\tthis._update(block);\n\t\t}\n\t}\n\n\tthis._len += length;\n\treturn this;\n};\n\nHash.prototype.digest = function (enc) {\n\tvar rem = this._len % this._blockSize;\n\n\tthis._block[rem] = 0x80;\n\n\t/*\n\t * zero (rem + 1) trailing bits, where (rem + 1) is the smallest\n\t * non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize\n\t */\n\tthis._block.fill(0, rem + 1);\n\n\tif (rem >= this._finalSize) {\n\t\tthis._update(this._block);\n\t\tthis._block.fill(0);\n\t}\n\n\tvar bits = this._len * 8;\n\n\t// uint32\n\tif (bits <= 0xffffffff) {\n\t\tthis._block.writeUInt32BE(bits, this._blockSize - 4);\n\n\t\t// uint64\n\t} else {\n\t\tvar lowBits = (bits & 0xffffffff) >>> 0;\n\t\tvar highBits = (bits - lowBits) / 0x100000000;\n\n\t\tthis._block.writeUInt32BE(highBits, this._blockSize - 8);\n\t\tthis._block.writeUInt32BE(lowBits, this._blockSize - 4);\n\t}\n\n\tthis._update(this._block);\n\tvar hash = this._hash();\n\n\treturn enc ? hash.toString(enc) : hash;\n};\n\nHash.prototype._update = function () {\n\tthrow new Error('_update must be implemented by subclass');\n};\n\nmodule.exports = Hash;\n","'use strict';\n\n/** @type {import('./round')} */\nmodule.exports = Math.round;\n","'use strict';\n\nvar undefined;\n\nvar $Object = require('es-object-atoms');\n\nvar $Error = require('es-errors');\nvar $EvalError = require('es-errors/eval');\nvar $RangeError = require('es-errors/range');\nvar $ReferenceError = require('es-errors/ref');\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\nvar $URIError = require('es-errors/uri');\n\nvar abs = require('math-intrinsics/abs');\nvar floor = require('math-intrinsics/floor');\nvar max = require('math-intrinsics/max');\nvar min = require('math-intrinsics/min');\nvar pow = require('math-intrinsics/pow');\nvar round = require('math-intrinsics/round');\nvar sign = require('math-intrinsics/sign');\n\nvar $Function = Function;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = require('gopd');\nvar $defineProperty = require('es-define-property');\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = require('get-proto');\nvar $ObjectGPO = require('get-proto/Object.getPrototypeOf');\nvar $ReflectGPO = require('get-proto/Reflect.getPrototypeOf');\n\nvar $apply = require('call-bind-apply-helpers/functionApply');\nvar $call = require('call-bind-apply-helpers/functionCall');\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t__proto__: null,\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': $Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': $EvalError,\n\t'%Float16Array%': typeof Float16Array === 'undefined' ? undefined : Float16Array,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': $Object,\n\t'%Object.getOwnPropertyDescriptor%': $gOPD,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': $RangeError,\n\t'%ReferenceError%': $ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': $URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet,\n\n\t'%Function.prototype.call%': $call,\n\t'%Function.prototype.apply%': $apply,\n\t'%Object.defineProperty%': $defineProperty,\n\t'%Object.getPrototypeOf%': $ObjectGPO,\n\t'%Math.abs%': abs,\n\t'%Math.floor%': floor,\n\t'%Math.max%': max,\n\t'%Math.min%': min,\n\t'%Math.pow%': pow,\n\t'%Math.round%': round,\n\t'%Math.sign%': sign,\n\t'%Reflect.getPrototypeOf%': $ReflectGPO\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t__proto__: null,\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('hasown');\nvar $concat = bind.call($call, Array.prototype.concat);\nvar $spliceApply = bind.call($apply, Array.prototype.splice);\nvar $replace = bind.call($call, String.prototype.replace);\nvar $strSlice = bind.call($call, String.prototype.slice);\nvar $exec = bind.call($call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar setFunctionLength = require('set-function-length');\n\nvar $defineProperty = require('es-define-property');\n\nvar callBindBasic = require('call-bind-apply-helpers');\nvar applyBind = require('call-bind-apply-helpers/applyBind');\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = callBindBasic(arguments);\n\tvar adjustedLength = originalFunction.length - (arguments.length - 1);\n\treturn setFunctionLength(\n\t\tfunc,\n\t\t1 + (adjustedLength > 0 ? adjustedLength : 0),\n\t\ttrue\n\t);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar hasPropertyDescriptors = function hasPropertyDescriptors() {\n\treturn !!$defineProperty;\n};\n\nhasPropertyDescriptors.hasArrayLengthDefineBug = function hasArrayLengthDefineBug() {\n\t// node v0.6 has a bug where array lengths can be Set but not Defined\n\tif (!$defineProperty) {\n\t\treturn null;\n\t}\n\ttry {\n\t\treturn $defineProperty([], 'length', { value: 1 }).length !== 1;\n\t} catch (e) {\n\t\t// In Firefox 4-22, defining length on an array throws an exception.\n\t\treturn true;\n\t}\n};\n\nmodule.exports = hasPropertyDescriptors;\n","'use strict';\n\n/** @type {import('.')} */\nvar $defineProperty = Object.defineProperty || false;\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = false;\n\t}\n}\n\nmodule.exports = $defineProperty;\n","'use strict';\n\nvar AsyncLock = function (opts) {\n\topts = opts || {};\n\n\tthis.Promise = opts.Promise || Promise;\n\n\t// format: {key : [fn, fn]}\n\t// queues[key] = null indicates no job running for key\n\tthis.queues = Object.create(null);\n\n\t// lock is reentrant for same domain\n\tthis.domainReentrant = opts.domainReentrant || false;\n\tif (this.domainReentrant) {\n\t\tif (typeof process === 'undefined' || typeof process.domain === 'undefined') {\n\t\t\tthrow new Error(\n\t\t\t\t'Domain-reentrant locks require `process.domain` to exist. Please flip `opts.domainReentrant = false`, ' +\n\t\t\t\t'use a NodeJS version that still implements Domain, or install a browser polyfill.');\n\t\t}\n\t\t// domain of current running func {key : fn}\n\t\tthis.domains = Object.create(null);\n\t}\n\n\tthis.timeout = opts.timeout || AsyncLock.DEFAULT_TIMEOUT;\n\tthis.maxOccupationTime = opts.maxOccupationTime || AsyncLock.DEFAULT_MAX_OCCUPATION_TIME;\n\tthis.maxExecutionTime = opts.maxExecutionTime || AsyncLock.DEFAULT_MAX_EXECUTION_TIME;\n\tif (opts.maxPending === Infinity || (Number.isInteger(opts.maxPending) && opts.maxPending >= 0)) {\n\t\tthis.maxPending = opts.maxPending;\n\t} else {\n\t\tthis.maxPending = AsyncLock.DEFAULT_MAX_PENDING;\n\t}\n};\n\nAsyncLock.DEFAULT_TIMEOUT = 0; //Never\nAsyncLock.DEFAULT_MAX_OCCUPATION_TIME = 0; //Never\nAsyncLock.DEFAULT_MAX_EXECUTION_TIME = 0; //Never\nAsyncLock.DEFAULT_MAX_PENDING = 1000;\n\n/**\n * Acquire Locks\n *\n * @param {String|Array} key \tresource key or keys to lock\n * @param {function} fn \tasync function\n * @param {function} cb \tcallback function, otherwise will return a promise\n * @param {Object} opts \toptions\n */\nAsyncLock.prototype.acquire = function (key, fn, cb, opts) {\n\tif (Array.isArray(key)) {\n\t\treturn this._acquireBatch(key, fn, cb, opts);\n\t}\n\n\tif (typeof (fn) !== 'function') {\n\t\tthrow new Error('You must pass a function to execute');\n\t}\n\n\t// faux-deferred promise using new Promise() (as Promise.defer is deprecated)\n\tvar deferredResolve = null;\n\tvar deferredReject = null;\n\tvar deferred = null;\n\n\tif (typeof (cb) !== 'function') {\n\t\topts = cb;\n\t\tcb = null;\n\n\t\t// will return a promise\n\t\tdeferred = new this.Promise(function(resolve, reject) {\n\t\t\tdeferredResolve = resolve;\n\t\t\tdeferredReject = reject;\n\t\t});\n\t}\n\n\topts = opts || {};\n\n\tvar resolved = false;\n\tvar timer = null;\n\tvar occupationTimer = null;\n\tvar executionTimer = null;\n\tvar self = this;\n\n\tvar done = function (locked, err, ret) {\n\n\t\tif (occupationTimer) {\n\t\t\tclearTimeout(occupationTimer);\n\t\t\toccupationTimer = null;\n\t\t}\n\n\t\tif (executionTimer) {\n\t\t\tclearTimeout(executionTimer);\n\t\t\texecutionTimer = null;\n\t\t}\n\n\t\tif (locked) {\n\t\t\tif (!!self.queues[key] && self.queues[key].length === 0) {\n\t\t\t\tdelete self.queues[key];\n\t\t\t}\n\t\t\tif (self.domainReentrant) {\n\t\t\t\tdelete self.domains[key];\n\t\t\t}\n\t\t}\n\n\t\tif (!resolved) {\n\t\t\tif (!deferred) {\n\t\t\t\tif (typeof (cb) === 'function') {\n\t\t\t\t\tcb(err, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t//promise mode\n\t\t\t\tif (err) {\n\t\t\t\t\tdeferredReject(err);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdeferredResolve(ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\tresolved = true;\n\t\t}\n\n\t\tif (locked) {\n\t\t\t//run next func\n\t\t\tif (!!self.queues[key] && self.queues[key].length > 0) {\n\t\t\t\tself.queues[key].shift()();\n\t\t\t}\n\t\t}\n\t};\n\n\tvar exec = function (locked) {\n\t\tif (resolved) { // may due to timed out\n\t\t\treturn done(locked);\n\t\t}\n\n\t\tif (timer) {\n\t\t\tclearTimeout(timer);\n\t\t\ttimer = null;\n\t\t}\n\n\t\tif (self.domainReentrant && locked) {\n\t\t\tself.domains[key] = process.domain;\n\t\t}\n\n\t\tvar maxExecutionTime = opts.maxExecutionTime || self.maxExecutionTime;\n\t\tif (maxExecutionTime) {\n\t\t\texecutionTimer = setTimeout(function () {\n\t\t\t\tif (!!self.queues[key]) {\n\t\t\t\t\tdone(locked, new Error('Maximum execution time is exceeded ' + key));\n\t\t\t\t}\n\t\t\t}, maxExecutionTime);\n\t\t}\n\n\t\t// Callback mode\n\t\tif (fn.length === 1) {\n\t\t\tvar called = false;\n\t\t\ttry {\n\t\t\t\tfn(function (err, ret) {\n\t\t\t\t\tif (!called) {\n\t\t\t\t\t\tcalled = true;\n\t\t\t\t\t\tdone(locked, err, ret);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t} catch (err) {\n\t\t\t\t// catching error thrown in user function fn\n\t\t\t\tif (!called) {\n\t\t\t\t\tcalled = true;\n\t\t\t\t\tdone(locked, err);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// Promise mode\n\t\t\tself._promiseTry(function () {\n\t\t\t\treturn fn();\n\t\t\t})\n\t\t\t.then(function(ret){\n\t\t\t\tdone(locked, undefined, ret);\n\t\t\t}, function(error){\n\t\t\t\tdone(locked, error);\n\t\t\t});\n\t\t}\n\t};\n\n\tif (self.domainReentrant && !!process.domain) {\n\t\texec = process.domain.bind(exec);\n\t}\n\n\tvar maxPending = opts.maxPending || self.maxPending;\n\n\tif (!self.queues[key]) {\n\t\tself.queues[key] = [];\n\t\texec(true);\n\t}\n\telse if (self.domainReentrant && !!process.domain && process.domain === self.domains[key]) {\n\t\t// If code is in the same domain of current running task, run it directly\n\t\t// Since lock is re-enterable\n\t\texec(false);\n\t}\n\telse if (self.queues[key].length >= maxPending) {\n\t\tdone(false, new Error('Too many pending tasks in queue ' + key));\n\t}\n\telse {\n\t\tvar taskFn = function () {\n\t\t\texec(true);\n\t\t};\n\t\tif (opts.skipQueue) {\n\t\t\tself.queues[key].unshift(taskFn);\n\t\t} else {\n\t\t\tself.queues[key].push(taskFn);\n\t\t}\n\n\t\tvar timeout = opts.timeout || self.timeout;\n\t\tif (timeout) {\n\t\t\ttimer = setTimeout(function () {\n\t\t\t\ttimer = null;\n\t\t\t\tdone(false, new Error('async-lock timed out in queue ' + key));\n\t\t\t}, timeout);\n\t\t}\n\t}\n\n\tvar maxOccupationTime = opts.maxOccupationTime || self.maxOccupationTime;\n\t\tif (maxOccupationTime) {\n\t\t\toccupationTimer = setTimeout(function () {\n\t\t\t\tif (!!self.queues[key]) {\n\t\t\t\t\tdone(false, new Error('Maximum occupation time is exceeded in queue ' + key));\n\t\t\t\t}\n\t\t\t}, maxOccupationTime);\n\t\t}\n\n\tif (deferred) {\n\t\treturn deferred;\n\t}\n};\n\n/*\n * Below is how this function works:\n *\n * Equivalent code:\n * self.acquire(key1, function(cb){\n * self.acquire(key2, function(cb){\n * self.acquire(key3, fn, cb);\n * }, cb);\n * }, cb);\n *\n * Equivalent code:\n * var fn3 = getFn(key3, fn);\n * var fn2 = getFn(key2, fn3);\n * var fn1 = getFn(key1, fn2);\n * fn1(cb);\n */\nAsyncLock.prototype._acquireBatch = function (keys, fn, cb, opts) {\n\tif (typeof (cb) !== 'function') {\n\t\topts = cb;\n\t\tcb = null;\n\t}\n\n\tvar self = this;\n\tvar getFn = function (key, fn) {\n\t\treturn function (cb) {\n\t\t\tself.acquire(key, fn, cb, opts);\n\t\t};\n\t};\n\n\tvar fnx = keys.reduceRight(function (prev, key) {\n\t\treturn getFn(key, prev);\n\t}, fn);\n\n\tif (typeof (cb) === 'function') {\n\t\tfnx(cb);\n\t}\n\telse {\n\t\treturn new this.Promise(function (resolve, reject) {\n\t\t\t// check for promise mode in case keys is empty array\n\t\t\tif (fnx.length === 1) {\n\t\t\t\tfnx(function (err, ret) {\n\t\t\t\t\tif (err) {\n\t\t\t\t\t\treject(err);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tresolve(ret);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tresolve(fnx());\n\t\t\t}\n\t\t});\n\t}\n};\n\n/*\n *\tWhether there is any running or pending asyncFunc\n *\n *\t@param {String} key\n */\nAsyncLock.prototype.isBusy = function (key) {\n\tif (!key) {\n\t\treturn Object.keys(this.queues).length > 0;\n\t}\n\telse {\n\t\treturn !!this.queues[key];\n\t}\n};\n\n/**\n * Promise.try() implementation to become independent of Q-specific methods\n */\nAsyncLock.prototype._promiseTry = function(fn) {\n\ttry {\n\t\treturn this.Promise.resolve(fn());\n\t} catch (e) {\n\t\treturn this.Promise.reject(e);\n\t}\n};\n\nmodule.exports = AsyncLock;\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","'use strict';\n\n/** @type {import('./functionApply')} */\nmodule.exports = Function.prototype.apply;\n","'use strict';\n\nvar $Object = require('es-object-atoms');\n\n/** @type {import('./Object.getPrototypeOf')} */\nmodule.exports = $Object.getPrototypeOf || null;\n","'use strict';\n\n/** @type {import('./eval')} */\nmodule.exports = EvalError;\n","'use strict';\n\n/** @type {import('./shams')} */\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\t/** @type {{ [k in symbol]?: unknown }} */\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (var _ in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\t// eslint-disable-next-line no-extra-parens\n\t\tvar descriptor = /** @type {PropertyDescriptor} */ (Object.getOwnPropertyDescriptor(obj, sym));\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\n//var Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window, src, end - copy, copy, 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* permutation of code lengths */\n [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n utils.arraySet(output, input, next, copy, put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inflate_fast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n/** @type {import('./abs')} */\nmodule.exports = Math.abs;\n","// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign = require('./lib/utils/common').assign;\n\nvar deflate = require('./lib/deflate');\nvar inflate = require('./lib/inflate');\nvar constants = require('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n","// String encode/decode helpers\n'use strict';\n\n\nvar utils = require('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new utils.Buf8(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nexports.utf8border = function (buf, max) {\n var pos;\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar $apply = require('./functionApply');\nvar actualApply = require('./actualApply');\n\n/** @type {import('./applyBind')} */\nmodule.exports = function applyBind() {\n\treturn actualApply(bind, $apply, arguments);\n};\n","// A simple implementation of make-array\nfunction makeArray (subject) {\n return Array.isArray(subject)\n ? subject\n : [subject]\n}\n\nconst EMPTY = ''\nconst SPACE = ' '\nconst ESCAPE = '\\\\'\nconst REGEX_TEST_BLANK_LINE = /^\\s+$/\nconst REGEX_INVALID_TRAILING_BACKSLASH = /(?:[^\\\\]|^)\\\\$/\nconst REGEX_REPLACE_LEADING_EXCAPED_EXCLAMATION = /^\\\\!/\nconst REGEX_REPLACE_LEADING_EXCAPED_HASH = /^\\\\#/\nconst REGEX_SPLITALL_CRLF = /\\r?\\n/g\n// /foo,\n// ./foo,\n// ../foo,\n// .\n// ..\nconst REGEX_TEST_INVALID_PATH = /^\\.*\\/|^\\.+$/\n\nconst SLASH = '/'\n\n// Do not use ternary expression here, since \"istanbul ignore next\" is buggy\nlet TMP_KEY_IGNORE = 'node-ignore'\n/* istanbul ignore else */\nif (typeof Symbol !== 'undefined') {\n TMP_KEY_IGNORE = Symbol.for('node-ignore')\n}\nconst KEY_IGNORE = TMP_KEY_IGNORE\n\nconst define = (object, key, value) =>\n Object.defineProperty(object, key, {value})\n\nconst REGEX_REGEXP_RANGE = /([0-z])-([0-z])/g\n\nconst RETURN_FALSE = () => false\n\n// Sanitize the range of a regular expression\n// The cases are complicated, see test cases for details\nconst sanitizeRange = range => range.replace(\n REGEX_REGEXP_RANGE,\n (match, from, to) => from.charCodeAt(0) <= to.charCodeAt(0)\n ? match\n // Invalid range (out of order) which is ok for gitignore rules but\n // fatal for JavaScript regular expression, so eliminate it.\n : EMPTY\n)\n\n// See fixtures #59\nconst cleanRangeBackSlash = slashes => {\n const {length} = slashes\n return slashes.slice(0, length - length % 2)\n}\n\n// > If the pattern ends with a slash,\n// > it is removed for the purpose of the following description,\n// > but it would only find a match with a directory.\n// > In other words, foo/ will match a directory foo and paths underneath it,\n// > but will not match a regular file or a symbolic link foo\n// > (this is consistent with the way how pathspec works in general in Git).\n// '`foo/`' will not match regular file '`foo`' or symbolic link '`foo`'\n// -> ignore-rules will not deal with it, because it costs extra `fs.stat` call\n// you could use option `mark: true` with `glob`\n\n// '`foo/`' should not continue with the '`..`'\nconst REPLACERS = [\n\n [\n // remove BOM\n // TODO:\n // Other similar zero-width characters?\n /^\\uFEFF/,\n () => EMPTY\n ],\n\n // > Trailing spaces are ignored unless they are quoted with backslash (\"\\\")\n [\n // (a\\ ) -> (a )\n // (a ) -> (a)\n // (a ) -> (a)\n // (a \\ ) -> (a )\n /((?:\\\\\\\\)*?)(\\\\?\\s+)$/,\n (_, m1, m2) => m1 + (\n m2.indexOf('\\\\') === 0\n ? SPACE\n : EMPTY\n )\n ],\n\n // replace (\\ ) with ' '\n // (\\ ) -> ' '\n // (\\\\ ) -> '\\\\ '\n // (\\\\\\ ) -> '\\\\ '\n [\n /(\\\\+?)\\s/g,\n (_, m1) => {\n const {length} = m1\n return m1.slice(0, length - length % 2) + SPACE\n }\n ],\n\n // Escape metacharacters\n // which is written down by users but means special for regular expressions.\n\n // > There are 12 characters with special meanings:\n // > - the backslash \\,\n // > - the caret ^,\n // > - the dollar sign $,\n // > - the period or dot .,\n // > - the vertical bar or pipe symbol |,\n // > - the question mark ?,\n // > - the asterisk or star *,\n // > - the plus sign +,\n // > - the opening parenthesis (,\n // > - the closing parenthesis ),\n // > - and the opening square bracket [,\n // > - the opening curly brace {,\n // > These special characters are often called \"metacharacters\".\n [\n /[\\\\$.|*+(){^]/g,\n match => `\\\\${match}`\n ],\n\n [\n // > a question mark (?) matches a single character\n /(?!\\\\)\\?/g,\n () => '[^/]'\n ],\n\n // leading slash\n [\n\n // > A leading slash matches the beginning of the pathname.\n // > For example, \"/*.c\" matches \"cat-file.c\" but not \"mozilla-sha1/sha1.c\".\n // A leading slash matches the beginning of the pathname\n /^\\//,\n () => '^'\n ],\n\n // replace special metacharacter slash after the leading slash\n [\n /\\//g,\n () => '\\\\/'\n ],\n\n [\n // > A leading \"**\" followed by a slash means match in all directories.\n // > For example, \"**/foo\" matches file or directory \"foo\" anywhere,\n // > the same as pattern \"foo\".\n // > \"**/foo/bar\" matches file or directory \"bar\" anywhere that is directly\n // > under directory \"foo\".\n // Notice that the '*'s have been replaced as '\\\\*'\n /^\\^*\\\\\\*\\\\\\*\\\\\\//,\n\n // '**/foo' <-> 'foo'\n () => '^(?:.*\\\\/)?'\n ],\n\n // starting\n [\n // there will be no leading '/'\n // (which has been replaced by section \"leading slash\")\n // If starts with '**', adding a '^' to the regular expression also works\n /^(?=[^^])/,\n function startingReplacer () {\n // If has a slash `/` at the beginning or middle\n return !/\\/(?!$)/.test(this)\n // > Prior to 2.22.1\n // > If the pattern does not contain a slash /,\n // > Git treats it as a shell glob pattern\n // Actually, if there is only a trailing slash,\n // git also treats it as a shell glob pattern\n\n // After 2.22.1 (compatible but clearer)\n // > If there is a separator at the beginning or middle (or both)\n // > of the pattern, then the pattern is relative to the directory\n // > level of the particular .gitignore file itself.\n // > Otherwise the pattern may also match at any level below\n // > the .gitignore level.\n ? '(?:^|\\\\/)'\n\n // > Otherwise, Git treats the pattern as a shell glob suitable for\n // > consumption by fnmatch(3)\n : '^'\n }\n ],\n\n // two globstars\n [\n // Use lookahead assertions so that we could match more than one `'/**'`\n /\\\\\\/\\\\\\*\\\\\\*(?=\\\\\\/|$)/g,\n\n // Zero, one or several directories\n // should not use '*', or it will be replaced by the next replacer\n\n // Check if it is not the last `'/**'`\n (_, index, str) => index + 6 < str.length\n\n // case: /**/\n // > A slash followed by two consecutive asterisks then a slash matches\n // > zero or more directories.\n // > For example, \"a/**/b\" matches \"a/b\", \"a/x/b\", \"a/x/y/b\" and so on.\n // '/**/'\n ? '(?:\\\\/[^\\\\/]+)*'\n\n // case: /**\n // > A trailing `\"/**\"` matches everything inside.\n\n // #21: everything inside but it should not include the current folder\n : '\\\\/.+'\n ],\n\n // normal intermediate wildcards\n [\n // Never replace escaped '*'\n // ignore rule '\\*' will match the path '*'\n\n // 'abc.*/' -> go\n // 'abc.*' -> skip this rule,\n // coz trailing single wildcard will be handed by [trailing wildcard]\n /(^|[^\\\\]+)(\\\\\\*)+(?=.+)/g,\n\n // '*.js' matches '.js'\n // '*.js' doesn't match 'abc'\n (_, p1, p2) => {\n // 1.\n // > An asterisk \"*\" matches anything except a slash.\n // 2.\n // > Other consecutive asterisks are considered regular asterisks\n // > and will match according to the previous rules.\n const unescaped = p2.replace(/\\\\\\*/g, '[^\\\\/]*')\n return p1 + unescaped\n }\n ],\n\n [\n // unescape, revert step 3 except for back slash\n // For example, if a user escape a '\\\\*',\n // after step 3, the result will be '\\\\\\\\\\\\*'\n /\\\\\\\\\\\\(?=[$.|*+(){^])/g,\n () => ESCAPE\n ],\n\n [\n // '\\\\\\\\' -> '\\\\'\n /\\\\\\\\/g,\n () => ESCAPE\n ],\n\n [\n // > The range notation, e.g. [a-zA-Z],\n // > can be used to match one of the characters in a range.\n\n // `\\` is escaped by step 3\n /(\\\\)?\\[([^\\]/]*?)(\\\\*)($|\\])/g,\n (match, leadEscape, range, endEscape, close) => leadEscape === ESCAPE\n // '\\\\[bar]' -> '\\\\\\\\[bar\\\\]'\n ? `\\\\[${range}${cleanRangeBackSlash(endEscape)}${close}`\n : close === ']'\n ? endEscape.length % 2 === 0\n // A normal case, and it is a range notation\n // '[bar]'\n // '[bar\\\\\\\\]'\n ? `[${sanitizeRange(range)}${endEscape}]`\n // Invalid range notaton\n // '[bar\\\\]' -> '[bar\\\\\\\\]'\n : '[]'\n : '[]'\n ],\n\n // ending\n [\n // 'js' will not match 'js.'\n // 'ab' will not match 'abc'\n /(?:[^*])$/,\n\n // WTF!\n // https://git-scm.com/docs/gitignore\n // changes in [2.22.1](https://git-scm.com/docs/gitignore/2.22.1)\n // which re-fixes #24, #38\n\n // > If there is a separator at the end of the pattern then the pattern\n // > will only match directories, otherwise the pattern can match both\n // > files and directories.\n\n // 'js*' will not match 'a.js'\n // 'js/' will not match 'a.js'\n // 'js' will match 'a.js' and 'a.js/'\n match => /\\/$/.test(match)\n // foo/ will not match 'foo'\n ? `${match}$`\n // foo matches 'foo' and 'foo/'\n : `${match}(?=$|\\\\/$)`\n ],\n\n // trailing wildcard\n [\n /(\\^|\\\\\\/)?\\\\\\*$/,\n (_, p1) => {\n const prefix = p1\n // '\\^':\n // '/*' does not match EMPTY\n // '/*' does not match everything\n\n // '\\\\\\/':\n // 'abc/*' does not match 'abc/'\n ? `${p1}[^/]+`\n\n // 'a*' matches 'a'\n // 'a*' matches 'aa'\n : '[^/]*'\n\n return `${prefix}(?=$|\\\\/$)`\n }\n ],\n]\n\n// A simple cache, because an ignore rule only has only one certain meaning\nconst regexCache = Object.create(null)\n\n// @param {pattern}\nconst makeRegex = (pattern, ignoreCase) => {\n let source = regexCache[pattern]\n\n if (!source) {\n source = REPLACERS.reduce(\n (prev, [matcher, replacer]) =>\n prev.replace(matcher, replacer.bind(pattern)),\n pattern\n )\n regexCache[pattern] = source\n }\n\n return ignoreCase\n ? new RegExp(source, 'i')\n : new RegExp(source)\n}\n\nconst isString = subject => typeof subject === 'string'\n\n// > A blank line matches no files, so it can serve as a separator for readability.\nconst checkPattern = pattern => pattern\n && isString(pattern)\n && !REGEX_TEST_BLANK_LINE.test(pattern)\n && !REGEX_INVALID_TRAILING_BACKSLASH.test(pattern)\n\n // > A line starting with # serves as a comment.\n && pattern.indexOf('#') !== 0\n\nconst splitPattern = pattern => pattern.split(REGEX_SPLITALL_CRLF)\n\nclass IgnoreRule {\n constructor (\n origin,\n pattern,\n negative,\n regex\n ) {\n this.origin = origin\n this.pattern = pattern\n this.negative = negative\n this.regex = regex\n }\n}\n\nconst createRule = (pattern, ignoreCase) => {\n const origin = pattern\n let negative = false\n\n // > An optional prefix \"!\" which negates the pattern;\n if (pattern.indexOf('!') === 0) {\n negative = true\n pattern = pattern.substr(1)\n }\n\n pattern = pattern\n // > Put a backslash (\"\\\") in front of the first \"!\" for patterns that\n // > begin with a literal \"!\", for example, `\"\\!important!.txt\"`.\n .replace(REGEX_REPLACE_LEADING_EXCAPED_EXCLAMATION, '!')\n // > Put a backslash (\"\\\") in front of the first hash for patterns that\n // > begin with a hash.\n .replace(REGEX_REPLACE_LEADING_EXCAPED_HASH, '#')\n\n const regex = makeRegex(pattern, ignoreCase)\n\n return new IgnoreRule(\n origin,\n pattern,\n negative,\n regex\n )\n}\n\nconst throwError = (message, Ctor) => {\n throw new Ctor(message)\n}\n\nconst checkPath = (path, originalPath, doThrow) => {\n if (!isString(path)) {\n return doThrow(\n `path must be a string, but got \\`${originalPath}\\``,\n TypeError\n )\n }\n\n // We don't know if we should ignore EMPTY, so throw\n if (!path) {\n return doThrow(`path must not be empty`, TypeError)\n }\n\n // Check if it is a relative path\n if (checkPath.isNotRelative(path)) {\n const r = '`path.relative()`d'\n return doThrow(\n `path should be a ${r} string, but got \"${originalPath}\"`,\n RangeError\n )\n }\n\n return true\n}\n\nconst isNotRelative = path => REGEX_TEST_INVALID_PATH.test(path)\n\ncheckPath.isNotRelative = isNotRelative\ncheckPath.convert = p => p\n\nclass Ignore {\n constructor ({\n ignorecase = true,\n ignoreCase = ignorecase,\n allowRelativePaths = false\n } = {}) {\n define(this, KEY_IGNORE, true)\n\n this._rules = []\n this._ignoreCase = ignoreCase\n this._allowRelativePaths = allowRelativePaths\n this._initCache()\n }\n\n _initCache () {\n this._ignoreCache = Object.create(null)\n this._testCache = Object.create(null)\n }\n\n _addPattern (pattern) {\n // #32\n if (pattern && pattern[KEY_IGNORE]) {\n this._rules = this._rules.concat(pattern._rules)\n this._added = true\n return\n }\n\n if (checkPattern(pattern)) {\n const rule = createRule(pattern, this._ignoreCase)\n this._added = true\n this._rules.push(rule)\n }\n }\n\n // @param {Array<string> | string | Ignore} pattern\n add (pattern) {\n this._added = false\n\n makeArray(\n isString(pattern)\n ? splitPattern(pattern)\n : pattern\n ).forEach(this._addPattern, this)\n\n // Some rules have just added to the ignore,\n // making the behavior changed.\n if (this._added) {\n this._initCache()\n }\n\n return this\n }\n\n // legacy\n addPattern (pattern) {\n return this.add(pattern)\n }\n\n // | ignored : unignored\n // negative | 0:0 | 0:1 | 1:0 | 1:1\n // -------- | ------- | ------- | ------- | --------\n // 0 | TEST | TEST | SKIP | X\n // 1 | TESTIF | SKIP | TEST | X\n\n // - SKIP: always skip\n // - TEST: always test\n // - TESTIF: only test if checkUnignored\n // - X: that never happen\n\n // @param {boolean} whether should check if the path is unignored,\n // setting `checkUnignored` to `false` could reduce additional\n // path matching.\n\n // @returns {TestResult} true if a file is ignored\n _testOne (path, checkUnignored) {\n let ignored = false\n let unignored = false\n\n this._rules.forEach(rule => {\n const {negative} = rule\n if (\n unignored === negative && ignored !== unignored\n || negative && !ignored && !unignored && !checkUnignored\n ) {\n return\n }\n\n const matched = rule.regex.test(path)\n\n if (matched) {\n ignored = !negative\n unignored = negative\n }\n })\n\n return {\n ignored,\n unignored\n }\n }\n\n // @returns {TestResult}\n _test (originalPath, cache, checkUnignored, slices) {\n const path = originalPath\n // Supports nullable path\n && checkPath.convert(originalPath)\n\n checkPath(\n path,\n originalPath,\n this._allowRelativePaths\n ? RETURN_FALSE\n : throwError\n )\n\n return this._t(path, cache, checkUnignored, slices)\n }\n\n _t (path, cache, checkUnignored, slices) {\n if (path in cache) {\n return cache[path]\n }\n\n if (!slices) {\n // path/to/a.js\n // ['path', 'to', 'a.js']\n slices = path.split(SLASH)\n }\n\n slices.pop()\n\n // If the path has no parent directory, just test it\n if (!slices.length) {\n return cache[path] = this._testOne(path, checkUnignored)\n }\n\n const parent = this._t(\n slices.join(SLASH) + SLASH,\n cache,\n checkUnignored,\n slices\n )\n\n // If the path contains a parent directory, check the parent first\n return cache[path] = parent.ignored\n // > It is not possible to re-include a file if a parent directory of\n // > that file is excluded.\n ? parent\n : this._testOne(path, checkUnignored)\n }\n\n ignores (path) {\n return this._test(path, this._ignoreCache, false).ignored\n }\n\n createFilter () {\n return path => !this.ignores(path)\n }\n\n filter (paths) {\n return makeArray(paths).filter(this.createFilter())\n }\n\n // @returns {TestResult}\n test (path) {\n return this._test(path, this._testCache, true)\n }\n}\n\nconst factory = options => new Ignore(options)\n\nconst isPathValid = path =>\n checkPath(path && checkPath.convert(path), path, RETURN_FALSE)\n\nfactory.isPathValid = isPathValid\n\n// Fixes typescript\nfactory.default = factory\n\nmodule.exports = factory\n\n// Windows\n// --------------------------------------------------------------\n/* istanbul ignore if */\nif (\n // Detect `process` so that it can run in browsers.\n typeof process !== 'undefined'\n && (\n process.env && process.env.IGNORE_TEST_WIN32\n || process.platform === 'win32'\n )\n) {\n /* eslint no-control-regex: \"off\" */\n const makePosix = str => /^\\\\\\\\\\?\\\\/.test(str)\n || /[\"<>|\\u0000-\\u001F]+/u.test(str)\n ? str\n : str.replace(/\\\\/g, '/')\n\n checkPath.convert = makePosix\n\n // 'C:\\\\foo' <- 'C:\\\\foo' has been converted to 'C:/'\n // 'd:\\\\foo'\n const REGIX_IS_WINDOWS_PATH_ABSOLUTE = /^[a-z]:\\//i\n checkPath.isNotRelative = path =>\n REGIX_IS_WINDOWS_PATH_ABSOLUTE.test(path)\n || isNotRelative(path)\n}\n","/*! crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */\n/* vim: set ts=2: */\n/*exported CRC32 */\nvar CRC32;\n(function (factory) {\n\t/*jshint ignore:start */\n\t/*eslint-disable */\n\tif(typeof DO_NOT_EXPORT_CRC === 'undefined') {\n\t\tif('object' === typeof exports) {\n\t\t\tfactory(exports);\n\t\t} else if ('function' === typeof define && define.amd) {\n\t\t\tdefine(function () {\n\t\t\t\tvar module = {};\n\t\t\t\tfactory(module);\n\t\t\t\treturn module;\n\t\t\t});\n\t\t} else {\n\t\t\tfactory(CRC32 = {});\n\t\t}\n\t} else {\n\t\tfactory(CRC32 = {});\n\t}\n\t/*eslint-enable */\n\t/*jshint ignore:end */\n}(function(CRC32) {\nCRC32.version = '1.2.2';\n/*global Int32Array */\nfunction signed_crc_table() {\n\tvar c = 0, table = new Array(256);\n\n\tfor(var n =0; n != 256; ++n){\n\t\tc = n;\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\tc = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));\n\t\ttable[n] = c;\n\t}\n\n\treturn typeof Int32Array !== 'undefined' ? new Int32Array(table) : table;\n}\n\nvar T0 = signed_crc_table();\nfunction slice_by_16_tables(T) {\n\tvar c = 0, v = 0, n = 0, table = typeof Int32Array !== 'undefined' ? new Int32Array(4096) : new Array(4096) ;\n\n\tfor(n = 0; n != 256; ++n) table[n] = T[n];\n\tfor(n = 0; n != 256; ++n) {\n\t\tv = T[n];\n\t\tfor(c = 256 + n; c < 4096; c += 256) v = table[c] = (v >>> 8) ^ T[v & 0xFF];\n\t}\n\tvar out = [];\n\tfor(n = 1; n != 16; ++n) out[n - 1] = typeof Int32Array !== 'undefined' ? table.subarray(n * 256, n * 256 + 256) : table.slice(n * 256, n * 256 + 256);\n\treturn out;\n}\nvar TT = slice_by_16_tables(T0);\nvar T1 = TT[0], T2 = TT[1], T3 = TT[2], T4 = TT[3], T5 = TT[4];\nvar T6 = TT[5], T7 = TT[6], T8 = TT[7], T9 = TT[8], Ta = TT[9];\nvar Tb = TT[10], Tc = TT[11], Td = TT[12], Te = TT[13], Tf = TT[14];\nfunction crc32_bstr(bstr, seed) {\n\tvar C = seed ^ -1;\n\tfor(var i = 0, L = bstr.length; i < L;) C = (C>>>8) ^ T0[(C^bstr.charCodeAt(i++))&0xFF];\n\treturn ~C;\n}\n\nfunction crc32_buf(B, seed) {\n\tvar C = seed ^ -1, L = B.length - 15, i = 0;\n\tfor(; i < L;) C =\n\t\tTf[B[i++] ^ (C & 255)] ^\n\t\tTe[B[i++] ^ ((C >> 8) & 255)] ^\n\t\tTd[B[i++] ^ ((C >> 16) & 255)] ^\n\t\tTc[B[i++] ^ (C >>> 24)] ^\n\t\tTb[B[i++]] ^ Ta[B[i++]] ^ T9[B[i++]] ^ T8[B[i++]] ^\n\t\tT7[B[i++]] ^ T6[B[i++]] ^ T5[B[i++]] ^ T4[B[i++]] ^\n\t\tT3[B[i++]] ^ T2[B[i++]] ^ T1[B[i++]] ^ T0[B[i++]];\n\tL += 15;\n\twhile(i < L) C = (C>>>8) ^ T0[(C^B[i++])&0xFF];\n\treturn ~C;\n}\n\nfunction crc32_str(str, seed) {\n\tvar C = seed ^ -1;\n\tfor(var i = 0, L = str.length, c = 0, d = 0; i < L;) {\n\t\tc = str.charCodeAt(i++);\n\t\tif(c < 0x80) {\n\t\t\tC = (C>>>8) ^ T0[(C^c)&0xFF];\n\t\t} else if(c < 0x800) {\n\t\t\tC = (C>>>8) ^ T0[(C ^ (192|((c>>6)&31)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|(c&63)))&0xFF];\n\t\t} else if(c >= 0xD800 && c < 0xE000) {\n\t\t\tc = (c&1023)+64; d = str.charCodeAt(i++)&1023;\n\t\t\tC = (C>>>8) ^ T0[(C ^ (240|((c>>8)&7)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|((c>>2)&63)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|((d>>6)&15)|((c&3)<<4)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|(d&63)))&0xFF];\n\t\t} else {\n\t\t\tC = (C>>>8) ^ T0[(C ^ (224|((c>>12)&15)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|((c>>6)&63)))&0xFF];\n\t\t\tC = (C>>>8) ^ T0[(C ^ (128|(c&63)))&0xFF];\n\t\t}\n\t}\n\treturn ~C;\n}\nCRC32.table = T0;\n// $FlowIgnore\nCRC32.bstr = crc32_bstr;\n// $FlowIgnore\nCRC32.buf = crc32_buf;\n// $FlowIgnore\nCRC32.str = crc32_str;\n}));\n","'use strict';\n\nvar isCallable = require('is-callable');\n\nvar toStr = Object.prototype.toString;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\n/** @type {<This, A extends readonly unknown[]>(arr: A, iterator: (this: This | void, value: A[number], index: number, arr: A) => void, receiver: This | undefined) => void} */\nvar forEachArray = function forEachArray(array, iterator, receiver) {\n for (var i = 0, len = array.length; i < len; i++) {\n if (hasOwnProperty.call(array, i)) {\n if (receiver == null) {\n iterator(array[i], i, array);\n } else {\n iterator.call(receiver, array[i], i, array);\n }\n }\n }\n};\n\n/** @type {<This, S extends string>(string: S, iterator: (this: This | void, value: S[number], index: number, string: S) => void, receiver: This | undefined) => void} */\nvar forEachString = function forEachString(string, iterator, receiver) {\n for (var i = 0, len = string.length; i < len; i++) {\n // no such thing as a sparse string.\n if (receiver == null) {\n iterator(string.charAt(i), i, string);\n } else {\n iterator.call(receiver, string.charAt(i), i, string);\n }\n }\n};\n\n/** @type {<This, O>(obj: O, iterator: (this: This | void, value: O[keyof O], index: keyof O, obj: O) => void, receiver: This | undefined) => void} */\nvar forEachObject = function forEachObject(object, iterator, receiver) {\n for (var k in object) {\n if (hasOwnProperty.call(object, k)) {\n if (receiver == null) {\n iterator(object[k], k, object);\n } else {\n iterator.call(receiver, object[k], k, object);\n }\n }\n }\n};\n\n/** @type {(x: unknown) => x is readonly unknown[]} */\nfunction isArray(x) {\n return toStr.call(x) === '[object Array]';\n}\n\n/** @type {import('.')._internal} */\nmodule.exports = function forEach(list, iterator, thisArg) {\n if (!isCallable(iterator)) {\n throw new TypeError('iterator must be a function');\n }\n\n var receiver;\n if (arguments.length >= 3) {\n receiver = thisArg;\n }\n\n if (isArray(list)) {\n forEachArray(list, iterator, receiver);\n } else if (typeof list === 'string') {\n forEachString(list, iterator, receiver);\n } else {\n forEachObject(list, iterator, receiver);\n }\n};\n","'use strict';\n\nvar $isNaN = require('./isNaN');\n\n/** @type {import('./sign')} */\nmodule.exports = function sign(number) {\n\tif ($isNaN(number) || number === 0) {\n\t\treturn number;\n\t}\n\treturn number < 0 ? -1 : +1;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar $TypeError = require('es-errors/type');\n\nvar $call = require('./functionCall');\nvar $actualApply = require('./actualApply');\n\n/** @type {(args: [Function, thisArg?: unknown, ...args: unknown[]]) => Function} TODO FIXME, find a way to use import('.') */\nmodule.exports = function callBindBasic(args) {\n\tif (args.length < 1 || typeof args[0] !== 'function') {\n\t\tthrow new $TypeError('a function is required');\n\t}\n\treturn $actualApply(bind, $call, args);\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nvar $apply = require('./functionApply');\nvar $call = require('./functionCall');\nvar $reflectApply = require('./reflectApply');\n\n/** @type {import('./actualApply')} */\nmodule.exports = $reflectApply || bind.call($call, $apply);\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n","'use strict';\n\n\nvar zlib_deflate = require('./zlib/deflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH = 0;\nvar Z_FINISH = 4;\n\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_SYNC_FLUSH = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY = 0;\n\nvar Z_DEFLATED = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n if (!(this instanceof Deflate)) return new Deflate(options);\n\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_deflate.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n var dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var status, _mode;\n\n if (this.ended) { return false; }\n\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n status = zlib_deflate.deflate(strm, _mode); /* no bad return value */\n\n if (status !== Z_STREAM_END && status !== Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n if (this.options.to === 'string') {\n this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n // Finalize on the last chunk.\n if (_mode === Z_FINISH) {\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === Z_SYNC_FLUSH) {\n this.onEnd(Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n var deflator = new Deflate(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n","'use strict';\n\nvar reflectGetProto = require('./Reflect.getPrototypeOf');\nvar originalGetProto = require('./Object.getPrototypeOf');\n\nvar getDunderProto = require('dunder-proto/get');\n\n/** @type {import('.')} */\nmodule.exports = reflectGetProto\n\t? function getProto(O) {\n\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\treturn reflectGetProto(O);\n\t}\n\t: originalGetProto\n\t\t? function getProto(O) {\n\t\t\tif (!O || (typeof O !== 'object' && typeof O !== 'function')) {\n\t\t\t\tthrow new TypeError('getProto: not an object');\n\t\t\t}\n\t\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\t\treturn originalGetProto(O);\n\t\t}\n\t\t: getDunderProto\n\t\t\t? function getProto(O) {\n\t\t\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\t\t\treturn getDunderProto(O);\n\t\t\t}\n\t\t\t: null;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits = /* extra bits for each length code */\n [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];\n\nvar extra_dbits = /* extra bits for each distance code */\n [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];\n\nvar extra_blbits = /* extra bits for each bit length code */\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short(s, w) {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n}\n\n\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nfunction gen_bitlen(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n{\n var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS; bits++) {\n next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n var len = tree[n * 2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n var n; /* iterates over tree elements */\n var bits; /* bit counter */\n var length; /* length value */\n var code; /* code value */\n var dist; /* distance index */\n var bl_count = new Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n{\n var v = s.heap[k];\n var j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n var black_mask = 0xf3ffc07f;\n var n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //var out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize - 1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n}\n\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [\n\t0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n];\n\nvar W = new Array(80);\n\nfunction Sha1() {\n\tthis.init();\n\tthis._w = W;\n\n\tHash.call(this, 64, 56);\n}\n\ninherits(Sha1, Hash);\n\nSha1.prototype.init = function () {\n\tthis._a = 0x67452301;\n\tthis._b = 0xefcdab89;\n\tthis._c = 0x98badcfe;\n\tthis._d = 0x10325476;\n\tthis._e = 0xc3d2e1f0;\n\n\treturn this;\n};\n\nfunction rotl1(num) {\n\treturn (num << 1) | (num >>> 31);\n}\n\nfunction rotl5(num) {\n\treturn (num << 5) | (num >>> 27);\n}\n\nfunction rotl30(num) {\n\treturn (num << 30) | (num >>> 2);\n}\n\nfunction ft(s, b, c, d) {\n\tif (s === 0) {\n\t\treturn (b & c) | (~b & d);\n\t}\n\tif (s === 2) {\n\t\treturn (b & c) | (b & d) | (c & d);\n\t}\n\treturn b ^ c ^ d;\n}\n\nSha1.prototype._update = function (M) {\n\tvar w = this._w;\n\n\tvar a = this._a | 0;\n\tvar b = this._b | 0;\n\tvar c = this._c | 0;\n\tvar d = this._d | 0;\n\tvar e = this._e | 0;\n\n\tfor (var i = 0; i < 16; ++i) {\n\t\tw[i] = M.readInt32BE(i * 4);\n\t}\n\tfor (; i < 80; ++i) {\n\t\tw[i] = rotl1(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);\n\t}\n\n\tfor (var j = 0; j < 80; ++j) {\n\t\tvar s = ~~(j / 20);\n\t\tvar t = (rotl5(a) + ft(s, b, c, d) + e + w[j] + K[s]) | 0;\n\n\t\te = d;\n\t\td = c;\n\t\tc = rotl30(b);\n\t\tb = a;\n\t\ta = t;\n\t}\n\n\tthis._a = (a + this._a) | 0;\n\tthis._b = (b + this._b) | 0;\n\tthis._c = (c + this._c) | 0;\n\tthis._d = (d + this._d) | 0;\n\tthis._e = (e + this._e) | 0;\n};\n\nSha1.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(20);\n\n\tH.writeInt32BE(this._a | 0, 0);\n\tH.writeInt32BE(this._b | 0, 4);\n\tH.writeInt32BE(this._c | 0, 8);\n\tH.writeInt32BE(this._d | 0, 12);\n\tH.writeInt32BE(this._e | 0, 16);\n\n\treturn H;\n};\n\nmodule.exports = Sha1;\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\nvar $TypeError = require('es-errors/type');\n\nvar callBound = require('call-bound');\n\n/** @type {undefined | ((thisArg: import('.').TypedArray) => Buffer<ArrayBufferLike>)} */\nvar $typedArrayBuffer = callBound('TypedArray.prototype.buffer', true);\n\nvar isTypedArray = require('is-typed-array');\n\n/** @type {import('.')} */\n// node <= 0.10, < 0.11.4 has a nonconfigurable own property instead of a prototype getter\nmodule.exports = $typedArrayBuffer || function typedArrayBuffer(x) {\n\tif (!isTypedArray(x)) {\n\t\tthrow new $TypeError('Not a Typed Array');\n\t}\n\treturn x.buffer;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","'use strict';\n\n/** @type {import('./isNaN')} */\nmodule.exports = Number.isNaN || function isNaN(a) {\n\treturn a !== a;\n};\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\n crc ^= -1;\n\n for (var i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n","'use strict';\n\n/** @type {import('./uri')} */\nmodule.exports = URIError;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar isArray = require('isarray');\nvar typedArrayBuffer = require('typed-array-buffer');\n\nvar isView = ArrayBuffer.isView || function isView(obj) {\n\ttry {\n\t\ttypedArrayBuffer(obj);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\n\nvar useUint8Array = typeof Uint8Array !== 'undefined';\nvar useArrayBuffer = typeof ArrayBuffer !== 'undefined'\n\t&& typeof Uint8Array !== 'undefined';\nvar useFromArrayBuffer = useArrayBuffer && (Buffer.prototype instanceof Uint8Array || Buffer.TYPED_ARRAY_SUPPORT);\n\nmodule.exports = function toBuffer(data, encoding) {\n\t/*\n\t * No need to do anything for exact instance\n\t * This is only valid when safe-buffer.Buffer === buffer.Buffer, i.e. when Buffer.from/Buffer.alloc existed\n\t */\n\tif (data instanceof Buffer) {\n\t\treturn data;\n\t}\n\n\tif (typeof data === 'string') {\n\t\treturn Buffer.from(data, encoding);\n\t}\n\n\t/*\n\t * Wrap any TypedArray instances and DataViews\n\t * Makes sense only on engines with full TypedArray support -- let Buffer detect that\n\t */\n\tif (useArrayBuffer && isView(data)) {\n\t\t// Bug in Node.js <6.3.1, which treats this as out-of-bounds\n\t\tif (data.byteLength === 0) {\n\t\t\treturn Buffer.alloc(0);\n\t\t}\n\n\t\t// When Buffer is based on Uint8Array, we can just construct it from ArrayBuffer\n\t\tif (useFromArrayBuffer) {\n\t\t\tvar res = Buffer.from(data.buffer, data.byteOffset, data.byteLength);\n\t\t\t/*\n\t\t\t * Recheck result size, as offset/length doesn't work on Node.js <5.10\n\t\t\t * We just go to Uint8Array case if this fails\n\t\t\t */\n\t\t\tif (res.byteLength === data.byteLength) {\n\t\t\t\treturn res;\n\t\t\t}\n\t\t}\n\n\t\t// Convert to Uint8Array bytes and then to Buffer\n\t\tvar uint8 = data instanceof Uint8Array ? data : new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\tvar result = Buffer.from(uint8);\n\n\t\t/*\n\t\t * Let's recheck that conversion succeeded\n\t\t * We have .length but not .byteLength when useFromArrayBuffer is false\n\t\t */\n\t\tif (result.length === data.byteLength) {\n\t\t\treturn result;\n\t\t}\n\t}\n\n\t/*\n\t * Uint8Array in engines where Buffer.from might not work with ArrayBuffer, just copy over\n\t * Doesn't make sense with other TypedArray instances\n\t */\n\tif (useUint8Array && data instanceof Uint8Array) {\n\t\treturn Buffer.from(data);\n\t}\n\n\tvar isArr = isArray(data);\n\tif (isArr) {\n\t\tfor (var i = 0; i < data.length; i += 1) {\n\t\t\tvar x = data[i];\n\t\t\tif (\n\t\t\t\ttypeof x !== 'number'\n\t\t\t\t|| x < 0\n\t\t\t\t|| x > 255\n\t\t\t\t|| ~~x !== x // NaN and integer check\n\t\t\t) {\n\t\t\t\tthrow new RangeError('Array items must be numbers in the range 0-255.');\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t * Old Buffer polyfill on an engine that doesn't have TypedArray support\n\t * Also, this is from a different Buffer polyfill implementation then we have, as instanceof check failed\n\t * Convert to our current Buffer implementation\n\t */\n\tif (\n\t\tisArr || (\n\t\t\tBuffer.isBuffer(data)\n\t\t\t\t&& data.constructor\n\t\t\t\t&& typeof data.constructor.isBuffer === 'function'\n\t\t\t\t&& data.constructor.isBuffer(data)\n\t\t)\n\t) {\n\t\treturn Buffer.from(data);\n\t}\n\n\tthrow new TypeError('The \"data\" argument must be a string, an Array, a Buffer, a Uint8Array, or a DataView.');\n};\n","'use strict';\n\nvar whichTypedArray = require('which-typed-array');\n\n/** @type {import('.')} */\nmodule.exports = function isTypedArray(value) {\n\treturn !!whichTypedArray(value);\n};\n","'use strict';\n\nvar forEach = require('for-each');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBind = require('call-bind');\nvar callBound = require('call-bound');\nvar gOPD = require('gopd');\nvar getProto = require('get-proto');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\n\n/** @type {<T = unknown>(array: readonly T[], value: unknown) => number} */\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\n\n/** @typedef {import('./types').Getter} Getter */\n/** @type {import('./types').Cache} */\nvar cache = { __proto__: null };\nif (hasToStringTag && gOPD && getProto) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr && getProto) {\n\t\t\tvar proto = getProto(arr);\n\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor && proto) {\n\t\t\t\tvar superProto = getProto(proto);\n\t\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(descriptor.get);\n\t\t}\n\t});\n} else {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tvar fn = arr.slice || arr.set;\n\t\tif (fn) {\n\t\t\tcache[\n\t\t\t\t/** @type {`$${import('.').TypedArrayName}`} */ ('$' + typedArray)\n\t\t\t] = /** @type {import('./types').BoundSlice | import('./types').BoundSet} */ (\n\t\t\t\t// @ts-expect-error TODO FIXME\n\t\t\t\tcallBind(fn)\n\t\t\t);\n\t\t}\n\t});\n}\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\t/** @type {ReturnType<typeof tryAllTypedArrays>} */ var found = false;\n\tforEach(\n\t\t/** @type {Record<`\\$${import('.').TypedArrayName}`, Getter>} */ (cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */\n\t\tfunction (getter, typedArray) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error a throw is fine here\n\t\t\t\t\tif ('$' + getter(value) === typedArray) {\n\t\t\t\t\t\tfound = /** @type {import('.').TypedArrayName} */ ($slice(typedArray, 1));\n\t\t\t\t\t}\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar trySlices = function tryAllSlices(value) {\n\t/** @type {ReturnType<typeof tryAllSlices>} */ var found = false;\n\tforEach(\n\t\t/** @type {Record<`\\$${import('.').TypedArrayName}`, Getter>} */(cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */ function (getter, name) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error a throw is fine here\n\t\t\t\t\tgetter(value);\n\t\t\t\t\tfound = /** @type {import('.').TypedArrayName} */ ($slice(name, 1));\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {import('.')} */\nmodule.exports = function whichTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\t/** @type {string} */\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\tif ($indexOf(typedArrays, tag) > -1) {\n\t\t\treturn tag;\n\t\t}\n\t\tif (tag !== 'Object') {\n\t\t\treturn false;\n\t\t}\n\t\t// node < 0.6 hits here on real Typed Arrays\n\t\treturn trySlices(value);\n\t}\n\tif (!gOPD) { return null; } // unknown engine\n\treturn tryTypedArrays(value);\n};\n","'use strict';\n\n/** @type {import('.')} */\nvar $gOPD = require('./gOPD');\n\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","'use strict';\n\n/** @type {import('./pow')} */\nmodule.exports = Math.pow;\n","'use strict';\n\n/** @type {import('./max')} */\nmodule.exports = Math.max;\n","'use strict';\n\n/** @type {import('./gOPD')} */\nmodule.exports = Object.getOwnPropertyDescriptor;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBindBasic = require('call-bind-apply-helpers');\n\n/** @type {(thisArg: string, searchString: string, position?: number) => number} */\nvar $indexOf = callBindBasic([GetIntrinsic('%String.prototype.indexOf%')]);\n\n/** @type {import('.')} */\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\t/* eslint no-extra-parens: 0 */\n\n\tvar intrinsic = /** @type {(this: unknown, ...args: unknown[]) => unknown} */ (GetIntrinsic(name, !!allowMissing));\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBindBasic(/** @type {const} */ ([intrinsic]));\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = [\n\t'Float16Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int8Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'BigInt64Array',\n\t'BigUint64Array'\n];\n","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n })\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\nvar define = require('define-data-property');\nvar hasDescriptors = require('has-property-descriptors')();\nvar gOPD = require('gopd');\n\nvar $TypeError = require('es-errors/type');\nvar $floor = GetIntrinsic('%Math.floor%');\n\n/** @type {import('.')} */\nmodule.exports = function setFunctionLength(fn, length) {\n\tif (typeof fn !== 'function') {\n\t\tthrow new $TypeError('`fn` is not a function');\n\t}\n\tif (typeof length !== 'number' || length < 0 || length > 0xFFFFFFFF || $floor(length) !== length) {\n\t\tthrow new $TypeError('`length` must be a positive 32-bit integer');\n\t}\n\n\tvar loose = arguments.length > 2 && !!arguments[2];\n\n\tvar functionLengthIsConfigurable = true;\n\tvar functionLengthIsWritable = true;\n\tif ('length' in fn && gOPD) {\n\t\tvar desc = gOPD(fn, 'length');\n\t\tif (desc && !desc.configurable) {\n\t\t\tfunctionLengthIsConfigurable = false;\n\t\t}\n\t\tif (desc && !desc.writable) {\n\t\t\tfunctionLengthIsWritable = false;\n\t\t}\n\t}\n\n\tif (functionLengthIsConfigurable || functionLengthIsWritable || !loose) {\n\t\tif (hasDescriptors) {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length, true, true);\n\t\t} else {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length);\n\t\t}\n\t}\n\treturn fn;\n};\n","'use strict';\n\n\nvar zlib_inflate = require('./zlib/inflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar c = require('./zlib/constants');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\nvar GZheader = require('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n if (!(this instanceof Inflate)) return new Inflate(options);\n\n this.options = utils.assign({\n chunkSize: 16384,\n windowBits: 0,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_inflate.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new GZheader();\n\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var dictionary = this.options.dictionary;\n var status, _mode;\n var next_out_utf8, tail, utf8str;\n\n // Flag to properly process Z_BUF_ERROR on testing inflate call\n // when we check that all output data was flushed.\n var allowBufError = false;\n\n if (this.ended) { return false; }\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // Only binary strings can be decompressed on practice\n strm.input = strings.binstring2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */\n\n if (status === c.Z_NEED_DICT && dictionary) {\n status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);\n }\n\n if (status === c.Z_BUF_ERROR && allowBufError === true) {\n status = c.Z_OK;\n allowBufError = false;\n }\n\n if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n if (this.options.to === 'string') {\n\n next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n tail = strm.next_out - next_out_utf8;\n utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n this.onData(utf8str);\n\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n }\n\n // When no more input data, we should check that internal inflate buffers\n // are flushed. The only way to do it when avail_out = 0 - run one more\n // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n // Here we set flag to process this error properly.\n //\n // NOTE. Deflate does not return error in this case and does not needs such\n // logic.\n if (strm.avail_in === 0 && strm.avail_out === 0) {\n allowBufError = true;\n }\n\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n if (status === c.Z_STREAM_END) {\n _mode = c.Z_FINISH;\n }\n\n // Finalize on the last chunk.\n if (_mode === c.Z_FINISH) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === c.Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === c.Z_SYNC_FLUSH) {\n this.onEnd(c.Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === c.Z_OK) {\n if (this.options.to === 'string') {\n // Glue & convert here, until we teach pako to send\n // utf8 aligned strings to onData\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n * , output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err)\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n var inflator = new Inflate(options);\n\n inflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip = inflate;\n","'use strict';\n\n/** @type {import('./reflectApply')} */\nmodule.exports = typeof Reflect !== 'undefined' && Reflect && Reflect.apply;\n","'use strict';\n\nvar callBind = require('call-bind-apply-helpers');\nvar gOPD = require('gopd');\n\nvar hasProtoAccessor;\ntry {\n\t// eslint-disable-next-line no-extra-parens, no-proto\n\thasProtoAccessor = /** @type {{ __proto__?: typeof Array.prototype }} */ ([]).__proto__ === Array.prototype;\n} catch (e) {\n\tif (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {\n\t\tthrow e;\n\t}\n}\n\n// eslint-disable-next-line no-extra-parens\nvar desc = !!hasProtoAccessor && gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));\n\nvar $Object = Object;\nvar $getPrototypeOf = $Object.getPrototypeOf;\n\n/** @type {import('./get')} */\nmodule.exports = desc && typeof desc.get === 'function'\n\t? callBind([desc.get])\n\t: typeof $getPrototypeOf === 'function'\n\t\t? /** @type {import('./get')} */ function getDunder(value) {\n\t\t\t// eslint-disable-next-line eqeqeq\n\t\t\treturn $getPrototypeOf(value == null ? value : $Object(value));\n\t\t}\n\t\t: false;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nmodule.exports = GZheader;\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","'use strict';\n\n/** @type {import('./min')} */\nmodule.exports = Math.min;\n","'use strict';\n\n/** @type {import('./syntax')} */\nmodule.exports = SyntaxError;\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.write(string, encoding)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n let i\n if (dir) {\n let foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8'\n\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n case 'latin1':\n case 'binary':\n return asciiWrite(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\n end = this.length\n }\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar trees = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY = 0;\n//var Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction flush_block_only(s, last) {\n trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n// put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n var strend = s.strstart + MAX_MATCH;\n var scan_end1 = _win[scan + best_len - 1];\n var scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// var curr = s.strstart + s.lookahead;\n// var init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n var max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n var max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* scan goes up to strend for length of run */\n\n var _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);\n this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);\n this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\nfunction deflateResetKeep(strm) {\n var s;\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new utils.Buf8(s.w_size * 2);\n s.head = new utils.Buf16(s.hash_size);\n s.prev = new utils.Buf16(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n s = strm.state;\n\n if (!strm.output ||\n (!strm.input && strm.avail_in !== 0) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n s.strm = strm; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n else // DEFLATE header\n {\n var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n var level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush));\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n trees._tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var s;\n var str, n;\n var wrap;\n var avail;\n var next;\n var input;\n var tmpDict;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n s = strm.state;\n wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n tmpDict = new utils.Buf8(s.w_size);\n utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n avail = strm.avail_in;\n next = strm.next_in;\n input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n str = s.strstart;\n n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","'use strict';\nmodule.exports = require('./lib');\n","'use strict';\n\n/** @type {import('./Reflect.getPrototypeOf')} */\nmodule.exports = (typeof Reflect !== 'undefined' && Reflect.getPrototypeOf) || null;\n","'use strict';\n\n/** @type {import('./floor')} */\nmodule.exports = Math.floor;\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","'use strict';\n\nvar possibleNames = require('possible-typed-array-names');\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\n\n/** @type {import('.')} */\nmodule.exports = function availableTypedArrays() {\n\tvar /** @type {ReturnType<typeof availableTypedArrays>} */ out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\t// @ts-expect-error\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict';\n\n/** @type {import('./range')} */\nmodule.exports = RangeError;\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar toStr = Object.prototype.toString;\nvar max = Math.max;\nvar funcType = '[object Function]';\n\nvar concatty = function concatty(a, b) {\n var arr = [];\n\n for (var i = 0; i < a.length; i += 1) {\n arr[i] = a[i];\n }\n for (var j = 0; j < b.length; j += 1) {\n arr[j + a.length] = b[j];\n }\n\n return arr;\n};\n\nvar slicy = function slicy(arrLike, offset) {\n var arr = [];\n for (var i = offset || 0, j = 0; i < arrLike.length; i += 1, j += 1) {\n arr[j] = arrLike[i];\n }\n return arr;\n};\n\nvar joiny = function (arr, joiner) {\n var str = '';\n for (var i = 0; i < arr.length; i += 1) {\n str += arr[i];\n if (i + 1 < arr.length) {\n str += joiner;\n }\n }\n return str;\n};\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.apply(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slicy(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n concatty(args, arguments)\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n }\n return target.apply(\n that,\n concatty(args, arguments)\n );\n\n };\n\n var boundLength = max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs[i] = '$' + i;\n }\n\n bound = Function('binder', 'return function (' + joiny(boundArgs, ',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Error;\n","'use strict';\n\n/** @type {import('./ref')} */\nmodule.exports = ReferenceError;\n","'use strict';\n\nvar fnToStr = Function.prototype.toString;\nvar reflectApply = typeof Reflect === 'object' && Reflect !== null && Reflect.apply;\nvar badArrayLike;\nvar isCallableMarker;\nif (typeof reflectApply === 'function' && typeof Object.defineProperty === 'function') {\n\ttry {\n\t\tbadArrayLike = Object.defineProperty({}, 'length', {\n\t\t\tget: function () {\n\t\t\t\tthrow isCallableMarker;\n\t\t\t}\n\t\t});\n\t\tisCallableMarker = {};\n\t\t// eslint-disable-next-line no-throw-literal\n\t\treflectApply(function () { throw 42; }, null, badArrayLike);\n\t} catch (_) {\n\t\tif (_ !== isCallableMarker) {\n\t\t\treflectApply = null;\n\t\t}\n\t}\n} else {\n\treflectApply = null;\n}\n\nvar constructorRegex = /^\\s*class\\b/;\nvar isES6ClassFn = function isES6ClassFunction(value) {\n\ttry {\n\t\tvar fnStr = fnToStr.call(value);\n\t\treturn constructorRegex.test(fnStr);\n\t} catch (e) {\n\t\treturn false; // not a function\n\t}\n};\n\nvar tryFunctionObject = function tryFunctionToStr(value) {\n\ttry {\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tfnToStr.call(value);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\nvar toStr = Object.prototype.toString;\nvar objectClass = '[object Object]';\nvar fnClass = '[object Function]';\nvar genClass = '[object GeneratorFunction]';\nvar ddaClass = '[object HTMLAllCollection]'; // IE 11\nvar ddaClass2 = '[object HTML document.all class]';\nvar ddaClass3 = '[object HTMLCollection]'; // IE 9-10\nvar hasToStringTag = typeof Symbol === 'function' && !!Symbol.toStringTag; // better: use `has-tostringtag`\n\nvar isIE68 = !(0 in [,]); // eslint-disable-line no-sparse-arrays, comma-spacing\n\nvar isDDA = function isDocumentDotAll() { return false; };\nif (typeof document === 'object') {\n\t// Firefox 3 canonicalizes DDA to undefined when it's not accessed directly\n\tvar all = document.all;\n\tif (toStr.call(all) === toStr.call(document.all)) {\n\t\tisDDA = function isDocumentDotAll(value) {\n\t\t\t/* globals document: false */\n\t\t\t// in IE 6-8, typeof document.all is \"object\" and it's truthy\n\t\t\tif ((isIE68 || !value) && (typeof value === 'undefined' || typeof value === 'object')) {\n\t\t\t\ttry {\n\t\t\t\t\tvar str = toStr.call(value);\n\t\t\t\t\treturn (\n\t\t\t\t\t\tstr === ddaClass\n\t\t\t\t\t\t|| str === ddaClass2\n\t\t\t\t\t\t|| str === ddaClass3 // opera 12.16\n\t\t\t\t\t\t|| str === objectClass // IE 6-8\n\t\t\t\t\t) && value('') == null; // eslint-disable-line eqeqeq\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t}\n}\n\nmodule.exports = reflectApply\n\t? function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\ttry {\n\t\t\treflectApply(value, null, badArrayLike);\n\t\t} catch (e) {\n\t\t\tif (e !== isCallableMarker) { return false; }\n\t\t}\n\t\treturn !isES6ClassFn(value) && tryFunctionObject(value);\n\t}\n\t: function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\tif (hasToStringTag) { return tryFunctionObject(value); }\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tvar strClass = toStr.call(value);\n\t\tif (strClass !== fnClass && strClass !== genClass && !(/^\\[object HTML/).test(strClass)) { return false; }\n\t\treturn tryFunctionObject(value);\n\t};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Object;\n","'use strict';\n\n/** @type {import('./type')} */\nmodule.exports = TypeError;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n return;\n }\n // Fallback to ordinary array\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n};\n\nvar fnUntyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n};\n\nexports.setTyped(TYPED_OK);\n","'use strict';\n\nvar call = Function.prototype.call;\nvar $hasOwn = Object.prototype.hasOwnProperty;\nvar bind = require('function-bind');\n\n/** @type {import('.')} */\nmodule.exports = bind.call(call, $hasOwn);\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","// This is straight from parse_unit_factor in config.c of canonical git\nconst num = val => {\n if (typeof val === 'number') {\n return val\n }\n\n val = val.toLowerCase()\n let n = parseInt(val)\n if (val.endsWith('k')) n *= 1024\n if (val.endsWith('m')) n *= 1024 * 1024\n if (val.endsWith('g')) n *= 1024 * 1024 * 1024\n return n\n}\n\n// This is straight from git_parse_maybe_bool_text in config.c of canonical git\nconst bool = val => {\n if (typeof val === 'boolean') {\n return val\n }\n\n val = val.trim().toLowerCase()\n if (val === 'true' || val === 'yes' || val === 'on') return true\n if (val === 'false' || val === 'no' || val === 'off') return false\n throw Error(\n `Expected 'true', 'false', 'yes', 'no', 'on', or 'off', but got ${val}`\n )\n}\n\nconst schema = {\n core: {\n filemode: bool,\n bare: bool,\n logallrefupdates: bool,\n symlinks: bool,\n ignorecase: bool,\n bigFileThreshold: num,\n },\n}\n\n// https://git-scm.com/docs/git-config#_syntax\n\n// section starts with [ and ends with ]\n// section is alphanumeric (ASCII) with - and .\n// section is case insensitive\n// subsection is optional\n// subsection is specified after section and one or more spaces\n// subsection is specified between double quotes\nconst SECTION_LINE_REGEX = /^\\[([A-Za-z0-9-.]+)(?: \"(.*)\")?\\]$/\nconst SECTION_REGEX = /^[A-Za-z0-9-.]+$/\n\n// variable lines contain a name, and equal sign and then a value\n// variable lines can also only contain a name (the implicit value is a boolean true)\n// variable name is alphanumeric (ASCII) with -\n// variable name starts with an alphabetic character\n// variable name is case insensitive\nconst VARIABLE_LINE_REGEX = /^([A-Za-z][A-Za-z-]*)(?: *= *(.*))?$/\nconst VARIABLE_NAME_REGEX = /^[A-Za-z][A-Za-z-]*$/\n\n// Comments start with either # or ; and extend to the end of line\nconst VARIABLE_VALUE_COMMENT_REGEX = /^(.*?)( *[#;].*)$/\n\nconst extractSectionLine = line => {\n const matches = SECTION_LINE_REGEX.exec(line)\n if (matches != null) {\n const [section, subsection] = matches.slice(1)\n return [section, subsection]\n }\n return null\n}\n\nconst extractVariableLine = line => {\n const matches = VARIABLE_LINE_REGEX.exec(line)\n if (matches != null) {\n const [name, rawValue = 'true'] = matches.slice(1)\n const valueWithoutComments = removeComments(rawValue)\n const valueWithoutQuotes = removeQuotes(valueWithoutComments)\n return [name, valueWithoutQuotes]\n }\n return null\n}\n\nconst removeComments = rawValue => {\n const commentMatches = VARIABLE_VALUE_COMMENT_REGEX.exec(rawValue)\n if (commentMatches == null) {\n return rawValue\n }\n const [valueWithoutComment, comment] = commentMatches.slice(1)\n // if odd number of quotes before and after comment => comment is escaped\n if (\n hasOddNumberOfQuotes(valueWithoutComment) &&\n hasOddNumberOfQuotes(comment)\n ) {\n return `${valueWithoutComment}${comment}`\n }\n return valueWithoutComment\n}\n\nconst hasOddNumberOfQuotes = text => {\n const numberOfQuotes = (text.match(/(?:^|[^\\\\])\"/g) || []).length\n return numberOfQuotes % 2 !== 0\n}\n\nconst removeQuotes = text => {\n return text.split('').reduce((newText, c, idx, text) => {\n const isQuote = c === '\"' && text[idx - 1] !== '\\\\'\n const isEscapeForQuote = c === '\\\\' && text[idx + 1] === '\"'\n if (isQuote || isEscapeForQuote) {\n return newText\n }\n return newText + c\n }, '')\n}\n\nconst lower = text => {\n return text != null ? text.toLowerCase() : null\n}\n\nconst getPath = (section, subsection, name) => {\n return [lower(section), subsection, lower(name)]\n .filter(a => a != null)\n .join('.')\n}\n\nconst normalizePath = path => {\n const pathSegments = path.split('.')\n const section = pathSegments.shift()\n const name = pathSegments.pop()\n const subsection = pathSegments.length ? pathSegments.join('.') : undefined\n\n return {\n section,\n subsection,\n name,\n path: getPath(section, subsection, name),\n sectionPath: getPath(section, subsection, null),\n isSection: !!section,\n }\n}\n\nconst findLastIndex = (array, callback) => {\n return array.reduce((lastIndex, item, index) => {\n return callback(item) ? index : lastIndex\n }, -1)\n}\n\n// Note: there are a LOT of edge cases that aren't covered (e.g. keys in sections that also\n// have subsections, [include] directives, etc.\nexport class GitConfig {\n constructor(text) {\n let section = null\n let subsection = null\n this.parsedConfig = text\n ? text.split('\\n').map(line => {\n let name = null\n let value = null\n\n const trimmedLine = line.trim()\n const extractedSection = extractSectionLine(trimmedLine)\n const isSection = extractedSection != null\n if (isSection) {\n ;[section, subsection] = extractedSection\n } else {\n const extractedVariable = extractVariableLine(trimmedLine)\n const isVariable = extractedVariable != null\n if (isVariable) {\n ;[name, value] = extractedVariable\n }\n }\n\n const path = getPath(section, subsection, name)\n return { line, isSection, section, subsection, name, value, path }\n })\n : []\n }\n\n static from(text) {\n return new GitConfig(text)\n }\n\n async get(path, getall = false) {\n const normalizedPath = normalizePath(path).path\n const allValues = this.parsedConfig\n .filter(config => config.path === normalizedPath)\n .map(({ section, name, value }) => {\n const fn = schema[section] && schema[section][name]\n return fn ? fn(value) : value\n })\n return getall ? allValues : allValues.pop()\n }\n\n async getall(path) {\n return this.get(path, true)\n }\n\n async getSubsections(section) {\n return this.parsedConfig\n .filter(config => config.isSection && config.section === section)\n .map(config => config.subsection)\n }\n\n async deleteSection(section, subsection) {\n this.parsedConfig = this.parsedConfig.filter(\n config =>\n !(config.section === section && config.subsection === subsection)\n )\n }\n\n async append(path, value) {\n return this.set(path, value, true)\n }\n\n async set(path, value, append = false) {\n const {\n section,\n subsection,\n name,\n path: normalizedPath,\n sectionPath,\n isSection,\n } = normalizePath(path)\n\n const configIndex = findLastIndex(\n this.parsedConfig,\n config => config.path === normalizedPath\n )\n if (value == null) {\n if (configIndex !== -1) {\n this.parsedConfig.splice(configIndex, 1)\n }\n } else {\n if (configIndex !== -1) {\n const config = this.parsedConfig[configIndex]\n // Name should be overwritten in case the casing changed\n const modifiedConfig = Object.assign({}, config, {\n name,\n value,\n modified: true,\n })\n if (append) {\n this.parsedConfig.splice(configIndex + 1, 0, modifiedConfig)\n } else {\n this.parsedConfig[configIndex] = modifiedConfig\n }\n } else {\n const sectionIndex = this.parsedConfig.findIndex(\n config => config.path === sectionPath\n )\n const newConfig = {\n section,\n subsection,\n name,\n value,\n modified: true,\n path: normalizedPath,\n }\n if (SECTION_REGEX.test(section) && VARIABLE_NAME_REGEX.test(name)) {\n if (sectionIndex >= 0) {\n // Reuse existing section\n this.parsedConfig.splice(sectionIndex + 1, 0, newConfig)\n } else {\n // Add a new section\n const newSection = {\n isSection,\n section,\n subsection,\n modified: true,\n path: sectionPath,\n }\n this.parsedConfig.push(newSection, newConfig)\n }\n }\n }\n }\n }\n\n toString() {\n return this.parsedConfig\n .map(({ line, section, subsection, name, value, modified = false }) => {\n if (!modified) {\n return line\n }\n if (name != null && value != null) {\n if (typeof value === 'string' && /[#;]/.test(value)) {\n // A `#` or `;` symbol denotes a comment, so we have to wrap it in double quotes\n return `\\t${name} = \"${value}\"`\n }\n return `\\t${name} = ${value}`\n }\n if (subsection != null) {\n return `[${section} \"${subsection}\"]`\n }\n return `[${section}]`\n })\n .join('\\n')\n }\n}\n","import '../typedefs.js'\n\nimport { GitConfig } from '../models/GitConfig.js'\n\n/**\n * Manages access to the Git configuration file, providing methods to read and save configurations.\n */\nexport class GitConfigManager {\n /**\n * Reads the Git configuration file from the specified `.git` directory.\n *\n * @param {object} opts - Options for reading the Git configuration.\n * @param {FSClient} opts.fs - A file system implementation.\n * @param {string} opts.gitdir - The path to the `.git` directory.\n * @returns {Promise<GitConfig>} A `GitConfig` object representing the parsed configuration.\n */\n static async get({ fs, gitdir }) {\n // We can improve efficiency later if needed.\n // TODO: read from full list of git config files\n const text = await fs.read(`${gitdir}/config`, { encoding: 'utf8' })\n return GitConfig.from(text)\n }\n\n /**\n * Saves the provided Git configuration to the specified `.git` directory.\n *\n * @param {object} opts - Options for saving the Git configuration.\n * @param {FSClient} opts.fs - A file system implementation.\n * @param {string} opts.gitdir - The path to the `.git` directory.\n * @param {GitConfig} opts.config - The `GitConfig` object to save.\n * @returns {Promise<void>} Resolves when the configuration has been successfully saved.\n */\n static async save({ fs, gitdir, config }) {\n // We can improve efficiency later if needed.\n // TODO: handle saving to the correct global/user/repo location\n await fs.write(`${gitdir}/config`, config.toString(), {\n encoding: 'utf8',\n })\n }\n}\n","export function dirname(path) {\n const last = Math.max(path.lastIndexOf('/'), path.lastIndexOf('\\\\'))\n if (last === -1) return '.'\n if (last === 0) return '/'\n return path.slice(0, last)\n}\n","/*!\n * This code for `path.join` is directly copied from @zenfs/core/path for bundle size improvements.\n * SPDX-License-Identifier: LGPL-3.0-or-later\n * Copyright (c) James Prevett and other ZenFS contributors.\n */\n\nfunction normalizeString(path, aar) {\n let res = ''\n let lastSegmentLength = 0\n let lastSlash = -1\n let dots = 0\n let char = '\\x00'\n for (let i = 0; i <= path.length; ++i) {\n if (i < path.length) char = path[i]\n else if (char === '/') break\n else char = '/'\n\n if (char === '/') {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (dots === 2) {\n if (\n res.length < 2 ||\n lastSegmentLength !== 2 ||\n res.at(-1) !== '.' ||\n res.at(-2) !== '.'\n ) {\n if (res.length > 2) {\n const lastSlashIndex = res.lastIndexOf('/')\n if (lastSlashIndex === -1) {\n res = ''\n lastSegmentLength = 0\n } else {\n res = res.slice(0, lastSlashIndex)\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/')\n }\n lastSlash = i\n dots = 0\n continue\n } else if (res.length !== 0) {\n res = ''\n lastSegmentLength = 0\n lastSlash = i\n dots = 0\n continue\n }\n }\n if (aar) {\n res += res.length > 0 ? '/..' : '..'\n lastSegmentLength = 2\n }\n } else {\n if (res.length > 0) res += '/' + path.slice(lastSlash + 1, i)\n else res = path.slice(lastSlash + 1, i)\n lastSegmentLength = i - lastSlash - 1\n }\n lastSlash = i\n dots = 0\n } else if (char === '.' && dots !== -1) {\n ++dots\n } else {\n dots = -1\n }\n }\n return res\n}\n\nfunction normalize(path) {\n if (!path.length) return '.'\n\n const isAbsolute = path[0] === '/'\n const trailingSeparator = path.at(-1) === '/'\n\n path = normalizeString(path, !isAbsolute)\n\n if (!path.length) {\n if (isAbsolute) return '/'\n return trailingSeparator ? './' : '.'\n }\n if (trailingSeparator) path += '/'\n\n return isAbsolute ? `/${path}` : path\n}\n\nexport function join(...args) {\n if (args.length === 0) return '.'\n let joined\n for (let i = 0; i < args.length; ++i) {\n const arg = args[i]\n if (arg.length > 0) {\n if (joined === undefined) joined = arg\n else joined += '/' + arg\n }\n }\n if (joined === undefined) return '.'\n return normalize(joined)\n}\n","import '../typedefs.js'\n\nimport ignore from 'ignore'\n\nimport { basename } from '../utils/basename.js'\nimport { dirname } from '../utils/dirname.js'\nimport { join } from '../utils/join.js'\n\n// I'm putting this in a Manager because I reckon it could benefit\n// from a LOT of caching.\nexport class GitIgnoreManager {\n /**\n * Determines whether a given file is ignored based on `.gitignore` rules and exclusion files.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} args.dir - The working directory.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.filepath - The path of the file to check.\n * @returns {Promise<boolean>} - `true` if the file is ignored, `false` otherwise.\n */\n static async isIgnored({ fs, dir, gitdir = join(dir, '.git'), filepath }) {\n // ALWAYS ignore \".git\" folders.\n if (basename(filepath) === '.git') return true\n // '.' is not a valid gitignore entry, so '.' is never ignored\n if (filepath === '.') return false\n // Check and load exclusion rules from project exclude file (.git/info/exclude)\n let excludes = ''\n const excludesFile = join(gitdir, 'info', 'exclude')\n if (await fs.exists(excludesFile)) {\n excludes = await fs.read(excludesFile, 'utf8')\n }\n // Find all the .gitignore files that could affect this file\n const pairs = [\n {\n gitignore: join(dir, '.gitignore'),\n filepath,\n },\n ]\n const pieces = filepath.split('/').filter(Boolean)\n for (let i = 1; i < pieces.length; i++) {\n const folder = pieces.slice(0, i).join('/')\n const file = pieces.slice(i).join('/')\n pairs.push({\n gitignore: join(dir, folder, '.gitignore'),\n filepath: file,\n })\n }\n let ignoredStatus = false\n for (const p of pairs) {\n let file\n try {\n file = await fs.read(p.gitignore, 'utf8')\n } catch (err) {\n if (err.code === 'NOENT') continue\n }\n const ign = ignore().add(excludes)\n ign.add(file)\n // If the parent directory is excluded, we are done.\n // \"It is not possible to re-include a file if a parent directory of that file is excluded. Git doesn’t list excluded directories for performance reasons, so any patterns on contained files have no effect, no matter where they are defined.\"\n // source: https://git-scm.com/docs/gitignore\n const parentdir = dirname(p.filepath)\n if (parentdir !== '.' && ign.ignores(parentdir)) return true\n // If the file is currently ignored, test for UNignoring.\n if (ignoredStatus) {\n ignoredStatus = !ign.test(p.filepath).unignored\n } else {\n ignoredStatus = ign.test(p.filepath).ignored\n }\n }\n return ignoredStatus\n }\n}\n","export function basename(path) {\n const last = Math.max(path.lastIndexOf('/'), path.lastIndexOf('\\\\'))\n if (last > -1) {\n path = path.slice(last + 1)\n }\n return path\n}\n","export class BaseError extends Error {\n constructor(message) {\n super(message)\n // Setting this here allows TS to infer that all git errors have a `caller` property and\n // that its type is string.\n this.caller = ''\n }\n\n toJSON() {\n // Error objects aren't normally serializable. So we do something about that.\n return {\n code: this.code,\n data: this.data,\n caller: this.caller,\n message: this.message,\n stack: this.stack,\n }\n }\n\n fromJSON(json) {\n const e = new BaseError(json.message)\n e.code = json.code\n e.data = json.data\n e.caller = json.caller\n e.stack = json.stack\n return e\n }\n\n get isIsomorphicGitError() {\n return true\n }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class UnmergedPathsError extends BaseError {\n /**\n * @param {Array<string>} filepaths\n */\n constructor(filepaths) {\n super(\n `Modifying the index is not possible because you have unmerged files: ${filepaths.toString}. Fix them up in the work tree, and then use 'git add/rm as appropriate to mark resolution and make a commit.`\n )\n this.code = this.name = UnmergedPathsError.code\n this.data = { filepaths }\n }\n}\n/** @type {'UnmergedPathsError'} */\nUnmergedPathsError.code = 'UnmergedPathsError'\n","import { BaseError } from './BaseError.js'\n\nexport class InternalError extends BaseError {\n /**\n * @param {string} message\n */\n constructor(message) {\n super(\n `An internal error caused this command to fail.\\n\\nIf you're not a developer, report the bug to the developers of the application you're using. If this is a bug in isomorphic-git then you should create a proper bug yourselves. The bug should include a minimal reproduction and details about the version and environment.\\n\\nPlease file a bug report at https://github.com/isomorphic-git/isomorphic-git/issues with this error message: ${message}`\n )\n this.code = this.name = InternalError.code\n this.data = { message }\n }\n}\n/** @type {'InternalError'} */\nInternalError.code = 'InternalError'\n","import { BaseError } from './BaseError.js'\n\nexport class UnsafeFilepathError extends BaseError {\n /**\n * @param {string} filepath\n */\n constructor(filepath) {\n super(`The filepath \"${filepath}\" contains unsafe character sequences`)\n this.code = this.name = UnsafeFilepathError.code\n this.data = { filepath }\n }\n}\n/** @type {'UnsafeFilepathError'} */\nUnsafeFilepathError.code = 'UnsafeFilepathError'\n","// Modeled after https://github.com/tjfontaine/node-buffercursor\n// but with the goal of being much lighter weight.\nexport class BufferCursor {\n constructor(buffer) {\n this.buffer = buffer\n this._start = 0\n }\n\n eof() {\n return this._start >= this.buffer.length\n }\n\n tell() {\n return this._start\n }\n\n seek(n) {\n this._start = n\n }\n\n slice(n) {\n const r = this.buffer.slice(this._start, this._start + n)\n this._start += n\n return r\n }\n\n toString(enc, length) {\n const r = this.buffer.toString(enc, this._start, this._start + length)\n this._start += length\n return r\n }\n\n write(value, length, enc) {\n const r = this.buffer.write(value, this._start, length, enc)\n this._start += length\n return r\n }\n\n copy(source, start, end) {\n const r = source.copy(this.buffer, this._start, start, end)\n this._start += r\n return r\n }\n\n readUInt8() {\n const r = this.buffer.readUInt8(this._start)\n this._start += 1\n return r\n }\n\n writeUInt8(value) {\n const r = this.buffer.writeUInt8(value, this._start)\n this._start += 1\n return r\n }\n\n readUInt16BE() {\n const r = this.buffer.readUInt16BE(this._start)\n this._start += 2\n return r\n }\n\n writeUInt16BE(value) {\n const r = this.buffer.writeUInt16BE(value, this._start)\n this._start += 2\n return r\n }\n\n readUInt32BE() {\n const r = this.buffer.readUInt32BE(this._start)\n this._start += 4\n return r\n }\n\n writeUInt32BE(value) {\n const r = this.buffer.writeUInt32BE(value, this._start)\n this._start += 4\n return r\n }\n}\n","import { compareStrings } from './compareStrings.js'\n\nexport function comparePath(a, b) {\n // https://stackoverflow.com/a/40355107/2168416\n return compareStrings(a.path, b.path)\n}\n","export function compareStrings(a, b) {\n // https://stackoverflow.com/a/40355107/2168416\n return -(a < b) || +(a > b)\n}\n","/**\n * From https://github.com/git/git/blob/master/Documentation/technical/index-format.txt\n *\n * 32-bit mode, split into (high to low bits)\n *\n * 4-bit object type\n * valid values in binary are 1000 (regular file), 1010 (symbolic link)\n * and 1110 (gitlink)\n *\n * 3-bit unused\n *\n * 9-bit unix permission. Only 0755 and 0644 are valid for regular files.\n * Symbolic links and gitlinks have value 0 in this field.\n */\nexport function normalizeMode(mode) {\n // Note: BrowserFS will use -1 for \"unknown\"\n // I need to make it non-negative for these bitshifts to work.\n let type = mode > 0 ? mode >> 12 : 0\n // If it isn't valid, assume it as a \"regular file\"\n // 0100 = directory\n // 1000 = regular file\n // 1010 = symlink\n // 1110 = gitlink\n if (\n type !== 0b0100 &&\n type !== 0b1000 &&\n type !== 0b1010 &&\n type !== 0b1110\n ) {\n type = 0b1000\n }\n let permissions = mode & 0o777\n // Is the file executable? then 755. Else 644.\n if (permissions & 0b001001001) {\n permissions = 0o755\n } else {\n permissions = 0o644\n }\n // If it's not a regular file, scrub all permissions\n if (type !== 0b1000) permissions = 0\n return (type << 12) + permissions\n}\n","import { normalizeMode } from './normalizeMode.js'\n\nconst MAX_UINT32 = 2 ** 32\n\nfunction SecondsNanoseconds(\n givenSeconds,\n givenNanoseconds,\n milliseconds,\n date\n) {\n if (givenSeconds !== undefined && givenNanoseconds !== undefined) {\n return [givenSeconds, givenNanoseconds]\n }\n if (milliseconds === undefined) {\n milliseconds = date.valueOf()\n }\n const seconds = Math.floor(milliseconds / 1000)\n const nanoseconds = (milliseconds - seconds * 1000) * 1000000\n return [seconds, nanoseconds]\n}\n\nexport function normalizeStats(e) {\n const [ctimeSeconds, ctimeNanoseconds] = SecondsNanoseconds(\n e.ctimeSeconds,\n e.ctimeNanoseconds,\n e.ctimeMs,\n e.ctime\n )\n const [mtimeSeconds, mtimeNanoseconds] = SecondsNanoseconds(\n e.mtimeSeconds,\n e.mtimeNanoseconds,\n e.mtimeMs,\n e.mtime\n )\n\n return {\n ctimeSeconds: ctimeSeconds % MAX_UINT32,\n ctimeNanoseconds: ctimeNanoseconds % MAX_UINT32,\n mtimeSeconds: mtimeSeconds % MAX_UINT32,\n mtimeNanoseconds: mtimeNanoseconds % MAX_UINT32,\n dev: e.dev % MAX_UINT32,\n ino: e.ino % MAX_UINT32,\n mode: normalizeMode(e.mode % MAX_UINT32),\n uid: e.uid % MAX_UINT32,\n gid: e.gid % MAX_UINT32,\n // size of -1 happens over a BrowserFS HTTP Backend that doesn't serve Content-Length headers\n // (like the Karma webserver) because BrowserFS HTTP Backend uses HTTP HEAD requests to do fs.stat\n size: e.size > -1 ? e.size % MAX_UINT32 : 0,\n }\n}\n","/* eslint-env node, browser */\nimport Hash from 'sha.js/sha1.js'\n\nimport { toHex } from './toHex.js'\n\nlet supportsSubtleSHA1 = null\n\nexport async function shasum(buffer) {\n if (supportsSubtleSHA1 === null) {\n supportsSubtleSHA1 = await testSubtleSHA1()\n }\n return supportsSubtleSHA1 ? subtleSHA1(buffer) : shasumSync(buffer)\n}\n\n// This is modeled after @dominictarr's \"shasum\" module,\n// but without the 'json-stable-stringify' dependency and\n// extra type-casting features.\nfunction shasumSync(buffer) {\n return new Hash().update(buffer).digest('hex')\n}\n\nasync function subtleSHA1(buffer) {\n const hash = await crypto.subtle.digest('SHA-1', buffer)\n return toHex(hash)\n}\n\nasync function testSubtleSHA1() {\n // I'm using a rather crude method of progressive enhancement, because\n // some browsers that have crypto.subtle.digest don't actually implement SHA-1.\n try {\n const hash = await subtleSHA1(new Uint8Array([]))\n return hash === 'da39a3ee5e6b4b0d3255bfef95601890afd80709'\n } catch (_) {\n // no bother\n }\n return false\n}\n","export function toHex(buffer) {\n let hex = ''\n for (const byte of new Uint8Array(buffer)) {\n if (byte < 16) hex += '0'\n hex += byte.toString(16)\n }\n return hex\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { UnsafeFilepathError } from '../errors/UnsafeFilepathError.js'\nimport { BufferCursor } from '../utils/BufferCursor.js'\nimport { comparePath } from '../utils/comparePath.js'\nimport { normalizeStats } from '../utils/normalizeStats.js'\nimport { shasum } from '../utils/shasum.js'\n\n// Extract 1-bit assume-valid, 1-bit extended flag, 2-bit merge state flag, 12-bit path length flag\nfunction parseCacheEntryFlags(bits) {\n return {\n assumeValid: Boolean(bits & 0b1000000000000000),\n extended: Boolean(bits & 0b0100000000000000),\n stage: (bits & 0b0011000000000000) >> 12,\n nameLength: bits & 0b0000111111111111,\n }\n}\n\nfunction renderCacheEntryFlags(entry) {\n const flags = entry.flags\n // 1-bit extended flag (must be zero in version 2)\n flags.extended = false\n // 12-bit name length if the length is less than 0xFFF; otherwise 0xFFF\n // is stored in this field.\n flags.nameLength = Math.min(Buffer.from(entry.path).length, 0xfff)\n return (\n (flags.assumeValid ? 0b1000000000000000 : 0) +\n (flags.extended ? 0b0100000000000000 : 0) +\n ((flags.stage & 0b11) << 12) +\n (flags.nameLength & 0b111111111111)\n )\n}\n\nexport class GitIndex {\n /*::\n _entries: Map<string, CacheEntry>\n _dirty: boolean // Used to determine if index needs to be saved to filesystem\n */\n constructor(entries, unmergedPaths) {\n this._dirty = false\n this._unmergedPaths = unmergedPaths || new Set()\n this._entries = entries || new Map()\n }\n\n _addEntry(entry) {\n if (entry.flags.stage === 0) {\n entry.stages = [entry]\n this._entries.set(entry.path, entry)\n this._unmergedPaths.delete(entry.path)\n } else {\n let existingEntry = this._entries.get(entry.path)\n if (!existingEntry) {\n this._entries.set(entry.path, entry)\n existingEntry = entry\n }\n existingEntry.stages[entry.flags.stage] = entry\n this._unmergedPaths.add(entry.path)\n }\n }\n\n static async from(buffer) {\n if (Buffer.isBuffer(buffer)) {\n return GitIndex.fromBuffer(buffer)\n } else if (buffer === null) {\n return new GitIndex(null)\n } else {\n throw new InternalError('invalid type passed to GitIndex.from')\n }\n }\n\n static async fromBuffer(buffer) {\n if (buffer.length === 0) {\n throw new InternalError('Index file is empty (.git/index)')\n }\n\n const index = new GitIndex()\n const reader = new BufferCursor(buffer)\n const magic = reader.toString('utf8', 4)\n if (magic !== 'DIRC') {\n throw new InternalError(`Invalid dircache magic file number: ${magic}`)\n }\n\n // Verify shasum after we ensured that the file has a magic number\n const shaComputed = await shasum(buffer.slice(0, -20))\n const shaClaimed = buffer.slice(-20).toString('hex')\n if (shaClaimed !== shaComputed) {\n throw new InternalError(\n `Invalid checksum in GitIndex buffer: expected ${shaClaimed} but saw ${shaComputed}`\n )\n }\n\n const version = reader.readUInt32BE()\n if (version !== 2) {\n throw new InternalError(`Unsupported dircache version: ${version}`)\n }\n const numEntries = reader.readUInt32BE()\n let i = 0\n while (!reader.eof() && i < numEntries) {\n const entry = {}\n entry.ctimeSeconds = reader.readUInt32BE()\n entry.ctimeNanoseconds = reader.readUInt32BE()\n entry.mtimeSeconds = reader.readUInt32BE()\n entry.mtimeNanoseconds = reader.readUInt32BE()\n entry.dev = reader.readUInt32BE()\n entry.ino = reader.readUInt32BE()\n entry.mode = reader.readUInt32BE()\n entry.uid = reader.readUInt32BE()\n entry.gid = reader.readUInt32BE()\n entry.size = reader.readUInt32BE()\n entry.oid = reader.slice(20).toString('hex')\n const flags = reader.readUInt16BE()\n entry.flags = parseCacheEntryFlags(flags)\n // TODO: handle if (version === 3 && entry.flags.extended)\n const pathlength = buffer.indexOf(0, reader.tell() + 1) - reader.tell()\n if (pathlength < 1) {\n throw new InternalError(`Got a path length of: ${pathlength}`)\n }\n // TODO: handle pathnames larger than 12 bits\n entry.path = reader.toString('utf8', pathlength)\n\n // Prevent malicious paths like \"..\\foo\"\n if (entry.path.includes('..\\\\') || entry.path.includes('../')) {\n throw new UnsafeFilepathError(entry.path)\n }\n\n // The next bit is awkward. We expect 1 to 8 null characters\n // such that the total size of the entry is a multiple of 8 bits.\n // (Hence subtract 12 bytes for the header.)\n let padding = 8 - ((reader.tell() - 12) % 8)\n if (padding === 0) padding = 8\n while (padding--) {\n const tmp = reader.readUInt8()\n if (tmp !== 0) {\n throw new InternalError(\n `Expected 1-8 null characters but got '${tmp}' after ${entry.path}`\n )\n } else if (reader.eof()) {\n throw new InternalError('Unexpected end of file')\n }\n }\n // end of awkward part\n entry.stages = []\n\n index._addEntry(entry)\n\n i++\n }\n return index\n }\n\n get unmergedPaths() {\n return [...this._unmergedPaths]\n }\n\n get entries() {\n return [...this._entries.values()].sort(comparePath)\n }\n\n get entriesMap() {\n return this._entries\n }\n\n get entriesFlat() {\n return [...this.entries].flatMap(entry => {\n return entry.stages.length > 1 ? entry.stages.filter(x => x) : entry\n })\n }\n\n *[Symbol.iterator]() {\n for (const entry of this.entries) {\n yield entry\n }\n }\n\n insert({ filepath, stats, oid, stage = 0 }) {\n if (!stats) {\n stats = {\n ctimeSeconds: 0,\n ctimeNanoseconds: 0,\n mtimeSeconds: 0,\n mtimeNanoseconds: 0,\n dev: 0,\n ino: 0,\n mode: 0,\n uid: 0,\n gid: 0,\n size: 0,\n }\n }\n stats = normalizeStats(stats)\n const bfilepath = Buffer.from(filepath)\n const entry = {\n ctimeSeconds: stats.ctimeSeconds,\n ctimeNanoseconds: stats.ctimeNanoseconds,\n mtimeSeconds: stats.mtimeSeconds,\n mtimeNanoseconds: stats.mtimeNanoseconds,\n dev: stats.dev,\n ino: stats.ino,\n // We provide a fallback value for `mode` here because not all fs\n // implementations assign it, but we use it in GitTree.\n // '100644' is for a \"regular non-executable file\"\n mode: stats.mode || 0o100644,\n uid: stats.uid,\n gid: stats.gid,\n size: stats.size,\n path: filepath,\n oid,\n flags: {\n assumeValid: false,\n extended: false,\n stage,\n nameLength: bfilepath.length < 0xfff ? bfilepath.length : 0xfff,\n },\n stages: [],\n }\n\n this._addEntry(entry)\n\n this._dirty = true\n }\n\n delete({ filepath }) {\n if (this._entries.has(filepath)) {\n this._entries.delete(filepath)\n } else {\n for (const key of this._entries.keys()) {\n if (key.startsWith(filepath + '/')) {\n this._entries.delete(key)\n }\n }\n }\n\n if (this._unmergedPaths.has(filepath)) {\n this._unmergedPaths.delete(filepath)\n }\n this._dirty = true\n }\n\n clear() {\n this._entries.clear()\n this._dirty = true\n }\n\n has({ filepath }) {\n return this._entries.has(filepath)\n }\n\n render() {\n return this.entries\n .map(entry => `${entry.mode.toString(8)} ${entry.oid} ${entry.path}`)\n .join('\\n')\n }\n\n static async _entryToBuffer(entry) {\n const bpath = Buffer.from(entry.path)\n // the fixed length + the filename + at least one null char => align by 8\n const length = Math.ceil((62 + bpath.length + 1) / 8) * 8\n const written = Buffer.alloc(length)\n const writer = new BufferCursor(written)\n const stat = normalizeStats(entry)\n writer.writeUInt32BE(stat.ctimeSeconds)\n writer.writeUInt32BE(stat.ctimeNanoseconds)\n writer.writeUInt32BE(stat.mtimeSeconds)\n writer.writeUInt32BE(stat.mtimeNanoseconds)\n writer.writeUInt32BE(stat.dev)\n writer.writeUInt32BE(stat.ino)\n writer.writeUInt32BE(stat.mode)\n writer.writeUInt32BE(stat.uid)\n writer.writeUInt32BE(stat.gid)\n writer.writeUInt32BE(stat.size)\n writer.write(entry.oid, 20, 'hex')\n writer.writeUInt16BE(renderCacheEntryFlags(entry))\n writer.write(entry.path, bpath.length, 'utf8')\n return written\n }\n\n async toObject() {\n const header = Buffer.alloc(12)\n const writer = new BufferCursor(header)\n writer.write('DIRC', 4, 'utf8')\n writer.writeUInt32BE(2)\n writer.writeUInt32BE(this.entriesFlat.length)\n\n let entryBuffers = []\n for (const entry of this.entries) {\n entryBuffers.push(GitIndex._entryToBuffer(entry))\n if (entry.stages.length > 1) {\n for (const stage of entry.stages) {\n if (stage && stage !== entry) {\n entryBuffers.push(GitIndex._entryToBuffer(stage))\n }\n }\n }\n }\n entryBuffers = await Promise.all(entryBuffers)\n\n const body = Buffer.concat(entryBuffers)\n const main = Buffer.concat([header, body])\n const sum = await shasum(main)\n return Buffer.concat([main, Buffer.from(sum, 'hex')])\n }\n}\n","import '../typedefs.js'\n\n// import LockManager from 'travix-lock-manager'\nimport AsyncLock from 'async-lock'\n\nimport { UnmergedPathsError } from '../errors/UnmergedPathsError.js'\nimport { GitIndex } from '../models/GitIndex.js'\nimport { compareStats } from '../utils/compareStats.js'\n\n// import Lock from '../utils.js'\n\n// const lm = new LockManager()\nlet lock = null\n\nconst IndexCache = Symbol('IndexCache')\n\n/**\n * Creates a cache object to store GitIndex and file stats.\n * @returns {object} A cache object with `map` and `stats` properties.\n */\nfunction createCache() {\n return {\n map: new Map(),\n stats: new Map(),\n }\n}\n\n/**\n * Updates the cached index file by reading the file system and parsing the Git index.\n * @param {FSClient} fs - A file system implementation.\n * @param {string} filepath - The path to the Git index file.\n * @param {object} cache - The cache object to update.\n * @returns {Promise<void>}\n */\nasync function updateCachedIndexFile(fs, filepath, cache) {\n const [stat, rawIndexFile] = await Promise.all([\n fs.lstat(filepath),\n fs.read(filepath),\n ])\n\n const index = await GitIndex.from(rawIndexFile)\n // cache the GitIndex object so we don't need to re-read it every time.\n cache.map.set(filepath, index)\n // Save the stat data for the index so we know whether the cached file is stale (modified by an outside process).\n cache.stats.set(filepath, stat)\n}\n\n/**\n * Determines whether the cached index file is stale by comparing file stats.\n * @param {FSClient} fs - A file system implementation.\n * @param {string} filepath - The path to the Git index file.\n * @param {object} cache - The cache object containing file stats.\n * @returns {Promise<boolean>} `true` if the index file is stale, otherwise `false`.\n */\nasync function isIndexStale(fs, filepath, cache) {\n const savedStats = cache.stats.get(filepath)\n if (savedStats === undefined) return true\n if (savedStats === null) return false\n\n const currStats = await fs.lstat(filepath)\n if (currStats === null) return false\n return compareStats(savedStats, currStats)\n}\n\nexport class GitIndexManager {\n /**\n * Manages access to the Git index file, ensuring thread-safe operations and caching.\n *\n * @param {object} opts - Options for acquiring the Git index.\n * @param {FSClient} opts.fs - A file system implementation.\n * @param {string} opts.gitdir - The path to the `.git` directory.\n * @param {object} opts.cache - A shared cache object for storing index data.\n * @param {boolean} [opts.allowUnmerged=true] - Whether to allow unmerged paths in the index.\n * @param {function(GitIndex): any} closure - A function to execute with the Git index.\n * @returns {Promise<any>} The result of the closure function.\n * @throws {UnmergedPathsError} If unmerged paths exist and `allowUnmerged` is `false`.\n */\n static async acquire({ fs, gitdir, cache, allowUnmerged = true }, closure) {\n if (!cache[IndexCache]) {\n cache[IndexCache] = createCache()\n }\n\n const filepath = `${gitdir}/index`\n if (lock === null) lock = new AsyncLock({ maxPending: Infinity })\n let result\n let unmergedPaths = []\n await lock.acquire(filepath, async () => {\n // Acquire a file lock while we're reading the index\n // to make sure other processes aren't writing to it\n // simultaneously, which could result in a corrupted index.\n // const fileLock = await Lock(filepath)\n const theIndexCache = cache[IndexCache]\n if (await isIndexStale(fs, filepath, theIndexCache)) {\n await updateCachedIndexFile(fs, filepath, theIndexCache)\n }\n const index = theIndexCache.map.get(filepath)\n unmergedPaths = index.unmergedPaths\n\n if (unmergedPaths.length && !allowUnmerged)\n throw new UnmergedPathsError(unmergedPaths)\n\n result = await closure(index)\n if (index._dirty) {\n // Acquire a file lock while we're writing the index file\n // let fileLock = await Lock(filepath)\n const buffer = await index.toObject()\n await fs.write(filepath, buffer)\n // Update cached stat value\n theIndexCache.stats.set(filepath, await fs.lstat(filepath))\n index._dirty = false\n }\n })\n\n return result\n }\n}\n","import { normalizeStats } from './normalizeStats.js'\n\nexport function compareStats(entry, stats, filemode = true, trustino = true) {\n // Comparison based on the description in Paragraph 4 of\n // https://www.kernel.org/pub/software/scm/git/docs/technical/racy-git.txt\n const e = normalizeStats(entry)\n const s = normalizeStats(stats)\n const staleness =\n (filemode && e.mode !== s.mode) ||\n e.mtimeSeconds !== s.mtimeSeconds ||\n e.ctimeSeconds !== s.ctimeSeconds ||\n e.uid !== s.uid ||\n e.gid !== s.gid ||\n (trustino && e.ino !== s.ino) ||\n e.size !== s.size\n return staleness\n}\n","import { BaseError } from './BaseError.js'\n\nexport class InvalidOidError extends BaseError {\n /**\n * @param {string} value\n */\n constructor(value) {\n super(`Expected a 40-char hex object id but saw \"${value}\".`)\n this.code = this.name = InvalidOidError.code\n this.data = { value }\n }\n}\n/** @type {'InvalidOidError'} */\nInvalidOidError.code = 'InvalidOidError'\n","import { BaseError } from './BaseError.js'\n\nexport class NoRefspecError extends BaseError {\n /**\n * @param {string} remote\n */\n constructor(remote) {\n super(`Could not find a fetch refspec for remote \"${remote}\". Make sure the config file has an entry like the following:\n[remote \"${remote}\"]\n\\tfetch = +refs/heads/*:refs/remotes/origin/*\n`)\n this.code = this.name = NoRefspecError.code\n this.data = { remote }\n }\n}\n/** @type {'NoRefspecError'} */\nNoRefspecError.code = 'NoRefspecError'\n","import { BaseError } from './BaseError.js'\n\nexport class NotFoundError extends BaseError {\n /**\n * @param {string} what\n */\n constructor(what) {\n super(`Could not find ${what}.`)\n this.code = this.name = NotFoundError.code\n this.data = { what }\n }\n}\n/** @type {'NotFoundError'} */\nNotFoundError.code = 'NotFoundError'\n","export class GitPackedRefs {\n constructor(text) {\n this.refs = new Map()\n this.parsedConfig = []\n if (text) {\n let key = null\n this.parsedConfig = text\n .trim()\n .split('\\n')\n .map(line => {\n if (/^\\s*#/.test(line)) {\n return { line, comment: true }\n }\n const i = line.indexOf(' ')\n if (line.startsWith('^')) {\n // This is a oid for the commit associated with the annotated tag immediately preceding this line.\n // Trim off the '^'\n const value = line.slice(1)\n // The tagname^{} syntax is based on the output of `git show-ref --tags -d`\n this.refs.set(key + '^{}', value)\n return { line, ref: key, peeled: value }\n } else {\n // This is an oid followed by the ref name\n const value = line.slice(0, i)\n key = line.slice(i + 1)\n this.refs.set(key, value)\n return { line, ref: key, oid: value }\n }\n })\n }\n return this\n }\n\n static from(text) {\n return new GitPackedRefs(text)\n }\n\n delete(ref) {\n this.parsedConfig = this.parsedConfig.filter(entry => entry.ref !== ref)\n this.refs.delete(ref)\n }\n\n toString() {\n return this.parsedConfig.map(({ line }) => line).join('\\n') + '\\n'\n }\n}\n","import { InternalError } from '../errors/InternalError.js'\n\nexport class GitRefSpec {\n constructor({ remotePath, localPath, force, matchPrefix }) {\n Object.assign(this, {\n remotePath,\n localPath,\n force,\n matchPrefix,\n })\n }\n\n static from(refspec) {\n const [forceMatch, remotePath, remoteGlobMatch, localPath, localGlobMatch] =\n refspec.match(/^(\\+?)(.*?)(\\*?):(.*?)(\\*?)$/).slice(1)\n const force = forceMatch === '+'\n const remoteIsGlob = remoteGlobMatch === '*'\n const localIsGlob = localGlobMatch === '*'\n // validate\n // TODO: Make this check more nuanced, and depend on whether this is a fetch refspec or a push refspec\n if (remoteIsGlob !== localIsGlob) {\n throw new InternalError('Invalid refspec')\n }\n return new GitRefSpec({\n remotePath,\n localPath,\n force,\n matchPrefix: remoteIsGlob,\n })\n // TODO: We need to run resolveRef on both paths to expand them to their full name.\n }\n\n translate(remoteBranch) {\n if (this.matchPrefix) {\n if (remoteBranch.startsWith(this.remotePath)) {\n return this.localPath + remoteBranch.replace(this.remotePath, '')\n }\n } else {\n if (remoteBranch === this.remotePath) return this.localPath\n }\n return null\n }\n\n reverseTranslate(localBranch) {\n if (this.matchPrefix) {\n if (localBranch.startsWith(this.localPath)) {\n return this.remotePath + localBranch.replace(this.localPath, '')\n }\n } else {\n if (localBranch === this.localPath) return this.remotePath\n }\n return null\n }\n}\n","import { GitRefSpec } from './GitRefSpec.js'\n\nexport class GitRefSpecSet {\n constructor(rules = []) {\n this.rules = rules\n }\n\n static from(refspecs) {\n const rules = []\n for (const refspec of refspecs) {\n rules.push(GitRefSpec.from(refspec)) // might throw\n }\n return new GitRefSpecSet(rules)\n }\n\n add(refspec) {\n const rule = GitRefSpec.from(refspec) // might throw\n this.rules.push(rule)\n }\n\n translate(remoteRefs) {\n const result = []\n for (const rule of this.rules) {\n for (const remoteRef of remoteRefs) {\n const localRef = rule.translate(remoteRef)\n if (localRef) {\n result.push([remoteRef, localRef])\n }\n }\n }\n return result\n }\n\n translateOne(remoteRef) {\n let result = null\n for (const rule of this.rules) {\n const localRef = rule.translate(remoteRef)\n if (localRef) {\n result = localRef\n }\n }\n return result\n }\n\n localNamespaces() {\n return this.rules\n .filter(rule => rule.matchPrefix)\n .map(rule => rule.localPath.replace(/\\/$/, ''))\n }\n}\n","export function compareRefNames(a, b) {\n // https://stackoverflow.com/a/40355107/2168416\n const _a = a.replace(/\\^\\{\\}$/, '')\n const _b = b.replace(/\\^\\{\\}$/, '')\n const tmp = -(_a < _b) || +(_a > _b)\n if (tmp === 0) {\n return a.endsWith('^{}') ? 1 : -1\n }\n return tmp\n}\n","import '../typedefs.js'\n\n// This is a convenience wrapper for reading and writing files in the 'refs' directory.\nimport AsyncLock from 'async-lock'\n\nimport { InvalidOidError } from '../errors/InvalidOidError.js'\nimport { NoRefspecError } from '../errors/NoRefspecError.js'\nimport { NotFoundError } from '../errors/NotFoundError.js'\nimport { GitPackedRefs } from '../models/GitPackedRefs.js'\nimport { GitRefSpecSet } from '../models/GitRefSpecSet.js'\nimport { compareRefNames } from '../utils/compareRefNames.js'\nimport { join } from '../utils/join.js'\n\nimport { GitConfigManager } from './GitConfigManager.js'\n\n// @see https://git-scm.com/docs/git-rev-parse.html#_specifying_revisions\nconst refpaths = ref => [\n `${ref}`,\n `refs/${ref}`,\n `refs/tags/${ref}`,\n `refs/heads/${ref}`,\n `refs/remotes/${ref}`,\n `refs/remotes/${ref}/HEAD`,\n]\n\n// @see https://git-scm.com/docs/gitrepository-layout\nconst GIT_FILES = ['config', 'description', 'index', 'shallow', 'commondir']\n\nlet lock\n\nasync function acquireLock(ref, callback) {\n if (lock === undefined) lock = new AsyncLock()\n return lock.acquire(ref, callback)\n}\n\n/**\n * A class for managing Git references, including reading, writing, deleting, and resolving refs.\n */\nexport class GitRefManager {\n /**\n * Updates remote refs based on the provided refspecs and options.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.remote - The name of the remote.\n * @param {Map<string, string>} args.refs - A map of refs to their object IDs.\n * @param {Map<string, string>} args.symrefs - A map of symbolic refs.\n * @param {boolean} args.tags - Whether to fetch tags.\n * @param {string[]} [args.refspecs = undefined] - The refspecs to use.\n * @param {boolean} [args.prune = false] - Whether to prune stale refs.\n * @param {boolean} [args.pruneTags = false] - Whether to prune tags.\n * @returns {Promise<Object>} - An object containing pruned refs.\n */\n static async updateRemoteRefs({\n fs,\n gitdir,\n remote,\n refs,\n symrefs,\n tags,\n refspecs = undefined,\n prune = false,\n pruneTags = false,\n }) {\n // Validate input\n for (const value of refs.values()) {\n if (!value.match(/[0-9a-f]{40}/)) {\n throw new InvalidOidError(value)\n }\n }\n const config = await GitConfigManager.get({ fs, gitdir })\n if (!refspecs) {\n refspecs = await config.getall(`remote.${remote}.fetch`)\n if (refspecs.length === 0) {\n throw new NoRefspecError(remote)\n }\n // There's some interesting behavior with HEAD that doesn't follow the refspec.\n refspecs.unshift(`+HEAD:refs/remotes/${remote}/HEAD`)\n }\n const refspec = GitRefSpecSet.from(refspecs)\n const actualRefsToWrite = new Map()\n // Delete all current tags if the pruneTags argument is true.\n if (pruneTags) {\n const tags = await GitRefManager.listRefs({\n fs,\n gitdir,\n filepath: 'refs/tags',\n })\n await GitRefManager.deleteRefs({\n fs,\n gitdir,\n refs: tags.map(tag => `refs/tags/${tag}`),\n })\n }\n // Add all tags if the fetch tags argument is true.\n if (tags) {\n for (const serverRef of refs.keys()) {\n if (serverRef.startsWith('refs/tags') && !serverRef.endsWith('^{}')) {\n // Git's behavior is to only fetch tags that do not conflict with tags already present.\n if (!(await GitRefManager.exists({ fs, gitdir, ref: serverRef }))) {\n // Always use the object id of the tag itself, and not the peeled object id.\n const oid = refs.get(serverRef)\n actualRefsToWrite.set(serverRef, oid)\n }\n }\n }\n }\n // Combine refs and symrefs giving symrefs priority\n const refTranslations = refspec.translate([...refs.keys()])\n for (const [serverRef, translatedRef] of refTranslations) {\n const value = refs.get(serverRef)\n actualRefsToWrite.set(translatedRef, value)\n }\n const symrefTranslations = refspec.translate([...symrefs.keys()])\n for (const [serverRef, translatedRef] of symrefTranslations) {\n const value = symrefs.get(serverRef)\n const symtarget = refspec.translateOne(value)\n if (symtarget) {\n actualRefsToWrite.set(translatedRef, `ref: ${symtarget}`)\n }\n }\n // If `prune` argument is true, clear out the existing local refspec roots\n const pruned = []\n if (prune) {\n for (const filepath of refspec.localNamespaces()) {\n const refs = (\n await GitRefManager.listRefs({\n fs,\n gitdir,\n filepath,\n })\n ).map(file => `${filepath}/${file}`)\n for (const ref of refs) {\n if (!actualRefsToWrite.has(ref)) {\n pruned.push(ref)\n }\n }\n }\n if (pruned.length > 0) {\n await GitRefManager.deleteRefs({ fs, gitdir, refs: pruned })\n }\n }\n // Update files\n // TODO: For large repos with a history of thousands of pull requests\n // (i.e. gitlab-ce) it would be vastly more efficient to write them\n // to .git/packed-refs.\n // The trick is to make sure we a) don't write a packed ref that is\n // already shadowed by a loose ref and b) don't loose any refs already\n // in packed-refs. Doing this efficiently may be difficult. A\n // solution that might work is\n // a) load the current packed-refs file\n // b) add actualRefsToWrite, overriding the existing values if present\n // c) enumerate all the loose refs currently in .git/refs/remotes/${remote}\n // d) overwrite their value with the new value.\n // Examples of refs we need to avoid writing in loose format for efficieny's sake\n // are .git/refs/remotes/origin/refs/remotes/remote_mirror_3059\n // and .git/refs/remotes/origin/refs/merge-requests\n for (const [key, value] of actualRefsToWrite) {\n await acquireLock(key, async () =>\n fs.write(join(gitdir, key), `${value.trim()}\\n`, 'utf8')\n )\n }\n return { pruned }\n }\n\n /**\n * Writes a ref to the file system.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to write.\n * @param {string} args.value - The object ID to write.\n * @returns {Promise<void>}\n */\n // TODO: make this less crude?\n static async writeRef({ fs, gitdir, ref, value }) {\n // Validate input\n if (!value.match(/[0-9a-f]{40}/)) {\n throw new InvalidOidError(value)\n }\n await acquireLock(ref, async () =>\n fs.write(join(gitdir, ref), `${value.trim()}\\n`, 'utf8')\n )\n }\n\n /**\n * Writes a symbolic ref to the file system.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to write.\n * @param {string} args.value - The target ref.\n * @returns {Promise<void>}\n */\n static async writeSymbolicRef({ fs, gitdir, ref, value }) {\n await acquireLock(ref, async () =>\n fs.write(join(gitdir, ref), 'ref: ' + `${value.trim()}\\n`, 'utf8')\n )\n }\n\n /**\n * Deletes a single ref.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to delete.\n * @returns {Promise<void>}\n */\n static async deleteRef({ fs, gitdir, ref }) {\n return GitRefManager.deleteRefs({ fs, gitdir, refs: [ref] })\n }\n\n /**\n * Deletes multiple refs.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string[]} args.refs - The refs to delete.\n * @returns {Promise<void>}\n */\n static async deleteRefs({ fs, gitdir, refs }) {\n // Delete regular ref\n await Promise.all(refs.map(ref => fs.rm(join(gitdir, ref))))\n // Delete any packed ref\n let text = await acquireLock('packed-refs', async () =>\n fs.read(`${gitdir}/packed-refs`, { encoding: 'utf8' })\n )\n const packed = GitPackedRefs.from(text)\n const beforeSize = packed.refs.size\n for (const ref of refs) {\n if (packed.refs.has(ref)) {\n packed.delete(ref)\n }\n }\n if (packed.refs.size < beforeSize) {\n text = packed.toString()\n await acquireLock('packed-refs', async () =>\n fs.write(`${gitdir}/packed-refs`, text, { encoding: 'utf8' })\n )\n }\n }\n\n /**\n * Resolves a ref to its object ID.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to resolve.\n * @param {number} [args.depth = undefined] - The maximum depth to resolve symbolic refs.\n * @returns {Promise<string>} - The resolved object ID.\n */\n static async resolve({ fs, gitdir, ref, depth = undefined }) {\n if (depth !== undefined) {\n depth--\n if (depth === -1) {\n return ref\n }\n }\n\n // Is it a ref pointer?\n if (ref.startsWith('ref: ')) {\n ref = ref.slice('ref: '.length)\n return GitRefManager.resolve({ fs, gitdir, ref, depth })\n }\n // Is it a complete and valid SHA?\n if (ref.length === 40 && /[0-9a-f]{40}/.test(ref)) {\n return ref\n }\n // We need to alternate between the file system and the packed-refs\n const packedMap = await GitRefManager.packedRefs({ fs, gitdir })\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref).filter(p => !GIT_FILES.includes(p)) // exclude git system files (#709)\n\n for (const ref of allpaths) {\n const sha = await acquireLock(\n ref,\n async () =>\n (await fs.read(`${gitdir}/${ref}`, { encoding: 'utf8' })) ||\n packedMap.get(ref)\n )\n if (sha) {\n return GitRefManager.resolve({ fs, gitdir, ref: sha.trim(), depth })\n }\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Checks if a ref exists.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to check.\n * @returns {Promise<boolean>} - True if the ref exists, false otherwise.\n */\n static async exists({ fs, gitdir, ref }) {\n try {\n await GitRefManager.expand({ fs, gitdir, ref })\n return true\n } catch (err) {\n return false\n }\n }\n\n /**\n * Expands a ref to its full name.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.ref - The ref to expand.\n * @returns {Promise<string>} - The full ref name.\n */\n static async expand({ fs, gitdir, ref }) {\n // Is it a complete and valid SHA?\n if (ref.length === 40 && /[0-9a-f]{40}/.test(ref)) {\n return ref\n }\n // We need to alternate between the file system and the packed-refs\n const packedMap = await GitRefManager.packedRefs({ fs, gitdir })\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref)\n for (const ref of allpaths) {\n const refExists = await acquireLock(ref, async () =>\n fs.exists(`${gitdir}/${ref}`)\n )\n if (refExists) return ref\n if (packedMap.has(ref)) return ref\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Expands a ref against a provided map.\n *\n * @param {Object} args\n * @param {string} args.ref - The ref to expand.\n * @param {Map<string, string>} args.map - The map of refs.\n * @returns {Promise<string>} - The expanded ref.\n */\n static async expandAgainstMap({ ref, map }) {\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref)\n for (const ref of allpaths) {\n if (await map.has(ref)) return ref\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Resolves a ref against a provided map.\n *\n * @param {Object} args\n * @param {string} args.ref - The ref to resolve.\n * @param {string} [args.fullref = args.ref] - The full ref name.\n * @param {number} [args.depth = undefined] - The maximum depth to resolve symbolic refs.\n * @param {Map<string, string>} args.map - The map of refs.\n * @returns {Object} - An object containing the full ref and its object ID.\n */\n static resolveAgainstMap({ ref, fullref = ref, depth = undefined, map }) {\n if (depth !== undefined) {\n depth--\n if (depth === -1) {\n return { fullref, oid: ref }\n }\n }\n // Is it a ref pointer?\n if (ref.startsWith('ref: ')) {\n ref = ref.slice('ref: '.length)\n return GitRefManager.resolveAgainstMap({ ref, fullref, depth, map })\n }\n // Is it a complete and valid SHA?\n if (ref.length === 40 && /[0-9a-f]{40}/.test(ref)) {\n return { fullref, oid: ref }\n }\n // Look in all the proper paths, in this order\n const allpaths = refpaths(ref)\n for (const ref of allpaths) {\n const sha = map.get(ref)\n if (sha) {\n return GitRefManager.resolveAgainstMap({\n ref: sha.trim(),\n fullref: ref,\n depth,\n map,\n })\n }\n }\n // Do we give up?\n throw new NotFoundError(ref)\n }\n\n /**\n * Reads the packed refs file and returns a map of refs.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @returns {Promise<Map<string, string>>} - A map of packed refs.\n */\n static async packedRefs({ fs, gitdir }) {\n const text = await acquireLock('packed-refs', async () =>\n fs.read(`${gitdir}/packed-refs`, { encoding: 'utf8' })\n )\n const packed = GitPackedRefs.from(text)\n return packed.refs\n }\n\n /**\n * Lists all refs matching a given filepath prefix.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} args.filepath - The filepath prefix to match.\n * @returns {Promise<string[]>} - A sorted list of refs.\n */\n static async listRefs({ fs, gitdir, filepath }) {\n const packedMap = GitRefManager.packedRefs({ fs, gitdir })\n let files = null\n try {\n files = await fs.readdirDeep(`${gitdir}/${filepath}`)\n files = files.map(x => x.replace(`${gitdir}/${filepath}/`, ''))\n } catch (err) {\n files = []\n }\n\n for (let key of (await packedMap).keys()) {\n // filter by prefix\n if (key.startsWith(filepath)) {\n // remove prefix\n key = key.replace(filepath + '/', '')\n // Don't include duplicates; the loose files have precedence anyway\n if (!files.includes(key)) {\n files.push(key)\n }\n }\n }\n // since we just appended things onto an array, we need to sort them now\n files.sort(compareRefNames)\n return files\n }\n\n /**\n * Lists all branches, optionally filtered by remote.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {string} [args.remote] - The remote to filter branches by.\n * @returns {Promise<string[]>} - A list of branch names.\n */\n static async listBranches({ fs, gitdir, remote }) {\n if (remote) {\n return GitRefManager.listRefs({\n fs,\n gitdir,\n filepath: `refs/remotes/${remote}`,\n })\n } else {\n return GitRefManager.listRefs({ fs, gitdir, filepath: `refs/heads` })\n }\n }\n\n /**\n * Lists all tags.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n * @returns {Promise<string[]>} - A list of tag names.\n */\n static async listTags({ fs, gitdir }) {\n const tags = await GitRefManager.listRefs({\n fs,\n gitdir,\n filepath: `refs/tags`,\n })\n return tags.filter(x => !x.endsWith('^{}'))\n }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class HttpError extends BaseError {\n /**\n * @param {number} statusCode\n * @param {string} statusMessage\n * @param {string} response\n */\n constructor(statusCode, statusMessage, response) {\n super(`HTTP Error: ${statusCode} ${statusMessage}`)\n this.code = this.name = HttpError.code\n this.data = { statusCode, statusMessage, response }\n }\n}\n/** @type {'HttpError'} */\nHttpError.code = 'HttpError'\n","import { BaseError } from './BaseError.js'\n\nexport class SmartHttpError extends BaseError {\n /**\n * @param {string} preview\n * @param {string} response\n */\n constructor(preview, response) {\n super(\n `Remote did not reply using the \"smart\" HTTP protocol. Expected \"001e# service=git-upload-pack\" but received: ${preview}`\n )\n this.code = this.name = SmartHttpError.code\n this.data = { preview, response }\n }\n}\n/** @type {'SmartHttpError'} */\nSmartHttpError.code = 'SmartHttpError'\n","import { BaseError } from './BaseError.js'\n\nexport class UserCanceledError extends BaseError {\n constructor() {\n super(`The operation was canceled.`)\n this.code = this.name = UserCanceledError.code\n this.data = {}\n }\n}\n/** @type {'UserCanceledError'} */\nUserCanceledError.code = 'UserCanceledError'\n","export function calculateBasicAuthHeader({ username = '', password = '' }) {\n return `Basic ${Buffer.from(`${username}:${password}`).toString('base64')}`\n}\n","import { fromValue } from '../utils/fromValue.js'\n\nexport function getIterator(iterable) {\n if (iterable[Symbol.asyncIterator]) {\n return iterable[Symbol.asyncIterator]()\n }\n if (iterable[Symbol.iterator]) {\n return iterable[Symbol.iterator]()\n }\n if (iterable.next) {\n return iterable\n }\n return fromValue(iterable)\n}\n","// Convert a value to an Async Iterator\n// This will be easier with async generator functions.\nexport function fromValue(value) {\n let queue = [value]\n return {\n next() {\n return Promise.resolve({ done: queue.length === 0, value: queue.pop() })\n },\n return() {\n queue = []\n return {}\n },\n [Symbol.asyncIterator]() {\n return this\n },\n }\n}\n","export function extractAuthFromUrl(url) {\n // For whatever reason, the `fetch` API does not convert credentials embedded in the URL\n // into Basic Authentication headers automatically. Instead it throws an error!\n // So we must manually parse the URL, rip out the user:password portion if it is present\n // and compute the Authorization header.\n // Note: I tried using new URL(url) but that throws a security exception in Edge. :rolleyes:\n let userpass = url.match(/^https?:\\/\\/([^/]+)@/)\n // No credentials, return the url unmodified and an empty auth object\n if (userpass == null) return { url, auth: {} }\n userpass = userpass[1]\n const [username, password] = userpass.split(':')\n // Remove credentials from URL\n url = url.replace(`${userpass}@`, '')\n // Has credentials, return the fetch-safe URL and the parsed credentials\n return { url, auth: { username, password } }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class EmptyServerResponseError extends BaseError {\n constructor() {\n super(`Empty response from git server.`)\n this.code = this.name = EmptyServerResponseError.code\n this.data = {}\n }\n}\n/** @type {'EmptyServerResponseError'} */\nEmptyServerResponseError.code = 'EmptyServerResponseError'\n","import { BaseError } from './BaseError.js'\n\nexport class ParseError extends BaseError {\n /**\n * @param {string} expected\n * @param {string} actual\n */\n constructor(expected, actual) {\n super(`Expected \"${expected}\" but received \"${actual}\".`)\n this.code = this.name = ParseError.code\n this.data = { expected, actual }\n }\n}\n/** @type {'ParseError'} */\nParseError.code = 'ParseError'\n","import { getIterator } from './getIterator.js'\n\n// inspired by 'gartal' but lighter-weight and more battle-tested.\nexport class StreamReader {\n constructor(stream) {\n // TODO: fix usage in bundlers before Buffer dependency is removed #1855\n if (typeof Buffer === 'undefined') {\n throw new Error('Missing Buffer dependency')\n }\n this.stream = getIterator(stream)\n this.buffer = null\n this.cursor = 0\n this.undoCursor = 0\n this.started = false\n this._ended = false\n this._discardedBytes = 0\n }\n\n eof() {\n return this._ended && this.cursor === this.buffer.length\n }\n\n tell() {\n return this._discardedBytes + this.cursor\n }\n\n async byte() {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor === this.buffer.length) {\n await this._loadnext()\n if (this._ended) return\n }\n this._moveCursor(1)\n return this.buffer[this.undoCursor]\n }\n\n async chunk() {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor === this.buffer.length) {\n await this._loadnext()\n if (this._ended) return\n }\n this._moveCursor(this.buffer.length)\n return this.buffer.slice(this.undoCursor, this.cursor)\n }\n\n async read(n) {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor + n > this.buffer.length) {\n this._trim()\n await this._accumulate(n)\n }\n this._moveCursor(n)\n return this.buffer.slice(this.undoCursor, this.cursor)\n }\n\n async skip(n) {\n if (this.eof()) return\n if (!this.started) await this._init()\n if (this.cursor + n > this.buffer.length) {\n this._trim()\n await this._accumulate(n)\n }\n this._moveCursor(n)\n }\n\n async undo() {\n this.cursor = this.undoCursor\n }\n\n async _next() {\n this.started = true\n let { done, value } = await this.stream.next()\n if (done) {\n this._ended = true\n if (!value) return Buffer.alloc(0)\n }\n if (value) {\n value = Buffer.from(value)\n }\n return value\n }\n\n _trim() {\n // Throw away parts of the buffer we don't need anymore\n // assert(this.cursor <= this.buffer.length)\n this.buffer = this.buffer.slice(this.undoCursor)\n this.cursor -= this.undoCursor\n this._discardedBytes += this.undoCursor\n this.undoCursor = 0\n }\n\n _moveCursor(n) {\n this.undoCursor = this.cursor\n this.cursor += n\n if (this.cursor > this.buffer.length) {\n this.cursor = this.buffer.length\n }\n }\n\n async _accumulate(n) {\n if (this._ended) return\n // Expand the buffer until we have N bytes of data\n // or we've reached the end of the stream\n const buffers = [this.buffer]\n while (this.cursor + n > lengthBuffers(buffers)) {\n const nextbuffer = await this._next()\n if (this._ended) break\n buffers.push(nextbuffer)\n }\n this.buffer = Buffer.concat(buffers)\n }\n\n async _loadnext() {\n this._discardedBytes += this.buffer.length\n this.undoCursor = 0\n this.cursor = 0\n this.buffer = await this._next()\n }\n\n async _init() {\n this.buffer = await this._next()\n }\n}\n\n// This helper function helps us postpone concatenating buffers, which\n// would create intermediate buffer objects,\nfunction lengthBuffers(buffers) {\n return buffers.reduce((acc, buffer) => acc + buffer.length, 0)\n}\n","/**\npkt-line Format\n---------------\n\nMuch (but not all) of the payload is described around pkt-lines.\n\nA pkt-line is a variable length binary string. The first four bytes\nof the line, the pkt-len, indicates the total length of the line,\nin hexadecimal. The pkt-len includes the 4 bytes used to contain\nthe length's hexadecimal representation.\n\nA pkt-line MAY contain binary data, so implementers MUST ensure\npkt-line parsing/formatting routines are 8-bit clean.\n\nA non-binary line SHOULD BE terminated by an LF, which if present\nMUST be included in the total length. Receivers MUST treat pkt-lines\nwith non-binary data the same whether or not they contain the trailing\nLF (stripping the LF if present, and not complaining when it is\nmissing).\n\nThe maximum length of a pkt-line's data component is 65516 bytes.\nImplementations MUST NOT send pkt-line whose length exceeds 65520\n(65516 bytes of payload + 4 bytes of length data).\n\nImplementations SHOULD NOT send an empty pkt-line (\"0004\").\n\nA pkt-line with a length field of 0 (\"0000\"), called a flush-pkt,\nis a special case and MUST be handled differently than an empty\npkt-line (\"0004\").\n\n----\n pkt-line = data-pkt / flush-pkt\n\n data-pkt = pkt-len pkt-payload\n pkt-len = 4*(HEXDIG)\n pkt-payload = (pkt-len - 4)*(OCTET)\n\n flush-pkt = \"0000\"\n----\n\nExamples (as C-style strings):\n\n----\n pkt-line actual value\n ---------------------------------\n \"0006a\\n\" \"a\\n\"\n \"0005a\" \"a\"\n \"000bfoobar\\n\" \"foobar\\n\"\n \"0004\" \"\"\n----\n*/\nimport { StreamReader } from '../utils/StreamReader.js'\nimport { padHex } from '../utils/padHex.js'\n\n// I'm really using this more as a namespace.\n// There's not a lot of \"state\" in a pkt-line\n\nexport class GitPktLine {\n static flush() {\n return Buffer.from('0000', 'utf8')\n }\n\n static delim() {\n return Buffer.from('0001', 'utf8')\n }\n\n static encode(line) {\n if (typeof line === 'string') {\n line = Buffer.from(line)\n }\n const length = line.length + 4\n const hexlength = padHex(4, length)\n return Buffer.concat([Buffer.from(hexlength, 'utf8'), line])\n }\n\n static streamReader(stream) {\n const reader = new StreamReader(stream)\n return async function read() {\n try {\n let length = await reader.read(4)\n if (length == null) return true\n length = parseInt(length.toString('utf8'), 16)\n if (length === 0) return null\n if (length === 1) return null // delim packets\n const buffer = await reader.read(length - 4)\n if (buffer == null) return true\n return buffer\n } catch (err) {\n stream.error = err\n return true\n }\n }\n }\n}\n","export function padHex(b, n) {\n const s = n.toString(16)\n return '0'.repeat(b - s.length) + s\n}\n","// @ts-check\n\n/**\n * @param {function} read\n */\nexport async function parseCapabilitiesV2(read) {\n /** @type {Object<string, string | true>} */\n const capabilities2 = {}\n\n let line\n while (true) {\n line = await read()\n if (line === true) break\n if (line === null) continue\n line = line.toString('utf8').replace(/\\n$/, '')\n const i = line.indexOf('=')\n if (i > -1) {\n const key = line.slice(0, i)\n const value = line.slice(i + 1)\n capabilities2[key] = value\n } else {\n capabilities2[line] = true\n }\n }\n return { protocolVersion: 2, capabilities2 }\n}\n","import { EmptyServerResponseError } from '../errors/EmptyServerResponseError.js'\nimport { ParseError } from '../errors/ParseError.js'\nimport { GitPktLine } from '../models/GitPktLine.js'\nimport { parseCapabilitiesV2 } from '../wire/parseCapabilitiesV2.js'\n\nexport async function parseRefsAdResponse(stream, { service }) {\n const capabilities = new Set()\n const refs = new Map()\n const symrefs = new Map()\n\n // There is probably a better way to do this, but for now\n // let's just throw the result parser inline here.\n const read = GitPktLine.streamReader(stream)\n let lineOne = await read()\n // skip past any flushes\n while (lineOne === null) lineOne = await read()\n\n if (lineOne === true) throw new EmptyServerResponseError()\n\n // Handle protocol v2 responses (Bitbucket Server doesn't include a `# service=` line)\n if (lineOne.includes('version 2')) {\n return parseCapabilitiesV2(read)\n }\n\n // Clients MUST ignore an LF at the end of the line.\n if (lineOne.toString('utf8').replace(/\\n$/, '') !== `# service=${service}`) {\n throw new ParseError(`# service=${service}\\\\n`, lineOne.toString('utf8'))\n }\n let lineTwo = await read()\n // skip past any flushes\n while (lineTwo === null) lineTwo = await read()\n // In the edge case of a brand new repo, zero refs (and zero capabilities)\n // are returned.\n if (lineTwo === true) return { capabilities, refs, symrefs }\n lineTwo = lineTwo.toString('utf8')\n\n // Handle protocol v2 responses\n if (lineTwo.includes('version 2')) {\n return parseCapabilitiesV2(read)\n }\n\n const [firstRef, capabilitiesLine] = splitAndAssert(lineTwo, '\\x00', '\\\\x00')\n capabilitiesLine.split(' ').map(x => capabilities.add(x))\n // see no-refs in https://git-scm.com/docs/pack-protocol#_reference_discovery (since git 2.41.0)\n if (firstRef !== '0000000000000000000000000000000000000000 capabilities^{}') {\n const [ref, name] = splitAndAssert(firstRef, ' ', ' ')\n refs.set(name, ref)\n while (true) {\n const line = await read()\n if (line === true) break\n if (line !== null) {\n const [ref, name] = splitAndAssert(line.toString('utf8'), ' ', ' ')\n refs.set(name, ref)\n }\n }\n }\n // Symrefs are thrown into the \"capabilities\" unfortunately.\n for (const cap of capabilities) {\n if (cap.startsWith('symref=')) {\n const m = cap.match(/symref=([^:]+):(.*)/)\n if (m.length === 3) {\n symrefs.set(m[1], m[2])\n }\n }\n }\n return { protocolVersion: 1, capabilities, refs, symrefs }\n}\n\nfunction splitAndAssert(line, sep, expected) {\n const split = line.trim().split(sep)\n if (split.length !== 2) {\n throw new ParseError(\n `Two strings separated by '${expected}'`,\n line.toString('utf8')\n )\n }\n return split\n}\n","import '../typedefs.js'\n\nimport { HttpError } from '../errors/HttpError.js'\nimport { SmartHttpError } from '../errors/SmartHttpError.js'\nimport { UserCanceledError } from '../errors/UserCanceledError.js'\nimport { calculateBasicAuthHeader } from '../utils/calculateBasicAuthHeader.js'\nimport { collect } from '../utils/collect.js'\nimport { extractAuthFromUrl } from '../utils/extractAuthFromUrl.js'\nimport { parseRefsAdResponse } from '../wire/parseRefsAdResponse.js'\n\n// Try to accommodate known CORS proxy implementations:\n// - https://jcubic.pl/proxy.php? <-- uses query string\n// - https://cors.isomorphic-git.org <-- uses path\nconst corsProxify = (corsProxy, url) =>\n corsProxy.endsWith('?')\n ? `${corsProxy}${url}`\n : `${corsProxy}/${url.replace(/^https?:\\/\\//, '')}`\n\nconst updateHeaders = (headers, auth) => {\n // Update the basic auth header\n if (auth.username || auth.password) {\n headers.Authorization = calculateBasicAuthHeader(auth)\n }\n // but any manually provided headers take precedence\n if (auth.headers) {\n Object.assign(headers, auth.headers)\n }\n}\n\n/**\n * @param {GitHttpResponse} res\n *\n * @returns {{ preview: string, response: string, data: Buffer }}\n */\nconst stringifyBody = async res => {\n try {\n // Some services provide a meaningful error message in the body of 403s like \"token lacks the scopes necessary to perform this action\"\n const data = Buffer.from(await collect(res.body))\n const response = data.toString('utf8')\n const preview =\n response.length < 256 ? response : response.slice(0, 256) + '...'\n return { preview, response, data }\n } catch (e) {\n return {}\n }\n}\n\nexport class GitRemoteHTTP {\n /**\n * Returns the capabilities of the GitRemoteHTTP class.\n *\n * @returns {Promise<string[]>} - An array of supported capabilities.\n */\n static async capabilities() {\n return ['discover', 'connect']\n }\n\n /**\n * Discovers references from a remote Git repository.\n *\n * @param {Object} args\n * @param {HttpClient} args.http - The HTTP client to use for requests.\n * @param {ProgressCallback} [args.onProgress] - Callback for progress updates.\n * @param {AuthCallback} [args.onAuth] - Callback for providing authentication credentials.\n * @param {AuthFailureCallback} [args.onAuthFailure] - Callback for handling authentication failures.\n * @param {AuthSuccessCallback} [args.onAuthSuccess] - Callback for handling successful authentication.\n * @param {string} [args.corsProxy] - Optional CORS proxy URL.\n * @param {string} args.service - The Git service (e.g., \"git-upload-pack\").\n * @param {string} args.url - The URL of the remote repository.\n * @param {Object<string, string>} args.headers - HTTP headers to include in the request.\n * @param {1 | 2} args.protocolVersion - The Git protocol version to use.\n * @returns {Promise<Object>} - The parsed response from the remote repository.\n * @throws {HttpError} - If the HTTP request fails.\n * @throws {SmartHttpError} - If the response cannot be parsed.\n * @throws {UserCanceledError} - If the user cancels the operation.\n */\n static async discover({\n http,\n onProgress,\n onAuth,\n onAuthSuccess,\n onAuthFailure,\n corsProxy,\n service,\n url: _origUrl,\n headers,\n protocolVersion,\n }) {\n let { url, auth } = extractAuthFromUrl(_origUrl)\n const proxifiedURL = corsProxy ? corsProxify(corsProxy, url) : url\n if (auth.username || auth.password) {\n headers.Authorization = calculateBasicAuthHeader(auth)\n }\n if (protocolVersion === 2) {\n headers['Git-Protocol'] = 'version=2'\n }\n\n let res\n let tryAgain\n let providedAuthBefore = false\n do {\n res = await http.request({\n onProgress,\n method: 'GET',\n url: `${proxifiedURL}/info/refs?service=${service}`,\n headers,\n })\n\n // the default loop behavior\n tryAgain = false\n\n // 401 is the \"correct\" response for access denied. 203 is Non-Authoritative Information and comes from Azure DevOps, which\n // apparently doesn't realize this is a git request and is returning the HTML for the \"Azure DevOps Services | Sign In\" page.\n if (res.statusCode === 401 || res.statusCode === 203) {\n // On subsequent 401s, call `onAuthFailure` instead of `onAuth`.\n // This is so that naive `onAuth` callbacks that return a fixed value don't create an infinite loop of retrying.\n const getAuth = providedAuthBefore ? onAuthFailure : onAuth\n if (getAuth) {\n // Acquire credentials and try again\n // TODO: read `useHttpPath` value from git config and pass along?\n auth = await getAuth(url, {\n ...auth,\n headers: { ...headers },\n })\n if (auth && auth.cancel) {\n throw new UserCanceledError()\n } else if (auth) {\n updateHeaders(headers, auth)\n providedAuthBefore = true\n tryAgain = true\n }\n }\n } else if (\n res.statusCode === 200 &&\n providedAuthBefore &&\n onAuthSuccess\n ) {\n await onAuthSuccess(url, auth)\n }\n } while (tryAgain)\n\n if (res.statusCode !== 200) {\n const { response } = await stringifyBody(res)\n throw new HttpError(res.statusCode, res.statusMessage, response)\n }\n // Git \"smart\" HTTP servers should respond with the correct Content-Type header.\n if (\n res.headers['content-type'] === `application/x-${service}-advertisement`\n ) {\n const remoteHTTP = await parseRefsAdResponse(res.body, { service })\n remoteHTTP.auth = auth\n return remoteHTTP\n } else {\n // If they don't send the correct content-type header, that's a good indicator it is either a \"dumb\" HTTP\n // server, or the user specified an incorrect remote URL and the response is actually an HTML page.\n // In this case, we save the response as plain text so we can generate a better error message if needed.\n const { preview, response, data } = await stringifyBody(res)\n // For backwards compatibility, try to parse it anyway.\n // TODO: maybe just throw instead of trying?\n try {\n const remoteHTTP = await parseRefsAdResponse([data], { service })\n remoteHTTP.auth = auth\n return remoteHTTP\n } catch (e) {\n throw new SmartHttpError(preview, response)\n }\n }\n }\n\n /**\n * Connects to a remote Git repository and sends a request.\n *\n * @param {Object} args\n * @param {HttpClient} args.http - The HTTP client to use for requests.\n * @param {ProgressCallback} [args.onProgress] - Callback for progress updates.\n * @param {string} [args.corsProxy] - Optional CORS proxy URL.\n * @param {string} args.service - The Git service (e.g., \"git-upload-pack\").\n * @param {string} args.url - The URL of the remote repository.\n * @param {Object<string, string>} [args.headers] - HTTP headers to include in the request.\n * @param {any} args.body - The request body to send.\n * @param {any} args.auth - Authentication credentials.\n * @returns {Promise<GitHttpResponse>} - The HTTP response from the remote repository.\n * @throws {HttpError} - If the HTTP request fails.\n */\n static async connect({\n http,\n onProgress,\n corsProxy,\n service,\n url,\n auth,\n body,\n headers,\n }) {\n // We already have the \"correct\" auth value at this point, but\n // we need to strip out the username/password from the URL yet again.\n const urlAuth = extractAuthFromUrl(url)\n if (urlAuth) url = urlAuth.url\n\n if (corsProxy) url = corsProxify(corsProxy, url)\n\n headers['content-type'] = `application/x-${service}-request`\n headers.accept = `application/x-${service}-result`\n updateHeaders(headers, auth)\n\n const res = await http.request({\n onProgress,\n method: 'POST',\n url: `${url}/${service}`,\n body,\n headers,\n })\n if (res.statusCode !== 200) {\n const { response } = stringifyBody(res)\n throw new HttpError(res.statusCode, res.statusMessage, response)\n }\n return res\n }\n}\n","import { forAwait } from './forAwait.js'\n\nexport async function collect(iterable) {\n let size = 0\n const buffers = []\n // This will be easier once `for await ... of` loops are available.\n await forAwait(iterable, value => {\n buffers.push(value)\n size += value.byteLength\n })\n const result = new Uint8Array(size)\n let nextIndex = 0\n for (const buffer of buffers) {\n result.set(buffer, nextIndex)\n nextIndex += buffer.byteLength\n }\n return result\n}\n","import { getIterator } from './getIterator.js'\n\n// Currently 'for await' upsets my linters.\nexport async function forAwait(iterable, cb) {\n const iter = getIterator(iterable)\n while (true) {\n const { value, done } = await iter.next()\n if (value) await cb(value)\n if (done) break\n }\n if (iter.return) iter.return()\n}\n","import { BaseError } from './BaseError.js'\n\nexport class UnknownTransportError extends BaseError {\n /**\n * @param {string} url\n * @param {string} transport\n * @param {string} [suggestion]\n */\n constructor(url, transport, suggestion) {\n super(\n `Git remote \"${url}\" uses an unrecognized transport protocol: \"${transport}\"`\n )\n this.code = this.name = UnknownTransportError.code\n this.data = { url, transport, suggestion }\n }\n}\n/** @type {'UnknownTransportError'} */\nUnknownTransportError.code = 'UnknownTransportError'\n","import { BaseError } from './BaseError.js'\n\nexport class UrlParseError extends BaseError {\n /**\n * @param {string} url\n */\n constructor(url) {\n super(`Cannot parse remote URL: \"${url}\"`)\n this.code = this.name = UrlParseError.code\n this.data = { url }\n }\n}\n/** @type {'UrlParseError'} */\nUrlParseError.code = 'UrlParseError'\n","import { UnknownTransportError } from '../errors/UnknownTransportError.js'\nimport { UrlParseError } from '../errors/UrlParseError.js'\nimport { translateSSHtoHTTP } from '../utils/translateSSHtoHTTP.js'\n\nimport { GitRemoteHTTP } from './GitRemoteHTTP.js'\n\n/**\n * A class for managing Git remotes and determining the appropriate remote helper for a given URL.\n */\nexport class GitRemoteManager {\n /**\n * Determines the appropriate remote helper for the given URL.\n *\n * @param {Object} args\n * @param {string} args.url - The URL of the remote repository.\n * @returns {Object} - The remote helper class for the specified transport.\n * @throws {UrlParseError} - If the URL cannot be parsed.\n * @throws {UnknownTransportError} - If the transport is not supported.\n */\n static getRemoteHelperFor({ url }) {\n // TODO: clean up the remoteHelper API and move into PluginCore\n const remoteHelpers = new Map()\n remoteHelpers.set('http', GitRemoteHTTP)\n remoteHelpers.set('https', GitRemoteHTTP)\n\n const parts = parseRemoteUrl({ url })\n if (!parts) {\n throw new UrlParseError(url)\n }\n if (remoteHelpers.has(parts.transport)) {\n return remoteHelpers.get(parts.transport)\n }\n throw new UnknownTransportError(\n url,\n parts.transport,\n parts.transport === 'ssh' ? translateSSHtoHTTP(url) : undefined\n )\n }\n}\n\n/**\n * Parses a remote URL and extracts its transport and address.\n *\n * @param {Object} args\n * @param {string} args.url - The URL of the remote repository.\n * @returns {Object|undefined} - An object containing the transport and address, or undefined if parsing fails.\n */\nfunction parseRemoteUrl({ url }) {\n // the stupid \"shorter scp-like syntax\"\n if (url.startsWith('git@')) {\n return {\n transport: 'ssh',\n address: url,\n }\n }\n const matches = url.match(/(\\w+)(:\\/\\/|::)(.*)/)\n if (matches === null) return\n /*\n * When git encounters a URL of the form <transport>://<address>, where <transport> is\n * a protocol that it cannot handle natively, it automatically invokes git remote-<transport>\n * with the full URL as the second argument.\n *\n * @see https://git-scm.com/docs/git-remote-helpers\n */\n if (matches[2] === '://') {\n return {\n transport: matches[1],\n address: matches[0],\n }\n }\n /*\n * A URL of the form <transport>::<address> explicitly instructs git to invoke\n * git remote-<transport> with <address> as the second argument.\n *\n * @see https://git-scm.com/docs/git-remote-helpers\n */\n if (matches[2] === '::') {\n return {\n transport: matches[1],\n address: matches[3],\n }\n }\n}\n","export function translateSSHtoHTTP(url) {\n // handle \"shorter scp-like syntax\"\n url = url.replace(/^git@([^:]+):/, 'https://$1/')\n // handle proper SSH URLs\n url = url.replace(/^ssh:\\/\\//, 'https://')\n return url\n}\n","import '../typedefs.js'\nimport AsyncLock from 'async-lock'\n\nimport { join } from '../utils/join.js'\n\nlet lock = null\n\nexport class GitShallowManager {\n /**\n * Reads the `shallow` file in the Git repository and returns a set of object IDs (OIDs).\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @returns {Promise<Set<string>>} - A set of shallow object IDs.\n */\n static async read({ fs, gitdir }) {\n if (lock === null) lock = new AsyncLock()\n const filepath = join(gitdir, 'shallow')\n const oids = new Set()\n await lock.acquire(filepath, async function () {\n const text = await fs.read(filepath, { encoding: 'utf8' })\n if (text === null) return oids // no file\n if (text.trim() === '') return oids // empty file\n text\n .trim()\n .split('\\n')\n .map(oid => oids.add(oid))\n })\n return oids\n }\n\n /**\n * Writes a set of object IDs (OIDs) to the `shallow` file in the Git repository.\n * If the set is empty, the `shallow` file is removed.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} [args.gitdir] - [required] The [git directory](dir-vs-gitdir.md) path\n * @param {Set<string>} args.oids - A set of shallow object IDs to write.\n * @returns {Promise<void>}\n */\n static async write({ fs, gitdir, oids }) {\n if (lock === null) lock = new AsyncLock()\n const filepath = join(gitdir, 'shallow')\n if (oids.size > 0) {\n const text = [...oids].join('\\n') + '\\n'\n await lock.acquire(filepath, async function () {\n await fs.write(filepath, text, {\n encoding: 'utf8',\n })\n })\n } else {\n // No shallows\n await lock.acquire(filepath, async function () {\n await fs.rm(filepath)\n })\n }\n }\n}\n","import { BaseError } from './BaseError.js'\n\nexport class ObjectTypeError extends BaseError {\n /**\n * @param {string} oid\n * @param {'blob'|'commit'|'tag'|'tree'} actual\n * @param {'blob'|'commit'|'tag'|'tree'} expected\n * @param {string} [filepath]\n */\n constructor(oid, actual, expected, filepath) {\n super(\n `Object ${oid} ${\n filepath ? `at ${filepath}` : ''\n }was anticipated to be a ${expected} but it is a ${actual}.`\n )\n this.code = this.name = ObjectTypeError.code\n this.data = { oid, actual, expected, filepath }\n }\n}\n/** @type {'ObjectTypeError'} */\nObjectTypeError.code = 'ObjectTypeError'\n","export function formatAuthor({ name, email, timestamp, timezoneOffset }) {\n timezoneOffset = formatTimezoneOffset(timezoneOffset)\n return `${name} <${email}> ${timestamp} ${timezoneOffset}`\n}\n\n// The amount of effort that went into crafting these cases to handle\n// -0 (just so we don't lose that information when parsing and reconstructing)\n// but can also default to +0 was extraordinary.\n\nfunction formatTimezoneOffset(minutes) {\n const sign = simpleSign(negateExceptForZero(minutes))\n minutes = Math.abs(minutes)\n const hours = Math.floor(minutes / 60)\n minutes -= hours * 60\n let strHours = String(hours)\n let strMinutes = String(minutes)\n if (strHours.length < 2) strHours = '0' + strHours\n if (strMinutes.length < 2) strMinutes = '0' + strMinutes\n return (sign === -1 ? '-' : '+') + strHours + strMinutes\n}\n\nfunction simpleSign(n) {\n return Math.sign(n) || (Object.is(n, -0) ? -1 : 1)\n}\n\nfunction negateExceptForZero(n) {\n return n === 0 ? n : -n\n}\n","export function normalizeNewlines(str) {\n // remove all <CR>\n str = str.replace(/\\r/g, '')\n // no extra newlines up front\n str = str.replace(/^\\n+/, '')\n // and a single newline at the end\n str = str.replace(/\\n+$/, '') + '\\n'\n return str\n}\n","export function parseAuthor(author) {\n const [, name, email, timestamp, offset] = author.match(\n /^(.*) <(.*)> (.*) (.*)$/\n )\n return {\n name,\n email,\n timestamp: Number(timestamp),\n timezoneOffset: parseTimezoneOffset(offset),\n }\n}\n\n// The amount of effort that went into crafting these cases to handle\n// -0 (just so we don't lose that information when parsing and reconstructing)\n// but can also default to +0 was extraordinary.\n\nfunction parseTimezoneOffset(offset) {\n let [, sign, hours, minutes] = offset.match(/(\\+|-)(\\d\\d)(\\d\\d)/)\n minutes = (sign === '+' ? 1 : -1) * (Number(hours) * 60 + Number(minutes))\n return negateExceptForZero(minutes)\n}\n\nfunction negateExceptForZero(n) {\n return n === 0 ? n : -n\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { formatAuthor } from '../utils/formatAuthor.js'\nimport { normalizeNewlines } from '../utils/normalizeNewlines.js'\nimport { parseAuthor } from '../utils/parseAuthor.js'\n\nexport class GitAnnotatedTag {\n constructor(tag) {\n if (typeof tag === 'string') {\n this._tag = tag\n } else if (Buffer.isBuffer(tag)) {\n this._tag = tag.toString('utf8')\n } else if (typeof tag === 'object') {\n this._tag = GitAnnotatedTag.render(tag)\n } else {\n throw new InternalError(\n 'invalid type passed to GitAnnotatedTag constructor'\n )\n }\n }\n\n static from(tag) {\n return new GitAnnotatedTag(tag)\n }\n\n static render(obj) {\n return `object ${obj.object}\ntype ${obj.type}\ntag ${obj.tag}\ntagger ${formatAuthor(obj.tagger)}\n\n${obj.message}\n${obj.gpgsig ? obj.gpgsig : ''}`\n }\n\n justHeaders() {\n return this._tag.slice(0, this._tag.indexOf('\\n\\n'))\n }\n\n message() {\n const tag = this.withoutSignature()\n return tag.slice(tag.indexOf('\\n\\n') + 2)\n }\n\n parse() {\n return Object.assign(this.headers(), {\n message: this.message(),\n gpgsig: this.gpgsig(),\n })\n }\n\n render() {\n return this._tag\n }\n\n headers() {\n const headers = this.justHeaders().split('\\n')\n const hs = []\n for (const h of headers) {\n if (h[0] === ' ') {\n // combine with previous header (without space indent)\n hs[hs.length - 1] += '\\n' + h.slice(1)\n } else {\n hs.push(h)\n }\n }\n const obj = {}\n for (const h of hs) {\n const key = h.slice(0, h.indexOf(' '))\n const value = h.slice(h.indexOf(' ') + 1)\n if (Array.isArray(obj[key])) {\n obj[key].push(value)\n } else {\n obj[key] = value\n }\n }\n if (obj.tagger) {\n obj.tagger = parseAuthor(obj.tagger)\n }\n if (obj.committer) {\n obj.committer = parseAuthor(obj.committer)\n }\n return obj\n }\n\n withoutSignature() {\n const tag = normalizeNewlines(this._tag)\n if (tag.indexOf('\\n-----BEGIN PGP SIGNATURE-----') === -1) return tag\n return tag.slice(0, tag.lastIndexOf('\\n-----BEGIN PGP SIGNATURE-----'))\n }\n\n gpgsig() {\n if (this._tag.indexOf('\\n-----BEGIN PGP SIGNATURE-----') === -1) return\n const signature = this._tag.slice(\n this._tag.indexOf('-----BEGIN PGP SIGNATURE-----'),\n this._tag.indexOf('-----END PGP SIGNATURE-----') +\n '-----END PGP SIGNATURE-----'.length\n )\n return normalizeNewlines(signature)\n }\n\n payload() {\n return this.withoutSignature() + '\\n'\n }\n\n toObject() {\n return Buffer.from(this._tag, 'utf8')\n }\n\n static async sign(tag, sign, secretKey) {\n const payload = tag.payload()\n let { signature } = await sign({ payload, secretKey })\n // renormalize the line endings to the one true line-ending\n signature = normalizeNewlines(signature)\n const signedTag = payload + signature\n // return a new tag object\n return GitAnnotatedTag.from(signedTag)\n }\n}\n","export function indent(str) {\n return (\n str\n .trim()\n .split('\\n')\n .map(x => ' ' + x)\n .join('\\n') + '\\n'\n )\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { formatAuthor } from '../utils/formatAuthor.js'\nimport { indent } from '../utils/indent.js'\nimport { normalizeNewlines } from '../utils/normalizeNewlines.js'\nimport { outdent } from '../utils/outdent.js'\nimport { parseAuthor } from '../utils/parseAuthor.js'\n\nexport class GitCommit {\n constructor(commit) {\n if (typeof commit === 'string') {\n this._commit = commit\n } else if (Buffer.isBuffer(commit)) {\n this._commit = commit.toString('utf8')\n } else if (typeof commit === 'object') {\n this._commit = GitCommit.render(commit)\n } else {\n throw new InternalError('invalid type passed to GitCommit constructor')\n }\n }\n\n static fromPayloadSignature({ payload, signature }) {\n const headers = GitCommit.justHeaders(payload)\n const message = GitCommit.justMessage(payload)\n const commit = normalizeNewlines(\n headers + '\\ngpgsig' + indent(signature) + '\\n' + message\n )\n return new GitCommit(commit)\n }\n\n static from(commit) {\n return new GitCommit(commit)\n }\n\n toObject() {\n return Buffer.from(this._commit, 'utf8')\n }\n\n // Todo: allow setting the headers and message\n headers() {\n return this.parseHeaders()\n }\n\n // Todo: allow setting the headers and message\n message() {\n return GitCommit.justMessage(this._commit)\n }\n\n parse() {\n return Object.assign({ message: this.message() }, this.headers())\n }\n\n static justMessage(commit) {\n return normalizeNewlines(commit.slice(commit.indexOf('\\n\\n') + 2))\n }\n\n static justHeaders(commit) {\n return commit.slice(0, commit.indexOf('\\n\\n'))\n }\n\n parseHeaders() {\n const headers = GitCommit.justHeaders(this._commit).split('\\n')\n const hs = []\n for (const h of headers) {\n if (h[0] === ' ') {\n // combine with previous header (without space indent)\n hs[hs.length - 1] += '\\n' + h.slice(1)\n } else {\n hs.push(h)\n }\n }\n const obj = {\n parent: [],\n }\n for (const h of hs) {\n const key = h.slice(0, h.indexOf(' '))\n const value = h.slice(h.indexOf(' ') + 1)\n if (Array.isArray(obj[key])) {\n obj[key].push(value)\n } else {\n obj[key] = value\n }\n }\n if (obj.author) {\n obj.author = parseAuthor(obj.author)\n }\n if (obj.committer) {\n obj.committer = parseAuthor(obj.committer)\n }\n return obj\n }\n\n static renderHeaders(obj) {\n let headers = ''\n if (obj.tree) {\n headers += `tree ${obj.tree}\\n`\n } else {\n headers += `tree 4b825dc642cb6eb9a060e54bf8d69288fbee4904\\n` // the null tree\n }\n if (obj.parent) {\n if (obj.parent.length === undefined) {\n throw new InternalError(`commit 'parent' property should be an array`)\n }\n for (const p of obj.parent) {\n headers += `parent ${p}\\n`\n }\n }\n const author = obj.author\n headers += `author ${formatAuthor(author)}\\n`\n const committer = obj.committer || obj.author\n headers += `committer ${formatAuthor(committer)}\\n`\n if (obj.gpgsig) {\n headers += 'gpgsig' + indent(obj.gpgsig)\n }\n return headers\n }\n\n static render(obj) {\n return GitCommit.renderHeaders(obj) + '\\n' + normalizeNewlines(obj.message)\n }\n\n render() {\n return this._commit\n }\n\n withoutSignature() {\n const commit = normalizeNewlines(this._commit)\n if (commit.indexOf('\\ngpgsig') === -1) return commit\n const headers = commit.slice(0, commit.indexOf('\\ngpgsig'))\n const message = commit.slice(\n commit.indexOf('-----END PGP SIGNATURE-----\\n') +\n '-----END PGP SIGNATURE-----\\n'.length\n )\n return normalizeNewlines(headers + '\\n' + message)\n }\n\n isolateSignature() {\n const signature = this._commit.slice(\n this._commit.indexOf('-----BEGIN PGP SIGNATURE-----'),\n this._commit.indexOf('-----END PGP SIGNATURE-----') +\n '-----END PGP SIGNATURE-----'.length\n )\n return outdent(signature)\n }\n\n static async sign(commit, sign, secretKey) {\n const payload = commit.withoutSignature()\n const message = GitCommit.justMessage(commit._commit)\n let { signature } = await sign({ payload, secretKey })\n // renormalize the line endings to the one true line-ending\n signature = normalizeNewlines(signature)\n const headers = GitCommit.justHeaders(commit._commit)\n const signedCommit =\n headers + '\\n' + 'gpgsig' + indent(signature) + '\\n' + message\n // return a new commit object\n return GitCommit.from(signedCommit)\n }\n}\n","export function outdent(str) {\n return str\n .split('\\n')\n .map(x => x.replace(/^ /, ''))\n .join('\\n')\n}\n","import { InternalError } from '../errors/InternalError.js'\n\n/**\n * Represents a Git object and provides methods to wrap and unwrap Git objects\n * according to the Git object format.\n */\nexport class GitObject {\n /**\n * Wraps a raw object with a Git header.\n *\n * @param {Object} params - The parameters for wrapping.\n * @param {string} params.type - The type of the Git object (e.g., 'blob', 'tree', 'commit').\n * @param {Uint8Array} params.object - The raw object data to wrap.\n * @returns {Uint8Array} The wrapped Git object as a single buffer.\n */\n static wrap({ type, object }) {\n const header = `${type} ${object.length}\\x00`\n const headerLen = header.length\n const totalLength = headerLen + object.length\n\n // Allocate a single buffer for the header and object, rather than create multiple buffers\n const wrappedObject = new Uint8Array(totalLength)\n for (let i = 0; i < headerLen; i++) {\n wrappedObject[i] = header.charCodeAt(i)\n }\n wrappedObject.set(object, headerLen)\n\n return wrappedObject\n }\n\n /**\n * Unwraps a Git object buffer into its type and raw object data.\n *\n * @param {Buffer|Uint8Array} buffer - The buffer containing the wrapped Git object.\n * @returns {{ type: string, object: Buffer }} An object containing the type and the raw object data.\n * @throws {InternalError} If the length specified in the header does not match the actual object length.\n */\n static unwrap(buffer) {\n const s = buffer.indexOf(32) // first space\n const i = buffer.indexOf(0) // first null value\n const type = buffer.slice(0, s).toString('utf8') // get type of object\n const length = buffer.slice(s + 1, i).toString('utf8') // get type of object\n const actualLength = buffer.length - (i + 1)\n // verify length\n if (parseInt(length) !== actualLength) {\n throw new InternalError(\n `Length mismatch: expected ${length} bytes but got ${actualLength} instead.`\n )\n }\n return {\n type,\n object: Buffer.from(buffer.slice(i + 1)),\n }\n }\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { BufferCursor } from '../utils/BufferCursor.js'\n\n/**\n * @param {Buffer} delta\n * @param {Buffer} source\n * @returns {Buffer}\n */\nexport function applyDelta(delta, source) {\n const reader = new BufferCursor(delta)\n const sourceSize = readVarIntLE(reader)\n\n if (sourceSize !== source.byteLength) {\n throw new InternalError(\n `applyDelta expected source buffer to be ${sourceSize} bytes but the provided buffer was ${source.length} bytes`\n )\n }\n const targetSize = readVarIntLE(reader)\n let target\n\n const firstOp = readOp(reader, source)\n // Speed optimization - return raw buffer if it's just single simple copy\n if (firstOp.byteLength === targetSize) {\n target = firstOp\n } else {\n // Otherwise, allocate a fresh buffer and slices\n target = Buffer.alloc(targetSize)\n const writer = new BufferCursor(target)\n writer.copy(firstOp)\n\n while (!reader.eof()) {\n writer.copy(readOp(reader, source))\n }\n\n const tell = writer.tell()\n if (targetSize !== tell) {\n throw new InternalError(\n `applyDelta expected target buffer to be ${targetSize} bytes but the resulting buffer was ${tell} bytes`\n )\n }\n }\n return target\n}\n\nfunction readVarIntLE(reader) {\n let result = 0\n let shift = 0\n let byte = null\n do {\n byte = reader.readUInt8()\n result |= (byte & 0b01111111) << shift\n shift += 7\n } while (byte & 0b10000000)\n return result\n}\n\nfunction readCompactLE(reader, flags, size) {\n let result = 0\n let shift = 0\n while (size--) {\n if (flags & 0b00000001) {\n result |= reader.readUInt8() << shift\n }\n flags >>= 1\n shift += 8\n }\n return result\n}\n\nfunction readOp(reader, source) {\n /** @type {number} */\n const byte = reader.readUInt8()\n const COPY = 0b10000000\n const OFFS = 0b00001111\n const SIZE = 0b01110000\n if (byte & COPY) {\n // copy consists of 4 byte offset, 3 byte size (in LE order)\n const offset = readCompactLE(reader, byte & OFFS, 4)\n let size = readCompactLE(reader, (byte & SIZE) >> 4, 3)\n // Yup. They really did this optimization.\n if (size === 0) size = 0x10000\n return source.slice(offset, offset + size)\n } else {\n // insert\n return reader.slice(byte)\n }\n}\n","// My version of git-list-pack - roughly 15x faster than the original\n// It's used slightly differently - instead of returning a through stream it wraps a stream.\n// (I tried to make it API identical, but that ended up being 2x slower than this version.)\nimport pako from 'pako'\n\nimport { InternalError } from '../errors/InternalError.js'\nimport { StreamReader } from '../utils/StreamReader.js'\n\nexport async function listpack(stream, onData) {\n const reader = new StreamReader(stream)\n let PACK = await reader.read(4)\n PACK = PACK.toString('utf8')\n if (PACK !== 'PACK') {\n throw new InternalError(`Invalid PACK header '${PACK}'`)\n }\n\n let version = await reader.read(4)\n version = version.readUInt32BE(0)\n if (version !== 2) {\n throw new InternalError(`Invalid packfile version: ${version}`)\n }\n\n let numObjects = await reader.read(4)\n numObjects = numObjects.readUInt32BE(0)\n // If (for some godforsaken reason) this is an empty packfile, abort now.\n if (numObjects < 1) return\n\n while (!reader.eof() && numObjects--) {\n const offset = reader.tell()\n const { type, length, ofs, reference } = await parseHeader(reader)\n const inflator = new pako.Inflate()\n while (!inflator.result) {\n const chunk = await reader.chunk()\n if (!chunk) break\n inflator.push(chunk, false)\n if (inflator.err) {\n throw new InternalError(`Pako error: ${inflator.msg}`)\n }\n if (inflator.result) {\n if (inflator.result.length !== length) {\n throw new InternalError(\n `Inflated object size is different from that stated in packfile.`\n )\n }\n\n // Backtrack parser to where deflated data ends\n await reader.undo()\n await reader.read(chunk.length - inflator.strm.avail_in)\n const end = reader.tell()\n await onData({\n data: inflator.result,\n type,\n num: numObjects,\n offset,\n end,\n reference,\n ofs,\n })\n }\n }\n }\n}\n\nasync function parseHeader(reader) {\n // Object type is encoded in bits 654\n let byte = await reader.byte()\n const type = (byte >> 4) & 0b111\n // The length encoding get complicated.\n // Last four bits of length is encoded in bits 3210\n let length = byte & 0b1111\n // Whether the next byte is part of the variable-length encoded number\n // is encoded in bit 7\n if (byte & 0b10000000) {\n let shift = 4\n do {\n byte = await reader.byte()\n length |= (byte & 0b01111111) << shift\n shift += 7\n } while (byte & 0b10000000)\n }\n // Handle deltified objects\n let ofs\n let reference\n if (type === 6) {\n let shift = 0\n ofs = 0\n const bytes = []\n do {\n byte = await reader.byte()\n ofs |= (byte & 0b01111111) << shift\n shift += 7\n bytes.push(byte)\n } while (byte & 0b10000000)\n reference = Buffer.from(bytes)\n }\n if (type === 7) {\n const buf = await reader.read(20)\n reference = buf\n }\n return { type, length, ofs, reference }\n}\n","/* eslint-env node, browser */\n/* global DecompressionStream */\nimport pako from 'pako'\n\nlet supportsDecompressionStream = false\n\nexport async function inflate(buffer) {\n if (supportsDecompressionStream === null) {\n supportsDecompressionStream = testDecompressionStream()\n }\n return supportsDecompressionStream\n ? browserInflate(buffer)\n : pako.inflate(buffer)\n}\n\nasync function browserInflate(buffer) {\n const ds = new DecompressionStream('deflate')\n const d = new Blob([buffer]).stream().pipeThrough(ds)\n return new Uint8Array(await new Response(d).arrayBuffer())\n}\n\nfunction testDecompressionStream() {\n try {\n const ds = new DecompressionStream('deflate')\n if (ds) return true\n } catch (_) {\n // no bother\n }\n return false\n}\n","import crc32 from 'crc-32'\n\nimport { InternalError } from '../errors/InternalError.js'\nimport { GitObject } from '../models/GitObject.js'\nimport { BufferCursor } from '../utils/BufferCursor.js'\nimport { applyDelta } from '../utils/applyDelta.js'\nimport { listpack } from '../utils/git-list-pack.js'\nimport { inflate } from '../utils/inflate.js'\nimport { shasum } from '../utils/shasum.js'\n\nfunction decodeVarInt(reader) {\n const bytes = []\n let byte = 0\n let multibyte = 0\n do {\n byte = reader.readUInt8()\n // We keep bits 6543210\n const lastSeven = byte & 0b01111111\n bytes.push(lastSeven)\n // Whether the next byte is part of the variable-length encoded number\n // is encoded in bit 7\n multibyte = byte & 0b10000000\n } while (multibyte)\n // Now that all the bytes are in big-endian order,\n // alternate shifting the bits left by 7 and OR-ing the next byte.\n // And... do a weird increment-by-one thing that I don't quite understand.\n return bytes.reduce((a, b) => ((a + 1) << 7) | b, -1)\n}\n\n// I'm pretty much copying this one from the git C source code,\n// because it makes no sense.\nfunction otherVarIntDecode(reader, startWith) {\n let result = startWith\n let shift = 4\n let byte = null\n do {\n byte = reader.readUInt8()\n result |= (byte & 0b01111111) << shift\n shift += 7\n } while (byte & 0b10000000)\n return result\n}\n\nexport class GitPackIndex {\n constructor(stuff) {\n Object.assign(this, stuff)\n this.offsetCache = {}\n }\n\n static async fromIdx({ idx, getExternalRefDelta }) {\n const reader = new BufferCursor(idx)\n const magic = reader.slice(4).toString('hex')\n // Check for IDX v2 magic number\n if (magic !== 'ff744f63') {\n return // undefined\n }\n const version = reader.readUInt32BE()\n if (version !== 2) {\n throw new InternalError(\n `Unable to read version ${version} packfile IDX. (Only version 2 supported)`\n )\n }\n if (idx.byteLength > 2048 * 1024 * 1024) {\n throw new InternalError(\n `To keep implementation simple, I haven't implemented the layer 5 feature needed to support packfiles > 2GB in size.`\n )\n }\n // Skip over fanout table\n reader.seek(reader.tell() + 4 * 255)\n // Get hashes\n const size = reader.readUInt32BE()\n const hashes = []\n for (let i = 0; i < size; i++) {\n const hash = reader.slice(20).toString('hex')\n hashes[i] = hash\n }\n reader.seek(reader.tell() + 4 * size)\n // Skip over CRCs\n // Get offsets\n const offsets = new Map()\n for (let i = 0; i < size; i++) {\n offsets.set(hashes[i], reader.readUInt32BE())\n }\n const packfileSha = reader.slice(20).toString('hex')\n return new GitPackIndex({\n hashes,\n crcs: {},\n offsets,\n packfileSha,\n getExternalRefDelta,\n })\n }\n\n static async fromPack({ pack, getExternalRefDelta, onProgress }) {\n const listpackTypes = {\n 1: 'commit',\n 2: 'tree',\n 3: 'blob',\n 4: 'tag',\n 6: 'ofs-delta',\n 7: 'ref-delta',\n }\n const offsetToObject = {}\n\n // Older packfiles do NOT use the shasum of the pack itself,\n // so it is recommended to just use whatever bytes are in the trailer.\n // Source: https://github.com/git/git/commit/1190a1acf800acdcfd7569f87ac1560e2d077414\n const packfileSha = pack.slice(-20).toString('hex')\n\n const hashes = []\n const crcs = {}\n const offsets = new Map()\n let totalObjectCount = null\n let lastPercent = null\n\n await listpack([pack], async ({ data, type, reference, offset, num }) => {\n if (totalObjectCount === null) totalObjectCount = num\n const percent = Math.floor(\n ((totalObjectCount - num) * 100) / totalObjectCount\n )\n if (percent !== lastPercent) {\n if (onProgress) {\n await onProgress({\n phase: 'Receiving objects',\n loaded: totalObjectCount - num,\n total: totalObjectCount,\n })\n }\n }\n lastPercent = percent\n // Change type from a number to a meaningful string\n type = listpackTypes[type]\n\n if (['commit', 'tree', 'blob', 'tag'].includes(type)) {\n offsetToObject[offset] = {\n type,\n offset,\n }\n } else if (type === 'ofs-delta') {\n offsetToObject[offset] = {\n type,\n offset,\n }\n } else if (type === 'ref-delta') {\n offsetToObject[offset] = {\n type,\n offset,\n }\n }\n })\n\n // We need to know the lengths of the slices to compute the CRCs.\n const offsetArray = Object.keys(offsetToObject).map(Number)\n for (const [i, start] of offsetArray.entries()) {\n const end =\n i + 1 === offsetArray.length ? pack.byteLength - 20 : offsetArray[i + 1]\n const o = offsetToObject[start]\n const crc = crc32.buf(pack.slice(start, end)) >>> 0\n o.end = end\n o.crc = crc\n }\n\n // We don't have the hashes yet. But we can generate them using the .readSlice function!\n const p = new GitPackIndex({\n pack: Promise.resolve(pack),\n packfileSha,\n crcs,\n hashes,\n offsets,\n getExternalRefDelta,\n })\n\n // Resolve deltas and compute the oids\n lastPercent = null\n let count = 0\n const objectsByDepth = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n for (let offset in offsetToObject) {\n offset = Number(offset)\n const percent = Math.floor((count * 100) / totalObjectCount)\n if (percent !== lastPercent) {\n if (onProgress) {\n await onProgress({\n phase: 'Resolving deltas',\n loaded: count,\n total: totalObjectCount,\n })\n }\n }\n count++\n lastPercent = percent\n\n const o = offsetToObject[offset]\n if (o.oid) continue\n try {\n p.readDepth = 0\n p.externalReadDepth = 0\n const { type, object } = await p.readSlice({ start: offset })\n objectsByDepth[p.readDepth] += 1\n const oid = await shasum(GitObject.wrap({ type, object }))\n o.oid = oid\n hashes.push(oid)\n offsets.set(oid, offset)\n crcs[oid] = o.crc\n } catch (err) {\n continue\n }\n }\n\n hashes.sort()\n return p\n }\n\n async toBuffer() {\n const buffers = []\n const write = (str, encoding) => {\n buffers.push(Buffer.from(str, encoding))\n }\n // Write out IDX v2 magic number\n write('ff744f63', 'hex')\n // Write out version number 2\n write('00000002', 'hex')\n // Write fanout table\n const fanoutBuffer = new BufferCursor(Buffer.alloc(256 * 4))\n for (let i = 0; i < 256; i++) {\n let count = 0\n for (const hash of this.hashes) {\n if (parseInt(hash.slice(0, 2), 16) <= i) count++\n }\n fanoutBuffer.writeUInt32BE(count)\n }\n buffers.push(fanoutBuffer.buffer)\n // Write out hashes\n for (const hash of this.hashes) {\n write(hash, 'hex')\n }\n // Write out crcs\n const crcsBuffer = new BufferCursor(Buffer.alloc(this.hashes.length * 4))\n for (const hash of this.hashes) {\n crcsBuffer.writeUInt32BE(this.crcs[hash])\n }\n buffers.push(crcsBuffer.buffer)\n // Write out offsets\n const offsetsBuffer = new BufferCursor(Buffer.alloc(this.hashes.length * 4))\n for (const hash of this.hashes) {\n offsetsBuffer.writeUInt32BE(this.offsets.get(hash))\n }\n buffers.push(offsetsBuffer.buffer)\n // Write out packfile checksum\n write(this.packfileSha, 'hex')\n // Write out shasum\n const totalBuffer = Buffer.concat(buffers)\n const sha = await shasum(totalBuffer)\n const shaBuffer = Buffer.alloc(20)\n shaBuffer.write(sha, 'hex')\n return Buffer.concat([totalBuffer, shaBuffer])\n }\n\n async load({ pack }) {\n this.pack = pack\n }\n\n async unload() {\n this.pack = null\n }\n\n async read({ oid }) {\n if (!this.offsets.get(oid)) {\n if (this.getExternalRefDelta) {\n this.externalReadDepth++\n return this.getExternalRefDelta(oid)\n } else {\n throw new InternalError(`Could not read object ${oid} from packfile`)\n }\n }\n const start = this.offsets.get(oid)\n return this.readSlice({ start })\n }\n\n async readSlice({ start }) {\n if (this.offsetCache[start]) {\n return Object.assign({}, this.offsetCache[start])\n }\n this.readDepth++\n const types = {\n 0b0010000: 'commit',\n 0b0100000: 'tree',\n 0b0110000: 'blob',\n 0b1000000: 'tag',\n 0b1100000: 'ofs_delta',\n 0b1110000: 'ref_delta',\n }\n const pack = await this.pack\n if (!pack) {\n throw new InternalError(\n 'Could not read packfile data. The packfile may be missing, corrupted, or too large to read into memory.'\n )\n }\n const raw = pack.slice(start)\n const reader = new BufferCursor(raw)\n const byte = reader.readUInt8()\n // Object type is encoded in bits 654\n const btype = byte & 0b1110000\n let type = types[btype]\n if (type === undefined) {\n throw new InternalError('Unrecognized type: 0b' + btype.toString(2))\n }\n // The length encoding get complicated.\n // Last four bits of length is encoded in bits 3210\n const lastFour = byte & 0b1111\n let length = lastFour\n // Whether the next byte is part of the variable-length encoded number\n // is encoded in bit 7\n const multibyte = byte & 0b10000000\n if (multibyte) {\n length = otherVarIntDecode(reader, lastFour)\n }\n let base = null\n let object = null\n // Handle deltified objects\n if (type === 'ofs_delta') {\n const offset = decodeVarInt(reader)\n const baseOffset = start - offset\n ;({ object: base, type } = await this.readSlice({ start: baseOffset }))\n }\n if (type === 'ref_delta') {\n const oid = reader.slice(20).toString('hex')\n ;({ object: base, type } = await this.read({ oid }))\n }\n // Handle undeltified objects\n const buffer = raw.slice(reader.tell())\n object = Buffer.from(await inflate(buffer))\n // Assert that the object length is as expected.\n if (object.byteLength !== length) {\n throw new InternalError(\n `Packfile told us object would have length ${length} but it had length ${object.byteLength}`\n )\n }\n if (base) {\n object = Buffer.from(applyDelta(object, base))\n }\n // Cache the result based on depth.\n if (this.readDepth > 3) {\n // hand tuned for speed / memory usage tradeoff\n this.offsetCache[start] = { type, object }\n }\n return { type, format: 'content', object }\n }\n}\n","import { GitPackIndex } from '../models/GitPackIndex.js'\n\nconst PackfileCache = Symbol('PackfileCache')\n\nasync function loadPackIndex({\n fs,\n filename,\n getExternalRefDelta,\n emitter,\n emitterPrefix,\n}) {\n const idx = await fs.read(filename)\n return GitPackIndex.fromIdx({ idx, getExternalRefDelta })\n}\n\nexport function readPackIndex({\n fs,\n cache,\n filename,\n getExternalRefDelta,\n emitter,\n emitterPrefix,\n}) {\n // Try to get the packfile index from the in-memory cache\n if (!cache[PackfileCache]) cache[PackfileCache] = new Map()\n let p = cache[PackfileCache].get(filename)\n if (!p) {\n p = loadPackIndex({\n fs,\n filename,\n getExternalRefDelta,\n emitter,\n emitterPrefix,\n })\n cache[PackfileCache].set(filename, p)\n }\n return p\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { NotFoundError } from '../errors/NotFoundError.js'\nimport { GitObject } from '../models/GitObject.js'\nimport { readObjectLoose } from '../storage/readObjectLoose.js'\nimport { readObjectPacked } from '../storage/readObjectPacked.js'\nimport { inflate } from '../utils/inflate.js'\nimport { shasum } from '../utils/shasum.js'\n\n/**\n * @param {object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {any} args.cache\n * @param {string} args.gitdir\n * @param {string} args.oid\n * @param {string} [args.format]\n */\nexport async function _readObject({\n fs,\n cache,\n gitdir,\n oid,\n format = 'content',\n}) {\n // Curry the current read method so that the packfile un-deltification\n // process can acquire external ref-deltas.\n const getExternalRefDelta = oid => _readObject({ fs, cache, gitdir, oid })\n\n let result\n // Empty tree - hard-coded so we can use it as a shorthand.\n // Note: I think the canonical git implementation must do this too because\n // `git cat-file -t 4b825dc642cb6eb9a060e54bf8d69288fbee4904` prints \"tree\" even in empty repos.\n if (oid === '4b825dc642cb6eb9a060e54bf8d69288fbee4904') {\n result = { format: 'wrapped', object: Buffer.from(`tree 0\\x00`) }\n }\n // Look for it in the loose object directory.\n if (!result) {\n result = await readObjectLoose({ fs, gitdir, oid })\n }\n // Check to see if it's in a packfile.\n if (!result) {\n result = await readObjectPacked({\n fs,\n cache,\n gitdir,\n oid,\n getExternalRefDelta,\n })\n\n if (!result) {\n throw new NotFoundError(oid)\n }\n\n // Directly return packed result, as specified: packed objects always return the 'content' format.\n return result\n }\n\n // Loose objects are always deflated, return early\n if (format === 'deflated') {\n return result\n }\n\n // All loose objects are deflated but the hard-coded empty tree is `wrapped` so we have to check if we need to inflate the object.\n if (result.format === 'deflated') {\n result.object = Buffer.from(await inflate(result.object))\n result.format = 'wrapped'\n }\n\n if (format === 'wrapped') {\n return result\n }\n\n const sha = await shasum(result.object)\n if (sha !== oid) {\n throw new InternalError(\n `SHA check failed! Expected ${oid}, computed ${sha}`\n )\n }\n const { object, type } = GitObject.unwrap(result.object)\n result.type = type\n result.object = object\n result.format = 'content'\n\n if (format === 'content') {\n return result\n }\n\n throw new InternalError(`invalid requested format \"${format}\"`)\n}\n","export async function readObjectLoose({ fs, gitdir, oid }) {\n const source = `objects/${oid.slice(0, 2)}/${oid.slice(2)}`\n const file = await fs.read(`${gitdir}/${source}`)\n if (!file) {\n return null\n }\n return { object: file, format: 'deflated', source }\n}\n","import { InternalError } from '../errors/InternalError.js'\nimport { readPackIndex } from '../storage/readPackIndex.js'\nimport { join } from '../utils/join.js'\nimport { shasum } from '../utils/shasum.js'\n\nexport async function readObjectPacked({\n fs,\n cache,\n gitdir,\n oid,\n format = 'content',\n getExternalRefDelta,\n}) {\n // Check to see if it's in a packfile.\n // Iterate through all the .idx files\n let list = await fs.readdir(join(gitdir, 'objects/pack'))\n list = list.filter(x => x.endsWith('.idx'))\n for (const filename of list) {\n const indexFile = `${gitdir}/objects/pack/${filename}`\n const p = await readPackIndex({\n fs,\n cache,\n filename: indexFile,\n getExternalRefDelta,\n })\n if (p.error) throw new InternalError(p.error)\n // If the packfile DOES have the oid we're looking for...\n if (p.offsets.has(oid)) {\n // Derive the .pack path from the .idx path\n const packFile = indexFile.replace(/idx$/, 'pack')\n if (!p.pack) {\n p.pack = fs.read(packFile)\n }\n const pack = await p.pack\n if (!pack) {\n p.pack = null\n throw new InternalError(\n `Could not read packfile at ${packFile}. The file may be missing, corrupted, or too large to read into memory.`\n )\n }\n\n // === Packfile Integrity Verification ===\n // Performance optimization: use _checksumVerified flag to verify only once per packfile\n if (!p._checksumVerified) {\n const expectedShaFromIndex = p.packfileSha\n\n // 1. Fast Check: Verify packfile trailer matches index record\n // Use subarray instead of slice to avoid memory copy (zero-copy for large packfiles)\n const packTrailer = pack.subarray(-20)\n const packTrailerSha = Array.from(packTrailer)\n .map(b => b.toString(16).padStart(2, '0'))\n .join('')\n if (packTrailerSha !== expectedShaFromIndex) {\n throw new InternalError(\n `Packfile trailer mismatch: expected ${expectedShaFromIndex}, got ${packTrailerSha}. The packfile may be corrupted.`\n )\n }\n\n // 2. Deep Integrity Check: Calculate actual SHA-1 of packfile payload\n // This ensures true data integrity by verifying the entire packfile content\n // Use subarray for zero-copy reading of large files\n const payload = pack.subarray(0, -20)\n const actualPayloadSha = await shasum(payload)\n if (actualPayloadSha !== expectedShaFromIndex) {\n throw new InternalError(\n `Packfile payload corrupted: calculated ${actualPayloadSha} but expected ${expectedShaFromIndex}. The packfile may have been tampered with.`\n )\n }\n\n // Mark as verified to prevent performance regression on subsequent reads\n p._checksumVerified = true\n }\n\n const result = await p.read({ oid, getExternalRefDelta })\n result.format = 'content'\n result.source = `objects/pack/${filename.replace(/idx$/, 'pack')}`\n return result\n }\n }\n // Failed to find it\n return null\n}\n","import { ObjectTypeError } from '../errors/ObjectTypeError.js'\nimport { GitAnnotatedTag } from '../models/GitAnnotatedTag.js'\nimport { GitCommit } from '../models/GitCommit.js'\nimport { _readObject as readObject } from '../storage/readObject.js'\n\nexport async function resolveCommit({ fs, cache, gitdir, oid }) {\n const { type, object } = await readObject({ fs, cache, gitdir, oid })\n // Resolve annotated tag objects to whatever\n if (type === 'tag') {\n oid = GitAnnotatedTag.from(object).parse().object\n return resolveCommit({ fs, cache, gitdir, oid })\n }\n if (type !== 'commit') {\n throw new ObjectTypeError(oid, type, 'commit')\n }\n return { commit: GitCommit.from(object), oid }\n}\n","/* eslint-env node, browser */\n/* global CompressionStream */\nimport pako from 'pako'\n\nlet supportsCompressionStream = null\n\nexport async function deflate(buffer) {\n if (supportsCompressionStream === null) {\n supportsCompressionStream = testCompressionStream()\n }\n return supportsCompressionStream\n ? browserDeflate(buffer)\n : pako.deflate(buffer)\n}\n\nasync function browserDeflate(buffer) {\n const cs = new CompressionStream('deflate')\n const c = new Blob([buffer]).stream().pipeThrough(cs)\n return new Uint8Array(await new Response(c).arrayBuffer())\n}\n\nfunction testCompressionStream() {\n try {\n const cs = new CompressionStream('deflate')\n cs.writable.close()\n // Test if `Blob.stream` is present. React Native does not have the `stream` method\n const stream = new Blob([]).stream()\n stream.cancel()\n return true\n } catch (_) {\n return false\n }\n}\n","import AsyncLock from 'async-lock'\n\nimport { STAGE } from '../commands/STAGE.js'\nimport { TREE } from '../commands/TREE.js'\nimport { WORKDIR } from '../commands/WORKDIR.js'\nimport { _walk } from '../commands/walk.js'\nimport { _writeTree } from '../commands/writeTree.js'\nimport { InternalError } from '../errors/InternalError.js'\nimport { NotFoundError } from '../errors/NotFoundError.js'\nimport { GitIgnoreManager } from '../managers/GitIgnoreManager.js'\nimport { GitIndexManager } from '../managers/GitIndexManager.js'\nimport { _readObject } from '../storage/readObject.js'\nimport { readObjectLoose } from '../storage/readObjectLoose.js'\nimport { _writeObject } from '../storage/writeObject.js'\n\nimport { join } from './join.js'\nimport { posixifyPathBuffer } from './posixifyPathBuffer.js'\n\nconst _TreeMap = {\n stage: STAGE,\n workdir: WORKDIR,\n}\n\nlet lock\nexport async function acquireLock(ref, callback) {\n if (lock === undefined) lock = new AsyncLock()\n return lock.acquire(ref, callback)\n}\n\n// make sure filepath, blob type and blob object (from loose objects) plus oid are in sync and valid\nasync function checkAndWriteBlob(fs, gitdir, dir, filepath, oid = null) {\n const currentFilepath = join(dir, filepath)\n const stats = await fs.lstat(currentFilepath)\n if (!stats) throw new NotFoundError(currentFilepath)\n if (stats.isDirectory())\n throw new InternalError(\n `${currentFilepath}: file expected, but found directory`\n )\n\n // Look for it in the loose object directory.\n const objContent = oid\n ? await readObjectLoose({ fs, gitdir, oid })\n : undefined\n let retOid = objContent ? oid : undefined\n if (!objContent) {\n await acquireLock({ fs, gitdir, currentFilepath }, async () => {\n const object = stats.isSymbolicLink()\n ? await fs.readlink(currentFilepath).then(posixifyPathBuffer)\n : await fs.read(currentFilepath)\n\n if (object === null) throw new NotFoundError(currentFilepath)\n\n retOid = await _writeObject({ fs, gitdir, type: 'blob', object })\n })\n }\n\n return retOid\n}\n\nasync function processTreeEntries({ fs, dir, gitdir, entries }) {\n // make sure each tree entry has valid oid\n async function processTreeEntry(entry) {\n if (entry.type === 'tree') {\n if (!entry.oid) {\n // Process children entries if the current entry is a tree\n const children = await Promise.all(entry.children.map(processTreeEntry))\n // Write the tree with the processed children\n entry.oid = await _writeTree({\n fs,\n gitdir,\n tree: children,\n })\n entry.mode = 0o40000 // directory\n }\n } else if (entry.type === 'blob') {\n entry.oid = await checkAndWriteBlob(\n fs,\n gitdir,\n dir,\n entry.path,\n entry.oid\n )\n entry.mode = 0o100644 // file\n }\n\n // remove path from entry.path\n entry.path = entry.path.split('/').pop()\n return entry\n }\n\n return Promise.all(entries.map(processTreeEntry))\n}\n\nexport async function writeTreeChanges({\n fs,\n dir,\n gitdir,\n treePair, // [TREE({ ref: 'HEAD' }), 'STAGE'] would be the equivalent of `git write-tree`\n}) {\n const isStage = treePair[1] === 'stage'\n const trees = treePair.map(t => (typeof t === 'string' ? _TreeMap[t]() : t))\n\n const changedEntries = []\n // transform WalkerEntry objects into the desired format\n const map = async (filepath, [head, stage]) => {\n if (\n filepath === '.' ||\n (await GitIgnoreManager.isIgnored({ fs, dir, gitdir, filepath }))\n ) {\n return\n }\n\n if (stage) {\n if (\n !head ||\n ((await head.oid()) !== (await stage.oid()) &&\n (await stage.oid()) !== undefined)\n ) {\n changedEntries.push([head, stage])\n }\n return {\n mode: await stage.mode(),\n path: filepath,\n oid: await stage.oid(),\n type: await stage.type(),\n }\n }\n }\n\n // combine mapped entries with their parent results\n const reduce = async (parent, children) => {\n children = children.filter(Boolean) // Remove undefined entries\n if (!parent) {\n return children.length > 0 ? children : undefined\n } else {\n parent.children = children\n return parent\n }\n }\n\n // if parent is skipped, skip the children\n const iterate = async (walk, children) => {\n const filtered = []\n for (const child of children) {\n const [head, stage] = child\n if (isStage) {\n if (stage) {\n // for deleted file in work dir, it also needs to be added on stage\n if (await fs.exists(`${dir}/${stage.toString()}`)) {\n filtered.push(child)\n } else {\n changedEntries.push([null, stage]) // record the change (deletion) while stop the iteration\n }\n }\n } else if (head) {\n // for deleted file in workdir, \"stage\" (workdir in our case) will be undefined\n if (!stage) {\n changedEntries.push([head, null]) // record the change (deletion) while stop the iteration\n } else {\n filtered.push(child) // workdir, tracked only\n }\n }\n }\n return filtered.length ? Promise.all(filtered.map(walk)) : []\n }\n\n const entries = await _walk({\n fs,\n cache: {},\n dir,\n gitdir,\n trees,\n map,\n reduce,\n iterate,\n })\n\n if (changedEntries.length === 0 || entries.length === 0) {\n return null // no changes found to stash\n }\n\n const processedEntries = await processTreeEntries({\n fs,\n dir,\n gitdir,\n entries,\n })\n\n const treeEntries = processedEntries.filter(Boolean).map(entry => ({\n mode: entry.mode,\n path: entry.path,\n oid: entry.oid,\n type: entry.type,\n }))\n\n return _writeTree({ fs, gitdir, tree: treeEntries })\n}\n\nexport async function applyTreeChanges({\n fs,\n dir,\n gitdir,\n stashCommit,\n parentCommit,\n wasStaged,\n}) {\n const dirRemoved = []\n const stageUpdated = []\n\n // analyze the changes\n const ops = await _walk({\n fs,\n cache: {},\n dir,\n gitdir,\n trees: [TREE({ ref: parentCommit }), TREE({ ref: stashCommit })],\n map: async (filepath, [parent, stash]) => {\n if (\n filepath === '.' ||\n (await GitIgnoreManager.isIgnored({ fs, dir, gitdir, filepath }))\n ) {\n return\n }\n const type = stash ? await stash.type() : await parent.type()\n if (type !== 'tree' && type !== 'blob') {\n return\n }\n\n // deleted tree or blob\n if (!stash && parent) {\n const method = type === 'tree' ? 'rmdir' : 'rm'\n if (type === 'tree') dirRemoved.push(filepath)\n if (type === 'blob' && wasStaged)\n stageUpdated.push({ filepath, oid: await parent.oid() }) // stats is undefined, will stage the deletion with index.insert\n return { method, filepath }\n }\n\n const oid = await stash.oid()\n if (!parent || (await parent.oid()) !== oid) {\n // only apply changes if changed from the parent commit or doesn't exist in the parent commit\n if (type === 'tree') {\n return { method: 'mkdir', filepath }\n } else {\n if (wasStaged)\n stageUpdated.push({\n filepath,\n oid,\n stats: await fs.lstat(join(dir, filepath)),\n })\n return {\n method: 'write',\n filepath,\n oid,\n }\n }\n }\n },\n })\n\n // apply the changes to work dir\n await acquireLock({ fs, gitdir, dirRemoved, ops }, async () => {\n for (const op of ops) {\n const currentFilepath = join(dir, op.filepath)\n switch (op.method) {\n case 'rmdir':\n await fs.rmdir(currentFilepath)\n break\n case 'mkdir':\n await fs.mkdir(currentFilepath)\n break\n case 'rm':\n await fs.rm(currentFilepath)\n break\n case 'write':\n // only writes if file is not in the removedDirs\n if (\n !dirRemoved.some(removedDir =>\n currentFilepath.startsWith(removedDir)\n )\n ) {\n const { object } = await _readObject({\n fs,\n cache: {},\n gitdir,\n oid: op.oid,\n })\n // just like checkout, since mode only applicable to create, not update, delete first\n if (await fs.exists(currentFilepath)) {\n await fs.rm(currentFilepath)\n }\n await fs.write(currentFilepath, object) // only handles regular files for now\n }\n break\n }\n }\n })\n\n // update the stage\n await GitIndexManager.acquire({ fs, gitdir, cache: {} }, async index => {\n stageUpdated.forEach(({ filepath, stats, oid }) => {\n index.insert({ filepath, stats, oid })\n })\n })\n}\n","import { GitObject } from '../models/GitObject.js'\nimport { writeObjectLoose } from '../storage/writeObjectLoose.js'\nimport { deflate } from '../utils/deflate.js'\nimport { shasum } from '../utils/shasum.js'\n\nexport async function _writeObject({\n fs,\n gitdir,\n type,\n object,\n format = 'content',\n oid = undefined,\n dryRun = false,\n}) {\n if (format !== 'deflated') {\n if (format !== 'wrapped') {\n object = GitObject.wrap({ type, object })\n }\n oid = await shasum(object)\n object = Buffer.from(await deflate(object))\n }\n if (!dryRun) {\n await writeObjectLoose({ fs, gitdir, object, format: 'deflated', oid })\n }\n return oid\n}\n","import { InternalError } from '../errors/InternalError.js'\n\nexport async function writeObjectLoose({ fs, gitdir, object, format, oid }) {\n if (format !== 'deflated') {\n throw new InternalError(\n 'GitObjectStoreLoose expects objects to write to be in deflated format'\n )\n }\n const source = `objects/${oid.slice(0, 2)}/${oid.slice(2)}`\n const filepath = `${gitdir}/${source}`\n // Don't overwrite existing git objects - this helps avoid EPERM errors.\n // Although I don't know how we'd fix corrupted objects then. Perhaps delete them\n // on read?\n if (!(await fs.exists(filepath))) await fs.write(filepath, object)\n}\n","import { BaseError } from './BaseError.js'\n\nexport class InvalidRefNameError extends BaseError {\n /**\n * @param {string} ref\n * @param {string} suggestion\n * @param {boolean} canForce\n */\n constructor(ref, suggestion) {\n super(\n `\"${ref}\" would be an invalid git reference. (Hint: a valid alternative would be \"${suggestion}\".)`\n )\n this.code = this.name = InvalidRefNameError.code\n this.data = { ref, suggestion }\n }\n}\n/** @type {'InvalidRefNameError'} */\nInvalidRefNameError.code = 'InvalidRefNameError'\n","import { BaseError } from './BaseError.js'\n\nexport class MissingNameError extends BaseError {\n /**\n * @param {'author'|'committer'|'tagger'} role\n */\n constructor(role) {\n super(\n `No name was provided for ${role} in the argument or in the .git/config file.`\n )\n this.code = this.name = MissingNameError.code\n this.data = { role }\n }\n}\n/** @type {'MissingNameError'} */\nMissingNameError.code = 'MissingNameError'\n","export class GitRefStash {\n // constructor removed\n\n static get timezoneOffsetForRefLogEntry() {\n const offsetMinutes = new Date().getTimezoneOffset()\n const offsetHours = Math.abs(Math.floor(offsetMinutes / 60))\n const offsetMinutesFormatted = Math.abs(offsetMinutes % 60)\n .toString()\n .padStart(2, '0')\n const sign = offsetMinutes > 0 ? '-' : '+'\n return `${sign}${offsetHours\n .toString()\n .padStart(2, '0')}${offsetMinutesFormatted}`\n }\n\n static createStashReflogEntry(author, stashCommit, message) {\n const nameNoSpace = author.name.replace(/\\s/g, '')\n const z40 = '0000000000000000000000000000000000000000' // hard code for now, works with `git stash list`\n const timestamp = Math.floor(Date.now() / 1000)\n const timezoneOffset = GitRefStash.timezoneOffsetForRefLogEntry\n return `${z40} ${stashCommit} ${nameNoSpace} ${author.email} ${timestamp} ${timezoneOffset}\\t${message}\\n`\n }\n\n static getStashReflogEntry(reflogString, parsed = false) {\n const reflogLines = reflogString.split('\\n')\n const entries = reflogLines\n .filter(l => l)\n .reverse()\n .map((line, idx) =>\n parsed ? `stash@{${idx}}: ${line.split('\\t')[1]}` : line\n )\n return entries\n }\n}\n","// @ts-check\nimport '../typedefs.js'\n\nimport { GitConfigManager } from '../managers/GitConfigManager.js'\n\n/**\n * @param {Object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {string} args.gitdir\n * @param {string} args.path\n *\n * @returns {Promise<any>} Resolves with the config value\n *\n * @example\n * // Read config value\n * let value = await git.getConfig({\n * dir: '$input((/))',\n * path: '$input((user.name))'\n * })\n * console.log(value)\n *\n */\nexport async function _getConfig({ fs, gitdir, path }) {\n const config = await GitConfigManager.get({ fs, gitdir })\n return config.get(path)\n}\n","// This is part of an elaborate system to facilitate code-splitting / tree-shaking.\n// commands/walk.js can depend on only this, and the actual Walker classes exported\n// can be opaque - only having a single property (this symbol) that is not enumerable,\n// and thus the constructor can be passed as an argument to walk while being \"unusable\"\n// outside of it.\nexport const GitWalkSymbol = Symbol('GitWalkSymbol')\n","import '../typedefs.js'\n\nimport { _readCommit } from '../commands/readCommit.js'\nimport { _writeCommit } from '../commands/writeCommit.js'\nimport { InvalidRefNameError } from '../errors/InvalidRefNameError.js'\nimport { MissingNameError } from '../errors/MissingNameError.js'\nimport { GitRefStash } from '../models/GitRefStash.js'\nimport { join } from '../utils/join.js'\nimport { normalizeAuthorObject } from '../utils/normalizeAuthorObject.js'\nimport { acquireLock } from '../utils/walkerToTreeEntryMap.js'\n\nimport { GitRefManager } from './GitRefManager.js'\n\nexport class GitStashManager {\n /**\n * Creates an instance of GitStashManager.\n *\n * @param {Object} args\n * @param {FSClient} args.fs - A file system implementation.\n * @param {string} args.dir - The working directory.\n * @param {string}[args.gitdir=join(dir, '.git')] - [required] The [git directory](dir-vs-gitdir.md) path\n */\n constructor({ fs, dir, gitdir = join(dir, '.git') }) {\n Object.assign(this, {\n fs,\n dir,\n gitdir,\n _author: null,\n })\n }\n\n /**\n * Gets the reference name for the stash.\n *\n * @returns {string} - The stash reference name.\n */\n static get refStash() {\n return 'refs/stash'\n }\n\n /**\n * Gets the reference name for the stash reflogs.\n *\n * @returns {string} - The stash reflogs reference name.\n */\n static get refLogsStash() {\n return 'logs/refs/stash'\n }\n\n /**\n * Gets the file path for the stash reference.\n *\n * @returns {string} - The file path for the stash reference.\n */\n get refStashPath() {\n return join(this.gitdir, GitStashManager.refStash)\n }\n\n /**\n * Gets the file path for the stash reflogs.\n *\n * @returns {string} - The file path for the stash reflogs.\n */\n get refLogsStashPath() {\n return join(this.gitdir, GitStashManager.refLogsStash)\n }\n\n /**\n * Retrieves the author information for the stash.\n *\n * @returns {Promise<Object>} - The author object.\n * @throws {MissingNameError} - If the author name is missing.\n */\n async getAuthor() {\n if (!this._author) {\n this._author = await normalizeAuthorObject({\n fs: this.fs,\n gitdir: this.gitdir,\n author: {},\n })\n if (!this._author) throw new MissingNameError('author')\n }\n return this._author\n }\n\n /**\n * Gets the SHA of a stash entry by its index.\n *\n * @param {number} refIdx - The index of the stash entry.\n * @param {string[]} [stashEntries] - Optional preloaded stash entries.\n * @returns {Promise<string|null>} - The SHA of the stash entry or `null` if not found.\n */\n async getStashSHA(refIdx, stashEntries) {\n if (!(await this.fs.exists(this.refStashPath))) {\n return null\n }\n\n const entries =\n stashEntries || (await this.readStashReflogs({ parsed: false }))\n return entries[refIdx].split(' ')[1]\n }\n\n /**\n * Writes a stash commit to the repository.\n *\n * @param {Object} args\n * @param {string} args.message - The commit message.\n * @param {string} args.tree - The tree object ID.\n * @param {string[]} args.parent - The parent commit object IDs.\n * @returns {Promise<string>} - The object ID of the written commit.\n */\n async writeStashCommit({ message, tree, parent }) {\n return _writeCommit({\n fs: this.fs,\n gitdir: this.gitdir,\n commit: {\n message,\n tree,\n parent,\n author: await this.getAuthor(),\n committer: await this.getAuthor(),\n },\n })\n }\n\n /**\n * Reads a stash commit by its index.\n *\n * @param {number} refIdx - The index of the stash entry.\n * @returns {Promise<Object>} - The stash commit object.\n * @throws {InvalidRefNameError} - If the index is invalid.\n */\n async readStashCommit(refIdx) {\n const stashEntries = await this.readStashReflogs({ parsed: false })\n if (refIdx !== 0) {\n // non-default case, throw exceptions if not valid\n if (refIdx < 0 || refIdx > stashEntries.length - 1) {\n throw new InvalidRefNameError(\n `stash@${refIdx}`,\n 'number that is in range of [0, num of stash pushed]'\n )\n }\n }\n\n const stashSHA = await this.getStashSHA(refIdx, stashEntries)\n if (!stashSHA) {\n return {} // no stash found\n }\n\n // get the stash commit object\n return _readCommit({\n fs: this.fs,\n cache: {},\n gitdir: this.gitdir,\n oid: stashSHA,\n })\n }\n\n /**\n * Writes a stash reference to the repository.\n *\n * @param {string} stashCommit - The object ID of the stash commit.\n * @returns {Promise<void>}\n */\n async writeStashRef(stashCommit) {\n return GitRefManager.writeRef({\n fs: this.fs,\n gitdir: this.gitdir,\n ref: GitStashManager.refStash,\n value: stashCommit,\n })\n }\n\n /**\n * Writes a reflog entry for a stash commit.\n *\n * @param {Object} args\n * @param {string} args.stashCommit - The object ID of the stash commit.\n * @param {string} args.message - The reflog message.\n * @returns {Promise<void>}\n */\n async writeStashReflogEntry({ stashCommit, message }) {\n const author = await this.getAuthor()\n const entry = GitRefStash.createStashReflogEntry(\n author,\n stashCommit,\n message\n )\n const filepath = this.refLogsStashPath\n\n await acquireLock({ filepath, entry }, async () => {\n const appendTo = (await this.fs.exists(filepath))\n ? await this.fs.read(filepath, 'utf8')\n : ''\n await this.fs.write(filepath, appendTo + entry, 'utf8')\n })\n }\n\n /**\n * Reads the stash reflogs.\n *\n * @param {Object} args\n * @param {boolean} [args.parsed=false] - Whether to parse the reflog entries.\n * @returns {Promise<string[]|Object[]>} - The reflog entries as strings or parsed objects.\n */\n async readStashReflogs({ parsed = false }) {\n if (!(await this.fs.exists(this.refLogsStashPath))) {\n return []\n }\n\n const reflogString = await this.fs.read(this.refLogsStashPath, 'utf8')\n\n return GitRefStash.getStashReflogEntry(reflogString, parsed)\n }\n}\n","import '../typedefs.js'\nimport { _getConfig } from '../commands/getConfig.js'\n\nimport { assignDefined } from './assignDefined.js'\n\n/**\n * Return author object by using properties following this priority:\n * (1) provided author object\n * -> (2) author of provided commit object\n * -> (3) Config and current date/time\n *\n * @param {Object} args\n * @param {FsClient} args.fs - a file system implementation\n * @param {string} [args.gitdir] - The [git directory](dir-vs-gitdir.md) path\n * @param {Object} [args.author] - The author object.\n * @param {CommitObject} [args.commit] - A commit object.\n *\n * @returns {Promise<void | {name: string, email: string, timestamp: number, timezoneOffset: number }>}\n */\nexport async function normalizeAuthorObject({ fs, gitdir, author, commit }) {\n const timestamp = Math.floor(Date.now() / 1000)\n\n const defaultAuthor = {\n name: await _getConfig({ fs, gitdir, path: 'user.name' }),\n email: (await _getConfig({ fs, gitdir, path: 'user.email' })) || '', // author.email is allowed to be empty string\n timestamp,\n timezoneOffset: new Date(timestamp * 1000).getTimezoneOffset(),\n }\n\n // Populate author object by using properties with this priority:\n // (1) provided author object\n // -> (2) author of provided commit object\n // -> (3) default author\n const normalizedAuthor = assignDefined(\n {},\n defaultAuthor,\n commit ? commit.author : undefined,\n author\n )\n\n if (normalizedAuthor.name === undefined) {\n return undefined\n }\n\n return normalizedAuthor\n}\n","// Like Object.assign but ignore properties with undefined values\n// ref: https://stackoverflow.com/q/39513815\nexport function assignDefined(target, ...sources) {\n for (const source of sources) {\n if (source) {\n for (const key of Object.keys(source)) {\n const val = source[key]\n if (val !== undefined) {\n target[key] = val\n }\n }\n }\n }\n return target\n}\n","// @ts-check\nimport '../typedefs.js'\n\nimport { GitCommit } from '../models/GitCommit.js'\nimport { _writeObject as writeObject } from '../storage/writeObject.js'\n\n/**\n * @param {object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {string} args.gitdir\n * @param {CommitObject} args.commit\n *\n * @returns {Promise<string>}\n * @see CommitObject\n *\n */\nexport async function _writeCommit({ fs, gitdir, commit }) {\n // Convert object to buffer\n const object = GitCommit.from(commit).toObject()\n const oid = await writeObject({\n fs,\n gitdir,\n type: 'commit',\n object,\n format: 'content',\n })\n return oid\n}\n","// @ts-check\nimport '../typedefs.js'\n\nimport { resolveCommit } from '../utils/resolveCommit.js'\n\n/**\n * @param {object} args\n * @param {import('../models/FileSystem.js').FileSystem} args.fs\n * @param {any} args.cache\n * @param {string} args.gitdir\n * @param {string} args.oid\n *\n * @returns {Promise<ReadCommitResult>} Resolves successfully with a git commit object\n * @see ReadCommitResult\n * @see CommitObject\n *\n */\nexport async function _readCommit({ fs, cache, gitdir, oid }) {\n const { commit, oid: commitOid } = await resolveCommit({\n fs,\n cache,\n gitdir,\n oid,\n })\n const result = {\n oid: commitOid,\n commit: commit.parse(),\n payload: commit.withoutSignature(),\n }\n // @ts-ignore\n return result\n}\n"],"names":["root","factory","exports","module","define","amd","self","$defineProperty","$SyntaxError","$TypeError","gopd","obj","property","value","arguments","length","nonEnumerable","nonWritable","nonConfigurable","loose","desc","configurable","enumerable","writable","Function","prototype","call","read","buffer","offset","isLE","mLen","nBytes","e","m","eLen","eMax","eBias","nBits","i","d","s","NaN","Infinity","Math","pow","write","c","rt","abs","isNaN","floor","log","LN2","Buffer","toBuffer","Hash","blockSize","finalSize","this","_block","alloc","_finalSize","_blockSize","_len","update","data","enc","block","accum","assigned","remainder","min","_update","digest","rem","fill","bits","writeUInt32BE","lowBits","highBits","hash","_hash","toString","Error","round","undefined","$Object","$Error","$EvalError","$RangeError","$ReferenceError","$URIError","max","sign","$Function","getEvalledConstructor","expressionSyntax","$gOPD","throwTypeError","ThrowTypeError","calleeThrows","get","gOPDthrows","hasSymbols","getProto","$ObjectGPO","$ReflectGPO","$apply","$call","needsEval","TypedArray","Uint8Array","INTRINSICS","__proto__","AggregateError","Array","ArrayBuffer","Symbol","iterator","Atomics","BigInt","BigInt64Array","BigUint64Array","Boolean","DataView","Date","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","eval","Float16Array","Float32Array","Float64Array","FinalizationRegistry","Int8Array","Int16Array","Int32Array","isFinite","JSON","Map","Number","parseFloat","parseInt","Promise","Proxy","Reflect","RegExp","Set","SharedArrayBuffer","String","Uint8ClampedArray","Uint16Array","Uint32Array","WeakMap","WeakRef","WeakSet","error","errorProto","doEval","name","fn","gen","LEGACY_ALIASES","bind","hasOwn","$concat","concat","$spliceApply","splice","$replace","replace","$strSlice","slice","$exec","exec","rePropName","reEscapeChar","getBaseIntrinsic","allowMissing","alias","intrinsicName","parts","string","first","last","result","match","number","quote","subString","stringToPath","intrinsicBaseName","intrinsic","intrinsicRealName","skipFurtherCaching","isOwn","part","setFunctionLength","callBindBasic","applyBind","originalFunction","func","adjustedLength","apply","hasPropertyDescriptors","hasArrayLengthDefineBug","Object","defineProperty","AsyncLock","opts","queues","create","domainReentrant","process","domain","domains","timeout","DEFAULT_TIMEOUT","maxOccupationTime","DEFAULT_MAX_OCCUPATION_TIME","maxExecutionTime","DEFAULT_MAX_EXECUTION_TIME","maxPending","isInteger","DEFAULT_MAX_PENDING","acquire","key","cb","isArray","_acquireBatch","deferredResolve","deferredReject","deferred","resolve","reject","resolved","timer","occupationTimer","executionTimer","done","locked","err","ret","clearTimeout","shift","setTimeout","called","_promiseTry","then","taskFn","skipQueue","unshift","push","keys","fnx","reduceRight","prev","getFn","isBusy","copyProps","src","dst","SafeBuffer","arg","encodingOrOffset","from","allocUnsafe","allocUnsafeSlow","TypeError","size","encoding","buf","SlowBuffer","getPrototypeOf","EvalError","getOwnPropertySymbols","sym","symObj","_","getOwnPropertyNames","syms","propertyIsEnumerable","getOwnPropertyDescriptor","descriptor","utils","adler32","crc32","inflate_fast","inflate_table","Z_STREAM_ERROR","TYPE","BAD","zswap32","q","InflateState","mode","wrap","havedict","flags","dmax","check","total","head","wbits","wsize","whave","wnext","window","hold","extra","lencode","distcode","lenbits","distbits","ncode","nlen","ndist","have","next","lens","Buf16","work","lendyn","distdyn","sane","back","was","inflateResetKeep","strm","state","total_in","total_out","msg","adler","Buf32","inflateReset","inflateReset2","windowBits","inflateInit2","lenfix","distfix","virgin","fixedtables","updatewindow","end","copy","dist","Buf8","arraySet","inflateInit","inflate","flush","input","output","put","left","_in","_out","from_source","here_bits","here_op","here_val","last_bits","last_op","last_val","len","n","here","hbuf","order","avail_in","next_out","avail_out","next_in","inf_leave","text","time","xflags","os","extra_len","fromCharCode","comment","hcrc","data_type","inflateEnd","inflateGetHeader","inflateSetDictionary","dictionary","dictLength","inflateInfo","pako","assign","STR_APPLY_OK","STR_APPLY_UIA_OK","__","_utf8len","buf2binstring","subarray","shrinkBuf","string2buf","str","c2","m_pos","str_len","buf_len","charCodeAt","binstring2buf","buf2string","out","c_len","utf16buf","utf8border","pos","lbase","lext","dbase","dext","type","lens_index","codes","table","table_index","incr","low","mask","curr","drop","used","huff","base","base_index","count","MAXBITS","offs","extra_index","actualApply","makeArray","subject","REGEX_TEST_BLANK_LINE","REGEX_INVALID_TRAILING_BACKSLASH","REGEX_REPLACE_LEADING_EXCAPED_EXCLAMATION","REGEX_REPLACE_LEADING_EXCAPED_HASH","REGEX_SPLITALL_CRLF","REGEX_TEST_INVALID_PATH","TMP_KEY_IGNORE","for","KEY_IGNORE","REGEX_REGEXP_RANGE","RETURN_FALSE","REPLACERS","m1","m2","indexOf","test","index","p1","p2","leadEscape","range","endEscape","close","slashes","cleanRangeBackSlash","to","sanitizeRange","regexCache","isString","IgnoreRule","constructor","origin","pattern","negative","regex","throwError","message","Ctor","checkPath","path","originalPath","doThrow","isNotRelative","RangeError","convert","p","Ignore","ignorecase","ignoreCase","allowRelativePaths","_rules","_ignoreCase","_allowRelativePaths","_initCache","_ignoreCache","_testCache","_addPattern","_added","checkPattern","rule","substr","source","reduce","matcher","replacer","makeRegex","createRule","add","split","splitPattern","forEach","addPattern","_testOne","checkUnignored","ignored","unignored","_test","cache","slices","_t","pop","parent","join","ignores","createFilter","filter","paths","options","isPathValid","default","env","IGNORE_TEST_WIN32","platform","makePosix","REGIX_IS_WINDOWS_PATH_ABSOLUTE","CRC32","version","T0","signed_crc_table","TT","T","v","slice_by_16_tables","T1","T2","T3","T4","T5","T6","T7","T8","T9","Ta","Tb","Tc","Td","Te","Tf","bstr","seed","C","L","B","DO_NOT_EXPORT_CRC","isCallable","toStr","hasOwnProperty","list","thisArg","receiver","x","array","forEachArray","charAt","forEachString","object","k","forEachObject","$isNaN","$actualApply","args","$reflectApply","s1","s2","zlib_deflate","strings","ZStream","Deflate","level","method","chunkSize","memLevel","strategy","opt","raw","gzip","ended","chunks","status","deflateInit2","header","deflateSetHeader","dict","deflateSetDictionary","_dict_set","deflate","deflator","_mode","onEnd","onData","deflateEnd","chunk","flattenChunks","deflateRaw","reflectGetProto","originalGetProto","getDunderProto","O","zero","extra_lbits","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","D_CODES","_dist_code","_length_code","MAX_MATCH","base_length","static_l_desc","static_d_desc","static_bl_desc","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","TreeDesc","dyn_tree","stat_desc","max_code","d_code","put_short","w","pending_buf","pending","send_bits","bi_valid","bi_buf","send_code","tree","bi_reverse","code","res","gen_codes","bl_count","next_code","MAX_BITS","init_block","LITERALS","dyn_ltree","dyn_dtree","bl_tree","END_BLOCK","opt_len","static_len","last_lit","matches","bi_windup","smaller","depth","_n2","_m2","pqdownheap","heap","j","heap_len","compress_block","ltree","dtree","lc","lx","d_buf","l_buf","build_tree","node","stree","heap_max","h","xbits","f","overflow","gen_bitlen","scan_tree","curlen","prevlen","nextlen","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","_tr_stored_block","stored_len","copy_block","_tr_init","LENGTH_CODES","L_CODES","tr_static_init","l_desc","d_desc","bl_desc","_tr_flush_block","opt_lenb","static_lenb","max_blindex","black_mask","detect_data_type","BL_CODES","build_bl_tree","lcodes","dcodes","blcodes","rank","send_all_trees","_tr_tally","lit_bufsize","_tr_align","STATIC_TREES","bi_flush","inherits","K","W","Sha1","init","_w","rotl1","num","rotl5","rotl30","ft","b","_a","_b","_c","_d","_e","M","a","readInt32BE","t","H","writeInt32BE","origSymbol","hasSymbolSham","$typedArrayBuffer","callBound","isTypedArray","arr","crcTable","makeTable","crc","URIError","typedArrayBuffer","isView","useUint8Array","useArrayBuffer","useFromArrayBuffer","TYPED_ARRAY_SUPPORT","byteLength","byteOffset","uint8","isArr","isBuffer","whichTypedArray","availableTypedArrays","callBind","gOPD","$toString","hasToStringTag","g","globalThis","typedArrays","$slice","$indexOf","typedArray","toStringTag","proto","superProto","set","tag","found","getter","trySlices","tryTypedArrays","GetIntrinsic","ctor","superCtor","super_","TempCtor","implementation","hasDescriptors","$floor","functionLengthIsConfigurable","functionLengthIsWritable","zlib_inflate","GZheader","Inflate","Z_OK","inflator","next_out_utf8","tail","utf8str","allowBufError","Z_FINISH","Z_NO_FLUSH","Z_NEED_DICT","Z_BUF_ERROR","Z_STREAM_END","Z_SYNC_FLUSH","inflateRaw","ungzip","hasProtoAccessor","$getPrototypeOf","start","beg","s_window","lcode","dcode","lmask","dmask","op","top","dolen","b64","getLens","validLen","placeHoldersLen","toByteArray","tmp","Arr","_byteLength","curByte","revLookup","fromByteArray","extraBytes","maxChunkLength","len2","encodeChunk","lookup","tripletToBase64","SyntaxError","base64","ieee754","customInspectSymbol","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","setPrototypeOf","isEncoding","actual","fromString","arrayView","isInstance","fromArrayBuffer","fromArrayLike","fromArrayView","valueOf","checked","numberIsNaN","fromObject","toPrimitive","assertSize","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","toLowerCase","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","val","dir","arrayIndexOf","lastIndexOf","indexSize","arrLength","valLength","readUInt16BE","foundIndex","hexWrite","remaining","strLen","parsed","utf8Write","blitBuffer","asciiWrite","byteArray","asciiToBytes","base64Write","ucs2Write","units","hi","lo","utf16leToBytes","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","codePoints","MAX_ARGUMENTS_LENGTH","decodeCodePointsArray","kMaxLength","foo","typedArraySupport","console","poolSize","_isBuffer","compare","y","swap16","swap32","swap64","toLocaleString","equals","inspect","trim","target","thisStart","thisEnd","thisCopy","targetCopy","includes","toJSON","_arr","hexSliceLookupTable","bytes","checkOffset","ext","checkInt","wrtBigUInt64LE","checkIntBI","wrtBigUInt64BE","checkIEEE754","writeFloat","littleEndian","noAssert","writeDouble","newBuf","readUintLE","readUIntLE","mul","readUintBE","readUIntBE","readUint8","readUInt8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUInt32LE","readUint32BE","readUInt32BE","readBigUInt64LE","defineBigIntMethod","validateNumber","boundsError","readBigUInt64BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readBigInt64LE","readBigInt64BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUintLE","writeUIntLE","writeUintBE","writeUIntBE","writeUint8","writeUInt8","writeUint16LE","writeUInt16LE","writeUint16BE","writeUInt16BE","writeUint32LE","writeUInt32LE","writeUint32BE","writeBigUInt64LE","writeBigUInt64BE","writeIntLE","limit","sub","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeBigInt64LE","writeBigInt64BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","copyWithin","errors","E","getMessage","Base","super","stack","addNumericalSeparator","ERR_OUT_OF_RANGE","checkBounds","ERR_INVALID_ARG_TYPE","ERR_BUFFER_OUT_OF_BOUNDS","received","INVALID_BASE64_RE","leadSurrogate","base64clean","alphabet","i16","BufferBigIntNotDefined","configuration_table","trees","MIN_LOOKAHEAD","HCRC_STATE","BUSY_STATE","FINISH_STATE","errorCode","flush_pending","pending_out","flush_block_only","block_start","strstart","put_byte","putShortMSB","read_buf","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","w_size","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","more","_w_size","window_size","hash_size","insert","ins_h","hash_shift","hash_mask","deflate_fast","hash_head","bflush","match_length","max_lazy_match","MIN_MATCH","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","DeflateState","pending_buf_size","gzhead","gzindex","last_flush","w_bits","hash_bits","HEAP_SIZE","deflateResetKeep","deflateReset","max_block_size","max_start","deflateInit","old_flush","bstate","deflate_huff","deflate_rle","avail","tmpDict","deflateInfo","possibleNames","concatty","that","bound","arrLike","slicy","boundLength","boundArgs","joiny","Empty","ReferenceError","badArrayLike","isCallableMarker","fnToStr","reflectApply","constructorRegex","isES6ClassFn","fnStr","tryFunctionObject","isIE68","isDDA","document","all","strClass","Z_PARTIAL_FLUSH","Z_FULL_FLUSH","Z_BLOCK","Z_TREES","Z_ERRNO","Z_DATA_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_BINARY","Z_TEXT","Z_UNKNOWN","Z_DEFLATED","TYPED_OK","_has","sources","fnTyped","dest","src_offs","dest_offs","l","fnUntyped","setTyped","on","$hasOwn","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","definition","o","prop","r","bool","schema","core","filemode","bare","logallrefupdates","symlinks","bigFileThreshold","endsWith","SECTION_LINE_REGEX","SECTION_REGEX","VARIABLE_LINE_REGEX","VARIABLE_NAME_REGEX","VARIABLE_VALUE_COMMENT_REGEX","hasOddNumberOfQuotes","removeQuotes","newText","idx","isQuote","isEscapeForQuote","lower","getPath","section","subsection","normalizePath","pathSegments","sectionPath","isSection","GitConfig","parsedConfig","map","line","trimmedLine","extractedSection","extractSectionLine","extractedVariable","rawValue","valueWithoutComments","commentMatches","valueWithoutComment","removeComments","extractVariableLine","getall","normalizedPath","allValues","config","getSubsections","deleteSection","append","configIndex","callback","lastIndex","item","modifiedConfig","modified","sectionIndex","findIndex","newConfig","newSection","GitConfigManager","fs","gitdir","save","dirname","joined","isAbsolute","trailingSeparator","at","aar","lastSegmentLength","lastSlash","dots","char","lastSlashIndex","normalizeString","normalize","isIgnored","filepath","basename","excludes","excludesFile","exists","pairs","gitignore","pieces","folder","file","ignoredStatus","ign","ignore","parentdir","BaseError","caller","fromJSON","json","isIsomorphicGitError","UnmergedPathsError","filepaths","UnsafeFilepathError","BufferCursor","_start","eof","tell","seek","comparePath","compareStrings","normalizeMode","permissions","MAX_UINT32","SecondsNanoseconds","givenSeconds","givenNanoseconds","milliseconds","date","seconds","normalizeStats","ctimeSeconds","ctimeNanoseconds","ctimeMs","ctime","mtimeSeconds","mtimeNanoseconds","mtimeMs","mtime","dev","ino","uid","gid","supportsSubtleSHA1","async","shasum","subtleSHA1","testSubtleSHA1","shasumSync","hex","byte","toHex","crypto","subtle","parseCacheEntryFlags","assumeValid","extended","stage","nameLength","GitIndex","entries","unmergedPaths","_dirty","_unmergedPaths","_entries","_addEntry","entry","stages","delete","existingEntry","fromBuffer","reader","magic","shaComputed","shaClaimed","numEntries","oid","pathlength","padding","values","sort","entriesMap","entriesFlat","flatMap","stats","bfilepath","has","startsWith","clear","render","_entryToBuffer","bpath","ceil","written","writer","stat","renderCacheEntryFlags","toObject","entryBuffers","body","main","sum","lock","IndexCache","allowUnmerged","closure","theIndexCache","savedStats","currStats","lstat","trustino","compareStats","isIndexStale","rawIndexFile","updateCachedIndexFile","InvalidOidError","NoRefspecError","remote","what","GitPackedRefs","refs","ref","peeled","GitRefSpec","remotePath","localPath","force","matchPrefix","refspec","forceMatch","remoteGlobMatch","localGlobMatch","remoteIsGlob","translate","remoteBranch","reverseTranslate","localBranch","GitRefSpecSet","rules","refspecs","remoteRefs","remoteRef","localRef","translateOne","localNamespaces","compareRefNames","refpaths","GIT_FILES","acquireLock","GitRefManager","updateRemoteRefs","symrefs","tags","prune","pruneTags","actualRefsToWrite","listRefs","deleteRefs","serverRef","refTranslations","translatedRef","symrefTranslations","symtarget","pruned","writeRef","writeSymbolicRef","deleteRef","rm","packed","beforeSize","packedMap","packedRefs","allpaths","sha","expand","expandAgainstMap","resolveAgainstMap","fullref","files","readdirDeep","listBranches","listTags","HttpError","statusCode","statusMessage","response","SmartHttpError","preview","UserCanceledError","calculateBasicAuthHeader","username","password","getIterator","iterable","asyncIterator","queue","return","fromValue","extractAuthFromUrl","url","userpass","auth","EmptyServerResponseError","ParseError","expected","StreamReader","stream","cursor","undoCursor","started","_ended","_discardedBytes","_init","_loadnext","_moveCursor","_trim","_accumulate","skip","undo","_next","buffers","lengthBuffers","nextbuffer","acc","GitPktLine","delim","encode","hexlength","repeat","padHex","streamReader","parseCapabilitiesV2","capabilities2","protocolVersion","parseRefsAdResponse","service","capabilities","lineOne","lineTwo","firstRef","capabilitiesLine","splitAndAssert","cap","sep","corsProxify","corsProxy","updateHeaders","headers","Authorization","stringifyBody","iter","forAwait","nextIndex","collect","GitRemoteHTTP","discover","http","onProgress","onAuth","onAuthSuccess","onAuthFailure","_origUrl","proxifiedURL","tryAgain","providedAuthBefore","request","getAuth","cancel","remoteHTTP","connect","urlAuth","accept","UnknownTransportError","transport","suggestion","UrlParseError","GitRemoteManager","getRemoteHelperFor","remoteHelpers","address","parseRemoteUrl","translateSSHtoHTTP","GitShallowManager","oids","ObjectTypeError","formatAuthor","email","timestamp","timezoneOffset","minutes","is","simpleSign","hours","strHours","strMinutes","formatTimezoneOffset","normalizeNewlines","parseAuthor","author","parseTimezoneOffset","GitAnnotatedTag","_tag","tagger","gpgsig","justHeaders","withoutSignature","parse","hs","committer","payload","secretKey","signature","signedTag","indent","GitCommit","commit","_commit","fromPayloadSignature","justMessage","parseHeaders","renderHeaders","isolateSignature","signedCommit","GitObject","headerLen","totalLength","wrappedObject","unwrap","actualLength","readVarIntLE","readCompactLE","readOp","parseHeader","ofs","reference","supportsDecompressionStream","DecompressionStream","testDecompressionStream","ds","Blob","pipeThrough","Response","arrayBuffer","browserInflate","GitPackIndex","stuff","offsetCache","fromIdx","getExternalRefDelta","hashes","offsets","packfileSha","crcs","fromPack","pack","listpackTypes","offsetToObject","totalObjectCount","lastPercent","PACK","numObjects","listpack","percent","phase","loaded","offsetArray","objectsByDepth","readDepth","externalReadDepth","readSlice","fanoutBuffer","crcsBuffer","offsetsBuffer","totalBuffer","shaBuffer","load","unload","btype","lastFour","startWith","otherVarIntDecode","multibyte","lastSeven","decodeVarInt","baseOffset","delta","sourceSize","targetSize","firstOp","applyDelta","format","PackfileCache","readPackIndex","filename","emitter","emitterPrefix","loadPackIndex","readdir","indexFile","packFile","_checksumVerified","expectedShaFromIndex","packTrailer","packTrailerSha","padStart","actualPayloadSha","readObjectPacked","resolveCommit","supportsCompressionStream","dryRun","CompressionStream","testCompressionStream","cs","browserDeflate","writeObjectLoose","InvalidRefNameError","MissingNameError","role","GitRefStash","timezoneOffsetForRefLogEntry","offsetMinutes","getTimezoneOffset","offsetHours","offsetMinutesFormatted","createStashReflogEntry","stashCommit","nameNoSpace","now","getStashReflogEntry","reflogString","reverse","_getConfig","GitStashManager","_author","refStash","refLogsStash","refStashPath","refLogsStashPath","getAuthor","normalizedAuthor","assignDefined","normalizeAuthorObject","getStashSHA","refIdx","stashEntries","readStashReflogs","writeStashCommit","_writeCommit","readStashCommit","stashSHA","commitOid","_readCommit","writeStashRef","writeStashReflogEntry","appendTo"],"sourceRoot":""}