@vltpkg/semver 1.0.0-rc.2 → 1.0.0-rc.23

package/dist/esm/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAGtC,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AAEjD,cAAc,iBAAiB,CAAA;AAC/B,cAAc,YAAY,CAAA;AAC1B,cAAc,cAAc,CAAA;AAE5B,kEAAkE;AAClE,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAyB,EAAE,EAAE;IACjD,IAAI,OAAO,YAAY,OAAO;QAAE,OAAO,OAAO,CAAA;IAC9C,IAAI,CAAC;QACH,OAAO,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAA;IAClB,CAAC;AACH,CAAC,CAAA;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACzB,EAAE;IACF,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,iBAAiB,KAAK,iBAAiB;YAAE,OAAO,KAAK,CAAA;QAC/D,KAAK,GAAG,KAAK,CAAC,GAAG,CAAA;IACnB,CAAC;IACD,IAAI,CAAC;QACH,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAA;IAClB,CAAC;AACH,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAyB,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;AAEpE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAqB,EAAE,EAAE,CAClD,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAErB;;GAEG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,OAAyB,EACzB,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACzB,EAAE;IACF,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAA;QAC7B,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAA;QACzB,OAAO,GAAG,MAAM,CAAA;IAClB,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;QACnD,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAA;QACzB,KAAK,GAAG,MAAM,CAAA;IAChB,CAAC;IACD,OAAO,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;AACjC,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CACjB,OAAyB,EACzB,IAAmB,EACnB,oBAA6B,EAC7B,EAAE,CACF,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC;IAC5B,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC;IACxB,CAAC,CAAC,OAAO,CACR,CAAC,GAAG,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAA;AAEnC;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,CAAmB,EACnB,CAAmB,EACnB,EAAE;IACF,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IACnB,wCAAwC;IACxC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;IAC/D,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,CAAA;IACjB,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAA;IAClB,oBAAoB;IACpB,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;AACvB,CAAC,CAAA;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,IAAS,EACJ,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;AAEvC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,IAAS,EACJ,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;AAExC;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CACzB,CAAmB,EACnB,CAAmB,EACnB,EAAE;IACF,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IACnB,wCAAwC;IACxC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;IAC/D,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,CAAA;IACjB,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAA;IAClB,oBAAoB;IACpB,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;AACxB,CAAC,CAAA;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACiB,EAAE;IAC5C,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC9C,OAAO,CAAC,CAAC,CAAC,CAAC;QACP,GAAG,EAAE,CAAC,KAAK;QACb,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAA;AAC3D,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,IAAS,EACT,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACpB,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAA;AAE7D;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,IAA0B,EAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACJ,EAAE;IACvB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC9C,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACxB,IAAI,GAAG,GAAwB,SAAS,CAAA;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,OAAO;YAAE,SAAQ;QACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QACnC,IAAI,CAAC,GAAG;YAAE,GAAG,GAAG,OAAO,CAAA;aAClB,IAAI,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,GAAG,GAAG,OAAO,CAAA;IAClD,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,IAA0B,EAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACJ,EAAE;IACvB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC9C,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACxB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,oBAAoB;QACpB,IAAI,CAAC,CAAC;YAAE,SAAQ;QAChB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,OAAO;YAAE,SAAQ;QACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QACnC,OAAO,OAAO,CAAA;IAChB,CAAC;AACH,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,IAA0B,EAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACJ,EAAE;IACvB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC9C,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACxB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,OAAO;YAAE,SAAQ;QACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QACnC,OAAO,OAAO,CAAA;IAChB,CAAC;AACH,CAAC,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,IAA0B,EAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACJ,EAAE;IACvB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC9C,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACxB,IAAI,GAAG,GAAwB,SAAS,CAAA;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,CAAC,OAAO;YAAE,SAAQ;QACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,SAAQ;QACnC,IAAI,CAAC,GAAG;YAAE,GAAG,GAAG,OAAO,CAAA;aAClB,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,GAAG,GAAG,OAAO,CAAA;IAC/C,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,IAA0B,EAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACJ,EAAE,CACvB,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;AAEhD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,IAA0B,EAC1B,KAAqB,EACrB,iBAAiB,GAAG,KAAK,EACJ,EAAE,CACvB,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;AAE/C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE;IACF,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAA;IACzB,IAAI,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,WAAW,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAA;IAC3D,CAAC;IACD,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAA;IACzB,IAAI,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,WAAW,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAA;IAC3D,CAAC;IACD,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AACrB,CAAC,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;AAEhC,+DAA+D;AAC/D,MAAM,CAAC,MAAM,EAAE,GAAG,CAChB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;AACpC,gEAAgE;AAChE,MAAM,CAAC,MAAM,GAAG,GAAG,CACjB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;AACrC,+DAA+D;AAC/D,MAAM,CAAC,MAAM,EAAE,GAAG,CAChB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAA;AACpC,mEAAmE;AACnE,MAAM,CAAC,MAAM,GAAG,GAAG,CACjB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;AACrC,0EAA0E;AAC1E,MAAM,CAAC,MAAM,GAAG,GAAG,CACjB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;AACtC,sEAAsE;AACtE,MAAM,CAAC,MAAM,EAAE,GAAG,CAChB,QAA0B,EAC1B,QAA0B,EAC1B,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;AAEtC,gEAAgE;AAChE,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAyB,EAAE,EAAE,CACjD,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAA;AACvB,gEAAgE;AAChE,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAyB,EAAE,EAAE,CACjD,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAA;AACvB,gEAAgE;AAChE,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAyB,EAAE,EAAE,CACjD,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAA;AACvB;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,OAAyB,EAAE,EAAE;IACtD,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAA;IACxB,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACxB,OAAO,CAAC,CAAC,UAAU,IAAI,EAAE,CAAA;AAC3B,CAAC,CAAA;AACD;;;GAGG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAyB,EAAE,EAAE;IACjD,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAA;IACxB,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACxB,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAA;AACtB,CAAC,CAAA;AAED,sEAAsE;AACtE,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,QAAa,EACR,EAAE,CACP,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;IAClB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IAClB,IAAI,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IACpB,OAAO,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,CAAA;AAC9B,CAAC,CAAC,CAAA;AAEJ;;;;GAIG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,EAAkB,EAClB,EAAkB,EAClB,iBAA2B,EAC3B,EAAE;IACF,MAAM,MAAM,GACV,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IACjE,MAAM,MAAM,GACV,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAEjE,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAEpC,2CAA2C;IAC3C,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK;QAAE,OAAO,IAAI,CAAA;IAE7C,mEAAmE;IACnE,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAC1D,CAAA;AACH,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,oBAAoB,GAAG,CAC3B,KAAiB,EACjB,KAAiB,EACR,EAAE;IACX,2CAA2C;IAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CACtD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CACjB,CAAA;IACD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CACtD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CACjB,CAAA;IAED,6CAA6C;IAC7C,OAAO,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,gBAAgB,GAAG,CAAC,MAAiB,EAAW,EAAE;IACtD,cAAc;IACd,IAAI,UAAU,GAAmB,IAAI,CAAA;IACrC,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,IAAI,UAAU,GAAmB,IAAI,CAAA;IACrC,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,IAAI,QAAQ,GAAmB,IAAI,CAAA;IAEnC,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QAC/B,QAAQ,EAAE,EAAE,CAAC;YACX,KAAK,EAAE;gBACL,4EAA4E;gBAC5E,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAA;gBAChD,QAAQ,GAAG,GAAG,CAAA;gBACd,MAAK;YAEP,KAAK,IAAI;gBACP,qBAAqB;gBACrB,IACE,CAAC,UAAU;oBACX,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC;oBACnB,CAAC,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,EACxC,CAAC;oBACD,UAAU,GAAG,GAAG,CAAA;oBAChB,cAAc,GAAG,IAAI,CAAA;gBACvB,CAAC;gBACD,oBAAoB;gBACpB,MAAK;YAEP,KAAK,GAAG;gBACN,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC;oBACvC,UAAU,GAAG,GAAG,CAAA;oBAChB,cAAc,GAAG,KAAK,CAAA;gBACxB,CAAC;gBACD,MAAK;YAEP,KAAK,IAAI;gBACP,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC;oBACvC,UAAU,GAAG,GAAG,CAAA;oBAChB,cAAc,GAAG,IAAI,CAAA;gBACvB,CAAC;gBACD,MAAK;YAEP,KAAK,GAAG;gBACN,qBAAqB;gBACrB,IACE,CAAC,UAAU;oBACX,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC;oBACnB,EAAE,CAAC,GAAG,EAAE,UAAU,CAAC,EACnB,CAAC;oBACD,UAAU,GAAG,GAAG,CAAA;oBAChB,cAAc,GAAG,KAAK,CAAA;gBACxB,CAAC;gBACD,oBAAoB;gBACpB,MAAK;QACT,CAAC;IACH,CAAC;IAED,yDAAyD;IACzD,IAAI,QAAQ,EAAE,CAAC;QACb,IAAI,UAAU,EAAE,CAAC;YACf,IACE,cAAc,CAAC,CAAC;gBACd,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;gBAC1B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,EAC3B,CAAC;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,IAAI,UAAU,EAAE,CAAC;YACf,IACE,cAAc,CAAC,CAAC;gBACd,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;gBAC1B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,EAC3B,CAAC;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,4DAA4D;IAC5D,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;YAAE,OAAO,KAAK,CAAA;QAC5C,IACE,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;YAC1B,CAAC,CAAC,cAAc,IAAI,cAAc,CAAC;YAEnC,OAAO,KAAK,CAAA;IAChB,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC,CAAA","sourcesContent":["import { Range } from './range.ts'\nimport { Version } from './version.ts'\nimport type { Comparator, OVTuple } from './comparator.ts'\nimport type { IncrementType } from './version.ts'\nimport { syntaxError } from '@vltpkg/error-cause'\n\nexport * from './comparator.ts'\nexport * from './range.ts'\nexport * from './version.ts'\n\n/** Return the parsed version string, or `undefined` if invalid */\nexport const parse = (version: Version | string) => {\n  if (version instanceof Version) return version\n  try {\n    return Version.parse(version)\n  } catch {\n    return undefined\n  }\n}\n\n/** Return the parsed version range, or `undefined` if invalid */\nexport const parseRange = (\n  range: Range | string,\n  includePrerelease = false,\n) => {\n  if (typeof range === 'object') {\n    if (range.includePrerelease === includePrerelease) return range\n    range = range.raw\n  }\n  try {\n    return new Range(range, includePrerelease)\n  } catch {\n    return undefined\n  }\n}\n\n/**\n * return true if the version is valid\n *\n * Note: do not use this if you intend to immediately parse the version if it's\n * valid. Just use {@link parse}, and guard the possible undefined value, or\n * use `Version.parse(..)` to throw on invalid values.\n */\nexport const valid = (version: Version | string) => !!parse(version)\n\n/**\n * return true if the range is valid\n *\n * Note: do not use this if you intend to immediately parse the range if it's\n * valid. Just use {@link parseRange}, and guard the possible undefined value,\n * or use `new Range(..)` to throw on invalid values.\n */\nexport const validRange = (range: Range | string) =>\n  !!parseRange(range)\n\n/**\n * Return true if the version satisfies the range.\n */\nexport const satisfies = (\n  version: Version | string,\n  range: Range | string,\n  includePrerelease = false,\n) => {\n  if (typeof version === 'string') {\n    const parsed = parse(version)\n    if (!parsed) return false\n    version = parsed\n  }\n  if (typeof range === 'string') {\n    const parsed = parseRange(range, includePrerelease)\n    if (!parsed) return false\n    range = parsed\n  }\n  return version.satisfies(range)\n}\n\n/**\n * Increment the specified part of the version, and return the resulting\n * object. If a Version object is provided, it will be modified in-place.\n *\n * See {@link Version.inc} for full description.\n */\nexport const inc = (\n  version: Version | string,\n  part: IncrementType,\n  prereleaseIdentifier?: string,\n) =>\n  (typeof version === 'string' ?\n    Version.parse(version)\n  : version\n  ).inc(part, prereleaseIdentifier)\n\n/**\n * The method used by {@link sort}, exported for passing directly to\n * `Array.sort`.\n *\n * Usage:\n *\n * ```ts\n * import { sortMethod } from '@vltpkg/semver'\n * const versions = ['1.2.3', '5.2.3', '2.3.4']\n * console.log(versions.sort(sortMethod))\n * // ['1.2.3', '2.3.4', '5.2.3']\n * ```\n */\nexport const sortMethod = (\n  a: Version | string,\n  b: Version | string,\n) => {\n  const pa = parse(a)\n  const pb = parse(b)\n  /* c8 ignore start - nondeterministic */\n  if (!pa && !pb) return String(a).localeCompare(String(b), 'en')\n  if (!pa) return 1\n  if (!pb) return -1\n  /* c8 ignore stop */\n  return pa.compare(pb)\n}\n\n/**\n * Sort an array of version strings or objects in ascending SemVer precedence\n * order (ie, lowest versions first).\n *\n * Invalid version strings are sorted to the end of the array in ascending\n * alphabetical order.\n *\n * Note: when using this method, the list is cloned prior to sorting, to\n * prevent surprising mutation. To sort the list in place, see\n * {@link sortMethod}.\n */\nexport const sort = <T extends Version | string = Version | string>(\n  list: T[],\n): T[] => list.slice().sort(sortMethod)\n\n/**\n * Sort an array of version strings or objects in descending SemVer\n * precedence order (ie, highest versions first).\n *\n * Invalid version strings are sorted to the end of the array in ascending\n * alphabetical order.\n *\n * Note: when using this method, the list is cloned prior to sorting, to\n * prevent surprising mutation. To sort the list in place, see\n * {@link rsortMethod}.\n */\nexport const rsort = <T extends Version | string = Version | string>(\n  list: T[],\n): T[] => list.slice().sort(rsortMethod)\n\n/**\n * The method used by {@link rsort}, exported for passing directly to\n * `Array.sort`.\n *\n * Usage:\n *\n * ```ts\n * import { rsortMethod } from '@vltpkg/semver'\n * const versions = ['1.2.3', '5.2.3', '2.3.4']\n * console.log(versions.sort(rsortMethod))\n * // ['5.2.3', '2.3.4', '1.2.3']\n * ```\n */\nexport const rsortMethod = (\n  a: Version | string,\n  b: Version | string,\n) => {\n  const pa = parse(a)\n  const pb = parse(b)\n  /* c8 ignore start - nondeterministic */\n  if (!pa && !pb) return String(a).localeCompare(String(b), 'en')\n  if (!pa) return 1\n  if (!pb) return -1\n  /* c8 ignore stop */\n  return pa.rcompare(pb)\n}\n\n/**\n * Method used by {@link filter}, for use in `Array.filter` directly.\n *\n * Usage:\n *\n * ```ts\n * import { filterMethod } from '@vltpkg/semver'\n * const versions = ['1.2.3', '5.2.3', '2.3.4']\n * console.log(versions.filter(filterMethod('>=2.x')))\n * // ['5.2.3', '2.3.4']\n * ```\n */\nexport const filterMethod = (\n  range: Range | string,\n  includePrerelease = false,\n): ((version: Version | string) => boolean) => {\n  const r = parseRange(range, includePrerelease)\n  return !r ?\n      () => false\n    : version => satisfies(version, r, r.includePrerelease)\n}\n\n/**\n * Filter a list of versions to find all that match a given range.\n */\nexport const filter = <T extends Version | string = Version | string>(\n  list: T[],\n  range: Range | string,\n  includePrerelease = false,\n): T[] => list.filter(filterMethod(range, includePrerelease))\n\n/**\n * Find the highest-precedence match for a range within a list of versions\n *\n * Returns `undefined` if no match was found.\n */\nexport const highest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  let max: Version | undefined = undefined\n  for (const v of list) {\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    if (!max) max = version\n    else if (version.greaterThan(max)) max = version\n  }\n  return max\n}\n\n/**\n * Faster form of {@link highest}, for use when the list is sorted\n * in precedence order (lower-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const sortedHighest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  for (let i = list.length - 1; i >= 0; i--) {\n    const v = list[i]\n    /* c8 ignore next */\n    if (!v) continue\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    return version\n  }\n}\n\n/**\n * Faster form of {@link highest}, for use when the list is sorted\n * in reverse precedence order (higher-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const rsortedHighest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  for (const v of list) {\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    return version\n  }\n}\n\n/**\n * Find the lowest-precedence match for a range within a list of versions\n *\n * Returns `undefined` if no match was found.\n */\nexport const lowest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined => {\n  const r = parseRange(range, includePrerelease)\n  if (!r) return undefined\n  let min: Version | undefined = undefined\n  for (const v of list) {\n    const version = parse(v)\n    if (!version) continue\n    if (!version.satisfies(r)) continue\n    if (!min) min = version\n    else if (version.lessThan(min)) min = version\n  }\n  return min\n}\n\n/**\n * Faster form of {@link lowest}, for use when the list is sorted\n * in precedence order (lower-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const sortedLowest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined =>\n  rsortedHighest(list, range, includePrerelease)\n\n/**\n * Faster form of {@link lowest}, for use when the list is sorted\n * in reverse precedence order (higher-precedence versions first).\n *\n * Note: This stops at the first match, and will produce incorrect results\n * when the list is not properly sorted!\n */\nexport const rsortedLowest = (\n  list: (Version | string)[],\n  range: Range | string,\n  includePrerelease = false,\n): Version | undefined =>\n  sortedHighest(list, range, includePrerelease)\n\n/**\n * Same as {@link sortMethod}, but throws if either version is not valid.\n * 1 if versionA is higher precedence than versionB\n * -1 if versionA is lower precedence than versionB\n * 0 if they have equal precedence\n */\nexport const compare = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => {\n  const a = parse(versionA)\n  if (!a) {\n    throw syntaxError('invalid version', { found: versionA })\n  }\n  const b = parse(versionB)\n  if (!b) {\n    throw syntaxError('invalid version', { found: versionB })\n  }\n  return a.compare(b)\n}\n\n/**\n * Inverse of {@link compare}\n *\n * Same as {@link rsortMethod}, but throws if either version is not valid.\n *\n * -1 if versionA is higher precedence than versionB\n * 1 if versionA is lower precedence than versionB\n * 0 if they have equal precedence\n */\nexport const rcompare = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionB, versionA)\n\n/** true if versionA is > versionB. throws on invalid values */\nexport const gt = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) > 0\n/** true if versionA is >= versionB. throws on invalid values */\nexport const gte = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) >= 0\n/** true if versionA is < versionB. throws on invalid values */\nexport const lt = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) < 0\n/** true if versionA is &lt;= versionB. throws on invalid values */\nexport const lte = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) <= 0\n/** true if versionA is not equal to versionB. throws on invalid values */\nexport const neq = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) !== 0\n/** true if versionA is equal to versionB. throws on invalid values */\nexport const eq = (\n  versionA: Version | string,\n  versionB: Version | string,\n) => compare(versionA, versionB) === 0\n\n/** extract the major version number, or undefined if invalid */\nexport const major = (version: Version | string) =>\n  parse(version)?.major\n/** extract the minor version number, or undefined if invalid */\nexport const minor = (version: Version | string) =>\n  parse(version)?.minor\n/** extract the patch version number, or undefined if invalid */\nexport const patch = (version: Version | string) =>\n  parse(version)?.patch\n/**\n * extract the list of prerelease identifiers, or undefined if the version\n * is invalid. If no prerelease identifiers are present, returns `[]`.\n */\nexport const prerelease = (version: Version | string) => {\n  const p = parse(version)\n  if (!p) return undefined\n  return p.prerelease ?? []\n}\n/**\n * extract the list of build identifiers, or undefined if the version\n * is invalid. If no build identifiers are present, returns `[]`.\n */\nexport const build = (version: Version | string) => {\n  const p = parse(version)\n  if (!p) return undefined\n  return p.build ?? []\n}\n\n/** return all versions that do not have any prerelease identifiers */\nexport const stable = <T extends Version | string = Version | string>(\n  versions: T[],\n): T[] =>\n  versions.filter(v => {\n    const p = parse(v)\n    if (!p) return false\n    return !p.prerelease?.length\n  })\n\n/**\n * Return true if the range r1 intersects any of the ranges r2\n * r1 and r2 are either Range objects or range strings.\n * Returns true if any version would satisfy both ranges.\n */\nexport const intersects = (\n  r1: Range | string,\n  r2: Range | string,\n  includePrerelease?: boolean,\n) => {\n  const range1 =\n    typeof r1 === 'string' ? parseRange(r1, includePrerelease) : r1\n  const range2 =\n    typeof r2 === 'string' ? parseRange(r2, includePrerelease) : r2\n\n  if (!range1 || !range2) return false\n\n  // If either range is 'any', they intersect\n  if (range1.isAny || range2.isAny) return true\n\n  // Check if any set from range1 intersects with any set from range2\n  return range1.set.some(set1 =>\n    range2.set.some(set2 => intersectComparators(set1, set2)),\n  )\n}\n\n/**\n * Check if two comparators can be satisfied simultaneously\n */\nconst intersectComparators = (\n  comp1: Comparator,\n  comp2: Comparator,\n): boolean => {\n  // Collect all tuples from both comparators\n  const tuples1 = comp1.tuples.filter((t): t is OVTuple =>\n    Array.isArray(t),\n  )\n  const tuples2 = comp2.tuples.filter((t): t is OVTuple =>\n    Array.isArray(t),\n  )\n\n  // Check if there's a satisfiable combination\n  return satisfiableRange(tuples1.concat(tuples2))\n}\n\n/**\n * Check if a set of operator-version tuples represents a satisfiable range\n * This is a simplified implementation that handles the most common cases\n */\nconst satisfiableRange = (tuples: OVTuple[]): boolean => {\n  // Find bounds\n  let lowerBound: Version | null = null\n  let lowerInclusive = false\n  let upperBound: Version | null = null\n  let upperInclusive = false\n  let hasExact: Version | null = null\n\n  for (const [op, ver] of tuples) {\n    switch (op) {\n      case '':\n        // Exact match - if we already have a different exact match, no intersection\n        if (hasExact && !eq(hasExact, ver)) return false\n        hasExact = ver\n        break\n\n      case '>=':\n        /* c8 ignore start */\n        if (\n          !lowerBound ||\n          gt(ver, lowerBound) ||\n          (eq(ver, lowerBound) && !lowerInclusive)\n        ) {\n          lowerBound = ver\n          lowerInclusive = true\n        }\n        /* c8 ignore stop */\n        break\n\n      case '>':\n        if (!lowerBound || gt(ver, lowerBound)) {\n          lowerBound = ver\n          lowerInclusive = false\n        }\n        break\n\n      case '<=':\n        if (!upperBound || lt(ver, upperBound)) {\n          upperBound = ver\n          upperInclusive = true\n        }\n        break\n\n      case '<':\n        /* c8 ignore start */\n        if (\n          !upperBound ||\n          lt(ver, upperBound) ||\n          eq(ver, upperBound)\n        ) {\n          upperBound = ver\n          upperInclusive = false\n        }\n        /* c8 ignore stop */\n        break\n    }\n  }\n\n  // If we have an exact match, check if it's within bounds\n  if (hasExact) {\n    if (lowerBound) {\n      if (\n        lowerInclusive ?\n          lt(hasExact, lowerBound)\n        : lte(hasExact, lowerBound)\n      ) {\n        return false\n      }\n    }\n    if (upperBound) {\n      if (\n        upperInclusive ?\n          gt(hasExact, upperBound)\n        : gte(hasExact, upperBound)\n      ) {\n        return false\n      }\n    }\n    return true\n  }\n\n  // Check if lower bound is less than or equal to upper bound\n  if (lowerBound && upperBound) {\n    if (gt(lowerBound, upperBound)) return false\n    if (\n      eq(lowerBound, upperBound) &&\n      !(lowerInclusive && upperInclusive)\n    )\n      return false\n  }\n\n  return true\n}\n"]}

package/dist/esm/package.json

@@ -1,3 +0,0 @@
-{
-  "type": "module"
-}

package/dist/esm/range.d.ts

@@ -1,35 +0,0 @@
-import { Comparator } from './comparator.ts';
-import type { Version } from './version.ts';
-export declare const isRange: (range: unknown) => range is Range;
-/**
- * A representation of a semver range, used to test versions.
- *
- * Includes a set of comparators representing the `||`-separated
- * sections of the range string
- */
-export declare class Range {
-    #private;
-    /** raw string used to create this Range */
-    raw: string;
-    /** true if the range is `*` */
-    isAny: boolean;
-    /** true if the range is a single semver version */
-    isSingle: boolean;
-    /** true if the range cannot match anything */
-    /**
-     * set of {@link Comparator} objects representing the `||`-separated sections
-     * of the range. If at least one of these matches, then the version is a
-     * match.
-     */
-    set: Comparator[];
-    /** true if all prerelease versions should be included */
-    includePrerelease: boolean;
-    constructor(range: string, includePrerelease?: boolean);
-    /**
-     * test a {@link Version} against the range
-     */
-    test(v: Version): boolean;
-    /** return the simplified canonical form of this range */
-    toString(): string;
-}
-//# sourceMappingURL=range.d.ts.map

package/dist/esm/range.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.d.ts","sourceRoot":"","sources":["../../src/range.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAA;AAC5C,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAG3C,eAAO,MAAM,OAAO,UAAW,OAAO,KAAG,KAAK,IAAI,KAWjD,CAAA;AAED;;;;;GAKG;AACH,qBAAa,KAAK;;IAChB,2CAA2C;IAC3C,GAAG,EAAE,MAAM,CAAA;IAEX,+BAA+B;IAC/B,KAAK,EAAE,OAAO,CAAA;IAEd,mDAAmD;IACnD,QAAQ,EAAE,OAAO,CAAA;IAEjB,8CAA8C;IAE9C;;;;OAIG;IACH,GAAG,EAAE,UAAU,EAAE,CAAK;IAEtB,yDAAyD;IACzD,iBAAiB,EAAE,OAAO,CAAA;gBAKd,KAAK,EAAE,MAAM,EAAE,iBAAiB,UAAQ;IA+CpD;;OAEG;IACH,IAAI,CAAC,CAAC,EAAE,OAAO;IAIf,yDAAyD;IACzD,QAAQ;CAST"}

package/dist/esm/range.js

@@ -1,102 +0,0 @@
-import { fastSplit } from '@vltpkg/fast-split';
-import { Comparator } from "./comparator.js";
-import { asError } from '@vltpkg/types';
-export const isRange = (range) => {
-    return (range instanceof Range ||
-        (typeof range === 'object' &&
-            range !== null &&
-            'raw' in range &&
-            typeof range.raw === 'string' &&
-            'set' in range &&
-            Array.isArray(range.set) &&
-            range.set.every(c => c instanceof Comparator)));
-};
-/**
- * A representation of a semver range, used to test versions.
- *
- * Includes a set of comparators representing the `||`-separated
- * sections of the range string
- */
-export class Range {
-    /** raw string used to create this Range */
-    raw;
-    /** true if the range is `*` */
-    isAny;
-    /** true if the range is a single semver version */
-    isSingle;
-    /** true if the range cannot match anything */
-    /**
-     * set of {@link Comparator} objects representing the `||`-separated sections
-     * of the range. If at least one of these matches, then the version is a
-     * match.
-     */
-    set = [];
-    /** true if all prerelease versions should be included */
-    includePrerelease;
-    /** cached toString */
-    #toString;
-    constructor(range, includePrerelease = false) {
-        this.raw = range;
-        this.includePrerelease = includePrerelease;
-        this.isAny = false;
-        let isFirst = true;
-        this.isSingle = false;
-        const comparatorErrors = [];
-        fastSplit(range, '||', -1, part => {
-            if (this.isAny)
-                return;
-            const cmp = this.#maybeComparator(part, this.includePrerelease);
-            if (cmp instanceof Error) {
-                comparatorErrors.push(cmp);
-                return;
-            }
-            if (cmp.isAny) {
-                this.set = [cmp];
-                this.isAny = true;
-                return;
-            }
-            this.set.push(cmp);
-            if (!isFirst)
-                this.isSingle = false;
-            else if (Array.isArray(cmp.tuples) &&
-                cmp.tuples.length === 1 &&
-                Array.isArray(cmp.tuples[0]) &&
-                cmp.tuples[0][0] === '') {
-                this.isSingle = true;
-            }
-            isFirst = false;
-        });
-        if (!this.set.length && comparatorErrors.length) {
-            if (comparatorErrors.length === 1 && comparatorErrors[0]) {
-                throw comparatorErrors[0];
-            }
-            throw new AggregateError(comparatorErrors);
-        }
-    }
-    #maybeComparator(part, includePrerelease) {
-        try {
-            return new Comparator(part, includePrerelease);
-        }
-        catch (er) {
-            return asError(er);
-        }
-    }
-    /**
-     * test a {@link Version} against the range
-     */
-    test(v) {
-        return this.set.some(c => c.test(v));
-    }
-    /** return the simplified canonical form of this range */
-    toString() {
-        if (this.#toString)
-            return this.#toString;
-        if (this.isSingle) {
-            this.#toString = String(this.set[0]);
-            return this.#toString;
-        }
-        this.#toString = this.set.map(c => String(c)).join(' || ');
-        return this.#toString;
-    }
-}
-//# sourceMappingURL=range.js.map

package/dist/esm/range.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/range.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAA;AAE5C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAEvC,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAc,EAAkB,EAAE;IACxD,OAAO,CACL,KAAK,YAAY,KAAK;QACtB,CAAC,OAAO,KAAK,KAAK,QAAQ;YACxB,KAAK,KAAK,IAAI;YACd,KAAK,IAAI,KAAK;YACd,OAAO,KAAK,CAAC,GAAG,KAAK,QAAQ;YAC7B,KAAK,IAAI,KAAK;YACd,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACxB,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC,CACjD,CAAA;AACH,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,OAAO,KAAK;IAChB,2CAA2C;IAC3C,GAAG,CAAQ;IAEX,+BAA+B;IAC/B,KAAK,CAAS;IAEd,mDAAmD;IACnD,QAAQ,CAAS;IAEjB,8CAA8C;IAE9C;;;;OAIG;IACH,GAAG,GAAiB,EAAE,CAAA;IAEtB,yDAAyD;IACzD,iBAAiB,CAAS;IAE1B,sBAAsB;IACtB,SAAS,CAAS;IAElB,YAAY,KAAa,EAAE,iBAAiB,GAAG,KAAK;QAClD,IAAI,CAAC,GAAG,GAAG,KAAK,CAAA;QAChB,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;QAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,OAAO,GAAG,IAAI,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;QACrB,MAAM,gBAAgB,GAAY,EAAE,CAAA;QACpC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE;YAChC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAM;YACtB,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAA;YAC/D,IAAI,GAAG,YAAY,KAAK,EAAE,CAAC;gBACzB,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAC1B,OAAM;YACR,CAAC;YACD,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBACd,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;gBAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;gBACjB,OAAM;YACR,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAClB,IAAI,CAAC,OAAO;gBAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;iBAC9B,IACH,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBACzB,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EACvB,CAAC;gBACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YACtB,CAAC;YACD,OAAO,GAAG,KAAK,CAAA;QACjB,CAAC,CAAC,CAAA;QACF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,gBAAgB,CAAC,MAAM,EAAE,CAAC;YAChD,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzD,MAAM,gBAAgB,CAAC,CAAC,CAAC,CAAA;YAC3B,CAAC;YACD,MAAM,IAAI,cAAc,CAAC,gBAAgB,CAAC,CAAA;QAC5C,CAAC;IACH,CAAC;IAED,gBAAgB,CAAC,IAAY,EAAE,iBAA0B;QACvD,IAAI,CAAC;YACH,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAA;QAChD,CAAC;QAAC,OAAO,EAAE,EAAE,CAAC;YACZ,OAAO,OAAO,CAAC,EAAE,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,CAAU;QACb,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC;IAED,yDAAyD;IACzD,QAAQ;QACN,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC,SAAS,CAAA;QACzC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACpC,OAAO,IAAI,CAAC,SAAS,CAAA;QACvB,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC1D,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;CACF","sourcesContent":["import { fastSplit } from '@vltpkg/fast-split'\nimport { Comparator } from './comparator.ts'\nimport type { Version } from './version.ts'\nimport { asError } from '@vltpkg/types'\n\nexport const isRange = (range: unknown): range is Range => {\n  return (\n    range instanceof Range ||\n    (typeof range === 'object' &&\n      range !== null &&\n      'raw' in range &&\n      typeof range.raw === 'string' &&\n      'set' in range &&\n      Array.isArray(range.set) &&\n      range.set.every(c => c instanceof Comparator))\n  )\n}\n\n/**\n * A representation of a semver range, used to test versions.\n *\n * Includes a set of comparators representing the `||`-separated\n * sections of the range string\n */\nexport class Range {\n  /** raw string used to create this Range */\n  raw: string\n\n  /** true if the range is `*` */\n  isAny: boolean\n\n  /** true if the range is a single semver version */\n  isSingle: boolean\n\n  /** true if the range cannot match anything */\n\n  /**\n   * set of {@link Comparator} objects representing the `||`-separated sections\n   * of the range. If at least one of these matches, then the version is a\n   * match.\n   */\n  set: Comparator[] = []\n\n  /** true if all prerelease versions should be included */\n  includePrerelease: boolean\n\n  /** cached toString */\n  #toString?: string\n\n  constructor(range: string, includePrerelease = false) {\n    this.raw = range\n    this.includePrerelease = includePrerelease\n    this.isAny = false\n    let isFirst = true\n    this.isSingle = false\n    const comparatorErrors: Error[] = []\n    fastSplit(range, '||', -1, part => {\n      if (this.isAny) return\n      const cmp = this.#maybeComparator(part, this.includePrerelease)\n      if (cmp instanceof Error) {\n        comparatorErrors.push(cmp)\n        return\n      }\n      if (cmp.isAny) {\n        this.set = [cmp]\n        this.isAny = true\n        return\n      }\n      this.set.push(cmp)\n      if (!isFirst) this.isSingle = false\n      else if (\n        Array.isArray(cmp.tuples) &&\n        cmp.tuples.length === 1 &&\n        Array.isArray(cmp.tuples[0]) &&\n        cmp.tuples[0][0] === ''\n      ) {\n        this.isSingle = true\n      }\n      isFirst = false\n    })\n    if (!this.set.length && comparatorErrors.length) {\n      if (comparatorErrors.length === 1 && comparatorErrors[0]) {\n        throw comparatorErrors[0]\n      }\n      throw new AggregateError(comparatorErrors)\n    }\n  }\n\n  #maybeComparator(part: string, includePrerelease: boolean) {\n    try {\n      return new Comparator(part, includePrerelease)\n    } catch (er) {\n      return asError(er)\n    }\n  }\n\n  /**\n   * test a {@link Version} against the range\n   */\n  test(v: Version) {\n    return this.set.some(c => c.test(v))\n  }\n\n  /** return the simplified canonical form of this range */\n  toString() {\n    if (this.#toString) return this.#toString\n    if (this.isSingle) {\n      this.#toString = String(this.set[0])\n      return this.#toString\n    }\n    this.#toString = this.set.map(c => String(c)).join(' || ')\n    return this.#toString\n  }\n}\n"]}

package/dist/esm/version.d.ts

@@ -1,132 +0,0 @@
-import type { Range } from './range.ts';
-/**
- * Values of valid increment types.
- */
-export declare const versionIncrements: readonly ["major", "minor", "patch", "pre", "premajor", "preminor", "prepatch", "prerelease"];
-/**
- * Types of incrementing supported by {@link Version#inc}
- */
-export type IncrementType = (typeof versionIncrements)[number];
-/**
- * A parsed object representation of a SemVer version string
- *
- * This is a bit less forgiving than node-semver, in that prerelease versions
- * MUST start with '-'. Otherwise, the allowed syntax is identical.
- */
-export declare class Version {
-    /** raw string provided to create this Version */
-    raw: string;
-    /**  major version number */
-    major: number;
-    /** minor version number */
-    minor: number;
-    /** patch version number */
-    patch: number;
-    /**
-     * List of `'.'`-separated strings and numbers indicating that this
-     * version is a prerelease.
-     *
-     * This is undefined if the version does not have a prerelease section.
-     */
-    prerelease?: (number | string)[];
-    /**
-     * List of `'.'`-separated strings in the `build` section.
-     *
-     * This is undefined if the version does not have a build.
-     */
-    build?: string[];
-    /** Canonical strict form of this version */
-    toString(): string;
-    /** Generate a `Version` object from a SemVer string */
-    static parse(version: string): Version;
-    constructor(version: string, major: number, minor: number, patch: number, prerelease: string | undefined, build: string | undefined);
-    /**
-     * Return 1 if this is > the provided version, -1 if we're less, or 0 if
-     * they are equal.
-     *
-     * No special handling for prerelease versions, this is just a precedence
-     * comparison.
-     *
-     * This can be used to sort a list of versions by precedence:
-     *
-     * ```ts
-     * const versions: Version[] = getVersionsSomehow()
-     * const sorted = versions.sort((a, b) => a.compare(b))
-     * ```
-     */
-    compare(v: Version): -1 | 0 | 1;
-    /**
-     * The inverse of compare, for sorting version lists in reverse order
-     */
-    rcompare(v: Version): number;
-    /** true if this version is > the argument */
-    greaterThan(v: Version): boolean;
-    /** true if this version is >= the argument */
-    greaterThanEqual(v: Version): boolean;
-    /** true if this version is < the argument */
-    lessThan(v: Version): boolean;
-    /** true if this version is &lt;= the argument */
-    lessThanEqual(v: Version): boolean;
-    /** true if these two versions have equal SemVer precedence */
-    equals(v: Version): boolean;
-    /** just compare the M.m.p parts of the version */
-    tupleEquals(v: Version): boolean;
-    /** true if this version satisfies the range */
-    satisfies(r: Range): boolean;
-    /**
-     * Increment the version in place, in the manner specified.
-     *
-     * Part behaviors:
-     *
-     * - `'major'` If the version is a `M.0.0-...` version with a prerelease, then
-     * simply drop the prerelease. Otherwise, set the minor and patch to 0, and
-     * increment the major. So `1.0.0-beta` becomes `1.0.0`, and `1.2.3` becomes
-     * `2.0.0`
-     *
-     * - `'minor'` If the version is a `M.m.0-...` version with a prerelease, then
-     * simply drop the prerelease. Otherwise, set the patch to 0, and increment the
-     * minor. So `1.2.0-beta` becomes `1.2.0`, and `1.2.3` becomes `1.3.0`.
-     *
-     * - `'patch'` If the version has a prerelease, then simply drop the
-     * prerelease. Otherwise, increment the patch value. So `1.2.3-beta` becomes
-     * `1.2.3` and `1.2.3` becomes `1.2.4`.
-     *
-     * - `'premajor'` Set the patch and minor versions to `0`, increment the major
-     * version, and add a prerelease, using the optional identifier.
-     *
-     * - `'preminor'` Set the patch version to `0`, increment the minor version,
-     * and add a prerelease, using the optional identifier.
-     *
-     * - `'prepatch'` If a prerelease is already present, increment the patch
-     * version, otherwise leave it untouched, and add a prerelease, using the
-     * optional identifier.
-     *
-     * - `'prerelease'` If a prerelease version is present, then behave the same as
-     * `'prepatch'`. Otherwise, add a prerelease, using the optional identifier.
-     *
-     * - `'pre'` This is mostly for use by the other prerelease incrementers.
-     *
-     *     - If a prerelease identifier is provided:
-     *
-     *        Update that named portion of the prerelease. For example,
-     *        `inc('1.2.3-beta.4', 'pre', 'beta')` would result in `1.2.3-beta.5`.
-     *
-     *        If there is no prerelease identifier by that name, then replace the
-     *        prerelease with `[name]`. So `inc('1.2.3-alpha.4', 'pre', 'beta')`
-     *        would result in `1.2.3-beta`.
-     *
-     *        If the prerelease identifer is present, but has no numeric value
-     *        following it, then add `0`. So `inc('1.2.3-beta', 'pre', 'beta')`
-     *        would result in `1.2.3-beta.0`.
-     *
-     *     - If no prerelease identifier is provided:
-     *
-     *       If there is no current prerelease, then set the prerelease to `0`. So,
-     *       `inc('1.2.3', 'pre')` becomes `1.2.3-0`.
-     *
-     *       If the last item in the prerelease is numeric, then increment it. So,
-     *       `inc('1.2.3-beta.3', 'pre')` becomes `1.2.3-beta.4`.
-     */
-    inc(part: IncrementType, prereleaseIdentifier?: string): this;
-}
-//# sourceMappingURL=version.d.ts.map

package/dist/esm/version.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"version.d.ts","sourceRoot":"","sources":["../../src/version.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AA2CvC;;GAEG;AACH,eAAO,MAAM,iBAAiB,+FASpB,CAAA;AAEV;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAA;AAE9D;;;;;GAKG;AACH,qBAAa,OAAO;IAClB,iDAAiD;IACjD,GAAG,EAAE,MAAM,CAAA;IAEX,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,2BAA2B;IAC3B,KAAK,EAAE,MAAM,CAAA;IACb,2BAA2B;IAC3B,KAAK,EAAE,MAAM,CAAA;IACb;;;;;OAKG;IACH,UAAU,CAAC,EAAE,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAA;IAChC;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;IAEhB,4CAA4C;IAC5C,QAAQ;IAMR,uDAAuD;IACvD,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM;gBA2C1B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,MAAM,GAAG,SAAS,EAC9B,KAAK,EAAE,MAAM,GAAG,SAAS;IA+B3B;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IAiC/B;;OAEG;IACH,QAAQ,CAAC,CAAC,EAAE,OAAO;IAInB,6CAA6C;IAC7C,WAAW,CAAC,CAAC,EAAE,OAAO;IAItB,8CAA8C;IAC9C,gBAAgB,CAAC,CAAC,EAAE,OAAO;IAI3B,6CAA6C;IAC7C,QAAQ,CAAC,CAAC,EAAE,OAAO;IAInB,iDAAiD;IACjD,aAAa,CAAC,CAAC,EAAE,OAAO;IAIxB,8DAA8D;IAC9D,MAAM,CAAC,CAAC,EAAE,OAAO;IAIjB,kDAAkD;IAClD,WAAW,CAAC,CAAC,EAAE,OAAO;IAQtB,+CAA+C;IAC/C,SAAS,CAAC,CAAC,EAAE,KAAK;IAIlB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAqDG;IACH,GAAG,CAAC,IAAI,EAAE,aAAa,EAAE,oBAAoB,CAAC,EAAE,MAAM;CAiHvD"}