start-slicemachine 0.12.62-beta.5 → 0.12.62-beta.7

package/dist/packages/start-slicemachine/_node_modules/semver/ranges/subset.js

@@ -14,19 +14,18 @@ const subset = (sub, dom, options = {}) => {
   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;
-        }
-      }
-      if (sawNonNull) {
-        return 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;
       }
     }
+    if (sawNonNull) {
+      return false;
+    }
+  }
   return true;
 };
 const minimumVersionWithPreRelease = [new Comparator(">=0.0.0-0")];

package/dist/packages/start-slicemachine/_node_modules/semver/ranges/subset.js.map

@@ -1 +1 @@
-{"version":3,"file":"subset.js","sources":["../../../../../../node_modules/semver/ranges/subset.js"],"sourcesContent":["const Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;AAAA,MAAM,QAAQA,aAA8B;AAC5C,MAAM,aAAaC,kBAAmC;AACtD,MAAM,EAAE,IAAK,IAAG;AAChB,MAAM,YAAYC;AAClB,MAAM,UAAUC;AAsChB,MAAM,SAAS,CAAC,KAAK,KAAK,UAAU,CAAA,MAAO;AACzC,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACR;AAED,QAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,QAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,MAAI,aAAa;AAEjB;AAAO,eAAW,aAAa,IAAI,KAAK;AACtC,iBAAW,aAAa,IAAI,KAAK;AAC/B,cAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;AACxD,qBAAa,cAAc,UAAU;AACrC,YAAI,OAAO;AACT,mBAAS;AAAA,QACV;AAAA,MACF;AAKD,UAAI,YAAY;AACd,eAAO;AAAA,MACR;AAAA,IACF;AACD,SAAO;AACT;AAEA,MAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;AACjE,MAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;AAEjD,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACR;AAED,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,QAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,aAAO;AAAA,IACb,WAAe,QAAQ,mBAAmB;AACpC,YAAM;AAAA,IACZ,OAAW;AACL,YAAM;AAAA,IACP;AAAA,EACF;AAED,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,QAAI,QAAQ,mBAAmB;AAC7B,aAAO;AAAA,IACb,OAAW;AACL,YAAM;AAAA,IACP;AAAA,EACF;AAED,QAAM,QAAQ,oBAAI,IAAK;AACvB,MAAI,IAAI;AACR,aAAW,KAAK,KAAK;AACnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,WAAK,SAAS,IAAI,GAAG,OAAO;AAAA,IAClC,WAAe,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AACpD,WAAK,QAAQ,IAAI,GAAG,OAAO;AAAA,IACjC,OAAW;AACL,YAAM,IAAI,EAAE,MAAM;AAAA,IACnB;AAAA,EACF;AAED,MAAI,MAAM,OAAO,GAAG;AAClB,WAAO;AAAA,EACR;AAED,MAAI;AACJ,MAAI,MAAM,IAAI;AACZ,eAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;AAChD,QAAI,WAAW,GAAG;AAChB,aAAO;AAAA,IACb,WAAe,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OAAO;AAC3E,aAAO;AAAA,IACR;AAAA,EACF;AAGD,aAAW,MAAM,OAAO;AACtB,QAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,aAAO;AAAA,IACR;AAED,QAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,aAAO;AAAA,IACR;AAED,eAAW,KAAK,KAAK;AACnB,UAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GAAG;AACtC,eAAO;AAAA,MACR;AAAA,IACF;AAED,WAAO;AAAA,EACR;AAED,MAAI,QAAQ;AACZ,MAAI,UAAU;AAGd,MAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAC5C,MAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,MAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,CAAC,MAAM,GAAG;AAC3D,mBAAe;AAAA,EAChB;AAED,aAAW,KAAK,KAAK;AACnB,eAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,eAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,QAAI,IAAI;AACN,UAAI,cAAc;AAChB,YAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,yBAAe;AAAA,QAChB;AAAA,MACF;AACD,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,iBAAS,SAAS,IAAI,GAAG,OAAO;AAChC,YAAI,WAAW,KAAK,WAAW,IAAI;AACjC,iBAAO;AAAA,QACR;AAAA,MACF,WAAU,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,eAAO;AAAA,MACR;AAAA,IACF;AACD,QAAI,IAAI;AACN,UAAI,cAAc;AAChB,YAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,yBAAe;AAAA,QAChB;AAAA,MACF;AACD,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,gBAAQ,QAAQ,IAAI,GAAG,OAAO;AAC9B,YAAI,UAAU,KAAK,UAAU,IAAI;AAC/B,iBAAO;AAAA,QACR;AAAA,MACF,WAAU,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,eAAO;AAAA,MACR;AAAA,IACF;AACD,QAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAAG;AAC/C,aAAO;AAAA,IACR;AAAA,EACF;AAKD,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,WAAO;AAAA,EACR;AAED,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,WAAO;AAAA,EACR;AAKD,MAAI,gBAAgB,cAAc;AAChC,WAAO;AAAA,EACR;AAED,SAAO;AACT;AAGA,MAAM,WAAW,CAAC,GAAG,GAAG,YAAY;AAClC,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACR;AACD,QAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AACN;AAGA,MAAM,UAAU,CAAC,GAAG,GAAG,YAAY;AACjC,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACR;AACD,QAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AACN;AAEA,IAAA,WAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"subset.js","sources":["../../../../../../node_modules/semver/ranges/subset.js"],"sourcesContent":["const Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;AAAA,MAAM,QAAQA,aAAA;AACd,MAAM,aAAaC,kBAAA;AACnB,MAAM,EAAE,IAAG,IAAK;AAChB,MAAM,YAAYC;AAClB,MAAM,UAAUC;AAsChB,MAAM,SAAS,CAAC,KAAK,KAAK,UAAU,CAAA,MAAO;AACzC,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACX;AAEE,QAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,QAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,MAAI,aAAa;AAEjB,QAAO,YAAW,aAAa,IAAI,KAAK;AACtC,eAAW,aAAa,IAAI,KAAK;AAC/B,YAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;AACxD,mBAAa,cAAc,UAAU;AACrC,UAAI,OAAO;AACT,iBAAS;AAAA,MACjB;AAAA,IACA;AAKI,QAAI,YAAY;AACd,aAAO;AAAA,IACb;AAAA,EACA;AACE,SAAO;AACT;AAEA,MAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;AACjE,MAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;AAEjD,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACX;AAEE,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,QAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,aAAO;AAAA,IACb,WAAe,QAAQ,mBAAmB;AACpC,YAAM;AAAA,IACZ,OAAW;AACL,YAAM;AAAA,IACZ;AAAA,EACA;AAEE,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,QAAI,QAAQ,mBAAmB;AAC7B,aAAO;AAAA,IACb,OAAW;AACL,YAAM;AAAA,IACZ;AAAA,EACA;AAEE,QAAM,QAAQ,oBAAI,IAAG;AACrB,MAAI,IAAI;AACR,aAAW,KAAK,KAAK;AACnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,WAAK,SAAS,IAAI,GAAG,OAAO;AAAA,IAClC,WAAe,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AACpD,WAAK,QAAQ,IAAI,GAAG,OAAO;AAAA,IACjC,OAAW;AACL,YAAM,IAAI,EAAE,MAAM;AAAA,IACxB;AAAA,EACA;AAEE,MAAI,MAAM,OAAO,GAAG;AAClB,WAAO;AAAA,EACX;AAEE,MAAI;AACJ,MAAI,MAAM,IAAI;AACZ,eAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;AAChD,QAAI,WAAW,GAAG;AAChB,aAAO;AAAA,IACb,WAAe,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OAAO;AAC3E,aAAO;AAAA,IACb;AAAA,EACA;AAGE,aAAW,MAAM,OAAO;AACtB,QAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,aAAO;AAAA,IACb;AAEI,QAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,aAAO;AAAA,IACb;AAEI,eAAW,KAAK,KAAK;AACnB,UAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GAAG;AACtC,eAAO;AAAA,MACf;AAAA,IACA;AAEI,WAAO;AAAA,EACX;AAEE,MAAI,QAAQ;AACZ,MAAI,UAAU;AAGd,MAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAC5C,MAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,MAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,CAAC,MAAM,GAAG;AAC3D,mBAAe;AAAA,EACnB;AAEE,aAAW,KAAK,KAAK;AACnB,eAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,eAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,QAAI,IAAI;AACN,UAAI,cAAc;AAChB,YAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,yBAAe;AAAA,QACzB;AAAA,MACA;AACM,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,iBAAS,SAAS,IAAI,GAAG,OAAO;AAChC,YAAI,WAAW,KAAK,WAAW,IAAI;AACjC,iBAAO;AAAA,QACjB;AAAA,MACA,WAAiB,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,eAAO;AAAA,MACf;AAAA,IACA;AACI,QAAI,IAAI;AACN,UAAI,cAAc;AAChB,YAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,yBAAe;AAAA,QACzB;AAAA,MACA;AACM,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,gBAAQ,QAAQ,IAAI,GAAG,OAAO;AAC9B,YAAI,UAAU,KAAK,UAAU,IAAI;AAC/B,iBAAO;AAAA,QACjB;AAAA,MACA,WAAiB,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,eAAO;AAAA,MACf;AAAA,IACA;AACI,QAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAAG;AAC/C,aAAO;AAAA,IACb;AAAA,EACA;AAKE,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,WAAO;AAAA,EACX;AAEE,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,WAAO;AAAA,EACX;AAKE,MAAI,gBAAgB,cAAc;AAChC,WAAO;AAAA,EACX;AAEE,SAAO;AACT;AAGA,MAAM,WAAW,CAAC,GAAG,GAAG,YAAY;AAClC,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACX;AACE,QAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AACN;AAGA,MAAM,UAAU,CAAC,GAAG,GAAG,YAAY;AACjC,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACX;AACE,QAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AACN;AAEA,IAAA,WAAiB;","x_google_ignoreList":[0]}

package/dist/packages/start-slicemachine/_node_modules/semver/ranges/to-comparators.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"to-comparators.cjs","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","range"],"mappings":";;;AAAA,MAAM,QAAQA,MAAAA,UAA2B;AAGzC,MAAM,gBAAgB,CAACC,QAAO,YAC5B,IAAI,MAAMA,QAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAM,EAAC,MAAM,GAAG,CAAC;AAEnE,IAAA,kBAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"to-comparators.cjs","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","range"],"mappings":";;;AAAA,MAAM,QAAQA,MAAAA,UAAA;AAGd,MAAM,gBAAgB,CAACC,QAAO,YAC5B,IAAI,MAAMA,QAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAI,EAAG,MAAM,GAAG,CAAC;AAEnE,IAAA,kBAAiB;;","x_google_ignoreList":[0]}

package/dist/packages/start-slicemachine/_node_modules/semver/ranges/to-comparators.js.map

@@ -1 +1 @@
-{"version":3,"file":"to-comparators.js","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":";AAAA,MAAM,QAAQA,aAA2B;AAGzC,MAAM,gBAAgB,CAAC,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAM,EAAC,MAAM,GAAG,CAAC;AAEnE,IAAA,kBAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"to-comparators.js","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":";AAAA,MAAM,QAAQA,aAAA;AAGd,MAAM,gBAAgB,CAAC,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAI,EAAG,MAAM,GAAG,CAAC;AAEnE,IAAA,kBAAiB;","x_google_ignoreList":[0]}

package/dist/packages/start-slicemachine/_node_modules/semver/ranges/valid.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"valid.cjs","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","range"],"mappings":";;;AAAA,MAAM,QAAQA,MAAAA,UAA2B;AACzC,MAAM,aAAa,CAACC,QAAO,YAAY;AACrC,MAAI;AAGF,WAAO,IAAI,MAAMA,QAAO,OAAO,EAAE,SAAS;AAAA,EAC3C,SAAQ,IAAI;AACX,WAAO;AAAA,EACR;AACH;AACA,IAAA,QAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"valid.cjs","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","range"],"mappings":";;;AAAA,MAAM,QAAQA,MAAAA,UAAA;AACd,MAAM,aAAa,CAACC,QAAO,YAAY;AACrC,MAAI;AAGF,WAAO,IAAI,MAAMA,QAAO,OAAO,EAAE,SAAS;AAAA,EAC9C,SAAW,IAAI;AACX,WAAO;AAAA,EACX;AACA;AACA,IAAA,QAAiB;;","x_google_ignoreList":[0]}

package/dist/packages/start-slicemachine/_node_modules/semver/ranges/valid.js.map

@@ -1 +1 @@
-{"version":3,"file":"valid.js","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":";AAAA,MAAM,QAAQA,aAA2B;AACzC,MAAM,aAAa,CAAC,OAAO,YAAY;AACrC,MAAI;AAGF,WAAO,IAAI,MAAM,OAAO,OAAO,EAAE,SAAS;AAAA,EAC3C,SAAQ,IAAI;AACX,WAAO;AAAA,EACR;AACH;AACA,IAAA,QAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"valid.js","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":";AAAA,MAAM,QAAQA,aAAA;AACd,MAAM,aAAa,CAAC,OAAO,YAAY;AACrC,MAAI;AAGF,WAAO,IAAI,MAAM,OAAO,OAAO,EAAE,SAAS;AAAA,EAC9C,SAAW,IAAI;AACX,WAAO;AAAA,EACX;AACA;AACA,IAAA,QAAiB;","x_google_ignoreList":[0]}

package/dist/packages/start-slicemachine/package.json.cjs

@@ -1,5 +1,5 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const version = "0.12.62-beta.5";
+const version = "0.12.62-beta.7";
 exports.version = version;
 //# sourceMappingURL=package.json.cjs.map

package/dist/packages/start-slicemachine/package.json.js

@@ -1,4 +1,4 @@
-const version = "0.12.62-beta.5";
+const version = "0.12.62-beta.7";
 export {
   version
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "start-slicemachine",
-  "version": "0.12.62-beta.5",
+  "version": "0.12.62-beta.7",
   "description": "Start Slice Machine from within a project.",
   "repository": {
     "type": "git",
@@ -57,7 +57,7 @@
   "dependencies": {
     "@prismicio/mocks": "2.14.0",
     "@prismicio/types-internal": "3.11.2",
-    "@slicemachine/manager": "0.25.4-beta.5",
+    "@slicemachine/manager": "0.25.4-beta.7",
     "body-parser": "^1.20.3",
     "chalk": "^4.1.2",
     "cors": "^2.8.5",
@@ -93,7 +93,7 @@
     "prettier-plugin-jsdoc": "1.1.1",
     "size-limit": "8.2.4",
     "typescript": "4.9.5",
-    "vite": "4.5.14",
+    "vite": "5.4.20",
     "vite-plugin-sdk": "0.1.1",
     "vitest": "0.32.0"
   },

package/dist/lib/checkIsSentryEnabled.cjs

@@ -1,5 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const checkIsSentryEnabled = () => ({}).VITE_ENABLE_SENTRY === void 0 ? true : {}.VITE_ENABLE_SENTRY === "true";
-exports.checkIsSentryEnabled = checkIsSentryEnabled;
-//# sourceMappingURL=checkIsSentryEnabled.cjs.map

package/dist/lib/checkIsSentryEnabled.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"checkIsSentryEnabled.cjs","sources":["../../../src/lib/checkIsSentryEnabled.ts"],"sourcesContent":["/**\n * Checks whether or not Sentry is enabled.\n *\n * Sentry is enabled automatically in production but can be disabled by setting\n * `VITE_ENABLE_SENTRY` to `false`.\n *\n * @returns Whether or not Sentry is enabled.\n */\nexport const checkIsSentryEnabled = (): boolean =>\n\timport.meta.env.VITE_ENABLE_SENTRY === undefined\n\t\t? import.meta.env.PROD\n\t\t: import.meta.env.VITE_ENABLE_SENTRY === \"true\";\n"],"names":[],"mappings":";;AAQa,MAAA,uBAAuB,OACnC,CAAA,GAAgB,uBAAuB,SACpC,OACA,CAAA,EAAgB,uBAAuB;;"}

package/dist/lib/checkIsSentryEnabled.js

@@ -1,5 +0,0 @@
-const checkIsSentryEnabled = () => ({}).VITE_ENABLE_SENTRY === void 0 ? true : {}.VITE_ENABLE_SENTRY === "true";
-export {
-  checkIsSentryEnabled
-};
-//# sourceMappingURL=checkIsSentryEnabled.js.map

package/dist/lib/checkIsSentryEnabled.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"checkIsSentryEnabled.js","sources":["../../../src/lib/checkIsSentryEnabled.ts"],"sourcesContent":["/**\n * Checks whether or not Sentry is enabled.\n *\n * Sentry is enabled automatically in production but can be disabled by setting\n * `VITE_ENABLE_SENTRY` to `false`.\n *\n * @returns Whether or not Sentry is enabled.\n */\nexport const checkIsSentryEnabled = (): boolean =>\n\timport.meta.env.VITE_ENABLE_SENTRY === undefined\n\t\t? import.meta.env.PROD\n\t\t: import.meta.env.VITE_ENABLE_SENTRY === \"true\";\n"],"names":[],"mappings":"AAQa,MAAA,uBAAuB,OACnC,CAAA,GAAgB,uBAAuB,SACpC,OACA,CAAA,EAAgB,uBAAuB;"}