@jujulego/jill 2.2.0-alpha.7 → 2.2.0-alpha.8

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 (14) hide show
  1. package/dist/508.js +1 -1
  2. package/dist/508.js.map +1 -1
  3. package/dist/787.js +2 -0
  4. package/dist/787.js.map +1 -0
  5. package/dist/828.js +1 -1
  6. package/dist/833.js +2 -2
  7. package/dist/833.js.map +1 -1
  8. package/dist/839.js +1 -1
  9. package/dist/839.js.map +1 -1
  10. package/dist/index.js +1 -1
  11. package/dist/tsconfig.build.tsbuildinfo +1 -1
  12. package/package.json +9 -9
  13. package/dist/630.js +0 -2
  14. package/dist/630.js.map +0 -1
package/dist/630.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"630.js","mappings":"+GACiB,SAASA,EAAUC,GAChC,OAAoB,IAAhBA,EAAKC,OAEE,CACHC,QAASF,EACTG,KAAM,CAAC,GAGK,IAAhBH,EAAKC,OAEE,CACHC,QAASF,EAAKI,MAAM,EAAG,GACvBD,KAAMH,EAAK,IAAM,CAAC,GAGH,iBAAZA,EAAK,GAEL,CACHE,QAASF,EACTG,KAAM,CAAC,GAIJ,CACHD,QAASF,EAAKI,MAAM,EAAG,GACvBD,KAAMH,EAAK,IAAM,CAAC,EAG9B,CACO,SAASK,IACZ,IAAI,IAAIC,EAAOC,UAAUN,OAAQD,EAAO,IAAIQ,MAAMF,GAAOG,EAAO,EAAGA,EAAOH,EAAMG,IAC5ET,EAAKS,GAAQF,UAAUE,GAE3B,MAAMC,EAASX,EAAUC,GACnBW,EAAQ,IAAIC,SAAQ,CAACC,EAAGC,KAC1BJ,EAAOP,KAAKY,QAAQC,iBAAiB,SAAS,WAC1CF,EAAOG,KAAKC,OAChB,GAAG,CACCC,MAAM,GACR,IAEN,MAAO,CACHC,KAAMC,UAKK,CACHC,YALgBV,QAAQW,KAAK,EAC7B,UAAWb,EAAOR,SAClBS,MAMR,CAACa,OAAOC,iBACJ,OAAOR,IACX,EAER,C,0ECrDO,MAAMS,UAAsB,IAE/BL,qBACI,IAAK,MAAMM,KAAQV,KAAKW,YACdD,GACN,OAAKA,EAAM,aAAa,KACpB,MAAME,EAAQZ,KAAKY,MACfA,EAAMC,KAAOD,EAAME,SAAWd,KAAKW,MAAM3B,SACzCgB,KAAKe,OAASH,EAAME,OAAS,EAAI,SAAW,OAChD,GAGZ,CACAE,QAEI,IAAK,MAAMN,KAAQV,KAAKW,MACpBD,EAAKO,MAEb,CACAC,WAAWC,EAAQ,IAAIC,KACnB,IAAIF,EAAaC,EAAME,IAAIrB,KAAKsB,IAChC,QAAmBC,IAAfL,EAA0B,CAC1BA,EAAa,EACb,IAAK,MAAMR,KAAQV,KAAKW,MACpBO,EAAaM,KAAKC,IAAIP,EAAYR,EAAKQ,WAAWC,IAEtDD,GAAcQ,MAAMR,WAAWC,GAC/BA,EAAMQ,IAAI3B,KAAKsB,GAAIJ,EACvB,CACA,OAAOA,CACX,E,wEC9BG,MAAMU,UAAsB,IAE/BC,UAAW,EACXC,aAEA1B,qBACI,IAAK,MAAMM,KAAQV,KAAKW,MAAM,CAC1B,GAAIX,KAAK6B,SAEL,YADA7B,KAAKe,OAAS,UAQlB,GAJAf,KAAK8B,aAAepB,QACdA,EAGgB,kBADD,OAAQA,EAAM,cACxBK,OAEP,YADAf,KAAKe,OAAS,SAGtB,CACAf,KAAKe,OAAS,MAClB,CACAC,QACIhB,KAAK6B,UAAW,EAEhB7B,KAAK8B,cAAcb,MACvB,CACAC,WAAWC,EAAQ,IAAIC,KACnB,IAAIF,EAAaQ,MAAMR,WAAWC,GAGlC,OAFAD,GAAclB,KAAKW,MAAM,GAAGO,WAAWC,GACvCA,EAAMQ,IAAI3B,KAAKsB,GAAIJ,GACZA,CACX,E,+BCpCG,SAAShB,IACZ,IAAI,IAAIb,EAAOC,UAAUN,OAAQD,EAAO,IAAIQ,MAAMF,GAAOG,EAAO,EAAGA,EAAOH,EAAMG,IAC5ET,EAAKS,GAAQF,UAAUE,GAE3B,IAAIuC,EACJ,GAAoB,IAAhBhD,EAAKC,OAAc,CACnB,MAAOgD,EAAKC,GAAYlD,EACxBgD,EAAMC,EAAIE,WAAWC,IACjBJ,IACAE,EAASE,EAAK,GAEtB,KAAO,CACH,MAAOC,EAAQC,EAAKJ,GAAYlD,EAChCgD,EAAMK,EAAOE,GAAGD,GAAMF,IAClBJ,IACAE,EAASE,EAAK,GAEtB,CACA,OAAOJ,CACX,CClBO,SAAS9C,IACZ,IAAI,IAAII,EAAOC,UAAUN,OAAQD,EAAO,IAAIQ,MAAMF,GAAOG,EAAO,EAAGA,EAAOH,EAAMG,IAC5ET,EAAKS,GAAQF,UAAUE,GAE3B,OAAO,IAAIG,SAAS4C,GAAUrC,KAAQnB,EAAMwD,IAChD,CCNO,SAASC,EAASH,GACrB,MAAMI,EAAMJ,EAAIK,QAAQ,KACxB,OAAa,IAATD,EACO,CACHJ,EACA,IAGG,CACHA,EAAIlD,MAAM,EAAGsD,GACbJ,EAAIlD,MAAMsD,EAAM,GAG5B,CCZO,SAASL,IACZ,MAAMO,EAAY,IAAIC,IACtB,MAAO,CACHD,YACAE,KAAMV,GACF,IAAK,MAAMF,KAAYU,EACnBV,EAASE,EAEjB,EACAD,UAAWD,IACPU,EAAUG,IAAIb,GACP,IAAIU,EAAUI,OAAOd,IAEhCe,YAAaf,GACTU,EAAUI,OAAOd,EACrB,EAER,C,iBChBO,MAAMgB,EACTC,QACIlD,KAAKmD,OAASnD,KAAKoD,YACnBpD,KAAKqD,QAAQR,KAAK,GAAG7C,KAAKmD,SAAUnD,KAAKmD,OAC7C,CACA/C,cAAcC,GACV,KAAML,KAAKmD,SAAW9C,SACZpB,EAAQe,KAAKqD,QAAS,GAAGhD,IAEvC,CAEIA,YACA,OAAOL,KAAKmD,MAChB,CAEAG,YAAYF,GACRpD,KAAKoD,UAAYA,EACjBpD,KAAKqD,QChBN,SAAeE,GAClB,MAAMC,ECFH,SAAqBD,GACxB,MAAME,EAAU,IAAIrC,IAAIsC,OAAOC,QAAQJ,IACvC,SAASK,EAAUvB,GACf,MAAMwB,EAAMJ,EAAQpC,IAAIgB,GACxB,IAAKwB,EACD,MAAM,IAAIC,MAAM,gBAAgBzB,eAEpC,OAAOwB,CACX,CACA,MAAO,CACHJ,UACAZ,KAAMR,EAAKF,GACP,MAAO4B,EAAMC,GAAUxB,EAASH,GAC1BwB,EAAMD,EAAUG,GAClBC,EACAH,EAAIhB,KAAKmB,EAAQ7B,GAEjB0B,EAAIhB,KAAKV,EAEjB,EACAG,GAAID,EAAKJ,GACL,MAAO8B,EAAMC,GAAUxB,EAASH,GAC1BwB,EAAMD,EAAUG,GACtB,OAAIC,EACOH,EAAIvB,GAAG0B,EAAQ/B,GAEf4B,EAAI3B,UAAUD,EAE7B,EACAF,IAAKM,EAAKJ,GACN,MAAO8B,EAAMC,GAAUxB,EAASH,GAC1BwB,EAAMD,EAAUG,GAClBC,EACAH,EAAI9B,IAAIiC,EAAQ/B,GAEhB4B,EAAIb,YAAYf,EAExB,EAER,CDrCgBgC,CAAYV,GAClBM,EAAMzB,IACZ,MAAO,CACHqB,QAASD,EAAIC,QACbd,UAAWkB,EAAIlB,UACfE,KAAMR,EAAKF,GACPqB,EAAIX,KAAKR,EAAKF,GACd0B,EAAIhB,KAAKV,EACb,EACAG,GAAIkB,EAAIlB,GACRP,IAAKyB,EAAIzB,IACTG,UAAW2B,EAAI3B,UACfc,YAAaa,EAAIb,YAEzB,CDCuBkB,CAAM,CACjB,KAAQ9B,IACR,MAASA,MAEbpC,KACAsC,GAAKtC,KAAKqD,QAAQf,GAClBtC,KAAK+B,IAAM/B,KAAKqD,QAAQtB,IACxB/B,KAAKkC,UAAYlC,KAAKqD,QAAQnB,UAC9BlC,KAAKgD,YAAchD,KAAKqD,QAAQL,YAChChD,KAAKmD,OAASC,GAClB,EG3BG,MAAMe,EAET/D,sBACUJ,KAAKoE,QAAQnF,SAAQ,GAC3Be,KAAKqE,SACLrE,KAAKoE,QAAQlB,OACjB,CACAoB,UACItE,KAAKqE,SACLrE,KAAKoE,QAAQlB,OACjB,CACA9C,WAAWmE,GACP,IAEI,aADMvE,KAAKwE,gBACED,GAGjB,CAFE,QACEvE,KAAKsE,SACT,CACJ,CAEIG,aACA,OAAOzE,KAAKoE,QAAQ/D,KACxB,CACAiD,cAEItD,KAAKqE,OAAS,EACdrE,KAAKoE,QAAU,IAAInB,GAAU,IAAIjD,KAAKqE,OAAS,GACnD,E,yBCzBJ,IAAIK,EAAgB,kDAChBvF,EAAQI,MAAMoF,UAAUxF,MACxByF,EAAQlB,OAAOiB,UAAUE,SACzBC,EAAW,oBAEfC,EAAOC,QAAU,SAAcC,GAC3B,IAAIC,EAASlF,KACb,GAAsB,mBAAXkF,GAAyBN,EAAMO,KAAKD,KAAYJ,EACvD,MAAM,IAAIM,UAAUV,EAAgBQ,GAyBxC,IAvBA,IAEIG,EAFAtG,EAAOI,EAAMgG,KAAK7F,UAAW,GAG7BgG,EAAS,WACT,GAAItF,gBAAgBqF,EAAO,CACvB,IAAIE,EAASL,EAAOM,MAChBxF,KACAjB,EAAK0G,OAAOtG,EAAMgG,KAAK7F,aAE3B,OAAIoE,OAAO6B,KAAYA,EACZA,EAEJvF,IACX,CACI,OAAOkF,EAAOM,MACVP,EACAlG,EAAK0G,OAAOtG,EAAMgG,KAAK7F,YAGnC,EAEIoG,EAAclE,KAAKC,IAAI,EAAGyD,EAAOlG,OAASD,EAAKC,QAC/C2G,EAAY,GACPC,EAAI,EAAGA,EAAIF,EAAaE,IAC7BD,EAAUE,KAAK,IAAMD,GAKzB,GAFAP,EAAQS,SAAS,SAAU,oBAAsBH,EAAUI,KAAK,KAAO,4CAA/DD,CAA4GR,GAEhHJ,EAAOP,UAAW,CAClB,IAAIqB,EAAQ,WAAkB,EAC9BA,EAAMrB,UAAYO,EAAOP,UACzBU,EAAMV,UAAY,IAAIqB,EACtBA,EAAMrB,UAAY,IACtB,CAEA,OAAOU,CACX,C,+BCjDA,IAAIY,EAAiB,EAAQ,OAE7BlB,EAAOC,QAAUc,SAASnB,UAAUuB,MAAQD,C,+BCF5C,MAAME,EAAK,EAAQ,OACbC,EAAO,EAAQ,OACfC,EAA0B,UAAlBF,EAAGG,WAEXC,EAAQ,CAAE,IAAK,IAAK,IAAK,IAAK,IAAK,KACnCC,EAAS,+GACTC,EAAU,8BAShB,SAASC,EAAOC,GAAK,OAAEC,GAAS,GAAS,CAAC,GACxC,GAAY,KAARD,EAAY,OAAO,EACvB,IAAIE,EAAOC,EAAMF,EAASJ,EAASC,EAEnC,KAAQI,EAAQC,EAAIC,KAAKJ,IAAO,CAC9B,GAAIE,EAAM,GAAI,OAAO,EACrB,IAAIpE,EAAMoE,EAAMG,MAAQH,EAAM,GAAG7H,OAI7BiI,EAAOJ,EAAM,GACbK,EAAQD,EAAOV,EAAMU,GAAQ,KACjC,GAAIA,GAAQC,EAAO,CACjB,IAAIC,EAAIR,EAAIjE,QAAQwE,EAAOzE,IAChB,IAAP0E,IAAW1E,EAAM0E,EAAI,EAC3B,CAEAR,EAAMA,EAAIxH,MAAMsD,EAClB,CACA,OAAO,CACT,CA0DAsC,EAAOC,QAxBP,SAAoBoC,EAASlI,EAAO,CAAC,GACjC,IAEImI,EAFAC,EA1BR,SAAgBX,GAAK,OAAEC,GAAS,GAAU,CAAC,GACrCP,GAASM,EAAIY,SAAS,OACxBZ,EAAMA,EAAIa,MAAM,MAAMzB,KAAK,MAG1B,yBAAyB0B,KAAKd,KAAMA,GAAO,KAG/CA,GAAO,IAEP,GAAIA,EAAMP,EAAKsB,QAAQf,SAChBD,EAAOC,EAAK,CAACC,YAAY,8BAA8Ba,KAAKd,IAGnE,OAAOA,EAAIgB,QAAQ,4BAA6B,KACjD,CAWeC,CAAOR,EAASlI,GACvB2I,EAASnB,EAAOU,EAASlI,GAkB7B,MAfY,KAARoI,GACAD,EAAOD,EAAQU,OAAOR,EAAKtI,QACvBqI,EAAKU,WAAW,OAAMV,EAAOA,EAAKS,OAAO,KAE7CT,EAAOD,EAGNS,IACDP,EAAOlB,EAAKsB,QAAQN,GACpBC,EAAgB,MAATC,EAAeF,EAAQU,OAAOR,EAAKtI,QAAUoI,GAGpDC,EAAKU,WAAW,QAAOV,EAAOA,EAAKS,OAAO,IAC1CT,EAAKU,WAAW,OAAMV,EAAOA,EAAKS,OAAO,IAEtC,CAAER,OAAMD,OAAMQ,SACzB,C,YC5FA,MAAMxB,EAA6B,UAArB2B,QAAQ1B,SAChB2B,EAAM5B,EAAQ,QAAU,MACxB6B,EAAU7B,EAAQ,OAAS,IAG3B8B,EAAmB,SAASD,SAAeA,UAC3CE,EAAmB,MAAMF,OAwQ/BnD,EAAOC,QA3PP,SAAiBqC,GAAM,SAACgB,GAAW,EAAK,SAAEC,GAAW,EAAK,OAAE1B,GAAS,EAAK,SAAE2B,GAAW,EAAK,MAAEC,EAAQ,IAAM,CAAC,GACzG,IAAIC,EAAQ,GACRC,EAAU,GACVtC,EAAO,CAAEqC,MAAO,GAAIE,SAAU,IAI9BC,GAAU,EACVC,GAAU,EAGd,MAAMC,EAAM,GAGZ,SAAShG,EAAI6D,GAAK,MAACa,EAAK,KAAEuB,EAAI,KAAEC,GAAM,CAAC,GACtB,SAATA,IAAiBP,GAAS9B,GAC1B4B,GAAqB,UAATS,IACZ5C,EAAKqC,OAAkB,QAAR9B,EAAgBsB,EAAMtB,EACjCa,GACIuB,IAAML,GAAW/B,GACL,KAAZ+B,IACKF,EAAMjB,SAAS,OAAMmB,EAAU,IAAIA,MACxCtC,EAAKuC,SAAS9C,KAAK,IAAIoD,OAAOP,EAASF,KAE3CE,EAAU,IAEVA,GAAW/B,EAGvB,CAEA,IAAIuC,EAAG/B,EACP,IAAK,IAAIvB,EAAI,EAAGA,EAAIyB,EAAKrI,OAAQ4G,IAI7B,GAHAsD,EAAI7B,EAAKzB,GACTuB,EAAIE,EAAKzB,EAAI,GAET,CAAC,KAAM,IAAK,IAAK,IAAK,KAAK2B,SAAS2B,GACpCpG,EAAI,KAAKoG,UAIb,GAAU,MAANA,EAMJ,GAAU,MAANA,EASJ,GAAU,MAANA,EAiBJ,GAAU,MAANA,EASJ,GAAU,MAANA,EASJ,GAAU,MAANA,GAAab,GACH,MAANlB,EACA2B,EAAIjD,KAAKqD,QAKjB,GAAU,MAANA,EAmBJ,GAAU,MAANA,EAaJ,GAAU,MAANA,EAoBJ,GAAU,MAANA,EAUJ,GAAU,MAANA,EAUJ,GAAU,MAANA,EAUJ,GAAU,MAANA,EASJ,GAAU,MAANA,EAqCJpG,EAAIoG,OArCJ,CACI,GAAU,MAAN/B,GAAakB,EAAU,CACvBS,EAAIjD,KAAKqD,GACT,QACJ,CAGA,IAAIC,EAAW9B,EAAKzB,EAAI,GACpBwD,EAAY,EAChB,KAAuB,MAAhB/B,EAAKzB,EAAI,IACZwD,IACAxD,IAEJ,IAAIyD,EAAWhC,EAAKzB,EAAI,GACnB0C,IAMGc,EAAY,IACE,MAAbD,QAAiC5H,IAAb4H,GACP,MAAbE,QAAiC9H,IAAb8H,GAQrBvG,EA1OH,UA0OiB,CAACkG,KAAK,UACpBlG,EAAIsF,EAAkB,CAACY,KAAK,WAN5BlG,EAtOH,sBAsOiB,CAACkG,KAAK,UACpBlG,EAAIqF,EAAkB,CAACa,KAAK,OAAQD,MAAK,EAAMvB,OAAM,IACrD5B,KAXJ9C,EAAI,KAmBZ,KA5CA,CACI,GAAI8F,EAAS,CACT9F,EAAI,KACJ,QACJ,CACAA,EAAI,KAAKoG,IAEb,KAjBA,CACI,GAAIb,EAAU,CACVO,GAAU,EACV9F,EAAI,KACJ,QACJ,CACAA,EAAI,KAAKoG,IAEb,KAlBA,CACI,GAAIb,EAAU,CACVO,GAAU,EACV9F,EAAI,KACJ,QACJ,CACAA,EAAI,KAAKoG,IAEb,KAlBA,CACI,GAAIb,EAAU,CACVQ,GAAU,EACV/F,EAAIoG,GACJ,QACJ,CACApG,EAAI,KAAKoG,IAEb,KA5BA,CACI,GAAIL,GAAiB,MAAN1B,EAAW,CACtBvB,IACA,IAAIvF,EAAQ,GACZ,KAAoB,MAAdgH,IAAOzB,IAAYvF,GAASgH,EAAKzB,GACzB,UAAVvF,EAAmByC,EAAI,aACR,UAAVzC,EAAmByC,EAAI,OACb,UAAVzC,GAAmByC,EAAI,OAChC8C,IACA,QACJ,CACA,GAAIyC,EAAU,CACVQ,GAAU,EACV/F,EAAIoG,GACJ,QACJ,CACApG,EAAI,KAAKoG,IAEb,KA/BA,CACI,GAAIb,EAAU,CACA,MAANlB,EACA2B,EAAIjD,KAAKqD,GAETpG,EAAI,KAER,QACJ,CACAA,EAAI,KAAKoG,IAEb,KA9BA,CACI,GAAIb,EAAU,CACV,GAAIQ,EAAS,CACT/F,EAAI,KACJ,QACJ,CACA,GAAU,MAANqE,EAAW,CACX2B,EAAIjD,KAAKqD,GACTpG,EAAI,OACJ8C,IACA,QACJ,CACA9C,EAAI,KAAKoG,KACT,QACJ,CACApG,EAAI,KAAKoG,IAEb,KAjCA,CACI,GAAU,MAAN/B,GAAakB,EAAU,CACvBS,EAAIjD,KAAKqD,GACT,QACJ,CACApG,EAAI,KAAKoG,IAEb,KAhBA,CACI,GAAIJ,EAAI9J,OAAQ,CACZ8D,EAAIoG,GACJ,QACJ,CACApG,EAAI,KAAKoG,IAEb,KAxBA,CACI,GAAIJ,EAAI9J,OAAQ,CACZ8D,EAAIoG,GACJ,IAAII,EAAOR,EAAIS,MAEXzG,EADS,MAATwG,EACI,MACY,MAATA,EACH,UAEAA,GAER,QACJ,CACAxG,EAAI,KAAKoG,IAEb,KAxBA,CACI,GAAIJ,EAAI9J,OAAQ,CACZ8D,EAAIoG,GACJ,QACJ,CACApG,EAAI,KAAKoG,IAEb,MAZIpG,EAAI,KAAKoG,IAAK,CAAC1B,OAAO,IACZ,MAANL,GAAcP,IAAQ6B,GAAS,KA6LtCD,EAAMjB,SAAS,OAChBkB,EAAQ,IAAIA,KACZC,EAAU,IAAIA,KACVH,IAAUnC,EAAKqC,MAAQ,IAAIrC,EAAKqC,WAGxC,MAAMlD,EAAS,CAACkD,MAAO,IAAIQ,OAAOR,EAAOD,IAUzC,OAPID,IACAnC,EAAKuC,SAAS9C,KAAK,IAAIoD,OAAOP,EAASF,IACvCpC,EAAKqC,MAAQ,IAAIQ,OAAO7C,EAAKqC,MAAOD,GACpCpC,EAAKkC,SAAW,IAAIW,OAAQT,EAAMjB,SAAS,KAAiCY,EAA1B,IAAIA,KAAwCK,GAC9FjD,EAAOa,KAAOA,GAGXb,CACX,C,+BC1QA,IAAIW,EAAO,EAAQ,OAEnBnB,EAAOC,QAAUkB,EAAKf,KAAKW,SAASX,KAAMzB,OAAOiB,UAAU6E,e,+BCF3D,MAAMC,EAAM,EAAQ,OAEdC,EAAWC,IACf,IACE,OAAO,IAAIF,EAAIG,IAAID,EAGrB,CAFE,MAEF,GAGIE,EAAoB,CAAClD,EAAKmD,EAAMC,KACpC,MAAMC,EAAgBrD,EAAIjE,QAAQqH,GAClC,OAAOpD,EAAIsD,YAAYH,EAAME,GAAiB,EAAIA,EAAgBE,IAAQ,EA6F5EnF,EAAOC,QAAU,CAACmF,EAAQjL,GAAQkL,WAAUC,gBAC1C,IAAKF,EACH,OAGF,MAAMG,EArEkB,CAACC,IAQzB,MAAMC,EAAYD,EAAI7H,QAAQ,KACxB+H,EAAaF,EAAI7H,QAAQ,KACzBgI,EAAcH,EAAI7H,QAAQ,IAAK+H,EAAa,GAC5CE,EAAaJ,EAAI7H,QAAQ,KACzBkI,EAAa,KAAK7D,KAAKwD,GACvBM,EAAUN,EAAI7H,QAAQ,KAEtBoI,GAAsBF,GAAeJ,GAAa,GAAKI,EAAW5D,MAAQwD,EAC1EO,GAA+B,IAAbF,GAAmBL,GAAa,GAAKK,EAAUL,EACjEQ,GAAqC,IAAhBL,GAAsBH,GAAa,GAAKG,EAAaH,EAC1ES,GAA4C,IAAjBP,GAAuBF,GAAa,GAAKE,EAAcF,EAClFU,EAAWT,EAAa,EAGxBU,EAAsBX,GAAa,EAA2B,MAAvBD,EAAIC,EAAY,IAAcD,EAAIa,SAAS,KAClFC,GAAuBd,EAAIxC,WAAW,KAE5C,OAAO+C,GAAsBI,GAAYC,GACvCE,GAAuBN,GAAmBC,GAC1CC,GA0CmBK,CAAkBnB,GACnC,UAAUA,IA/FQ,EAACI,EAAKF,KAC5B,MAAMM,EAAaJ,EAAI7H,QAAQ,KACzB6I,EAAQhB,EAAIpL,MAAM,EAAGwL,EAAa,GACxC,GAAIjH,OAAOiB,UAAU6E,eAAerE,KAAKkF,EAAWkB,GAClD,OAAOhB,EAGT,MAAMM,EAAUN,EAAI7H,QAAQ,KAC5B,OAAImI,GAAW,EACTA,EAAUF,EACL,aAAaJ,IAEbA,EAISA,EAAI7H,QAAQ,QACZiI,EAAa,EACxBJ,EAGF,GAAGA,EAAIpL,MAAM,EAAGwL,EAAa,OAAOJ,EAAIpL,MAAMwL,EAAa,IAAE,EA2EhEa,CAAgBrB,EAAQE,GACtB5K,EAASiK,EAAQY,IAAiBZ,EAzCvB,CAACS,IAGlB,MAAMU,EAAUhB,EAAkBM,EAAQ,IAAK,KAGzCsB,EAAsB5B,EAAkBM,EAAQ,IAAK,KAwB3D,OAtBIsB,EAAsBZ,IAWxBV,EAASA,EAAOhL,MAAM,EAAGsM,GAAuB,IAAMtB,EAAOhL,MAAMsM,EAAsB,KAG9C,IAAzC5B,EAAkBM,EAAQ,IAAK,OAAyC,IAA1BA,EAAOzH,QAAQ,QAK/DyH,EAAS,aAAaA,KAGjBA,GAWyCuB,CAAWpB,IAC3D,IAAK7K,EACH,OAGF,MAAMkM,EAAkBvB,EAASwB,WAAWnM,EAAOoM,UAC7CC,EAAgB1B,EAAS2B,SAAStM,EAAOuM,SAASjE,WAAW,QAC/DtI,EAAOuM,SAAS7M,MAAM,GACtBM,EAAOuM,UACLC,EAAcN,GAAmBG,EACvC,IAAKG,EACH,OAGF,MAAMC,EAAc9B,EAASuB,GAAmBG,GAChD,IAAIK,EAAO,KACP9B,EAAU5K,EAAOoM,WAAWM,OAAS1M,EAAO2M,UAAY3M,EAAO4M,YACjEF,EAAO,GAAG1M,EAAO2M,WAAW3M,EAAO4M,SAAW,IAAM5M,EAAO4M,SAAW,MAGxE,IAAIC,EAAa,KACbC,EAAO,KACPC,EAAU,KACVC,EAAwB,KAE5B,IACE,GAAId,EAAiB,CACnB,IAAIe,EAAWjN,EAAOiN,SAAS3E,WAAW,KAAOtI,EAAOiN,SAASvN,MAAM,GAAKM,EAAOiN,SACnF,MAAM7B,EAAU6B,EAAShK,QAAQ,KAE7BmI,GAAW,IACb6B,EAAWA,EAASvN,MAAM0L,EAAU,IAGtC,MAAM8B,EAAYD,EAASzC,YAAY,KACnC0C,GAAa,GACfJ,EAAOK,mBAAmBF,EAASvN,MAAM,EAAGwN,IAEvCJ,IACHA,EAAO,MAETC,EAAUI,mBAAmBF,EAASvN,MAAMwN,EAAY,KAExDH,EAAUI,mBAAmBF,GAG3BF,EAAQpB,SAAS,UACnBoB,EAAUA,EAAQrN,MAAM,GAAI,IAG1BM,EAAOoN,OACTP,EAAaM,mBAAmBnN,EAAOoN,KAAK1N,MAAM,KAGpDsN,EAAwB,UAC1B,KAAO,CACL,IAAKP,EAAY7B,UAAU9C,SAAS9H,EAAOoM,UACzC,OAGF,MAAMlD,EAAWuD,EAAYY,QAAQrN,GACrC,IAAKkJ,EACH,OAGF4D,EAAO5D,EAAS4D,MAAQK,mBAAmBjE,EAAS4D,MACpDC,EAAUI,mBAAmBjE,EAAS6D,SACtCF,EAAaM,mBAAmBjE,EAAS2D,YACzCG,EAAwBpC,EAAU5K,EAAOoM,WAAWkB,MAAQtN,EAAOoM,SAAS1M,MAAM,GAAI,EACxF,CAQF,CAPE,MAAO6N,GAEP,GAAIA,aAAeC,SACjB,OAEA,MAAMD,CAEV,CAEA,MAAO,CAACf,EAAaM,EAAMJ,EAAMK,EAASF,EAAYG,EAAuBvN,EAAI,C,yBC9LnF,MAAMgO,EAAY,IAAInO,IAASA,EAAKoO,OAAM5C,GAAOA,IAAOxL,EAAKgH,KAAK,IAAM,GAClEqH,EAAe7C,GAAQA,EAAM8C,mBAAmB9C,GAAO,GACvD+C,EAAsBC,GAAMA,EAAEC,cAAc7F,QAAQ,gBAAiB,IAAIA,QAAQ,OAAQ,KAEzF8F,EAAW,CACfC,YAAa,EAAGC,SAAQpB,OAAMC,UAASF,gBACrC,OAAOqB,KAAUpB,KAAQC,QAAcU,EAAU,IAAKZ,KACxDsB,eAAgB,EAAGD,SAAQpB,OAAMC,UAASF,gBACxC,iBAAiBqB,KAAUpB,KAAQC,QAAcU,EAAU,IAAKZ,KAClEuB,aAAc,EAAGF,SAAQpB,OAAMC,UAASF,aAAYwB,WAAU1H,UAC5D,WAAWuH,KAAUpB,KAAQC,IAAUU,EAAU,IAAKY,EAAU,IAAKV,EAAYd,GAAc,QAAS,IAAKlG,KAC/G2H,eAAgB,EAAGJ,SAAQpB,OAAMC,UAASF,aAAY0B,cACpD,WAAWL,KAAUpB,KAAQC,IAAUU,EAAU,IAAKc,EAAU,IAAKZ,EAAYd,MACnF2B,mBAAoB,EAAGN,SAAQpB,OAAMC,UAASF,aAAY0B,WAAU5H,OAAM8H,WAAUC,gBAClF,WAAWR,KAAUpB,KAAQC,KAAWwB,KAAYZ,EAAYd,GAAc,WAAWlG,IAAO8G,EAAU,IAAKiB,EAAWD,GAAY,OACxIE,mBAAoB,EAAGT,SAAQpB,OAAMC,UAASF,aAAY+B,WAAUjI,OAAM8H,WAAUC,gBAClF,WAAWR,KAAUpB,KAAQC,KAAW6B,KAAYjB,EAAYd,GAAc,WAAWlG,IAAO8G,EAAU,IAAKiB,EAAWD,GAAY,OACxII,aAAc,EAAGX,SAAQpB,OAAMC,UAASwB,WAAU1B,gBAChD,WAAWqB,KAAUpB,KAAQC,IAAUU,EAAU,IAAKc,EAAU,IAAKZ,EAAYd,aACnFiC,cAAe,EAAGpC,OAAMwB,SAAQpB,OAAMC,UAASF,gBAC7C,eAAeY,EAAUf,EAAM,OAAOwB,KAAUpB,KAAQC,QAAcU,EAAU,IAAKZ,KACvFkC,aAAc,EAAGb,SAAQpB,OAAMC,UAASF,aAAYlG,UAClD,WAAWuH,KAAUpB,KAAQC,SAAeY,EAAYd,GAAc,WAAWlG,IACnFqI,iBAAkB,EAAGnF,OAAMiD,OAAMC,UAASF,gBACxC,GAAGhD,KAAQiD,KAAQC,IAAUU,EAAU,IAAKZ,KAC9CoC,aAAc,EAAGnC,OAAMC,UAASF,gBAC9B,GAAGC,KAAQC,IAAUU,EAAU,IAAKZ,KACtCqC,aAAc,EAAGhB,SAAQpB,OAAMC,aAC7B,WAAWmB,KAAUpB,KAAQC,WAC/B2B,WAAYb,GAGRsB,EAAQ,CAAC,EACfA,EAAMC,OAAS,CAGbxE,UAAW,CAAC,OAAQ,QAAS,WAAY,aAAc,OAAQ,UAC/DsD,OAAQ,aACRK,SAAU,OACVK,SAAU,OACVP,SAAU,OACVU,aAAc,EAAGrC,OAAMI,OAAMC,UAASF,aAAYlG,UAChD,WAAW8G,EAAUf,EAAM,iCAAiCI,KAAQC,KAAWY,EAAYd,GAAc,WAAWlG,IACtH0I,YAAa,EAAG3C,OAAMwB,SAAQpB,OAAMC,UAASF,gBAC3C,SAASY,EAAUf,EAAM,OAAOwB,KAAUpB,KAAQC,QAAcU,EAAU,IAAKZ,KACjFyC,gBAAiB,EAAGpB,SAAQpB,OAAMC,UAASF,gBACzC,oBAAoBqB,KAAUpB,KAAQC,YAAkBY,EAAYd,GAAc,UACpFQ,QAAUrD,IACR,IAAK,CAAE8C,EAAMC,EAASlD,EAAMgD,GAAc7C,EAAIiD,SAASlF,MAAM,IAAK,GAClE,KAAI8B,GAAiB,SAATA,KAIPA,IACHgD,EAAa7C,EAAIoD,KAAK1N,MAAM,IAG1BqN,GAAWA,EAAQpB,SAAS,UAC9BoB,EAAUA,EAAQrN,MAAM,GAAI,IAGzBoN,GAASC,GAId,MAAO,CAAED,OAAMC,UAASF,aAAW,GAIvCsC,EAAMI,UAAY,CAChB3E,UAAW,CAAC,WAAY,aAAc,OAAQ,UAC9CsD,OAAQ,gBACRK,SAAU,MACVK,SAAU,MACVP,SAAU,aACVD,aAAc,EAAGF,SAAQpB,OAAMC,UAASF,aAAY0B,WAAU5H,OAAM0H,cAClE,WAAWH,KAAUpB,KAAQC,IAAUU,EAAU,IAAKc,EAAU,IAAKZ,EAAYd,GAAc,QAAS,IAAKlG,EAAM0H,KACrHiB,gBAAiB,EAAGpB,SAAQpB,OAAMC,UAASF,gBACzC,WAAWqB,KAAUpB,KAAQC,SAAeY,EAAYd,GAAc,iBACxEQ,QAAUrD,IACR,IAAK,CAAE8C,EAAMC,EAASyC,GAAOxF,EAAIiD,SAASlF,MAAM,IAAK,GACrD,IAAI,CAAC,OAAOD,SAAS0H,KAIjBzC,GAAWA,EAAQpB,SAAS,UAC9BoB,EAAUA,EAAQrN,MAAM,GAAI,IAGzBoN,GAASC,GAId,MAAO,CAAED,OAAMC,UAASF,WAAY7C,EAAIoD,KAAK1N,MAAM,GAAG,GAI1DyP,EAAMM,OAAS,CACb7E,UAAW,CAAC,WAAY,aAAc,OAAQ,UAC9CsD,OAAQ,aACRK,SAAU,OACVK,SAAU,OACVP,SAAU,SACVS,cAAe,EAAGpC,OAAMwB,SAAQpB,OAAMC,UAASF,gBAC7C,eAAeY,EAAUf,EAAM,OAAOwB,KAAUpB,KAAQC,QAAcU,EAAU,IAAKZ,KACvFyC,gBAAiB,EAAGpB,SAAQpB,OAAMC,UAASF,gBACzC,WAAWqB,KAAUpB,KAAQC,mCAAyCY,EAAYd,GAAc,UAClGQ,QAAUrD,IACR,MAAMrD,EAAOqD,EAAIiD,SAASvN,MAAM,GAChC,GAAIiH,EAAKmB,SAAS,QAAUnB,EAAKmB,SAAS,mBACxC,OAGF,MAAMoB,EAAWvC,EAAKoB,MAAM,KAC5B,IAAIgF,EAAU7D,EAASY,MACnBiD,EAAQpB,SAAS,UACnBoB,EAAUA,EAAQrN,MAAM,GAAI,IAG9B,MAAMoN,EAAO5D,EAAS5C,KAAK,KAC3B,OAAKwG,GAASC,EAIP,CAAED,OAAMC,UAASF,WAAY7C,EAAIoD,KAAK1N,MAAM,SAJnD,CAIsD,GAI1DyP,EAAMO,KAAO,CACX9E,UAAW,CAAC,OAAQ,WAAY,aAAc,OAAQ,UACtDsD,OAAQ,kBACRG,SAAU,OACVJ,YAAa,EAAGC,SAAQnB,UAASF,gBAC/B,OAAOqB,KAAUnB,QAAcU,EAAU,IAAKZ,KAChDsB,eAAgB,EAAGD,SAAQnB,UAASF,gBAClC,iBAAiBqB,KAAUnB,QAAcU,EAAU,IAAKZ,KAC1DuB,aAAc,EAAGF,SAAQpB,OAAMC,UAASF,aAAYwB,cAClD,WAAWH,KAAUpB,KAAQC,IAAUU,EAAU,IAAKE,EAAYd,OAAgBwB,IACpFC,eAAgB,EAAGJ,SAAQnB,UAASF,gBAClC,WAAWqB,KAAUnB,IAAUU,EAAU,IAAKE,EAAYd,MAC5D2B,mBAAoB,EAAGN,SAAQnB,UAASF,aAAYlG,OAAM+H,gBACxD,WAAWR,KAAUnB,IAAUU,EAAU,IAAKE,EAAYd,MAAeY,EAAU,IAAKiB,EAAW/H,MACrGgI,mBAAoB,EAAGT,SAAQnB,UAASF,aAAYlG,OAAM+H,gBACxD,WAAWR,KAAUnB,IAAUU,EAAU,IAAKE,EAAYd,MAAeY,EAAU,IAAKiB,EAAW/H,MACrGkI,aAAc,EAAGX,SAAQnB,UAASF,gBAChC,WAAWqB,KAAUnB,IAAUU,EAAU,IAAKE,EAAYd,MAC5DiC,cAAe,EAAGZ,SAAQnB,UAASF,gBACjC,eAAeqB,KAAUnB,QAAcU,EAAU,IAAKZ,KACxDkC,aAAc,EAAGjC,OAAMC,UAASF,aAAYlG,UAC1C,sCAAsCmG,KAAQC,QAAcU,EAAU,IAAKE,EAAYd,OAAgBlG,IACzGqI,iBAAkB,EAAGnF,OAAMkD,UAASF,gBAClC,GAAGhD,KAAQkD,IAAUU,EAAU,IAAKZ,KACtCoC,aAAc,EAAGlC,UAASF,gBACxB,GAAGE,IAAUU,EAAU,IAAKZ,KAC9BqC,aAAc,EAAGhB,SAAQnB,aACvB,WAAWmB,KAAUnB,IACvBsC,YAAa,EAAGnB,SAAQnB,UAASF,gBAC/B,SAASqB,KAAUnB,QAAcU,EAAU,IAAKZ,KAClDyC,gBAAiB,EAAGvC,UAASF,gBAC3B,oCAAoCE,YAAkBY,EAAYd,GAAc,UAClFQ,QAAUrD,IACR,IAAK,CAAE8C,EAAMC,EAASyC,GAAOxF,EAAIiD,SAASlF,MAAM,IAAK,GACrD,GAAY,QAARyH,EAAJ,CAIA,IAAKzC,EAAS,CACZ,IAAKD,EACH,OAGFC,EAAUD,EACVA,EAAO,IACT,CAMA,OAJIC,EAAQpB,SAAS,UACnBoB,EAAUA,EAAQrN,MAAM,GAAI,IAGvB,CAAEoN,OAAMC,UAASF,WAAY7C,EAAIoD,KAAK1N,MAAM,GAfnD,CAesD,EAExDgP,WAAY,SAAUD,GACpB,OAAOA,GAAY,QAAUZ,EAAmBY,EAClD,GAGFU,EAAMQ,UAAY,CAChB/E,UAAW,CAAC,WAAY,UACxBsD,OAAQ,YACRK,SAAU,OACVK,SAAU,OACVG,aAAc,EAAGb,SAAQpB,OAAMC,UAASF,aAAYlG,UAClD,WAAWuH,KAAUpB,KAAQC,UAAgBY,EAAYd,IAAe,UAAUlG,IACpFmI,cAAe,EAAGZ,SAAQpB,OAAMC,UAASF,gBACvC,WAAWqB,KAAUpB,KAAQC,QAAcU,EAAU,IAAKZ,KAC5DyC,gBAAiB,EAAGpB,SAAQpB,OAAMC,UAASF,gBACzC,WAAWqB,KAAUpB,KAAQC,aAAmBY,EAAYd,IAAe,gBAC7EqC,aAAc,EAAGpC,OAAMC,aACrB,sBAAsBD,KAAQC,IAChCM,QAAUrD,IACR,IAAK,CAAE8C,EAAMC,EAASyC,GAAOxF,EAAIiD,SAASlF,MAAM,IAAK,GAGrD,IAAI,CAAC,WAAWD,SAAS0H,KAIrBzC,GAAWA,EAAQpB,SAAS,UAC9BoB,EAAUA,EAAQrN,MAAM,GAAI,IAGzBoN,GAASC,GAId,MAAO,CAAED,OAAMC,UAASF,WAAY7C,EAAIoD,KAAK1N,MAAM,GAAG,GAI1D,IAAK,MAAO4N,EAAMsC,KAAS3L,OAAOC,QAAQiL,GACxCA,EAAM7B,GAAQrJ,OAAO4L,OAAO,CAAC,EAAG7B,EAAU4B,GAG5CtK,EAAOC,QAAU4J,C,+BCjOjB,MAAMW,EAAM,EAAQ,OACdX,EAAQ,EAAQ,OAChBY,EAAU,EAAQ,OAElBrO,EAAQ,IAAIoO,EAAI,CAAE9N,IAAK,MAE7B,MAAMgO,EACJnM,YAAagG,EAAMiD,EAAMJ,EAAMK,EAASF,EAAYG,EAAuBvN,EAAO,CAAC,GACjFwE,OAAO4L,OAAOtP,KAAMyP,GAAQ,EAAUnG,GAAO,CAC3CA,OACAiD,OACAJ,OACAK,UACAF,aACAoD,QAASjD,EACTvN,QAEJ,CAEAyQ,SAAmB,CAAE/D,WAAY,CAAC,EAAGG,SAAU,CAAC,GAChD4D,SAAoB,CAClB,WAAY,CAAE5C,KAAM,UACpB,OAAQ,CAAEA,KAAM,UAChB,aAAc,CAAEA,KAAM,QAASZ,MAAM,GACrC,OAAQ,CAAEA,MAAM,GAChB,QAAS,CAAEA,MAAM,GACjB,SAAU,CAAEA,MAAM,GAClB,YAAa,CAAEA,MAAM,IAGvBwD,eAAgB5C,EAAMsC,GACpBI,GAAQ,EAAU1C,GAAQsC,EAC1BI,GAAQ,EAAU1D,SAASsD,EAAK1B,QAAUZ,EAC1C0C,GAAQ,EAAU7D,WAAW,GAAGmB,MAAWA,EAC3C0C,GAAQ,EAAW,GAAG1C,MAAW,CAAEA,OACrC,CAEA4C,eAAgBxF,EAAQjL,GACtB,GAAsB,iBAAXiL,EACT,OAGF,MAAM9H,EAAM8H,EAASyF,KAAKC,UAAU3Q,GAAQ,CAAC,GAE7C,IAAKiC,EAAM2O,IAAIzN,GAAM,CACnB,MAAM0N,EAAWP,EAAQrF,EAAQjL,EAAM,CACrCkL,SAAUqF,GAAQ,EAClBpF,UAAWoF,GAAQ,IAErBtO,EAAMQ,IAAIU,EAAK0N,EAAW,IAAIN,KAAWM,QAAYxO,EACvD,CAEA,OAAOJ,EAAME,IAAIgB,EACnB,CAEA,GAAO2N,EAAU9Q,GACf,GAAwB,mBAAb8Q,EACT,OAAO,KAGT,MAAMC,EAAU,IAAKjQ,QAASA,KAAKd,QAASA,GAGvC+Q,EAAQ7J,OACX6J,EAAQ7J,KAAO,IAIb6J,EAAQ7J,KAAK2B,WAAW,OAC1BkI,EAAQ7J,KAAO6J,EAAQ7J,KAAKjH,MAAM,IAGhC8Q,EAAQC,eACVD,EAAQ3D,WAAa,MAGvB,MAAM/G,EAASyK,EAASC,GACxB,OAAOA,EAAQE,WAAa5K,EAAOwC,WAAW,QAAUxC,EAAOpG,MAAM,GAAKoG,CAC5E,CAEAsH,OACE,OAAO7M,KAAKsM,WAAa,IAAItM,KAAKsM,aAAe,EACnD,CAEA8D,IAAKlR,GACH,OAAOc,MAAK,EAAMA,KAAK0N,YAAaxO,EACtC,CAEAmR,OAAQnR,GACN,OAAOc,MAAK,EAAMA,KAAK4N,eAAgB1O,EACzC,CAEAoR,OAAQlK,KAASrH,GAEf,MAAoB,iBAATqH,EACFpG,MAAK,EAAMA,KAAK+N,eAAgB3H,GAGlB,iBAAZrH,EAAK,GACPiB,MAAK,EAAMA,KAAKiO,mBAAoB,IAAKlP,EAAK,GAAIqH,SAGpDpG,MAAK,EAAMA,KAAKiO,mBAAoB,IAAKlP,EAAK,GAAImP,SAAUnP,EAAK,GAAIqH,QAC9E,CAOAmK,WAAYnK,KAASrH,GACnB,MAAuB,iBAAZA,EAAK,GACPiB,MAAK,EAAMA,KAAKoO,mBAAoB,IAAKrP,EAAK,GAAIqH,SAGpDpG,MAAK,EAAMA,KAAKoO,mBAAoB,IAAKrP,EAAK,GAAImP,SAAUnP,EAAK,GAAIqH,QAC9E,CAEAoK,KAAMtR,GACJ,OAAOc,MAAK,EAAMA,KAAKsO,aAAcpP,EACvC,CAEAuR,KAAMvR,GACJ,OAAOc,MAAK,EAAMA,KAAK2O,aAAczP,EACvC,CAEAwR,MAAOxR,GACL,OAAOc,MAAK,EAAMA,KAAKuO,cAAerP,EACxC,CAEAyR,IAAKzR,GACH,OAAOc,MAAK,EAAMA,KAAK8O,YAAa5P,EACtC,CAEA0R,SAAU1R,GACR,OAAOc,MAAK,EAAMA,KAAKyO,iBAAkBvP,EAC3C,CAEAkH,KAAMlH,GACJ,OAAOc,MAAK,EAAMA,KAAK0O,aAAcxP,EACvC,CAEA2R,QAAS3R,GACP,OAAOc,MAAK,EAAMA,KAAK+O,gBAAiB,IAAK7P,EAAMgR,cAAc,GACnE,CAEAY,KAAM1K,EAAMlH,GACV,OAAOc,MAAK,EAAMA,KAAKwO,aAAc,IAAKtP,EAAMkH,QAClD,CAEA2K,KAAM3K,EAAMlH,GACV,OAAOc,MAAK,EAAMA,KAAK6N,aAAc,IAAK3O,EAAMkH,QAClD,CAEA4K,2BACE,OAAOhR,KAAK0P,OACd,CAEA7K,SAAU3F,GACR,OAAIc,KAAK0P,SAAyC,mBAAvB1P,KAAKA,KAAK0P,SAC5B1P,KAAKA,KAAK0P,SAASxQ,GAGrBc,KAAKqQ,OAAOnR,EACrB,EAGF,IAAK,MAAO6N,EAAMsC,KAAS3L,OAAOC,QAAQiL,GACxCa,EAAQwB,QAAQlE,EAAMsC,GAGxBtK,EAAOC,QAAUyK,C,+BC3KjB,IAAIK,EAAM,EAAQ,OAElB,SAASoB,EAAkBC,EAASC,GAMnC,IALA,IAAIC,EAAYF,EAAQ3J,MAAM,KAC1B8J,EAAQF,EAAU5J,MAAM,KACxB+J,EAAKD,EAAMtS,OAAS,EAAIsS,EAAM,GAAK,IACnCE,GAAgBF,EAAMtS,OAAS,EAAIsS,EAAM,GAAKA,EAAM,IAAI9J,MAAM,KAEzD5B,EAAI,EAAGA,EAAI,IAAKA,EAAG,CAC3B,IAAI6L,EAAMC,SAASL,EAAUzL,IAAM,EAAG,IAClC+L,EAAMD,SAASF,EAAa5L,IAAM,EAAG,IACzC,GAAI6L,IAAQE,EAGZ,MAAW,MAAPJ,EACIE,EAAME,EAEH,OAAPJ,GACIE,GAAOE,CAGhB,CACA,MAAc,OAAPJ,CACR,CAEA,SAASK,EAAaT,EAASU,GAC9B,IAAIC,EAAaD,EAAMrK,MAAM,UAC7B,GAA0B,IAAtBsK,EAAW9S,OACd,OAAO,EAER,IAAK,IAAI4G,EAAI,EAAGA,EAAIkM,EAAW9S,SAAU4G,EACxC,IAAKsL,EAAkBC,EAASW,EAAWlM,IAC1C,OAAO,EAGT,OAAO,CACR,CA0BA,IAAIzD,EAAO,EAAQ,OAEnB4C,EAAOC,QAAU,SAAgB+M,EAAGC,GACnC,OAAOlC,EAAI3N,EAAM4P,IA3BlB,SAAyBC,EAAaC,GACrC,GAA8B,kBAAnBA,EACV,OAAOA,EAGR,IAAId,OAAiC,IAAhBa,EAClBhK,QAAQkK,UAAYlK,QAAQkK,SAASC,KACrCH,EAEH,GAAuB,iBAAZb,EACV,MAAM,IAAI/L,eAAiC,IAAhB4M,EAA8B,2CAA6C,iDAGvG,GAAIC,GAA4C,iBAAnBA,EAA6B,CACzD,IAAK,IAAIrM,EAAI,EAAGA,EAAIqM,EAAejT,SAAU4G,EAC5C,GAAIgM,EAAaT,EAASc,EAAerM,IACxC,OAAO,EAGT,OAAO,CACR,CACA,OAAOgM,EAAaT,EAASc,EAC9B,CAKwBG,CAAgBJ,EAAa7P,EAAK4P,GAC1D,C,+BCjEA,MAAMM,EAAU,EAAQ,OAElBC,EAAM/R,OAAO,OACbgS,EAAShS,OAAO,UAChBiS,EAAoBjS,OAAO,oBAC3BkS,EAAclS,OAAO,cACrBmS,EAAUnS,OAAO,UACjBoS,EAAUpS,OAAO,WACjBqS,EAAoBrS,OAAO,kBAC3BsS,EAAWtS,OAAO,WAClBuS,EAAQvS,OAAO,SACfwS,EAAoBxS,OAAO,kBAE3ByS,EAAc,IAAM,EAkPpB3R,EAAM,CAAC4R,EAAM5Q,EAAK6Q,KACtB,MAAMf,EAAOc,EAAKH,GAAOzR,IAAIgB,GAC7B,GAAI8P,EAAM,CACR,MAAMgB,EAAMhB,EAAK9R,MACjB,GAAI+S,EAAQH,EAAME,IAEhB,GADAE,EAAIJ,EAAMd,IACLc,EAAKR,GACR,YAEES,IACED,EAAKF,KACPZ,EAAK9R,MAAMiT,IAAMC,KAAKD,OACxBL,EAAKJ,GAAUW,YAAYrB,IAG/B,OAAOgB,EAAI9S,KACb,GAGI+S,EAAU,CAACH,EAAME,KACrB,IAAKA,IAASA,EAAIM,SAAWR,EAAKP,GAChC,OAAO,EAET,MAAMgB,EAAOH,KAAKD,MAAQH,EAAIG,IAC9B,OAAOH,EAAIM,OAASC,EAAOP,EAAIM,OAC3BR,EAAKP,IAAagB,EAAOT,EAAKP,EAAQ,EAGtCiB,EAAOV,IACX,GAAIA,EAAKV,GAAUU,EAAKX,GACtB,IAAK,IAAIsB,EAASX,EAAKJ,GAAUgB,KAC/BZ,EAAKV,GAAUU,EAAKX,IAAmB,OAAXsB,GAAkB,CAI9C,MAAME,EAAOF,EAAOE,KACpBT,EAAIJ,EAAMW,GACVA,EAASE,CACX,CACF,EAGIT,EAAM,CAACJ,EAAMd,KACjB,GAAIA,EAAM,CACR,MAAMgB,EAAMhB,EAAK9R,MACb4S,EAAKN,IACPM,EAAKN,GAASQ,EAAI9Q,IAAK8Q,EAAI9S,OAE7B4S,EAAKV,IAAWY,EAAInU,OACpBiU,EAAKH,GAAO/P,OAAOoQ,EAAI9Q,KACvB4Q,EAAKJ,GAAUkB,WAAW5B,EAC5B,GAGF,MAAM6B,EACJ1Q,YAAajB,EAAKhC,EAAOrB,EAAQsU,EAAKG,GACpCzT,KAAKqC,IAAMA,EACXrC,KAAKK,MAAQA,EACbL,KAAKhB,OAASA,EACdgB,KAAKsT,IAAMA,EACXtT,KAAKyT,OAASA,GAAU,CAC1B,EAGF,MAAMQ,EAAc,CAAChB,EAAM1O,EAAI4N,EAAM+B,KACnC,IAAIf,EAAMhB,EAAK9R,MACX+S,EAAQH,EAAME,KAChBE,EAAIJ,EAAMd,GACLc,EAAKR,KACRU,OAAM5R,IAEN4R,GACF5O,EAAGY,KAAK+O,EAAOf,EAAI9S,MAAO8S,EAAI9Q,IAAK4Q,EAAI,EAG3ClO,EAAOC,QAnTP,MACE1B,YAAa2M,GAOX,GANuB,iBAAZA,IACTA,EAAU,CAAExO,IAAKwO,IAEdA,IACHA,EAAU,CAAC,GAETA,EAAQxO,MAA+B,iBAAhBwO,EAAQxO,KAAoBwO,EAAQxO,IAAM,GACnE,MAAM,IAAI2D,UAAU,qCAEVpF,KAAKsS,GAAOrC,EAAQxO,KAAOyI,IAAvC,MAEMiK,EAAKlE,EAAQjR,QAAUgU,EAG7B,GAFAhT,KAAKwS,GAAoC,mBAAP2B,EAAqBnB,EAAcmB,EACrEnU,KAAKyS,GAAexC,EAAQmE,QAAS,EACjCnE,EAAQwD,QAAoC,iBAAnBxD,EAAQwD,OACnC,MAAM,IAAIrO,UAAU,2BACtBpF,KAAK0S,GAAWzC,EAAQwD,QAAU,EAClCzT,KAAK2S,GAAW1C,EAAQoE,QACxBrU,KAAK4S,GAAqB3C,EAAQqE,iBAAkB,EACpDtU,KAAK+S,GAAqB9C,EAAQsE,iBAAkB,EACpDvU,KAAKwU,OACP,CAGI/S,QAAKgT,GACP,GAAkB,iBAAPA,GAAmBA,EAAK,EACjC,MAAM,IAAIrP,UAAU,qCAEtBpF,KAAKsS,GAAOmC,GAAMvK,IAClByJ,EAAK3T,KACP,CACIyB,UACF,OAAOzB,KAAKsS,EACd,CAEIoC,eAAYA,GACd1U,KAAKyS,KAAiBiC,CACxB,CACIA,iBACF,OAAO1U,KAAKyS,EACd,CAEIgB,WAAQkB,GACV,GAAkB,iBAAPA,EACT,MAAM,IAAIvP,UAAU,wCAEtBpF,KAAK0S,GAAWiC,EAChBhB,EAAK3T,KACP,CACIyT,aACF,OAAOzT,KAAK0S,EACd,CAGIkC,qBAAkBC,GACF,mBAAPA,IACTA,EAAK7B,GAEH6B,IAAO7U,KAAKwS,KACdxS,KAAKwS,GAAqBqC,EAC1B7U,KAAKuS,GAAU,EACfvS,KAAK6S,GAAUiC,SAAQ3B,IACrBA,EAAInU,OAASgB,KAAKwS,GAAmBW,EAAI9S,MAAO8S,EAAI9Q,KACpDrC,KAAKuS,IAAWY,EAAInU,WAGxB2U,EAAK3T,KACP,CACI4U,uBAAsB,OAAO5U,KAAKwS,EAAmB,CAErDxT,aAAY,OAAOgB,KAAKuS,EAAQ,CAChCwC,gBAAe,OAAO/U,KAAK6S,GAAU7T,MAAO,CAEhDgW,SAAUzQ,EAAI2P,GACZA,EAAQA,GAASlU,KACjB,IAAK,IAAI4T,EAAS5T,KAAK6S,GAAUgB,KAAiB,OAAXD,GAAkB,CACvD,MAAME,EAAOF,EAAOE,KACpBG,EAAYjU,KAAMuE,EAAIqP,EAAQM,GAC9BN,EAASE,CACX,CACF,CAEAgB,QAASvQ,EAAI2P,GACXA,EAAQA,GAASlU,KACjB,IAAK,IAAI4T,EAAS5T,KAAK6S,GAAUoC,KAAiB,OAAXrB,GAAkB,CACvD,MAAMzT,EAAOyT,EAAOzT,KACpB8T,EAAYjU,KAAMuE,EAAIqP,EAAQM,GAC9BN,EAASzT,CACX,CACF,CAEA+U,OACE,OAAOlV,KAAK6S,GAAUsC,UAAU5R,KAAI6R,GAAKA,EAAE/S,KAC7C,CAEAgT,SACE,OAAOrV,KAAK6S,GAAUsC,UAAU5R,KAAI6R,GAAKA,EAAE/U,OAC7C,CAEAmU,QACMxU,KAAK2S,IACL3S,KAAK6S,IACL7S,KAAK6S,GAAU7T,QACjBgB,KAAK6S,GAAUiC,SAAQ3B,GAAOnT,KAAK2S,GAASQ,EAAI9Q,IAAK8Q,EAAI9S,SAG3DL,KAAK8S,GAAS,IAAI1R,IAClBpB,KAAK6S,GAAY,IAAIR,EACrBrS,KAAKuS,GAAU,CACjB,CAEA+C,OACE,OAAOtV,KAAK6S,GAAUtP,KAAI4P,IACxBC,EAAQpT,KAAMmT,IAAe,CAC3BiC,EAAGjC,EAAI9Q,IACPkT,EAAGpC,EAAI9S,MACPmV,EAAGrC,EAAIG,KAAOH,EAAIM,QAAU,MAC3B0B,UAAUM,QAAOC,GAAKA,GAC7B,CAEAC,UACE,OAAO3V,KAAK6S,EACd,CAEAlR,IAAKU,EAAKhC,EAAOoT,GAGf,IAFAA,EAASA,GAAUzT,KAAK0S,KAEQ,iBAAXe,EACnB,MAAM,IAAIrO,UAAU,2BAEtB,MAAMkO,EAAMG,EAASF,KAAKD,MAAQ,EAC5BsC,EAAM5V,KAAKwS,GAAmBnS,EAAOgC,GAE3C,GAAIrC,KAAK8S,GAAOhD,IAAIzN,GAAM,CACxB,GAAIuT,EAAM5V,KAAKsS,GAEb,OADAe,EAAIrT,KAAMA,KAAK8S,GAAOzR,IAAIgB,KACnB,EAGT,MACMwT,EADO7V,KAAK8S,GAAOzR,IAAIgB,GACXhC,MAgBlB,OAZIL,KAAK2S,KACF3S,KAAK4S,IACR5S,KAAK2S,GAAStQ,EAAKwT,EAAKxV,QAG5BwV,EAAKvC,IAAMA,EACXuC,EAAKpC,OAASA,EACdoC,EAAKxV,MAAQA,EACbL,KAAKuS,IAAWqD,EAAMC,EAAK7W,OAC3B6W,EAAK7W,OAAS4W,EACd5V,KAAKqB,IAAIgB,GACTsR,EAAK3T,OACE,CACT,CAEA,MAAMmT,EAAM,IAAIa,EAAM3R,EAAKhC,EAAOuV,EAAKtC,EAAKG,GAG5C,OAAIN,EAAInU,OAASgB,KAAKsS,IAChBtS,KAAK2S,IACP3S,KAAK2S,GAAStQ,EAAKhC,IAEd,IAGTL,KAAKuS,IAAWY,EAAInU,OACpBgB,KAAK6S,GAAUiD,QAAQ3C,GACvBnT,KAAK8S,GAAOnR,IAAIU,EAAKrC,KAAK6S,GAAUoC,MACpCtB,EAAK3T,OACE,EACT,CAEA8P,IAAKzN,GACH,IAAKrC,KAAK8S,GAAOhD,IAAIzN,GAAM,OAAO,EAClC,MAAM8Q,EAAMnT,KAAK8S,GAAOzR,IAAIgB,GAAKhC,MACjC,OAAQ+S,EAAQpT,KAAMmT,EACxB,CAEA9R,IAAKgB,GACH,OAAOhB,EAAIrB,KAAMqC,GAAK,EACxB,CAEA0T,KAAM1T,GACJ,OAAOhB,EAAIrB,KAAMqC,GAAK,EACxB,CAEAkH,MACE,MAAM4I,EAAOnS,KAAK6S,GAAUgB,KAC5B,OAAK1B,GAGLkB,EAAIrT,KAAMmS,GACHA,EAAK9R,OAHH,IAIX,CAEAgT,IAAKhR,GACHgR,EAAIrT,KAAMA,KAAK8S,GAAOzR,IAAIgB,GAC5B,CAEA2T,KAAMC,GAEJjW,KAAKwU,QAEL,MAAMlB,EAAMC,KAAKD,MAEjB,IAAK,IAAI4C,EAAID,EAAIjX,OAAS,EAAGkX,GAAK,EAAGA,IAAK,CACxC,MAAM/C,EAAM8C,EAAIC,GACVC,EAAYhD,EAAIqC,GAAK,EAC3B,GAAkB,IAAdW,EAEFnW,KAAK2B,IAAIwR,EAAIiC,EAAGjC,EAAIoC,OACjB,CACH,MAAM9B,EAAS0C,EAAY7C,EAEvBG,EAAS,GACXzT,KAAK2B,IAAIwR,EAAIiC,EAAGjC,EAAIoC,EAAG9B,EAE3B,CACF,CACF,CAEA2C,QACEpW,KAAK8S,GAAOgC,SAAQ,CAACzU,EAAOgC,IAAQhB,EAAIrB,KAAMqC,GAAK,IACrD,E,YC/PF,MAAMgU,EAA8B,iBAAhBC,aAA4BA,aACnB,mBAApBA,YAAYhD,IAAqBgD,YAAc/C,KAElDgD,EAAS,IAAI3T,IACb4T,EAAmB,CAACC,EAAKC,KAC7B,MAAMC,EAAO,oBAAoBF,IAC7BG,EAAWD,IACbE,EAAKF,EAAM,GAAGF,WAAc,WAAWC,IAAWI,EACpD,EAEIC,EAAmB,CAACC,EAAQN,KAChC,MAAMC,EAAO,oBAAoBK,IACjC,GAAIJ,EAAWD,GAAO,CACpB,MAAM,UAAEhS,GAAcmS,GAChB,IAAEzV,GAAQqC,OAAOuT,yBAAyBtS,EAAWqS,GAC3DH,EAAKF,EAAM,GAAGK,WAAiB,SAASN,MAAarV,EACvD,GAUIuV,EAAcD,GAA4B,iBAAZ3O,SAClCA,WACEA,QAAQkP,eAAiBX,EAAOzG,IAAI6G,IAClCE,EAAO,CAACF,EAAMQ,EAAMT,EAASnS,KACjCgS,EAAOzT,IAAI6T,GACX3O,QAAQoP,YAAY,OAAOD,+BAAkCT,aAAoB,qBAAsBC,EAAMpS,EAAE,EAG3G8S,EAAWlQ,GAAKA,GAAKA,IAAM3F,KAAK8V,MAAMnQ,IAAMA,EAAI,GAAKoQ,SAASpQ,GAU9DqQ,EAAe/V,GAAQ4V,EAAS5V,GACpCA,GAAOD,KAAKiW,IAAI,EAAG,GAAKC,WACxBjW,GAAOD,KAAKiW,IAAI,EAAG,IAAME,YACzBlW,GAAOD,KAAKiW,IAAI,EAAG,IAAMG,YACzBnW,GAAOoW,OAAOC,iBAAmBC,EACjC,KAL2C,KAO7C,MAAMA,UAAkBxY,MACtB+D,YAAa0U,GACXtW,MAAMsW,GACNhY,KAAKiY,KAAK,EACZ,EAGF,MAAMC,EACJ5U,YAAa7B,GACX,MAAM0W,EAAYX,EAAa/V,GAC/BzB,KAAKoY,KAAO,IAAID,EAAU1W,GAC1BzB,KAAKhB,OAAS,CAChB,CACA6G,KAAMsB,GACJnH,KAAKoY,KAAKpY,KAAKhB,UAAYmI,CAC7B,CACAoC,MACE,OAAOvJ,KAAKoY,OAAOpY,KAAKhB,OAC1B,EAGF,MAAM8X,EACJxT,YAAa2M,EAAU,CAAC,GACtB,MAAM,IACJxO,EAAG,IACH4W,EAAG,cACHC,EAAgB,EAAC,aACjBC,EAAY,eACZhE,EAAc,WACdG,EAAU,QACVL,EAAO,aACPmE,EAAY,eACZlE,EAAc,YACdmE,EAAW,QACXC,EAAO,gBACPC,GACE1I,GAIE,OACJjR,EAAM,OACNyU,EAAM,MACNW,GACEnE,aAAmB6G,EAAW,CAAC,EAAI7G,EAEvC,IAAKoH,EAAS5V,GACZ,MAAM,IAAI2D,UAAU,iCAGtB,MAAM+S,EAAYX,EAAa/V,GAC/B,IAAK0W,EACH,MAAM,IAAIrU,MAAM,sBAAwBrC,GAM1C,GAHAzB,KAAKyB,IAAMA,EACXzB,KAAK0Y,QAAUA,GAAW,EAC1B1Y,KAAK2Y,gBAAkBA,GAAmB3Z,EACtCgB,KAAK2Y,gBAAiB,CACxB,IAAK3Y,KAAK0Y,QACR,MAAM,IAAItT,UAAU,sDAEtB,GAAoC,mBAAzBpF,KAAK2Y,gBACd,MAAM,IAAIvT,UAAU,sCAExB,CAyBA,GAxBApF,KAAK4Y,OAAS,IAAIxX,IAClBpB,KAAK6Y,QAAU,IAAItZ,MAAMkC,GAAKwW,KAAK,MACnCjY,KAAK8Y,QAAU,IAAIvZ,MAAMkC,GAAKwW,KAAK,MACnCjY,KAAKG,KAAO,IAAIgY,EAAU1W,GAC1BzB,KAAK8T,KAAO,IAAIqE,EAAU1W,GAC1BzB,KAAKiV,KAAO,EACZjV,KAAK6T,KAAO,EACZ7T,KAAK+Y,KAAO,IAAIb,EAAMzW,GACtBzB,KAAKgZ,YAAc,EACnBhZ,KAAKgY,KAAO,EAEW,mBAAZ3D,IACTrU,KAAKqU,QAAUA,GAEW,mBAAjBmE,GACTxY,KAAKwY,aAAeA,EACpBxY,KAAKiZ,SAAW,KAEhBjZ,KAAKwY,aAAe,KACpBxY,KAAKiZ,SAAW,MAElBjZ,KAAKsU,iBAAmBA,EACxBtU,KAAKyY,cAAgBA,EAEjBzY,KAAK0Y,QAAS,CAChB,IAAKrB,EAASrX,KAAK0Y,SACjB,MAAM,IAAItT,UAAU,mDAEtBpF,KAAKkZ,wBACP,CAQA,GANAlZ,KAAK0U,aAAeA,KAAgBN,EACpCpU,KAAKuU,iBAAmBA,EACxBvU,KAAKsY,cAAgBjB,EAASiB,IAAoC,IAAlBA,EAC5CA,EAAgB,EACpBtY,KAAKuY,eAAiBA,EACtBvY,KAAKqY,IAAMA,GAAO5E,GAAU,EACxBzT,KAAKqY,IAAK,CACZ,IAAKhB,EAASrX,KAAKqY,KACjB,MAAM,IAAIjT,UAAU,+CAEtBpF,KAAKmZ,uBACP,CAEI/E,GACFoC,EAAiB,QAAS,cAExB/C,GACF+C,EAAiB,SAAU,OAEzBxX,GACFwX,EAAiB,SAAU,kBAE/B,CAEA2C,wBACEnZ,KAAKoZ,KAAO,IAAIrB,EAAU/X,KAAKyB,KAC/BzB,KAAKqZ,OAAS,IAAItB,EAAU/X,KAAKyB,KACjCzB,KAAKsZ,WAAa,CAACtS,EAAOqR,KAGxB,GAFArY,KAAKqZ,OAAOrS,GAAiB,IAARqR,EAAYhC,EAAK/C,MAAQ,EAC9CtT,KAAKoZ,KAAKpS,GAASqR,EACP,IAARA,GAAarY,KAAKuY,aAAc,CAClC,MAAMgB,EAAIC,YAAW,KACfxZ,KAAKoT,QAAQpM,IACfhH,KAAK+C,OAAO/C,KAAK6Y,QAAQ7R,GAC3B,GACCqR,EAAM,GAELkB,EAAEE,OACJF,EAAEE,OAEN,GAEFzZ,KAAK0Z,cAAiB1S,IACpBhH,KAAKqZ,OAAOrS,GAA8B,IAArBhH,KAAKoZ,KAAKpS,GAAeqP,EAAK/C,MAAQ,GAI7D,IAAIqG,EAAY,EAChB,MAAMC,EAAS,KACb,MAAMzS,EAAIkP,EAAK/C,MACf,GAAItT,KAAKsY,cAAgB,EAAG,CAC1BqB,EAAYxS,EACZ,MAAMoS,EAAIC,YAAW,IAAMG,EAAY,GAAG3Z,KAAKsY,eAE3CiB,EAAEE,OACJF,EAAEE,OAEN,CACA,OAAOtS,GAETnH,KAAKoT,QAAWpM,GACc,IAArBhH,KAAKoZ,KAAKpS,IAAuC,IAAvBhH,KAAKqZ,OAAOrS,KACzC2S,GAAaC,KAAY5Z,KAAKqZ,OAAOrS,GAAShH,KAAKoZ,KAAKpS,EAEhE,CACA0S,cAAe1S,GAAQ,CACvBsS,WAAYtS,EAAOqR,GAAM,CACzBjF,QAASpM,GAAS,OAAO,CAAM,CAE/BkS,yBACElZ,KAAK6Z,eAAiB,EACtB7Z,KAAK8Z,MAAQ,IAAI/B,EAAU/X,KAAKyB,KAChCzB,KAAK+Z,eAAiB/S,GAAShH,KAAK6Z,gBAAkB7Z,KAAK8Z,MAAM9S,GACjEhH,KAAKga,YAAc,CAAChT,EAAOuO,EAAGH,EAAG4C,EAAMW,KACrC,MAAMsB,EAAIjC,IAASW,EAAkBA,EAAgBpD,EAAGH,GAAK,GAC7DpV,KAAK8Z,MAAM9S,GAASqQ,EAAS4C,GAAKA,EAAI,EACtC,MAAMvB,EAAU1Y,KAAK0Y,QAAU1Y,KAAK8Z,MAAM9S,GAC1C,KAAOhH,KAAK6Z,eAAiBnB,GAC3B1Y,KAAKka,QAEPla,KAAK6Z,gBAAkB7Z,KAAK8Z,MAAM9S,EAAK,EAEzChH,KAAK+C,OAASqS,IACZ,GAAkB,IAAdpV,KAAKgY,KAAY,CACnB,MAAMhR,EAAQhH,KAAK4Y,OAAOvX,IAAI+T,QAChB7T,IAAVyF,IACFhH,KAAK6Z,gBAAkB7Z,KAAK8Z,MAAM9S,GAEtC,CACA,OAAO8P,EAASnS,UAAU5B,OAAOoC,KAAKnF,KAAMoV,EAAC,CAEjD,CACA2E,eAAgB/S,GAAQ,CACxBgT,YAAahT,EAAOuO,EAAGH,EAAG4C,EAAMW,GAAkB,CAElD,UAAU,WAAEjE,EAAa1U,KAAK0U,YAAe,CAAC,GAC5C,GAAI1U,KAAKgY,KACP,IAAK,IAAmBmC,EAAfvU,EAAI5F,KAAK6T,KACX7T,KAAKoa,aAAaxU,KAGvBuU,EAAIvU,IAAM5F,KAAKiV,MACXP,GAAe1U,KAAKoT,QAAQxN,WACxBA,GAEJA,IAAM5F,KAAKiV,OAGbrP,EAAI5F,KAAK8T,KAAKlO,EAItB,CAEA,WAAW,WAAE8O,EAAa1U,KAAK0U,YAAe,CAAC,GAC7C,GAAI1U,KAAKgY,KACP,IAAK,IAAIpS,EAAI5F,KAAKiV,KACXjV,KAAKoa,aAAaxU,MAGnB8O,GAAe1U,KAAKoT,QAAQxN,WACxBA,GAGJA,IAAM5F,KAAK6T,OAGbjO,EAAI5F,KAAKG,KAAKyF,EAItB,CAEAwU,aAAcpT,GACZ,OAAOhH,KAAK4Y,OAAOvX,IAAIrB,KAAK6Y,QAAQ7R,MAAYA,CAClD,CAEA,WACE,IAAK,MAAMpB,KAAK5F,KAAKqa,eACb,CAACra,KAAK6Y,QAAQjT,GAAI5F,KAAK8Y,QAAQlT,GAEzC,CACA,YACE,IAAK,MAAMA,KAAK5F,KAAKsa,gBACb,CAACta,KAAK6Y,QAAQjT,GAAI5F,KAAK8Y,QAAQlT,GAEzC,CAEA,QACE,IAAK,MAAMA,KAAK5F,KAAKqa,gBACbra,KAAK6Y,QAAQjT,EAEvB,CACA,SACE,IAAK,MAAMA,KAAK5F,KAAKsa,iBACbta,KAAK6Y,QAAQjT,EAEvB,CAEA,UACE,IAAK,MAAMA,KAAK5F,KAAKqa,gBACbra,KAAK8Y,QAAQlT,EAEvB,CACA,WACE,IAAK,MAAMA,KAAK5F,KAAKsa,iBACbta,KAAK8Y,QAAQlT,EAEvB,CAEA,CAACrF,OAAOga,YACN,OAAOva,KAAK2D,SACd,CAEA6W,KAAMjW,EAAIkW,EAAa,CAAC,GACtB,IAAK,MAAM7U,KAAK5F,KAAKqa,UACnB,GAAI9V,EAAGvE,KAAK8Y,QAAQlT,GAAI5F,KAAK6Y,QAAQjT,GAAI5F,MACvC,OAAOA,KAAKqB,IAAIrB,KAAK6Y,QAAQjT,GAAI6U,EAGvC,CAEA3F,QAASvQ,EAAI2P,EAAQlU,MACnB,IAAK,MAAM4F,KAAK5F,KAAKqa,UACnB9V,EAAGY,KAAK+O,EAAOlU,KAAK8Y,QAAQlT,GAAI5F,KAAK6Y,QAAQjT,GAAI5F,KAErD,CAEAgV,SAAUzQ,EAAI2P,EAAQlU,MACpB,IAAK,MAAM4F,KAAK5F,KAAKsa,WACnB/V,EAAGY,KAAK+O,EAAOlU,KAAK8Y,QAAQlT,GAAI5F,KAAK6Y,QAAQjT,GAAI5F,KAErD,CAEIoW,YAEF,OADAW,EAAiB,QAAS,cACnB/W,KAAK0a,UACd,CAEAA,aACE,IAAIC,GAAU,EACd,IAAK,MAAM/U,KAAK5F,KAAKsa,SAAS,CAAE5F,YAAY,IACtC1U,KAAKoT,QAAQxN,KACf5F,KAAK+C,OAAO/C,KAAK6Y,QAAQjT,IACzB+U,GAAU,GAGd,OAAOA,CACT,CAEArF,OACE,MAAMW,EAAM,GACZ,IAAK,MAAMrQ,KAAK5F,KAAKqa,UAAW,CAC9B,MAAMhY,EAAMrC,KAAK6Y,QAAQjT,GAEnBgV,EAAQ,CAAEva,MADFL,KAAK8Y,QAAQlT,IAEvB5F,KAAKoZ,OACPwB,EAAMvC,IAAMrY,KAAKoZ,KAAKxT,IAEpB5F,KAAK8Z,QACPc,EAAM5C,KAAOhY,KAAK8Z,MAAMlU,IAE1BqQ,EAAIH,QAAQ,CAACzT,EAAKuY,GACpB,CACA,OAAO3E,CACT,CAEAD,KAAMC,GACJjW,KAAK6a,QACL,IAAK,MAAOxY,EAAKuY,KAAU3E,EACzBjW,KAAK2B,IAAIU,EAAKuY,EAAMva,MAAOua,EAE/B,CAEAvG,QAASkB,EAAGH,EAAGnV,GAAS,CAExB0B,IAAKyT,EAAGG,GAAG,IACT8C,EAAMrY,KAAKqY,IAAG,eACd/D,EAAiBtU,KAAKsU,eAAc,KACpC0D,EAAO,EAAC,gBACRW,EAAkB3Y,KAAK2Y,gBAAe,YACtCF,EAAczY,KAAKyY,aACjB,CAAC,GACH,IAAIzR,EAAsB,IAAdhH,KAAKgY,UAAazW,EAAYvB,KAAK4Y,OAAOvX,IAAI+T,GAC1D,QAAc7T,IAAVyF,EAEFA,EAAQhH,KAAK8a,WACb9a,KAAK6Y,QAAQ7R,GAASoO,EACtBpV,KAAK8Y,QAAQ9R,GAASuO,EACtBvV,KAAK4Y,OAAOjX,IAAIyT,EAAGpO,GACnBhH,KAAKG,KAAKH,KAAK6T,MAAQ7M,EACvBhH,KAAK8T,KAAK9M,GAAShH,KAAK6T,KACxB7T,KAAK6T,KAAO7M,EACZhH,KAAKgY,OACLhY,KAAKga,YAAYhT,EAAOuO,EAAGH,EAAG4C,EAAMW,GACpCF,GAAc,MACT,CAEL,MAAMsC,EAAS/a,KAAK8Y,QAAQ9R,GACxBuO,IAAMwF,IACHzG,IACHtU,KAAKqU,QAAQ0G,EAAQ3F,EAAG,OACpBpV,KAAKwY,cACPxY,KAAKiZ,SAASpT,KAAK,CAACkV,EAAQ3F,EAAG,SAGnCpV,KAAK+Z,eAAe/S,GACpBhH,KAAK8Y,QAAQ9R,GAASuO,EACtBvV,KAAKga,YAAYhT,EAAOuO,EAAGH,EAAG4C,EAAMW,IAEtC3Y,KAAKgb,WAAWhU,EAClB,CAOA,GANY,IAARqR,GAA0B,IAAbrY,KAAKqY,KAAcrY,KAAKoZ,MACvCpZ,KAAKmZ,wBAEFV,GACHzY,KAAKsZ,WAAWtS,EAAOqR,GAErBrY,KAAKwY,aACP,KAAOxY,KAAKiZ,SAASja,QACnBgB,KAAKwY,gBAAgBxY,KAAKiZ,SAASgC,SAGvC,OAAOjb,IACT,CAEA8a,WACE,OAAkB,IAAd9a,KAAKgY,KACAhY,KAAK6T,KAEV7T,KAAKgY,OAAShY,KAAKyB,IACdzB,KAAKka,QAEW,IAArBla,KAAK+Y,KAAK/Z,OACLgB,KAAK+Y,KAAKxP,MAGZvJ,KAAKgZ,aACd,CAEAzP,MACE,GAAIvJ,KAAKgY,KAAM,CACb,MAAMkD,EAAMlb,KAAK8Y,QAAQ9Y,KAAKiV,MAE9B,OADAjV,KAAKka,QACEgB,CACT,CACF,CAEAhB,QACE,MAAMjF,EAAOjV,KAAKiV,KACZG,EAAIpV,KAAK6Y,QAAQ5D,GACjBM,EAAIvV,KAAK8Y,QAAQ7D,GASvB,OARAjV,KAAKqU,QAAQkB,EAAGH,EAAG,SACfpV,KAAKwY,cACPxY,KAAKiZ,SAASpT,KAAK,CAAC0P,EAAGH,EAAG,UAE5BpV,KAAK+Z,eAAe9E,GACpBjV,KAAKiV,KAAOjV,KAAKG,KAAK8U,GACtBjV,KAAK4Y,OAAO7V,OAAOqS,GACnBpV,KAAKgY,OACE/C,CACT,CAEAnF,IAAKsF,GACH,OAAOpV,KAAK4Y,OAAO9I,IAAIsF,KAAOpV,KAAKoT,QAAQpT,KAAK4Y,OAAOvX,IAAI+T,GAC7D,CAGAW,KAAMX,GAAG,WAAEV,EAAa1U,KAAK0U,YAAe,CAAC,GAC3C,MAAM1N,EAAQhH,KAAK4Y,OAAOvX,IAAI+T,GAC9B,QAAc7T,IAAVyF,IAAwB0N,IAAe1U,KAAKoT,QAAQpM,IACtD,OAAOhH,KAAK8Y,QAAQ9R,EAExB,CAEA3F,IAAK+T,GAAG,WACNV,EAAa1U,KAAK0U,WAAU,eAC5BH,EAAiBvU,KAAKuU,gBACpB,CAAC,GACH,MAAMvN,EAAQhH,KAAK4Y,OAAOvX,IAAI+T,GAC9B,QAAc7T,IAAVyF,EAAqB,CACvB,GAAIhH,KAAKoT,QAAQpM,GAAQ,CACvB,MAAM3G,EAAQqU,EAAa1U,KAAK8Y,QAAQ9R,QAASzF,EAEjD,OADAvB,KAAK+C,OAAOqS,GACL/U,CACT,CAKE,OAJAL,KAAKgb,WAAWhU,GACZuN,GACFvU,KAAK0Z,cAAc1S,GAEdhH,KAAK8Y,QAAQ9R,EAExB,CACF,CAEAmU,QAASC,EAAGjU,GACVnH,KAAK8T,KAAK3M,GAAKiU,EACfpb,KAAKG,KAAKib,GAAKjU,CACjB,CAEA6T,WAAYhU,GASNA,IAAUhH,KAAK6T,OACb7M,IAAUhH,KAAKiV,KACjBjV,KAAKiV,KAAOjV,KAAKG,KAAK6G,GAEtBhH,KAAKmb,QAAQnb,KAAK8T,KAAK9M,GAAQhH,KAAKG,KAAK6G,IAE3ChH,KAAKmb,QAAQnb,KAAK6T,KAAM7M,GACxBhH,KAAK6T,KAAO7M,EAEhB,CAEIqM,UAEF,OADA0D,EAAiB,MAAO,UACjB/W,KAAK+C,MACd,CACAA,OAAQqS,GACN,IAAIuF,GAAU,EACd,GAAkB,IAAd3a,KAAKgY,KAAY,CACnB,MAAMhR,EAAQhH,KAAK4Y,OAAOvX,IAAI+T,QAChB7T,IAAVyF,IACF2T,GAAU,EACQ,IAAd3a,KAAKgY,KACPhY,KAAK6a,SAEL7a,KAAK+Z,eAAe/S,GACpBhH,KAAKqU,QAAQrU,KAAK8Y,QAAQ9R,GAAQoO,EAAG,UACjCpV,KAAKwY,cACPxY,KAAKiZ,SAASpT,KAAK,CAAC7F,KAAK8Y,QAAQ9R,GAAQoO,EAAG,WAE9CpV,KAAK4Y,OAAO7V,OAAOqS,GACnBpV,KAAK6Y,QAAQ7R,GAAS,KACtBhH,KAAK8Y,QAAQ9R,GAAS,KAClBA,IAAUhH,KAAK6T,KACjB7T,KAAK6T,KAAO7T,KAAK8T,KAAK9M,GACbA,IAAUhH,KAAKiV,KACxBjV,KAAKiV,KAAOjV,KAAKG,KAAK6G,IAEtBhH,KAAKG,KAAKH,KAAK8T,KAAK9M,IAAUhH,KAAKG,KAAK6G,GACxChH,KAAK8T,KAAK9T,KAAKG,KAAK6G,IAAUhH,KAAK8T,KAAK9M,IAE1ChH,KAAKgY,OACLhY,KAAK+Y,KAAKlT,KAAKmB,IAGrB,CACA,GAAIhH,KAAKiZ,SACP,KAAOjZ,KAAKiZ,SAASja,QACnBgB,KAAKwY,gBAAgBxY,KAAKiZ,SAASgC,SAGvC,OAAON,CACT,CAEAE,QACE,GAAI7a,KAAKqU,UAAYyC,EAASnS,UAAU0P,QACtC,IAAK,MAAMrN,KAAShH,KAAKsa,SAAS,CAAE5F,YAAY,IAC9C1U,KAAKqU,QAAQrU,KAAK8Y,QAAQ9R,GAAQhH,KAAK6Y,QAAQ7R,GAAQ,UAG3D,GAAIhH,KAAKwY,aACP,IAAK,MAAMxR,KAAShH,KAAKsa,SAAS,CAAE5F,YAAY,IAC9C1U,KAAKiZ,SAASpT,KAAK,CAAC7F,KAAK8Y,QAAQ9R,GAAQhH,KAAK6Y,QAAQ7R,GAAQ,WAmBlE,GAhBAhH,KAAK4Y,OAAOiC,QACZ7a,KAAK8Y,QAAQb,KAAK,MAClBjY,KAAK6Y,QAAQZ,KAAK,MACdjY,KAAKoZ,OACPpZ,KAAKoZ,KAAKnB,KAAK,GACfjY,KAAKqZ,OAAOpB,KAAK,IAEfjY,KAAK8Z,OACP9Z,KAAK8Z,MAAM7B,KAAK,GAElBjY,KAAKiV,KAAO,EACZjV,KAAK6T,KAAO,EACZ7T,KAAKgZ,YAAc,EACnBhZ,KAAK+Y,KAAK/Z,OAAS,EACnBgB,KAAK6Z,eAAiB,EACtB7Z,KAAKgY,KAAO,EACRhY,KAAKiZ,SACP,KAAOjZ,KAAKiZ,SAASja,QACnBgB,KAAKwY,gBAAgBxY,KAAKiZ,SAASgC,QAGzC,CACIzG,YAEF,OADAuC,EAAiB,QAAS,SACnB/W,KAAK6a,KACd,CAEI7b,aAEF,MAhlBuB,EAACqc,EAAO3E,KACjC,MAAMC,EAAO,sBAAsB0E,IACnC,GAAIzE,EAAWD,GAAO,CACpB,MAAM,UAAEhS,GAAcmS,GAChB,IAAEzV,GAAQqC,OAAOuT,yBAAyBtS,EAAW0W,GAC3DxE,EAAKF,EAAM,GAAG0E,aAAkB,aAAoBha,EACtD,GAykBEia,CAAmB,UACZtb,KAAKgY,IACd,EAGFjT,EAAOC,QAAU8R,C,sBCtmBjB,aAEsB,0BAAP,EAMP,WACN,aAEA,IAAItN,EAAiB9F,OAAOiB,UAAU6E,eAClC3E,EAAWnB,OAAOiB,UAAUE,SAC5B0W,EAA2C,kBAAxB,IAAItS,QAASuS,OAIpC,SAASC,EAASC,GAAK,OAAOA,GAA0B,oBAArB7W,EAASM,KAAKuW,EAAyB,CAC1E,SAASC,EAASD,GAAK,OAAOA,GAAkB,iBAANA,IAAmBD,EAASC,KAAOnc,MAAMqc,QAAQF,EAAG,CAS9F,SAASG,EAAU5B,GACjB,MAAO,IAAMA,EAAI,GACnB,CACA,SAAS6B,EAAQC,GACf,OAAKA,EAAQ/c,OAIN,MAHO+c,EAAQxY,KAAI,SAAS0W,GACjC,MAAO,MAAQA,EAAI,GACrB,IAAGlU,KAAK,KACgB,IAJI,MAK9B,CAEA,SAASiW,EAAgBC,GACvB,GAAmB,iBAARA,EACT,MAAO,OAAiBA,EAnBjBtU,QAAQ,yBAA0B,QAmBV,KAE1B,GAAI8T,EAASQ,GAAM,CAExB,GAAIA,EAAIC,WAAY,MAAM,IAAIpY,MAAM,8BACpC,GAAImY,EAAIE,OAAQ,MAAM,IAAIrY,MAAM,6BAChC,GAAImY,EAAIT,OAAQ,MAAM,IAAI1X,MAAM,6BAChC,GAAImY,EAAIG,UAAW,MAAM,IAAItY,MAAM,6BACnC,OAAOmY,EAAI7Z,MAEb,CACE,MAAM,IAAI0B,MAAM,kBAAoBmY,EAExC,CAEA,SAASI,EAAIpC,EAAGjb,GACd,OAAIib,EAAEjb,OAASA,EACNib,EAEF1a,MAAMP,EAASib,EAAEjb,OAAS,GAAG+G,KAAK,KAAOkU,CAClD,CA0EA,SAASqC,EAAYhT,EAAM2S,GAIzB,GAHKN,EAASM,KACZA,EAAM,CAAEpV,MAAOoV,IAEbA,EAAIM,QACN,MAAM,IAAIzY,MAAM,6CAIlB,IAAImM,EAAU,CACZuM,YAAalT,EACbmT,aAAcR,EAAIS,SAAWT,EAAIU,SACjCpT,KAAK,EACLpJ,KAAM,KACN0F,KAAM,KACN6W,OAAO,EACPC,UAAU,EACVtc,MAAO,KACPiJ,KAAM,KACNsT,aAAa,GAIf,IAAK,IAAIva,KAAO4Z,EACVzS,EAAerE,KAAK8W,EAAK5Z,KAC3B4N,EAAQ5N,GAAO4Z,EAAI5Z,IAKvB,GAA4B,iBAAjB4N,EAAQ3G,MAAqBA,IAAS2G,EAAQ3G,KACvD,MAAM,IAAIxF,MAAM,4CAA8CmM,EAAQ3G,KAAO,gBAAkBA,EAAO,MAIxG,IAAIzC,EAAQoJ,EAAQpJ,MAMpB,OALAoJ,EAAQpJ,MAAQtH,MAAMqc,QAAQ/U,GAASA,EAAQA,EAAQ,CAACA,GAAS,GACjEoJ,EAAQpJ,MAAMgW,MAAK,SAASC,EAAGC,GAC7B,OAAOtB,EAASqB,IAAMrB,EAASsB,GAAK,EAC7BtB,EAASsB,IAAM,EAAItB,EAASqB,GAAK,EAAKC,EAAE/d,OAAS8d,EAAE9d,MAC5D,IACOiR,CACT,CAEA,SAAS+M,EAAQC,GACf,OAAO1d,MAAMqc,QAAQqB,GAhEvB,SAAsBC,GAEpB,IADA,IAAI3X,EAAS,GACJK,EAAI,EAAGA,EAAIsX,EAAMle,OAAQ4G,IAAK,CACrC,IAAIqW,EAAMiB,EAAMtX,GAChB,GAAIqW,EAAIM,QAEN,IADA,IAAIA,EAAU,GAAG9W,OAAOwW,EAAIM,SACnBpC,EAAI,EAAGA,EAAIoC,EAAQvd,OAAQmb,IAClC5U,EAAOM,KAAK,CAAC0W,QAASA,EAAQpC,SAHlC,CAOA,IAAK8B,EAAI3S,KACP,MAAM,IAAIxF,MAAM,qBAAuB8L,KAAKC,UAAUoM,IAExD1W,EAAOM,KAAKyW,EAAYL,EAAI3S,KAAM2S,GAJlC,CAKF,CACA,OAAO1W,CACT,CA+C+B4X,CAAaF,GA5F5C,SAAuBG,GAGrB,IAFA,IAAIlI,EAAOxR,OAAO2Z,oBAAoBD,GAClC7X,EAAS,GACJK,EAAI,EAAGA,EAAIsP,EAAKlW,OAAQ4G,IAAK,CACpC,IAAIvD,EAAM6S,EAAKtP,GACX0X,EAAQF,EAAO/a,GACfkb,EAAQ,GAAG9X,OAAO6X,GACtB,GAAY,YAARjb,EAAJ,CAMA,IAAIwE,EAAQ,GACZ0W,EAAMzI,SAAQ,SAAS0I,GACjB7B,EAAS6B,IACP3W,EAAM7H,QAAQuG,EAAOM,KAAKyW,EAAYja,EAAKwE,IAC/CtB,EAAOM,KAAKyW,EAAYja,EAAKmb,IAC7B3W,EAAQ,IAERA,EAAMhB,KAAK2X,EAEf,IACI3W,EAAM7H,QAAQuG,EAAOM,KAAKyW,EAAYja,EAAKwE,GAX/C,MAJE,IAAK,IAAIsT,EAAI,EAAGA,EAAIoD,EAAMve,OAAQmb,IAChC5U,EAAOM,KAAK,CAAC0W,QAASgB,EAAMpD,IAelC,CACA,OAAO5U,CACT,CAkEoDkY,CAAcR,EAClE,CAEA,IAAIS,EAAmBpB,EAAY,QAAS,CAACG,YAAY,EAAMG,aAAa,IAC5E,SAASe,EAAaJ,EAAOK,GAS3B,IARA,IAAIC,EAAY,KACZC,EAAOpa,OAAOqa,OAAO,MACrBC,GAAc,EACdC,EAAc,KACdC,EAAS,GACT5M,EAAQ,GAGH1L,EAAI,EAAGA,EAAI2X,EAAMve,OAAQ4G,IAC5B2X,EAAM3X,GAAG+W,WACXqB,GAAc,GAIlB,IAASpY,EAAI,EAAGA,EAAI2X,EAAMve,OAAQ4G,IAAK,CACrC,IAAIqK,EAAUsN,EAAM3X,GAEpB,GAAIqK,EAAQsM,QAEV,MAAM,IAAIzY,MAAM,kDAGlB,GAAImM,EAAQyM,OAASzM,EAAQ0M,SAAU,CAErC,GAAIkB,EACF,MAAK5N,EAAQ0M,WAAckB,EAAUlB,SAC7B,IAAI7Y,MAAM,aAAemM,EAAQ0M,SAAW,WAAa,SAAW,kCAAoC1M,EAAQuM,YAAc,MAE9H,IAAI1Y,MAAM,yDAA2DmM,EAAQuM,YAAc,MAGrGqB,EAAY5N,CACd,CAEA,IAAIpJ,EAAQoJ,EAAQpJ,MAAM1H,QAC1B,GAAI6e,EACF,KAAOnX,EAAM7H,QAA8B,iBAAb6H,EAAM,IAAuC,IAApBA,EAAM,GAAG7H,QAE9D8e,EADWjX,EAAMoU,QACPkD,WAAW,IAAMlO,EAK/B,GAAIA,EAAQ1G,KAAO0G,EAAQpK,MAAQoK,EAAQ9P,KAAM,CAC/C,IAAKyd,EACH,MAAM,IAAI9Z,MAAM,2EAA6EmM,EAAQuM,YAAc,MAErH,GAAIvM,EAAQ0M,SACV,MAAM,IAAI7Y,MAAM,0EAA4EmM,EAAQuM,YAAc,KAEtH,CAGA,GAAqB,IAAjB3V,EAAM7H,OAAV,CAGAgf,GAAc,EAEdE,EAAOrY,KAAKoK,GAGZ,IAAK,IAAIkK,EAAI,EAAGA,EAAItT,EAAM7H,OAAQmb,IAAK,CACrC,IAAI8B,EAAMpV,EAAMsT,GAChB,GAAKsB,EAASQ,GAId,GAAoB,OAAhBgC,EACFA,EAAchC,EAAImC,aACb,GAAIH,IAAgBhC,EAAImC,UAAgC,IAArBnO,EAAQ0M,SAChD,MAAM,IAAI7Y,MAAM,qCAEpB,CAGA,IAAIua,EAAMvC,EAAQjV,EAAMtD,IAAIyY,IAGxBsC,EAAS,IAAIrV,OAAOoV,GACxB,GAAIC,EAAO7W,KAAK,IACd,MAAM,IAAI3D,MAAM,gCAAkCwa,GAGpD,GAnPO,IAAIrV,OAAO,IAkPQoV,GAjPlBtX,KAAK,IAAI/H,OAAS,EAkPT,EACf,MAAM,IAAI8E,MAAM,8BAAgCwa,EAAS,yBAI3D,IAAKrO,EAAQwM,YAAc6B,EAAO7W,KAAK,MACrC,MAAM,IAAI3D,MAAM,mCAAqCwa,GAIvDhN,EAAMzL,KAAKgW,EAAUwC,GAtCrB,CAuCF,CA/PF,IAuQME,EAAeV,GAAaA,EAAUlB,SACtCnU,EAAQ+S,IAAcgD,EAAe,KAAO,KAC5CC,EAASjD,GAAagD,EAAe,GAAK,IAI9C,OAFoB,IAAhBN,IAAsBzV,GAAS,KAE5B,CAAC8V,OADO,IAAIrV,OAAO6S,EAAQxK,GAASkN,EAAQhW,GACzB0V,OAAQA,EAAQJ,KAAMA,EAAMpB,MAAOmB,GAAaH,EAC5E,CAOA,SAASe,EAAgBC,EAAG3R,EAAMxJ,GAChC,IAAIob,EAAQD,IAAMA,EAAE7Y,MAAQ6Y,EAAEve,MAC9B,GAAIwe,IAAUpb,EAAIob,GAChB,MAAM,IAAI7a,MAAM,kBAAoB6a,EAAQ,gBAAkBD,EAAElC,YAAc,eAAiBzP,EAAO,MAExG,GAAI2R,GAAKA,EAAEnV,KAAkB,IAAVmV,EAAEnV,IACnB,MAAM,IAAIzF,MAAM,4BAA8B4a,EAAElC,YAAc,eAAiBzP,EAAO,KAE1F,CA0FA,IAAI6R,EAAQ,SAASC,EAAQF,GAC3B3e,KAAK8e,WAAaH,EAClB3e,KAAK6e,OAASA,EACd7e,KAAK+e,OAAS,GACd/e,KAAKgf,MAAQ,GACbhf,KAAKwU,OACP,EAEAoK,EAAMja,UAAU6P,MAAQ,SAASrS,EAAM8c,GAUrC,OATAjf,KAAK+e,OAAS5c,GAAQ,GACtBnC,KAAKgH,MAAQ,EACbhH,KAAKkf,KAAOD,EAAOA,EAAKC,KAAO,EAC/Blf,KAAKmf,IAAMF,EAAOA,EAAKE,IAAM,EAC7Bnf,KAAKof,YAAcH,EAAOA,EAAKG,YAAc,KAC7Cpf,KAAKqf,WAAaJ,EAAOA,EAAKI,WAAY,GAC1Crf,KAAKsf,YAAcL,EAAOA,EAAKK,YAAc,KAC7Ctf,KAAKuf,SAASN,EAAOA,EAAKN,MAAQ3e,KAAK8e,YACvC9e,KAAKgf,MAAQC,GAAQA,EAAKD,MAAQC,EAAKD,MAAM7f,QAAU,GAChDa,IACT,EAEA4e,EAAMja,UAAU6a,KAAO,WACrB,MAAO,CACLN,KAAMlf,KAAKkf,KACXC,IAAKnf,KAAKmf,IACVR,MAAO3e,KAAK2e,MACZK,MAAOhf,KAAKgf,MAAM7f,QAClBigB,YAAapf,KAAKof,YAClBC,WAAYrf,KAAKqf,WACjBC,YAAatf,KAAKsf,YAEtB,EAEAV,EAAMja,UAAU4a,SAAW,SAASZ,GAClC,GAAKA,GAAS3e,KAAK2e,QAAUA,EAA7B,CACA3e,KAAK2e,MAAQA,EACb,IAAIM,EAAOjf,KAAK6e,OAAOF,GACvB3e,KAAKke,OAASe,EAAKf,OACnBle,KAAK0c,MAAQuC,EAAKvC,MAClB1c,KAAKyf,GAAKR,EAAKX,OACfte,KAAK8d,KAAOmB,EAAKnB,IANmB,CAOtC,EAEAc,EAAMja,UAAU+a,SAAW,WACzB1f,KAAKuf,SAASvf,KAAKgf,MAAMzV,MAC3B,EAEAqV,EAAMja,UAAUgb,UAAY,SAAShB,GACnC3e,KAAKgf,MAAMnZ,KAAK7F,KAAK2e,OACrB3e,KAAKuf,SAASZ,EAChB,EAEA,IAAIiB,EAAMrE,EAAY,SAASkE,EAAIV,GACjC,OAAOU,EAAG1Y,KAAKgY,EACjB,EAAI,SAASU,EAAIV,GACf,IAAIlY,EAAQ4Y,EAAG1Y,KAAKgY,GAEpB,OAAwB,IAApBlY,EAAM,GAAG7H,OACJ,KAEF6H,CACT,EAYA,SAASgZ,IACP,OAAO7f,KAAKK,KACd,CAgGA,GA5GAue,EAAMja,UAAUmb,UAAY,SAASjZ,GAEnC,IADA,IAAIkZ,EAAa/f,KAAKke,OAAOlf,OACpB4G,EAAI,EAAGA,EAAIma,EAAYna,IAC9B,QAAqBrE,IAAjBsF,EAAMjB,EAAI,GACZ,OAAO5F,KAAKke,OAAOtY,GAGvB,MAAM,IAAI9B,MAAM,0CAClB,EAMA8a,EAAMja,UAAUxE,KAAO,WACrB,IAAI6G,EAAQhH,KAAKgH,MAGjB,GAAIhH,KAAKggB,YAAa,CACpB,IAAIC,EAAQjgB,KAAKkgB,OAAOlgB,KAAKggB,YAAahgB,KAAKqf,WAAYrY,GAG3D,OAFAhH,KAAKggB,YAAc,KACnBhgB,KAAKqf,WAAa,GACXY,CACT,CAEA,IAAIlB,EAAS/e,KAAK+e,OAClB,GAAI/X,IAAU+X,EAAO/f,OAArB,CAMA,GADIkF,EAAQlE,KAAK8d,KAAKiB,EAAOZ,WAAWnX,IAEtC,OAAOhH,KAAKkgB,OAAOhc,EAAO6a,EAAOoB,OAAOnZ,GAAQA,GAIlD,IAAIyY,EAAKzf,KAAKyf,GACdA,EAAGW,UAAYpZ,EACf,IAAIH,EAAQ+Y,EAAIH,EAAIV,GAGhBrC,EAAQ1c,KAAK0c,MACjB,GAAa,MAAT7V,EACF,OAAO7G,KAAKkgB,OAAOxD,EAAOqC,EAAO5f,MAAM6H,EAAO+X,EAAO/f,QAASgI,GAGhE,IAAI9C,EAAQlE,KAAK8f,UAAUjZ,GACvBwZ,EAAOxZ,EAAM,GAEjB,OAAI6V,EAAMC,UAAY9V,EAAMG,QAAUA,GACpChH,KAAKggB,YAAc9b,EACnBlE,KAAKqf,WAAagB,EAGXrgB,KAAKkgB,OAAOxD,EAAOqC,EAAO5f,MAAM6H,EAAOH,EAAMG,OAAQA,IAGvDhH,KAAKkgB,OAAOhc,EAAOmc,EAAMrZ,EA9BhC,CA+BF,EAEA4X,EAAMja,UAAUub,OAAS,SAAShc,EAAOmc,EAAMC,GAE7C,IAAI7D,EAAa,EACjB,GAAIvY,EAAMuY,WAAY,CACpB,IAAI8D,EAAU,MACVC,EAAK,EACT,GAAa,OAATH,EACF5D,EAAa,OAEb,KAAO8D,EAAQxZ,KAAKsZ,IAAS5D,IAAc+D,EAAKD,EAAQH,SAE5D,CAEA,IAAIH,EAAQ,CACV3W,KAA6B,mBAAfpF,EAAMoF,MAAuBpF,EAAMoF,KAAK+W,IAAUnc,EAAMsY,YACtEnc,MAA8B,mBAAhB6D,EAAM7D,MAAuB6D,EAAM7D,MAAMggB,GAAQA,EAC/DA,KAAMA,EACNxb,SAAUgb,EACVS,OAAQA,EACR7D,WAAYA,EACZyC,KAAMlf,KAAKkf,KACXC,IAAKnf,KAAKmf,KAIRnH,EAAOqI,EAAKrhB,OAUhB,GATAgB,KAAKgH,OAASgR,EACdhY,KAAKkf,MAAQzC,EACM,IAAfA,EACFzc,KAAKmf,IAAMnH,EAAOwI,EAAK,EAEvBxgB,KAAKmf,KAAOnH,EAIV9T,EAAM0Y,YAER,MADU,IAAI9Y,MAAM9D,KAAKygB,YAAYR,EAAO,mBAQ9C,OAJI/b,EAAMqF,IAAKvJ,KAAK0f,WACXxb,EAAM2B,KAAM7F,KAAK2f,UAAUzb,EAAM2B,MACjC3B,EAAM/D,MAAMH,KAAKuf,SAASrb,EAAM/D,MAElC8f,CACT,EAEsB,oBAAX1f,QAA0BA,OAAOga,SAAU,CACpD,IAAImG,EAAgB,SAASC,GAC3B3gB,KAAK2gB,MAAQA,CACf,EAEAD,EAAc/b,UAAUxE,KAAO,WAC7B,IAAI8f,EAAQjgB,KAAK2gB,MAAMxgB,OACvB,MAAO,CAACE,MAAO4f,EAAOpf,MAAOof,EAC/B,EAEAS,EAAc/b,UAAUpE,OAAOga,UAAY,WACzC,OAAOva,IACT,EAEA4e,EAAMja,UAAUpE,OAAOga,UAAY,WACjC,OAAO,IAAImG,EAAc1gB,KAC3B,CACF,CA+CA,OA7CA4e,EAAMja,UAAU8b,YAAc,SAASR,EAAOW,GAC5C,GAAa,MAATX,EAEF,KAAII,EAAOrgB,KAAK+e,OAAO5f,MAAMa,KAAKgH,OAC9BiZ,EAAQ,CACVI,KAAMA,EACNC,OAAQtgB,KAAKgH,MACbyV,YAAoC,IAAxB4D,EAAK3d,QAAQ,MAAe,EAAI,EAC5Cwc,KAAMlf,KAAKkf,KACXC,IAAKnf,KAAKmf,IAN2B,CAUzC,IACI0B,EAAqBrf,KAAKC,IAAIwe,EAAMf,KADnB,EAC0C,GAC3D4B,EAAoBb,EAAMf,KAFT,EAGjB6B,EAAiBC,OAAOF,GAAmB9hB,OAC3CiiB,EA/hBN,SAAoBC,EAAQC,GAG1B,IAFA,IAAIC,EAAWF,EAAOliB,OAClByd,EAAa,IACJ,CACX,IAAIha,EAAMye,EAAOjX,YAAY,KAAMmX,EAAW,GAC9C,IAAa,IAAT3e,EACF,MAKF,GADA2e,EAAW3e,IAFTga,IAGiB0E,EACjB,MAEF,GAAiB,IAAbC,EACF,KAEJ,CACA,IAAIpX,EACFyS,EAAa0E,EACb,EACAC,EAAW,EACb,OAAOF,EAAOG,UAAUrX,GAAexC,MAAM,KAC/C,CAwgBuB8Z,CACjBthB,KAAK+e,OACJ/e,KAAKkf,KAAOe,EAAMf,KANF,EAM2B,GAE7C/f,MAAM,EAAG,GACRoiB,EAAa,GACjBA,EAAW1b,KAAK+a,EAAU,YAAcX,EAAMf,KAAO,QAAUe,EAAMd,IAAM,KAC3EoC,EAAW1b,KAAK,IAChB,IAAK,IAAID,EAAI,EAAGA,EAAIqb,EAAejiB,OAAQ4G,IAAK,CAC9C,IAAIsZ,EAAO+B,EAAerb,GACtB4b,EAASX,EAAqBjb,EAClC2b,EAAW1b,KAAKwW,EAAI2E,OAAOQ,GAAST,GAAkB,KAAO7B,GACzDsC,IAAWvB,EAAMf,MACnBqC,EAAW1b,KAAKwW,EAAI,GAAI0E,EAAiBd,EAAMd,IAAM,GAAK,IAE9D,CACA,OAAOoC,EAAWxb,KAAK,KACzB,EAEA6Y,EAAMja,UAAU8c,MAAQ,WACtB,OAAO,IAAI7C,EAAM5e,KAAK6e,OAAQ7e,KAAK2e,MACrC,EAEAC,EAAMja,UAAUmL,IAAM,SAAS4R,GAC7B,OAAO,CACT,EAGO,CACLC,QAnVF,SAAiBpE,GACf,IAAIhY,EAASoY,EAAaX,EAAQO,IAClC,OAAO,IAAIqB,EAAM,CAACgD,MAAOrc,GAAS,QACpC,EAiVEsZ,OAtUF,SAAuBA,EAAQ+C,GAC7B,IAAIC,EAAMhD,EAAOiD,KAAO9E,EAAQ6B,EAAOiD,MAAQ,UACxCjD,EAAOiD,KAEd,IAAI5M,EAAOxR,OAAO2Z,oBAAoBwB,GACjC+C,IAAOA,EAAQ1M,EAAK,IAGzB,IADA,IAAI6M,EAAUre,OAAOqa,OAAO,MACnBnY,EAAI,EAAGA,EAAIsP,EAAKlW,OAAQ4G,IAE/Bmc,EADI1f,EAAM6S,EAAKtP,IACAoX,EAAQ6B,EAAOxc,IAAMoD,OAAOoc,GAE7C,IAASjc,EAAI,EAAGA,EAAIsP,EAAKlW,OAAQ4G,IAI/B,IAHA,IACI2X,EAAQwE,EADR1f,EAAM6S,EAAKtP,IAEXoc,EAAWte,OAAOqa,OAAO,MACpB5D,EAAI,EAAGA,EAAIoD,EAAMve,OAAQmb,IAAK,CACrC,IAAIqD,EAAOD,EAAMpD,GACjB,GAAKqD,EAAKjB,QAAV,CACA,IAAI0F,EAAS,CAAC9H,EAAG,GACjB,GAAIqD,EAAKjB,UAAYla,IAAQ2f,EAASxE,EAAKjB,SAAU,CACnDyF,EAASxE,EAAKjB,UAAW,EACzB,IAAI2F,EAAWH,EAAQvE,EAAKjB,SAC5B,IAAK2F,EACH,MAAM,IAAIpe,MAAM,qCAAuC0Z,EAAKjB,QAAU,gBAAkBla,EAAM,MAEhG,IAAK,IAAI+S,EAAI,EAAGA,EAAI8M,EAASljB,OAAQoW,IAAK,CACxC,IAAI+M,EAAUD,EAAS9M,IACS,IAA5BmI,EAAM7a,QAAQyf,IAClBF,EAAOpc,KAAKsc,EACd,CACF,CACA5E,EAAM0E,OAAOzc,MAAM+X,EAAO0E,GAC1B9H,GAfmB,CAgBrB,CAGF,IAAI5W,EAAMG,OAAOqa,OAAO,MACxB,IAASnY,EAAI,EAAGA,EAAIsP,EAAKlW,OAAQ4G,IAAK,CACpC,IAAIvD,EACJkB,EADIlB,EAAM6S,EAAKtP,IACJ+X,EAAaoE,EAAQ1f,IAAM,EACxC,CAEA,IAASuD,EAAI,EAAGA,EAAIsP,EAAKlW,OAAQ4G,IAAK,CACpC,IAAImH,EAAOmI,EAAKtP,GACZ+Y,EAAQpb,EAAIwJ,GACZmR,EAASS,EAAMT,OACnB,IAAS/D,EAAI,EAAGA,EAAI+D,EAAOlf,OAAQmb,IACjCsE,EAAgBP,EAAO/D,GAAIpN,EAAMxJ,GAEnC,IAAI6e,EAAW1e,OAAO2Z,oBAAoBsB,EAAMb,MAChD,IAAS3D,EAAI,EAAGA,EAAIiI,EAASpjB,OAAQmb,IACnCsE,EAAgBE,EAAMb,KAAKsE,EAASjI,IAAKpN,EAAMxJ,EAEnD,CAEA,OAAO,IAAIqb,EAAMrb,EAAKqe,EACxB,EA8QElF,MAAOhZ,OAAO2e,OAAO,CAAC3F,OAAO,IAC7BC,SAAUjZ,OAAO2e,OAAO,CAAC1F,UAAU,IACnC2F,SA9QF,SAA0B/e,GAQxB,IAJA,IAAIgf,EAAuB,oBAARnhB,IACfohB,EAAaD,EAAQ,IAAInhB,IAAMsC,OAAOqa,OAAO,MAE7C0E,EAAQ/e,OAAO2Z,oBAAoB9Z,GAC9BqC,EAAI,EAAGA,EAAI6c,EAAMzjB,OAAQ4G,IAAK,CACrC,IAAI8b,EAAYe,EAAM7c,GAClBiQ,EAAOtS,EAAIme,IACGniB,MAAMqc,QAAQ/F,GAAQA,EAAO,CAACA,IACpCf,SAAQ,SAAS4N,GAC3B,GAAuB,iBAAZA,EACT,MAAM,IAAI5e,MAAM,uCAAyC4d,EAAY,MAEnEa,EACFC,EAAW7gB,IAAI+gB,EAAShB,GAExBc,EAAWE,GAAWhB,CAE1B,GACF,CACA,OAAO,SAAStM,GACd,OAAOmN,EAAQC,EAAWnhB,IAAI+T,GAAKoN,EAAWpN,EAChD,CACF,EAuPF,GA/nBsB,UAAX,IAAW,iB,YCFtBrQ,EAAOC,QAGP,SAA6B2d,GAC3B,IAAKA,EACH,OAEF,GAAU,iCAANA,EACF,OAIFA,EAAIA,EAAEhP,OAAOnM,MAAM,MACnB,IAAIyS,EAAI,EACR,KAAO0I,EAAE1I,IAAM0I,EAAE1I,GAAGtG,OAAO9M,MAAM,WAC/BoT,IAEF,MAAM/D,EAAIyM,EAAE3jB,OACZ,IAAIwW,EAAIyE,EAAI,EACZ,KAAOzE,EAAIU,GAAKyM,EAAEnN,GAAG7B,QACnB6B,IAEF,OAAOmN,EAAExjB,MAAM8a,EAAGzE,GAAGzP,KAAK,KAAK4N,MACjC,C,kBCvBA,IAAIiP,EAAgB,EAAQ,OACxBC,EAAc,EAAQ,OACtBC,EAAkB,EAAQ,OAC1BC,EAAgB,EAAQ,OACxBC,EAAkB,EAAQ,OAC1BC,EAAW,CAAC,eAAgB,kBAAmB,wBAC/CC,EAAqB,EAAQ,OAC7BzZ,EAAM,EAAQ,OACd0Z,EAAQ,EAAQ,OAEhBC,EAAUzc,GAAOA,EAAIY,SAAS,MAASZ,EAAIjE,QAAQ,KAAOiE,EAAIsD,YAAY,KA2W9E,SAASoZ,EAAclhB,EAAMoC,GAS3B,OARIpC,EAAKmhB,SACPnhB,EAAKmhB,OAAS/e,EAAGpC,EAAKmhB,SACvB,CAAC,cAAe,gBAAgBxO,SAAQ,SAAUnT,GAC5CpC,MAAMqc,QAAQzZ,EAAKR,MAGxBQ,EAAKR,GAAOQ,EAAKR,GAAK4B,IAAIgB,GAC5B,IACOpC,CACT,CAEA,SAASohB,EAAeC,GACtB,GAAsB,iBAAXA,EACT,OAAOA,EAET,IAAIzW,EAAOyW,EAAOzW,MAAQ,GACtBpD,EAAI6Z,EAAO/Z,KAAO+Z,EAAOC,IACzBC,EAAa/Z,EAAK,KAAOA,EAAI,IAAO,GACpC6L,EAAIgO,EAAOG,OAASH,EAAOI,KAE/B,OAAO7W,GADYyI,EAAK,KAAOA,EAAI,IAAO,IACbkO,CAC/B,CAEA,SAASG,EAAaL,GACpB,GAAsB,iBAAXA,EACT,OAAOA,EAET,IAAIM,EAAcN,EAAO3c,MAAM,aAC3Bkd,EAAaP,EAAO3c,MAAM,gBAC1Bmd,EAAeR,EAAO3c,MAAM,cAC5BoV,EAAM,CAAC,EAUX,OATI6H,GAAeA,EAAY,GAAGnQ,SAChCsI,EAAIlP,KAAO+W,EAAY,GAAGnQ,QAExBqQ,IACF/H,EAAI0H,MAAQK,EAAa,IAEvBD,IACF9H,EAAIxS,IAAMsa,EAAW,IAEhB9H,CACT,CAnZAlX,EAAOC,QAAU,CAEf6R,KAAM,WAAa,EAEnBoN,mBAAoB,SAAU9hB,GAK5B,GAJIA,EAAK+hB,eACPlkB,KAAK6W,KAAK,gBACV1U,EAAKgiB,WAAahiB,EAAK+hB,aAAa,KAEjC/hB,EAAKgiB,WACR,OAAOnkB,KAAK6W,KAAK,qBAEY,iBAApB1U,EAAKgiB,aACdhiB,EAAKgiB,WAAa,CAChB7a,KAAM,MACNG,IAAKtH,EAAKgiB,aAGd,IAAIC,EAAIjiB,EAAKgiB,WAAW1a,KAAO,GAC/B,GAAI2a,EAAG,CACL,IAAIC,EAAStB,EAAcvT,QAAQ4U,GAC/BC,IACFD,EAAIjiB,EAAKgiB,WAAW1a,IACsB,aAAtC4a,EAAOrT,2BAA4CqT,EAAO3T,QAAU2T,EAAOxf,WAEnF,CAEIuf,EAAEvd,MAAM,wCACV7G,KAAK6W,KAAK,eAAgBuN,EAE9B,EAEAE,SAAU,SAAUniB,GAClBuB,OAAOwR,KAAKiO,EAAMoB,UAAUzP,SAAQ,SAAU6N,GACxCjf,OAAOiB,UAAU6E,eAAerE,KAAKhD,EAAMwgB,IAC7C3iB,KAAK6W,KAAK,OAAQ8L,EAAGQ,EAAMoB,SAAS5B,GAExC,GAAG3iB,KACL,EAEAwkB,gBAAiB,SAAUriB,GACzB,GAAKA,EAAKsiB,QAGV,MAA4B,iBAAjBtiB,EAAKsiB,SACdzkB,KAAK6W,KAAK,gCACH1U,EAAKsiB,cAGd/gB,OAAOwR,KAAK/S,EAAKsiB,SAAS3P,SAAQ,SAAUM,GACX,iBAApBjT,EAAKsiB,QAAQrP,IACtBpV,KAAK6W,KAAK,0BACH1U,EAAKsiB,QAAQrP,IACX+N,EAAMuB,OAAOtP,KAAOjT,EAAKsiB,QAAQtB,EAAMuB,OAAOtP,KACvDpV,KAAK6W,KAAK,OAAQzB,EAAG+N,EAAMuB,OAAOtP,GAAI,UAE1C,GAAGpV,KACL,EAEA2kB,cAAe,SAAUxiB,GACvB,IAAIyiB,EAAQziB,EAAKyiB,MACbA,IAAUrlB,MAAMqc,QAAQgJ,IAC1B5kB,KAAK6W,KAAK,wBACH1U,EAAKyiB,OACHziB,EAAKyiB,QACdziB,EAAKyiB,MAAQziB,EAAKyiB,MAAMnP,QAAO,SAAU3E,GACvC,SAAKA,GAAwB,iBAATA,KAClB9Q,KAAK6W,KAAK,kBAAmB/F,IACtB,EAIX,GAAG9Q,MAEP,EAEA6kB,YAAa,SAAU1iB,GACrB,GAAKA,EAAK2iB,KAGc,iBAAb3iB,EAAK2iB,IAAkB,CAChC,IACIje,EADAkW,EAAI,CAAC,GAELlW,EAAQ1E,EAAK4K,KAAKlG,MAAM,oBAC1BkW,EAAElW,EAAM,IAAM1E,EAAK2iB,IAEnB/H,EAAE5a,EAAK4K,MAAQ5K,EAAK2iB,IAEtB3iB,EAAK2iB,IAAM/H,CACb,CACF,EAEAgI,YAAa,SAAU5iB,GAChBA,EAAK6iB,KAGc,iBAAb7iB,EAAK6iB,MACd7iB,EAAK6iB,IAAM,CAAC7iB,EAAK6iB,KAErB,EACAC,2BAA4B,SAAU9iB,GACpC,IAAI+iB,EAAM,sBACNC,EAAK,qBACLhjB,EAAK+iB,KAAS/iB,EAAKgjB,KACrBhjB,EAAKgjB,GAAMhjB,EAAK+iB,UACT/iB,EAAK+iB,IAEV/iB,EAAKgjB,KAAQ5lB,MAAMqc,QAAQzZ,EAAKgjB,KAClCnlB,KAAK6W,KAAK,qCACH1U,EAAKgjB,IACHhjB,EAAKgjB,KACdhjB,EAAKgjB,GAAMhjB,EAAKgjB,GAAI1P,QAAO,SAAU2P,GACnC,OAAKA,GAAgC,iBAAbA,GAIjBjjB,EAAKkjB,eACRljB,EAAKkjB,aAAe,CAAC,GAElB3hB,OAAOiB,UAAU6E,eAAerE,KAAKhD,EAAKkjB,aAAcD,KAC3DplB,KAAK6W,KAAK,gCAAiCuO,GAC3CjjB,EAAKkjB,aAAaD,GAAY,MAEzB,IAVPplB,KAAK6W,KAAK,4BAA6BuO,IAChC,EAWX,GAAGplB,MAEP,EAEAslB,gBAAiB,SAAUnjB,EAAMyE,IAyTnC,SAAwBzE,EAAM0U,GAC5BoM,EAASnO,SAAQ,SAAUxL,GACpBnH,EAAKmH,KAGVnH,EAAKmH,GA9BT,SAAuBic,EAAMjc,EAAMuN,GACjC,IAAK0O,EACH,MAAO,CAAC,EAKV,GAHoB,iBAATA,IACTA,EAAOA,EAAK5R,OAAOnM,MAAM,mBAEtBjI,MAAMqc,QAAQ2J,GACjB,OAAOA,EAET1O,EAAK,8BAA+BvN,GACpC,IAAIoS,EAAI,CAAC,EAWT,OAVA6J,EAAK9P,QAAO,SAAUkN,GACpB,MAAoB,iBAANA,CAChB,IAAG7N,SAAQ,SAAU6N,GAEnB,IAAI6C,GADJ7C,EAAIA,EAAEhP,OAAOnM,MAAM,iBACRyT,QACPwK,EAAK9C,EAAE5c,KAAK,IAEhB0f,GADAA,EAAKA,EAAG9R,QACAhM,QAAQ,KAAM,IACtB+T,EAAE8J,GAAMC,CACV,IACO/J,CACT,CAOiBgK,CAAavjB,EAAKmH,GAAOA,EAAMuN,GAC9C,GACF,CA/TI8O,CAAcxjB,EAAMnC,KAAK6W,MAmR7B,SAAgC1U,EAAM0U,GACpC,IAAI6E,EAAIvZ,EAAKyjB,qBACb,GAAKlK,EAAL,CAGA,IAAIiH,EAAIxgB,EAAKkjB,cAAgB,CAAC,EAC9B3hB,OAAOwR,KAAKwG,GAAG5G,SAAQ,SAAUM,GAC/BuN,EAAEvN,GAAKsG,EAAEtG,EACX,IACAjT,EAAKkjB,aAAe1C,CALpB,CAMF,CA5RIkD,CAAsB1jB,EAAMnC,KAAK6W,MACjC7W,KAAKilB,2BAA2B9iB,GAE/B,CAAC,eAAgB,mBAAmB2S,SAAQ,SAAUyQ,GACrD,GAAMA,KAAQpjB,EAGd,OAAKA,EAAKojB,IAA+B,iBAAfpjB,EAAKojB,QAK/B7hB,OAAOwR,KAAK/S,EAAKojB,IAAOzQ,SAAQ,SAAU6N,GACxC,IAAIyB,EAAIjiB,EAAKojB,GAAM5C,GACF,iBAANyB,IACTpkB,KAAK6W,KAAK,sBAAuB8L,EAAG/S,KAAKC,UAAUuU,WAC5CjiB,EAAKojB,GAAM5C,IAEpB,IAAI0B,EAAStB,EAAcvT,QAAQrN,EAAKojB,GAAM5C,IAC1C0B,IACFliB,EAAKojB,GAAM5C,GAAK0B,EAAOxf,WAE3B,GAAG7E,OAdDA,KAAK6W,KAAK,wBAAyB0O,eAC5BpjB,EAAKojB,GAchB,GAAGvlB,KACL,EAEA8lB,gBAAiB,SAAU3jB,GACrBA,EAAK4jB,UACP/lB,KAAK6W,KAAK,4BACH1U,EAAK4jB,QAEhB,EAEAC,iBAAkB,SAAU7jB,GACG,iBAAlBA,EAAKmgB,WACdngB,EAAKmgB,SAAWngB,EAAKmgB,SAAS9a,MAAM,SAElCrF,EAAKmgB,WAAa/iB,MAAMqc,QAAQzZ,EAAKmgB,kBAChCngB,EAAKmgB,SACZtiB,KAAK6W,KAAK,qBACD1U,EAAKmgB,WACdngB,EAAKmgB,SAAWngB,EAAKmgB,SAAS7M,QAAO,SAAUwQ,GAC7C,QAAkB,iBAAPA,IAAoBA,KAC7BjmB,KAAK6W,KAAK,qBACH,EAIX,GAAG7W,MAEP,EAEAkmB,gBAAiB,SAAU/jB,EAAMyE,GAG/B,IAAIuf,GAASvf,EACb,IAAKzE,EAAKikB,QAER,OADAjkB,EAAKikB,QAAU,IACR,EAET,IAAKxD,EAAczgB,EAAKikB,QAASD,GAC/B,MAAM,IAAIriB,MAAM,qBAAuB3B,EAAKikB,QAAU,KAGxD,OADAjkB,EAAKikB,QAAUvD,EAAY1gB,EAAKikB,QAASD,IAClC,CACT,EAEAE,UAAW,SAAUlkB,GACnBkhB,EAAalhB,EAAMohB,GACnBF,EAAalhB,EAAM0hB,EACrB,EAEAyC,aAAc,SAAUnkB,EAAM8N,GACL,kBAAZA,EACTA,EAAU,CAAErJ,OAAQqJ,QACQ,IAAZA,IAChBA,EAAU,CAAC,GAEb,IAAIrJ,EAASqJ,EAAQrJ,OACrB,GAAKzE,EAAK4K,MAASnG,EAAnB,CAIA,GAAyB,iBAAdzE,EAAK4K,KACd,MAAM,IAAIjJ,MAAM,gCAEb8C,IACHzE,EAAK4K,KAAO5K,EAAK4K,KAAK4G,QAqI5B,SAA0B5G,EAAMnG,EAAQ2f,GACtC,GAAuB,MAAnBxZ,EAAKoT,OAAO,KArBlB,SAAmClD,GACjC,GAAuB,MAAnBA,EAAKkD,OAAO,GACd,OAAO,EAGT,IAAIqG,EAAOvJ,EAAK9d,MAAM,GAAGqI,MAAM,KAC/B,OAAoB,IAAhBgf,EAAKxnB,SAIFwnB,EAAK,IAAMA,EAAK,IACrBA,EAAK,KAAOnZ,mBAAmBmZ,EAAK,KACpCA,EAAK,KAAOnZ,mBAAmBmZ,EAAK,IACxC,CASQC,CAAyB1Z,MAPAkQ,EAOgClQ,GANlDlG,MAAM,cACjBoW,IAAS5P,mBAAmB4P,KAMzBrW,IAAY2f,GAAoBxZ,IAASA,EAAKS,eACxB,iBAAvBT,EAAKS,eACkB,gBAAvBT,EAAKS,cACP,MAAM,IAAI1J,MAAM,iBAAmB8L,KAAKC,UAAU9C,IAXtD,IAAiCkQ,CAajC,CA3IIyJ,CAAgBvkB,EAAK4K,KAAMnG,EAAQqJ,EAAQsW,iBACvCvD,EAAgB7gB,EAAK4K,OACvB/M,KAAK6W,KAAK,kBAAmB1U,EAAK4K,KATpC,MAFE5K,EAAK4K,KAAO,EAahB,EAEA4Z,oBAAqB,SAAUxkB,GACzBA,EAAKykB,aAA2C,iBAArBzkB,EAAKykB,cAClC5mB,KAAK6W,KAAK,+BACH1U,EAAKykB,aAEVzkB,EAAK0kB,SAAW1kB,EAAKykB,cACvBzkB,EAAKykB,YAAc1D,EAAmB/gB,EAAK0kB,cAEpBtlB,IAArBY,EAAKykB,oBACAzkB,EAAKykB,YAETzkB,EAAKykB,aACR5mB,KAAK6W,KAAK,qBAEd,EAEAiQ,eAAgB,SAAU3kB,GACnBA,EAAK0kB,SACR7mB,KAAK6W,KAAK,iBACV1U,EAAK0kB,OAAS,+BAElB,EAEAE,aAAc,SAAU5kB,GACtB,IAAKA,EAAKsO,MAAQtO,EAAKgiB,YAAchiB,EAAKgiB,WAAW1a,IAAK,CACxD,IAAI4a,EAAStB,EAAcvT,QAAQrN,EAAKgiB,WAAW1a,KAC/C4a,GAAUA,EAAO5T,SACnBtO,EAAKsO,KAAO,CAAEhH,IAAK4a,EAAO5T,QAE9B,MAAO,GAAItO,EAAKsO,KAAM,CACpB,GAAyB,iBAAdtO,EAAKsO,KACV2S,EAAQjhB,EAAKsO,MACftO,EAAKsO,KAAO,CAAEkT,MAAOxhB,EAAKsO,MAEjBhH,EAAIud,MAAM7kB,EAAKsO,MAAM5E,SAC9B1J,EAAKsO,KAAO,CAAEhH,IAAKtH,EAAKsO,MAExBzQ,KAAK6W,KAAK,6BAEP,CA0LOpG,EAzLFtO,EAAKsO,KAyLGoG,EAzLG7W,KAAK6W,KA0L3BpG,GAGL/M,OAAOwR,KAAKzE,GAAMqE,SAAQ,SAAUM,GAC9B+N,EAAM1S,KAAK2E,KACbyB,EAAK,OAAQzB,EAAG+N,EAAM1S,KAAK2E,GAAI,QAC/B3E,EAAK0S,EAAM1S,KAAK2E,IAAM3E,EAAK2E,UACpB3E,EAAK2E,GAEhB,IAlMM,IAAI6R,EAAU9kB,EAAKsO,KACnBtO,EAAKsO,KAAO,CAAC,EACTwW,EAAQxd,MAEmB,iBAAjBwd,EAAW,KAAkBxd,EAAIud,MAAMC,EAAQxd,KAAKoC,SAC9D1J,EAAKsO,KAAKhH,IAAMwd,EAAQxd,IAExBzJ,KAAK6W,KAAK,uBAGVoQ,EAAQtD,QACqB,iBAAnBsD,EAAa,OAAkB7D,EAAQ6D,EAAQtD,OACzDxhB,EAAKsO,KAAKkT,MAAQsD,EAAQtD,MAE1B3jB,KAAK6W,KAAK,0BAGhB,CACK1U,EAAKsO,KAAKkT,OAAUxhB,EAAKsO,KAAKhH,aAC1BtH,EAAKsO,KACZzQ,KAAK6W,KAAK,uBAEd,CAkKJ,IAAoBpG,EAAMoG,CAjKxB,EAEAqQ,iBAAkB,SAAU/kB,GAC1B,IAAKA,EAAKglB,UAAYhlB,EAAKgiB,YAAchiB,EAAKgiB,WAAW1a,IAAK,CAC5D,IAAI4a,EAAStB,EAAcvT,QAAQrN,EAAKgiB,WAAW1a,KAC/C4a,GAAUA,EAAO7T,SACnBrO,EAAKglB,SAAW9C,EAAO7T,OAE3B,CACA,GAAKrO,EAAKglB,SAIV,MAA6B,iBAAlBhlB,EAAKglB,UACdnnB,KAAK6W,KAAK,yBACI1U,EAAKglB,eAGhB1d,EAAIud,MAAM7kB,EAAKglB,UAAUtb,WAC5B1J,EAAKglB,SAAW,UAAYhlB,EAAKglB,UAErC,EAEAC,gBAAiB,SAAUjlB,GACzB,MAAMklB,EAAUllB,EAAKklB,SAAWllB,EAAKmlB,QACrC,OAAKD,EAIkB,iBAAd,GACPA,EAAQroB,OAAS,GACE,KAAnBqoB,EAAQ1T,OAED3T,KAAK6W,KAAK,kBAEdiM,EAAgBuE,GAASE,yBAA9B,EACSvnB,KAAK6W,KAAK,kBAVV7W,KAAK6W,KAAK,iBAYrB,E,kBCpVF,IAAI2Q,EAAO,EAAQ,OACfC,EAAW,EAAQ,OAcvB,SAASC,EAAiBC,EAAcC,EAAcvM,GAKpD,OAJIA,IACFsM,EAAetM,EAAQ,KAAOsM,EAAe,KAC7CC,EAAevM,EAAQ,KAAOuM,EAAe,MAExCJ,EAAKK,OAAOJ,EAASK,KAAMH,EAAcC,EAClD,CAlBA7iB,EAAOC,QAAU,WACf,IAAIjG,EAAOQ,MAAMoF,UAAUxF,MAAMgG,KAAK7F,UAAW,GAC7CyoB,EAAchpB,EAAKkc,QACvB,GAAoB,SAAhB8M,EACF,OAAOL,EAAgBliB,MAAM,KAAMzG,GAEnC,IAAIipB,EAAcP,EAASM,GAAeN,EAASM,GAAeA,EAAc,SAEhF,OADAhpB,EAAK+W,QAAQkS,GACNR,EAAKK,OAAOriB,MAAM,KAAMzG,EAEnC,C,kBCbAgG,EAAOC,QAAUijB,EAEjB,IAAIC,EAAQ,EAAQ,OACpBD,EAAUC,MAAQA,EAElB,IAAIC,EAAc,EAAQ,OAMtBC,EAJc,CAAC,OAAQ,UAAW,cAAe,aAAc,UAAW,UAC5E,QAAS,MAAO,MAAO,OAAQ,WAAY,SAAU,WAAY,WAGrC7kB,KAAI,SAAU8kB,GAC1C,OAAOC,EAAQD,GAAa,OAC9B,IAMA,SAASJ,EAAW9lB,EAAM0U,EAAMjQ,IACjB,IAATiQ,IACFA,EAAO,KACPjQ,GAAS,GAENA,IACHA,GAAS,GAENiQ,IAAQ1U,EAAKomB,UAChB1R,EAAO,SAAU2R,GAAkB,GAGjCrmB,EAAKsiB,SACoB,qBAAzBtiB,EAAKsiB,QAAQgE,UACZtmB,EAAKsiB,QAAQiE,aAChBvmB,EAAKwmB,SAAU,GAEjBT,EAAMrR,KAAO,WACXA,EAAKsR,EAAY3iB,MAAM,KAAMlG,WAC/B,EACA8oB,EAAYtT,SAAQ,SAAU8T,GAC5BV,EAAM,MAAQI,EAAQM,IAAYzmB,EAAMyE,EAC1C,IACAzE,EAAK0mB,IAAM1mB,EAAK4K,KAAO,IAAM5K,EAAKikB,OACpC,CAEA,SAASkC,EAASpH,GAChB,OAAOA,EAAOf,OAAO,GAAG2I,cAAgB5H,EAAO/hB,MAAM,EACvD,CA9BAipB,EAAcA,EAAY3iB,OARH,CAAC,eAAgB,SAAU,S,kBCTlD,MAAMsjB,EAAQ,EAAQ,QAChB,WAAEC,EAAU,iBAAElR,GAAqB,EAAQ,QAC3C,GAAE2H,EAAE,EAAElG,GAAM,EAAQ,OAEpB0P,EAAe,EAAQ,QACvB,mBAAEC,GAAuB,EAAQ,OACvC,MAAMC,EACJ7lB,YAAa8iB,EAASnW,GAGpB,GAFAA,EAAUgZ,EAAahZ,GAEnBmW,aAAmB+C,EAAQ,CAC7B,GAAI/C,EAAQD,UAAYlW,EAAQkW,OAC5BC,EAAQgD,sBAAwBnZ,EAAQmZ,kBAC1C,OAAOhD,EAEPA,EAAUA,EAAQA,OAEtB,MAAO,GAAuB,iBAAZA,EAChB,MAAM,IAAIhhB,UAAU,oBAAoBghB,KAG1C,GAAIA,EAAQpnB,OAASgqB,EACnB,MAAM,IAAI5jB,UACR,0BAA0B4jB,gBAI9BD,EAAM,SAAU3C,EAASnW,GACzBjQ,KAAKiQ,QAAUA,EACfjQ,KAAKmmB,QAAUlW,EAAQkW,MAGvBnmB,KAAKopB,oBAAsBnZ,EAAQmZ,kBAEnC,MAAMC,EAAIjD,EAAQzS,OAAO9M,MAAMoJ,EAAQkW,MAAQ1G,EAAGlG,EAAE+P,OAAS7J,EAAGlG,EAAEgQ,OAElE,IAAKF,EACH,MAAM,IAAIjkB,UAAU,oBAAoBghB,KAU1C,GAPApmB,KAAKwpB,IAAMpD,EAGXpmB,KAAKypB,OAASJ,EAAE,GAChBrpB,KAAK0pB,OAASL,EAAE,GAChBrpB,KAAK2pB,OAASN,EAAE,GAEZrpB,KAAKypB,MAAQ3R,GAAoB9X,KAAKypB,MAAQ,EAChD,MAAM,IAAIrkB,UAAU,yBAGtB,GAAIpF,KAAK0pB,MAAQ5R,GAAoB9X,KAAK0pB,MAAQ,EAChD,MAAM,IAAItkB,UAAU,yBAGtB,GAAIpF,KAAK2pB,MAAQ7R,GAAoB9X,KAAK2pB,MAAQ,EAChD,MAAM,IAAIvkB,UAAU,yBAIjBikB,EAAE,GAGLrpB,KAAK4pB,WAAaP,EAAE,GAAG7hB,MAAM,KAAKjE,KAAKjC,IACrC,GAAI,WAAWmG,KAAKnG,GAAK,CACvB,MAAMuoB,GAAOvoB,EACb,GAAIuoB,GAAO,GAAKA,EAAM/R,EACpB,OAAO+R,CAEX,CACA,OAAOvoB,KATTtB,KAAK4pB,WAAa,GAapB5pB,KAAK8pB,MAAQT,EAAE,GAAKA,EAAE,GAAG7hB,MAAM,KAAO,GACtCxH,KAAK6nB,QACP,CAEAA,SAKE,OAJA7nB,KAAKomB,QAAU,GAAGpmB,KAAKypB,SAASzpB,KAAK0pB,SAAS1pB,KAAK2pB,QAC/C3pB,KAAK4pB,WAAW5qB,SAClBgB,KAAKomB,SAAW,IAAIpmB,KAAK4pB,WAAW7jB,KAAK,QAEpC/F,KAAKomB,OACd,CAEAvhB,WACE,OAAO7E,KAAKomB,OACd,CAEA2D,QAASC,GAEP,GADAjB,EAAM,iBAAkB/oB,KAAKomB,QAASpmB,KAAKiQ,QAAS+Z,KAC9CA,aAAiBb,GAAS,CAC9B,GAAqB,iBAAVa,GAAsBA,IAAUhqB,KAAKomB,QAC9C,OAAO,EAET4D,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,QACjC,CAEA,OAAI+Z,EAAM5D,UAAYpmB,KAAKomB,QAClB,EAGFpmB,KAAKiqB,YAAYD,IAAUhqB,KAAKkqB,WAAWF,EACpD,CAEAC,YAAaD,GAKX,OAJMA,aAAiBb,IACrBa,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,UAI/BiZ,EAAmBlpB,KAAKypB,MAAOO,EAAMP,QACrCP,EAAmBlpB,KAAK0pB,MAAOM,EAAMN,QACrCR,EAAmBlpB,KAAK2pB,MAAOK,EAAML,MAEzC,CAEAO,WAAYF,GAMV,GALMA,aAAiBb,IACrBa,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,UAI7BjQ,KAAK4pB,WAAW5qB,SAAWgrB,EAAMJ,WAAW5qB,OAC9C,OAAQ,EACH,IAAKgB,KAAK4pB,WAAW5qB,QAAUgrB,EAAMJ,WAAW5qB,OACrD,OAAO,EACF,IAAKgB,KAAK4pB,WAAW5qB,SAAWgrB,EAAMJ,WAAW5qB,OACtD,OAAO,EAGT,IAAI4G,EAAI,EACR,EAAG,CACD,MAAMkX,EAAI9c,KAAK4pB,WAAWhkB,GACpBmX,EAAIiN,EAAMJ,WAAWhkB,GAE3B,GADAmjB,EAAM,qBAAsBnjB,EAAGkX,EAAGC,QACxBxb,IAANub,QAAyBvb,IAANwb,EACrB,OAAO,EACF,QAAUxb,IAANwb,EACT,OAAO,EACF,QAAUxb,IAANub,EACT,OAAQ,EACH,GAAIA,IAAMC,EAGf,OAAOmM,EAAmBpM,EAAGC,EAEjC,SAAWnX,EACb,CAEAukB,aAAcH,GACNA,aAAiBb,IACrBa,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,UAGjC,IAAIrK,EAAI,EACR,EAAG,CACD,MAAMkX,EAAI9c,KAAK8pB,MAAMlkB,GACfmX,EAAIiN,EAAMF,MAAMlkB,GAEtB,GADAmjB,EAAM,qBAAsBnjB,EAAGkX,EAAGC,QACxBxb,IAANub,QAAyBvb,IAANwb,EACrB,OAAO,EACF,QAAUxb,IAANwb,EACT,OAAO,EACF,QAAUxb,IAANub,EACT,OAAQ,EACH,GAAIA,IAAMC,EAGf,OAAOmM,EAAmBpM,EAAGC,EAEjC,SAAWnX,EACb,CAIAwkB,IAAK9lB,EAAS+lB,GACZ,OAAQ/lB,GACN,IAAK,WACHtE,KAAK4pB,WAAW5qB,OAAS,EACzBgB,KAAK2pB,MAAQ,EACb3pB,KAAK0pB,MAAQ,EACb1pB,KAAKypB,QACLzpB,KAAKoqB,IAAI,MAAOC,GAChB,MACF,IAAK,WACHrqB,KAAK4pB,WAAW5qB,OAAS,EACzBgB,KAAK2pB,MAAQ,EACb3pB,KAAK0pB,QACL1pB,KAAKoqB,IAAI,MAAOC,GAChB,MACF,IAAK,WAIHrqB,KAAK4pB,WAAW5qB,OAAS,EACzBgB,KAAKoqB,IAAI,QAASC,GAClBrqB,KAAKoqB,IAAI,MAAOC,GAChB,MAGF,IAAK,aAC4B,IAA3BrqB,KAAK4pB,WAAW5qB,QAClBgB,KAAKoqB,IAAI,QAASC,GAEpBrqB,KAAKoqB,IAAI,MAAOC,GAChB,MAEF,IAAK,QAMc,IAAfrqB,KAAK0pB,OACU,IAAf1pB,KAAK2pB,OACsB,IAA3B3pB,KAAK4pB,WAAW5qB,QAEhBgB,KAAKypB,QAEPzpB,KAAK0pB,MAAQ,EACb1pB,KAAK2pB,MAAQ,EACb3pB,KAAK4pB,WAAa,GAClB,MACF,IAAK,QAKgB,IAAf5pB,KAAK2pB,OAA0C,IAA3B3pB,KAAK4pB,WAAW5qB,QACtCgB,KAAK0pB,QAEP1pB,KAAK2pB,MAAQ,EACb3pB,KAAK4pB,WAAa,GAClB,MACF,IAAK,QAK4B,IAA3B5pB,KAAK4pB,WAAW5qB,QAClBgB,KAAK2pB,QAEP3pB,KAAK4pB,WAAa,GAClB,MAGF,IAAK,MACH,GAA+B,IAA3B5pB,KAAK4pB,WAAW5qB,OAClBgB,KAAK4pB,WAAa,CAAC,OACd,CACL,IAAIhkB,EAAI5F,KAAK4pB,WAAW5qB,OACxB,OAAS4G,GAAK,GACsB,iBAAvB5F,KAAK4pB,WAAWhkB,KACzB5F,KAAK4pB,WAAWhkB,KAChBA,GAAK,IAGE,IAAPA,GAEF5F,KAAK4pB,WAAW/jB,KAAK,EAEzB,CACIwkB,IAGErqB,KAAK4pB,WAAW,KAAOS,EACrBC,MAAMtqB,KAAK4pB,WAAW,MACxB5pB,KAAK4pB,WAAa,CAACS,EAAY,IAGjCrqB,KAAK4pB,WAAa,CAACS,EAAY,IAGnC,MAEF,QACE,MAAM,IAAIvmB,MAAM,+BAA+BQ,KAInD,OAFAtE,KAAK6nB,SACL7nB,KAAKwpB,IAAMxpB,KAAKomB,QACTpmB,IACT,EAGF+E,EAAOC,QAAUmkB,C,kBC9RjB,MAAMnC,EAAQ,EAAQ,OAKtBjiB,EAAOC,QAJO,CAACohB,EAASnW,KACtB,MAAMgK,EAAI+M,EAAMZ,EAAQzS,OAAOhM,QAAQ,SAAU,IAAKsI,GACtD,OAAOgK,EAAIA,EAAEmM,QAAU,K,kBCHzB,MAAM,WAAC4C,GAAc,EAAQ,QACvB,GAAEvJ,EAAE,EAAElG,GAAM,EAAQ,OACpB4P,EAAS,EAAQ,OAEjBF,EAAe,EAAQ,OA4B7BlkB,EAAOC,QA3BO,CAACohB,EAASnW,KAGtB,GAFAA,EAAUgZ,EAAahZ,GAEnBmW,aAAmB+C,EACrB,OAAO/C,EAGT,GAAuB,iBAAZA,EACT,OAAO,KAGT,GAAIA,EAAQpnB,OAASgqB,EACnB,OAAO,KAIT,KADU/Y,EAAQkW,MAAQ1G,EAAGlG,EAAE+P,OAAS7J,EAAGlG,EAAEgQ,OACtC9hB,KAAK2e,GACV,OAAO,KAGT,IACE,OAAO,IAAI+C,EAAO/C,EAASnW,EAG7B,CAFE,MAAOsa,GACP,OAAO,IACT,E,kBC7BF,MAAMvD,EAAQ,EAAQ,OAKtBjiB,EAAOC,QAJO,CAACohB,EAASnW,KACtB,MAAMsF,EAAIyR,EAAMZ,EAASnW,GACzB,OAAOsF,EAAIA,EAAE6Q,QAAU,K,YCDzB,MAGMtO,EAAmBD,OAAOC,kBACH,iBAK7B/S,EAAOC,QAAU,CACfwlB,oBAV0B,QAW1BxB,WATiB,IAUjBlR,mBACA2S,0BANgC,G,YCTlC,MAAM1B,EACe,iBAAZ/gB,SACPA,QAAQ0iB,KACR1iB,QAAQ0iB,IAAIC,YACZ,cAAcljB,KAAKO,QAAQ0iB,IAAIC,YAC7B,IAAI5rB,IAAS6rB,QAAQlO,MAAM,YAAa3d,GACxC,OAEJgG,EAAOC,QAAU+jB,C,YCRjB,MAAM8B,EAAU,WACV3B,EAAqB,CAACpM,EAAGC,KAC7B,MAAM+N,EAAOD,EAAQpjB,KAAKqV,GACpBiO,EAAOF,EAAQpjB,KAAKsV,GAO1B,OALI+N,GAAQC,IACVjO,GAAKA,EACLC,GAAKA,GAGAD,IAAMC,EAAI,EACZ+N,IAASC,GAAS,EAClBA,IAASD,EAAQ,EAClBhO,EAAIC,GAAK,EACT,GAKNhY,EAAOC,QAAU,CACfkkB,qBACA8B,oBAJ0B,CAAClO,EAAGC,IAAMmM,EAAmBnM,EAAGD,G,YCf5D,MAAM5d,EAAO,CAAC,oBAAqB,QAAS,OAQ5C6F,EAAOC,QAPciL,GAClBA,EACoB,iBAAZA,EAAuB,CAAEkW,OAAO,GACvCjnB,EAAKuW,QAAOL,GAAKnF,EAAQmF,KAAI6V,QAAO,CAAChb,EAASmF,KAC9CnF,EAAQmF,IAAK,EACNnF,IACN,CAAC,GALO,CAAC,C,kBCJd,MAAM,0BAAEwa,GAA8B,EAAQ,OACxC1B,EAAQ,EAAQ,OAIhBtJ,GAHNza,EAAUD,EAAOC,QAAU,CAAC,GAGTya,GAAK,GAClB5b,EAAMmB,EAAQnB,IAAM,GACpB0V,EAAIvU,EAAQuU,EAAI,CAAC,EACvB,IAAI2R,EAAI,EAER,MAAMC,EAAc,CAACpe,EAAM1M,EAAO+qB,KAChC,MAAMpkB,EAAQkkB,IACdnC,EAAM/hB,EAAO3G,GACbkZ,EAAExM,GAAQ/F,EACVnD,EAAImD,GAAS3G,EACbof,EAAGzY,GAAS,IAAIiC,OAAO5I,EAAO+qB,EAAW,SAAM7pB,EAAS,EAS1D4pB,EAAY,oBAAqB,eACjCA,EAAY,yBAA0B,UAMtCA,EAAY,uBAAwB,8BAKpCA,EAAY,cAAe,IAAItnB,EAAI0V,EAAE8R,0BACdxnB,EAAI0V,EAAE8R,0BACNxnB,EAAI0V,EAAE8R,uBAE7BF,EAAY,mBAAoB,IAAItnB,EAAI0V,EAAE+R,+BACdznB,EAAI0V,EAAE+R,+BACNznB,EAAI0V,EAAE+R,4BAKlCH,EAAY,uBAAwB,MAAMtnB,EAAI0V,EAAE8R,sBAC5CxnB,EAAI0V,EAAEgS,0BAEVJ,EAAY,4BAA6B,MAAMtnB,EAAI0V,EAAE+R,2BACjDznB,EAAI0V,EAAEgS,0BAMVJ,EAAY,aAAc,QAAQtnB,EAAI0V,EAAEiS,8BAC/B3nB,EAAI0V,EAAEiS,6BAEfL,EAAY,kBAAmB,SAAStnB,EAAI0V,EAAEkS,mCACrC5nB,EAAI0V,EAAEkS,kCAKfN,EAAY,kBAAmB,iBAM/BA,EAAY,QAAS,UAAUtnB,EAAI0V,EAAEmS,yBAC5B7nB,EAAI0V,EAAEmS,wBAWfP,EAAY,YAAa,KAAKtnB,EAAI0V,EAAEoS,eACjC9nB,EAAI0V,EAAEqS,eACP/nB,EAAI0V,EAAEsS,WAERV,EAAY,OAAQ,IAAItnB,EAAI0V,EAAEuS,eAK9BX,EAAY,aAAc,WAAWtnB,EAAI0V,EAAEwS,oBACxCloB,EAAI0V,EAAEyS,oBACPnoB,EAAI0V,EAAEsS,WAERV,EAAY,QAAS,IAAItnB,EAAI0V,EAAE0S,gBAE/Bd,EAAY,OAAQ,gBAKpBA,EAAY,wBAAyB,GAAGtnB,EAAI0V,EAAE+R,mCAC9CH,EAAY,mBAAoB,GAAGtnB,EAAI0V,EAAE8R,8BAEzCF,EAAY,cAAe,YAAYtnB,EAAI0V,EAAE2S,4BAChBroB,EAAI0V,EAAE2S,4BACNroB,EAAI0V,EAAE2S,wBACVroB,EAAI0V,EAAEqS,gBACV/nB,EAAI0V,EAAEsS,eAG3BV,EAAY,mBAAoB,YAAYtnB,EAAI0V,EAAE4S,iCAChBtoB,EAAI0V,EAAE4S,iCACNtoB,EAAI0V,EAAE4S,6BACVtoB,EAAI0V,EAAEyS,qBACVnoB,EAAI0V,EAAEsS,eAGhCV,EAAY,SAAU,IAAItnB,EAAI0V,EAAE6S,YAAYvoB,EAAI0V,EAAE8S,iBAClDlB,EAAY,cAAe,IAAItnB,EAAI0V,EAAE6S,YAAYvoB,EAAI0V,EAAE+S,sBAIvDnB,EAAY,SAAU,oBACIV,mBACIA,qBACAA,qBAE9BU,EAAY,YAAatnB,EAAI0V,EAAEgT,SAAS,GAIxCpB,EAAY,YAAa,WAEzBA,EAAY,YAAa,SAAStnB,EAAI0V,EAAEiT,kBAAkB,GAC1DxnB,EAAQynB,iBAAmB,MAE3BtB,EAAY,QAAS,IAAItnB,EAAI0V,EAAEiT,aAAa3oB,EAAI0V,EAAE8S,iBAClDlB,EAAY,aAAc,IAAItnB,EAAI0V,EAAEiT,aAAa3oB,EAAI0V,EAAE+S,sBAIvDnB,EAAY,YAAa,WAEzBA,EAAY,YAAa,SAAStnB,EAAI0V,EAAEmT,kBAAkB,GAC1D1nB,EAAQ2nB,iBAAmB,MAE3BxB,EAAY,QAAS,IAAItnB,EAAI0V,EAAEmT,aAAa7oB,EAAI0V,EAAE8S,iBAClDlB,EAAY,aAAc,IAAItnB,EAAI0V,EAAEmT,aAAa7oB,EAAI0V,EAAE+S,sBAGvDnB,EAAY,kBAAmB,IAAItnB,EAAI0V,EAAE6S,aAAavoB,EAAI0V,EAAE0S,oBAC5Dd,EAAY,aAAc,IAAItnB,EAAI0V,EAAE6S,aAAavoB,EAAI0V,EAAEuS,mBAIvDX,EAAY,iBAAkB,SAAStnB,EAAI0V,EAAE6S,aACrCvoB,EAAI0V,EAAE0S,eAAepoB,EAAI0V,EAAE8S,iBAAiB,GACpDrnB,EAAQ4nB,sBAAwB,SAMhCzB,EAAY,cAAe,SAAStnB,EAAI0V,EAAE8S,0BAEnBxoB,EAAI0V,EAAE8S,sBAG7BlB,EAAY,mBAAoB,SAAStnB,EAAI0V,EAAE+S,+BAEnBzoB,EAAI0V,EAAE+S,2BAIlCnB,EAAY,OAAQ,mBAEpBA,EAAY,OAAQ,yBACpBA,EAAY,UAAW,0B,kBCrLvB,MAAM0B,EAAMtsB,OAAO,cAEnB,MAAMusB,EACOD,iBACT,OAAOA,CACT,CAEAvpB,YAAaypB,EAAM9c,GAGjB,GAFAA,EAAUgZ,EAAahZ,GAEnB8c,aAAgBD,EAAY,CAC9B,GAAIC,EAAK5G,UAAYlW,EAAQkW,MAC3B,OAAO4G,EAEPA,EAAOA,EAAK1sB,KAEhB,CAEA0oB,EAAM,aAAcgE,EAAM9c,GAC1BjQ,KAAKiQ,QAAUA,EACfjQ,KAAKmmB,QAAUlW,EAAQkW,MACvBnmB,KAAKgnB,MAAM+F,GAEP/sB,KAAKgtB,SAAWH,EAClB7sB,KAAKK,MAAQ,GAEbL,KAAKK,MAAQL,KAAKitB,SAAWjtB,KAAKgtB,OAAO5G,QAG3C2C,EAAM,OAAQ/oB,KAChB,CAEAgnB,MAAO+F,GACL,MAAM3I,EAAIpkB,KAAKiQ,QAAQkW,MAAQ1G,EAAGlG,EAAE2T,iBAAmBzN,EAAGlG,EAAE4T,YACtD9D,EAAI0D,EAAKlmB,MAAMud,GAErB,IAAKiF,EACH,MAAM,IAAIjkB,UAAU,uBAAuB2nB,KAG7C/sB,KAAKitB,cAAoB1rB,IAAT8nB,EAAE,GAAmBA,EAAE,GAAK,GACtB,MAAlBrpB,KAAKitB,WACPjtB,KAAKitB,SAAW,IAIb5D,EAAE,GAGLrpB,KAAKgtB,OAAS,IAAI7D,EAAOE,EAAE,GAAIrpB,KAAKiQ,QAAQkW,OAF5CnmB,KAAKgtB,OAASH,CAIlB,CAEAhoB,WACE,OAAO7E,KAAKK,KACd,CAEAoH,KAAM2e,GAGJ,GAFA2C,EAAM,kBAAmB3C,EAASpmB,KAAKiQ,QAAQkW,OAE3CnmB,KAAKgtB,SAAWH,GAAOzG,IAAYyG,EACrC,OAAO,EAGT,GAAuB,iBAAZzG,EACT,IACEA,EAAU,IAAI+C,EAAO/C,EAASpmB,KAAKiQ,QAGrC,CAFE,MAAOsa,GACP,OAAO,CACT,CAGF,OAAO6C,EAAIhH,EAASpmB,KAAKitB,SAAUjtB,KAAKgtB,OAAQhtB,KAAKiQ,QACvD,CAEAod,WAAYN,EAAM9c,GAChB,KAAM8c,aAAgBD,GACpB,MAAM,IAAI1nB,UAAU,4BAUtB,GAPK6K,GAA8B,iBAAZA,IACrBA,EAAU,CACRkW,QAASlW,EACTmZ,mBAAmB,IAID,KAAlBppB,KAAKitB,SACP,MAAmB,KAAfjtB,KAAKK,OAGF,IAAIitB,EAAMP,EAAK1sB,MAAO4P,GAASxI,KAAKzH,KAAKK,OAC3C,GAAsB,KAAlB0sB,EAAKE,SACd,MAAmB,KAAfF,EAAK1sB,OAGF,IAAIitB,EAAMttB,KAAKK,MAAO4P,GAASxI,KAAKslB,EAAKC,QAGlD,MAAMO,IACe,OAAlBvtB,KAAKitB,UAAuC,MAAlBjtB,KAAKitB,UACb,OAAlBF,EAAKE,UAAuC,MAAlBF,EAAKE,UAC5BO,IACe,OAAlBxtB,KAAKitB,UAAuC,MAAlBjtB,KAAKitB,UACb,OAAlBF,EAAKE,UAAuC,MAAlBF,EAAKE,UAC5BQ,EAAaztB,KAAKgtB,OAAO5G,UAAY2G,EAAKC,OAAO5G,QACjDsH,IACe,OAAlB1tB,KAAKitB,UAAuC,OAAlBjtB,KAAKitB,UACb,OAAlBF,EAAKE,UAAuC,OAAlBF,EAAKE,UAC5BU,EACJP,EAAIptB,KAAKgtB,OAAQ,IAAKD,EAAKC,OAAQ/c,KAChB,OAAlBjQ,KAAKitB,UAAuC,MAAlBjtB,KAAKitB,YACX,OAAlBF,EAAKE,UAAuC,MAAlBF,EAAKE,UAC9BW,EACJR,EAAIptB,KAAKgtB,OAAQ,IAAKD,EAAKC,OAAQ/c,KAChB,OAAlBjQ,KAAKitB,UAAuC,MAAlBjtB,KAAKitB,YACX,OAAlBF,EAAKE,UAAuC,MAAlBF,EAAKE,UAEpC,OACEM,GACAC,GACCC,GAAcC,GACfC,GACAC,CAEJ,EAGF7oB,EAAOC,QAAU8nB,EAEjB,MAAM7D,EAAe,EAAQ,QACvB,GAAExJ,EAAE,EAAElG,GAAM,EAAQ,OACpB6T,EAAM,EAAQ,OACdrE,EAAQ,EAAQ,OAChBI,EAAS,EAAQ,MACjBmE,EAAQ,EAAQ,M,kBCtItB,MAAMA,EACJhqB,YAAauO,EAAO5B,GAGlB,GAFAA,EAAUgZ,EAAahZ,GAEnB4B,aAAiByb,EACnB,OACEzb,EAAMsU,UAAYlW,EAAQkW,OAC1BtU,EAAMuX,sBAAwBnZ,EAAQmZ,kBAE/BvX,EAEA,IAAIyb,EAAMzb,EAAM2X,IAAKvZ,GAIhC,GAAI4B,aAAiBib,EAKnB,OAHA9sB,KAAKwpB,IAAM3X,EAAMxR,MACjBL,KAAK2B,IAAM,CAAC,CAACkQ,IACb7R,KAAK6nB,SACE7nB,KAkBT,GAfAA,KAAKiQ,QAAUA,EACfjQ,KAAKmmB,QAAUlW,EAAQkW,MACvBnmB,KAAKopB,oBAAsBnZ,EAAQmZ,kBAGnCppB,KAAKwpB,IAAM3X,EACX7R,KAAK2B,IAAMkQ,EACRrK,MAAM,MAENjE,KAAI6gB,GAAKpkB,KAAK6tB,WAAWzJ,EAAEzQ,UAI3B8B,QAAOvM,GAAKA,EAAElK,UAEZgB,KAAK2B,IAAI3C,OACZ,MAAM,IAAIoG,UAAU,yBAAyByM,KAI/C,GAAI7R,KAAK2B,IAAI3C,OAAS,EAAG,CAEvB,MAAM8uB,EAAQ9tB,KAAK2B,IAAI,GAEvB,GADA3B,KAAK2B,IAAM3B,KAAK2B,IAAI8T,QAAOvM,IAAM6kB,EAAU7kB,EAAE,MACrB,IAApBlJ,KAAK2B,IAAI3C,OACXgB,KAAK2B,IAAM,CAACmsB,QACP,GAAI9tB,KAAK2B,IAAI3C,OAAS,EAE3B,IAAK,MAAMkK,KAAKlJ,KAAK2B,IACnB,GAAiB,IAAbuH,EAAElK,QAAgBgvB,EAAM9kB,EAAE,IAAK,CACjClJ,KAAK2B,IAAM,CAACuH,GACZ,KACF,CAGN,CAEAlJ,KAAK6nB,QACP,CAEAA,SAOE,OANA7nB,KAAK6R,MAAQ7R,KAAK2B,IACf4B,KAAK0qB,GACGA,EAAMloB,KAAK,KAAK4N,SAExB5N,KAAK,MACL4N,OACI3T,KAAK6R,KACd,CAEAhN,WACE,OAAO7E,KAAK6R,KACd,CAEAgc,WAAYhc,GACVA,EAAQA,EAAM8B,OAId,MACMua,EAAU,cADCxqB,OAAOwR,KAAKlV,KAAKiQ,SAASlK,KAAK,QACN8L,IACpCsc,EAAShtB,EAAME,IAAI6sB,GACzB,GAAIC,EACF,OAAOA,EAGT,MAAMhI,EAAQnmB,KAAKiQ,QAAQkW,MAErBiI,EAAKjI,EAAQ1G,EAAGlG,EAAE8U,kBAAoB5O,EAAGlG,EAAE+U,aACjDzc,EAAQA,EAAMlK,QAAQymB,EAAIG,EAAcvuB,KAAKiQ,QAAQmZ,oBACrDL,EAAM,iBAAkBlX,GAExBA,EAAQA,EAAMlK,QAAQ8X,EAAGlG,EAAEiV,gBAAiB5B,GAC5C7D,EAAM,kBAAmBlX,GAczB,IAAI4c,GALJ5c,GAHAA,GAHAA,EAAQA,EAAMlK,QAAQ8X,EAAGlG,EAAEmV,WAAYjC,IAGzB9kB,QAAQ8X,EAAGlG,EAAEoV,WAAYhC,IAGzBnlB,MAAM,OAAOzB,KAAK,MAM7ByB,MAAM,KACNjE,KAAIwpB,GAAQ6B,EAAgB7B,EAAM/sB,KAAKiQ,WACvClK,KAAK,KACLyB,MAAM,OAENjE,KAAIwpB,GAAQ8B,EAAY9B,EAAM/sB,KAAKiQ,WAElCkW,IAEFsI,EAAYA,EAAUhZ,QAAOsX,IAC3BhE,EAAM,uBAAwBgE,EAAM/sB,KAAKiQ,WAChC8c,EAAKlmB,MAAM4Y,EAAGlG,EAAE2T,sBAG7BnE,EAAM,aAAc0F,GAKpB,MAAMK,EAAW,IAAI1tB,IACf2tB,EAAcN,EAAUlrB,KAAIwpB,GAAQ,IAAID,EAAWC,EAAM/sB,KAAKiQ,WACpE,IAAK,MAAM8c,KAAQgC,EAAa,CAC9B,GAAIhB,EAAUhB,GACZ,MAAO,CAACA,GAEV+B,EAASntB,IAAIorB,EAAK1sB,MAAO0sB,EAC3B,CACI+B,EAAS9W,KAAO,GAAK8W,EAAShf,IAAI,KACpCgf,EAAS/rB,OAAO,IAGlB,MAAMwC,EAAS,IAAIupB,EAASzZ,UAE5B,OADAlU,EAAMQ,IAAIusB,EAAS3oB,GACZA,CACT,CAEA8nB,WAAYxb,EAAO5B,GACjB,KAAM4B,aAAiByb,GACrB,MAAM,IAAIloB,UAAU,uBAGtB,OAAOpF,KAAK2B,IAAIqtB,MAAMC,GAElBC,EAAcD,EAAiBhf,IAC/B4B,EAAMlQ,IAAIqtB,MAAMG,GAEZD,EAAcC,EAAkBlf,IAChCgf,EAAgB9hB,OAAOiiB,GACdD,EAAiBhiB,OAAOkiB,GACtBD,EAAe/B,WAAWgC,EAAiBpf,UAOhE,CAGAxI,KAAM2e,GACJ,IAAKA,EACH,OAAO,EAGT,GAAuB,iBAAZA,EACT,IACEA,EAAU,IAAI+C,EAAO/C,EAASpmB,KAAKiQ,QAGrC,CAFE,MAAOsa,GACP,OAAO,CACT,CAGF,IAAK,IAAI3kB,EAAI,EAAGA,EAAI5F,KAAK2B,IAAI3C,OAAQ4G,IACnC,GAAI0pB,EAAQtvB,KAAK2B,IAAIiE,GAAIwgB,EAASpmB,KAAKiQ,SACrC,OAAO,EAGX,OAAO,CACT,EAEFlL,EAAOC,QAAUsoB,EAEjB,MACMnsB,EAAQ,IADF,EAAQ,OACN,CAAQ,CAAEM,IAAK,MAEvBwnB,EAAe,EAAQ,OACvB6D,EAAa,EAAQ,OACrB/D,EAAQ,EAAQ,OAChBI,EAAS,EAAQ,OACjB,GACJ1J,EAAE,EACFlG,EAAC,sBACDqT,EAAqB,iBACrBH,EAAgB,iBAChBE,GACE,EAAQ,OAENoB,EAAY7kB,GAAiB,aAAZA,EAAE7I,MACnB2tB,EAAQ9kB,GAAiB,KAAZA,EAAE7I,MAIf6uB,EAAgB,CAACH,EAAa9e,KAClC,IAAI1K,GAAS,EACb,MAAMgqB,EAAuBR,EAAY5vB,QACzC,IAAIqwB,EAAiBD,EAAqBhmB,MAE1C,KAAOhE,GAAUgqB,EAAqBvwB,QACpCuG,EAASgqB,EAAqBpiB,OAAOsiB,GAC5BD,EAAenC,WAAWoC,EAAiBxf,KAGpDuf,EAAiBD,EAAqBhmB,MAGxC,OAAOhE,GAMHqpB,EAAkB,CAAC7B,EAAM9c,KAC7B8Y,EAAM,OAAQgE,EAAM9c,GACpB8c,EAAO2C,EAAc3C,EAAM9c,GAC3B8Y,EAAM,QAASgE,GACfA,EAAO4C,EAAc5C,EAAM9c,GAC3B8Y,EAAM,SAAUgE,GAChBA,EAAO6C,EAAe7C,EAAM9c,GAC5B8Y,EAAM,SAAUgE,GAChBA,EAAO8C,EAAa9C,EAAM9c,GAC1B8Y,EAAM,QAASgE,GACRA,GAGH+C,EAAMxuB,IAAOA,GAA2B,MAArBA,EAAGkM,eAAgC,MAAPlM,EAS/CquB,EAAgB,CAAC5C,EAAM9c,IAC3B8c,EAAKpZ,OAAOnM,MAAM,OAAOjE,KAAK2F,GACrB6mB,EAAa7mB,EAAG+G,KACtBlK,KAAK,KAEJgqB,EAAe,CAAChD,EAAM9c,KAC1B,MAAMmU,EAAInU,EAAQkW,MAAQ1G,EAAGlG,EAAEyW,YAAcvQ,EAAGlG,EAAE0W,OAClD,OAAOlD,EAAKplB,QAAQyc,GAAG,CAACxkB,EAAGswB,EAAG7G,EAAGjO,EAAG+U,KAElC,IAAIC,EAoBJ,OArBArH,EAAM,QAASgE,EAAMntB,EAAGswB,EAAG7G,EAAGjO,EAAG+U,GAG7BL,EAAII,GACNE,EAAM,GACGN,EAAIzG,GACb+G,EAAM,KAAKF,WAAWA,EAAI,UACjBJ,EAAI1U,GAEbgV,EAAM,KAAKF,KAAK7G,QAAQ6G,MAAM7G,EAAI,QACzB8G,GACTpH,EAAM,kBAAmBoH,GACzBC,EAAM,KAAKF,KAAK7G,KAAKjO,KAAK+U,MACrBD,MAAM7G,EAAI,SAGf+G,EAAM,KAAKF,KAAK7G,KAAKjO,MAChB8U,MAAM7G,EAAI,QAGjBN,EAAM,eAAgBqH,GACfA,IACR,EAWGV,EAAgB,CAAC3C,EAAM9c,IAC3B8c,EAAKpZ,OAAOnM,MAAM,OAAOjE,KAAK2F,GACrBmnB,EAAannB,EAAG+G,KACtBlK,KAAK,KAEJsqB,EAAe,CAACtD,EAAM9c,KAC1B8Y,EAAM,QAASgE,EAAM9c,GACrB,MAAMmU,EAAInU,EAAQkW,MAAQ1G,EAAGlG,EAAE+W,YAAc7Q,EAAGlG,EAAEgX,OAC5CC,EAAIvgB,EAAQmZ,kBAAoB,KAAO,GAC7C,OAAO2D,EAAKplB,QAAQyc,GAAG,CAACxkB,EAAGswB,EAAG7G,EAAGjO,EAAG+U,KAElC,IAAIC,EA2CJ,OA5CArH,EAAM,QAASgE,EAAMntB,EAAGswB,EAAG7G,EAAGjO,EAAG+U,GAG7BL,EAAII,GACNE,EAAM,GACGN,EAAIzG,GACb+G,EAAM,KAAKF,QAAQM,OAAON,EAAI,UACrBJ,EAAI1U,GAEXgV,EADQ,MAANF,EACI,KAAKA,KAAK7G,MAAMmH,MAAMN,MAAM7G,EAAI,QAEhC,KAAK6G,KAAK7G,MAAMmH,OAAON,EAAI,UAE1BC,GACTpH,EAAM,kBAAmBoH,GAGrBC,EAFM,MAANF,EACQ,MAAN7G,EACI,KAAK6G,KAAK7G,KAAKjO,KAAK+U,MACrBD,KAAK7G,MAAMjO,EAAI,MAEd,KAAK8U,KAAK7G,KAAKjO,KAAK+U,MACrBD,MAAM7G,EAAI,QAGX,KAAK6G,KAAK7G,KAAKjO,KAAK+U,OACpBD,EAAI,YAGZnH,EAAM,SAGFqH,EAFM,MAANF,EACQ,MAAN7G,EACI,KAAK6G,KAAK7G,KAAKjO,IAClBoV,MAAMN,KAAK7G,MAAMjO,EAAI,MAElB,KAAK8U,KAAK7G,KAAKjO,IAClBoV,MAAMN,MAAM7G,EAAI,QAGf,KAAK6G,KAAK7G,KAAKjO,OACf8U,EAAI,WAIdnH,EAAM,eAAgBqH,GACfA,IACR,EAGGR,EAAiB,CAAC7C,EAAM9c,KAC5B8Y,EAAM,iBAAkBgE,EAAM9c,GACvB8c,EAAKvlB,MAAM,OAAOjE,KAAK2F,GACrBunB,EAAcvnB,EAAG+G,KACvBlK,KAAK,MAGJ0qB,EAAgB,CAAC1D,EAAM9c,KAC3B8c,EAAOA,EAAKpZ,OACZ,MAAMyQ,EAAInU,EAAQkW,MAAQ1G,EAAGlG,EAAEmX,aAAejR,EAAGlG,EAAEoX,QACnD,OAAO5D,EAAKplB,QAAQyc,GAAG,CAACgM,EAAKQ,EAAMV,EAAG7G,EAAGjO,EAAG+U,KAC1CpH,EAAM,SAAUgE,EAAMqD,EAAKQ,EAAMV,EAAG7G,EAAGjO,EAAG+U,GAC1C,MAAMU,EAAKf,EAAII,GACTY,EAAKD,GAAMf,EAAIzG,GACf0H,EAAKD,GAAMhB,EAAI1U,GACf4V,EAAOD,EA+Db,MA7Da,MAATH,GAAgBI,IAClBJ,EAAO,IAKTT,EAAKlgB,EAAQmZ,kBAAoB,KAAO,GAEpCyH,EAGAT,EAFW,MAATQ,GAAyB,MAATA,EAEZ,WAGA,IAECA,GAAQI,GAGbF,IACFzH,EAAI,GAENjO,EAAI,EAES,MAATwV,GAGFA,EAAO,KACHE,GACFZ,GAAKA,EAAI,EACT7G,EAAI,EACJjO,EAAI,IAEJiO,GAAKA,EAAI,EACTjO,EAAI,IAEY,OAATwV,IAGTA,EAAO,IACHE,EACFZ,GAAKA,EAAI,EAET7G,GAAKA,EAAI,GAIA,MAATuH,IACFT,EAAK,MAGPC,EAAM,GAAGQ,EAAOV,KAAK7G,KAAKjO,IAAI+U,KACrBW,EACTV,EAAM,KAAKF,QAAQC,OAAQD,EAAI,UACtBa,IACTX,EAAM,KAAKF,KAAK7G,MAAM8G,MACjBD,MAAM7G,EAAI,SAGjBN,EAAM,gBAAiBqH,GAEhBA,IACR,EAKGP,EAAe,CAAC9C,EAAM9c,KAC1B8Y,EAAM,eAAgBgE,EAAM9c,GAErB8c,EAAKpZ,OAAOhM,QAAQ8X,EAAGlG,EAAE0X,MAAO,KAGnCpC,EAAc,CAAC9B,EAAM9c,KACzB8Y,EAAM,cAAegE,EAAM9c,GACpB8c,EAAKpZ,OACThM,QAAQ8X,EAAGxP,EAAQmZ,kBAAoB7P,EAAE2X,QAAU3X,EAAE4X,MAAO,KAQ3D5C,EAAgB6C,GAAS,CAACC,EAC9BC,EAAMC,EAAIC,EAAIC,EAAIC,EAAKC,EACvBC,EAAIC,EAAIC,EAAIC,EAAIC,EAAKC,IA2Bd,GAzBLX,EADExB,EAAIyB,GACC,GACEzB,EAAI0B,GACN,KAAKD,QAASH,EAAQ,KAAO,KAC3BtB,EAAI2B,GACN,KAAKF,KAAMC,MAAOJ,EAAQ,KAAO,KAC/BM,EACF,KAAKJ,IAEL,KAAKA,IAAOF,EAAQ,KAAO,QAIlCQ,EADE9B,EAAI+B,GACD,GACI/B,EAAIgC,GACR,KAAKD,EAAK,UACN/B,EAAIiC,GACR,IAAIF,MAAOC,EAAK,QACZE,EACJ,KAAKH,KAAMC,KAAMC,KAAMC,IACnBZ,EACJ,IAAIS,KAAMC,MAAOC,EAAK,MAEtB,KAAKH,MAGaje,OAGrB2b,EAAU,CAAC3tB,EAAKykB,EAASnW,KAC7B,IAAK,IAAIrK,EAAI,EAAGA,EAAIjE,EAAI3C,OAAQ4G,IAC9B,IAAKjE,EAAIiE,GAAG6B,KAAK2e,GACf,OAAO,EAIX,GAAIA,EAAQwD,WAAW5qB,SAAWiR,EAAQmZ,kBAAmB,CAM3D,IAAK,IAAIxjB,EAAI,EAAGA,EAAIjE,EAAI3C,OAAQ4G,IAE9B,GADAmjB,EAAMpnB,EAAIiE,GAAGonB,QACTrrB,EAAIiE,GAAGonB,SAAWF,EAAWD,KAI7BlrB,EAAIiE,GAAGonB,OAAOpD,WAAW5qB,OAAS,EAAG,CACvC,MAAMkzB,EAAUvwB,EAAIiE,GAAGonB,OACvB,GAAIkF,EAAQzI,QAAUrD,EAAQqD,OAC1ByI,EAAQxI,QAAUtD,EAAQsD,OAC1BwI,EAAQvI,QAAUvD,EAAQuD,MAC5B,OAAO,CAEX,CAIF,OAAO,CACT,CAEA,OAAO,E,iBCxgBT,MAAMZ,EAAQ,EAAQ,QAChB,WAAEC,EAAU,iBAAElR,GAAqB,EAAQ,OAC3C,GAAE2H,EAAE,EAAElG,GAAM,EAAQ,OAEpB0P,EAAe,EAAQ,QACvB,mBAAEC,GAAuB,EAAQ,OACvC,MAAMC,EACJ7lB,YAAa8iB,EAASnW,GAGpB,GAFAA,EAAUgZ,EAAahZ,GAEnBmW,aAAmB+C,EAAQ,CAC7B,GAAI/C,EAAQD,UAAYlW,EAAQkW,OAC5BC,EAAQgD,sBAAwBnZ,EAAQmZ,kBAC1C,OAAOhD,EAEPA,EAAUA,EAAQA,OAEtB,MAAO,GAAuB,iBAAZA,EAChB,MAAM,IAAIhhB,UAAU,oBAAoBghB,KAG1C,GAAIA,EAAQpnB,OAASgqB,EACnB,MAAM,IAAI5jB,UACR,0BAA0B4jB,gBAI9BD,EAAM,SAAU3C,EAASnW,GACzBjQ,KAAKiQ,QAAUA,EACfjQ,KAAKmmB,QAAUlW,EAAQkW,MAGvBnmB,KAAKopB,oBAAsBnZ,EAAQmZ,kBAEnC,MAAMC,EAAIjD,EAAQzS,OAAO9M,MAAMoJ,EAAQkW,MAAQ1G,EAAGlG,EAAE+P,OAAS7J,EAAGlG,EAAEgQ,OAElE,IAAKF,EACH,MAAM,IAAIjkB,UAAU,oBAAoBghB,KAU1C,GAPApmB,KAAKwpB,IAAMpD,EAGXpmB,KAAKypB,OAASJ,EAAE,GAChBrpB,KAAK0pB,OAASL,EAAE,GAChBrpB,KAAK2pB,OAASN,EAAE,GAEZrpB,KAAKypB,MAAQ3R,GAAoB9X,KAAKypB,MAAQ,EAChD,MAAM,IAAIrkB,UAAU,yBAGtB,GAAIpF,KAAK0pB,MAAQ5R,GAAoB9X,KAAK0pB,MAAQ,EAChD,MAAM,IAAItkB,UAAU,yBAGtB,GAAIpF,KAAK2pB,MAAQ7R,GAAoB9X,KAAK2pB,MAAQ,EAChD,MAAM,IAAIvkB,UAAU,yBAIjBikB,EAAE,GAGLrpB,KAAK4pB,WAAaP,EAAE,GAAG7hB,MAAM,KAAKjE,KAAKjC,IACrC,GAAI,WAAWmG,KAAKnG,GAAK,CACvB,MAAMuoB,GAAOvoB,EACb,GAAIuoB,GAAO,GAAKA,EAAM/R,EACpB,OAAO+R,CAEX,CACA,OAAOvoB,KATTtB,KAAK4pB,WAAa,GAapB5pB,KAAK8pB,MAAQT,EAAE,GAAKA,EAAE,GAAG7hB,MAAM,KAAO,GACtCxH,KAAK6nB,QACP,CAEAA,SAKE,OAJA7nB,KAAKomB,QAAU,GAAGpmB,KAAKypB,SAASzpB,KAAK0pB,SAAS1pB,KAAK2pB,QAC/C3pB,KAAK4pB,WAAW5qB,SAClBgB,KAAKomB,SAAW,IAAIpmB,KAAK4pB,WAAW7jB,KAAK,QAEpC/F,KAAKomB,OACd,CAEAvhB,WACE,OAAO7E,KAAKomB,OACd,CAEA2D,QAASC,GAEP,GADAjB,EAAM,iBAAkB/oB,KAAKomB,QAASpmB,KAAKiQ,QAAS+Z,KAC9CA,aAAiBb,GAAS,CAC9B,GAAqB,iBAAVa,GAAsBA,IAAUhqB,KAAKomB,QAC9C,OAAO,EAET4D,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,QACjC,CAEA,OAAI+Z,EAAM5D,UAAYpmB,KAAKomB,QAClB,EAGFpmB,KAAKiqB,YAAYD,IAAUhqB,KAAKkqB,WAAWF,EACpD,CAEAC,YAAaD,GAKX,OAJMA,aAAiBb,IACrBa,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,UAI/BiZ,EAAmBlpB,KAAKypB,MAAOO,EAAMP,QACrCP,EAAmBlpB,KAAK0pB,MAAOM,EAAMN,QACrCR,EAAmBlpB,KAAK2pB,MAAOK,EAAML,MAEzC,CAEAO,WAAYF,GAMV,GALMA,aAAiBb,IACrBa,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,UAI7BjQ,KAAK4pB,WAAW5qB,SAAWgrB,EAAMJ,WAAW5qB,OAC9C,OAAQ,EACH,IAAKgB,KAAK4pB,WAAW5qB,QAAUgrB,EAAMJ,WAAW5qB,OACrD,OAAO,EACF,IAAKgB,KAAK4pB,WAAW5qB,SAAWgrB,EAAMJ,WAAW5qB,OACtD,OAAO,EAGT,IAAI4G,EAAI,EACR,EAAG,CACD,MAAMkX,EAAI9c,KAAK4pB,WAAWhkB,GACpBmX,EAAIiN,EAAMJ,WAAWhkB,GAE3B,GADAmjB,EAAM,qBAAsBnjB,EAAGkX,EAAGC,QACxBxb,IAANub,QAAyBvb,IAANwb,EACrB,OAAO,EACF,QAAUxb,IAANwb,EACT,OAAO,EACF,QAAUxb,IAANub,EACT,OAAQ,EACH,GAAIA,IAAMC,EAGf,OAAOmM,EAAmBpM,EAAGC,EAEjC,SAAWnX,EACb,CAEAukB,aAAcH,GACNA,aAAiBb,IACrBa,EAAQ,IAAIb,EAAOa,EAAOhqB,KAAKiQ,UAGjC,IAAIrK,EAAI,EACR,EAAG,CACD,MAAMkX,EAAI9c,KAAK8pB,MAAMlkB,GACfmX,EAAIiN,EAAMF,MAAMlkB,GAEtB,GADAmjB,EAAM,qBAAsBnjB,EAAGkX,EAAGC,QACxBxb,IAANub,QAAyBvb,IAANwb,EACrB,OAAO,EACF,QAAUxb,IAANwb,EACT,OAAO,EACF,QAAUxb,IAANub,EACT,OAAQ,EACH,GAAIA,IAAMC,EAGf,OAAOmM,EAAmBpM,EAAGC,EAEjC,SAAWnX,EACb,CAIAwkB,IAAK9lB,EAAS+lB,GACZ,OAAQ/lB,GACN,IAAK,WACHtE,KAAK4pB,WAAW5qB,OAAS,EACzBgB,KAAK2pB,MAAQ,EACb3pB,KAAK0pB,MAAQ,EACb1pB,KAAKypB,QACLzpB,KAAKoqB,IAAI,MAAOC,GAChB,MACF,IAAK,WACHrqB,KAAK4pB,WAAW5qB,OAAS,EACzBgB,KAAK2pB,MAAQ,EACb3pB,KAAK0pB,QACL1pB,KAAKoqB,IAAI,MAAOC,GAChB,MACF,IAAK,WAIHrqB,KAAK4pB,WAAW5qB,OAAS,EACzBgB,KAAKoqB,IAAI,QAASC,GAClBrqB,KAAKoqB,IAAI,MAAOC,GAChB,MAGF,IAAK,aAC4B,IAA3BrqB,KAAK4pB,WAAW5qB,QAClBgB,KAAKoqB,IAAI,QAASC,GAEpBrqB,KAAKoqB,IAAI,MAAOC,GAChB,MAEF,IAAK,QAMc,IAAfrqB,KAAK0pB,OACU,IAAf1pB,KAAK2pB,OACsB,IAA3B3pB,KAAK4pB,WAAW5qB,QAEhBgB,KAAKypB,QAEPzpB,KAAK0pB,MAAQ,EACb1pB,KAAK2pB,MAAQ,EACb3pB,KAAK4pB,WAAa,GAClB,MACF,IAAK,QAKgB,IAAf5pB,KAAK2pB,OAA0C,IAA3B3pB,KAAK4pB,WAAW5qB,QACtCgB,KAAK0pB,QAEP1pB,KAAK2pB,MAAQ,EACb3pB,KAAK4pB,WAAa,GAClB,MACF,IAAK,QAK4B,IAA3B5pB,KAAK4pB,WAAW5qB,QAClBgB,KAAK2pB,QAEP3pB,KAAK4pB,WAAa,GAClB,MAGF,IAAK,MACH,GAA+B,IAA3B5pB,KAAK4pB,WAAW5qB,OAClBgB,KAAK4pB,WAAa,CAAC,OACd,CACL,IAAIhkB,EAAI5F,KAAK4pB,WAAW5qB,OACxB,OAAS4G,GAAK,GACsB,iBAAvB5F,KAAK4pB,WAAWhkB,KACzB5F,KAAK4pB,WAAWhkB,KAChBA,GAAK,IAGE,IAAPA,GAEF5F,KAAK4pB,WAAW/jB,KAAK,EAEzB,CACIwkB,IAGyD,IAAvDnB,EAAmBlpB,KAAK4pB,WAAW,GAAIS,GACrCC,MAAMtqB,KAAK4pB,WAAW,MACxB5pB,KAAK4pB,WAAa,CAACS,EAAY,IAGjCrqB,KAAK4pB,WAAa,CAACS,EAAY,IAGnC,MAEF,QACE,MAAM,IAAIvmB,MAAM,+BAA+BQ,KAInD,OAFAtE,KAAK6nB,SACL7nB,KAAKwpB,IAAMxpB,KAAKomB,QACTpmB,IACT,EAGF+E,EAAOC,QAAUmkB,C,kBC9RjB,MAAMnC,EAAQ,EAAQ,OAKtBjiB,EAAOC,QAJO,CAACohB,EAASnW,KACtB,MAAMgK,EAAI+M,EAAMZ,EAAQzS,OAAOhM,QAAQ,SAAU,IAAKsI,GACtD,OAAOgK,EAAIA,EAAEmM,QAAU,K,kBCHzB,MAAM+L,EAAK,EAAQ,OACbC,EAAM,EAAQ,OACdC,EAAK,EAAQ,OACbC,EAAM,EAAQ,OACdC,EAAK,EAAQ,OACbC,EAAM,EAAQ,OA8CpBztB,EAAOC,QA5CK,CAAC8X,EAAGvL,EAAIwL,EAAGoJ,KACrB,OAAQ5U,GACN,IAAK,MAOH,MANiB,iBAANuL,IACTA,EAAIA,EAAEsJ,SAES,iBAANrJ,IACTA,EAAIA,EAAEqJ,SAEDtJ,IAAMC,EAEf,IAAK,MAOH,MANiB,iBAAND,IACTA,EAAIA,EAAEsJ,SAES,iBAANrJ,IACTA,EAAIA,EAAEqJ,SAEDtJ,IAAMC,EAEf,IAAK,GACL,IAAK,IACL,IAAK,KACH,OAAOoV,EAAGrV,EAAGC,EAAGoJ,GAElB,IAAK,KACH,OAAOiM,EAAItV,EAAGC,EAAGoJ,GAEnB,IAAK,IACH,OAAOkM,EAAGvV,EAAGC,EAAGoJ,GAElB,IAAK,KACH,OAAOmM,EAAIxV,EAAGC,EAAGoJ,GAEnB,IAAK,IACH,OAAOoM,EAAGzV,EAAGC,EAAGoJ,GAElB,IAAK,KACH,OAAOqM,EAAI1V,EAAGC,EAAGoJ,GAEnB,QACE,MAAM,IAAI/gB,UAAU,qBAAqBmM,KAC7C,C,kBCjDF,MAAM4X,EAAS,EAAQ,MACjBnC,EAAQ,EAAQ,QAChB,GAAEvH,EAAE,EAAElG,GAAM,EAAQ,OAiD1BxU,EAAOC,QA/CQ,CAACohB,EAASnW,KACvB,GAAImW,aAAmB+C,EACrB,OAAO/C,EAOT,GAJuB,iBAAZA,IACTA,EAAUpF,OAAOoF,IAGI,iBAAZA,EACT,OAAO,KAKT,IAAIvf,EAAQ,KACZ,IAHAoJ,EAAUA,GAAW,CAAC,GAGTwiB,IAEN,CASL,IAAItyB,EACJ,MAAQA,EAAOsf,EAAGlG,EAAEmZ,WAAW3rB,KAAKqf,OAC9Bvf,GAASA,EAAMG,MAAQH,EAAM,GAAG7H,SAAWonB,EAAQpnB,SAElD6H,GACC1G,EAAK6G,MAAQ7G,EAAK,GAAGnB,SAAW6H,EAAMG,MAAQH,EAAM,GAAG7H,SAC3D6H,EAAQ1G,GAEVsf,EAAGlG,EAAEmZ,WAAWtS,UAAYjgB,EAAK6G,MAAQ7G,EAAK,GAAGnB,OAASmB,EAAK,GAAGnB,OAGpEygB,EAAGlG,EAAEmZ,WAAWtS,WAAa,CAC/B,MAtBEvZ,EAAQuf,EAAQvf,MAAM4Y,EAAGlG,EAAEgT,SAwB7B,OAAc,OAAV1lB,EACK,KAGFmgB,EAAM,GAAGngB,EAAM,MAAMA,EAAM,IAAM,OAAOA,EAAM,IAAM,MAAOoJ,EAAO,C,kBCjD3E,MAAMkZ,EAAS,EAAQ,MAMvBpkB,EAAOC,QALc,CAAC8X,EAAGC,EAAGoJ,KAC1B,MAAMwM,EAAW,IAAIxJ,EAAOrM,EAAGqJ,GACzByM,EAAW,IAAIzJ,EAAOpM,EAAGoJ,GAC/B,OAAOwM,EAAS5I,QAAQ6I,IAAaD,EAASxI,aAAayI,EAAQ,C,kBCJrE,MAAM7I,EAAU,EAAQ,OAExBhlB,EAAOC,QADc,CAAC8X,EAAGC,IAAMgN,EAAQjN,EAAGC,GAAG,E,kBCD7C,MAAMoM,EAAS,EAAQ,MAIvBpkB,EAAOC,QAHS,CAAC8X,EAAGC,EAAGoJ,IACrB,IAAIgD,EAAOrM,EAAGqJ,GAAO4D,QAAQ,IAAIZ,EAAOpM,EAAGoJ,G,kBCF7C,MAAMa,EAAQ,EAAQ,OAChBmL,EAAK,EAAQ,OAqBnBptB,EAAOC,QAnBM,CAAC6tB,EAAUC,KACtB,GAAIX,EAAGU,EAAUC,GACf,OAAO,KACF,CACL,MAAMC,EAAK/L,EAAM6L,GACXG,EAAKhM,EAAM8L,GACXG,EAASF,EAAGnJ,WAAW5qB,QAAUg0B,EAAGpJ,WAAW5qB,OAC/Ck0B,EAASD,EAAS,MAAQ,GAC1BE,EAAgBF,EAAS,aAAe,GAC9C,IAAK,MAAM5wB,KAAO0wB,EAChB,IAAY,UAAR1wB,GAA2B,UAARA,GAA2B,UAARA,IACpC0wB,EAAG1wB,KAAS2wB,EAAG3wB,GACjB,OAAO6wB,EAAS7wB,EAItB,OAAO8wB,CACT,E,kBCpBF,MAAMpJ,EAAU,EAAQ,OAExBhlB,EAAOC,QADI,CAAC8X,EAAGC,EAAGoJ,IAAmC,IAAzB4D,EAAQjN,EAAGC,EAAGoJ,E,kBCD1C,MAAM4D,EAAU,EAAQ,OAExBhlB,EAAOC,QADI,CAAC8X,EAAGC,EAAGoJ,IAAU4D,EAAQjN,EAAGC,EAAGoJ,GAAS,C,kBCDnD,MAAM4D,EAAU,EAAQ,OAExBhlB,EAAOC,QADK,CAAC8X,EAAGC,EAAGoJ,IAAU4D,EAAQjN,EAAGC,EAAGoJ,IAAU,C,kBCDrD,MAAMgD,EAAS,EAAQ,MAiBvBpkB,EAAOC,QAfK,CAACohB,EAAS9hB,EAAS2L,EAASoa,KACb,iBAAd,IACTA,EAAapa,EACbA,OAAU1O,GAGZ,IACE,OAAO,IAAI4nB,EACT/C,aAAmB+C,EAAS/C,EAAQA,QAAUA,EAC9CnW,GACAma,IAAI9lB,EAAS+lB,GAAYjE,OAG7B,CAFE,MAAOmE,GACP,OAAO,IACT,E,kBCfF,MAAMR,EAAU,EAAQ,OAExBhlB,EAAOC,QADI,CAAC8X,EAAGC,EAAGoJ,IAAU4D,EAAQjN,EAAGC,EAAGoJ,GAAS,C,kBCDnD,MAAM4D,EAAU,EAAQ,OAExBhlB,EAAOC,QADK,CAAC8X,EAAGC,EAAGoJ,IAAU4D,EAAQjN,EAAGC,EAAGoJ,IAAU,C,kBCDrD,MAAMgD,EAAS,EAAQ,MAEvBpkB,EAAOC,QADO,CAAC8X,EAAGqJ,IAAU,IAAIgD,EAAOrM,EAAGqJ,GAAOsD,K,iBCDjD,MAAMN,EAAS,EAAQ,MAEvBpkB,EAAOC,QADO,CAAC8X,EAAGqJ,IAAU,IAAIgD,EAAOrM,EAAGqJ,GAAOuD,K,kBCDjD,MAAMK,EAAU,EAAQ,OAExBhlB,EAAOC,QADK,CAAC8X,EAAGC,EAAGoJ,IAAmC,IAAzB4D,EAAQjN,EAAGC,EAAGoJ,E,kBCD3C,MAAM,WAAE6C,GAAe,EAAQ,OACzB,GAAEvJ,EAAE,EAAElG,GAAM,EAAQ,OACpB4P,EAAS,EAAQ,MAEjBF,EAAe,EAAQ,OA4B7BlkB,EAAOC,QA3BO,CAACohB,EAASnW,KAGtB,GAFAA,EAAUgZ,EAAahZ,GAEnBmW,aAAmB+C,EACrB,OAAO/C,EAGT,GAAuB,iBAAZA,EACT,OAAO,KAGT,GAAIA,EAAQpnB,OAASgqB,EACnB,OAAO,KAIT,KADU/Y,EAAQkW,MAAQ1G,EAAGlG,EAAE+P,OAAS7J,EAAGlG,EAAEgQ,OACtC9hB,KAAK2e,GACV,OAAO,KAGT,IACE,OAAO,IAAI+C,EAAO/C,EAASnW,EAG7B,CAFE,MAAOsa,GACP,OAAO,IACT,E,kBC7BF,MAAMpB,EAAS,EAAQ,MAEvBpkB,EAAOC,QADO,CAAC8X,EAAGqJ,IAAU,IAAIgD,EAAOrM,EAAGqJ,GAAOwD,K,kBCDjD,MAAM3C,EAAQ,EAAQ,OAKtBjiB,EAAOC,QAJY,CAACohB,EAASnW,KAC3B,MAAMxQ,EAASunB,EAAMZ,EAASnW,GAC9B,OAAQxQ,GAAUA,EAAOmqB,WAAW5qB,OAAUS,EAAOmqB,WAAa,K,kBCHpE,MAAMG,EAAU,EAAQ,OAExBhlB,EAAOC,QADU,CAAC8X,EAAGC,EAAGoJ,IAAU4D,EAAQhN,EAAGD,EAAGqJ,E,kBCDhD,MAAMgE,EAAe,EAAQ,OAE7BplB,EAAOC,QADO,CAACouB,EAAMjN,IAAUiN,EAAKvW,MAAK,CAACC,EAAGC,IAAMoN,EAAapN,EAAGD,EAAGqJ,I,kBCDtE,MAAMmH,EAAQ,EAAQ,OAStBvoB,EAAOC,QARW,CAACohB,EAASvU,EAAO5B,KACjC,IACE4B,EAAQ,IAAIyb,EAAMzb,EAAO5B,EAG3B,CAFE,MAAOsa,GACP,OAAO,CACT,CACA,OAAO1Y,EAAMpK,KAAK2e,EAAO,C,iBCP3B,MAAM+D,EAAe,EAAQ,OAE7BplB,EAAOC,QADM,CAACouB,EAAMjN,IAAUiN,EAAKvW,MAAK,CAACC,EAAGC,IAAMoN,EAAarN,EAAGC,EAAGoJ,I,kBCDrE,MAAMa,EAAQ,EAAQ,OAKtBjiB,EAAOC,QAJO,CAACohB,EAASnW,KACtB,MAAMsF,EAAIyR,EAAMZ,EAASnW,GACzB,OAAOsF,EAAIA,EAAE6Q,QAAU,K,kBCFzB,MAAMiN,EAAa,EAAQ,OACrBC,EAAY,EAAQ,MACpBnK,EAAS,EAAQ,MACjBoK,EAAc,EAAQ,OACtBvM,EAAQ,EAAQ,OAChBwM,EAAQ,EAAQ,OAChBC,EAAQ,EAAQ,OAChBrJ,EAAM,EAAQ,OACd1W,EAAO,EAAQ,OACf+V,EAAQ,EAAQ,OAChBC,EAAQ,EAAQ,MAChBC,EAAQ,EAAQ,OAChBC,EAAa,EAAQ,OACrBG,EAAU,EAAQ,OAClB2J,EAAW,EAAQ,OACnBC,EAAe,EAAQ,OACvBxJ,EAAe,EAAQ,OACvBtN,EAAO,EAAQ,MACf+W,EAAQ,EAAQ,OAChBvB,EAAK,EAAQ,OACbE,EAAK,EAAQ,OACbJ,EAAK,EAAQ,OACbC,EAAM,EAAQ,OACdE,EAAM,EAAQ,OACdE,EAAM,EAAQ,OACdpF,EAAM,EAAQ,OACdyG,EAAS,EAAQ,OACjB/G,EAAa,EAAQ,OACrBQ,EAAQ,EAAQ,OAChBwG,EAAY,EAAQ,OACpBC,EAAgB,EAAQ,OACxBC,EAAgB,EAAQ,OACxBC,EAAgB,EAAQ,OACxBC,EAAa,EAAQ,OACrBC,EAAa,EAAQ,OACrBC,EAAU,EAAQ,OAClBC,EAAM,EAAQ,OACdC,EAAM,EAAQ,OACdjH,EAAa,EAAQ,OACrBkH,EAAgB,EAAQ,OACxBC,EAAS,EAAQ,OACvBzvB,EAAOC,QAAU,CACfgiB,QACAwM,QACAC,QACArJ,MACA1W,OACA+V,QACAC,QACAC,QACAC,aACAG,UACA2J,WACAC,eACAxJ,eACAtN,OACA+W,QACAvB,KACAE,KACAJ,KACAC,MACAE,MACAE,MACApF,MACAyG,SACA/G,aACAQ,QACAwG,YACAC,gBACAC,gBACAC,gBACAC,aACAC,aACAC,UACAC,MACAC,MACAjH,aACAkH,gBACAC,SACArL,SACA1J,GAAI4T,EAAW5T,GACf5b,IAAKwvB,EAAWxvB,IAChB4wB,OAAQpB,EAAW9Z,EACnBiR,oBAAqB8I,EAAU9I,oBAC/BtB,mBAAoBqK,EAAYrK,mBAChC8B,oBAAqBuI,EAAYvI,oB,WCpFnC,MAGMlT,EAAmBD,OAAOC,kBACL,iBAK3B/S,EAAOC,QAAU,CACfwlB,oBAV0B,QAW1BxB,WATiB,IAUjBlR,mBACA2S,0BANgC,G,YCTlC,MAAM1B,EACe,iBAAZ/gB,SACPA,QAAQ0iB,KACR1iB,QAAQ0iB,IAAIC,YACZ,cAAcljB,KAAKO,QAAQ0iB,IAAIC,YAC7B,IAAI5rB,IAAS6rB,QAAQlO,MAAM,YAAa3d,GACxC,OAEJgG,EAAOC,QAAU+jB,C,YCRjB,MAAM8B,EAAU,WACV3B,EAAqB,CAACpM,EAAGC,KAC7B,MAAM+N,EAAOD,EAAQpjB,KAAKqV,GACpBiO,EAAOF,EAAQpjB,KAAKsV,GAO1B,OALI+N,GAAQC,IACVjO,GAAKA,EACLC,GAAKA,GAGAD,IAAMC,EAAI,EACZ+N,IAASC,GAAS,EAClBA,IAASD,EAAQ,EAClBhO,EAAIC,GAAK,EACT,GAKNhY,EAAOC,QAAU,CACfkkB,qBACA8B,oBAJ0B,CAAClO,EAAGC,IAAMmM,EAAmBnM,EAAGD,G,YCf5D,MAAM5d,EAAO,CAAC,oBAAqB,QAAS,OAQ5C6F,EAAOC,QAPciL,GAClBA,EACoB,iBAAZA,EAAuB,CAAEkW,OAAO,GACvCjnB,EAAKuW,QAAOL,GAAKnF,EAAQmF,KAAI6V,QAAO,CAACvP,EAAGtG,KACxCsG,EAAEtG,IAAK,EACAsG,IACN,CAAC,GALO,CAAC,C,kBCJd,MAAM,0BAAE+O,GAA8B,EAAQ,MACxC1B,EAAQ,EAAQ,OAIhBtJ,GAHNza,EAAUD,EAAOC,QAAU,CAAC,GAGTya,GAAK,GAClB5b,EAAMmB,EAAQnB,IAAM,GACpB0V,EAAIvU,EAAQuU,EAAI,CAAC,EACvB,IAAI2R,EAAI,EAER,MAAMC,EAAc,CAACpe,EAAM1M,EAAO+qB,KAChC,MAAMpkB,EAAQkkB,IACdnC,EAAMhc,EAAM/F,EAAO3G,GACnBkZ,EAAExM,GAAQ/F,EACVnD,EAAImD,GAAS3G,EACbof,EAAGzY,GAAS,IAAIiC,OAAO5I,EAAO+qB,EAAW,SAAM7pB,EAAS,EAS1D4pB,EAAY,oBAAqB,eACjCA,EAAY,yBAA0B,UAMtCA,EAAY,uBAAwB,8BAKpCA,EAAY,cAAe,IAAItnB,EAAI0V,EAAE8R,0BACdxnB,EAAI0V,EAAE8R,0BACNxnB,EAAI0V,EAAE8R,uBAE7BF,EAAY,mBAAoB,IAAItnB,EAAI0V,EAAE+R,+BACdznB,EAAI0V,EAAE+R,+BACNznB,EAAI0V,EAAE+R,4BAKlCH,EAAY,uBAAwB,MAAMtnB,EAAI0V,EAAE8R,sBAC5CxnB,EAAI0V,EAAEgS,0BAEVJ,EAAY,4BAA6B,MAAMtnB,EAAI0V,EAAE+R,2BACjDznB,EAAI0V,EAAEgS,0BAMVJ,EAAY,aAAc,QAAQtnB,EAAI0V,EAAEiS,8BAC/B3nB,EAAI0V,EAAEiS,6BAEfL,EAAY,kBAAmB,SAAStnB,EAAI0V,EAAEkS,mCACrC5nB,EAAI0V,EAAEkS,kCAKfN,EAAY,kBAAmB,iBAM/BA,EAAY,QAAS,UAAUtnB,EAAI0V,EAAEmS,yBAC5B7nB,EAAI0V,EAAEmS,wBAWfP,EAAY,YAAa,KAAKtnB,EAAI0V,EAAEoS,eACjC9nB,EAAI0V,EAAEqS,eACP/nB,EAAI0V,EAAEsS,WAERV,EAAY,OAAQ,IAAItnB,EAAI0V,EAAEuS,eAK9BX,EAAY,aAAc,WAAWtnB,EAAI0V,EAAEwS,oBACxCloB,EAAI0V,EAAEyS,oBACPnoB,EAAI0V,EAAEsS,WAERV,EAAY,QAAS,IAAItnB,EAAI0V,EAAE0S,gBAE/Bd,EAAY,OAAQ,gBAKpBA,EAAY,wBAAyB,GAAGtnB,EAAI0V,EAAE+R,mCAC9CH,EAAY,mBAAoB,GAAGtnB,EAAI0V,EAAE8R,8BAEzCF,EAAY,cAAe,YAAYtnB,EAAI0V,EAAE2S,4BAChBroB,EAAI0V,EAAE2S,4BACNroB,EAAI0V,EAAE2S,wBACVroB,EAAI0V,EAAEqS,gBACV/nB,EAAI0V,EAAEsS,eAG3BV,EAAY,mBAAoB,YAAYtnB,EAAI0V,EAAE4S,iCAChBtoB,EAAI0V,EAAE4S,iCACNtoB,EAAI0V,EAAE4S,6BACVtoB,EAAI0V,EAAEyS,qBACVnoB,EAAI0V,EAAEsS,eAGhCV,EAAY,SAAU,IAAItnB,EAAI0V,EAAE6S,YAAYvoB,EAAI0V,EAAE8S,iBAClDlB,EAAY,cAAe,IAAItnB,EAAI0V,EAAE6S,YAAYvoB,EAAI0V,EAAE+S,sBAIvDnB,EAAY,SAAU,oBACIV,mBACIA,qBACAA,qBAE9BU,EAAY,YAAatnB,EAAI0V,EAAEgT,SAAS,GAIxCpB,EAAY,YAAa,WAEzBA,EAAY,YAAa,SAAStnB,EAAI0V,EAAEiT,kBAAkB,GAC1DxnB,EAAQynB,iBAAmB,MAE3BtB,EAAY,QAAS,IAAItnB,EAAI0V,EAAEiT,aAAa3oB,EAAI0V,EAAE8S,iBAClDlB,EAAY,aAAc,IAAItnB,EAAI0V,EAAEiT,aAAa3oB,EAAI0V,EAAE+S,sBAIvDnB,EAAY,YAAa,WAEzBA,EAAY,YAAa,SAAStnB,EAAI0V,EAAEmT,kBAAkB,GAC1D1nB,EAAQ2nB,iBAAmB,MAE3BxB,EAAY,QAAS,IAAItnB,EAAI0V,EAAEmT,aAAa7oB,EAAI0V,EAAE8S,iBAClDlB,EAAY,aAAc,IAAItnB,EAAI0V,EAAEmT,aAAa7oB,EAAI0V,EAAE+S,sBAGvDnB,EAAY,kBAAmB,IAAItnB,EAAI0V,EAAE6S,aAAavoB,EAAI0V,EAAE0S,oBAC5Dd,EAAY,aAAc,IAAItnB,EAAI0V,EAAE6S,aAAavoB,EAAI0V,EAAEuS,mBAIvDX,EAAY,iBAAkB,SAAStnB,EAAI0V,EAAE6S,aACrCvoB,EAAI0V,EAAE0S,eAAepoB,EAAI0V,EAAE8S,iBAAiB,GACpDrnB,EAAQ4nB,sBAAwB,SAMhCzB,EAAY,cAAe,SAAStnB,EAAI0V,EAAE8S,0BAEnBxoB,EAAI0V,EAAE8S,sBAG7BlB,EAAY,mBAAoB,SAAStnB,EAAI0V,EAAE+S,+BAEnBzoB,EAAI0V,EAAE+S,2BAIlCnB,EAAY,OAAQ,mBAEpBA,EAAY,OAAQ,6BACpBA,EAAY,UAAW,8B,kBCpLvB,MAAMiJ,EAAU,EAAQ,OAExBrvB,EAAOC,QADK,CAACohB,EAASvU,EAAO5B,IAAYmkB,EAAQhO,EAASvU,EAAO,IAAK5B,E,kBCFtE,MAAMqd,EAAQ,EAAQ,OAMtBvoB,EAAOC,QALY,CAAC0vB,EAAIC,EAAI1kB,KAC1BykB,EAAK,IAAIpH,EAAMoH,EAAIzkB,GACnB0kB,EAAK,IAAIrH,EAAMqH,EAAI1kB,GACZykB,EAAGrH,WAAWsH,G,kBCJvB,MAAMP,EAAU,EAAQ,OAGxBrvB,EAAOC,QADK,CAACohB,EAASvU,EAAO5B,IAAYmkB,EAAQhO,EAASvU,EAAO,IAAK5B,E,kBCFtE,MAAMkZ,EAAS,EAAQ,MACjBmE,EAAQ,EAAQ,OAuBtBvoB,EAAOC,QArBe,CAACkN,EAAUL,EAAO5B,KACtC,IAAIxO,EAAM,KACNmzB,EAAQ,KACRC,EAAW,KACf,IACEA,EAAW,IAAIvH,EAAMzb,EAAO5B,EAG9B,CAFE,MAAOsa,GACP,OAAO,IACT,CAWA,OAVArY,EAAS4C,SAASS,IACZsf,EAASptB,KAAK8N,KAEX9T,IAA6B,IAAtBmzB,EAAM7K,QAAQxU,KAExB9T,EAAM8T,EACNqf,EAAQ,IAAIzL,EAAO1nB,EAAKwO,IAE5B,IAEKxO,E,kBCtBT,MAAM0nB,EAAS,EAAQ,MACjBmE,EAAQ,EAAQ,OAsBtBvoB,EAAOC,QArBe,CAACkN,EAAUL,EAAO5B,KACtC,IAAI6kB,EAAM,KACNC,EAAQ,KACRF,EAAW,KACf,IACEA,EAAW,IAAIvH,EAAMzb,EAAO5B,EAG9B,CAFE,MAAOsa,GACP,OAAO,IACT,CAWA,OAVArY,EAAS4C,SAASS,IACZsf,EAASptB,KAAK8N,KAEXuf,GAA4B,IAArBC,EAAMhL,QAAQxU,KAExBuf,EAAMvf,EACNwf,EAAQ,IAAI5L,EAAO2L,EAAK7kB,IAE5B,IAEK6kB,E,kBCrBT,MAAM3L,EAAS,EAAQ,MACjBmE,EAAQ,EAAQ,OAChB+E,EAAK,EAAQ,OA0DnBttB,EAAOC,QAxDY,CAAC6M,EAAOsU,KACzBtU,EAAQ,IAAIyb,EAAMzb,EAAOsU,GAEzB,IAAI6O,EAAS,IAAI7L,EAAO,SACxB,GAAItX,EAAMpK,KAAKutB,GACb,OAAOA,EAIT,GADAA,EAAS,IAAI7L,EAAO,WAChBtX,EAAMpK,KAAKutB,GACb,OAAOA,EAGTA,EAAS,KACT,IAAK,IAAIpvB,EAAI,EAAGA,EAAIiM,EAAMlQ,IAAI3C,SAAU4G,EAAG,CACzC,MAAMmpB,EAAcld,EAAMlQ,IAAIiE,GAE9B,IAAIqvB,EAAS,KACblG,EAAYja,SAASogB,IAEnB,MAAMC,EAAU,IAAIhM,EAAO+L,EAAWlI,OAAO5G,SAC7C,OAAQ8O,EAAWjI,UACjB,IAAK,IAC+B,IAA9BkI,EAAQvL,WAAW5qB,OACrBm2B,EAAQxL,QAERwL,EAAQvL,WAAW/jB,KAAK,GAE1BsvB,EAAQ3L,IAAM2L,EAAQtN,SAExB,IAAK,GACL,IAAK,KACEoN,IAAU5C,EAAG8C,EAASF,KACzBA,EAASE,GAEX,MACF,IAAK,IACL,IAAK,KAEH,MAEF,QACE,MAAM,IAAIrxB,MAAM,yBAAyBoxB,EAAWjI,YACxD,KAEEgI,GAAYD,IAAU3C,EAAG2C,EAAQC,KACnCD,EAASC,EAEb,CAEA,OAAID,GAAUnjB,EAAMpK,KAAKutB,GAChBA,EAGF,K,kBC1DT,MAAM7L,EAAS,EAAQ,MACjB2D,EAAa,EAAQ,QACrB,IAAED,GAAQC,EACVQ,EAAQ,EAAQ,OAChBwG,EAAY,EAAQ,OACpBzB,EAAK,EAAQ,OACbE,EAAK,EAAQ,OACbC,EAAM,EAAQ,OACdF,EAAM,EAAQ,OAuEpBvtB,EAAOC,QArES,CAACohB,EAASvU,EAAOujB,EAAMnlB,KAIrC,IAAIolB,EAAMC,EAAOC,EAAMxI,EAAMyI,EAC7B,OAJApP,EAAU,IAAI+C,EAAO/C,EAASnW,GAC9B4B,EAAQ,IAAIyb,EAAMzb,EAAO5B,GAGjBmlB,GACN,IAAK,IACHC,EAAOhD,EACPiD,EAAQ9C,EACR+C,EAAOhD,EACPxF,EAAO,IACPyI,EAAQ,KACR,MACF,IAAK,IACHH,EAAO9C,EACP+C,EAAQhD,EACRiD,EAAOlD,EACPtF,EAAO,IACPyI,EAAQ,KACR,MACF,QACE,MAAM,IAAIpwB,UAAU,yCAIxB,GAAI0uB,EAAU1N,EAASvU,EAAO5B,GAC5B,OAAO,EAMT,IAAK,IAAIrK,EAAI,EAAGA,EAAIiM,EAAMlQ,IAAI3C,SAAU4G,EAAG,CACzC,MAAMmpB,EAAcld,EAAMlQ,IAAIiE,GAE9B,IAAI6vB,EAAO,KACPC,EAAM,KAiBV,GAfA3G,EAAYja,SAASogB,IACfA,EAAWlI,SAAWH,IACxBqI,EAAa,IAAIpI,EAAW,YAE9B2I,EAAOA,GAAQP,EACfQ,EAAMA,GAAOR,EACTG,EAAKH,EAAWlI,OAAQyI,EAAKzI,OAAQ/c,GACvCwlB,EAAOP,EACEK,EAAKL,EAAWlI,OAAQ0I,EAAI1I,OAAQ/c,KAC7CylB,EAAMR,EACR,IAKEO,EAAKxI,WAAaF,GAAQ0I,EAAKxI,WAAauI,EAC9C,OAAO,EAKT,KAAME,EAAIzI,UAAYyI,EAAIzI,WAAaF,IACnCuI,EAAMlP,EAASsP,EAAI1I,QACrB,OAAO,EACF,GAAI0I,EAAIzI,WAAauI,GAASD,EAAKnP,EAASsP,EAAI1I,QACrD,OAAO,CAEX,CACA,OAAO,E,kBCzET,MAAM8G,EAAY,EAAQ,OACpB/J,EAAU,EAAQ,OACxBhlB,EAAOC,QAAU,CAACkN,EAAUL,EAAO5B,KACjC,MAAMtO,EAAM,GACZ,IAAImsB,EAAQ,KACRha,EAAO,KACX,MAAMyB,EAAIrD,EAAS2K,MAAK,CAACC,EAAGC,IAAMgN,EAAQjN,EAAGC,EAAG9M,KAChD,IAAK,MAAMmW,KAAW7Q,EACHue,EAAU1N,EAASvU,EAAO5B,IAEzC6D,EAAOsS,EACF0H,IACHA,EAAQ1H,KAGNtS,GACFnS,EAAIkE,KAAK,CAACioB,EAAOha,IAEnBA,EAAO,KACPga,EAAQ,MAGRA,GACFnsB,EAAIkE,KAAK,CAACioB,EAAO,OAGnB,MAAM6H,EAAS,GACf,IAAK,MAAOb,EAAKrzB,KAAQE,EACnBmzB,IAAQrzB,EACVk0B,EAAO9vB,KAAKivB,GACFrzB,GAAOqzB,IAAQvf,EAAE,GAEjB9T,EAEDqzB,IAAQvf,EAAE,GACnBogB,EAAO9vB,KAAK,KAAKpE,KAEjBk0B,EAAO9vB,KAAK,GAAGivB,OAASrzB,KAJxBk0B,EAAO9vB,KAAK,KAAKivB,KAFjBa,EAAO9vB,KAAK,KAShB,MAAM+vB,EAAaD,EAAO5vB,KAAK,QACzB8vB,EAAgC,iBAAdhkB,EAAM2X,IAAmB3X,EAAM2X,IAAMxI,OAAOnP,GACpE,OAAO+jB,EAAW52B,OAAS62B,EAAS72B,OAAS42B,EAAa/jB,E,kBC7C5D,MAAMyb,EAAQ,EAAQ,OAChBR,EAAa,EAAQ,QACrB,IAAED,GAAQC,EACVgH,EAAY,EAAQ,OACpB/J,EAAU,EAAQ,OAkElB+L,EAAe,CAACC,EAAKC,EAAK/lB,KAC9B,GAAI8lB,IAAQC,EACV,OAAO,EAGT,GAAmB,IAAfD,EAAI/2B,QAAgB+2B,EAAI,GAAG/I,SAAWH,EAAK,CAC7C,GAAmB,IAAfmJ,EAAIh3B,QAAgBg3B,EAAI,GAAGhJ,SAAWH,EACxC,OAAO,EAEPkJ,EADS9lB,EAAQmZ,kBACX,CAAC,IAAI0D,EAAW,cAEhB,CAAC,IAAIA,EAAW,WAE1B,CAEA,GAAmB,IAAfkJ,EAAIh3B,QAAgBg3B,EAAI,GAAGhJ,SAAWH,EAAK,CAC7C,GAAI5c,EAAQmZ,kBACV,OAAO,EAEP4M,EAAM,CAAC,IAAIlJ,EAAW,WAE1B,CAEA,MAAMmJ,EAAQ,IAAIrzB,IAClB,IAAIyvB,EAAIE,EAeJ2D,EA6BAC,EAAQC,EACRC,EAAUC,EA5Cd,IAAK,MAAMptB,KAAK6sB,EACK,MAAf7sB,EAAE+jB,UAAmC,OAAf/jB,EAAE+jB,SAC1BoF,EAAKkE,EAASlE,EAAInpB,EAAG+G,GACG,MAAf/G,EAAE+jB,UAAmC,OAAf/jB,EAAE+jB,SACjCsF,EAAKiE,EAAQjE,EAAIrpB,EAAG+G,GAEpBgmB,EAAMnzB,IAAIoG,EAAE8jB,QAIhB,GAAIiJ,EAAMje,KAAO,EACf,OAAO,KAIT,GAAIqa,GAAME,EAAI,CAEZ,GADA2D,EAAWnM,EAAQsI,EAAGrF,OAAQuF,EAAGvF,OAAQ/c,GACrCimB,EAAW,EACb,OAAO,KACF,GAAiB,IAAbA,IAAmC,OAAhB7D,EAAGpF,UAAqC,OAAhBsF,EAAGtF,UACvD,OAAO,IAEX,CAGA,IAAK,MAAMkF,KAAM8D,EAAO,CACtB,GAAI5D,IAAOyB,EAAU3B,EAAInR,OAAOqR,GAAKpiB,GACnC,OAAO,KAGT,GAAIsiB,IAAOuB,EAAU3B,EAAInR,OAAOuR,GAAKtiB,GACnC,OAAO,KAGT,IAAK,MAAM/G,KAAK8sB,EACd,IAAKlC,EAAU3B,EAAInR,OAAO9X,GAAI+G,GAC5B,OAAO,EAIX,OAAO,CACT,CAMA,IAAIwmB,KAAelE,GAChBtiB,EAAQmZ,oBACTmJ,EAAGvF,OAAOpD,WAAW5qB,SAASuzB,EAAGvF,OAC/B0J,KAAerE,GAChBpiB,EAAQmZ,oBACTiJ,EAAGrF,OAAOpD,WAAW5qB,SAASqzB,EAAGrF,OAE/ByJ,GAAmD,IAAnCA,EAAa7M,WAAW5qB,QACxB,MAAhBuzB,EAAGtF,UAAmD,IAA/BwJ,EAAa7M,WAAW,KACjD6M,GAAe,GAGjB,IAAK,MAAMvtB,KAAK8sB,EAAK,CAGnB,GAFAM,EAAWA,GAA2B,MAAfptB,EAAE+jB,UAAmC,OAAf/jB,EAAE+jB,SAC/CoJ,EAAWA,GAA2B,MAAfntB,EAAE+jB,UAAmC,OAAf/jB,EAAE+jB,SAC3CoF,EASF,GARIqE,GACExtB,EAAE8jB,OAAOpD,YAAc1gB,EAAE8jB,OAAOpD,WAAW5qB,QAC3CkK,EAAE8jB,OAAOvD,QAAUiN,EAAajN,OAChCvgB,EAAE8jB,OAAOtD,QAAUgN,EAAahN,OAChCxgB,EAAE8jB,OAAOrD,QAAU+M,EAAa/M,QAClC+M,GAAe,GAGA,MAAfxtB,EAAE+jB,UAAmC,OAAf/jB,EAAE+jB,UAE1B,GADAkJ,EAASI,EAASlE,EAAInpB,EAAG+G,GACrBkmB,IAAWjtB,GAAKitB,IAAW9D,EAC7B,OAAO,OAEJ,GAAoB,OAAhBA,EAAGpF,WAAsB6G,EAAUzB,EAAGrF,OAAQhM,OAAO9X,GAAI+G,GAClE,OAAO,EAGX,GAAIsiB,EASF,GARIkE,GACEvtB,EAAE8jB,OAAOpD,YAAc1gB,EAAE8jB,OAAOpD,WAAW5qB,QAC3CkK,EAAE8jB,OAAOvD,QAAUgN,EAAahN,OAChCvgB,EAAE8jB,OAAOtD,QAAU+M,EAAa/M,OAChCxgB,EAAE8jB,OAAOrD,QAAU8M,EAAa9M,QAClC8M,GAAe,GAGA,MAAfvtB,EAAE+jB,UAAmC,OAAf/jB,EAAE+jB,UAE1B,GADAmJ,EAAQI,EAAQjE,EAAIrpB,EAAG+G,GACnBmmB,IAAUltB,GAAKktB,IAAU7D,EAC3B,OAAO,OAEJ,GAAoB,OAAhBA,EAAGtF,WAAsB6G,EAAUvB,EAAGvF,OAAQhM,OAAO9X,GAAI+G,GAClE,OAAO,EAGX,IAAK/G,EAAE+jB,WAAasF,GAAMF,IAAoB,IAAb6D,EAC/B,OAAO,CAEX,CAKA,QAAI7D,GAAMgE,IAAa9D,GAAmB,IAAb2D,GAIzB3D,GAAM+D,IAAajE,GAAmB,IAAb6D,GAOzBQ,GAAgBD,EAIb,EAIHF,EAAW,CAACzZ,EAAGC,EAAG9M,KACtB,IAAK6M,EACH,OAAOC,EAET,MAAMgQ,EAAOhD,EAAQjN,EAAEkQ,OAAQjQ,EAAEiQ,OAAQ/c,GACzC,OAAO8c,EAAO,EAAIjQ,EACdiQ,EAAO,GACQ,MAAfhQ,EAAEkQ,UAAmC,OAAfnQ,EAAEmQ,SADblQ,EAEXD,GAIA0Z,EAAU,CAAC1Z,EAAGC,EAAG9M,KACrB,IAAK6M,EACH,OAAOC,EAET,MAAMgQ,EAAOhD,EAAQjN,EAAEkQ,OAAQjQ,EAAEiQ,OAAQ/c,GACzC,OAAO8c,EAAO,EAAIjQ,EACdiQ,EAAO,GACQ,MAAfhQ,EAAEkQ,UAAmC,OAAfnQ,EAAEmQ,SADblQ,EAEXD,GAGN/X,EAAOC,QAzMQ,CAAC+wB,EAAKC,EAAK/lB,EAAU,CAAC,KACnC,GAAI8lB,IAAQC,EACV,OAAO,EAGTD,EAAM,IAAIzI,EAAMyI,EAAK9lB,GACrB+lB,EAAM,IAAI1I,EAAM0I,EAAK/lB,GACrB,IAAI0mB,GAAa,EAEjBC,EAAO,IAAK,MAAMC,KAAad,EAAIp0B,IAAK,CACtC,IAAK,MAAMm1B,KAAad,EAAIr0B,IAAK,CAC/B,MAAMo1B,EAAQjB,EAAae,EAAWC,EAAW7mB,GAEjD,GADA0mB,EAAaA,GAAwB,OAAVI,EACvBA,EACF,SAASH,CAEb,CAKA,GAAID,EACF,OAAO,CAEX,CACA,OAAO,E,kBCnET,MAAMrJ,EAAQ,EAAQ,OAOtBvoB,EAAOC,QAJe,CAAC6M,EAAO5B,IAC5B,IAAIqd,EAAMzb,EAAO5B,GAAStO,IACvB4B,KAAIwpB,GAAQA,EAAKxpB,KAAI2F,GAAKA,EAAE7I,QAAO0F,KAAK,KAAK4N,OAAOnM,MAAM,M,kBCL/D,MAAM8lB,EAAQ,EAAQ,OAUtBvoB,EAAOC,QATY,CAAC6M,EAAO5B,KACzB,IAGE,OAAO,IAAIqd,EAAMzb,EAAO5B,GAAS4B,OAAS,GAG5C,CAFE,MAAO0Y,GACP,OAAO,IACT,E,kBCOF,IAAIvD,EAAQ,EAAQ,OAChBgQ,EAAiB,EAAQ,OAE7B,SAASxD,EAAOtS,GACd,IAEE,OADA8F,EAAM9F,IACC,CAGT,CAFE,MAAOxE,GACP,OAAO,CACT,CACF,CAGA,IAAIua,EAAiB,CACnB,CAAC,OAAQ,QACT,CAAC,MAAO,OACR,CAAC,MAAO,OACR,CAAC,MAAO,UACR,CAAC,MAAO,OACR,CAAC,MAAO,OACR,CAAC,MAAO,OACR,CAAC,SAAU,UACX,CAAC,YAAa,KACd,CAAC,iBAAkB,IACnB,CAAC,MAAO,OACR,CAAC,MAAO,OACR,CAAC,IAAK,IACN,CAAC,UAAW,OACZ,CAAC,UAAW,OACZ,CAAC,UAAW,OACZ,CAAC,6BAA8B,OAC/B,CAAC,qBAAsB,OACvB,CAAC,qBAAsB,OACvB,CAAC,6BAA8B,OAC/B,CAAC,MAAO,OACR,CAAC,yBAA0B,OAC3B,CAAC,+BAAgC,OACjC,CAAC,MAAO,OACR,CAAC,WAAY,KAOXC,EAAa,CAEf,SAAUC,GACR,OAAOA,EAASrO,aAClB,EAEA,SAAUqO,GACR,OAAOA,EAASxjB,MAClB,EAEA,SAAUwjB,GACR,OAAOA,EAASxvB,QAAQ,MAAO,GACjC,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,OAAQ,GAClC,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,OAAQ,IAClC,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,IAAK,IAC/B,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,YAAa,MACvC,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,YAAa,QACvC,EAEA,SAAUwvB,GACR,OAAOA,EACJxvB,QAAQ,4CAA6C,MAC1D,EAEA,SAAUwvB,GACR,OAAOA,EACJxvB,QAAQ,4CAA6C,QAC1D,EAEA,SAAUwvB,GACR,OAAOA,EAAS,GAAGrO,cAAgBqO,EAASh4B,MAAM,EACpD,EAEA,SAAUg4B,GACR,OAAOA,EAASxvB,QAAQ,IAAK,IAC/B,EAEA,SAAUwvB,GACR,OAAOA,EACJxvB,QAAQ,cAAe,OACvBA,QAAQ,QAAS,OACtB,EAEA,SAAUwvB,GACR,OAAiC,IAA7BA,EAASz0B,QAAQ,OACZy0B,EAAW,YAEXA,EAAW,OAEtB,EAEA,SAAUA,GACR,OAAOA,EAAW,MACpB,EAEA,SAAUA,GACR,OAAOA,EAASxvB,QAAQ,QAAS,QACnC,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,cAAe,aACzC,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,uBAAwB,aAClD,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,oDAAqD,eAC/E,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,wCAAyC,eACnE,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,wCAAyC,qBACnE,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,mCAAoC,qBAC9D,EAEA,SAAUwvB,GACR,OAAOA,EAASxvB,QAAQ,4CAA6C,eACvE,EAEA,SAAUwvB,GACR,MAAO,MAAQA,CACjB,EAEA,SAAUA,GACR,MAAO,MAAQA,EAAW,MAC5B,EAEA,SAAUA,GACR,OAAOA,EACJxvB,QAAQ,cAAe,MACvBA,QAAQ,gBAAiB,MACzBA,QAAQ,gBAAiB,MACzBA,QAAQ,QAAS,OACjBA,QAAQ,kBAAmB,GAChC,EAEA,SAAUwvB,GACR,MAAO,MACLA,EACGxvB,QAAQ,cAAe,MACvBA,QAAQ,gBAAiB,MACzBA,QAAQ,gBAAiB,MACzBA,QAAQ,QAAS,OACjBA,QAAQ,kBAAmB,IAC9B,MACJ,GAGEyvB,EAAuBJ,EACxBzzB,KAAI,SAAUjC,GACb,IAAIuF,EAAQ,kBAAkBE,KAAKzF,GACnC,OAAOuF,EACH,CAACA,EAAM,GAAIA,EAAM,IACjB,CAACvF,EAAI,KACX,IACC2pB,QAAO,SAAUoM,EAAWxhB,GAC3B,IAAIxT,EAAMwT,EAAK,GAGf,OAFAwhB,EAAUh1B,GAAOg1B,EAAUh1B,IAAQ,GACnCg1B,EAAUh1B,GAAKwD,KAAKgQ,EAAK,IAClBwhB,CACT,GAAG,CAAC,GAEFC,EAAyB5zB,OAAOwR,KAAKkiB,GACtC7zB,KAAI,SAAsBlB,GACzB,MAAO,CAACA,EAAK+0B,EAAqB/0B,GACpC,IACCoT,QAAO,SAA+BI,GACrC,OAEqB,IAAnBA,EAAK,GAAG7W,QACI,OAAZ6W,EAAK,IAEO,QAAZA,EAAK,EAET,IACCtS,KAAI,SAA4BsS,GAC/B,MAAO,CAACA,EAAK,GAAIA,EAAK,GAAG,GAC3B,IAEFuhB,OAAuB71B,EAIvB,IAAIg2B,EAAc,CAChB,CAAC,OAAQ,aACT,CAAC,MAAO,SACR,CAAC,WAAY,gBACb,CAAC,WAAY,gBACb,CAAC,WAAY,gBACb,CAAC,WAAY,gBACb,CAAC,SAAU,qBACX,CAAC,OAAQ,qBACT,CAAC,SAAU,cACX,CAAC,WAAY,gBACb,CAAC,SAAU,qBACX,CAAC,OAAQ,YACT,CAAC,QAAS,WACV,CAAC,MAAO,gBACR,CAAC,OAAQ,YACT,CAAC,UAAW,WACZ,CAAC,OAAQ,SACT,CAAC,MAAO,oBACR,CAAC,OAAQ,qBACT,CAAC,QAAS,gBACV,CAAC,QAAS,gBACV,CAAC,QAAS,gBACV,CAAC,QAAS,gBACV,CAAC,MAAO,oBACR,CAAC,wBAAyB,UAC1B,CAAC,MAAO,OACR,CAAC,MAAO,WACR,CAAC,MAAO,OACR,CAAC,OAAQ,SACT9xB,OAAO6xB,GAKLE,EAAsB,SAAUnN,GAClC,IAAK,IAAIzkB,EAAI,EAAGA,EAAIsxB,EAAWl4B,OAAQ4G,IAAK,CAC1C,IAAI6xB,EAAcP,EAAWtxB,GAAGykB,GAAY1W,OAC5C,GAAI8jB,IAAgBpN,GAAcmJ,EAAMiE,GACtC,OAAOA,CAEX,CACA,OAAO,IACT,EAEIC,EAAkB,SAAUrN,GAE9B,IADA,IAAIsN,EAAatN,EAAWvB,cACnBljB,EAAI,EAAGA,EAAI2xB,EAAYv4B,OAAQ4G,IAAK,CAC3C,IAAIgyB,EAAaL,EAAY3xB,GAC7B,GAAI+xB,EAAWj1B,QAAQk1B,EAjBX,KAiBqC,EAC/C,OAAOA,EAjBI,EAmBf,CACA,OAAO,IACT,EAEIC,EAAgB,SAAUxN,EAAYnnB,GACxC,IAAK,IAAI0C,EAAI,EAAGA,EAAIqxB,EAAej4B,OAAQ4G,IAAK,CAC9C,IAAIkyB,EAAgBb,EAAerxB,GAC/BmyB,EAAaD,EArOJ,GAsOb,GAAIzN,EAAW3nB,QAAQq1B,IAAe,EAAG,CACvC,IAIIC,EAAU90B,EAJEmnB,EAAW1iB,QACzBowB,EACAD,EAxOM,KA2OR,GAAgB,OAAZE,EACF,OAAOA,CAEX,CACF,CACA,OAAO,IACT,EAEAjzB,EAAOC,QAAU,SAAUqlB,EAAYpa,GAErC,IAAIgoB,OAA8B12B,KADlC0O,EAAUA,GAAW,CAAC,GACAgoB,WAAiChoB,EAAQgoB,QAC/D,SAASC,EAAa73B,GACpB,OAAO43B,EAyCX,SAAsB53B,GACpB,OAIsB,IAJlB,CACF,UAAW,WAAY,WACvB,UAAW,WAAY,WACvB,YACAqC,QAAQrC,GACDA,EAAQ,SAKK,IAJX,CACT,WAAY,WAAY,WACxB,YAAa,YAAa,YAC1B,YAAa,aACbqC,QAAQrC,GACDA,EAAMsH,QAAQ,MAAO,cACqC,IAAxD,CAAC,UAAW,WAAY,YAAYjF,QAAQrC,GAC9CA,EAAQ,YAERA,CAEX,CA3DqB83B,CAAY93B,GAASA,CACxC,CAKA,GAHwB,iBAAfgqB,GACsB,IAA7BA,EAAW1W,OAAO3U,OAGlB,MAAM8E,MAAM,gDAGd,GAAI0vB,EADJnJ,EAAaA,EAAW1W,QAEtB,OAAOukB,EAAY7N,GAErB,IAAI+N,EAAS/N,EAAW1iB,QAAQ,MAAO,IAAIgM,OAC3C,GAAI6f,EAAM4E,GACR,OAAOF,EAAYE,GAErB,IAAIX,EAAcD,EAAoBnN,GACtC,OAAoB,OAAhBoN,GASgB,QANpBA,EAAcI,EAAcxN,GAAY,SAAU8M,GAChD,OAAI3D,EAAM2D,GACDA,EAEFK,EAAoBL,EAC7B,MAKoB,QADpBM,EAAcC,EAAgBrN,KAKV,QADpBoN,EAAcI,EAAcxN,EAAYqN,IAf/BQ,EAAYT,GAmBd,IACT,C,+BCrVA,IAAIY,EAAO,EAAQ,OACfrR,EAAQ,EAAQ,OAEpBjiB,EAAOC,QAAU,SAAU5C,GACzB,OAAO4kB,EAAMqR,EAAKj2B,GACpB,C,yBCAA2C,EAAOC,QAAU,SAAUyvB,GACzB,IAAIztB,EAAQ,EAEZ,SAASsxB,IACP,OAAOtxB,EAAQytB,EAAOz1B,MACxB,CAEA,SAASihB,IACP,OAAOqY,IAAY7D,EAAOztB,GAAS,IACrC,CAEA,SAAS7G,IACP,IAAKm4B,IACH,MAAM,IAAIx0B,MAEZkD,GACF,CAEA,SAASuxB,EAAetL,GACtB,IAAI1T,EAAI0G,IACR,GAAI1G,GAAgB,aAAXA,EAAEjQ,MAAuB2jB,IAAa1T,EAAE2H,OAE/C,OADA/gB,IACOoZ,EAAE2H,MAEb,CA2EA,SAASsX,EAAoBvL,EAAUwL,GACrC,OAAO,SAASC,IACd,IAAIC,EAAOF,IACX,GAAKE,EAAL,CAIA,IAAKJ,EAActL,GACjB,OAAO0L,EAGT,IAAIC,EAAQF,IACZ,IAAKE,EACH,MAAM,IAAI90B,MAAM,uBAElB,MAAO,CACL60B,KAAMA,EACNE,YAAa5L,EAASzf,cACtBorB,MAAOA,EAbT,CAeF,CACF,CAEA,IAAIE,EAAWN,EAAmB,OA/BlC,WACE,OAhBF,WAEE,GADWD,EAAc,KACzB,CAIA,IAAIQ,EAAOC,IAEX,IAAKT,EAAc,KACjB,MAAM,IAAIz0B,MAAM,gBAGlB,OAAOi1B,CARP,CASF,CAIIE,IAxDJ,WAIE,IAAIC,EAAQlyB,EACRka,EAAS,GACT3H,EAAI0G,IACR,GAAe,gBAAX1G,EAAEjQ,OACJnJ,IACA+gB,GAAU,eAAiB3H,EAAE2H,OAAS,KACjCqX,EAAc,MACjB,MAAM,IAAIz0B,MAAM,wCAIpB,GAAe,gBADfyV,EAAI0G,KACE3W,KAGJ,OAFAnJ,IAEO,CAAEknB,QADTnG,GAAU,cAAgB3H,EAAE2H,QAG9Bla,EAAQkyB,CACV,CAoCIC,IAlCJ,WACE,IAAI5f,EAAI0G,IACR,GAAI1G,GAAgB,YAAXA,EAAEjQ,KAAoB,CAC7BnJ,IACA,IAAIgS,EAAO,CAAEkV,QAAS9N,EAAE2H,QACpBqX,EAAc,OAChBpmB,EAAKinB,MAAO,GAEd,IAAIC,EA1CR,WACE,GAAId,EAAc,QAAS,CACzB,IAAIhf,EAAI0G,IACR,GAAI1G,GAAgB,cAAXA,EAAEjQ,KAET,OADAnJ,IACOoZ,EAAE2H,OAEX,MAAM,IAAIpd,MAAM,kCAClB,CACF,CAiCoBw1B,GAIhB,OAHID,IACFlnB,EAAKknB,UAAYA,GAEZlnB,CACT,CACF,CAqBIonB,EAEJ,IA0BIP,EAAkBR,EAAmB,KAAMM,GAE3C3mB,EAAO6mB,IACX,IAAK7mB,GAAQmmB,IACX,MAAM,IAAIx0B,MAAM,gBAElB,OAAOqO,CACT,C,+BCvIA,IAAIqnB,EAAW,GACZ/zB,OAAO,EAAQ,QACfA,OAAO,EAAQ,QACdg0B,EAAa,EAAQ,OAEzB10B,EAAOC,QAAU,SAAU5C,GACzB,IA4EM82B,EACAhY,EA7EFla,EAAQ,EAEZ,SAASsxB,IACP,OAAOtxB,EAAQ5E,EAAOpD,MACxB,CAKA,SAAS06B,EAAMr5B,GACb,GAAIA,aAAiB4I,OAAQ,CAC3B,IACIpC,EADQzE,EAAOjD,MAAM6H,GACPH,MAAMxG,GACxB,GAAIwG,EAEF,OADAG,GAASH,EAAM,GAAG7H,OACX6H,EAAM,EAEjB,MACE,GAAIzE,EAAOM,QAAQrC,EAAO2G,KAAWA,EAEnC,OADAA,GAAS3G,EAAMrB,OACRqB,CAGb,CA0BA,SAASs5B,IACP,OAAOD,EAAK,iBACd,CAEA,SAASE,IACP,IAAI1Y,EAASyY,IACb,IAAKzY,EACH,MAAM,IAAIpd,MAAM,+BAAiCkD,GAEnD,OAAOka,CACT,CAgDA,IADA,IAAIuT,EAAS,GACN6D,MAjFLoB,EAAK,QAmFApB,MAFW,CAMhB,IAAIrY,GArCAiZ,SACAhY,SAhDN,WAGE,IAFA,IAAIA,EACA2Y,EAAgB,CAAC,OAAQ,MAAO,KAAM,IAAK,IAAK,IAAK,KAChDj0B,EAAI,EAAGA,EAAIi0B,EAAc76B,UAChCkiB,EAASwY,EAAKG,EAAcj0B,KADYA,KAO1C,GAAe,MAAXsb,GAAkBla,EAAQ,GAA2B,MAAtB5E,EAAO4E,EAAQ,GAChD,MAAM,IAAIlD,MAAM,oBAGlB,OAAOod,GAAU,CACf5X,KAAM,WACN4X,OAAQA,EAEZ,CAoDI+L,IAtCJ,WACE,GAAIyM,EAAK,gBAEP,MAAO,CAAEpwB,KAAM,cAAe4X,OADjB0Y,IAGjB,CAkCIE,IAhCJ,WACE,GAAIJ,EAAK,eAEP,MAAO,CAAEpwB,KAAM,aAAc4X,OADhB0Y,IAGjB,CA4BIG,KAzBEb,EAAQlyB,EACRka,EAASyY,KAEqB,IAA9BH,EAAS92B,QAAQwe,GACZ,CACL5X,KAAM,UACN4X,OAAQA,IAE+B,IAAhCuY,EAAW/2B,QAAQwe,GACrB,CACL5X,KAAM,YACN4X,OAAQA,QAIZla,EAAQkyB,KAuBR,IAAKjZ,EACH,MAAM,IAAInc,MAAM,eAAiB1B,EAAO4E,GACxB,eAAiBA,GAGnCytB,EAAO5uB,KAAKoa,EACd,CACA,OAAOwU,CACT,C,kBClIA,MAAMuF,EAAK,EAAQ,OACbC,EAAU,EAAQ,QAClB,UAAEC,GAAc,EAAQ,OACxBC,EAAa,EAAQ,QACrB,KAAEp0B,EAAI,QAAExD,EAAO,SAAE63B,GAAa,EAAQ,OACtCC,EAAW,yBACXC,EAAUJ,EAAUF,EAAGM,SACvBC,EAAOL,EAAUF,EAAGO,MAC1B,IAAIznB,EAAQ,CAAC,EAEb1S,eAAeo6B,EAAKC,EAAQvH,EAAQvS,EAAOzhB,EAAMwI,EAAQ,GAAIgzB,EAAM,GACjE,MAAM5zB,EAAM6Z,EAAMhY,SAAS+xB,GACrBC,EAAMp4B,EAAQrD,EAAK07B,IAAK1H,EAAQxrB,GAChCkd,QAAc0V,EAAQK,IACtB,IAAEE,EAAG,UAAEC,GAAc57B,EAE3B,IAA2B4R,EACvBiqB,EAAUC,EAASp6B,EAAOq6B,EAD1Br1B,EAAE,EAAGgQ,EAAIgP,EAAM5lB,OAGnB,KAAO4G,EAAIgQ,EAAKhQ,IACdm1B,EAAWh1B,EAAK40B,EAAK7pB,EAAK8T,EAAMhf,IAChCo1B,EAAUtzB,EAAU3B,EAAK2B,EAASoJ,GAAQA,GACrC+pB,GAAOR,EAAS5yB,KAAKuzB,KAC1BC,EAAUta,EAAMlY,MAAMhB,KAAKuzB,QAEI,KAA1Bp6B,EAAMkS,EAAMkoB,MACfloB,EAAMkoB,GAAWp6B,EAAQo5B,EAAGkB,UAAUH,IAGnCn6B,EAAMu6B,cAKPr0B,IAAQA,EAAIW,KAAKqJ,MACpBgqB,GAAaG,GAAWR,EAAO50B,KAAKE,EAAKmtB,EAAQ8H,UAE5CR,EAAKC,EAAQvH,EAAQvS,EAAOzhB,EAAM87B,EAASl0B,GAAOA,EAAIjC,aAAe8b,EAAMrY,UAAYoyB,EAAQ,IAPnGO,GAAWR,EAAO50B,KAAKu0B,EAASl7B,EAAK07B,IAAKG,IAShD,CAaAh2B,EAAOC,QAAU5E,eAAgBuG,EAAKzH,EAAK,CAAC,GAC1C,IAAKyH,EAAK,MAAO,GAEjB,IAAIU,EAAO8yB,EAAWxzB,GAItB,GAFAzH,EAAK07B,IAAM17B,EAAK07B,KAAO,KAElBvzB,EAAKQ,OACR,IACE,IAAIuzB,EAAW74B,EAAQrD,EAAK07B,IAAKj0B,GAC7B00B,QAAed,EAAKa,GACxB,OAAIl8B,EAAK47B,YAAcO,EAAOC,SAAiB,GAExCp8B,EAAKq8B,SAAW,CAACH,GAAY,CAACz0B,EAKvC,CAJE,MAAOqG,GACP,GAAgB,UAAZA,EAAI2J,KAAkB,MAAM3J,EAEhC,MAAO,EACT,CAGE9N,EAAKs8B,QAAO1oB,EAAQ,CAAC,GAEzB,IAAI2oB,EAAU,GACd,MAAM,KAAEr1B,GAAS6zB,EAAQ5yB,EAAKA,KAAM,CAAEkB,UAAS,EAAMD,UAAS,EAAMD,UAAS,IAK7E,OAHAjC,EAAKkC,SAAWlC,EAAKkC,SAASzD,iBACxB21B,EAAKiB,EAASp0B,EAAKC,KAAMlB,EAAMlH,EAAM,IAAK,GAEzCA,EAAKq8B,SAAWE,EAAQl4B,KAAIwO,GAAKxP,EAAQrD,EAAK07B,IAAK7oB,KAAM0pB,CAClE,C,kBClFA,IAAIzU,EAAQ,EAAQ,OAChB0U,EAAU,EAAQ,OAElBC,EAAiB,yHAOjBC,EAAkB,2BAEtB,SAAS7zB,EAAWmrB,EAAQhS,GAC1B,OAAOA,EAAO/hB,MAAM,EAAG+zB,EAAOl0B,UAAYk0B,CAC5C,CAEA,SAAS2I,EAAeC,GACtB,GAAIA,EAAItyB,eAAe,WAAY,CACjC,IAAI6d,EAAUyU,EAAIzU,QAClB,OACEtf,EAAW,aAAcsf,IACzBtf,EAAW,cAAesf,EAE9B,CACE,OACEwU,EAAeC,EAAInD,OACnBkD,EAAeC,EAAIlD,MAGzB,CAEA7zB,EAAOC,QAAU,SAASmyB,GACxB,IAAI2E,EAEJ,IACEA,EAAM9U,EAAMmQ,EAkCd,CAjCE,MAAO3hB,GACP,IAAI3O,EACJ,GACe,eAAbswB,GACa,eAAbA,EAEA,MAAO,CACL4E,qBAAqB,EACrBxU,qBAAqB,EACrByU,YAAY,GAET,GAAIn1B,EAAQ+0B,EAAgB70B,KAAKowB,GACtC,MAAO,CACL4E,qBAAqB,EACrBxU,qBAAqB,EACrB0U,OAAQp1B,EAAM,IAGhB,IAAItB,EAAS,CACXw2B,qBAAqB,EACrBxU,qBAAqB,EACrB2U,SAAU,CAACP,IAEb,GAA+B,IAA3BxE,EAASxjB,OAAO3U,OAAc,CAChC,IAAIm9B,EAAYT,EAAQvE,GACpBgF,GACF52B,EAAO22B,SAASr2B,KACd,+CAAiDs2B,EAAY,IAGnE,CACA,OAAO52B,CAEX,CAEA,OAAIs2B,EAAeC,GACV,CACLvU,qBAAqB,EACrBwU,qBAAqB,EACrBK,MAAM,EACNF,SAAU,CAACP,IAGN,CACLpU,qBAAqB,EACrBwU,qBAAqB,EACrBK,MAAM,EAGZ,C,wBCpFAr3B,EAAOC,QAAU,SAAUqN,GACzBA,EAAQ1N,UAAUpE,OAAOga,UAAY,YACnC,IAAK,IAAI3G,EAAS5T,KAAKiV,KAAMrB,EAAQA,EAASA,EAAOzT,WAC7CyT,EAAOvT,KAEjB,CACF,C,+BCDA,SAASgS,EAAS+gB,GAChB,IAAIngB,EAAOjT,KASX,GARMiT,aAAgBZ,IACpBY,EAAO,IAAIZ,GAGbY,EAAKY,KAAO,KACZZ,EAAKgC,KAAO,KACZhC,EAAKjU,OAAS,EAEVo0B,GAAgC,mBAAjBA,EAAKte,QACtBse,EAAKte,SAAQ,SAAUe,GACrB5C,EAAKpN,KAAKgQ,EACZ,SACK,GAAIvW,UAAUN,OAAS,EAC5B,IAAK,IAAI4G,EAAI,EAAGsQ,EAAI5W,UAAUN,OAAQ4G,EAAIsQ,EAAGtQ,IAC3CqN,EAAKpN,KAAKvG,UAAUsG,IAIxB,OAAOqN,CACT,CAoWA,SAASpN,EAAMoN,EAAM4C,GACnB5C,EAAKY,KAAO,IAAIwoB,EAAKxmB,EAAM5C,EAAKY,KAAM,KAAMZ,GACvCA,EAAKgC,OACRhC,EAAKgC,KAAOhC,EAAKY,MAEnBZ,EAAKjU,QACP,CAEA,SAAS8W,EAAS7C,EAAM4C,GACtB5C,EAAKgC,KAAO,IAAIonB,EAAKxmB,EAAM,KAAM5C,EAAKgC,KAAMhC,GACvCA,EAAKY,OACRZ,EAAKY,KAAOZ,EAAKgC,MAEnBhC,EAAKjU,QACP,CAEA,SAASq9B,EAAMh8B,EAAOyT,EAAM3T,EAAMizB,GAChC,KAAMpzB,gBAAgBq8B,GACpB,OAAO,IAAIA,EAAKh8B,EAAOyT,EAAM3T,EAAMizB,GAGrCpzB,KAAKozB,KAAOA,EACZpzB,KAAKK,MAAQA,EAETyT,GACFA,EAAK3T,KAAOH,KACZA,KAAK8T,KAAOA,GAEZ9T,KAAK8T,KAAO,KAGV3T,GACFA,EAAK2T,KAAO9T,KACZA,KAAKG,KAAOA,GAEZH,KAAKG,KAAO,IAEhB,CAnaA4E,EAAOC,QAAUqN,EAEjBA,EAAQgqB,KAAOA,EACfhqB,EAAQ0L,OAAS1L,EAyBjBA,EAAQ1N,UAAUoP,WAAa,SAAU5B,GACvC,GAAIA,EAAKihB,OAASpzB,KAChB,MAAM,IAAI8D,MAAM,oDAGlB,IAAI3D,EAAOgS,EAAKhS,KACZ2T,EAAO3B,EAAK2B,KAsBhB,OApBI3T,IACFA,EAAK2T,KAAOA,GAGVA,IACFA,EAAK3T,KAAOA,GAGVgS,IAASnS,KAAKiV,OAChBjV,KAAKiV,KAAO9U,GAEVgS,IAASnS,KAAK6T,OAChB7T,KAAK6T,KAAOC,GAGd3B,EAAKihB,KAAKp0B,SACVmT,EAAKhS,KAAO,KACZgS,EAAK2B,KAAO,KACZ3B,EAAKihB,KAAO,KAELjzB,CACT,EAEAkS,EAAQ1N,UAAU6O,YAAc,SAAUrB,GACxC,GAAIA,IAASnS,KAAKiV,KAAlB,CAII9C,EAAKihB,MACPjhB,EAAKihB,KAAKrf,WAAW5B,GAGvB,IAAI8C,EAAOjV,KAAKiV,KAChB9C,EAAKihB,KAAOpzB,KACZmS,EAAKhS,KAAO8U,EACRA,IACFA,EAAKnB,KAAO3B,GAGdnS,KAAKiV,KAAO9C,EACPnS,KAAK6T,OACR7T,KAAK6T,KAAO1B,GAEdnS,KAAKhB,QAjBL,CAkBF,EAEAqT,EAAQ1N,UAAU23B,SAAW,SAAUnqB,GACrC,GAAIA,IAASnS,KAAK6T,KAAlB,CAII1B,EAAKihB,MACPjhB,EAAKihB,KAAKrf,WAAW5B,GAGvB,IAAI0B,EAAO7T,KAAK6T,KAChB1B,EAAKihB,KAAOpzB,KACZmS,EAAK2B,KAAOD,EACRA,IACFA,EAAK1T,KAAOgS,GAGdnS,KAAK6T,KAAO1B,EACPnS,KAAKiV,OACRjV,KAAKiV,KAAO9C,GAEdnS,KAAKhB,QAjBL,CAkBF,EAEAqT,EAAQ1N,UAAUkB,KAAO,WACvB,IAAK,IAAID,EAAI,EAAGsQ,EAAI5W,UAAUN,OAAQ4G,EAAIsQ,EAAGtQ,IAC3CC,EAAK7F,KAAMV,UAAUsG,IAEvB,OAAO5F,KAAKhB,MACd,EAEAqT,EAAQ1N,UAAUmR,QAAU,WAC1B,IAAK,IAAIlQ,EAAI,EAAGsQ,EAAI5W,UAAUN,OAAQ4G,EAAIsQ,EAAGtQ,IAC3CkQ,EAAQ9V,KAAMV,UAAUsG,IAE1B,OAAO5F,KAAKhB,MACd,EAEAqT,EAAQ1N,UAAU4E,IAAM,WACtB,GAAKvJ,KAAK6T,KAAV,CAIA,IAAI0oB,EAAMv8B,KAAK6T,KAAKxT,MAQpB,OAPAL,KAAK6T,KAAO7T,KAAK6T,KAAKC,KAClB9T,KAAK6T,KACP7T,KAAK6T,KAAK1T,KAAO,KAEjBH,KAAKiV,KAAO,KAEdjV,KAAKhB,SACEu9B,CAVP,CAWF,EAEAlqB,EAAQ1N,UAAUsW,MAAQ,WACxB,GAAKjb,KAAKiV,KAAV,CAIA,IAAIsnB,EAAMv8B,KAAKiV,KAAK5U,MAQpB,OAPAL,KAAKiV,KAAOjV,KAAKiV,KAAK9U,KAClBH,KAAKiV,KACPjV,KAAKiV,KAAKnB,KAAO,KAEjB9T,KAAK6T,KAAO,KAEd7T,KAAKhB,SACEu9B,CAVP,CAWF,EAEAlqB,EAAQ1N,UAAUmQ,QAAU,SAAUvQ,EAAI2P,GACxCA,EAAQA,GAASlU,KACjB,IAAK,IAAI4T,EAAS5T,KAAKiV,KAAMrP,EAAI,EAAc,OAAXgO,EAAiBhO,IACnDrB,EAAGY,KAAK+O,EAAON,EAAOvT,MAAOuF,EAAG5F,MAChC4T,EAASA,EAAOzT,IAEpB,EAEAkS,EAAQ1N,UAAU63B,eAAiB,SAAUj4B,EAAI2P,GAC/CA,EAAQA,GAASlU,KACjB,IAAK,IAAI4T,EAAS5T,KAAK6T,KAAMjO,EAAI5F,KAAKhB,OAAS,EAAc,OAAX4U,EAAiBhO,IACjErB,EAAGY,KAAK+O,EAAON,EAAOvT,MAAOuF,EAAG5F,MAChC4T,EAASA,EAAOE,IAEpB,EAEAzB,EAAQ1N,UAAUtD,IAAM,SAAU8F,GAChC,IAAK,IAAIvB,EAAI,EAAGgO,EAAS5T,KAAKiV,KAAiB,OAAXrB,GAAmBhO,EAAIuB,EAAGvB,IAE5DgO,EAASA,EAAOzT,KAElB,GAAIyF,IAAMuB,GAAgB,OAAXyM,EACb,OAAOA,EAAOvT,KAElB,EAEAgS,EAAQ1N,UAAU83B,WAAa,SAAUt1B,GACvC,IAAK,IAAIvB,EAAI,EAAGgO,EAAS5T,KAAK6T,KAAiB,OAAXD,GAAmBhO,EAAIuB,EAAGvB,IAE5DgO,EAASA,EAAOE,KAElB,GAAIlO,IAAMuB,GAAgB,OAAXyM,EACb,OAAOA,EAAOvT,KAElB,EAEAgS,EAAQ1N,UAAUpB,IAAM,SAAUgB,EAAI2P,GACpCA,EAAQA,GAASlU,KAEjB,IADA,IAAIu8B,EAAM,IAAIlqB,EACLuB,EAAS5T,KAAKiV,KAAiB,OAAXrB,GAC3B2oB,EAAI12B,KAAKtB,EAAGY,KAAK+O,EAAON,EAAOvT,MAAOL,OACtC4T,EAASA,EAAOzT,KAElB,OAAOo8B,CACT,EAEAlqB,EAAQ1N,UAAU+3B,WAAa,SAAUn4B,EAAI2P,GAC3CA,EAAQA,GAASlU,KAEjB,IADA,IAAIu8B,EAAM,IAAIlqB,EACLuB,EAAS5T,KAAK6T,KAAiB,OAAXD,GAC3B2oB,EAAI12B,KAAKtB,EAAGY,KAAK+O,EAAON,EAAOvT,MAAOL,OACtC4T,EAASA,EAAOE,KAElB,OAAOyoB,CACT,EAEAlqB,EAAQ1N,UAAUsmB,OAAS,SAAU1mB,EAAIo4B,GACvC,IAAIC,EACAhpB,EAAS5T,KAAKiV,KAClB,GAAI3V,UAAUN,OAAS,EACrB49B,EAAMD,MACD,KAAI38B,KAAKiV,KAId,MAAM,IAAI7P,UAAU,8CAHpBwO,EAAS5T,KAAKiV,KAAK9U,KACnBy8B,EAAM58B,KAAKiV,KAAK5U,KAGlB,CAEA,IAAK,IAAIuF,EAAI,EAAc,OAAXgO,EAAiBhO,IAC/Bg3B,EAAMr4B,EAAGq4B,EAAKhpB,EAAOvT,MAAOuF,GAC5BgO,EAASA,EAAOzT,KAGlB,OAAOy8B,CACT,EAEAvqB,EAAQ1N,UAAUk4B,cAAgB,SAAUt4B,EAAIo4B,GAC9C,IAAIC,EACAhpB,EAAS5T,KAAK6T,KAClB,GAAIvU,UAAUN,OAAS,EACrB49B,EAAMD,MACD,KAAI38B,KAAK6T,KAId,MAAM,IAAIzO,UAAU,8CAHpBwO,EAAS5T,KAAK6T,KAAKC,KACnB8oB,EAAM58B,KAAK6T,KAAKxT,KAGlB,CAEA,IAAK,IAAIuF,EAAI5F,KAAKhB,OAAS,EAAc,OAAX4U,EAAiBhO,IAC7Cg3B,EAAMr4B,EAAGq4B,EAAKhpB,EAAOvT,MAAOuF,GAC5BgO,EAASA,EAAOE,KAGlB,OAAO8oB,CACT,EAEAvqB,EAAQ1N,UAAUwQ,QAAU,WAE1B,IADA,IAAIc,EAAM,IAAI1W,MAAMS,KAAKhB,QAChB4G,EAAI,EAAGgO,EAAS5T,KAAKiV,KAAiB,OAAXrB,EAAiBhO,IACnDqQ,EAAIrQ,GAAKgO,EAAOvT,MAChBuT,EAASA,EAAOzT,KAElB,OAAO8V,CACT,EAEA5D,EAAQ1N,UAAUm4B,eAAiB,WAEjC,IADA,IAAI7mB,EAAM,IAAI1W,MAAMS,KAAKhB,QAChB4G,EAAI,EAAGgO,EAAS5T,KAAK6T,KAAiB,OAAXD,EAAiBhO,IACnDqQ,EAAIrQ,GAAKgO,EAAOvT,MAChBuT,EAASA,EAAOE,KAElB,OAAOmC,CACT,EAEA5D,EAAQ1N,UAAUxF,MAAQ,SAAUmyB,EAAMM,IACxCA,EAAKA,GAAM5xB,KAAKhB,QACP,IACP4yB,GAAM5xB,KAAKhB,SAEbsyB,EAAOA,GAAQ,GACJ,IACTA,GAAQtxB,KAAKhB,QAEf,IAAIoxB,EAAM,IAAI/d,EACd,GAAIuf,EAAKN,GAAQM,EAAK,EACpB,OAAOxB,EAELkB,EAAO,IACTA,EAAO,GAELM,EAAK5xB,KAAKhB,SACZ4yB,EAAK5xB,KAAKhB,QAEZ,IAAK,IAAI4G,EAAI,EAAGgO,EAAS5T,KAAKiV,KAAiB,OAAXrB,GAAmBhO,EAAI0rB,EAAM1rB,IAC/DgO,EAASA,EAAOzT,KAElB,KAAkB,OAAXyT,GAAmBhO,EAAIgsB,EAAIhsB,IAAKgO,EAASA,EAAOzT,KACrDiwB,EAAIvqB,KAAK+N,EAAOvT,OAElB,OAAO+vB,CACT,EAEA/d,EAAQ1N,UAAUo4B,aAAe,SAAUzL,EAAMM,IAC/CA,EAAKA,GAAM5xB,KAAKhB,QACP,IACP4yB,GAAM5xB,KAAKhB,SAEbsyB,EAAOA,GAAQ,GACJ,IACTA,GAAQtxB,KAAKhB,QAEf,IAAIoxB,EAAM,IAAI/d,EACd,GAAIuf,EAAKN,GAAQM,EAAK,EACpB,OAAOxB,EAELkB,EAAO,IACTA,EAAO,GAELM,EAAK5xB,KAAKhB,SACZ4yB,EAAK5xB,KAAKhB,QAEZ,IAAK,IAAI4G,EAAI5F,KAAKhB,OAAQ4U,EAAS5T,KAAK6T,KAAiB,OAAXD,GAAmBhO,EAAIgsB,EAAIhsB,IACvEgO,EAASA,EAAOE,KAElB,KAAkB,OAAXF,GAAmBhO,EAAI0rB,EAAM1rB,IAAKgO,EAASA,EAAOE,KACvDsc,EAAIvqB,KAAK+N,EAAOvT,OAElB,OAAO+vB,CACT,EAEA/d,EAAQ1N,UAAUsd,OAAS,SAAUL,EAAOob,KAAgBC,GACtDrb,EAAQ5hB,KAAKhB,SACf4iB,EAAQ5hB,KAAKhB,OAAS,GAEpB4iB,EAAQ,IACVA,EAAQ5hB,KAAKhB,OAAS4iB,GAGxB,IAAK,IAAIhc,EAAI,EAAGgO,EAAS5T,KAAKiV,KAAiB,OAAXrB,GAAmBhO,EAAIgc,EAAOhc,IAChEgO,EAASA,EAAOzT,KAGlB,IAgCe8S,EAAMd,EAAM9R,EACvB68B,EAjCA9M,EAAM,GACV,IAASxqB,EAAI,EAAGgO,GAAUhO,EAAIo3B,EAAap3B,IACzCwqB,EAAIvqB,KAAK+N,EAAOvT,OAChBuT,EAAS5T,KAAK+T,WAAWH,GAU3B,IARe,OAAXA,IACFA,EAAS5T,KAAK6T,MAGZD,IAAW5T,KAAKiV,MAAQrB,IAAW5T,KAAK6T,OAC1CD,EAASA,EAAOE,MAGTlO,EAAI,EAAGA,EAAIq3B,EAAMj+B,OAAQ4G,IAmBnBqN,EAlBGjT,KAkBGmS,EAlBGyB,EAkBGvT,EAlBK48B,EAAMr3B,GAmBlCs3B,SAIkB,QAJlBA,EAAW/qB,IAASc,EAAKgC,KAC3B,IAAIonB,EAAKh8B,EAAO,KAAM8R,EAAMc,GAC5B,IAAIopB,EAAKh8B,EAAO8R,EAAMA,EAAKhS,KAAM8S,IAEtB9S,OACX8S,EAAKY,KAAOqpB,GAEQ,OAAlBA,EAASppB,OACXb,EAAKgC,KAAOioB,GAGdjqB,EAAKjU,SA9BH4U,EAgCKspB,EA9BP,OAAO9M,CACT,EAEA/d,EAAQ1N,UAAUw4B,QAAU,WAG1B,IAFA,IAAIloB,EAAOjV,KAAKiV,KACZpB,EAAO7T,KAAK6T,KACPD,EAASqB,EAAiB,OAAXrB,EAAiBA,EAASA,EAAOE,KAAM,CAC7D,IAAIsH,EAAIxH,EAAOE,KACfF,EAAOE,KAAOF,EAAOzT,KACrByT,EAAOzT,KAAOib,CAChB,CAGA,OAFApb,KAAKiV,KAAOpB,EACZ7T,KAAK6T,KAAOoB,EACLjV,IACT,EA0DA,IAEE,EAAQ,KAAR,CAAyBqS,EACb,CAAZ,MAAOkY,GAAK,C","sources":["webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.1-872109c1ad-ac2fa1147f.zip/node_modules/@jujulego/event-tree/dist/esm/iterate.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-tasks-npm-1.5.0-36f352c337-231e297e11.zip/node_modules/@jujulego/tasks/dist/esm/parallel-group.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-tasks-npm-1.5.0-36f352c337-231e297e11.zip/node_modules/@jujulego/tasks/dist/esm/sequence-group.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.0-e56fc00064-9a505f08b7.zip/node_modules/@jujulego/event-tree/dist/esm/once.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.0-e56fc00064-9a505f08b7.zip/node_modules/@jujulego/event-tree/dist/esm/wait-for.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.0-e56fc00064-9a505f08b7.zip/node_modules/@jujulego/event-tree/dist/esm/utils.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.0-e56fc00064-9a505f08b7.zip/node_modules/@jujulego/event-tree/dist/esm/source.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-utils-npm-1.2.0-7079133a4b-1108fa5989.zip/node_modules/@jujulego/utils/dist/esm/condition.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.0-e56fc00064-9a505f08b7.zip/node_modules/@jujulego/event-tree/dist/esm/group.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-event-tree-npm-2.1.0-e56fc00064-9a505f08b7.zip/node_modules/@jujulego/event-tree/dist/esm/multiplexer.js","webpack://@jujulego/jill/./.yarn/cache/@jujulego-utils-npm-1.2.0-7079133a4b-1108fa5989.zip/node_modules/@jujulego/utils/dist/esm/lock.js","webpack://@jujulego/jill/./.yarn/cache/function-bind-npm-1.1.1-b56b322ae9-b32fbaebb3.zip/node_modules/function-bind/implementation.js","webpack://@jujulego/jill/./.yarn/cache/function-bind-npm-1.1.1-b56b322ae9-b32fbaebb3.zip/node_modules/function-bind/index.js","webpack://@jujulego/jill/./.yarn/cache/globalyzer-npm-0.1.0-3982d25961-419a0f95ba.zip/node_modules/globalyzer/src/index.js","webpack://@jujulego/jill/./.yarn/cache/globrex-npm-0.1.2-ddda94f2d0-adca162494.zip/node_modules/globrex/index.js","webpack://@jujulego/jill/./.yarn/cache/has-npm-1.0.3-b7f00631c1-b9ad53d53b.zip/node_modules/has/src/index.js","webpack://@jujulego/jill/./.yarn/cache/hosted-git-info-npm-6.0.0-cca8d167e3-85aeb79a19.zip/node_modules/hosted-git-info/lib/from-url.js","webpack://@jujulego/jill/./.yarn/cache/hosted-git-info-npm-6.0.0-cca8d167e3-85aeb79a19.zip/node_modules/hosted-git-info/lib/hosts.js","webpack://@jujulego/jill/./.yarn/cache/hosted-git-info-npm-6.0.0-cca8d167e3-85aeb79a19.zip/node_modules/hosted-git-info/lib/index.js","webpack://@jujulego/jill/./.yarn/cache/is-core-module-npm-2.8.1-ce21740d1b-418b7bc107.zip/node_modules/is-core-module/index.js","webpack://@jujulego/jill/./.yarn/cache/lru-cache-npm-6.0.0-b4c8668fe1-f97f499f89.zip/node_modules/lru-cache/index.js","webpack://@jujulego/jill/./.yarn/cache/lru-cache-npm-7.5.1-4ec57c38e8-f6980281c6.zip/node_modules/lru-cache/index.js","webpack://@jujulego/jill/./.yarn/cache/moo-npm-0.5.2-8fca66e02b-5a41ddf105.zip/node_modules/moo/moo.js","webpack://@jujulego/jill/./.yarn/cache/normalize-package-data-npm-5.0.0-6327e2af68-a459f05eaf.zip/node_modules/normalize-package-data/lib/extract_description.js","webpack://@jujulego/jill/./.yarn/cache/normalize-package-data-npm-5.0.0-6327e2af68-a459f05eaf.zip/node_modules/normalize-package-data/lib/fixer.js","webpack://@jujulego/jill/./.yarn/cache/normalize-package-data-npm-5.0.0-6327e2af68-a459f05eaf.zip/node_modules/normalize-package-data/lib/make_warning.js","webpack://@jujulego/jill/./.yarn/cache/normalize-package-data-npm-5.0.0-6327e2af68-a459f05eaf.zip/node_modules/normalize-package-data/lib/normalize.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/classes/semver.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/functions/clean.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/functions/parse.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/functions/valid.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/internal/constants.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/internal/debug.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/internal/identifiers.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/internal/parse-options.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.5-618cf5db6a-5eafe6102b.zip/node_modules/semver/internal/re.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/classes/comparator.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/classes/range.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/classes/semver.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/clean.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/cmp.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/coerce.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/compare-build.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/compare-loose.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/compare.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/diff.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/eq.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/gt.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/gte.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/inc.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/lt.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/lte.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/major.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/minor.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/neq.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/parse.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/patch.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/prerelease.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/rcompare.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/rsort.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/satisfies.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/sort.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/functions/valid.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/index.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/internal/constants.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/internal/debug.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/internal/identifiers.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/internal/parse-options.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/internal/re.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/gtr.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/intersects.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/ltr.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/max-satisfying.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/min-satisfying.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/min-version.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/outside.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/simplify.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/subset.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/to-comparators.js","webpack://@jujulego/jill/./.yarn/cache/semver-npm-7.3.8-25a996cb4f-ba9c7cbbf2.zip/node_modules/semver/ranges/valid.js","webpack://@jujulego/jill/./.yarn/cache/spdx-correct-npm-3.1.1-47f574c27a-77ce438344.zip/node_modules/spdx-correct/index.js","webpack://@jujulego/jill/./.yarn/cache/spdx-expression-parse-npm-3.0.1-b718cbb35a-a1c6e104a2.zip/node_modules/spdx-expression-parse/index.js","webpack://@jujulego/jill/./.yarn/cache/spdx-expression-parse-npm-3.0.1-b718cbb35a-a1c6e104a2.zip/node_modules/spdx-expression-parse/parse.js","webpack://@jujulego/jill/./.yarn/cache/spdx-expression-parse-npm-3.0.1-b718cbb35a-a1c6e104a2.zip/node_modules/spdx-expression-parse/scan.js","webpack://@jujulego/jill/./.yarn/cache/tiny-glob-npm-0.2.9-068f4ab3f8-aea5801eb6.zip/node_modules/tiny-glob/index.js","webpack://@jujulego/jill/./.yarn/cache/validate-npm-package-license-npm-3.0.4-7af8adc7a8-35703ac889.zip/node_modules/validate-npm-package-license/index.js","webpack://@jujulego/jill/./.yarn/cache/yallist-npm-4.0.0-b493d9e907-343617202a.zip/node_modules/yallist/iterator.js","webpack://@jujulego/jill/./.yarn/cache/yallist-npm-4.0.0-b493d9e907-343617202a.zip/node_modules/yallist/yallist.js"],"sourcesContent":["import { waitFor } from './wait-for';\n/** @internal */ function parseArgs(args) {\n if (args.length === 1) {\n // Observable without options\n return {\n waitFor: args,\n opts: {}\n };\n }\n if (args.length === 3) {\n // Multiplexer with options\n return {\n waitFor: args.slice(0, 2),\n opts: args[2] ?? {}\n };\n }\n if (typeof args[1] === 'string') {\n // Multiplexer without options\n return {\n waitFor: args,\n opts: {}\n };\n } else {\n // Observable with options\n return {\n waitFor: args.slice(0, 1),\n opts: args[1] ?? {}\n };\n }\n}\nexport function iterate() {\n for(var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++){\n args[_key] = arguments[_key];\n }\n const parsed = parseArgs(args);\n const abort = new Promise((_, reject)=>{\n parsed.opts.signal?.addEventListener('abort', function() {\n reject(this.reason);\n }, {\n once: true\n });\n });\n return {\n next: async ()=>{\n const value = await Promise.race([\n waitFor(...parsed.waitFor),\n abort\n ]);\n return {\n value\n };\n },\n [Symbol.asyncIterator] () {\n return this;\n }\n };\n}\n\n//# sourceMappingURL=iterate.js.map\n","import { once } from '@jujulego/event-tree';\nimport { GroupTask } from './group-task';\n// Class\nexport class ParallelGroup extends GroupTask {\n // Methods\n async *_orchestrate() {\n for (const task of this.tasks){\n yield task;\n once(task, 'completed', ()=>{\n const stats = this.stats;\n if (stats.done + stats.failed === this.tasks.length) {\n this.status = stats.failed > 0 ? 'failed' : 'done';\n }\n });\n }\n }\n _stop() {\n // Stop all tasks\n for (const task of this.tasks){\n task.stop();\n }\n }\n complexity(cache = new Map()) {\n let complexity = cache.get(this.id);\n if (complexity === undefined) {\n complexity = 0;\n for (const task of this.tasks){\n complexity = Math.max(complexity, task.complexity(cache));\n }\n complexity += super.complexity(cache);\n cache.set(this.id, complexity);\n }\n return complexity;\n }\n}\n\n//# sourceMappingURL=parallel-group.js.map\n","import { waitFor } from '@jujulego/event-tree';\nimport { GroupTask } from './group-task';\n// Class\nexport class SequenceGroup extends GroupTask {\n // Attributes\n _stopped = false;\n _currentTask;\n // Methods\n async *_orchestrate() {\n for (const task of this.tasks){\n if (this._stopped) {\n this.status = 'failed';\n return;\n }\n // Start task\n this._currentTask = task;\n yield task;\n // Wait task end\n const result = await waitFor(task, 'completed');\n if (result.status === 'failed') {\n this.status = 'failed';\n return;\n }\n }\n this.status = 'done';\n }\n _stop() {\n this._stopped = true;\n // Stop current task\n this._currentTask?.stop();\n }\n complexity(cache = new Map()) {\n let complexity = super.complexity(cache);\n complexity += this.tasks[0].complexity(cache);\n cache.set(this.id, complexity);\n return complexity;\n }\n}\n\n//# sourceMappingURL=sequence-group.js.map\n","export function once() {\n for(var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++){\n args[_key] = arguments[_key];\n }\n let off;\n if (args.length === 2) {\n const [obs, listener] = args;\n off = obs.subscribe((data)=>{\n off();\n listener(data);\n });\n } else {\n const [source, key, listener] = args;\n off = source.on(key, (data)=>{\n off();\n listener(data);\n });\n }\n return off;\n}\n\n//# sourceMappingURL=once.js.map\n","import { once } from './once';\nexport function waitFor() {\n for(var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++){\n args[_key] = arguments[_key];\n }\n return new Promise((resolve)=>once(...args, resolve));\n}\n\n//# sourceMappingURL=wait-for.js.map\n","export function splitKey(key) {\n const idx = key.indexOf('.');\n if (idx === -1) {\n return [\n key,\n ''\n ];\n } else {\n return [\n key.slice(0, idx),\n key.slice(idx + 1)\n ];\n }\n}\n\n//# sourceMappingURL=utils.js.map\n","// Utils\nexport function source() {\n const listeners = new Set();\n return {\n listeners,\n emit (data) {\n for (const listener of listeners){\n listener(data);\n }\n },\n subscribe (listener) {\n listeners.add(listener);\n return ()=>listeners.delete(listener);\n },\n unsubscribe (listener) {\n listeners.delete(listener);\n }\n };\n}\n\n//# sourceMappingURL=source.js.map\n","import { group, source, waitFor } from '@jujulego/event-tree';\n// Class\nexport class Condition {\n check() {\n this._value = this.condition();\n this._events.emit(`${this._value}`, this._value);\n }\n async waitFor(value) {\n while(this._value !== value){\n await waitFor(this._events, `${value}`);\n }\n }\n // Properties\n get value() {\n return this._value;\n }\n // Constructor\n constructor(condition){\n this.condition = condition;\n this._events = group({\n 'true': source(),\n 'false': source()\n });\n this.// Methods\n on = this._events.on;\n this.off = this._events.off;\n this.subscribe = this._events.subscribe;\n this.unsubscribe = this._events.unsubscribe;\n this._value = condition();\n }\n}\n\n//# sourceMappingURL=condition.js.map\n","import { multiplexer } from './multiplexer';\nimport { source } from './source';\n// Utils\nexport function group(map) {\n const mlt = multiplexer(map);\n const src = source();\n return {\n sources: mlt.sources,\n listeners: src.listeners,\n emit (key, data) {\n mlt.emit(key, data);\n src.emit(data);\n },\n on: mlt.on,\n off: mlt.off,\n subscribe: src.subscribe,\n unsubscribe: src.unsubscribe\n };\n}\n\n//# sourceMappingURL=group.js.map\n","import { splitKey } from './utils';\n// Utils\nexport function multiplexer(map) {\n const sources = new Map(Object.entries(map));\n function getSource(key) {\n const src = sources.get(key);\n if (!src) {\n throw new Error(`Child source ${key} not found`);\n }\n return src;\n }\n return {\n sources,\n emit (key, data) {\n const [part, subkey] = splitKey(key);\n const src = getSource(part);\n if (subkey) {\n src.emit(subkey, data);\n } else {\n src.emit(data);\n }\n },\n on (key, listener) {\n const [part, subkey] = splitKey(key);\n const src = getSource(part);\n if (subkey) {\n return src.on(subkey, listener);\n } else {\n return src.subscribe(listener);\n }\n },\n off (key, listener) {\n const [part, subkey] = splitKey(key);\n const src = getSource(part);\n if (subkey) {\n src.off(subkey, listener);\n } else {\n src.unsubscribe(listener);\n }\n }\n };\n}\n\n//# sourceMappingURL=multiplexer.js.map\n","import { Condition } from './condition';\n// Class\nexport class Lock {\n // Methods\n async acquire() {\n await this._locked.waitFor(false);\n this._count++;\n this._locked.check();\n }\n release() {\n this._count--;\n this._locked.check();\n }\n async with(fn) {\n try {\n await this.acquire();\n return await fn();\n } finally{\n this.release();\n }\n }\n // Properties\n get locked() {\n return this._locked.value;\n }\n constructor(){\n // Attributes\n this._count = 0;\n this._locked = new Condition(()=>this._count > 0);\n }\n}\n\n//# sourceMappingURL=lock.js.map\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slice.call(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n args.concat(slice.call(arguments))\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n } else {\n return target.apply(\n that,\n args.concat(slice.call(arguments))\n );\n }\n };\n\n var boundLength = Math.max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs.push('$' + i);\n }\n\n bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ 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\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\nconst os = require('os');\nconst path = require('path');\nconst isWin = os.platform() === 'win32';\n\nconst CHARS = { '{': '}', '(': ')', '[': ']'};\nconst STRICT = /\\\\(.)|(^!|\\*|[\\].+)]\\?|\\[[^\\\\\\]]+\\]|\\{[^\\\\}]+\\}|\\(\\?[:!=][^\\\\)]+\\)|\\([^|]+\\|[^\\\\)]+\\)|(\\\\).|([@?!+*]\\(.*\\)))/;\nconst RELAXED = /\\\\(.)|(^!|[*?{}()[\\]]|\\(\\?)/;\n\n/**\n * Detect if a string cointains glob\n * @param {String} str Input string\n * @param {Object} [options] Configuration object\n * @param {Boolean} [options.strict=true] Use relaxed regex if true\n * @returns {Boolean} true if string contains glob\n */\nfunction isglob(str, { strict = true } = {}) {\n if (str === '') return false;\n let match, rgx = strict ? STRICT : RELAXED;\n\n while ((match = rgx.exec(str))) {\n if (match[2]) return true;\n let idx = match.index + match[0].length;\n\n // if an open bracket/brace/paren is escaped,\n // set the index to the next closing character\n let open = match[1];\n let close = open ? CHARS[open] : null;\n if (open && close) {\n let n = str.indexOf(close, idx);\n if (n !== -1) idx = n + 1;\n }\n\n str = str.slice(idx);\n }\n return false;\n}\n\n\n/**\n * Find the static part of a glob-path,\n * split path and return path part\n * @param {String} str Path/glob string\n * @returns {String} static path section of glob\n */\nfunction parent(str, { strict = false } = {}) {\n if (isWin && str.includes('/'))\n str = str.split('\\\\').join('/');\n\n\t// special case for strings ending in enclosure containing path separator\n\tif (/[\\{\\[].*[\\/]*.*[\\}\\]]$/.test(str)) str += '/';\n\n\t// preserves full path in case of trailing path separator\n\tstr += 'a';\n\n\tdo {str = path.dirname(str)}\n\twhile (isglob(str, {strict}) || /(^|[^\\\\])([\\{\\[]|\\([^\\)]+$)/.test(str));\n\n\t// remove escape chars and return result\n\treturn str.replace(/\\\\([\\*\\?\\|\\[\\]\\(\\)\\{\\}])/g, '$1');\n};\n\n\n/**\n * Parse a glob path, and split it by static/glob part\n * @param {String} pattern String path\n * @param {Object} [opts] Options\n * @param {Object} [opts.strict=false] Use strict parsing\n * @returns {Object} object with parsed path\n */\nfunction globalyzer(pattern, opts = {}) {\n let base = parent(pattern, opts);\n let isGlob = isglob(pattern, opts);\n let glob;\n\n if (base != '.') {\n glob = pattern.substr(base.length);\n if (glob.startsWith('/')) glob = glob.substr(1);\n } else {\n glob = pattern;\n }\n\n if (!isGlob) {\n base = path.dirname(pattern);\n glob = base !== '.' ? pattern.substr(base.length) : pattern;\n }\n\n if (glob.startsWith('./')) glob = glob.substr(2);\n if (glob.startsWith('/')) glob = glob.substr(1);\n\n return { base, glob, isGlob };\n}\n\n\nmodule.exports = globalyzer;\n","const isWin = process.platform === 'win32';\nconst SEP = isWin ? `\\\\\\\\+` : `\\\\/`;\nconst SEP_ESC = isWin ? `\\\\\\\\` : `/`;\nconst GLOBSTAR = `((?:[^/]*(?:/|$))*)`;\nconst WILDCARD = `([^/]*)`;\nconst GLOBSTAR_SEGMENT = `((?:[^${SEP_ESC}]*(?:${SEP_ESC}|$))*)`;\nconst WILDCARD_SEGMENT = `([^${SEP_ESC}]*)`;\n\n/**\n * Convert any glob pattern to a JavaScript Regexp object\n * @param {String} glob Glob pattern to convert\n * @param {Object} opts Configuration object\n * @param {Boolean} [opts.extended=false] Support advanced ext globbing\n * @param {Boolean} [opts.globstar=false] Support globstar\n * @param {Boolean} [opts.strict=true] be laissez faire about mutiple slashes\n * @param {Boolean} [opts.filepath=''] Parse as filepath for extra path related features\n * @param {String} [opts.flags=''] RegExp globs\n * @returns {Object} converted object with string, segments and RegExp object\n */\nfunction globrex(glob, {extended = false, globstar = false, strict = false, filepath = false, flags = ''} = {}) {\n let regex = '';\n let segment = '';\n let path = { regex: '', segments: [] };\n\n // If we are doing extended matching, this boolean is true when we are inside\n // a group (eg {*.html,*.js}), and false otherwise.\n let inGroup = false;\n let inRange = false;\n\n // extglob stack. Keep track of scope\n const ext = [];\n\n // Helper function to build string and segments\n function add(str, {split, last, only}={}) {\n if (only !== 'path') regex += str;\n if (filepath && only !== 'regex') {\n path.regex += (str === '\\\\/' ? SEP : str);\n if (split) {\n if (last) segment += str;\n if (segment !== '') {\n if (!flags.includes('g')) segment = `^${segment}$`; // change it 'includes'\n path.segments.push(new RegExp(segment, flags));\n }\n segment = '';\n } else {\n segment += str;\n }\n }\n }\n\n let c, n;\n for (let i = 0; i < glob.length; i++) {\n c = glob[i];\n n = glob[i + 1];\n\n if (['\\\\', '$', '^', '.', '='].includes(c)) {\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '/') {\n add(`\\\\${c}`, {split: true});\n if (n === '/' && !strict) regex += '?';\n continue;\n }\n\n if (c === '(') {\n if (ext.length) {\n add(c);\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === ')') {\n if (ext.length) {\n add(c);\n let type = ext.pop();\n if (type === '@') {\n add('{1}');\n } else if (type === '!') {\n add('([^\\/]*)');\n } else {\n add(type);\n }\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n \n if (c === '|') {\n if (ext.length) {\n add(c);\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '+') {\n if (n === '(' && extended) {\n ext.push(c);\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '@' && extended) {\n if (n === '(') {\n ext.push(c);\n continue;\n }\n }\n\n if (c === '!') {\n if (extended) {\n if (inRange) {\n add('^');\n continue\n }\n if (n === '(') {\n ext.push(c);\n add('(?!');\n i++;\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '?') {\n if (extended) {\n if (n === '(') {\n ext.push(c);\n } else {\n add('.');\n }\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '[') {\n if (inRange && n === ':') {\n i++; // skip [\n let value = '';\n while(glob[++i] !== ':') value += glob[i];\n if (value === 'alnum') add('(\\\\w|\\\\d)');\n else if (value === 'space') add('\\\\s');\n else if (value === 'digit') add('\\\\d');\n i++; // skip last ]\n continue;\n }\n if (extended) {\n inRange = true;\n add(c);\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === ']') {\n if (extended) {\n inRange = false;\n add(c);\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '{') {\n if (extended) {\n inGroup = true;\n add('(');\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '}') {\n if (extended) {\n inGroup = false;\n add(')');\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === ',') {\n if (inGroup) {\n add('|');\n continue;\n }\n add(`\\\\${c}`);\n continue;\n }\n\n if (c === '*') {\n if (n === '(' && extended) {\n ext.push(c);\n continue;\n }\n // Move over all consecutive \"*\"'s.\n // Also store the previous and next characters\n let prevChar = glob[i - 1];\n let starCount = 1;\n while (glob[i + 1] === '*') {\n starCount++;\n i++;\n }\n let nextChar = glob[i + 1];\n if (!globstar) {\n // globstar is disabled, so treat any number of \"*\" as one\n add('.*');\n } else {\n // globstar is enabled, so determine if this is a globstar segment\n let isGlobstar =\n starCount > 1 && // multiple \"*\"'s\n (prevChar === '/' || prevChar === undefined) && // from the start of the segment\n (nextChar === '/' || nextChar === undefined); // to the end of the segment\n if (isGlobstar) {\n // it's a globstar, so match zero or more path segments\n add(GLOBSTAR, {only:'regex'});\n add(GLOBSTAR_SEGMENT, {only:'path', last:true, split:true});\n i++; // move over the \"/\"\n } else {\n // it's not a globstar, so only match one path segment\n add(WILDCARD, {only:'regex'});\n add(WILDCARD_SEGMENT, {only:'path'});\n }\n }\n continue;\n }\n\n add(c);\n }\n\n\n // When regexp 'g' flag is specified don't\n // constrain the regular expression with ^ & $\n if (!flags.includes('g')) {\n regex = `^${regex}$`;\n segment = `^${segment}$`;\n if (filepath) path.regex = `^${path.regex}$`;\n }\n\n const result = {regex: new RegExp(regex, flags)};\n\n // Push the last segment\n if (filepath) {\n path.segments.push(new RegExp(segment, flags));\n path.regex = new RegExp(path.regex, flags);\n path.globstar = new RegExp(!flags.includes('g') ? `^${GLOBSTAR_SEGMENT}$` : GLOBSTAR_SEGMENT, flags);\n result.path = path;\n }\n\n return result;\n}\n\nmodule.exports = globrex;\n","'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\n","'use strict'\n\nconst url = require('url')\n\nconst safeUrl = (u) => {\n try {\n return new url.URL(u)\n } catch {\n // this fn should never throw\n }\n}\n\nconst lastIndexOfBefore = (str, char, beforeChar) => {\n const startPosition = str.indexOf(beforeChar)\n return str.lastIndexOf(char, startPosition > -1 ? startPosition : Infinity)\n}\n\n// accepts input like git:github.com:user/repo and inserts the // after the first :\nconst correctProtocol = (arg, protocols) => {\n const firstColon = arg.indexOf(':')\n const proto = arg.slice(0, firstColon + 1)\n if (Object.prototype.hasOwnProperty.call(protocols, proto)) {\n return arg\n }\n\n const firstAt = arg.indexOf('@')\n if (firstAt > -1) {\n if (firstAt > firstColon) {\n return `git+ssh://${arg}`\n } else {\n return arg\n }\n }\n\n const doubleSlash = arg.indexOf('//')\n if (doubleSlash === firstColon + 1) {\n return arg\n }\n\n return `${arg.slice(0, firstColon + 1)}//${arg.slice(firstColon + 1)}`\n}\n\n// look for github shorthand inputs, such as npm/cli\nconst isGitHubShorthand = (arg) => {\n // it cannot contain whitespace before the first #\n // it cannot start with a / because that's probably an absolute file path\n // but it must include a slash since repos are username/repository\n // it cannot start with a . because that's probably a relative file path\n // it cannot start with an @ because that's a scoped package if it passes the other tests\n // it cannot contain a : before a # because that tells us that there's a protocol\n // a second / may not exist before a #\n const firstHash = arg.indexOf('#')\n const firstSlash = arg.indexOf('/')\n const secondSlash = arg.indexOf('/', firstSlash + 1)\n const firstColon = arg.indexOf(':')\n const firstSpace = /\\s/.exec(arg)\n const firstAt = arg.indexOf('@')\n\n const spaceOnlyAfterHash = !firstSpace || (firstHash > -1 && firstSpace.index > firstHash)\n const atOnlyAfterHash = firstAt === -1 || (firstHash > -1 && firstAt > firstHash)\n const colonOnlyAfterHash = firstColon === -1 || (firstHash > -1 && firstColon > firstHash)\n const secondSlashOnlyAfterHash = secondSlash === -1 || (firstHash > -1 && secondSlash > firstHash)\n const hasSlash = firstSlash > 0\n // if a # is found, what we really want to know is that the character\n // immediately before # is not a /\n const doesNotEndWithSlash = firstHash > -1 ? arg[firstHash - 1] !== '/' : !arg.endsWith('/')\n const doesNotStartWithDot = !arg.startsWith('.')\n\n return spaceOnlyAfterHash && hasSlash && doesNotEndWithSlash &&\n doesNotStartWithDot && atOnlyAfterHash && colonOnlyAfterHash &&\n secondSlashOnlyAfterHash\n}\n\n// attempt to correct an scp style url so that it will parse with `new URL()`\nconst correctUrl = (giturl) => {\n // ignore @ that come after the first hash since the denotes the start\n // of a committish which can contain @ characters\n const firstAt = lastIndexOfBefore(giturl, '@', '#')\n // ignore colons that come after the hash since that could include colons such as:\n // git@github.com:user/package-2#semver:^1.0.0\n const lastColonBeforeHash = lastIndexOfBefore(giturl, ':', '#')\n\n if (lastColonBeforeHash > firstAt) {\n // the last : comes after the first @ (or there is no @)\n // like it would in:\n // proto://hostname.com:user/repo\n // username@hostname.com:user/repo\n // :password@hostname.com:user/repo\n // username:password@hostname.com:user/repo\n // proto://username@hostname.com:user/repo\n // proto://:password@hostname.com:user/repo\n // proto://username:password@hostname.com:user/repo\n // then we replace the last : with a / to create a valid path\n giturl = giturl.slice(0, lastColonBeforeHash) + '/' + giturl.slice(lastColonBeforeHash + 1)\n }\n\n if (lastIndexOfBefore(giturl, ':', '#') === -1 && giturl.indexOf('//') === -1) {\n // we have no : at all\n // as it would be in:\n // username@hostname.com/user/repo\n // then we prepend a protocol\n giturl = `git+ssh://${giturl}`\n }\n\n return giturl\n}\n\nmodule.exports = (giturl, opts, { gitHosts, protocols }) => {\n if (!giturl) {\n return\n }\n\n const correctedUrl = isGitHubShorthand(giturl)\n ? `github:${giturl}`\n : correctProtocol(giturl, protocols)\n const parsed = safeUrl(correctedUrl) || safeUrl(correctUrl(correctedUrl))\n if (!parsed) {\n return\n }\n\n const gitHostShortcut = gitHosts.byShortcut[parsed.protocol]\n const gitHostDomain = gitHosts.byDomain[parsed.hostname.startsWith('www.')\n ? parsed.hostname.slice(4)\n : parsed.hostname]\n const gitHostName = gitHostShortcut || gitHostDomain\n if (!gitHostName) {\n return\n }\n\n const gitHostInfo = gitHosts[gitHostShortcut || gitHostDomain]\n let auth = null\n if (protocols[parsed.protocol]?.auth && (parsed.username || parsed.password)) {\n auth = `${parsed.username}${parsed.password ? ':' + parsed.password : ''}`\n }\n\n let committish = null\n let user = null\n let project = null\n let defaultRepresentation = null\n\n try {\n if (gitHostShortcut) {\n let pathname = parsed.pathname.startsWith('/') ? parsed.pathname.slice(1) : parsed.pathname\n const firstAt = pathname.indexOf('@')\n // we ignore auth for shortcuts, so just trim it out\n if (firstAt > -1) {\n pathname = pathname.slice(firstAt + 1)\n }\n\n const lastSlash = pathname.lastIndexOf('/')\n if (lastSlash > -1) {\n user = decodeURIComponent(pathname.slice(0, lastSlash))\n // we want nulls only, never empty strings\n if (!user) {\n user = null\n }\n project = decodeURIComponent(pathname.slice(lastSlash + 1))\n } else {\n project = decodeURIComponent(pathname)\n }\n\n if (project.endsWith('.git')) {\n project = project.slice(0, -4)\n }\n\n if (parsed.hash) {\n committish = decodeURIComponent(parsed.hash.slice(1))\n }\n\n defaultRepresentation = 'shortcut'\n } else {\n if (!gitHostInfo.protocols.includes(parsed.protocol)) {\n return\n }\n\n const segments = gitHostInfo.extract(parsed)\n if (!segments) {\n return\n }\n\n user = segments.user && decodeURIComponent(segments.user)\n project = decodeURIComponent(segments.project)\n committish = decodeURIComponent(segments.committish)\n defaultRepresentation = protocols[parsed.protocol]?.name || parsed.protocol.slice(0, -1)\n }\n } catch (err) {\n /* istanbul ignore else */\n if (err instanceof URIError) {\n return\n } else {\n throw err\n }\n }\n\n return [gitHostName, user, auth, project, committish, defaultRepresentation, opts]\n}\n","/* eslint-disable max-len */\n\n'use strict'\n\nconst maybeJoin = (...args) => args.every(arg => arg) ? args.join('') : ''\nconst maybeEncode = (arg) => arg ? encodeURIComponent(arg) : ''\nconst formatHashFragment = (f) => f.toLowerCase().replace(/^\\W+|\\/|\\W+$/g, '').replace(/\\W+/g, '-')\n\nconst defaults = {\n sshtemplate: ({ domain, user, project, committish }) =>\n `git@${domain}:${user}/${project}.git${maybeJoin('#', committish)}`,\n sshurltemplate: ({ domain, user, project, committish }) =>\n `git+ssh://git@${domain}/${user}/${project}.git${maybeJoin('#', committish)}`,\n edittemplate: ({ domain, user, project, committish, editpath, path }) =>\n `https://${domain}/${user}/${project}${maybeJoin('/', editpath, '/', maybeEncode(committish || 'HEAD'), '/', path)}`,\n browsetemplate: ({ domain, user, project, committish, treepath }) =>\n `https://${domain}/${user}/${project}${maybeJoin('/', treepath, '/', maybeEncode(committish))}`,\n browsetreetemplate: ({ domain, user, project, committish, treepath, path, fragment, hashformat }) =>\n `https://${domain}/${user}/${project}/${treepath}/${maybeEncode(committish || 'HEAD')}/${path}${maybeJoin('#', hashformat(fragment || ''))}`,\n browseblobtemplate: ({ domain, user, project, committish, blobpath, path, fragment, hashformat }) =>\n `https://${domain}/${user}/${project}/${blobpath}/${maybeEncode(committish || 'HEAD')}/${path}${maybeJoin('#', hashformat(fragment || ''))}`,\n docstemplate: ({ domain, user, project, treepath, committish }) =>\n `https://${domain}/${user}/${project}${maybeJoin('/', treepath, '/', maybeEncode(committish))}#readme`,\n httpstemplate: ({ auth, domain, user, project, committish }) =>\n `git+https://${maybeJoin(auth, '@')}${domain}/${user}/${project}.git${maybeJoin('#', committish)}`,\n filetemplate: ({ domain, user, project, committish, path }) =>\n `https://${domain}/${user}/${project}/raw/${maybeEncode(committish || 'HEAD')}/${path}`,\n shortcuttemplate: ({ type, user, project, committish }) =>\n `${type}:${user}/${project}${maybeJoin('#', committish)}`,\n pathtemplate: ({ user, project, committish }) =>\n `${user}/${project}${maybeJoin('#', committish)}`,\n bugstemplate: ({ domain, user, project }) =>\n `https://${domain}/${user}/${project}/issues`,\n hashformat: formatHashFragment,\n}\n\nconst hosts = {}\nhosts.github = {\n // First two are insecure and generally shouldn't be used any more, but\n // they are still supported.\n protocols: ['git:', 'http:', 'git+ssh:', 'git+https:', 'ssh:', 'https:'],\n domain: 'github.com',\n treepath: 'tree',\n blobpath: 'blob',\n editpath: 'edit',\n filetemplate: ({ auth, user, project, committish, path }) =>\n `https://${maybeJoin(auth, '@')}raw.githubusercontent.com/${user}/${project}/${maybeEncode(committish || 'HEAD')}/${path}`,\n gittemplate: ({ auth, domain, user, project, committish }) =>\n `git://${maybeJoin(auth, '@')}${domain}/${user}/${project}.git${maybeJoin('#', committish)}`,\n tarballtemplate: ({ domain, user, project, committish }) =>\n `https://codeload.${domain}/${user}/${project}/tar.gz/${maybeEncode(committish || 'HEAD')}`,\n extract: (url) => {\n let [, user, project, type, committish] = url.pathname.split('/', 5)\n if (type && type !== 'tree') {\n return\n }\n\n if (!type) {\n committish = url.hash.slice(1)\n }\n\n if (project && project.endsWith('.git')) {\n project = project.slice(0, -4)\n }\n\n if (!user || !project) {\n return\n }\n\n return { user, project, committish }\n },\n}\n\nhosts.bitbucket = {\n protocols: ['git+ssh:', 'git+https:', 'ssh:', 'https:'],\n domain: 'bitbucket.org',\n treepath: 'src',\n blobpath: 'src',\n editpath: '?mode=edit',\n edittemplate: ({ domain, user, project, committish, treepath, path, editpath }) =>\n `https://${domain}/${user}/${project}${maybeJoin('/', treepath, '/', maybeEncode(committish || 'HEAD'), '/', path, editpath)}`,\n tarballtemplate: ({ domain, user, project, committish }) =>\n `https://${domain}/${user}/${project}/get/${maybeEncode(committish || 'HEAD')}.tar.gz`,\n extract: (url) => {\n let [, user, project, aux] = url.pathname.split('/', 4)\n if (['get'].includes(aux)) {\n return\n }\n\n if (project && project.endsWith('.git')) {\n project = project.slice(0, -4)\n }\n\n if (!user || !project) {\n return\n }\n\n return { user, project, committish: url.hash.slice(1) }\n },\n}\n\nhosts.gitlab = {\n protocols: ['git+ssh:', 'git+https:', 'ssh:', 'https:'],\n domain: 'gitlab.com',\n treepath: 'tree',\n blobpath: 'tree',\n editpath: '-/edit',\n httpstemplate: ({ auth, domain, user, project, committish }) =>\n `git+https://${maybeJoin(auth, '@')}${domain}/${user}/${project}.git${maybeJoin('#', committish)}`,\n tarballtemplate: ({ domain, user, project, committish }) =>\n `https://${domain}/${user}/${project}/repository/archive.tar.gz?ref=${maybeEncode(committish || 'HEAD')}`,\n extract: (url) => {\n const path = url.pathname.slice(1)\n if (path.includes('/-/') || path.includes('/archive.tar.gz')) {\n return\n }\n\n const segments = path.split('/')\n let project = segments.pop()\n if (project.endsWith('.git')) {\n project = project.slice(0, -4)\n }\n\n const user = segments.join('/')\n if (!user || !project) {\n return\n }\n\n return { user, project, committish: url.hash.slice(1) }\n },\n}\n\nhosts.gist = {\n protocols: ['git:', 'git+ssh:', 'git+https:', 'ssh:', 'https:'],\n domain: 'gist.github.com',\n editpath: 'edit',\n sshtemplate: ({ domain, project, committish }) =>\n `git@${domain}:${project}.git${maybeJoin('#', committish)}`,\n sshurltemplate: ({ domain, project, committish }) =>\n `git+ssh://git@${domain}/${project}.git${maybeJoin('#', committish)}`,\n edittemplate: ({ domain, user, project, committish, editpath }) =>\n `https://${domain}/${user}/${project}${maybeJoin('/', maybeEncode(committish))}/${editpath}`,\n browsetemplate: ({ domain, project, committish }) =>\n `https://${domain}/${project}${maybeJoin('/', maybeEncode(committish))}`,\n browsetreetemplate: ({ domain, project, committish, path, hashformat }) =>\n `https://${domain}/${project}${maybeJoin('/', maybeEncode(committish))}${maybeJoin('#', hashformat(path))}`,\n browseblobtemplate: ({ domain, project, committish, path, hashformat }) =>\n `https://${domain}/${project}${maybeJoin('/', maybeEncode(committish))}${maybeJoin('#', hashformat(path))}`,\n docstemplate: ({ domain, project, committish }) =>\n `https://${domain}/${project}${maybeJoin('/', maybeEncode(committish))}`,\n httpstemplate: ({ domain, project, committish }) =>\n `git+https://${domain}/${project}.git${maybeJoin('#', committish)}`,\n filetemplate: ({ user, project, committish, path }) =>\n `https://gist.githubusercontent.com/${user}/${project}/raw${maybeJoin('/', maybeEncode(committish))}/${path}`,\n shortcuttemplate: ({ type, project, committish }) =>\n `${type}:${project}${maybeJoin('#', committish)}`,\n pathtemplate: ({ project, committish }) =>\n `${project}${maybeJoin('#', committish)}`,\n bugstemplate: ({ domain, project }) =>\n `https://${domain}/${project}`,\n gittemplate: ({ domain, project, committish }) =>\n `git://${domain}/${project}.git${maybeJoin('#', committish)}`,\n tarballtemplate: ({ project, committish }) =>\n `https://codeload.github.com/gist/${project}/tar.gz/${maybeEncode(committish || 'HEAD')}`,\n extract: (url) => {\n let [, user, project, aux] = url.pathname.split('/', 4)\n if (aux === 'raw') {\n return\n }\n\n if (!project) {\n if (!user) {\n return\n }\n\n project = user\n user = null\n }\n\n if (project.endsWith('.git')) {\n project = project.slice(0, -4)\n }\n\n return { user, project, committish: url.hash.slice(1) }\n },\n hashformat: function (fragment) {\n return fragment && 'file-' + formatHashFragment(fragment)\n },\n}\n\nhosts.sourcehut = {\n protocols: ['git+ssh:', 'https:'],\n domain: 'git.sr.ht',\n treepath: 'tree',\n blobpath: 'tree',\n filetemplate: ({ domain, user, project, committish, path }) =>\n `https://${domain}/${user}/${project}/blob/${maybeEncode(committish) || 'HEAD'}/${path}`,\n httpstemplate: ({ domain, user, project, committish }) =>\n `https://${domain}/${user}/${project}.git${maybeJoin('#', committish)}`,\n tarballtemplate: ({ domain, user, project, committish }) =>\n `https://${domain}/${user}/${project}/archive/${maybeEncode(committish) || 'HEAD'}.tar.gz`,\n bugstemplate: ({ user, project }) =>\n `https://todo.sr.ht/${user}/${project}`,\n extract: (url) => {\n let [, user, project, aux] = url.pathname.split('/', 4)\n\n // tarball url\n if (['archive'].includes(aux)) {\n return\n }\n\n if (project && project.endsWith('.git')) {\n project = project.slice(0, -4)\n }\n\n if (!user || !project) {\n return\n }\n\n return { user, project, committish: url.hash.slice(1) }\n },\n}\n\nfor (const [name, host] of Object.entries(hosts)) {\n hosts[name] = Object.assign({}, defaults, host)\n}\n\nmodule.exports = hosts\n","'use strict'\n\nconst LRU = require('lru-cache')\nconst hosts = require('./hosts.js')\nconst fromUrl = require('./from-url.js')\n\nconst cache = new LRU({ max: 1000 })\n\nclass GitHost {\n constructor (type, user, auth, project, committish, defaultRepresentation, opts = {}) {\n Object.assign(this, GitHost.#gitHosts[type], {\n type,\n user,\n auth,\n project,\n committish,\n default: defaultRepresentation,\n opts,\n })\n }\n\n static #gitHosts = { byShortcut: {}, byDomain: {} }\n static #protocols = {\n 'git+ssh:': { name: 'sshurl' },\n 'ssh:': { name: 'sshurl' },\n 'git+https:': { name: 'https', auth: true },\n 'git:': { auth: true },\n 'http:': { auth: true },\n 'https:': { auth: true },\n 'git+http:': { auth: true },\n }\n\n static addHost (name, host) {\n GitHost.#gitHosts[name] = host\n GitHost.#gitHosts.byDomain[host.domain] = name\n GitHost.#gitHosts.byShortcut[`${name}:`] = name\n GitHost.#protocols[`${name}:`] = { name }\n }\n\n static fromUrl (giturl, opts) {\n if (typeof giturl !== 'string') {\n return\n }\n\n const key = giturl + JSON.stringify(opts || {})\n\n if (!cache.has(key)) {\n const hostArgs = fromUrl(giturl, opts, {\n gitHosts: GitHost.#gitHosts,\n protocols: GitHost.#protocols,\n })\n cache.set(key, hostArgs ? new GitHost(...hostArgs) : undefined)\n }\n\n return cache.get(key)\n }\n\n #fill (template, opts) {\n if (typeof template !== 'function') {\n return null\n }\n\n const options = { ...this, ...this.opts, ...opts }\n\n // the path should always be set so we don't end up with 'undefined' in urls\n if (!options.path) {\n options.path = ''\n }\n\n // template functions will insert the leading slash themselves\n if (options.path.startsWith('/')) {\n options.path = options.path.slice(1)\n }\n\n if (options.noCommittish) {\n options.committish = null\n }\n\n const result = template(options)\n return options.noGitPlus && result.startsWith('git+') ? result.slice(4) : result\n }\n\n hash () {\n return this.committish ? `#${this.committish}` : ''\n }\n\n ssh (opts) {\n return this.#fill(this.sshtemplate, opts)\n }\n\n sshurl (opts) {\n return this.#fill(this.sshurltemplate, opts)\n }\n\n browse (path, ...args) {\n // not a string, treat path as opts\n if (typeof path !== 'string') {\n return this.#fill(this.browsetemplate, path)\n }\n\n if (typeof args[0] !== 'string') {\n return this.#fill(this.browsetreetemplate, { ...args[0], path })\n }\n\n return this.#fill(this.browsetreetemplate, { ...args[1], fragment: args[0], path })\n }\n\n // If the path is known to be a file, then browseFile should be used. For some hosts\n // the url is the same as browse, but for others like GitHub a file can use both `/tree/`\n // and `/blob/` in the path. When using a default committish of `HEAD` then the `/tree/`\n // path will redirect to a specific commit. Using the `/blob/` path avoids this and\n // does not redirect to a different commit.\n browseFile (path, ...args) {\n if (typeof args[0] !== 'string') {\n return this.#fill(this.browseblobtemplate, { ...args[0], path })\n }\n\n return this.#fill(this.browseblobtemplate, { ...args[1], fragment: args[0], path })\n }\n\n docs (opts) {\n return this.#fill(this.docstemplate, opts)\n }\n\n bugs (opts) {\n return this.#fill(this.bugstemplate, opts)\n }\n\n https (opts) {\n return this.#fill(this.httpstemplate, opts)\n }\n\n git (opts) {\n return this.#fill(this.gittemplate, opts)\n }\n\n shortcut (opts) {\n return this.#fill(this.shortcuttemplate, opts)\n }\n\n path (opts) {\n return this.#fill(this.pathtemplate, opts)\n }\n\n tarball (opts) {\n return this.#fill(this.tarballtemplate, { ...opts, noCommittish: false })\n }\n\n file (path, opts) {\n return this.#fill(this.filetemplate, { ...opts, path })\n }\n\n edit (path, opts) {\n return this.#fill(this.edittemplate, { ...opts, path })\n }\n\n getDefaultRepresentation () {\n return this.default\n }\n\n toString (opts) {\n if (this.default && typeof this[this.default] === 'function') {\n return this[this.default](opts)\n }\n\n return this.sshurl(opts)\n }\n}\n\nfor (const [name, host] of Object.entries(hosts)) {\n GitHost.addHost(name, host)\n}\n\nmodule.exports = GitHost\n","'use strict';\n\nvar has = require('has');\n\nfunction specifierIncluded(current, specifier) {\n\tvar nodeParts = current.split('.');\n\tvar parts = specifier.split(' ');\n\tvar op = parts.length > 1 ? parts[0] : '=';\n\tvar versionParts = (parts.length > 1 ? parts[1] : parts[0]).split('.');\n\n\tfor (var i = 0; i < 3; ++i) {\n\t\tvar cur = parseInt(nodeParts[i] || 0, 10);\n\t\tvar ver = parseInt(versionParts[i] || 0, 10);\n\t\tif (cur === ver) {\n\t\t\tcontinue; // eslint-disable-line no-restricted-syntax, no-continue\n\t\t}\n\t\tif (op === '<') {\n\t\t\treturn cur < ver;\n\t\t}\n\t\tif (op === '>=') {\n\t\t\treturn cur >= ver;\n\t\t}\n\t\treturn false;\n\t}\n\treturn op === '>=';\n}\n\nfunction matchesRange(current, range) {\n\tvar specifiers = range.split(/ ?&& ?/);\n\tif (specifiers.length === 0) {\n\t\treturn false;\n\t}\n\tfor (var i = 0; i < specifiers.length; ++i) {\n\t\tif (!specifierIncluded(current, specifiers[i])) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nfunction versionIncluded(nodeVersion, specifierValue) {\n\tif (typeof specifierValue === 'boolean') {\n\t\treturn specifierValue;\n\t}\n\n\tvar current = typeof nodeVersion === 'undefined'\n\t\t? process.versions && process.versions.node\n\t\t: nodeVersion;\n\n\tif (typeof current !== 'string') {\n\t\tthrow new TypeError(typeof nodeVersion === 'undefined' ? 'Unable to determine current node version' : 'If provided, a valid node version is required');\n\t}\n\n\tif (specifierValue && typeof specifierValue === 'object') {\n\t\tfor (var i = 0; i < specifierValue.length; ++i) {\n\t\t\tif (matchesRange(current, specifierValue[i])) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\treturn matchesRange(current, specifierValue);\n}\n\nvar data = require('./core.json');\n\nmodule.exports = function isCore(x, nodeVersion) {\n\treturn has(data, x) && versionIncluded(nodeVersion, data[x]);\n};\n","'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest. the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node. This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n constructor (options) {\n if (typeof options === 'number')\n options = { max: options }\n\n if (!options)\n options = {}\n\n if (options.max && (typeof options.max !== 'number' || options.max < 0))\n throw new TypeError('max must be a non-negative number')\n // Kind of weird to have a default max of Infinity, but oh well.\n const max = this[MAX] = options.max || Infinity\n\n const lc = options.length || naiveLength\n this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n this[ALLOW_STALE] = options.stale || false\n if (options.maxAge && typeof options.maxAge !== 'number')\n throw new TypeError('maxAge must be a number')\n this[MAX_AGE] = options.maxAge || 0\n this[DISPOSE] = options.dispose\n this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n this.reset()\n }\n\n // resize the cache when the max changes.\n set max (mL) {\n if (typeof mL !== 'number' || mL < 0)\n throw new TypeError('max must be a non-negative number')\n\n this[MAX] = mL || Infinity\n trim(this)\n }\n get max () {\n return this[MAX]\n }\n\n set allowStale (allowStale) {\n this[ALLOW_STALE] = !!allowStale\n }\n get allowStale () {\n return this[ALLOW_STALE]\n }\n\n set maxAge (mA) {\n if (typeof mA !== 'number')\n throw new TypeError('maxAge must be a non-negative number')\n\n this[MAX_AGE] = mA\n trim(this)\n }\n get maxAge () {\n return this[MAX_AGE]\n }\n\n // resize the cache when the lengthCalculator changes.\n set lengthCalculator (lC) {\n if (typeof lC !== 'function')\n lC = naiveLength\n\n if (lC !== this[LENGTH_CALCULATOR]) {\n this[LENGTH_CALCULATOR] = lC\n this[LENGTH] = 0\n this[LRU_LIST].forEach(hit => {\n hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n this[LENGTH] += hit.length\n })\n }\n trim(this)\n }\n get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n get length () { return this[LENGTH] }\n get itemCount () { return this[LRU_LIST].length }\n\n rforEach (fn, thisp) {\n thisp = thisp || this\n for (let walker = this[LRU_LIST].tail; walker !== null;) {\n const prev = walker.prev\n forEachStep(this, fn, walker, thisp)\n walker = prev\n }\n }\n\n forEach (fn, thisp) {\n thisp = thisp || this\n for (let walker = this[LRU_LIST].head; walker !== null;) {\n const next = walker.next\n forEachStep(this, fn, walker, thisp)\n walker = next\n }\n }\n\n keys () {\n return this[LRU_LIST].toArray().map(k => k.key)\n }\n\n values () {\n return this[LRU_LIST].toArray().map(k => k.value)\n }\n\n reset () {\n if (this[DISPOSE] &&\n this[LRU_LIST] &&\n this[LRU_LIST].length) {\n this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n }\n\n this[CACHE] = new Map() // hash of items by key\n this[LRU_LIST] = new Yallist() // list of items in order of use recency\n this[LENGTH] = 0 // length of items in the list\n }\n\n dump () {\n return this[LRU_LIST].map(hit =>\n isStale(this, hit) ? false : {\n k: hit.key,\n v: hit.value,\n e: hit.now + (hit.maxAge || 0)\n }).toArray().filter(h => h)\n }\n\n dumpLru () {\n return this[LRU_LIST]\n }\n\n set (key, value, maxAge) {\n maxAge = maxAge || this[MAX_AGE]\n\n if (maxAge && typeof maxAge !== 'number')\n throw new TypeError('maxAge must be a number')\n\n const now = maxAge ? Date.now() : 0\n const len = this[LENGTH_CALCULATOR](value, key)\n\n if (this[CACHE].has(key)) {\n if (len > this[MAX]) {\n del(this, this[CACHE].get(key))\n return false\n }\n\n const node = this[CACHE].get(key)\n const item = node.value\n\n // dispose of the old one before overwriting\n // split out into 2 ifs for better coverage tracking\n if (this[DISPOSE]) {\n if (!this[NO_DISPOSE_ON_SET])\n this[DISPOSE](key, item.value)\n }\n\n item.now = now\n item.maxAge = maxAge\n item.value = value\n this[LENGTH] += len - item.length\n item.length = len\n this.get(key)\n trim(this)\n return true\n }\n\n const hit = new Entry(key, value, len, now, maxAge)\n\n // oversized objects fall out of cache automatically.\n if (hit.length > this[MAX]) {\n if (this[DISPOSE])\n this[DISPOSE](key, value)\n\n return false\n }\n\n this[LENGTH] += hit.length\n this[LRU_LIST].unshift(hit)\n this[CACHE].set(key, this[LRU_LIST].head)\n trim(this)\n return true\n }\n\n has (key) {\n if (!this[CACHE].has(key)) return false\n const hit = this[CACHE].get(key).value\n return !isStale(this, hit)\n }\n\n get (key) {\n return get(this, key, true)\n }\n\n peek (key) {\n return get(this, key, false)\n }\n\n pop () {\n const node = this[LRU_LIST].tail\n if (!node)\n return null\n\n del(this, node)\n return node.value\n }\n\n del (key) {\n del(this, this[CACHE].get(key))\n }\n\n load (arr) {\n // reset the cache\n this.reset()\n\n const now = Date.now()\n // A previous serialized cache has the most recent items first\n for (let l = arr.length - 1; l >= 0; l--) {\n const hit = arr[l]\n const expiresAt = hit.e || 0\n if (expiresAt === 0)\n // the item was created without expiration in a non aged cache\n this.set(hit.k, hit.v)\n else {\n const maxAge = expiresAt - now\n // dont add already expired items\n if (maxAge > 0) {\n this.set(hit.k, hit.v, maxAge)\n }\n }\n }\n }\n\n prune () {\n this[CACHE].forEach((value, key) => get(this, key, false))\n }\n}\n\nconst get = (self, key, doUse) => {\n const node = self[CACHE].get(key)\n if (node) {\n const hit = node.value\n if (isStale(self, hit)) {\n del(self, node)\n if (!self[ALLOW_STALE])\n return undefined\n } else {\n if (doUse) {\n if (self[UPDATE_AGE_ON_GET])\n node.value.now = Date.now()\n self[LRU_LIST].unshiftNode(node)\n }\n }\n return hit.value\n }\n}\n\nconst isStale = (self, hit) => {\n if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n return false\n\n const diff = Date.now() - hit.now\n return hit.maxAge ? diff > hit.maxAge\n : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n if (self[LENGTH] > self[MAX]) {\n for (let walker = self[LRU_LIST].tail;\n self[LENGTH] > self[MAX] && walker !== null;) {\n // We know that we're about to delete this one, and also\n // what the next least recently used key will be, so just\n // go ahead and set it now.\n const prev = walker.prev\n del(self, walker)\n walker = prev\n }\n }\n}\n\nconst del = (self, node) => {\n if (node) {\n const hit = node.value\n if (self[DISPOSE])\n self[DISPOSE](hit.key, hit.value)\n\n self[LENGTH] -= hit.length\n self[CACHE].delete(hit.key)\n self[LRU_LIST].removeNode(node)\n }\n}\n\nclass Entry {\n constructor (key, value, length, now, maxAge) {\n this.key = key\n this.value = value\n this.length = length\n this.now = now\n this.maxAge = maxAge || 0\n }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n let hit = node.value\n if (isStale(self, hit)) {\n del(self, node)\n if (!self[ALLOW_STALE])\n hit = undefined\n }\n if (hit)\n fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n","const perf = typeof performance === 'object' && performance &&\n typeof performance.now === 'function' ? performance : Date\n\nconst warned = new Set()\nconst deprecatedOption = (opt, instead) => {\n const code = `LRU_CACHE_OPTION_${opt}`\n if (shouldWarn(code)) {\n warn(code, `${opt} option`, `options.${instead}`, LRUCache)\n }\n}\nconst deprecatedMethod = (method, instead) => {\n const code = `LRU_CACHE_METHOD_${method}`\n if (shouldWarn(code)) {\n const { prototype } = LRUCache\n const { get } = Object.getOwnPropertyDescriptor(prototype, method)\n warn(code, `${method} method`, `cache.${instead}()`, get)\n }\n}\nconst deprecatedProperty = (field, instead) => {\n const code = `LRU_CACHE_PROPERTY_${field}`\n if (shouldWarn(code)) {\n const { prototype } = LRUCache\n const { get } = Object.getOwnPropertyDescriptor(prototype, field)\n warn(code, `${field} property`, `cache.${instead}`, get)\n }\n}\nconst shouldWarn = (code) => typeof process === 'object' &&\n process &&\n !(process.noDeprecation || warned.has(code))\nconst warn = (code, what, instead, fn) => {\n warned.add(code)\n process.emitWarning(`The ${what} is deprecated. Please use ${instead} instead.`, 'DeprecationWarning', code, fn)\n}\n\nconst isPosInt = n => n && n === Math.floor(n) && n > 0 && isFinite(n)\n\n/* istanbul ignore next - This is a little bit ridiculous, tbh.\n * The maximum array length is 2^32-1 or thereabouts on most JS impls.\n * And well before that point, you're caching the entire world, I mean,\n * that's ~32GB of just integers for the next/prev links, plus whatever\n * else to hold that many keys and values. Just filling the memory with\n * zeroes at init time is brutal when you get that big.\n * But why not be complete?\n * Maybe in the future, these limits will have expanded. */\nconst getUintArray = max => !isPosInt(max) ? null\n: max <= Math.pow(2, 8) ? Uint8Array\n: max <= Math.pow(2, 16) ? Uint16Array\n: max <= Math.pow(2, 32) ? Uint32Array\n: max <= Number.MAX_SAFE_INTEGER ? ZeroArray\n: null\n\nclass ZeroArray extends Array {\n constructor (size) {\n super(size)\n this.fill(0)\n }\n}\n\nclass Stack {\n constructor (max) {\n const UintArray = getUintArray(max)\n this.heap = new UintArray(max)\n this.length = 0\n }\n push (n) {\n this.heap[this.length++] = n\n }\n pop () {\n return this.heap[--this.length]\n }\n}\n\nclass LRUCache {\n constructor (options = {}) {\n const {\n max,\n ttl,\n ttlResolution = 1,\n ttlAutopurge,\n updateAgeOnGet,\n allowStale,\n dispose,\n disposeAfter,\n noDisposeOnSet,\n noUpdateTTL,\n maxSize,\n sizeCalculation,\n } = options\n\n // deprecated options, don't trigger a warning for getting them if\n // the thing being passed in is another LRUCache we're copying.\n const {\n length,\n maxAge,\n stale,\n } = options instanceof LRUCache ? {} : options\n\n if (!isPosInt(max)) {\n throw new TypeError('max option must be an integer')\n }\n\n const UintArray = getUintArray(max)\n if (!UintArray) {\n throw new Error('invalid max value: ' + max)\n }\n\n this.max = max\n this.maxSize = maxSize || 0\n this.sizeCalculation = sizeCalculation || length\n if (this.sizeCalculation) {\n if (!this.maxSize) {\n throw new TypeError('cannot set sizeCalculation without setting maxSize')\n }\n if (typeof this.sizeCalculation !== 'function') {\n throw new TypeError('sizeCalculating set to non-function')\n }\n }\n this.keyMap = new Map()\n this.keyList = new Array(max).fill(null)\n this.valList = new Array(max).fill(null)\n this.next = new UintArray(max)\n this.prev = new UintArray(max)\n this.head = 0\n this.tail = 0\n this.free = new Stack(max)\n this.initialFill = 1\n this.size = 0\n\n if (typeof dispose === 'function') {\n this.dispose = dispose\n }\n if (typeof disposeAfter === 'function') {\n this.disposeAfter = disposeAfter\n this.disposed = []\n } else {\n this.disposeAfter = null\n this.disposed = null\n }\n this.noDisposeOnSet = !!noDisposeOnSet\n this.noUpdateTTL = !!noUpdateTTL\n\n if (this.maxSize) {\n if (!isPosInt(this.maxSize)) {\n throw new TypeError('maxSize must be a positive integer if specified')\n }\n this.initializeSizeTracking()\n }\n\n this.allowStale = !!allowStale || !!stale\n this.updateAgeOnGet = !!updateAgeOnGet\n this.ttlResolution = isPosInt(ttlResolution) || ttlResolution === 0\n ? ttlResolution : 1\n this.ttlAutopurge = !!ttlAutopurge\n this.ttl = ttl || maxAge || 0\n if (this.ttl) {\n if (!isPosInt(this.ttl)) {\n throw new TypeError('ttl must be a positive integer if specified')\n }\n this.initializeTTLTracking()\n }\n\n if (stale) {\n deprecatedOption('stale', 'allowStale')\n }\n if (maxAge) {\n deprecatedOption('maxAge', 'ttl')\n }\n if (length) {\n deprecatedOption('length', 'sizeCalculation')\n }\n }\n\n initializeTTLTracking () {\n this.ttls = new ZeroArray(this.max)\n this.starts = new ZeroArray(this.max)\n this.setItemTTL = (index, ttl) => {\n this.starts[index] = ttl !== 0 ? perf.now() : 0\n this.ttls[index] = ttl\n if (ttl !== 0 && this.ttlAutopurge) {\n const t = setTimeout(() => {\n if (this.isStale(index)) {\n this.delete(this.keyList[index])\n }\n }, ttl + 1)\n /* istanbul ignore else - unref() not supported on all platforms */\n if (t.unref) {\n t.unref()\n }\n }\n }\n this.updateItemAge = (index) => {\n this.starts[index] = this.ttls[index] !== 0 ? perf.now() : 0\n }\n // debounce calls to perf.now() to 1s so we're not hitting\n // that costly call repeatedly.\n let cachedNow = 0\n const getNow = () => {\n const n = perf.now()\n if (this.ttlResolution > 0) {\n cachedNow = n\n const t = setTimeout(() => cachedNow = 0, this.ttlResolution)\n /* istanbul ignore else - not available on all platforms */\n if (t.unref) {\n t.unref()\n }\n }\n return n\n }\n this.isStale = (index) => {\n return this.ttls[index] !== 0 && this.starts[index] !== 0 &&\n ((cachedNow || getNow()) - this.starts[index] > this.ttls[index])\n }\n }\n updateItemAge (index) {}\n setItemTTL (index, ttl) {}\n isStale (index) { return false }\n\n initializeSizeTracking () {\n this.calculatedSize = 0\n this.sizes = new ZeroArray(this.max)\n this.removeItemSize = index => this.calculatedSize -= this.sizes[index]\n this.addItemSize = (index, v, k, size, sizeCalculation) => {\n const s = size || (sizeCalculation ? sizeCalculation(v, k) : 0)\n this.sizes[index] = isPosInt(s) ? s : 0\n const maxSize = this.maxSize - this.sizes[index]\n while (this.calculatedSize > maxSize) {\n this.evict()\n }\n this.calculatedSize += this.sizes[index]\n }\n this.delete = k => {\n if (this.size !== 0) {\n const index = this.keyMap.get(k)\n if (index !== undefined) {\n this.calculatedSize -= this.sizes[index]\n }\n }\n return LRUCache.prototype.delete.call(this, k)\n }\n }\n removeItemSize (index) {}\n addItemSize (index, v, k, size, sizeCalculation) {}\n\n *indexes ({ allowStale = this.allowStale } = {}) {\n if (this.size) {\n for (let i = this.tail, j; true; ) {\n if (!this.isValidIndex(i)) {\n break\n }\n j = i === this.head\n if (allowStale || !this.isStale(i)) {\n yield i\n }\n if (i === this.head) {\n break\n } else {\n i = this.prev[i]\n }\n }\n }\n }\n\n *rindexes ({ allowStale = this.allowStale } = {}) {\n if (this.size) {\n for (let i = this.head, j; true; ) {\n if (!this.isValidIndex(i)) {\n break\n }\n if (allowStale || !this.isStale(i)) {\n yield i\n }\n // either the tail now, or WAS the tail, and deleted\n if (i === this.tail) {\n break\n } else {\n i = this.next[i]\n }\n }\n }\n }\n\n isValidIndex (index) {\n return this.keyMap.get(this.keyList[index]) === index\n }\n\n *entries () {\n for (const i of this.indexes()) {\n yield [this.keyList[i], this.valList[i]]\n }\n }\n *rentries () {\n for (const i of this.rindexes()) {\n yield [this.keyList[i], this.valList[i]]\n }\n }\n\n *keys () {\n for (const i of this.indexes()) {\n yield this.keyList[i]\n }\n }\n *rkeys () {\n for (const i of this.rindexes()) {\n yield this.keyList[i]\n }\n }\n\n *values () {\n for (const i of this.indexes()) {\n yield this.valList[i]\n }\n }\n *rvalues () {\n for (const i of this.rindexes()) {\n yield this.valList[i]\n }\n }\n\n [Symbol.iterator] () {\n return this.entries()\n }\n\n find (fn, getOptions = {}) {\n for (const i of this.indexes()) {\n if (fn(this.valList[i], this.keyList[i], this)) {\n return this.get(this.keyList[i], getOptions)\n }\n }\n }\n\n forEach (fn, thisp = this) {\n for (const i of this.indexes()) {\n fn.call(thisp, this.valList[i], this.keyList[i], this)\n }\n }\n\n rforEach (fn, thisp = this) {\n for (const i of this.rindexes()) {\n fn.call(thisp, this.valList[i], this.keyList[i], this)\n }\n }\n\n get prune () {\n deprecatedMethod('prune', 'purgeStale')\n return this.purgeStale\n }\n\n purgeStale () {\n let deleted = false\n for (const i of this.rindexes({ allowStale: true })) {\n if (this.isStale(i)) {\n this.delete(this.keyList[i])\n deleted = true\n }\n }\n return deleted\n }\n\n dump () {\n const arr = []\n for (const i of this.indexes()) {\n const key = this.keyList[i]\n const value = this.valList[i]\n const entry = { value }\n if (this.ttls) {\n entry.ttl = this.ttls[i]\n }\n if (this.sizes) {\n entry.size = this.sizes[i]\n }\n arr.unshift([key, entry])\n }\n return arr\n }\n\n load (arr) {\n this.clear()\n for (const [key, entry] of arr) {\n this.set(key, entry.value, entry)\n }\n }\n\n dispose (v, k, reason) {}\n\n set (k, v, {\n ttl = this.ttl,\n noDisposeOnSet = this.noDisposeOnSet,\n size = 0,\n sizeCalculation = this.sizeCalculation,\n noUpdateTTL = this.noUpdateTTL,\n } = {}) {\n let index = this.size === 0 ? undefined : this.keyMap.get(k)\n if (index === undefined) {\n // addition\n index = this.newIndex()\n this.keyList[index] = k\n this.valList[index] = v\n this.keyMap.set(k, index)\n this.next[this.tail] = index\n this.prev[index] = this.tail\n this.tail = index\n this.size ++\n this.addItemSize(index, v, k, size, sizeCalculation)\n noUpdateTTL = false\n } else {\n // update\n const oldVal = this.valList[index]\n if (v !== oldVal) {\n if (!noDisposeOnSet) {\n this.dispose(oldVal, k, 'set')\n if (this.disposeAfter) {\n this.disposed.push([oldVal, k, 'set'])\n }\n }\n this.removeItemSize(index)\n this.valList[index] = v\n this.addItemSize(index, v, k, size, sizeCalculation)\n }\n this.moveToTail(index)\n }\n if (ttl !== 0 && this.ttl === 0 && !this.ttls) {\n this.initializeTTLTracking()\n }\n if (!noUpdateTTL) {\n this.setItemTTL(index, ttl)\n }\n if (this.disposeAfter) {\n while (this.disposed.length) {\n this.disposeAfter(...this.disposed.shift())\n }\n }\n return this\n }\n\n newIndex () {\n if (this.size === 0) {\n return this.tail\n }\n if (this.size === this.max) {\n return this.evict()\n }\n if (this.free.length !== 0) {\n return this.free.pop()\n }\n // initial fill, just keep writing down the list\n return this.initialFill++\n }\n\n pop () {\n if (this.size) {\n const val = this.valList[this.head]\n this.evict()\n return val\n }\n }\n\n evict () {\n const head = this.head\n const k = this.keyList[head]\n const v = this.valList[head]\n this.dispose(v, k, 'evict')\n if (this.disposeAfter) {\n this.disposed.push([v, k, 'evict'])\n }\n this.removeItemSize(head)\n this.head = this.next[head]\n this.keyMap.delete(k)\n this.size --\n return head\n }\n\n has (k) {\n return this.keyMap.has(k) && !this.isStale(this.keyMap.get(k))\n }\n\n // like get(), but without any LRU updating or TTL expiration\n peek (k, { allowStale = this.allowStale } = {}) {\n const index = this.keyMap.get(k)\n if (index !== undefined && (allowStale || !this.isStale(index))) {\n return this.valList[index]\n }\n }\n\n get (k, {\n allowStale = this.allowStale,\n updateAgeOnGet = this.updateAgeOnGet,\n } = {}) {\n const index = this.keyMap.get(k)\n if (index !== undefined) {\n if (this.isStale(index)) {\n const value = allowStale ? this.valList[index] : undefined\n this.delete(k)\n return value\n } else {\n this.moveToTail(index)\n if (updateAgeOnGet) {\n this.updateItemAge(index)\n }\n return this.valList[index]\n }\n }\n }\n\n connect (p, n) {\n this.prev[n] = p\n this.next[p] = n\n }\n\n moveToTail (index) {\n // if tail already, nothing to do\n // if head, move head to next[index]\n // else\n // move next[prev[index]] to next[index] (head has no prev)\n // move prev[next[index]] to prev[index]\n // prev[index] = tail\n // next[tail] = index\n // tail = index\n if (index !== this.tail) {\n if (index === this.head) {\n this.head = this.next[index]\n } else {\n this.connect(this.prev[index], this.next[index])\n }\n this.connect(this.tail, index)\n this.tail = index\n }\n }\n\n get del () {\n deprecatedMethod('del', 'delete')\n return this.delete\n }\n delete (k) {\n let deleted = false\n if (this.size !== 0) {\n const index = this.keyMap.get(k)\n if (index !== undefined) {\n deleted = true\n if (this.size === 1) {\n this.clear()\n } else {\n this.removeItemSize(index)\n this.dispose(this.valList[index], k, 'delete')\n if (this.disposeAfter) {\n this.disposed.push([this.valList[index], k, 'delete'])\n }\n this.keyMap.delete(k)\n this.keyList[index] = null\n this.valList[index] = null\n if (index === this.tail) {\n this.tail = this.prev[index]\n } else if (index === this.head) {\n this.head = this.next[index]\n } else {\n this.next[this.prev[index]] = this.next[index]\n this.prev[this.next[index]] = this.prev[index]\n }\n this.size --\n this.free.push(index)\n }\n }\n }\n if (this.disposed) {\n while (this.disposed.length) {\n this.disposeAfter(...this.disposed.shift())\n }\n }\n return deleted\n }\n\n clear () {\n if (this.dispose !== LRUCache.prototype.dispose) {\n for (const index of this.rindexes({ allowStale: true })) {\n this.dispose(this.valList[index], this.keyList[index], 'delete')\n }\n }\n if (this.disposeAfter) {\n for (const index of this.rindexes({ allowStale: true })) {\n this.disposed.push([this.valList[index], this.keyList[index], 'delete'])\n }\n }\n this.keyMap.clear()\n this.valList.fill(null)\n this.keyList.fill(null)\n if (this.ttls) {\n this.ttls.fill(0)\n this.starts.fill(0)\n }\n if (this.sizes) {\n this.sizes.fill(0)\n }\n this.head = 0\n this.tail = 0\n this.initialFill = 1\n this.free.length = 0\n this.calculatedSize = 0\n this.size = 0\n if (this.disposed) {\n while (this.disposed.length) {\n this.disposeAfter(...this.disposed.shift())\n }\n }\n }\n get reset () {\n deprecatedMethod('reset', 'clear')\n return this.clear\n }\n\n get length () {\n deprecatedProperty('length', 'size')\n return this.size\n }\n}\n\nmodule.exports = LRUCache\n","(function(root, factory) {\n if (typeof define === 'function' && define.amd) {\n define([], factory) /* global define */\n } else if (typeof module === 'object' && module.exports) {\n module.exports = factory()\n } else {\n root.moo = factory()\n }\n}(this, function() {\n 'use strict';\n\n var hasOwnProperty = Object.prototype.hasOwnProperty\n var toString = Object.prototype.toString\n var hasSticky = typeof new RegExp().sticky === 'boolean'\n\n /***************************************************************************/\n\n function isRegExp(o) { return o && toString.call(o) === '[object RegExp]' }\n function isObject(o) { return o && typeof o === 'object' && !isRegExp(o) && !Array.isArray(o) }\n\n function reEscape(s) {\n return s.replace(/[-\\/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&')\n }\n function reGroups(s) {\n var re = new RegExp('|' + s)\n return re.exec('').length - 1\n }\n function reCapture(s) {\n return '(' + s + ')'\n }\n function reUnion(regexps) {\n if (!regexps.length) return '(?!)'\n var source = regexps.map(function(s) {\n return \"(?:\" + s + \")\"\n }).join('|')\n return \"(?:\" + source + \")\"\n }\n\n function regexpOrLiteral(obj) {\n if (typeof obj === 'string') {\n return '(?:' + reEscape(obj) + ')'\n\n } else if (isRegExp(obj)) {\n // TODO: consider /u support\n if (obj.ignoreCase) throw new Error('RegExp /i flag not allowed')\n if (obj.global) throw new Error('RegExp /g flag is implied')\n if (obj.sticky) throw new Error('RegExp /y flag is implied')\n if (obj.multiline) throw new Error('RegExp /m flag is implied')\n return obj.source\n\n } else {\n throw new Error('Not a pattern: ' + obj)\n }\n }\n\n function pad(s, length) {\n if (s.length > length) {\n return s\n }\n return Array(length - s.length + 1).join(\" \") + s\n }\n\n function lastNLines(string, numLines) {\n var position = string.length\n var lineBreaks = 0;\n while (true) {\n var idx = string.lastIndexOf(\"\\n\", position - 1)\n if (idx === -1) {\n break;\n } else {\n lineBreaks++\n }\n position = idx\n if (lineBreaks === numLines) {\n break;\n }\n if (position === 0) {\n break;\n }\n }\n var startPosition = \n lineBreaks < numLines ?\n 0 : \n position + 1\n return string.substring(startPosition).split(\"\\n\")\n }\n\n function objectToRules(object) {\n var keys = Object.getOwnPropertyNames(object)\n var result = []\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i]\n var thing = object[key]\n var rules = [].concat(thing)\n if (key === 'include') {\n for (var j = 0; j < rules.length; j++) {\n result.push({include: rules[j]})\n }\n continue\n }\n var match = []\n rules.forEach(function(rule) {\n if (isObject(rule)) {\n if (match.length) result.push(ruleOptions(key, match))\n result.push(ruleOptions(key, rule))\n match = []\n } else {\n match.push(rule)\n }\n })\n if (match.length) result.push(ruleOptions(key, match))\n }\n return result\n }\n\n function arrayToRules(array) {\n var result = []\n for (var i = 0; i < array.length; i++) {\n var obj = array[i]\n if (obj.include) {\n var include = [].concat(obj.include)\n for (var j = 0; j < include.length; j++) {\n result.push({include: include[j]})\n }\n continue\n }\n if (!obj.type) {\n throw new Error('Rule has no type: ' + JSON.stringify(obj))\n }\n result.push(ruleOptions(obj.type, obj))\n }\n return result\n }\n\n function ruleOptions(type, obj) {\n if (!isObject(obj)) {\n obj = { match: obj }\n }\n if (obj.include) {\n throw new Error('Matching rules cannot also include states')\n }\n\n // nb. error and fallback imply lineBreaks\n var options = {\n defaultType: type,\n lineBreaks: !!obj.error || !!obj.fallback,\n pop: false,\n next: null,\n push: null,\n error: false,\n fallback: false,\n value: null,\n type: null,\n shouldThrow: false,\n }\n\n // Avoid Object.assign(), so we support IE9+\n for (var key in obj) {\n if (hasOwnProperty.call(obj, key)) {\n options[key] = obj[key]\n }\n }\n\n // type transform cannot be a string\n if (typeof options.type === 'string' && type !== options.type) {\n throw new Error(\"Type transform cannot be a string (type '\" + options.type + \"' for token '\" + type + \"')\")\n }\n\n // convert to array\n var match = options.match\n options.match = Array.isArray(match) ? match : match ? [match] : []\n options.match.sort(function(a, b) {\n return isRegExp(a) && isRegExp(b) ? 0\n : isRegExp(b) ? -1 : isRegExp(a) ? +1 : b.length - a.length\n })\n return options\n }\n\n function toRules(spec) {\n return Array.isArray(spec) ? arrayToRules(spec) : objectToRules(spec)\n }\n\n var defaultErrorRule = ruleOptions('error', {lineBreaks: true, shouldThrow: true})\n function compileRules(rules, hasStates) {\n var errorRule = null\n var fast = Object.create(null)\n var fastAllowed = true\n var unicodeFlag = null\n var groups = []\n var parts = []\n\n // If there is a fallback rule, then disable fast matching\n for (var i = 0; i < rules.length; i++) {\n if (rules[i].fallback) {\n fastAllowed = false\n }\n }\n\n for (var i = 0; i < rules.length; i++) {\n var options = rules[i]\n\n if (options.include) {\n // all valid inclusions are removed by states() preprocessor\n throw new Error('Inheritance is not allowed in stateless lexers')\n }\n\n if (options.error || options.fallback) {\n // errorRule can only be set once\n if (errorRule) {\n if (!options.fallback === !errorRule.fallback) {\n throw new Error(\"Multiple \" + (options.fallback ? \"fallback\" : \"error\") + \" rules not allowed (for token '\" + options.defaultType + \"')\")\n } else {\n throw new Error(\"fallback and error are mutually exclusive (for token '\" + options.defaultType + \"')\")\n }\n }\n errorRule = options\n }\n\n var match = options.match.slice()\n if (fastAllowed) {\n while (match.length && typeof match[0] === 'string' && match[0].length === 1) {\n var word = match.shift()\n fast[word.charCodeAt(0)] = options\n }\n }\n\n // Warn about inappropriate state-switching options\n if (options.pop || options.push || options.next) {\n if (!hasStates) {\n throw new Error(\"State-switching options are not allowed in stateless lexers (for token '\" + options.defaultType + \"')\")\n }\n if (options.fallback) {\n throw new Error(\"State-switching options are not allowed on fallback tokens (for token '\" + options.defaultType + \"')\")\n }\n }\n\n // Only rules with a .match are included in the RegExp\n if (match.length === 0) {\n continue\n }\n fastAllowed = false\n\n groups.push(options)\n\n // Check unicode flag is used everywhere or nowhere\n for (var j = 0; j < match.length; j++) {\n var obj = match[j]\n if (!isRegExp(obj)) {\n continue\n }\n\n if (unicodeFlag === null) {\n unicodeFlag = obj.unicode\n } else if (unicodeFlag !== obj.unicode && options.fallback === false) {\n throw new Error('If one rule is /u then all must be')\n }\n }\n\n // convert to RegExp\n var pat = reUnion(match.map(regexpOrLiteral))\n\n // validate\n var regexp = new RegExp(pat)\n if (regexp.test(\"\")) {\n throw new Error(\"RegExp matches empty string: \" + regexp)\n }\n var groupCount = reGroups(pat)\n if (groupCount > 0) {\n throw new Error(\"RegExp has capture groups: \" + regexp + \"\\nUse (?: … ) instead\")\n }\n\n // try and detect rules matching newlines\n if (!options.lineBreaks && regexp.test('\\n')) {\n throw new Error('Rule should declare lineBreaks: ' + regexp)\n }\n\n // store regex\n parts.push(reCapture(pat))\n }\n\n\n // If there's no fallback rule, use the sticky flag so we only look for\n // matches at the current index.\n //\n // If we don't support the sticky flag, then fake it using an irrefutable\n // match (i.e. an empty pattern).\n var fallbackRule = errorRule && errorRule.fallback\n var flags = hasSticky && !fallbackRule ? 'ym' : 'gm'\n var suffix = hasSticky || fallbackRule ? '' : '|'\n\n if (unicodeFlag === true) flags += \"u\"\n var combined = new RegExp(reUnion(parts) + suffix, flags)\n return {regexp: combined, groups: groups, fast: fast, error: errorRule || defaultErrorRule}\n }\n\n function compile(rules) {\n var result = compileRules(toRules(rules))\n return new Lexer({start: result}, 'start')\n }\n\n function checkStateGroup(g, name, map) {\n var state = g && (g.push || g.next)\n if (state && !map[state]) {\n throw new Error(\"Missing state '\" + state + \"' (in token '\" + g.defaultType + \"' of state '\" + name + \"')\")\n }\n if (g && g.pop && +g.pop !== 1) {\n throw new Error(\"pop must be 1 (in token '\" + g.defaultType + \"' of state '\" + name + \"')\")\n }\n }\n function compileStates(states, start) {\n var all = states.$all ? toRules(states.$all) : []\n delete states.$all\n\n var keys = Object.getOwnPropertyNames(states)\n if (!start) start = keys[0]\n\n var ruleMap = Object.create(null)\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i]\n ruleMap[key] = toRules(states[key]).concat(all)\n }\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i]\n var rules = ruleMap[key]\n var included = Object.create(null)\n for (var j = 0; j < rules.length; j++) {\n var rule = rules[j]\n if (!rule.include) continue\n var splice = [j, 1]\n if (rule.include !== key && !included[rule.include]) {\n included[rule.include] = true\n var newRules = ruleMap[rule.include]\n if (!newRules) {\n throw new Error(\"Cannot include nonexistent state '\" + rule.include + \"' (in state '\" + key + \"')\")\n }\n for (var k = 0; k < newRules.length; k++) {\n var newRule = newRules[k]\n if (rules.indexOf(newRule) !== -1) continue\n splice.push(newRule)\n }\n }\n rules.splice.apply(rules, splice)\n j--\n }\n }\n\n var map = Object.create(null)\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i]\n map[key] = compileRules(ruleMap[key], true)\n }\n\n for (var i = 0; i < keys.length; i++) {\n var name = keys[i]\n var state = map[name]\n var groups = state.groups\n for (var j = 0; j < groups.length; j++) {\n checkStateGroup(groups[j], name, map)\n }\n var fastKeys = Object.getOwnPropertyNames(state.fast)\n for (var j = 0; j < fastKeys.length; j++) {\n checkStateGroup(state.fast[fastKeys[j]], name, map)\n }\n }\n\n return new Lexer(map, start)\n }\n\n function keywordTransform(map) {\n\n // Use a JavaScript Map to map keywords to their corresponding token type\n // unless Map is unsupported, then fall back to using an Object:\n var isMap = typeof Map !== 'undefined'\n var reverseMap = isMap ? new Map : Object.create(null)\n\n var types = Object.getOwnPropertyNames(map)\n for (var i = 0; i < types.length; i++) {\n var tokenType = types[i]\n var item = map[tokenType]\n var keywordList = Array.isArray(item) ? item : [item]\n keywordList.forEach(function(keyword) {\n if (typeof keyword !== 'string') {\n throw new Error(\"keyword must be string (in keyword '\" + tokenType + \"')\")\n }\n if (isMap) {\n reverseMap.set(keyword, tokenType)\n } else {\n reverseMap[keyword] = tokenType\n }\n })\n }\n return function(k) {\n return isMap ? reverseMap.get(k) : reverseMap[k]\n }\n }\n\n /***************************************************************************/\n\n var Lexer = function(states, state) {\n this.startState = state\n this.states = states\n this.buffer = ''\n this.stack = []\n this.reset()\n }\n\n Lexer.prototype.reset = function(data, info) {\n this.buffer = data || ''\n this.index = 0\n this.line = info ? info.line : 1\n this.col = info ? info.col : 1\n this.queuedToken = info ? info.queuedToken : null\n this.queuedText = info ? info.queuedText: \"\";\n this.queuedThrow = info ? info.queuedThrow : null\n this.setState(info ? info.state : this.startState)\n this.stack = info && info.stack ? info.stack.slice() : []\n return this\n }\n\n Lexer.prototype.save = function() {\n return {\n line: this.line,\n col: this.col,\n state: this.state,\n stack: this.stack.slice(),\n queuedToken: this.queuedToken,\n queuedText: this.queuedText,\n queuedThrow: this.queuedThrow,\n }\n }\n\n Lexer.prototype.setState = function(state) {\n if (!state || this.state === state) return\n this.state = state\n var info = this.states[state]\n this.groups = info.groups\n this.error = info.error\n this.re = info.regexp\n this.fast = info.fast\n }\n\n Lexer.prototype.popState = function() {\n this.setState(this.stack.pop())\n }\n\n Lexer.prototype.pushState = function(state) {\n this.stack.push(this.state)\n this.setState(state)\n }\n\n var eat = hasSticky ? function(re, buffer) { // assume re is /y\n return re.exec(buffer)\n } : function(re, buffer) { // assume re is /g\n var match = re.exec(buffer)\n // will always match, since we used the |(?:) trick\n if (match[0].length === 0) {\n return null\n }\n return match\n }\n\n Lexer.prototype._getGroup = function(match) {\n var groupCount = this.groups.length\n for (var i = 0; i < groupCount; i++) {\n if (match[i + 1] !== undefined) {\n return this.groups[i]\n }\n }\n throw new Error('Cannot find token type for matched text')\n }\n\n function tokenToString() {\n return this.value\n }\n\n Lexer.prototype.next = function() {\n var index = this.index\n\n // If a fallback token matched, we don't need to re-run the RegExp\n if (this.queuedGroup) {\n var token = this._token(this.queuedGroup, this.queuedText, index)\n this.queuedGroup = null\n this.queuedText = \"\"\n return token\n }\n\n var buffer = this.buffer\n if (index === buffer.length) {\n return // EOF\n }\n\n // Fast matching for single characters\n var group = this.fast[buffer.charCodeAt(index)]\n if (group) {\n return this._token(group, buffer.charAt(index), index)\n }\n\n // Execute RegExp\n var re = this.re\n re.lastIndex = index\n var match = eat(re, buffer)\n\n // Error tokens match the remaining buffer\n var error = this.error\n if (match == null) {\n return this._token(error, buffer.slice(index, buffer.length), index)\n }\n\n var group = this._getGroup(match)\n var text = match[0]\n\n if (error.fallback && match.index !== index) {\n this.queuedGroup = group\n this.queuedText = text\n\n // Fallback tokens contain the unmatched portion of the buffer\n return this._token(error, buffer.slice(index, match.index), index)\n }\n\n return this._token(group, text, index)\n }\n\n Lexer.prototype._token = function(group, text, offset) {\n // count line breaks\n var lineBreaks = 0\n if (group.lineBreaks) {\n var matchNL = /\\n/g\n var nl = 1\n if (text === '\\n') {\n lineBreaks = 1\n } else {\n while (matchNL.exec(text)) { lineBreaks++; nl = matchNL.lastIndex }\n }\n }\n\n var token = {\n type: (typeof group.type === 'function' && group.type(text)) || group.defaultType,\n value: typeof group.value === 'function' ? group.value(text) : text,\n text: text,\n toString: tokenToString,\n offset: offset,\n lineBreaks: lineBreaks,\n line: this.line,\n col: this.col,\n }\n // nb. adding more props to token object will make V8 sad!\n\n var size = text.length\n this.index += size\n this.line += lineBreaks\n if (lineBreaks !== 0) {\n this.col = size - nl + 1\n } else {\n this.col += size\n }\n\n // throw, if no rule with {error: true}\n if (group.shouldThrow) {\n var err = new Error(this.formatError(token, \"invalid syntax\"))\n throw err;\n }\n\n if (group.pop) this.popState()\n else if (group.push) this.pushState(group.push)\n else if (group.next) this.setState(group.next)\n\n return token\n }\n\n if (typeof Symbol !== 'undefined' && Symbol.iterator) {\n var LexerIterator = function(lexer) {\n this.lexer = lexer\n }\n\n LexerIterator.prototype.next = function() {\n var token = this.lexer.next()\n return {value: token, done: !token}\n }\n\n LexerIterator.prototype[Symbol.iterator] = function() {\n return this\n }\n\n Lexer.prototype[Symbol.iterator] = function() {\n return new LexerIterator(this)\n }\n }\n\n Lexer.prototype.formatError = function(token, message) {\n if (token == null) {\n // An undefined token indicates EOF\n var text = this.buffer.slice(this.index)\n var token = {\n text: text,\n offset: this.index,\n lineBreaks: text.indexOf('\\n') === -1 ? 0 : 1,\n line: this.line,\n col: this.col,\n }\n }\n \n var numLinesAround = 2\n var firstDisplayedLine = Math.max(token.line - numLinesAround, 1)\n var lastDisplayedLine = token.line + numLinesAround\n var lastLineDigits = String(lastDisplayedLine).length\n var displayedLines = lastNLines(\n this.buffer, \n (this.line - token.line) + numLinesAround + 1\n )\n .slice(0, 5)\n var errorLines = []\n errorLines.push(message + \" at line \" + token.line + \" col \" + token.col + \":\")\n errorLines.push(\"\")\n for (var i = 0; i < displayedLines.length; i++) {\n var line = displayedLines[i]\n var lineNo = firstDisplayedLine + i\n errorLines.push(pad(String(lineNo), lastLineDigits) + \" \" + line);\n if (lineNo === token.line) {\n errorLines.push(pad(\"\", lastLineDigits + token.col + 1) + \"^\")\n }\n }\n return errorLines.join(\"\\n\")\n }\n\n Lexer.prototype.clone = function() {\n return new Lexer(this.states, this.state)\n }\n\n Lexer.prototype.has = function(tokenType) {\n return true\n }\n\n\n return {\n compile: compile,\n states: compileStates,\n error: Object.freeze({error: true}),\n fallback: Object.freeze({fallback: true}),\n keywords: keywordTransform,\n }\n\n}));\n","module.exports = extractDescription\n\n// Extracts description from contents of a readme file in markdown format\nfunction extractDescription (d) {\n if (!d) {\n return\n }\n if (d === 'ERROR: No README data found!') {\n return\n }\n // the first block of text before the first heading\n // that isn't the first line heading\n d = d.trim().split('\\n')\n let s = 0\n while (d[s] && d[s].trim().match(/^(#|$)/)) {\n s++\n }\n const l = d.length\n let e = s + 1\n while (e < l && d[e].trim()) {\n e++\n }\n return d.slice(s, e).join(' ').trim()\n}\n","var isValidSemver = require('semver/functions/valid')\nvar cleanSemver = require('semver/functions/clean')\nvar validateLicense = require('validate-npm-package-license')\nvar hostedGitInfo = require('hosted-git-info')\nvar isBuiltinModule = require('is-core-module')\nvar depTypes = ['dependencies', 'devDependencies', 'optionalDependencies']\nvar extractDescription = require('./extract_description')\nvar url = require('url')\nvar typos = require('./typos.json')\n\nvar isEmail = str => str.includes('@') && (str.indexOf('@') < str.lastIndexOf('.'))\n\nmodule.exports = {\n // default warning function\n warn: function () {},\n\n fixRepositoryField: function (data) {\n if (data.repositories) {\n this.warn('repositories')\n data.repository = data.repositories[0]\n }\n if (!data.repository) {\n return this.warn('missingRepository')\n }\n if (typeof data.repository === 'string') {\n data.repository = {\n type: 'git',\n url: data.repository,\n }\n }\n var r = data.repository.url || ''\n if (r) {\n var hosted = hostedGitInfo.fromUrl(r)\n if (hosted) {\n r = data.repository.url\n = hosted.getDefaultRepresentation() === 'shortcut' ? hosted.https() : hosted.toString()\n }\n }\n\n if (r.match(/github.com\\/[^/]+\\/[^/]+\\.git\\.git$/)) {\n this.warn('brokenGitUrl', r)\n }\n },\n\n fixTypos: function (data) {\n Object.keys(typos.topLevel).forEach(function (d) {\n if (Object.prototype.hasOwnProperty.call(data, d)) {\n this.warn('typo', d, typos.topLevel[d])\n }\n }, this)\n },\n\n fixScriptsField: function (data) {\n if (!data.scripts) {\n return\n }\n if (typeof data.scripts !== 'object') {\n this.warn('nonObjectScripts')\n delete data.scripts\n return\n }\n Object.keys(data.scripts).forEach(function (k) {\n if (typeof data.scripts[k] !== 'string') {\n this.warn('nonStringScript')\n delete data.scripts[k]\n } else if (typos.script[k] && !data.scripts[typos.script[k]]) {\n this.warn('typo', k, typos.script[k], 'scripts')\n }\n }, this)\n },\n\n fixFilesField: function (data) {\n var files = data.files\n if (files && !Array.isArray(files)) {\n this.warn('nonArrayFiles')\n delete data.files\n } else if (data.files) {\n data.files = data.files.filter(function (file) {\n if (!file || typeof file !== 'string') {\n this.warn('invalidFilename', file)\n return false\n } else {\n return true\n }\n }, this)\n }\n },\n\n fixBinField: function (data) {\n if (!data.bin) {\n return\n }\n if (typeof data.bin === 'string') {\n var b = {}\n var match\n if (match = data.name.match(/^@[^/]+[/](.*)$/)) {\n b[match[1]] = data.bin\n } else {\n b[data.name] = data.bin\n }\n data.bin = b\n }\n },\n\n fixManField: function (data) {\n if (!data.man) {\n return\n }\n if (typeof data.man === 'string') {\n data.man = [data.man]\n }\n },\n fixBundleDependenciesField: function (data) {\n var bdd = 'bundledDependencies'\n var bd = 'bundleDependencies'\n if (data[bdd] && !data[bd]) {\n data[bd] = data[bdd]\n delete data[bdd]\n }\n if (data[bd] && !Array.isArray(data[bd])) {\n this.warn('nonArrayBundleDependencies')\n delete data[bd]\n } else if (data[bd]) {\n data[bd] = data[bd].filter(function (filtered) {\n if (!filtered || typeof filtered !== 'string') {\n this.warn('nonStringBundleDependency', filtered)\n return false\n } else {\n if (!data.dependencies) {\n data.dependencies = {}\n }\n if (!Object.prototype.hasOwnProperty.call(data.dependencies, filtered)) {\n this.warn('nonDependencyBundleDependency', filtered)\n data.dependencies[filtered] = '*'\n }\n return true\n }\n }, this)\n }\n },\n\n fixDependencies: function (data, strict) {\n objectifyDeps(data, this.warn)\n addOptionalDepsToDeps(data, this.warn)\n this.fixBundleDependenciesField(data)\n\n ;['dependencies', 'devDependencies'].forEach(function (deps) {\n if (!(deps in data)) {\n return\n }\n if (!data[deps] || typeof data[deps] !== 'object') {\n this.warn('nonObjectDependencies', deps)\n delete data[deps]\n return\n }\n Object.keys(data[deps]).forEach(function (d) {\n var r = data[deps][d]\n if (typeof r !== 'string') {\n this.warn('nonStringDependency', d, JSON.stringify(r))\n delete data[deps][d]\n }\n var hosted = hostedGitInfo.fromUrl(data[deps][d])\n if (hosted) {\n data[deps][d] = hosted.toString()\n }\n }, this)\n }, this)\n },\n\n fixModulesField: function (data) {\n if (data.modules) {\n this.warn('deprecatedModules')\n delete data.modules\n }\n },\n\n fixKeywordsField: function (data) {\n if (typeof data.keywords === 'string') {\n data.keywords = data.keywords.split(/,\\s+/)\n }\n if (data.keywords && !Array.isArray(data.keywords)) {\n delete data.keywords\n this.warn('nonArrayKeywords')\n } else if (data.keywords) {\n data.keywords = data.keywords.filter(function (kw) {\n if (typeof kw !== 'string' || !kw) {\n this.warn('nonStringKeyword')\n return false\n } else {\n return true\n }\n }, this)\n }\n },\n\n fixVersionField: function (data, strict) {\n // allow \"loose\" semver 1.0 versions in non-strict mode\n // enforce strict semver 2.0 compliance in strict mode\n var loose = !strict\n if (!data.version) {\n data.version = ''\n return true\n }\n if (!isValidSemver(data.version, loose)) {\n throw new Error('Invalid version: \"' + data.version + '\"')\n }\n data.version = cleanSemver(data.version, loose)\n return true\n },\n\n fixPeople: function (data) {\n modifyPeople(data, unParsePerson)\n modifyPeople(data, parsePerson)\n },\n\n fixNameField: function (data, options) {\n if (typeof options === 'boolean') {\n options = { strict: options }\n } else if (typeof options === 'undefined') {\n options = {}\n }\n var strict = options.strict\n if (!data.name && !strict) {\n data.name = ''\n return\n }\n if (typeof data.name !== 'string') {\n throw new Error('name field must be a string.')\n }\n if (!strict) {\n data.name = data.name.trim()\n }\n ensureValidName(data.name, strict, options.allowLegacyCase)\n if (isBuiltinModule(data.name)) {\n this.warn('conflictingName', data.name)\n }\n },\n\n fixDescriptionField: function (data) {\n if (data.description && typeof data.description !== 'string') {\n this.warn('nonStringDescription')\n delete data.description\n }\n if (data.readme && !data.description) {\n data.description = extractDescription(data.readme)\n }\n if (data.description === undefined) {\n delete data.description\n }\n if (!data.description) {\n this.warn('missingDescription')\n }\n },\n\n fixReadmeField: function (data) {\n if (!data.readme) {\n this.warn('missingReadme')\n data.readme = 'ERROR: No README data found!'\n }\n },\n\n fixBugsField: function (data) {\n if (!data.bugs && data.repository && data.repository.url) {\n var hosted = hostedGitInfo.fromUrl(data.repository.url)\n if (hosted && hosted.bugs()) {\n data.bugs = { url: hosted.bugs() }\n }\n } else if (data.bugs) {\n if (typeof data.bugs === 'string') {\n if (isEmail(data.bugs)) {\n data.bugs = { email: data.bugs }\n /* eslint-disable-next-line node/no-deprecated-api */\n } else if (url.parse(data.bugs).protocol) {\n data.bugs = { url: data.bugs }\n } else {\n this.warn('nonEmailUrlBugsString')\n }\n } else {\n bugsTypos(data.bugs, this.warn)\n var oldBugs = data.bugs\n data.bugs = {}\n if (oldBugs.url) {\n /* eslint-disable-next-line node/no-deprecated-api */\n if (typeof (oldBugs.url) === 'string' && url.parse(oldBugs.url).protocol) {\n data.bugs.url = oldBugs.url\n } else {\n this.warn('nonUrlBugsUrlField')\n }\n }\n if (oldBugs.email) {\n if (typeof (oldBugs.email) === 'string' && isEmail(oldBugs.email)) {\n data.bugs.email = oldBugs.email\n } else {\n this.warn('nonEmailBugsEmailField')\n }\n }\n }\n if (!data.bugs.email && !data.bugs.url) {\n delete data.bugs\n this.warn('emptyNormalizedBugs')\n }\n }\n },\n\n fixHomepageField: function (data) {\n if (!data.homepage && data.repository && data.repository.url) {\n var hosted = hostedGitInfo.fromUrl(data.repository.url)\n if (hosted && hosted.docs()) {\n data.homepage = hosted.docs()\n }\n }\n if (!data.homepage) {\n return\n }\n\n if (typeof data.homepage !== 'string') {\n this.warn('nonUrlHomepage')\n return delete data.homepage\n }\n /* eslint-disable-next-line node/no-deprecated-api */\n if (!url.parse(data.homepage).protocol) {\n data.homepage = 'http://' + data.homepage\n }\n },\n\n fixLicenseField: function (data) {\n const license = data.license || data.licence\n if (!license) {\n return this.warn('missingLicense')\n }\n if (\n typeof (license) !== 'string' ||\n license.length < 1 ||\n license.trim() === ''\n ) {\n return this.warn('invalidLicense')\n }\n if (!validateLicense(license).validForNewPackages) {\n return this.warn('invalidLicense')\n }\n },\n}\n\nfunction isValidScopedPackageName (spec) {\n if (spec.charAt(0) !== '@') {\n return false\n }\n\n var rest = spec.slice(1).split('/')\n if (rest.length !== 2) {\n return false\n }\n\n return rest[0] && rest[1] &&\n rest[0] === encodeURIComponent(rest[0]) &&\n rest[1] === encodeURIComponent(rest[1])\n}\n\nfunction isCorrectlyEncodedName (spec) {\n return !spec.match(/[/@\\s+%:]/) &&\n spec === encodeURIComponent(spec)\n}\n\nfunction ensureValidName (name, strict, allowLegacyCase) {\n if (name.charAt(0) === '.' ||\n !(isValidScopedPackageName(name) || isCorrectlyEncodedName(name)) ||\n (strict && (!allowLegacyCase) && name !== name.toLowerCase()) ||\n name.toLowerCase() === 'node_modules' ||\n name.toLowerCase() === 'favicon.ico') {\n throw new Error('Invalid name: ' + JSON.stringify(name))\n }\n}\n\nfunction modifyPeople (data, fn) {\n if (data.author) {\n data.author = fn(data.author)\n }['maintainers', 'contributors'].forEach(function (set) {\n if (!Array.isArray(data[set])) {\n return\n }\n data[set] = data[set].map(fn)\n })\n return data\n}\n\nfunction unParsePerson (person) {\n if (typeof person === 'string') {\n return person\n }\n var name = person.name || ''\n var u = person.url || person.web\n var wrappedUrl = u ? (' (' + u + ')') : ''\n var e = person.email || person.mail\n var wrappedEmail = e ? (' <' + e + '>') : ''\n return name + wrappedEmail + wrappedUrl\n}\n\nfunction parsePerson (person) {\n if (typeof person !== 'string') {\n return person\n }\n var matchedName = person.match(/^([^(<]+)/)\n var matchedUrl = person.match(/\\(([^()]+)\\)/)\n var matchedEmail = person.match(/<([^<>]+)>/)\n var obj = {}\n if (matchedName && matchedName[0].trim()) {\n obj.name = matchedName[0].trim()\n }\n if (matchedEmail) {\n obj.email = matchedEmail[1]\n }\n if (matchedUrl) {\n obj.url = matchedUrl[1]\n }\n return obj\n}\n\nfunction addOptionalDepsToDeps (data, warn) {\n var o = data.optionalDependencies\n if (!o) {\n return\n }\n var d = data.dependencies || {}\n Object.keys(o).forEach(function (k) {\n d[k] = o[k]\n })\n data.dependencies = d\n}\n\nfunction depObjectify (deps, type, warn) {\n if (!deps) {\n return {}\n }\n if (typeof deps === 'string') {\n deps = deps.trim().split(/[\\n\\r\\s\\t ,]+/)\n }\n if (!Array.isArray(deps)) {\n return deps\n }\n warn('deprecatedArrayDependencies', type)\n var o = {}\n deps.filter(function (d) {\n return typeof d === 'string'\n }).forEach(function (d) {\n d = d.trim().split(/(:?[@\\s><=])/)\n var dn = d.shift()\n var dv = d.join('')\n dv = dv.trim()\n dv = dv.replace(/^@/, '')\n o[dn] = dv\n })\n return o\n}\n\nfunction objectifyDeps (data, warn) {\n depTypes.forEach(function (type) {\n if (!data[type]) {\n return\n }\n data[type] = depObjectify(data[type], type, warn)\n })\n}\n\nfunction bugsTypos (bugs, warn) {\n if (!bugs) {\n return\n }\n Object.keys(bugs).forEach(function (k) {\n if (typos.bugs[k]) {\n warn('typo', k, typos.bugs[k], 'bugs')\n bugs[typos.bugs[k]] = bugs[k]\n delete bugs[k]\n }\n })\n}\n","var util = require('util')\nvar messages = require('./warning_messages.json')\n\nmodule.exports = function () {\n var args = Array.prototype.slice.call(arguments, 0)\n var warningName = args.shift()\n if (warningName === 'typo') {\n return makeTypoWarning.apply(null, args)\n } else {\n var msgTemplate = messages[warningName] ? messages[warningName] : warningName + \": '%s'\"\n args.unshift(msgTemplate)\n return util.format.apply(null, args)\n }\n}\n\nfunction makeTypoWarning (providedName, probableName, field) {\n if (field) {\n providedName = field + \"['\" + providedName + \"']\"\n probableName = field + \"['\" + probableName + \"']\"\n }\n return util.format(messages.typo, providedName, probableName)\n}\n","module.exports = normalize\n\nvar fixer = require('./fixer')\nnormalize.fixer = fixer\n\nvar makeWarning = require('./make_warning')\n\nvar fieldsToFix = ['name', 'version', 'description', 'repository', 'modules', 'scripts',\n 'files', 'bin', 'man', 'bugs', 'keywords', 'readme', 'homepage', 'license']\nvar otherThingsToFix = ['dependencies', 'people', 'typos']\n\nvar thingsToFix = fieldsToFix.map(function (fieldName) {\n return ucFirst(fieldName) + 'Field'\n})\n// two ways to do this in CoffeeScript on only one line, sub-70 chars:\n// thingsToFix = fieldsToFix.map (name) -> ucFirst(name) + \"Field\"\n// thingsToFix = (ucFirst(name) + \"Field\" for name in fieldsToFix)\nthingsToFix = thingsToFix.concat(otherThingsToFix)\n\nfunction normalize (data, warn, strict) {\n if (warn === true) {\n warn = null\n strict = true\n }\n if (!strict) {\n strict = false\n }\n if (!warn || data.private) {\n warn = function (msg) { /* noop */ }\n }\n\n if (data.scripts &&\n data.scripts.install === 'node-gyp rebuild' &&\n !data.scripts.preinstall) {\n data.gypfile = true\n }\n fixer.warn = function () {\n warn(makeWarning.apply(null, arguments))\n }\n thingsToFix.forEach(function (thingName) {\n fixer['fix' + ucFirst(thingName)](data, strict)\n })\n data._id = data.name + '@' + data.version\n}\n\nfunction ucFirst (string) {\n return string.charAt(0).toUpperCase() + string.slice(1)\n}\n","const debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n constructor (version, options) {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n if (version.loose === !!options.loose &&\n version.includePrerelease === !!options.includePrerelease) {\n return version\n } else {\n version = version.version\n }\n } else if (typeof version !== 'string') {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n if (version.length > MAX_LENGTH) {\n throw new TypeError(\n `version is longer than ${MAX_LENGTH} characters`\n )\n }\n\n debug('SemVer', version, options)\n this.options = options\n this.loose = !!options.loose\n // this isn't actually relevant for versions, but keep it so that we\n // don't run into trouble passing this.options around.\n this.includePrerelease = !!options.includePrerelease\n\n const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n if (!m) {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n this.raw = version\n\n // these are actually numbers\n this.major = +m[1]\n this.minor = +m[2]\n this.patch = +m[3]\n\n if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n throw new TypeError('Invalid major version')\n }\n\n if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n throw new TypeError('Invalid minor version')\n }\n\n if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n throw new TypeError('Invalid patch version')\n }\n\n // numberify any prerelease numeric ids\n if (!m[4]) {\n this.prerelease = []\n } else {\n this.prerelease = m[4].split('.').map((id) => {\n if (/^[0-9]+$/.test(id)) {\n const num = +id\n if (num >= 0 && num < MAX_SAFE_INTEGER) {\n return num\n }\n }\n return id\n })\n }\n\n this.build = m[5] ? m[5].split('.') : []\n this.format()\n }\n\n format () {\n this.version = `${this.major}.${this.minor}.${this.patch}`\n if (this.prerelease.length) {\n this.version += `-${this.prerelease.join('.')}`\n }\n return this.version\n }\n\n toString () {\n return this.version\n }\n\n compare (other) {\n debug('SemVer.compare', this.version, this.options, other)\n if (!(other instanceof SemVer)) {\n if (typeof other === 'string' && other === this.version) {\n return 0\n }\n other = new SemVer(other, this.options)\n }\n\n if (other.version === this.version) {\n return 0\n }\n\n return this.compareMain(other) || this.comparePre(other)\n }\n\n compareMain (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n return (\n compareIdentifiers(this.major, other.major) ||\n compareIdentifiers(this.minor, other.minor) ||\n compareIdentifiers(this.patch, other.patch)\n )\n }\n\n comparePre (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n // NOT having a prerelease is > having one\n if (this.prerelease.length && !other.prerelease.length) {\n return -1\n } else if (!this.prerelease.length && other.prerelease.length) {\n return 1\n } else if (!this.prerelease.length && !other.prerelease.length) {\n return 0\n }\n\n let i = 0\n do {\n const a = this.prerelease[i]\n const b = other.prerelease[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n compareBuild (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n let i = 0\n do {\n const a = this.build[i]\n const b = other.build[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n // preminor will bump the version up to the next minor release, and immediately\n // down to pre-release. premajor and prepatch work the same way.\n inc (release, identifier) {\n switch (release) {\n case 'premajor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor = 0\n this.major++\n this.inc('pre', identifier)\n break\n case 'preminor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor++\n this.inc('pre', identifier)\n break\n case 'prepatch':\n // If this is already a prerelease, it will bump to the next version\n // drop any prereleases that might already exist, since they are not\n // relevant at this point.\n this.prerelease.length = 0\n this.inc('patch', identifier)\n this.inc('pre', identifier)\n break\n // If the input is a non-prerelease version, this acts the same as\n // prepatch.\n case 'prerelease':\n if (this.prerelease.length === 0) {\n this.inc('patch', identifier)\n }\n this.inc('pre', identifier)\n break\n\n case 'major':\n // If this is a pre-major version, bump up to the same major version.\n // Otherwise increment major.\n // 1.0.0-5 bumps to 1.0.0\n // 1.1.0 bumps to 2.0.0\n if (\n this.minor !== 0 ||\n this.patch !== 0 ||\n this.prerelease.length === 0\n ) {\n this.major++\n }\n this.minor = 0\n this.patch = 0\n this.prerelease = []\n break\n case 'minor':\n // If this is a pre-minor version, bump up to the same minor version.\n // Otherwise increment minor.\n // 1.2.0-5 bumps to 1.2.0\n // 1.2.1 bumps to 1.3.0\n if (this.patch !== 0 || this.prerelease.length === 0) {\n this.minor++\n }\n this.patch = 0\n this.prerelease = []\n break\n case 'patch':\n // If this is not a pre-release version, it will increment the patch.\n // If it is a pre-release it will bump up to the same patch version.\n // 1.2.0-5 patches to 1.2.0\n // 1.2.0 patches to 1.2.1\n if (this.prerelease.length === 0) {\n this.patch++\n }\n this.prerelease = []\n break\n // This probably shouldn't be used publicly.\n // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n case 'pre':\n if (this.prerelease.length === 0) {\n this.prerelease = [0]\n } else {\n let i = this.prerelease.length\n while (--i >= 0) {\n if (typeof this.prerelease[i] === 'number') {\n this.prerelease[i]++\n i = -2\n }\n }\n if (i === -1) {\n // didn't increment anything\n this.prerelease.push(0)\n }\n }\n if (identifier) {\n // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n if (this.prerelease[0] === identifier) {\n if (isNaN(this.prerelease[1])) {\n this.prerelease = [identifier, 0]\n }\n } else {\n this.prerelease = [identifier, 0]\n }\n }\n break\n\n default:\n throw new Error(`invalid increment argument: ${release}`)\n }\n this.format()\n this.raw = this.version\n return this\n }\n}\n\nmodule.exports = SemVer\n","const parse = require('./parse')\nconst clean = (version, options) => {\n const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n return s ? s.version : null\n}\nmodule.exports = clean\n","const {MAX_LENGTH} = require('../internal/constants')\nconst { re, t } = require('../internal/re')\nconst SemVer = require('../classes/semver')\n\nconst parseOptions = require('../internal/parse-options')\nconst parse = (version, options) => {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n if (version.length > MAX_LENGTH) {\n return null\n }\n\n const r = options.loose ? re[t.LOOSE] : re[t.FULL]\n if (!r.test(version)) {\n return null\n }\n\n try {\n return new SemVer(version, options)\n } catch (er) {\n return null\n }\n}\n\nmodule.exports = parse\n","const parse = require('./parse')\nconst valid = (version, options) => {\n const v = parse(version, options)\n return v ? v.version : null\n}\nmodule.exports = valid\n","// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n /* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\nmodule.exports = {\n SEMVER_SPEC_VERSION,\n MAX_LENGTH,\n MAX_SAFE_INTEGER,\n MAX_SAFE_COMPONENT_LENGTH\n}\n","const debug = (\n typeof process === 'object' &&\n process.env &&\n process.env.NODE_DEBUG &&\n /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n : () => {}\n\nmodule.exports = debug\n","const numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n const anum = numeric.test(a)\n const bnum = numeric.test(b)\n\n if (anum && bnum) {\n a = +a\n b = +b\n }\n\n return a === b ? 0\n : (anum && !bnum) ? -1\n : (bnum && !anum) ? 1\n : a < b ? -1\n : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n compareIdentifiers,\n rcompareIdentifiers\n}\n","// parse out just the options we care about so we always get a consistent\n// obj with keys in a consistent order.\nconst opts = ['includePrerelease', 'loose', 'rtl']\nconst parseOptions = options =>\n !options ? {}\n : typeof options !== 'object' ? { loose: true }\n : opts.filter(k => options[k]).reduce((options, k) => {\n options[k] = true\n return options\n }, {})\nmodule.exports = parseOptions\n","const { MAX_SAFE_COMPONENT_LENGTH } = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst src = exports.src = []\nconst t = exports.t = {}\nlet R = 0\n\nconst createToken = (name, value, isGlobal) => {\n const index = R++\n debug(index, value)\n t[name] = index\n src[index] = value\n re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '[0-9]+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', '\\\\d*[a-zA-Z-][a-zA-Z0-9-]*')\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', '[0-9A-Za-z-]+')\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups. The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:${src[t.PRERELEASE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:${src[t.PRERELEASELOOSE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCE', `${'(^|[^\\\\d])' +\n '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAIN]})` +\n `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\.0\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\.0\\.0-0\\\\s*$')\n","const ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n static get ANY () {\n return ANY\n }\n\n constructor (comp, options) {\n options = parseOptions(options)\n\n if (comp instanceof Comparator) {\n if (comp.loose === !!options.loose) {\n return comp\n } else {\n comp = comp.value\n }\n }\n\n debug('comparator', comp, options)\n this.options = options\n this.loose = !!options.loose\n this.parse(comp)\n\n if (this.semver === ANY) {\n this.value = ''\n } else {\n this.value = this.operator + this.semver.version\n }\n\n debug('comp', this)\n }\n\n parse (comp) {\n const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n const m = comp.match(r)\n\n if (!m) {\n throw new TypeError(`Invalid comparator: ${comp}`)\n }\n\n this.operator = m[1] !== undefined ? m[1] : ''\n if (this.operator === '=') {\n this.operator = ''\n }\n\n // if it literally is just '>' or '' then allow anything.\n if (!m[2]) {\n this.semver = ANY\n } else {\n this.semver = new SemVer(m[2], this.options.loose)\n }\n }\n\n toString () {\n return this.value\n }\n\n test (version) {\n debug('Comparator.test', version, this.options.loose)\n\n if (this.semver === ANY || version === ANY) {\n return true\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n return cmp(version, this.operator, this.semver, this.options)\n }\n\n intersects (comp, options) {\n if (!(comp instanceof Comparator)) {\n throw new TypeError('a Comparator is required')\n }\n\n if (!options || typeof options !== 'object') {\n options = {\n loose: !!options,\n includePrerelease: false,\n }\n }\n\n if (this.operator === '') {\n if (this.value === '') {\n return true\n }\n return new Range(comp.value, options).test(this.value)\n } else if (comp.operator === '') {\n if (comp.value === '') {\n return true\n }\n return new Range(this.value, options).test(comp.semver)\n }\n\n const sameDirectionIncreasing =\n (this.operator === '>=' || this.operator === '>') &&\n (comp.operator === '>=' || comp.operator === '>')\n const sameDirectionDecreasing =\n (this.operator === '<=' || this.operator === '<') &&\n (comp.operator === '<=' || comp.operator === '<')\n const sameSemVer = this.semver.version === comp.semver.version\n const differentDirectionsInclusive =\n (this.operator === '>=' || this.operator === '<=') &&\n (comp.operator === '>=' || comp.operator === '<=')\n const oppositeDirectionsLessThan =\n cmp(this.semver, '<', comp.semver, options) &&\n (this.operator === '>=' || this.operator === '>') &&\n (comp.operator === '<=' || comp.operator === '<')\n const oppositeDirectionsGreaterThan =\n cmp(this.semver, '>', comp.semver, options) &&\n (this.operator === '<=' || this.operator === '<') &&\n (comp.operator === '>=' || comp.operator === '>')\n\n return (\n sameDirectionIncreasing ||\n sameDirectionDecreasing ||\n (sameSemVer && differentDirectionsInclusive) ||\n oppositeDirectionsLessThan ||\n oppositeDirectionsGreaterThan\n )\n }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n","// hoisted class for cyclic dependency\nclass Range {\n constructor (range, options) {\n options = parseOptions(options)\n\n if (range instanceof Range) {\n if (\n range.loose === !!options.loose &&\n range.includePrerelease === !!options.includePrerelease\n ) {\n return range\n } else {\n return new Range(range.raw, options)\n }\n }\n\n if (range instanceof Comparator) {\n // just put it in the set and return\n this.raw = range.value\n this.set = [[range]]\n this.format()\n return this\n }\n\n this.options = options\n this.loose = !!options.loose\n this.includePrerelease = !!options.includePrerelease\n\n // First, split based on boolean or ||\n this.raw = range\n this.set = range\n .split('||')\n // map the range to a 2d array of comparators\n .map(r => this.parseRange(r.trim()))\n // throw out any comparator lists that are empty\n // this generally means that it was not a valid range, which is allowed\n // in loose mode, but will still throw if the WHOLE range is invalid.\n .filter(c => c.length)\n\n if (!this.set.length) {\n throw new TypeError(`Invalid SemVer Range: ${range}`)\n }\n\n // if we have any that are not the null set, throw out null sets.\n if (this.set.length > 1) {\n // keep the first one, in case they're all null sets\n const first = this.set[0]\n this.set = this.set.filter(c => !isNullSet(c[0]))\n if (this.set.length === 0) {\n this.set = [first]\n } else if (this.set.length > 1) {\n // if we have any that are *, then the range is just *\n for (const c of this.set) {\n if (c.length === 1 && isAny(c[0])) {\n this.set = [c]\n break\n }\n }\n }\n }\n\n this.format()\n }\n\n format () {\n this.range = this.set\n .map((comps) => {\n return comps.join(' ').trim()\n })\n .join('||')\n .trim()\n return this.range\n }\n\n toString () {\n return this.range\n }\n\n parseRange (range) {\n range = range.trim()\n\n // memoize range parsing for performance.\n // this is a very hot path, and fully deterministic.\n const memoOpts = Object.keys(this.options).join(',')\n const memoKey = `parseRange:${memoOpts}:${range}`\n const cached = cache.get(memoKey)\n if (cached) {\n return cached\n }\n\n const loose = this.options.loose\n // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n debug('hyphen replace', range)\n // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n debug('comparator trim', range)\n\n // `~ 1.2.3` => `~1.2.3`\n range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n\n // `^ 1.2.3` => `^1.2.3`\n range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n\n // normalize spaces\n range = range.split(/\\s+/).join(' ')\n\n // At this point, the range is completely trimmed and\n // ready to be split into comparators.\n\n let rangeList = range\n .split(' ')\n .map(comp => parseComparator(comp, this.options))\n .join(' ')\n .split(/\\s+/)\n // >=0.0.0 is equivalent to *\n .map(comp => replaceGTE0(comp, this.options))\n\n if (loose) {\n // in loose mode, throw out any that are not valid comparators\n rangeList = rangeList.filter(comp => {\n debug('loose invalid filter', comp, this.options)\n return !!comp.match(re[t.COMPARATORLOOSE])\n })\n }\n debug('range list', rangeList)\n\n // if any comparators are the null set, then replace with JUST null set\n // if more than one comparator, remove any * comparators\n // also, don't include the same comparator more than once\n const rangeMap = new Map()\n const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n for (const comp of comparators) {\n if (isNullSet(comp)) {\n return [comp]\n }\n rangeMap.set(comp.value, comp)\n }\n if (rangeMap.size > 1 && rangeMap.has('')) {\n rangeMap.delete('')\n }\n\n const result = [...rangeMap.values()]\n cache.set(memoKey, result)\n return result\n }\n\n intersects (range, options) {\n if (!(range instanceof Range)) {\n throw new TypeError('a Range is required')\n }\n\n return this.set.some((thisComparators) => {\n return (\n isSatisfiable(thisComparators, options) &&\n range.set.some((rangeComparators) => {\n return (\n isSatisfiable(rangeComparators, options) &&\n thisComparators.every((thisComparator) => {\n return rangeComparators.every((rangeComparator) => {\n return thisComparator.intersects(rangeComparator, options)\n })\n })\n )\n })\n )\n })\n }\n\n // if ANY of the sets match ALL of its comparators, then pass\n test (version) {\n if (!version) {\n return false\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n for (let i = 0; i < this.set.length; i++) {\n if (testSet(this.set[i], version, this.options)) {\n return true\n }\n }\n return false\n }\n}\nmodule.exports = Range\n\nconst LRU = require('lru-cache')\nconst cache = new LRU({ max: 1000 })\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n re,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n let result = true\n const remainingComparators = comparators.slice()\n let testComparator = remainingComparators.pop()\n\n while (result && remainingComparators.length) {\n result = remainingComparators.every((otherComparator) => {\n return testComparator.intersects(otherComparator, options)\n })\n\n testComparator = remainingComparators.pop()\n }\n\n return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n debug('comp', comp, options)\n comp = replaceCarets(comp, options)\n debug('caret', comp)\n comp = replaceTildes(comp, options)\n debug('tildes', comp)\n comp = replaceXRanges(comp, options)\n debug('xrange', comp)\n comp = replaceStars(comp, options)\n debug('stars', comp)\n return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) =>\n comp.trim().split(/\\s+/).map((c) => {\n return replaceTilde(c, options)\n }).join(' ')\n\nconst replaceTilde = (comp, options) => {\n const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('tilde', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n // ~1.2 == >=1.2.0 <1.3.0-0\n ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n } else if (pr) {\n debug('replaceTilde pr', pr)\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n } else {\n // ~1.2.3 == >=1.2.3 <1.3.0-0\n ret = `>=${M}.${m}.${p\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('tilde return', ret)\n return ret\n })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) =>\n comp.trim().split(/\\s+/).map((c) => {\n return replaceCaret(c, options)\n }).join(' ')\n\nconst replaceCaret = (comp, options) => {\n debug('caret', comp, options)\n const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n const z = options.includePrerelease ? '-0' : ''\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('caret', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n if (M === '0') {\n ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n } else {\n ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n }\n } else if (pr) {\n debug('replaceCaret pr', pr)\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${+M + 1}.0.0-0`\n }\n } else {\n debug('no pr')\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p\n } <${+M + 1}.0.0-0`\n }\n }\n\n debug('caret return', ret)\n return ret\n })\n}\n\nconst replaceXRanges = (comp, options) => {\n debug('replaceXRanges', comp, options)\n return comp.split(/\\s+/).map((c) => {\n return replaceXRange(c, options)\n }).join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n comp = comp.trim()\n const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n debug('xRange', comp, ret, gtlt, M, m, p, pr)\n const xM = isX(M)\n const xm = xM || isX(m)\n const xp = xm || isX(p)\n const anyX = xp\n\n if (gtlt === '=' && anyX) {\n gtlt = ''\n }\n\n // if we're including prereleases in the match, then we need\n // to fix this to -0, the lowest possible prerelease value\n pr = options.includePrerelease ? '-0' : ''\n\n if (xM) {\n if (gtlt === '>' || gtlt === '<') {\n // nothing is allowed\n ret = '<0.0.0-0'\n } else {\n // nothing is forbidden\n ret = '*'\n }\n } else if (gtlt && anyX) {\n // we know patch is an x, because we have any x at all.\n // replace X with 0\n if (xm) {\n m = 0\n }\n p = 0\n\n if (gtlt === '>') {\n // >1 => >=2.0.0\n // >1.2 => >=1.3.0\n gtlt = '>='\n if (xm) {\n M = +M + 1\n m = 0\n p = 0\n } else {\n m = +m + 1\n p = 0\n }\n } else if (gtlt === '<=') {\n // <=0.7.x is actually <0.8.0, since any 0.7.x should\n // pass. Similarly, <=7.x is actually <8.0.0, etc.\n gtlt = '<'\n if (xm) {\n M = +M + 1\n } else {\n m = +m + 1\n }\n }\n\n if (gtlt === '<') {\n pr = '-0'\n }\n\n ret = `${gtlt + M}.${m}.${p}${pr}`\n } else if (xm) {\n ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n } else if (xp) {\n ret = `>=${M}.${m}.0${pr\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('xRange return', ret)\n\n return ret\n })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n debug('replaceStars', comp, options)\n // Looseness is ignored here. star is always as loose as it gets!\n return comp.trim().replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n debug('replaceGTE0', comp, options)\n return comp.trim()\n .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\nconst hyphenReplace = incPr => ($0,\n from, fM, fm, fp, fpr, fb,\n to, tM, tm, tp, tpr, tb) => {\n if (isX(fM)) {\n from = ''\n } else if (isX(fm)) {\n from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n } else if (isX(fp)) {\n from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n } else if (fpr) {\n from = `>=${from}`\n } else {\n from = `>=${from}${incPr ? '-0' : ''}`\n }\n\n if (isX(tM)) {\n to = ''\n } else if (isX(tm)) {\n to = `<${+tM + 1}.0.0-0`\n } else if (isX(tp)) {\n to = `<${tM}.${+tm + 1}.0-0`\n } else if (tpr) {\n to = `<=${tM}.${tm}.${tp}-${tpr}`\n } else if (incPr) {\n to = `<${tM}.${tm}.${+tp + 1}-0`\n } else {\n to = `<=${to}`\n }\n\n return (`${from} ${to}`).trim()\n}\n\nconst testSet = (set, version, options) => {\n for (let i = 0; i < set.length; i++) {\n if (!set[i].test(version)) {\n return false\n }\n }\n\n if (version.prerelease.length && !options.includePrerelease) {\n // Find the set of versions that are allowed to have prereleases\n // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n // That should allow `1.2.3-pr.2` to pass.\n // However, `1.2.4-alpha.notready` should NOT be allowed,\n // even though it's within the range set by the comparators.\n for (let i = 0; i < set.length; i++) {\n debug(set[i].semver)\n if (set[i].semver === Comparator.ANY) {\n continue\n }\n\n if (set[i].semver.prerelease.length > 0) {\n const allowed = set[i].semver\n if (allowed.major === version.major &&\n allowed.minor === version.minor &&\n allowed.patch === version.patch) {\n return true\n }\n }\n }\n\n // Version has a -pre, but it's not one of the ones we like.\n return false\n }\n\n return true\n}\n","const debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n constructor (version, options) {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n if (version.loose === !!options.loose &&\n version.includePrerelease === !!options.includePrerelease) {\n return version\n } else {\n version = version.version\n }\n } else if (typeof version !== 'string') {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n if (version.length > MAX_LENGTH) {\n throw new TypeError(\n `version is longer than ${MAX_LENGTH} characters`\n )\n }\n\n debug('SemVer', version, options)\n this.options = options\n this.loose = !!options.loose\n // this isn't actually relevant for versions, but keep it so that we\n // don't run into trouble passing this.options around.\n this.includePrerelease = !!options.includePrerelease\n\n const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n if (!m) {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n this.raw = version\n\n // these are actually numbers\n this.major = +m[1]\n this.minor = +m[2]\n this.patch = +m[3]\n\n if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n throw new TypeError('Invalid major version')\n }\n\n if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n throw new TypeError('Invalid minor version')\n }\n\n if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n throw new TypeError('Invalid patch version')\n }\n\n // numberify any prerelease numeric ids\n if (!m[4]) {\n this.prerelease = []\n } else {\n this.prerelease = m[4].split('.').map((id) => {\n if (/^[0-9]+$/.test(id)) {\n const num = +id\n if (num >= 0 && num < MAX_SAFE_INTEGER) {\n return num\n }\n }\n return id\n })\n }\n\n this.build = m[5] ? m[5].split('.') : []\n this.format()\n }\n\n format () {\n this.version = `${this.major}.${this.minor}.${this.patch}`\n if (this.prerelease.length) {\n this.version += `-${this.prerelease.join('.')}`\n }\n return this.version\n }\n\n toString () {\n return this.version\n }\n\n compare (other) {\n debug('SemVer.compare', this.version, this.options, other)\n if (!(other instanceof SemVer)) {\n if (typeof other === 'string' && other === this.version) {\n return 0\n }\n other = new SemVer(other, this.options)\n }\n\n if (other.version === this.version) {\n return 0\n }\n\n return this.compareMain(other) || this.comparePre(other)\n }\n\n compareMain (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n return (\n compareIdentifiers(this.major, other.major) ||\n compareIdentifiers(this.minor, other.minor) ||\n compareIdentifiers(this.patch, other.patch)\n )\n }\n\n comparePre (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n // NOT having a prerelease is > having one\n if (this.prerelease.length && !other.prerelease.length) {\n return -1\n } else if (!this.prerelease.length && other.prerelease.length) {\n return 1\n } else if (!this.prerelease.length && !other.prerelease.length) {\n return 0\n }\n\n let i = 0\n do {\n const a = this.prerelease[i]\n const b = other.prerelease[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n compareBuild (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n let i = 0\n do {\n const a = this.build[i]\n const b = other.build[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n // preminor will bump the version up to the next minor release, and immediately\n // down to pre-release. premajor and prepatch work the same way.\n inc (release, identifier) {\n switch (release) {\n case 'premajor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor = 0\n this.major++\n this.inc('pre', identifier)\n break\n case 'preminor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor++\n this.inc('pre', identifier)\n break\n case 'prepatch':\n // If this is already a prerelease, it will bump to the next version\n // drop any prereleases that might already exist, since they are not\n // relevant at this point.\n this.prerelease.length = 0\n this.inc('patch', identifier)\n this.inc('pre', identifier)\n break\n // If the input is a non-prerelease version, this acts the same as\n // prepatch.\n case 'prerelease':\n if (this.prerelease.length === 0) {\n this.inc('patch', identifier)\n }\n this.inc('pre', identifier)\n break\n\n case 'major':\n // If this is a pre-major version, bump up to the same major version.\n // Otherwise increment major.\n // 1.0.0-5 bumps to 1.0.0\n // 1.1.0 bumps to 2.0.0\n if (\n this.minor !== 0 ||\n this.patch !== 0 ||\n this.prerelease.length === 0\n ) {\n this.major++\n }\n this.minor = 0\n this.patch = 0\n this.prerelease = []\n break\n case 'minor':\n // If this is a pre-minor version, bump up to the same minor version.\n // Otherwise increment minor.\n // 1.2.0-5 bumps to 1.2.0\n // 1.2.1 bumps to 1.3.0\n if (this.patch !== 0 || this.prerelease.length === 0) {\n this.minor++\n }\n this.patch = 0\n this.prerelease = []\n break\n case 'patch':\n // If this is not a pre-release version, it will increment the patch.\n // If it is a pre-release it will bump up to the same patch version.\n // 1.2.0-5 patches to 1.2.0\n // 1.2.0 patches to 1.2.1\n if (this.prerelease.length === 0) {\n this.patch++\n }\n this.prerelease = []\n break\n // This probably shouldn't be used publicly.\n // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n case 'pre':\n if (this.prerelease.length === 0) {\n this.prerelease = [0]\n } else {\n let i = this.prerelease.length\n while (--i >= 0) {\n if (typeof this.prerelease[i] === 'number') {\n this.prerelease[i]++\n i = -2\n }\n }\n if (i === -1) {\n // didn't increment anything\n this.prerelease.push(0)\n }\n }\n if (identifier) {\n // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n if (isNaN(this.prerelease[1])) {\n this.prerelease = [identifier, 0]\n }\n } else {\n this.prerelease = [identifier, 0]\n }\n }\n break\n\n default:\n throw new Error(`invalid increment argument: ${release}`)\n }\n this.format()\n this.raw = this.version\n return this\n }\n}\n\nmodule.exports = SemVer\n","const parse = require('./parse')\nconst clean = (version, options) => {\n const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n return s ? s.version : null\n}\nmodule.exports = clean\n","const eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n switch (op) {\n case '===':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a === b\n\n case '!==':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a !== b\n\n case '':\n case '=':\n case '==':\n return eq(a, b, loose)\n\n case '!=':\n return neq(a, b, loose)\n\n case '>':\n return gt(a, b, loose)\n\n case '>=':\n return gte(a, b, loose)\n\n case '<':\n return lt(a, b, loose)\n\n case '<=':\n return lte(a, b, loose)\n\n default:\n throw new TypeError(`Invalid operator: ${op}`)\n }\n}\nmodule.exports = cmp\n","const SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version === 'number') {\n version = String(version)\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n options = options || {}\n\n let match = null\n if (!options.rtl) {\n match = version.match(re[t.COERCE])\n } else {\n // Find the right-most coercible string that does not share\n // a terminus with a more left-ward coercible string.\n // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n //\n // Walk through the string checking with a /g regexp\n // Manually set the index so as to pick up overlapping matches.\n // Stop when we get a match that ends at the string end, since no\n // coercible string can be more right-ward without the same terminus.\n let next\n while ((next = re[t.COERCERTL].exec(version)) &&\n (!match || match.index + match[0].length !== version.length)\n ) {\n if (!match ||\n next.index + next[0].length !== match.index + match[0].length) {\n match = next\n }\n re[t.COERCERTL].lastIndex = next.index + next[1].length + next[2].length\n }\n // leave it in a clean state\n re[t.COERCERTL].lastIndex = -1\n }\n\n if (match === null) {\n return null\n }\n\n return parse(`${match[2]}.${match[3] || '0'}.${match[4] || '0'}`, options)\n}\nmodule.exports = coerce\n","const SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n const versionA = new SemVer(a, loose)\n const versionB = new SemVer(b, loose)\n return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n","const compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n","const SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n","const parse = require('./parse')\nconst eq = require('./eq')\n\nconst diff = (version1, version2) => {\n if (eq(version1, version2)) {\n return null\n } else {\n const v1 = parse(version1)\n const v2 = parse(version2)\n const hasPre = v1.prerelease.length || v2.prerelease.length\n const prefix = hasPre ? 'pre' : ''\n const defaultResult = hasPre ? 'prerelease' : ''\n for (const key in v1) {\n if (key === 'major' || key === 'minor' || key === 'patch') {\n if (v1[key] !== v2[key]) {\n return prefix + key\n }\n }\n }\n return defaultResult // may be undefined\n }\n}\nmodule.exports = diff\n","const compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n","const compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n","const compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n","const SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier) => {\n if (typeof (options) === 'string') {\n identifier = options\n options = undefined\n }\n\n try {\n return new SemVer(\n version instanceof SemVer ? version.version : version,\n options\n ).inc(release, identifier).version\n } catch (er) {\n return null\n }\n}\nmodule.exports = inc\n","const compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n","const compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n","const SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n","const SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n","const compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n","const { MAX_LENGTH } = require('../internal/constants')\nconst { re, t } = require('../internal/re')\nconst SemVer = require('../classes/semver')\n\nconst parseOptions = require('../internal/parse-options')\nconst parse = (version, options) => {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n if (version.length > MAX_LENGTH) {\n return null\n }\n\n const r = options.loose ? re[t.LOOSE] : re[t.FULL]\n if (!r.test(version)) {\n return null\n }\n\n try {\n return new SemVer(version, options)\n } catch (er) {\n return null\n }\n}\n\nmodule.exports = parse\n","const SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n","const parse = require('./parse')\nconst prerelease = (version, options) => {\n const parsed = parse(version, options)\n return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n","const compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n","const compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n","const Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n try {\n range = new Range(range, options)\n } catch (er) {\n return false\n }\n return range.test(version)\n}\nmodule.exports = satisfies\n","const compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n","const parse = require('./parse')\nconst valid = (version, options) => {\n const v = parse(version, options)\n return v ? v.version : null\n}\nmodule.exports = valid\n","// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n parse,\n valid,\n clean,\n inc,\n diff,\n major,\n minor,\n patch,\n prerelease,\n compare,\n rcompare,\n compareLoose,\n compareBuild,\n sort,\n rsort,\n gt,\n lt,\n eq,\n neq,\n gte,\n lte,\n cmp,\n coerce,\n Comparator,\n Range,\n satisfies,\n toComparators,\n maxSatisfying,\n minSatisfying,\n minVersion,\n validRange,\n outside,\n gtr,\n ltr,\n intersects,\n simplifyRange,\n subset,\n SemVer,\n re: internalRe.re,\n src: internalRe.src,\n tokens: internalRe.t,\n SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n compareIdentifiers: identifiers.compareIdentifiers,\n rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n","// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\nmodule.exports = {\n SEMVER_SPEC_VERSION,\n MAX_LENGTH,\n MAX_SAFE_INTEGER,\n MAX_SAFE_COMPONENT_LENGTH,\n}\n","const debug = (\n typeof process === 'object' &&\n process.env &&\n process.env.NODE_DEBUG &&\n /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n : () => {}\n\nmodule.exports = debug\n","const numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n const anum = numeric.test(a)\n const bnum = numeric.test(b)\n\n if (anum && bnum) {\n a = +a\n b = +b\n }\n\n return a === b ? 0\n : (anum && !bnum) ? -1\n : (bnum && !anum) ? 1\n : a < b ? -1\n : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n compareIdentifiers,\n rcompareIdentifiers,\n}\n","// parse out just the options we care about so we always get a consistent\n// obj with keys in a consistent order.\nconst opts = ['includePrerelease', 'loose', 'rtl']\nconst parseOptions = options =>\n !options ? {}\n : typeof options !== 'object' ? { loose: true }\n : opts.filter(k => options[k]).reduce((o, k) => {\n o[k] = true\n return o\n }, {})\nmodule.exports = parseOptions\n","const { MAX_SAFE_COMPONENT_LENGTH } = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst src = exports.src = []\nconst t = exports.t = {}\nlet R = 0\n\nconst createToken = (name, value, isGlobal) => {\n const index = R++\n debug(name, index, value)\n t[name] = index\n src[index] = value\n re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '[0-9]+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', '\\\\d*[a-zA-Z-][a-zA-Z0-9-]*')\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', '[0-9A-Za-z-]+')\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups. The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:${src[t.PRERELEASE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:${src[t.PRERELEASELOOSE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCE', `${'(^|[^\\\\d])' +\n '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAIN]})` +\n `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n","// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n","const Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n r1 = new Range(r1, options)\n r2 = new Range(r2, options)\n return r1.intersects(r2)\n}\nmodule.exports = intersects\n","const outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n","const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n let max = null\n let maxSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!max || maxSV.compare(v) === -1) {\n // compare(max, v, true)\n max = v\n maxSV = new SemVer(max, options)\n }\n }\n })\n return max\n}\nmodule.exports = maxSatisfying\n","const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n let min = null\n let minSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!min || minSV.compare(v) === 1) {\n // compare(min, v, true)\n min = v\n minSV = new SemVer(min, options)\n }\n }\n })\n return min\n}\nmodule.exports = minSatisfying\n","const SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n range = new Range(range, loose)\n\n let minver = new SemVer('0.0.0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = new SemVer('0.0.0-0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = null\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let setMin = null\n comparators.forEach((comparator) => {\n // Clone to avoid manipulating the comparator's semver object.\n const compver = new SemVer(comparator.semver.version)\n switch (comparator.operator) {\n case '>':\n if (compver.prerelease.length === 0) {\n compver.patch++\n } else {\n compver.prerelease.push(0)\n }\n compver.raw = compver.format()\n /* fallthrough */\n case '':\n case '>=':\n if (!setMin || gt(compver, setMin)) {\n setMin = compver\n }\n break\n case '<':\n case '<=':\n /* Ignore maximum versions */\n break\n /* istanbul ignore next */\n default:\n throw new Error(`Unexpected operation: ${comparator.operator}`)\n }\n })\n if (setMin && (!minver || gt(minver, setMin))) {\n minver = setMin\n }\n }\n\n if (minver && range.test(minver)) {\n return minver\n }\n\n return null\n}\nmodule.exports = minVersion\n","const SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n version = new SemVer(version, options)\n range = new Range(range, options)\n\n let gtfn, ltefn, ltfn, comp, ecomp\n switch (hilo) {\n case '>':\n gtfn = gt\n ltefn = lte\n ltfn = lt\n comp = '>'\n ecomp = '>='\n break\n case '<':\n gtfn = lt\n ltefn = gte\n ltfn = gt\n comp = '<'\n ecomp = '<='\n break\n default:\n throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n }\n\n // If it satisfies the range it is not outside\n if (satisfies(version, range, options)) {\n return false\n }\n\n // From now on, variable terms are as if we're in \"gtr\" mode.\n // but note that everything is flipped for the \"ltr\" function.\n\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let high = null\n let low = null\n\n comparators.forEach((comparator) => {\n if (comparator.semver === ANY) {\n comparator = new Comparator('>=0.0.0')\n }\n high = high || comparator\n low = low || comparator\n if (gtfn(comparator.semver, high.semver, options)) {\n high = comparator\n } else if (ltfn(comparator.semver, low.semver, options)) {\n low = comparator\n }\n })\n\n // If the edge version comparator has a operator then our version\n // isn't outside it\n if (high.operator === comp || high.operator === ecomp) {\n return false\n }\n\n // If the lowest version comparator has an operator and our version\n // is less than it then it isn't higher than the range\n if ((!low.operator || low.operator === comp) &&\n ltefn(version, low.semver)) {\n return false\n } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n return false\n }\n }\n return true\n}\n\nmodule.exports = outside\n","// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n const set = []\n let first = null\n let prev = null\n const v = versions.sort((a, b) => compare(a, b, options))\n for (const version of v) {\n const included = satisfies(version, range, options)\n if (included) {\n prev = version\n if (!first) {\n first = version\n }\n } else {\n if (prev) {\n set.push([first, prev])\n }\n prev = null\n first = null\n }\n }\n if (first) {\n set.push([first, null])\n }\n\n const ranges = []\n for (const [min, max] of set) {\n if (min === max) {\n ranges.push(min)\n } else if (!max && min === v[0]) {\n ranges.push('*')\n } else if (!max) {\n ranges.push(`>=${min}`)\n } else if (min === v[0]) {\n ranges.push(`<=${max}`)\n } else {\n ranges.push(`${min} - ${max}`)\n }\n }\n const simplified = ranges.join(' || ')\n const original = typeof range.raw === 'string' ? range.raw : String(range)\n return simplified.length < original.length ? simplified : range\n}\n","const Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n// some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n// - If C is only the ANY comparator, return true\n// - Else if in prerelease mode, return false\n// - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n// - if in prerelease mode, return true\n// - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n// - If GT, and EQ does not satisfy GT, return true (null set)\n// - If LT, and EQ does not satisfy LT, return true (null set)\n// - If EQ satisfies every C, return true\n// - Else return false\n// - If GT\n// - If GT.semver is lower than any > or >= comp in C, return false\n// - If GT is >=, and GT.semver does not satisfy every C, return false\n// - If GT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n// - If LT.semver is greater than any < or <= comp in C, return false\n// - If LT is <=, and LT.semver does not satisfy every C, return false\n// - If GT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n if (sub === dom) {\n return true\n }\n\n sub = new Range(sub, options)\n dom = new Range(dom, options)\n let sawNonNull = false\n\n OUTER: for (const simpleSub of sub.set) {\n for (const simpleDom of dom.set) {\n const isSub = simpleSubset(simpleSub, simpleDom, options)\n sawNonNull = sawNonNull || isSub !== null\n if (isSub) {\n continue OUTER\n }\n }\n // the null set is a subset of everything, but null simple ranges in\n // a complex range should be ignored. so if we saw a non-null range,\n // then we know this isn't a subset, but if EVERY simple range was null,\n // then it is a subset.\n if (sawNonNull) {\n return false\n }\n }\n return true\n}\n\nconst simpleSubset = (sub, dom, options) => {\n if (sub === dom) {\n return true\n }\n\n if (sub.length === 1 && sub[0].semver === ANY) {\n if (dom.length === 1 && dom[0].semver === ANY) {\n return true\n } else if (options.includePrerelease) {\n sub = [new Comparator('>=0.0.0-0')]\n } else {\n sub = [new Comparator('>=0.0.0')]\n }\n }\n\n if (dom.length === 1 && dom[0].semver === ANY) {\n if (options.includePrerelease) {\n return true\n } else {\n dom = [new Comparator('>=0.0.0')]\n }\n }\n\n const eqSet = new Set()\n let gt, lt\n for (const c of sub) {\n if (c.operator === '>' || c.operator === '>=') {\n gt = higherGT(gt, c, options)\n } else if (c.operator === '<' || c.operator === '<=') {\n lt = lowerLT(lt, c, options)\n } else {\n eqSet.add(c.semver)\n }\n }\n\n if (eqSet.size > 1) {\n return null\n }\n\n let gtltComp\n if (gt && lt) {\n gtltComp = compare(gt.semver, lt.semver, options)\n if (gtltComp > 0) {\n return null\n } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n return null\n }\n }\n\n // will iterate one or zero times\n for (const eq of eqSet) {\n if (gt && !satisfies(eq, String(gt), options)) {\n return null\n }\n\n if (lt && !satisfies(eq, String(lt), options)) {\n return null\n }\n\n for (const c of dom) {\n if (!satisfies(eq, String(c), options)) {\n return false\n }\n }\n\n return true\n }\n\n let higher, lower\n let hasDomLT, hasDomGT\n // if the subset has a prerelease, we need a comparator in the superset\n // with the same tuple and a prerelease, or it's not a subset\n let needDomLTPre = lt &&\n !options.includePrerelease &&\n lt.semver.prerelease.length ? lt.semver : false\n let needDomGTPre = gt &&\n !options.includePrerelease &&\n gt.semver.prerelease.length ? gt.semver : false\n // exception: <1.2.3-0 is the same as <1.2.3\n if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n needDomLTPre = false\n }\n\n for (const c of dom) {\n hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n if (gt) {\n if (needDomGTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomGTPre.major &&\n c.semver.minor === needDomGTPre.minor &&\n c.semver.patch === needDomGTPre.patch) {\n needDomGTPre = false\n }\n }\n if (c.operator === '>' || c.operator === '>=') {\n higher = higherGT(gt, c, options)\n if (higher === c && higher !== gt) {\n return false\n }\n } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n return false\n }\n }\n if (lt) {\n if (needDomLTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomLTPre.major &&\n c.semver.minor === needDomLTPre.minor &&\n c.semver.patch === needDomLTPre.patch) {\n needDomLTPre = false\n }\n }\n if (c.operator === '<' || c.operator === '<=') {\n lower = lowerLT(lt, c, options)\n if (lower === c && lower !== lt) {\n return false\n }\n } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n return false\n }\n }\n if (!c.operator && (lt || gt) && gtltComp !== 0) {\n return false\n }\n }\n\n // if there was a < or >, and nothing in the dom, then must be false\n // UNLESS it was limited by another range in the other direction.\n // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n if (gt && hasDomLT && !lt && gtltComp !== 0) {\n return false\n }\n\n if (lt && hasDomGT && !gt && gtltComp !== 0) {\n return false\n }\n\n // we needed a prerelease range in a specific tuple, but didn't get one\n // then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,\n // because it includes prereleases in the 1.2.3 tuple\n if (needDomGTPre || needDomLTPre) {\n return false\n }\n\n return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp > 0 ? a\n : comp < 0 ? b\n : b.operator === '>' && a.operator === '>=' ? b\n : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp < 0 ? a\n : comp > 0 ? b\n : b.operator === '<' && a.operator === '<=' ? b\n : a\n}\n\nmodule.exports = subset\n","const Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n new Range(range, options).set\n .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n","const Range = require('../classes/range')\nconst validRange = (range, options) => {\n try {\n // Return '*' instead of '' so that truthiness works.\n // This will throw if it's invalid anyway\n return new Range(range, options).range || '*'\n } catch (er) {\n return null\n }\n}\nmodule.exports = validRange\n","/*\nCopyright spdx-correct.js contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nvar parse = require('spdx-expression-parse')\nvar spdxLicenseIds = require('spdx-license-ids')\n\nfunction valid (string) {\n try {\n parse(string)\n return true\n } catch (error) {\n return false\n }\n}\n\n// Common transpositions of license identifier acronyms\nvar transpositions = [\n ['APGL', 'AGPL'],\n ['Gpl', 'GPL'],\n ['GLP', 'GPL'],\n ['APL', 'Apache'],\n ['ISD', 'ISC'],\n ['GLP', 'GPL'],\n ['IST', 'ISC'],\n ['Claude', 'Clause'],\n [' or later', '+'],\n [' International', ''],\n ['GNU', 'GPL'],\n ['GUN', 'GPL'],\n ['+', ''],\n ['GNU GPL', 'GPL'],\n ['GNU/GPL', 'GPL'],\n ['GNU GLP', 'GPL'],\n ['GNU General Public License', 'GPL'],\n ['Gnu public license', 'GPL'],\n ['GNU Public License', 'GPL'],\n ['GNU GENERAL PUBLIC LICENSE', 'GPL'],\n ['MTI', 'MIT'],\n ['Mozilla Public License', 'MPL'],\n ['Universal Permissive License', 'UPL'],\n ['WTH', 'WTF'],\n ['-License', '']\n]\n\nvar TRANSPOSED = 0\nvar CORRECT = 1\n\n// Simple corrections to nearly valid identifiers.\nvar transforms = [\n // e.g. 'mit'\n function (argument) {\n return argument.toUpperCase()\n },\n // e.g. 'MIT '\n function (argument) {\n return argument.trim()\n },\n // e.g. 'M.I.T.'\n function (argument) {\n return argument.replace(/\\./g, '')\n },\n // e.g. 'Apache- 2.0'\n function (argument) {\n return argument.replace(/\\s+/g, '')\n },\n // e.g. 'CC BY 4.0''\n function (argument) {\n return argument.replace(/\\s+/g, '-')\n },\n // e.g. 'LGPLv2.1'\n function (argument) {\n return argument.replace('v', '-')\n },\n // e.g. 'Apache 2.0'\n function (argument) {\n return argument.replace(/,?\\s*(\\d)/, '-$1')\n },\n // e.g. 'GPL 2'\n function (argument) {\n return argument.replace(/,?\\s*(\\d)/, '-$1.0')\n },\n // e.g. 'Apache Version 2.0'\n function (argument) {\n return argument\n .replace(/,?\\s*(V\\.|v\\.|V|v|Version|version)\\s*(\\d)/, '-$2')\n },\n // e.g. 'Apache Version 2'\n function (argument) {\n return argument\n .replace(/,?\\s*(V\\.|v\\.|V|v|Version|version)\\s*(\\d)/, '-$2.0')\n },\n // e.g. 'ZLIB'\n function (argument) {\n return argument[0].toUpperCase() + argument.slice(1)\n },\n // e.g. 'MPL/2.0'\n function (argument) {\n return argument.replace('/', '-')\n },\n // e.g. 'Apache 2'\n function (argument) {\n return argument\n .replace(/\\s*V\\s*(\\d)/, '-$1')\n .replace(/(\\d)$/, '$1.0')\n },\n // e.g. 'GPL-2.0', 'GPL-3.0'\n function (argument) {\n if (argument.indexOf('3.0') !== -1) {\n return argument + '-or-later'\n } else {\n return argument + '-only'\n }\n },\n // e.g. 'GPL-2.0-'\n function (argument) {\n return argument + 'only'\n },\n // e.g. 'GPL2'\n function (argument) {\n return argument.replace(/(\\d)$/, '-$1.0')\n },\n // e.g. 'BSD 3'\n function (argument) {\n return argument.replace(/(-| )?(\\d)$/, '-$2-Clause')\n },\n // e.g. 'BSD clause 3'\n function (argument) {\n return argument.replace(/(-| )clause(-| )(\\d)/, '-$3-Clause')\n },\n // e.g. 'New BSD license'\n function (argument) {\n return argument.replace(/\\b(Modified|New|Revised)(-| )?BSD((-| )License)?/i, 'BSD-3-Clause')\n },\n // e.g. 'Simplified BSD license'\n function (argument) {\n return argument.replace(/\\bSimplified(-| )?BSD((-| )License)?/i, 'BSD-2-Clause')\n },\n // e.g. 'Free BSD license'\n function (argument) {\n return argument.replace(/\\b(Free|Net)(-| )?BSD((-| )License)?/i, 'BSD-2-Clause-$1BSD')\n },\n // e.g. 'Clear BSD license'\n function (argument) {\n return argument.replace(/\\bClear(-| )?BSD((-| )License)?/i, 'BSD-3-Clause-Clear')\n },\n // e.g. 'Old BSD License'\n function (argument) {\n return argument.replace(/\\b(Old|Original)(-| )?BSD((-| )License)?/i, 'BSD-4-Clause')\n },\n // e.g. 'BY-NC-4.0'\n function (argument) {\n return 'CC-' + argument\n },\n // e.g. 'BY-NC'\n function (argument) {\n return 'CC-' + argument + '-4.0'\n },\n // e.g. 'Attribution-NonCommercial'\n function (argument) {\n return argument\n .replace('Attribution', 'BY')\n .replace('NonCommercial', 'NC')\n .replace('NoDerivatives', 'ND')\n .replace(/ (\\d)/, '-$1')\n .replace(/ ?International/, '')\n },\n // e.g. 'Attribution-NonCommercial'\n function (argument) {\n return 'CC-' +\n argument\n .replace('Attribution', 'BY')\n .replace('NonCommercial', 'NC')\n .replace('NoDerivatives', 'ND')\n .replace(/ (\\d)/, '-$1')\n .replace(/ ?International/, '') +\n '-4.0'\n }\n]\n\nvar licensesWithVersions = spdxLicenseIds\n .map(function (id) {\n var match = /^(.*)-\\d+\\.\\d+$/.exec(id)\n return match\n ? [match[0], match[1]]\n : [id, null]\n })\n .reduce(function (objectMap, item) {\n var key = item[1]\n objectMap[key] = objectMap[key] || []\n objectMap[key].push(item[0])\n return objectMap\n }, {})\n\nvar licensesWithOneVersion = Object.keys(licensesWithVersions)\n .map(function makeEntries (key) {\n return [key, licensesWithVersions[key]]\n })\n .filter(function identifySoleVersions (item) {\n return (\n // Licenses has just one valid version suffix.\n item[1].length === 1 &&\n item[0] !== null &&\n // APL will be considered Apache, rather than APL-1.0\n item[0] !== 'APL'\n )\n })\n .map(function createLastResorts (item) {\n return [item[0], item[1][0]]\n })\n\nlicensesWithVersions = undefined\n\n// If all else fails, guess that strings containing certain substrings\n// meant to identify certain licenses.\nvar lastResorts = [\n ['UNLI', 'Unlicense'],\n ['WTF', 'WTFPL'],\n ['2 CLAUSE', 'BSD-2-Clause'],\n ['2-CLAUSE', 'BSD-2-Clause'],\n ['3 CLAUSE', 'BSD-3-Clause'],\n ['3-CLAUSE', 'BSD-3-Clause'],\n ['AFFERO', 'AGPL-3.0-or-later'],\n ['AGPL', 'AGPL-3.0-or-later'],\n ['APACHE', 'Apache-2.0'],\n ['ARTISTIC', 'Artistic-2.0'],\n ['Affero', 'AGPL-3.0-or-later'],\n ['BEER', 'Beerware'],\n ['BOOST', 'BSL-1.0'],\n ['BSD', 'BSD-2-Clause'],\n ['CDDL', 'CDDL-1.1'],\n ['ECLIPSE', 'EPL-1.0'],\n ['FUCK', 'WTFPL'],\n ['GNU', 'GPL-3.0-or-later'],\n ['LGPL', 'LGPL-3.0-or-later'],\n ['GPLV1', 'GPL-1.0-only'],\n ['GPL-1', 'GPL-1.0-only'],\n ['GPLV2', 'GPL-2.0-only'],\n ['GPL-2', 'GPL-2.0-only'],\n ['GPL', 'GPL-3.0-or-later'],\n ['MIT +NO-FALSE-ATTRIBS', 'MITNFA'],\n ['MIT', 'MIT'],\n ['MPL', 'MPL-2.0'],\n ['X11', 'X11'],\n ['ZLIB', 'Zlib']\n].concat(licensesWithOneVersion)\n\nvar SUBSTRING = 0\nvar IDENTIFIER = 1\n\nvar validTransformation = function (identifier) {\n for (var i = 0; i < transforms.length; i++) {\n var transformed = transforms[i](identifier).trim()\n if (transformed !== identifier && valid(transformed)) {\n return transformed\n }\n }\n return null\n}\n\nvar validLastResort = function (identifier) {\n var upperCased = identifier.toUpperCase()\n for (var i = 0; i < lastResorts.length; i++) {\n var lastResort = lastResorts[i]\n if (upperCased.indexOf(lastResort[SUBSTRING]) > -1) {\n return lastResort[IDENTIFIER]\n }\n }\n return null\n}\n\nvar anyCorrection = function (identifier, check) {\n for (var i = 0; i < transpositions.length; i++) {\n var transposition = transpositions[i]\n var transposed = transposition[TRANSPOSED]\n if (identifier.indexOf(transposed) > -1) {\n var corrected = identifier.replace(\n transposed,\n transposition[CORRECT]\n )\n var checked = check(corrected)\n if (checked !== null) {\n return checked\n }\n }\n }\n return null\n}\n\nmodule.exports = function (identifier, options) {\n options = options || {}\n var upgrade = options.upgrade === undefined ? true : !!options.upgrade\n function postprocess (value) {\n return upgrade ? upgradeGPLs(value) : value\n }\n var validArugment = (\n typeof identifier === 'string' &&\n identifier.trim().length !== 0\n )\n if (!validArugment) {\n throw Error('Invalid argument. Expected non-empty string.')\n }\n identifier = identifier.trim()\n if (valid(identifier)) {\n return postprocess(identifier)\n }\n var noPlus = identifier.replace(/\\+$/, '').trim()\n if (valid(noPlus)) {\n return postprocess(noPlus)\n }\n var transformed = validTransformation(identifier)\n if (transformed !== null) {\n return postprocess(transformed)\n }\n transformed = anyCorrection(identifier, function (argument) {\n if (valid(argument)) {\n return argument\n }\n return validTransformation(argument)\n })\n if (transformed !== null) {\n return postprocess(transformed)\n }\n transformed = validLastResort(identifier)\n if (transformed !== null) {\n return postprocess(transformed)\n }\n transformed = anyCorrection(identifier, validLastResort)\n if (transformed !== null) {\n return postprocess(transformed)\n }\n return null\n}\n\nfunction upgradeGPLs (value) {\n if ([\n 'GPL-1.0', 'LGPL-1.0', 'AGPL-1.0',\n 'GPL-2.0', 'LGPL-2.0', 'AGPL-2.0',\n 'LGPL-2.1'\n ].indexOf(value) !== -1) {\n return value + '-only'\n } else if ([\n 'GPL-1.0+', 'GPL-2.0+', 'GPL-3.0+',\n 'LGPL-2.0+', 'LGPL-2.1+', 'LGPL-3.0+',\n 'AGPL-1.0+', 'AGPL-3.0+'\n ].indexOf(value) !== -1) {\n return value.replace(/\\+$/, '-or-later')\n } else if (['GPL-3.0', 'LGPL-3.0', 'AGPL-3.0'].indexOf(value) !== -1) {\n return value + '-or-later'\n } else {\n return value\n }\n}\n","'use strict'\n\nvar scan = require('./scan')\nvar parse = require('./parse')\n\nmodule.exports = function (source) {\n return parse(scan(source))\n}\n","'use strict'\n\n// The ABNF grammar in the spec is totally ambiguous.\n//\n// This parser follows the operator precedence defined in the\n// `Order of Precedence and Parentheses` section.\n\nmodule.exports = function (tokens) {\n var index = 0\n\n function hasMore () {\n return index < tokens.length\n }\n\n function token () {\n return hasMore() ? tokens[index] : null\n }\n\n function next () {\n if (!hasMore()) {\n throw new Error()\n }\n index++\n }\n\n function parseOperator (operator) {\n var t = token()\n if (t && t.type === 'OPERATOR' && operator === t.string) {\n next()\n return t.string\n }\n }\n\n function parseWith () {\n if (parseOperator('WITH')) {\n var t = token()\n if (t && t.type === 'EXCEPTION') {\n next()\n return t.string\n }\n throw new Error('Expected exception after `WITH`')\n }\n }\n\n function parseLicenseRef () {\n // TODO: Actually, everything is concatenated into one string\n // for backward-compatibility but it could be better to return\n // a nice structure.\n var begin = index\n var string = ''\n var t = token()\n if (t.type === 'DOCUMENTREF') {\n next()\n string += 'DocumentRef-' + t.string + ':'\n if (!parseOperator(':')) {\n throw new Error('Expected `:` after `DocumentRef-...`')\n }\n }\n t = token()\n if (t.type === 'LICENSEREF') {\n next()\n string += 'LicenseRef-' + t.string\n return { license: string }\n }\n index = begin\n }\n\n function parseLicense () {\n var t = token()\n if (t && t.type === 'LICENSE') {\n next()\n var node = { license: t.string }\n if (parseOperator('+')) {\n node.plus = true\n }\n var exception = parseWith()\n if (exception) {\n node.exception = exception\n }\n return node\n }\n }\n\n function parseParenthesizedExpression () {\n var left = parseOperator('(')\n if (!left) {\n return\n }\n\n var expr = parseExpression()\n\n if (!parseOperator(')')) {\n throw new Error('Expected `)`')\n }\n\n return expr\n }\n\n function parseAtom () {\n return (\n parseParenthesizedExpression() ||\n parseLicenseRef() ||\n parseLicense()\n )\n }\n\n function makeBinaryOpParser (operator, nextParser) {\n return function parseBinaryOp () {\n var left = nextParser()\n if (!left) {\n return\n }\n\n if (!parseOperator(operator)) {\n return left\n }\n\n var right = parseBinaryOp()\n if (!right) {\n throw new Error('Expected expression')\n }\n return {\n left: left,\n conjunction: operator.toLowerCase(),\n right: right\n }\n }\n }\n\n var parseAnd = makeBinaryOpParser('AND', parseAtom)\n var parseExpression = makeBinaryOpParser('OR', parseAnd)\n\n var node = parseExpression()\n if (!node || hasMore()) {\n throw new Error('Syntax error')\n }\n return node\n}\n","'use strict'\n\nvar licenses = []\n .concat(require('spdx-license-ids'))\n .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n var index = 0\n\n function hasMore () {\n return index < source.length\n }\n\n // `value` can be a regexp or a string.\n // If it is recognized, the matching source string is returned and\n // the index is incremented. Otherwise `undefined` is returned.\n function read (value) {\n if (value instanceof RegExp) {\n var chars = source.slice(index)\n var match = chars.match(value)\n if (match) {\n index += match[0].length\n return match[0]\n }\n } else {\n if (source.indexOf(value, index) === index) {\n index += value.length\n return value\n }\n }\n }\n\n function skipWhitespace () {\n read(/[ ]*/)\n }\n\n function operator () {\n var string\n var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n for (var i = 0; i < possibilities.length; i++) {\n string = read(possibilities[i])\n if (string) {\n break\n }\n }\n\n if (string === '+' && index > 1 && source[index - 2] === ' ') {\n throw new Error('Space before `+`')\n }\n\n return string && {\n type: 'OPERATOR',\n string: string\n }\n }\n\n function idstring () {\n return read(/[A-Za-z0-9-.]+/)\n }\n\n function expectIdstring () {\n var string = idstring()\n if (!string) {\n throw new Error('Expected idstring at offset ' + index)\n }\n return string\n }\n\n function documentRef () {\n if (read('DocumentRef-')) {\n var string = expectIdstring()\n return { type: 'DOCUMENTREF', string: string }\n }\n }\n\n function licenseRef () {\n if (read('LicenseRef-')) {\n var string = expectIdstring()\n return { type: 'LICENSEREF', string: string }\n }\n }\n\n function identifier () {\n var begin = index\n var string = idstring()\n\n if (licenses.indexOf(string) !== -1) {\n return {\n type: 'LICENSE',\n string: string\n }\n } else if (exceptions.indexOf(string) !== -1) {\n return {\n type: 'EXCEPTION',\n string: string\n }\n }\n\n index = begin\n }\n\n // Tries to read the next token. Returns `undefined` if no token is\n // recognized.\n function parseToken () {\n // Ordering matters\n return (\n operator() ||\n documentRef() ||\n licenseRef() ||\n identifier()\n )\n }\n\n var tokens = []\n while (hasMore()) {\n skipWhitespace()\n if (!hasMore()) {\n break\n }\n\n var token = parseToken()\n if (!token) {\n throw new Error('Unexpected `' + source[index] +\n '` at offset ' + index)\n }\n\n tokens.push(token)\n }\n return tokens\n}\n","const fs = require('fs');\nconst globrex = require('globrex');\nconst { promisify } = require('util');\nconst globalyzer = require('globalyzer');\nconst { join, resolve, relative } = require('path');\nconst isHidden = /(^|[\\\\\\/])\\.[^\\\\\\/\\.]/g;\nconst readdir = promisify(fs.readdir);\nconst stat = promisify(fs.stat);\nlet CACHE = {};\n\nasync function walk(output, prefix, lexer, opts, dirname='', level=0) {\n const rgx = lexer.segments[level];\n const dir = resolve(opts.cwd, prefix, dirname);\n const files = await readdir(dir);\n const { dot, filesOnly } = opts;\n\n let i=0, len=files.length, file;\n let fullpath, relpath, stats, isMatch;\n\n for (; i < len; i++) {\n fullpath = join(dir, file=files[i]);\n relpath = dirname ? join(dirname, file) : file;\n if (!dot && isHidden.test(relpath)) continue;\n isMatch = lexer.regex.test(relpath);\n\n if ((stats=CACHE[relpath]) === void 0) {\n CACHE[relpath] = stats = fs.lstatSync(fullpath);\n }\n\n if (!stats.isDirectory()) {\n isMatch && output.push(relative(opts.cwd, fullpath));\n continue;\n }\n\n if (rgx && !rgx.test(file)) continue;\n !filesOnly && isMatch && output.push(join(prefix, relpath));\n\n await walk(output, prefix, lexer, opts, relpath, rgx && rgx.toString() !== lexer.globstar && level + 1);\n }\n}\n\n/**\n * Find files using bash-like globbing.\n * All paths are normalized compared to node-glob.\n * @param {String} str Glob string\n * @param {String} [options.cwd='.'] Current working directory\n * @param {Boolean} [options.dot=false] Include dotfile matches\n * @param {Boolean} [options.absolute=false] Return absolute paths\n * @param {Boolean} [options.filesOnly=false] Do not include folders if true\n * @param {Boolean} [options.flush=false] Reset cache object\n * @returns {Array} array containing matching files\n */\nmodule.exports = async function (str, opts={}) {\n if (!str) return [];\n\n let glob = globalyzer(str);\n\n opts.cwd = opts.cwd || '.';\n\n if (!glob.isGlob) {\n try {\n let resolved = resolve(opts.cwd, str);\n let dirent = await stat(resolved);\n if (opts.filesOnly && !dirent.isFile()) return [];\n\n return opts.absolute ? [resolved] : [str];\n } catch (err) {\n if (err.code != 'ENOENT') throw err;\n\n return [];\n }\n }\n\n if (opts.flush) CACHE = {};\n\n let matches = [];\n const { path } = globrex(glob.glob, { filepath:true, globstar:true, extended:true });\n\n path.globstar = path.globstar.toString();\n await walk(matches, glob.base, path, opts, '.', 0);\n\n return opts.absolute ? matches.map(x => resolve(opts.cwd, x)) : matches;\n};\n","var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n 'license should be ' +\n 'a valid SPDX license expression (without \"LicenseRef\"), ' +\n '\"UNLICENSED\", or ' +\n '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n if (ast.hasOwnProperty('license')) {\n var license = ast.license;\n return (\n startsWith('LicenseRef', license) ||\n startsWith('DocumentRef', license)\n );\n } else {\n return (\n usesLicenseRef(ast.left) ||\n usesLicenseRef(ast.right)\n );\n }\n}\n\nmodule.exports = function(argument) {\n var ast;\n\n try {\n ast = parse(argument);\n } catch (e) {\n var match\n if (\n argument === 'UNLICENSED' ||\n argument === 'UNLICENCED'\n ) {\n return {\n validForOldPackages: true,\n validForNewPackages: true,\n unlicensed: true\n };\n } else if (match = fileReferenceRE.exec(argument)) {\n return {\n validForOldPackages: true,\n validForNewPackages: true,\n inFile: match[1]\n };\n } else {\n var result = {\n validForOldPackages: false,\n validForNewPackages: false,\n warnings: [genericWarning]\n };\n if (argument.trim().length !== 0) {\n var corrected = correct(argument);\n if (corrected) {\n result.warnings.push(\n 'license is similar to the valid expression \"' + corrected + '\"'\n );\n }\n }\n return result;\n }\n }\n\n if (usesLicenseRef(ast)) {\n return {\n validForNewPackages: false,\n validForOldPackages: false,\n spdx: true,\n warnings: [genericWarning]\n };\n } else {\n return {\n validForNewPackages: true,\n validForOldPackages: true,\n spdx: true\n };\n }\n};\n","'use strict'\nmodule.exports = function (Yallist) {\n Yallist.prototype[Symbol.iterator] = function* () {\n for (let walker = this.head; walker; walker = walker.next) {\n yield walker.value\n }\n }\n}\n","'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n var self = this\n if (!(self instanceof Yallist)) {\n self = new Yallist()\n }\n\n self.tail = null\n self.head = null\n self.length = 0\n\n if (list && typeof list.forEach === 'function') {\n list.forEach(function (item) {\n self.push(item)\n })\n } else if (arguments.length > 0) {\n for (var i = 0, l = arguments.length; i < l; i++) {\n self.push(arguments[i])\n }\n }\n\n return self\n}\n\nYallist.prototype.removeNode = function (node) {\n if (node.list !== this) {\n throw new Error('removing node which does not belong to this list')\n }\n\n var next = node.next\n var prev = node.prev\n\n if (next) {\n next.prev = prev\n }\n\n if (prev) {\n prev.next = next\n }\n\n if (node === this.head) {\n this.head = next\n }\n if (node === this.tail) {\n this.tail = prev\n }\n\n node.list.length--\n node.next = null\n node.prev = null\n node.list = null\n\n return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n if (node === this.head) {\n return\n }\n\n if (node.list) {\n node.list.removeNode(node)\n }\n\n var head = this.head\n node.list = this\n node.next = head\n if (head) {\n head.prev = node\n }\n\n this.head = node\n if (!this.tail) {\n this.tail = node\n }\n this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n if (node === this.tail) {\n return\n }\n\n if (node.list) {\n node.list.removeNode(node)\n }\n\n var tail = this.tail\n node.list = this\n node.prev = tail\n if (tail) {\n tail.next = node\n }\n\n this.tail = node\n if (!this.head) {\n this.head = node\n }\n this.length++\n}\n\nYallist.prototype.push = function () {\n for (var i = 0, l = arguments.length; i < l; i++) {\n push(this, arguments[i])\n }\n return this.length\n}\n\nYallist.prototype.unshift = function () {\n for (var i = 0, l = arguments.length; i < l; i++) {\n unshift(this, arguments[i])\n }\n return this.length\n}\n\nYallist.prototype.pop = function () {\n if (!this.tail) {\n return undefined\n }\n\n var res = this.tail.value\n this.tail = this.tail.prev\n if (this.tail) {\n this.tail.next = null\n } else {\n this.head = null\n }\n this.length--\n return res\n}\n\nYallist.prototype.shift = function () {\n if (!this.head) {\n return undefined\n }\n\n var res = this.head.value\n this.head = this.head.next\n if (this.head) {\n this.head.prev = null\n } else {\n this.tail = null\n }\n this.length--\n return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n thisp = thisp || this\n for (var walker = this.head, i = 0; walker !== null; i++) {\n fn.call(thisp, walker.value, i, this)\n walker = walker.next\n }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n thisp = thisp || this\n for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n fn.call(thisp, walker.value, i, this)\n walker = walker.prev\n }\n}\n\nYallist.prototype.get = function (n) {\n for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n // abort out of the list early if we hit a cycle\n walker = walker.next\n }\n if (i === n && walker !== null) {\n return walker.value\n }\n}\n\nYallist.prototype.getReverse = function (n) {\n for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n // abort out of the list early if we hit a cycle\n walker = walker.prev\n }\n if (i === n && walker !== null) {\n return walker.value\n }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n thisp = thisp || this\n var res = new Yallist()\n for (var walker = this.head; walker !== null;) {\n res.push(fn.call(thisp, walker.value, this))\n walker = walker.next\n }\n return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n thisp = thisp || this\n var res = new Yallist()\n for (var walker = this.tail; walker !== null;) {\n res.push(fn.call(thisp, walker.value, this))\n walker = walker.prev\n }\n return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n var acc\n var walker = this.head\n if (arguments.length > 1) {\n acc = initial\n } else if (this.head) {\n walker = this.head.next\n acc = this.head.value\n } else {\n throw new TypeError('Reduce of empty list with no initial value')\n }\n\n for (var i = 0; walker !== null; i++) {\n acc = fn(acc, walker.value, i)\n walker = walker.next\n }\n\n return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n var acc\n var walker = this.tail\n if (arguments.length > 1) {\n acc = initial\n } else if (this.tail) {\n walker = this.tail.prev\n acc = this.tail.value\n } else {\n throw new TypeError('Reduce of empty list with no initial value')\n }\n\n for (var i = this.length - 1; walker !== null; i--) {\n acc = fn(acc, walker.value, i)\n walker = walker.prev\n }\n\n return acc\n}\n\nYallist.prototype.toArray = function () {\n var arr = new Array(this.length)\n for (var i = 0, walker = this.head; walker !== null; i++) {\n arr[i] = walker.value\n walker = walker.next\n }\n return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n var arr = new Array(this.length)\n for (var i = 0, walker = this.tail; walker !== null; i++) {\n arr[i] = walker.value\n walker = walker.prev\n }\n return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n to = to || this.length\n if (to < 0) {\n to += this.length\n }\n from = from || 0\n if (from < 0) {\n from += this.length\n }\n var ret = new Yallist()\n if (to < from || to < 0) {\n return ret\n }\n if (from < 0) {\n from = 0\n }\n if (to > this.length) {\n to = this.length\n }\n for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n walker = walker.next\n }\n for (; walker !== null && i < to; i++, walker = walker.next) {\n ret.push(walker.value)\n }\n return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n to = to || this.length\n if (to < 0) {\n to += this.length\n }\n from = from || 0\n if (from < 0) {\n from += this.length\n }\n var ret = new Yallist()\n if (to < from || to < 0) {\n return ret\n }\n if (from < 0) {\n from = 0\n }\n if (to > this.length) {\n to = this.length\n }\n for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n walker = walker.prev\n }\n for (; walker !== null && i > from; i--, walker = walker.prev) {\n ret.push(walker.value)\n }\n return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n if (start > this.length) {\n start = this.length - 1\n }\n if (start < 0) {\n start = this.length + start;\n }\n\n for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n walker = walker.next\n }\n\n var ret = []\n for (var i = 0; walker && i < deleteCount; i++) {\n ret.push(walker.value)\n walker = this.removeNode(walker)\n }\n if (walker === null) {\n walker = this.tail\n }\n\n if (walker !== this.head && walker !== this.tail) {\n walker = walker.prev\n }\n\n for (var i = 0; i < nodes.length; i++) {\n walker = insert(this, walker, nodes[i])\n }\n return ret;\n}\n\nYallist.prototype.reverse = function () {\n var head = this.head\n var tail = this.tail\n for (var walker = head; walker !== null; walker = walker.prev) {\n var p = walker.prev\n walker.prev = walker.next\n walker.next = p\n }\n this.head = tail\n this.tail = head\n return this\n}\n\nfunction insert (self, node, value) {\n var inserted = node === self.head ?\n new Node(value, null, node, self) :\n new Node(value, node, node.next, self)\n\n if (inserted.next === null) {\n self.tail = inserted\n }\n if (inserted.prev === null) {\n self.head = inserted\n }\n\n self.length++\n\n return inserted\n}\n\nfunction push (self, item) {\n self.tail = new Node(item, self.tail, null, self)\n if (!self.head) {\n self.head = self.tail\n }\n self.length++\n}\n\nfunction unshift (self, item) {\n self.head = new Node(item, null, self.head, self)\n if (!self.tail) {\n self.tail = self.head\n }\n self.length++\n}\n\nfunction Node (value, prev, next, list) {\n if (!(this instanceof Node)) {\n return new Node(value, prev, next, list)\n }\n\n this.list = list\n this.value = value\n\n if (prev) {\n prev.next = this\n this.prev = prev\n } else {\n this.prev = null\n }\n\n if (next) {\n next.prev = this\n this.next = next\n } else {\n this.next = null\n }\n}\n\ntry {\n // add if support for Symbol.iterator is present\n require('./iterator.js')(Yallist)\n} catch (er) {}\n"],"names":["parseArgs","args","length","waitFor","opts","slice","iterate","_len","arguments","Array","_key","parsed","abort","Promise","_","reject","signal","addEventListener","this","reason","once","next","async","value","race","Symbol","asyncIterator","ParallelGroup","task","tasks","stats","done","failed","status","_stop","stop","complexity","cache","Map","get","id","undefined","Math","max","super","set","SequenceGroup","_stopped","_currentTask","off","obs","listener","subscribe","data","source","key","on","resolve","splitKey","idx","indexOf","listeners","Set","emit","add","delete","unsubscribe","Condition","check","_value","condition","_events","constructor","map","mlt","sources","Object","entries","getSource","src","Error","part","subkey","multiplexer","group","Lock","_locked","_count","release","fn","acquire","locked","ERROR_MESSAGE","prototype","toStr","toString","funcType","module","exports","that","target","call","TypeError","bound","binder","result","apply","concat","boundLength","boundArgs","i","push","Function","join","Empty","implementation","bind","os","path","isWin","platform","CHARS","STRICT","RELAXED","isglob","str","strict","match","rgx","exec","index","open","close","n","pattern","glob","base","includes","split","test","dirname","replace","parent","isGlob","substr","startsWith","process","SEP","SEP_ESC","GLOBSTAR_SEGMENT","WILDCARD_SEGMENT","extended","globstar","filepath","flags","regex","segment","segments","inGroup","inRange","ext","last","only","RegExp","c","prevChar","starCount","nextChar","type","pop","hasOwnProperty","url","safeUrl","u","URL","lastIndexOfBefore","char","beforeChar","startPosition","lastIndexOf","Infinity","giturl","gitHosts","protocols","correctedUrl","arg","firstHash","firstSlash","secondSlash","firstColon","firstSpace","firstAt","spaceOnlyAfterHash","atOnlyAfterHash","colonOnlyAfterHash","secondSlashOnlyAfterHash","hasSlash","doesNotEndWithSlash","endsWith","doesNotStartWithDot","isGitHubShorthand","proto","correctProtocol","lastColonBeforeHash","correctUrl","gitHostShortcut","byShortcut","protocol","gitHostDomain","byDomain","hostname","gitHostName","gitHostInfo","auth","username","password","committish","user","project","defaultRepresentation","pathname","lastSlash","decodeURIComponent","hash","extract","name","err","URIError","maybeJoin","every","maybeEncode","encodeURIComponent","formatHashFragment","f","toLowerCase","defaults","sshtemplate","domain","sshurltemplate","edittemplate","editpath","browsetemplate","treepath","browsetreetemplate","fragment","hashformat","browseblobtemplate","blobpath","docstemplate","httpstemplate","filetemplate","shortcuttemplate","pathtemplate","bugstemplate","hosts","github","gittemplate","tarballtemplate","bitbucket","aux","gitlab","gist","sourcehut","host","assign","LRU","fromUrl","GitHost","default","static","JSON","stringify","has","hostArgs","template","options","noCommittish","noGitPlus","ssh","sshurl","browse","browseFile","docs","bugs","https","git","shortcut","tarball","file","edit","getDefaultRepresentation","addHost","specifierIncluded","current","specifier","nodeParts","parts","op","versionParts","cur","parseInt","ver","matchesRange","range","specifiers","x","nodeVersion","specifierValue","versions","node","versionIncluded","Yallist","MAX","LENGTH","LENGTH_CALCULATOR","ALLOW_STALE","MAX_AGE","DISPOSE","NO_DISPOSE_ON_SET","LRU_LIST","CACHE","UPDATE_AGE_ON_GET","naiveLength","self","doUse","hit","isStale","del","now","Date","unshiftNode","maxAge","diff","trim","walker","tail","prev","removeNode","Entry","forEachStep","thisp","lc","stale","dispose","noDisposeOnSet","updateAgeOnGet","reset","mL","allowStale","mA","lengthCalculator","lC","forEach","itemCount","rforEach","head","keys","toArray","k","values","dump","v","e","filter","h","dumpLru","len","item","unshift","peek","load","arr","l","expiresAt","prune","perf","performance","warned","deprecatedOption","opt","instead","code","shouldWarn","warn","LRUCache","deprecatedMethod","method","getOwnPropertyDescriptor","noDeprecation","what","emitWarning","isPosInt","floor","isFinite","getUintArray","pow","Uint8Array","Uint16Array","Uint32Array","Number","MAX_SAFE_INTEGER","ZeroArray","size","fill","Stack","UintArray","heap","ttl","ttlResolution","ttlAutopurge","disposeAfter","noUpdateTTL","maxSize","sizeCalculation","keyMap","keyList","valList","free","initialFill","disposed","initializeSizeTracking","initializeTTLTracking","ttls","starts","setItemTTL","t","setTimeout","unref","updateItemAge","cachedNow","getNow","calculatedSize","sizes","removeItemSize","addItemSize","s","evict","j","isValidIndex","indexes","rindexes","iterator","find","getOptions","purgeStale","deleted","entry","clear","newIndex","oldVal","moveToTail","shift","val","connect","p","field","deprecatedProperty","hasSticky","sticky","isRegExp","o","isObject","isArray","reCapture","reUnion","regexps","regexpOrLiteral","obj","ignoreCase","global","multiline","pad","ruleOptions","include","defaultType","lineBreaks","error","fallback","shouldThrow","sort","a","b","toRules","spec","array","arrayToRules","object","getOwnPropertyNames","thing","rules","rule","objectToRules","defaultErrorRule","compileRules","hasStates","errorRule","fast","create","fastAllowed","unicodeFlag","groups","charCodeAt","unicode","pat","regexp","fallbackRule","suffix","checkStateGroup","g","state","Lexer","states","startState","buffer","stack","info","line","col","queuedToken","queuedText","queuedThrow","setState","save","re","popState","pushState","eat","tokenToString","_getGroup","groupCount","queuedGroup","token","_token","charAt","lastIndex","text","offset","matchNL","nl","formatError","LexerIterator","lexer","message","firstDisplayedLine","lastDisplayedLine","lastLineDigits","String","displayedLines","string","numLines","position","substring","lastNLines","errorLines","lineNo","clone","tokenType","compile","start","all","$all","ruleMap","included","splice","newRules","newRule","fastKeys","freeze","keywords","isMap","reverseMap","types","keyword","d","isValidSemver","cleanSemver","validateLicense","hostedGitInfo","isBuiltinModule","depTypes","extractDescription","typos","isEmail","modifyPeople","author","unParsePerson","person","web","wrappedUrl","email","mail","parsePerson","matchedName","matchedUrl","matchedEmail","fixRepositoryField","repositories","repository","r","hosted","fixTypos","topLevel","fixScriptsField","scripts","script","fixFilesField","files","fixBinField","bin","fixManField","man","fixBundleDependenciesField","bdd","bd","filtered","dependencies","fixDependencies","deps","dn","dv","depObjectify","objectifyDeps","optionalDependencies","addOptionalDepsToDeps","fixModulesField","modules","fixKeywordsField","kw","fixVersionField","loose","version","fixPeople","fixNameField","allowLegacyCase","rest","isValidScopedPackageName","ensureValidName","fixDescriptionField","description","readme","fixReadmeField","fixBugsField","parse","oldBugs","fixHomepageField","homepage","fixLicenseField","license","licence","validForNewPackages","util","messages","makeTypoWarning","providedName","probableName","format","typo","warningName","msgTemplate","normalize","fixer","makeWarning","thingsToFix","fieldName","ucFirst","private","msg","install","preinstall","gypfile","thingName","_id","toUpperCase","debug","MAX_LENGTH","parseOptions","compareIdentifiers","SemVer","includePrerelease","m","LOOSE","FULL","raw","major","minor","patch","prerelease","num","build","compare","other","compareMain","comparePre","compareBuild","inc","identifier","isNaN","er","SEMVER_SPEC_VERSION","MAX_SAFE_COMPONENT_LENGTH","env","NODE_DEBUG","console","numeric","anum","bnum","rcompareIdentifiers","reduce","R","createToken","isGlobal","NUMERICIDENTIFIER","NUMERICIDENTIFIERLOOSE","NONNUMERICIDENTIFIER","PRERELEASEIDENTIFIER","PRERELEASEIDENTIFIERLOOSE","BUILDIDENTIFIER","MAINVERSION","PRERELEASE","BUILD","FULLPLAIN","MAINVERSIONLOOSE","PRERELEASELOOSE","LOOSEPLAIN","XRANGEIDENTIFIER","XRANGEIDENTIFIERLOOSE","GTLT","XRANGEPLAIN","XRANGEPLAINLOOSE","COERCE","LONETILDE","tildeTrimReplace","LONECARET","caretTrimReplace","comparatorTrimReplace","ANY","Comparator","comp","semver","operator","COMPARATORLOOSE","COMPARATOR","cmp","intersects","Range","sameDirectionIncreasing","sameDirectionDecreasing","sameSemVer","differentDirectionsInclusive","oppositeDirectionsLessThan","oppositeDirectionsGreaterThan","parseRange","first","isNullSet","isAny","comps","memoKey","cached","hr","HYPHENRANGELOOSE","HYPHENRANGE","hyphenReplace","COMPARATORTRIM","rangeList","TILDETRIM","CARETTRIM","parseComparator","replaceGTE0","rangeMap","comparators","some","thisComparators","isSatisfiable","rangeComparators","thisComparator","rangeComparator","testSet","remainingComparators","testComparator","otherComparator","replaceCarets","replaceTildes","replaceXRanges","replaceStars","isX","replaceTilde","TILDELOOSE","TILDE","M","pr","ret","replaceCaret","CARETLOOSE","CARET","z","replaceXRange","XRANGELOOSE","XRANGE","gtlt","xM","xm","xp","anyX","STAR","GTE0PRE","GTE0","incPr","$0","from","fM","fm","fp","fpr","fb","to","tM","tm","tp","tpr","tb","allowed","eq","neq","gt","gte","lt","lte","rtl","COERCERTL","versionA","versionB","version1","version2","v1","v2","hasPre","prefix","defaultResult","list","internalRe","constants","identifiers","valid","clean","rcompare","compareLoose","rsort","coerce","satisfies","toComparators","maxSatisfying","minSatisfying","minVersion","validRange","outside","gtr","ltr","simplifyRange","subset","tokens","r1","r2","maxSV","rangeObj","min","minSV","minver","setMin","comparator","compver","hilo","gtfn","ltefn","ltfn","ecomp","high","low","ranges","simplified","original","simpleSubset","sub","dom","eqSet","gtltComp","higher","lower","hasDomLT","hasDomGT","higherGT","lowerLT","needDomLTPre","needDomGTPre","sawNonNull","OUTER","simpleSub","simpleDom","isSub","spdxLicenseIds","transpositions","transforms","argument","licensesWithVersions","objectMap","licensesWithOneVersion","lastResorts","validTransformation","transformed","validLastResort","upperCased","lastResort","anyCorrection","transposition","transposed","checked","upgrade","postprocess","upgradeGPLs","noPlus","scan","hasMore","parseOperator","makeBinaryOpParser","nextParser","parseBinaryOp","left","right","conjunction","parseAnd","expr","parseExpression","parseParenthesizedExpression","begin","parseLicenseRef","plus","exception","parseWith","parseLicense","licenses","exceptions","read","idstring","expectIdstring","possibilities","documentRef","licenseRef","fs","globrex","promisify","globalyzer","relative","isHidden","readdir","stat","walk","output","level","dir","cwd","dot","filesOnly","fullpath","relpath","isMatch","lstatSync","isDirectory","resolved","dirent","isFile","absolute","flush","matches","correct","genericWarning","fileReferenceRE","usesLicenseRef","ast","validForOldPackages","unlicensed","inFile","warnings","corrected","spdx","Node","pushNode","res","forEachReverse","getReverse","mapReverse","initial","acc","reduceReverse","toArrayReverse","sliceReverse","deleteCount","nodes","inserted","reverse"],"sourceRoot":""}