@donmahallem/lerna2codecov 0.2.4 → 0.2.7

package/dist/esm/node_modules/semver/ranges/subset.mjs

@@ -1,178 +0,0 @@
-import { __require as requireRange } from '../classes/range.mjs';
-import { __require as requireComparator } from '../classes/comparator.mjs';
-import { __require as requireSatisfies } from '../functions/satisfies.mjs';
-import { __require as requireCompare } from '../functions/compare.mjs';
-
-var subset_1;
-var hasRequiredSubset;
-
-function requireSubset () {
-	if (hasRequiredSubset) return subset_1;
-	hasRequiredSubset = 1;
-	const Range = requireRange();
-	const { ANY } = requireComparator();
-	const satisfies = requireSatisfies();
-	const compare = requireCompare();
-
-	// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:
-	// - Every simple range `r1, r2, ...` is a subset of some `R1, R2, ...`
-	//
-	// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:
-	// - If c is only the ANY comparator
-	//   - If C is only the ANY comparator, return true
-	//   - Else return false
-	// - Let EQ be the set of = comparators in c
-	// - If EQ is more than one, return true (null set)
-	// - Let GT be the highest > or >= comparator in c
-	// - Let LT be the lowest < or <= comparator in c
-	// - If GT and LT, and GT.semver > LT.semver, return true (null set)
-	// - If EQ
-	//   - If GT, and EQ does not satisfy GT, return true (null set)
-	//   - If LT, and EQ does not satisfy LT, return true (null set)
-	//   - If EQ satisfies every C, return true
-	//   - Else return false
-	// - If GT
-	//   - If GT.semver is lower than any > or >= comp in C, return false
-	//   - If GT is >=, and GT.semver does not satisfy every C, return false
-	// - If LT
-	//   - If LT.semver is greater than any < or <= comp in C, return false
-	//   - If LT is <=, and LT.semver does not satisfy every C, return false
-	// - If any C is a = range, and GT or LT are set, return false
-	// - Else return true
-
-	const subset = (sub, dom, options) => {
-	  if (sub === dom)
-	    return true
-
-	  sub = new Range(sub, options);
-	  dom = new Range(dom, options);
-	  let sawNonNull = false;
-
-	  OUTER: for (const simpleSub of sub.set) {
-	    for (const simpleDom of dom.set) {
-	      const isSub = simpleSubset(simpleSub, simpleDom, options);
-	      sawNonNull = sawNonNull || isSub !== null;
-	      if (isSub)
-	        continue OUTER
-	    }
-	    // the null set is a subset of everything, but null simple ranges in
-	    // a complex range should be ignored.  so if we saw a non-null range,
-	    // then we know this isn't a subset, but if EVERY simple range was null,
-	    // then it is a subset.
-	    if (sawNonNull)
-	      return false
-	  }
-	  return true
-	};
-
-	const simpleSubset = (sub, dom, options) => {
-	  if (sub === dom)
-	    return true
-
-	  if (sub.length === 1 && sub[0].semver === ANY)
-	    return dom.length === 1 && dom[0].semver === ANY
-
-	  const eqSet = new Set();
-	  let gt, lt;
-	  for (const c of sub) {
-	    if (c.operator === '>' || c.operator === '>=')
-	      gt = higherGT(gt, c, options);
-	    else if (c.operator === '<' || c.operator === '<=')
-	      lt = lowerLT(lt, c, options);
-	    else
-	      eqSet.add(c.semver);
-	  }
-
-	  if (eqSet.size > 1)
-	    return null
-
-	  let gtltComp;
-	  if (gt && lt) {
-	    gtltComp = compare(gt.semver, lt.semver, options);
-	    if (gtltComp > 0)
-	      return null
-	    else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<='))
-	      return null
-	  }
-
-	  // will iterate one or zero times
-	  for (const eq of eqSet) {
-	    if (gt && !satisfies(eq, String(gt), options))
-	      return null
-
-	    if (lt && !satisfies(eq, String(lt), options))
-	      return null
-
-	    for (const c of dom) {
-	      if (!satisfies(eq, String(c), options))
-	        return false
-	    }
-
-	    return true
-	  }
-
-	  let higher, lower;
-	  let hasDomLT, hasDomGT;
-	  for (const c of dom) {
-	    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>=';
-	    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<=';
-	    if (gt) {
-	      if (c.operator === '>' || c.operator === '>=') {
-	        higher = higherGT(gt, c, options);
-	        if (higher === c && higher !== gt)
-	          return false
-	      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options))
-	        return false
-	    }
-	    if (lt) {
-	      if (c.operator === '<' || c.operator === '<=') {
-	        lower = lowerLT(lt, c, options);
-	        if (lower === c && lower !== lt)
-	          return false
-	      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options))
-	        return false
-	    }
-	    if (!c.operator && (lt || gt) && gtltComp !== 0)
-	      return false
-	  }
-
-	  // if there was a < or >, and nothing in the dom, then must be false
-	  // UNLESS it was limited by another range in the other direction.
-	  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
-	  if (gt && hasDomLT && !lt && gtltComp !== 0)
-	    return false
-
-	  if (lt && hasDomGT && !gt && gtltComp !== 0)
-	    return false
-
-	  return true
-	};
-
-	// >=1.2.3 is lower than >1.2.3
-	const higherGT = (a, b, options) => {
-	  if (!a)
-	    return b
-	  const comp = compare(a.semver, b.semver, options);
-	  return comp > 0 ? a
-	    : comp < 0 ? b
-	    : b.operator === '>' && a.operator === '>=' ? b
-	    : a
-	};
-
-	// <=1.2.3 is higher than <1.2.3
-	const lowerLT = (a, b, options) => {
-	  if (!a)
-	    return b
-	  const comp = compare(a.semver, b.semver, options);
-	  return comp < 0 ? a
-	    : comp > 0 ? b
-	    : b.operator === '<' && a.operator === '<=' ? b
-	    : a
-	};
-
-	subset_1 = subset;
-	return subset_1;
-}
-
-export { requireSubset as __require };
-//# sourceMappingURL=subset.mjs.map

package/dist/esm/node_modules/semver/ranges/subset.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"subset.mjs","sources":["../../../../../../../node_modules/semver/ranges/subset.js"],"sourcesContent":["const Range = require('../classes/range.js')\nconst { ANY } = require('../classes/comparator.js')\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a subset of some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else return false\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n// - If any C is a = range, and GT or LT are set, return false\n// - Else return true\n\nconst subset = (sub, dom, options) => {\n  if (sub === dom)\n    return true\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub)\n        continue OUTER\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull)\n      return false\n  }\n  return true\n}\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom)\n    return true\n\n  if (sub.length === 1 && sub[0].semver === ANY)\n    return dom.length === 1 && dom[0].semver === ANY\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=')\n      gt = higherGT(gt, c, options)\n    else if (c.operator === '<' || c.operator === '<=')\n      lt = lowerLT(lt, c, options)\n    else\n      eqSet.add(c.semver)\n  }\n\n  if (eqSet.size > 1)\n    return null\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0)\n      return null\n    else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<='))\n      return null\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options))\n      return null\n\n    if (lt && !satisfies(eq, String(lt), options))\n      return null\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options))\n        return false\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt)\n          return false\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options))\n        return false\n    }\n    if (lt) {\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt)\n          return false\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options))\n        return false\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0)\n      return false\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0)\n    return false\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0)\n    return false\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a)\n    return b\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a)\n    return b\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;;;CAAA,MAAM,KAAK,GAAGA,YAA8B,GAAA;AAC5C,CAAA,MAAM,EAAE,GAAG,EAAE,GAAGC,iBAAmC,GAAA;CACnD,MAAM,SAAS,GAAGC,gBAAoC,GAAA;CACtD,MAAM,OAAO,GAAGC,cAAkC,GAAA;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,KAAK;GACpC,IAAI,GAAG,KAAK,GAAG;AACjB,KAAI,OAAO,IAAI;AACf;GACE,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,OAAO,EAAC;GAC7B,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,OAAO,EAAC;GAC7B,IAAI,UAAU,GAAG,MAAK;AACxB;GACE,KAAK,EAAE,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,GAAG,EAAE;AAC1C,KAAI,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,GAAG,EAAE;OAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAC;AAC/D,OAAM,UAAU,GAAG,UAAU,IAAI,KAAK,KAAK,KAAI;AAC/C,OAAM,IAAI,KAAK;AACf,SAAQ,SAAS,KAAK;MACjB;AACL;AACA;AACA;AACA;AACA,KAAI,IAAI,UAAU;AAClB,OAAM,OAAO,KAAK;IACf;AACH,GAAE,OAAO,IAAI;GACZ;AACD;CACA,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,KAAK;GAC1C,IAAI,GAAG,KAAK,GAAG;AACjB,KAAI,OAAO,IAAI;AACf;AACA,GAAE,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG;AAC/C,KAAI,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG;AACpD;AACA,GAAE,MAAM,KAAK,GAAG,IAAI,GAAG,GAAE;GACvB,IAAI,EAAE,EAAE,GAAE;AACZ,GAAE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;KACnB,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;OAC3C,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,OAAO,EAAC;UAC1B,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;OAChD,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,EAAE,OAAO,EAAC;AAClC;AACA,OAAM,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAC;IACtB;AACH;AACA,GAAE,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC;AACpB,KAAI,OAAO,IAAI;AACf;AACA,GAAE,IAAI,SAAQ;AACd,GAAE,IAAI,EAAE,IAAI,EAAE,EAAE;AAChB,KAAI,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,OAAO,EAAC;KACjD,IAAI,QAAQ,GAAG,CAAC;AACpB,OAAM,OAAO,IAAI;AACjB,UAAS,IAAI,QAAQ,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,KAAK,IAAI,IAAI,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC;AAC7E,OAAM,OAAO,IAAI;IACd;AACH;AACA;AACA,GAAE,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE;AAC1B,KAAI,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;AACjD,OAAM,OAAO,IAAI;AACjB;AACA,KAAI,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;AACjD,OAAM,OAAO,IAAI;AACjB;AACA,KAAI,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;AACzB,OAAM,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;AAC5C,SAAQ,OAAO,KAAK;MACf;AACL;AACA,KAAI,OAAO,IAAI;IACZ;AACH;GACE,IAAI,MAAM,EAAE,MAAK;GACjB,IAAI,QAAQ,EAAE,SAAQ;AACxB,GAAE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;AACvB,KAAI,QAAQ,GAAG,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAI;AACpE,KAAI,QAAQ,GAAG,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAI;KAChE,IAAI,EAAE,EAAE;AACZ,OAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,EAAE;SAC7C,MAAM,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,OAAO,EAAC;AACzC,SAAQ,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,EAAE;AACzC,WAAU,OAAO,KAAK;QACf,MAAM,IAAI,EAAE,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;AAClF,SAAQ,OAAO,KAAK;MACf;KACD,IAAI,EAAE,EAAE;AACZ,OAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,EAAE;SAC7C,KAAK,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,EAAE,OAAO,EAAC;AACvC,SAAQ,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE;AACvC,WAAU,OAAO,KAAK;QACf,MAAM,IAAI,EAAE,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;AAClF,SAAQ,OAAO,KAAK;MACf;AACL,KAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,QAAQ,KAAK,CAAC;AACnD,OAAM,OAAO,KAAK;IACf;AACH;AACA;AACA;AACA;GACE,IAAI,EAAE,IAAI,QAAQ,IAAI,CAAC,EAAE,IAAI,QAAQ,KAAK,CAAC;AAC7C,KAAI,OAAO,KAAK;AAChB;GACE,IAAI,EAAE,IAAI,QAAQ,IAAI,CAAC,EAAE,IAAI,QAAQ,KAAK,CAAC;AAC7C,KAAI,OAAO,KAAK;AAChB;AACA,GAAE,OAAO,IAAI;GACZ;AACD;AACA;CACA,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,KAAK;GAClC,IAAI,CAAC,CAAC;AACR,KAAI,OAAO,CAAC;AACZ,GAAE,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAC;AACnD,GAAE,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC;AACrB,OAAM,IAAI,GAAG,CAAC,GAAG,CAAC;AAClB,OAAM,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,GAAG,CAAC;AACnD,OAAM,CAAC;GACN;AACD;AACA;CACA,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,KAAK;GACjC,IAAI,CAAC,CAAC;AACR,KAAI,OAAO,CAAC;AACZ,GAAE,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAC;AACnD,GAAE,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC;AACrB,OAAM,IAAI,GAAG,CAAC,GAAG,CAAC;AAClB,OAAM,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,GAAG,CAAC;AACnD,OAAM,CAAC;GACN;AACD;AACA,CAAA,QAAc,GAAG,OAAA;;;;;;"}

package/dist/esm/node_modules/semver/ranges/to-comparators.mjs

@@ -1,21 +0,0 @@
-import { __require as requireRange } from '../classes/range.mjs';
-
-var toComparators_1;
-var hasRequiredToComparators;
-
-function requireToComparators () {
-	if (hasRequiredToComparators) return toComparators_1;
-	hasRequiredToComparators = 1;
-	const Range = requireRange();
-
-	// Mostly just for testing and legacy API reasons
-	const toComparators = (range, options) =>
-	  new Range(range, options).set
-	    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '));
-
-	toComparators_1 = toComparators;
-	return toComparators_1;
-}
-
-export { requireToComparators as __require };
-//# sourceMappingURL=to-comparators.mjs.map

package/dist/esm/node_modules/semver/ranges/to-comparators.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"to-comparators.mjs","sources":["../../../../../../../node_modules/semver/ranges/to-comparators.js"],"sourcesContent":["const Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,MAAM,KAAK,GAAGA,YAA2B,GAAA;AACzC;AACA;AACA,CAAA,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,OAAO;GACnC,IAAI,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG;MAC1B,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAC;AACpE;AACA,CAAA,eAAc,GAAG,cAAA;;;;;;"}

package/dist/esm/node_modules/semver/ranges/valid.mjs

@@ -1,24 +0,0 @@
-import { __require as requireRange } from '../classes/range.mjs';
-
-var valid;
-var hasRequiredValid;
-
-function requireValid () {
-	if (hasRequiredValid) return valid;
-	hasRequiredValid = 1;
-	const Range = requireRange();
-	const validRange = (range, options) => {
-	  try {
-	    // Return '*' instead of '' so that truthiness works.
-	    // This will throw if it's invalid anyway
-	    return new Range(range, options).range || '*'
-	  } catch (er) {
-	    return null
-	  }
-	};
-	valid = validRange;
-	return valid;
-}
-
-export { requireValid as __require };
-//# sourceMappingURL=valid.mjs.map

package/dist/esm/node_modules/semver/ranges/valid.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"valid.mjs","sources":["../../../../../../../node_modules/semver/ranges/valid.js"],"sourcesContent":["const Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n"],"names":["require$$0"],"mappings":";;;;;;;;CAAA,MAAM,KAAK,GAAGA,YAA2B,GAAA;AACzC,CAAA,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,OAAO,KAAK;AACvC,GAAE,IAAI;AACN;AACA;KACI,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,KAAK,IAAI,GAAG;IAC9C,CAAC,OAAO,EAAE,EAAE;AACf,KAAI,OAAO,IAAI;IACZ;GACF;AACD,CAAA,KAAc,GAAG,WAAA;;;;;;"}

package/dist/esm/node_modules/util/node_modules/inherits/inherits.mjs

@@ -1,23 +0,0 @@
-import { i as inherits } from '../../../../_virtual/inherits.mjs';
-import { __require as requireUtil } from '../../util.mjs';
-import { __require as requireInherits_browser } from './inherits_browser.mjs';
-
-var hasRequiredInherits;
-
-function requireInherits () {
-	if (hasRequiredInherits) return inherits.exports;
-	hasRequiredInherits = 1;
-	(function (module) {
-		try {
-		  var util = requireUtil();
-		  if (typeof util.inherits !== 'function') throw '';
-		  module.exports = util.inherits;
-		} catch (e) {
-		  module.exports = requireInherits_browser();
-		}
-} (inherits));
-	return inherits.exports;
-}
-
-export { requireInherits as __require };
-//# sourceMappingURL=inherits.mjs.map

package/dist/esm/node_modules/util/node_modules/inherits/inherits.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"inherits.mjs","sources":["../../../../../../../../node_modules/util/node_modules/inherits/inherits.js"],"sourcesContent":["try {\n  var util = require('util');\n  if (typeof util.inherits !== 'function') throw '';\n  module.exports = util.inherits;\n} catch (e) {\n  module.exports = require('./inherits_browser.js');\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;EAAA,IAAI;AACJ,IAAE,IAAI,IAAI,GAAGA,WAAA,EAAe,CAAC;IAC3B,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,UAAU,EAAE,MAAM,EAAE,CAAC;AACpD,IAAE,MAAiB,CAAA,OAAA,GAAA,IAAI,CAAC,QAAQ,CAAC;GAChC,CAAC,OAAO,CAAC,EAAE;IACV,MAAA,CAAA,OAAA,GAAiBC,yBAAgC,CAAC;AACpD,GAAA;;;;;;;"}

package/dist/esm/node_modules/util/node_modules/inherits/inherits_browser.mjs

@@ -1,35 +0,0 @@
-import { i as inherits_browser } from '../../../../_virtual/inherits_browser.mjs';
-
-var hasRequiredInherits_browser;
-
-function requireInherits_browser () {
-	if (hasRequiredInherits_browser) return inherits_browser.exports;
-	hasRequiredInherits_browser = 1;
-	if (typeof Object.create === 'function') {
-	  // implementation from standard node.js 'util' module
-	  inherits_browser.exports = function inherits(ctor, superCtor) {
-	    ctor.super_ = superCtor;
-	    ctor.prototype = Object.create(superCtor.prototype, {
-	      constructor: {
-	        value: ctor,
-	        enumerable: false,
-	        writable: true,
-	        configurable: true
-	      }
-	    });
-	  };
-	} else {
-	  // old school shim for old browsers
-	  inherits_browser.exports = function inherits(ctor, superCtor) {
-	    ctor.super_ = superCtor;
-	    var TempCtor = function () {};
-	    TempCtor.prototype = superCtor.prototype;
-	    ctor.prototype = new TempCtor();
-	    ctor.prototype.constructor = ctor;
-	  };
-	}
-	return inherits_browser.exports;
-}
-
-export { requireInherits_browser as __require };
-//# sourceMappingURL=inherits_browser.mjs.map

package/dist/esm/node_modules/util/node_modules/inherits/inherits_browser.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"inherits_browser.mjs","sources":["../../../../../../../../node_modules/util/node_modules/inherits/inherits_browser.js"],"sourcesContent":["if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    ctor.prototype = Object.create(superCtor.prototype, {\n      constructor: {\n        value: ctor,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    var TempCtor = function () {}\n    TempCtor.prototype = superCtor.prototype\n    ctor.prototype = new TempCtor()\n    ctor.prototype.constructor = ctor\n  }\n}\n"],"names":["inherits_browserModule"],"mappings":";;;;;;;AAAA,CAAA,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE;AACzC;GACEA,gBAAA,CAAA,OAAc,GAAG,SAAS,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE;AACtD,KAAI,IAAI,CAAC,MAAM,GAAG,UAAS;KACvB,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE;AACxD,OAAM,WAAW,EAAE;SACX,KAAK,EAAE,IAAI;SACX,UAAU,EAAE,KAAK;SACjB,QAAQ,EAAE,IAAI;SACd,YAAY,EAAE,IAAI;QACnB;AACP,MAAK,CAAC,CAAC;AACP,IAAG,CAAC;AACJ,EAAC,MAAM;AACP;GACEA,gBAAA,CAAA,OAAc,GAAG,SAAS,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE;AACtD,KAAI,IAAI,CAAC,MAAM,GAAG,UAAS;AAC3B,KAAI,IAAI,QAAQ,GAAG,YAAY,GAAE;AACjC,KAAI,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,UAAS;AAC5C,KAAI,IAAI,CAAC,SAAS,GAAG,IAAI,QAAQ,GAAE;AACnC,KAAI,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,KAAI;KAClC;AACH,EAAA;;;;;;"}

package/dist/esm/node_modules/util/support/isBuffer.mjs

@@ -1,6 +0,0 @@
-var isBuffer = function isBuffer(arg) {
-  return arg instanceof Buffer;
-};
-
-export { isBuffer as default };
-//# sourceMappingURL=isBuffer.mjs.map

package/dist/esm/node_modules/util/support/isBuffer.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"isBuffer.mjs","sources":["../../../../../../../node_modules/util/support/isBuffer.js"],"sourcesContent":["module.exports = function isBuffer(arg) {\n  return arg instanceof Buffer;\n}\n"],"names":[],"mappings":"AAAA,IAAA,QAAc,GAAG,SAAS,QAAQ,CAAC,GAAG,EAAE;AACxC,EAAE,OAAO,GAAG,YAAY,MAAM,CAAC;AAC/B;;;;"}