@vltpkg/semver - npm Package Compare versions

Comparing version

1.0.0-rc.2

1.0.0-rc.3

+1

-1

dist/esm/index.js

		@@ -9,3 +9,3 @@ import { Range } from "./range.js";
		export const parse = (version) => {
		if (version instanceof Version)
		if (!(typeof version === 'string'))
		return version;
		@@ -12,0 +12,0 @@ try {

+1

-1

dist/esm/index.js.map

		@@ -1,1 +0,1 @@
		{"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 <= 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"]}
		{"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,CAAC,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC;QAAE,OAAO,OAAO,CAAA;IAClD,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 (!(typeof version === 'string')) 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 <= 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"]}

+4

-4

package.json

		{
		"name": "@vltpkg/semver",
		"description": "The semantic version parser used by vlt",
		"version": "1.0.0-rc.2",
		"version": "1.0.0-rc.3",
		"repository": {
		@@ -23,5 +23,5 @@ "type": "git",
		"dependencies": {
		"@vltpkg/fast-split": "1.0.0-rc.2",
		"@vltpkg/error-cause": "1.0.0-rc.2",
		"@vltpkg/types": "1.0.0-rc.2"
		"@vltpkg/error-cause": "1.0.0-rc.3",
		"@vltpkg/types": "1.0.0-rc.3",
		"@vltpkg/fast-split": "1.0.0-rc.3"
		},
		@@ -28,0 +28,0 @@ "devDependencies": {

@vltpkg/semver - npm Package Compare versions

New alerts

Fixed alerts

Improved metrics

Dependency changes