@slicemachine/init 0.1.1-dev-plugins.13 → 0.1.1-dev-plugins-validation.1

package/dist/__node_modules/to-regex-range/index.js

@@ -1,216 +0,0 @@
-import isNumber$1 from "../is-number/index.js";
-/*!
- * to-regex-range <https://github.com/micromatch/to-regex-range>
- *
- * Copyright (c) 2015-present, Jon Schlinkert.
- * Released under the MIT License.
- */
-const isNumber = isNumber$1;
-const toRegexRange = (min, max, options) => {
-  if (isNumber(min) === false) {
-    throw new TypeError("toRegexRange: expected the first argument to be a number");
-  }
-  if (max === void 0 || min === max) {
-    return String(min);
-  }
-  if (isNumber(max) === false) {
-    throw new TypeError("toRegexRange: expected the second argument to be a number.");
-  }
-  let opts = { relaxZeros: true, ...options };
-  if (typeof opts.strictZeros === "boolean") {
-    opts.relaxZeros = opts.strictZeros === false;
-  }
-  let relax = String(opts.relaxZeros);
-  let shorthand = String(opts.shorthand);
-  let capture = String(opts.capture);
-  let wrap = String(opts.wrap);
-  let cacheKey = min + ":" + max + "=" + relax + shorthand + capture + wrap;
-  if (toRegexRange.cache.hasOwnProperty(cacheKey)) {
-    return toRegexRange.cache[cacheKey].result;
-  }
-  let a = Math.min(min, max);
-  let b = Math.max(min, max);
-  if (Math.abs(a - b) === 1) {
-    let result = min + "|" + max;
-    if (opts.capture) {
-      return `(${result})`;
-    }
-    if (opts.wrap === false) {
-      return result;
-    }
-    return `(?:${result})`;
-  }
-  let isPadded = hasPadding(min) || hasPadding(max);
-  let state = { min, max, a, b };
-  let positives = [];
-  let negatives = [];
-  if (isPadded) {
-    state.isPadded = isPadded;
-    state.maxLen = String(state.max).length;
-  }
-  if (a < 0) {
-    let newMin = b < 0 ? Math.abs(b) : 1;
-    negatives = splitToPatterns(newMin, Math.abs(a), state, opts);
-    a = state.a = 0;
-  }
-  if (b >= 0) {
-    positives = splitToPatterns(a, b, state, opts);
-  }
-  state.negatives = negatives;
-  state.positives = positives;
-  state.result = collatePatterns(negatives, positives);
-  if (opts.capture === true) {
-    state.result = `(${state.result})`;
-  } else if (opts.wrap !== false && positives.length + negatives.length > 1) {
-    state.result = `(?:${state.result})`;
-  }
-  toRegexRange.cache[cacheKey] = state;
-  return state.result;
-};
-function collatePatterns(neg, pos, options) {
-  let onlyNegative = filterPatterns(neg, pos, "-", false) || [];
-  let onlyPositive = filterPatterns(pos, neg, "", false) || [];
-  let intersected = filterPatterns(neg, pos, "-?", true) || [];
-  let subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);
-  return subpatterns.join("|");
-}
-function splitToRanges(min, max) {
-  let nines = 1;
-  let zeros = 1;
-  let stop = countNines(min, nines);
-  let stops = /* @__PURE__ */ new Set([max]);
-  while (min <= stop && stop <= max) {
-    stops.add(stop);
-    nines += 1;
-    stop = countNines(min, nines);
-  }
-  stop = countZeros(max + 1, zeros) - 1;
-  while (min < stop && stop <= max) {
-    stops.add(stop);
-    zeros += 1;
-    stop = countZeros(max + 1, zeros) - 1;
-  }
-  stops = [...stops];
-  stops.sort(compare);
-  return stops;
-}
-function rangeToPattern(start, stop, options) {
-  if (start === stop) {
-    return { pattern: start, count: [], digits: 0 };
-  }
-  let zipped = zip(start, stop);
-  let digits = zipped.length;
-  let pattern = "";
-  let count = 0;
-  for (let i = 0; i < digits; i++) {
-    let [startDigit, stopDigit] = zipped[i];
-    if (startDigit === stopDigit) {
-      pattern += startDigit;
-    } else if (startDigit !== "0" || stopDigit !== "9") {
-      pattern += toCharacterClass(startDigit, stopDigit);
-    } else {
-      count++;
-    }
-  }
-  if (count) {
-    pattern += options.shorthand === true ? "\\d" : "[0-9]";
-  }
-  return { pattern, count: [count], digits };
-}
-function splitToPatterns(min, max, tok, options) {
-  let ranges = splitToRanges(min, max);
-  let tokens = [];
-  let start = min;
-  let prev;
-  for (let i = 0; i < ranges.length; i++) {
-    let max2 = ranges[i];
-    let obj = rangeToPattern(String(start), String(max2), options);
-    let zeros = "";
-    if (!tok.isPadded && prev && prev.pattern === obj.pattern) {
-      if (prev.count.length > 1) {
-        prev.count.pop();
-      }
-      prev.count.push(obj.count[0]);
-      prev.string = prev.pattern + toQuantifier(prev.count);
-      start = max2 + 1;
-      continue;
-    }
-    if (tok.isPadded) {
-      zeros = padZeros(max2, tok, options);
-    }
-    obj.string = zeros + obj.pattern + toQuantifier(obj.count);
-    tokens.push(obj);
-    start = max2 + 1;
-    prev = obj;
-  }
-  return tokens;
-}
-function filterPatterns(arr, comparison, prefix, intersection, options) {
-  let result = [];
-  for (let ele of arr) {
-    let { string } = ele;
-    if (!intersection && !contains(comparison, "string", string)) {
-      result.push(prefix + string);
-    }
-    if (intersection && contains(comparison, "string", string)) {
-      result.push(prefix + string);
-    }
-  }
-  return result;
-}
-function zip(a, b) {
-  let arr = [];
-  for (let i = 0; i < a.length; i++)
-    arr.push([a[i], b[i]]);
-  return arr;
-}
-function compare(a, b) {
-  return a > b ? 1 : b > a ? -1 : 0;
-}
-function contains(arr, key, val) {
-  return arr.some((ele) => ele[key] === val);
-}
-function countNines(min, len) {
-  return Number(String(min).slice(0, -len) + "9".repeat(len));
-}
-function countZeros(integer, zeros) {
-  return integer - integer % Math.pow(10, zeros);
-}
-function toQuantifier(digits) {
-  let [start = 0, stop = ""] = digits;
-  if (stop || start > 1) {
-    return `{${start + (stop ? "," + stop : "")}}`;
-  }
-  return "";
-}
-function toCharacterClass(a, b, options) {
-  return `[${a}${b - a === 1 ? "" : "-"}${b}]`;
-}
-function hasPadding(str) {
-  return /^-?(0+)\d/.test(str);
-}
-function padZeros(value, tok, options) {
-  if (!tok.isPadded) {
-    return value;
-  }
-  let diff = Math.abs(tok.maxLen - String(value).length);
-  let relax = options.relaxZeros !== false;
-  switch (diff) {
-    case 0:
-      return "";
-    case 1:
-      return relax ? "0?" : "0";
-    case 2:
-      return relax ? "0{0,2}" : "00";
-    default: {
-      return relax ? `0{0,${diff}}` : `0{${diff}}`;
-    }
-  }
-}
-toRegexRange.cache = {};
-toRegexRange.clearCache = () => toRegexRange.cache = {};
-var toRegexRange_1 = toRegexRange;
-export {
-  toRegexRange_1 as default
-};
-//# sourceMappingURL=index.js.map

package/dist/__node_modules/to-regex-range/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/to-regex-range/index.js"],"sourcesContent":["/*!\n * to-regex-range <https://github.com/micromatch/to-regex-range>\n *\n * Copyright (c) 2015-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nconst isNumber = require('is-number');\n\nconst toRegexRange = (min, max, options) => {\n  if (isNumber(min) === false) {\n    throw new TypeError('toRegexRange: expected the first argument to be a number');\n  }\n\n  if (max === void 0 || min === max) {\n    return String(min);\n  }\n\n  if (isNumber(max) === false) {\n    throw new TypeError('toRegexRange: expected the second argument to be a number.');\n  }\n\n  let opts = { relaxZeros: true, ...options };\n  if (typeof opts.strictZeros === 'boolean') {\n    opts.relaxZeros = opts.strictZeros === false;\n  }\n\n  let relax = String(opts.relaxZeros);\n  let shorthand = String(opts.shorthand);\n  let capture = String(opts.capture);\n  let wrap = String(opts.wrap);\n  let cacheKey = min + ':' + max + '=' + relax + shorthand + capture + wrap;\n\n  if (toRegexRange.cache.hasOwnProperty(cacheKey)) {\n    return toRegexRange.cache[cacheKey].result;\n  }\n\n  let a = Math.min(min, max);\n  let b = Math.max(min, max);\n\n  if (Math.abs(a - b) === 1) {\n    let result = min + '|' + max;\n    if (opts.capture) {\n      return `(${result})`;\n    }\n    if (opts.wrap === false) {\n      return result;\n    }\n    return `(?:${result})`;\n  }\n\n  let isPadded = hasPadding(min) || hasPadding(max);\n  let state = { min, max, a, b };\n  let positives = [];\n  let negatives = [];\n\n  if (isPadded) {\n    state.isPadded = isPadded;\n    state.maxLen = String(state.max).length;\n  }\n\n  if (a < 0) {\n    let newMin = b < 0 ? Math.abs(b) : 1;\n    negatives = splitToPatterns(newMin, Math.abs(a), state, opts);\n    a = state.a = 0;\n  }\n\n  if (b >= 0) {\n    positives = splitToPatterns(a, b, state, opts);\n  }\n\n  state.negatives = negatives;\n  state.positives = positives;\n  state.result = collatePatterns(negatives, positives, opts);\n\n  if (opts.capture === true) {\n    state.result = `(${state.result})`;\n  } else if (opts.wrap !== false && (positives.length + negatives.length) > 1) {\n    state.result = `(?:${state.result})`;\n  }\n\n  toRegexRange.cache[cacheKey] = state;\n  return state.result;\n};\n\nfunction collatePatterns(neg, pos, options) {\n  let onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];\n  let onlyPositive = filterPatterns(pos, neg, '', false, options) || [];\n  let intersected = filterPatterns(neg, pos, '-?', true, options) || [];\n  let subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);\n  return subpatterns.join('|');\n}\n\nfunction splitToRanges(min, max) {\n  let nines = 1;\n  let zeros = 1;\n\n  let stop = countNines(min, nines);\n  let stops = new Set([max]);\n\n  while (min <= stop && stop <= max) {\n    stops.add(stop);\n    nines += 1;\n    stop = countNines(min, nines);\n  }\n\n  stop = countZeros(max + 1, zeros) - 1;\n\n  while (min < stop && stop <= max) {\n    stops.add(stop);\n    zeros += 1;\n    stop = countZeros(max + 1, zeros) - 1;\n  }\n\n  stops = [...stops];\n  stops.sort(compare);\n  return stops;\n}\n\n/**\n * Convert a range to a regex pattern\n * @param {Number} `start`\n * @param {Number} `stop`\n * @return {String}\n */\n\nfunction rangeToPattern(start, stop, options) {\n  if (start === stop) {\n    return { pattern: start, count: [], digits: 0 };\n  }\n\n  let zipped = zip(start, stop);\n  let digits = zipped.length;\n  let pattern = '';\n  let count = 0;\n\n  for (let i = 0; i < digits; i++) {\n    let [startDigit, stopDigit] = zipped[i];\n\n    if (startDigit === stopDigit) {\n      pattern += startDigit;\n\n    } else if (startDigit !== '0' || stopDigit !== '9') {\n      pattern += toCharacterClass(startDigit, stopDigit, options);\n\n    } else {\n      count++;\n    }\n  }\n\n  if (count) {\n    pattern += options.shorthand === true ? '\\\\d' : '[0-9]';\n  }\n\n  return { pattern, count: [count], digits };\n}\n\nfunction splitToPatterns(min, max, tok, options) {\n  let ranges = splitToRanges(min, max);\n  let tokens = [];\n  let start = min;\n  let prev;\n\n  for (let i = 0; i < ranges.length; i++) {\n    let max = ranges[i];\n    let obj = rangeToPattern(String(start), String(max), options);\n    let zeros = '';\n\n    if (!tok.isPadded && prev && prev.pattern === obj.pattern) {\n      if (prev.count.length > 1) {\n        prev.count.pop();\n      }\n\n      prev.count.push(obj.count[0]);\n      prev.string = prev.pattern + toQuantifier(prev.count);\n      start = max + 1;\n      continue;\n    }\n\n    if (tok.isPadded) {\n      zeros = padZeros(max, tok, options);\n    }\n\n    obj.string = zeros + obj.pattern + toQuantifier(obj.count);\n    tokens.push(obj);\n    start = max + 1;\n    prev = obj;\n  }\n\n  return tokens;\n}\n\nfunction filterPatterns(arr, comparison, prefix, intersection, options) {\n  let result = [];\n\n  for (let ele of arr) {\n    let { string } = ele;\n\n    // only push if _both_ are negative...\n    if (!intersection && !contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n\n    // or _both_ are positive\n    if (intersection && contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n  }\n  return result;\n}\n\n/**\n * Zip strings\n */\n\nfunction zip(a, b) {\n  let arr = [];\n  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);\n  return arr;\n}\n\nfunction compare(a, b) {\n  return a > b ? 1 : b > a ? -1 : 0;\n}\n\nfunction contains(arr, key, val) {\n  return arr.some(ele => ele[key] === val);\n}\n\nfunction countNines(min, len) {\n  return Number(String(min).slice(0, -len) + '9'.repeat(len));\n}\n\nfunction countZeros(integer, zeros) {\n  return integer - (integer % Math.pow(10, zeros));\n}\n\nfunction toQuantifier(digits) {\n  let [start = 0, stop = ''] = digits;\n  if (stop || start > 1) {\n    return `{${start + (stop ? ',' + stop : '')}}`;\n  }\n  return '';\n}\n\nfunction toCharacterClass(a, b, options) {\n  return `[${a}${(b - a === 1) ? '' : '-'}${b}]`;\n}\n\nfunction hasPadding(str) {\n  return /^-?(0+)\\d/.test(str);\n}\n\nfunction padZeros(value, tok, options) {\n  if (!tok.isPadded) {\n    return value;\n  }\n\n  let diff = Math.abs(tok.maxLen - String(value).length);\n  let relax = options.relaxZeros !== false;\n\n  switch (diff) {\n    case 0:\n      return '';\n    case 1:\n      return relax ? '0?' : '0';\n    case 2:\n      return relax ? '0{0,2}' : '00';\n    default: {\n      return relax ? `0{0,${diff}}` : `0{${diff}}`;\n    }\n  }\n}\n\n/**\n * Cache\n */\n\ntoRegexRange.cache = {};\ntoRegexRange.clearCache = () => (toRegexRange.cache = {});\n\n/**\n * Expose `toRegexRange`\n */\n\nmodule.exports = toRegexRange;\n"],"names":["require$$0","max"],"mappings":";;;;;;;AASA,MAAM,WAAWA;AAEjB,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAC/E;AAED,MAAI,QAAQ,UAAU,QAAQ,KAAK;AACjC,WAAO,OAAO,GAAG;AAAA,EAClB;AAED,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,4DAA4D;AAAA,EACjF;AAED,MAAI,OAAO,EAAE,YAAY,MAAM,GAAG,QAAO;AACzC,MAAI,OAAO,KAAK,gBAAgB,WAAW;AACzC,SAAK,aAAa,KAAK,gBAAgB;AAAA,EACxC;AAED,MAAI,QAAQ,OAAO,KAAK,UAAU;AAClC,MAAI,YAAY,OAAO,KAAK,SAAS;AACrC,MAAI,UAAU,OAAO,KAAK,OAAO;AACjC,MAAI,OAAO,OAAO,KAAK,IAAI;AAC3B,MAAI,WAAW,MAAM,MAAM,MAAM,MAAM,QAAQ,YAAY,UAAU;AAErE,MAAI,aAAa,MAAM,eAAe,QAAQ,GAAG;AAC/C,WAAO,aAAa,MAAM,QAAQ,EAAE;AAAA,EACrC;AAED,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACzB,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAEzB,MAAI,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AACzB,QAAI,SAAS,MAAM,MAAM;AACzB,QAAI,KAAK,SAAS;AAChB,aAAO,IAAI;AAAA,IACZ;AACD,QAAI,KAAK,SAAS,OAAO;AACvB,aAAO;AAAA,IACR;AACD,WAAO,MAAM;AAAA,EACd;AAED,MAAI,WAAW,WAAW,GAAG,KAAK,WAAW,GAAG;AAChD,MAAI,QAAQ,EAAE,KAAK,KAAK,GAAG,EAAC;AAC5B,MAAI,YAAY,CAAA;AAChB,MAAI,YAAY,CAAA;AAEhB,MAAI,UAAU;AACZ,UAAM,WAAW;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AAAA,EAClC;AAED,MAAI,IAAI,GAAG;AACT,QAAI,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;AACnC,gBAAY,gBAAgB,QAAQ,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI;AAC5D,QAAI,MAAM,IAAI;AAAA,EACf;AAED,MAAI,KAAK,GAAG;AACV,gBAAY,gBAAgB,GAAG,GAAG,OAAO,IAAI;AAAA,EAC9C;AAED,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,SAAS,gBAAgB,WAAW,SAAe;AAEzD,MAAI,KAAK,YAAY,MAAM;AACzB,UAAM,SAAS,IAAI,MAAM;AAAA,EAC7B,WAAa,KAAK,SAAS,SAAU,UAAU,SAAS,UAAU,SAAU,GAAG;AAC3E,UAAM,SAAS,MAAM,MAAM;AAAA,EAC5B;AAED,eAAa,MAAM,QAAQ,IAAI;AAC/B,SAAO,MAAM;AACf;AAEA,SAAS,gBAAgB,KAAK,KAAK,SAAS;AAC1C,MAAI,eAAe,eAAe,KAAK,KAAK,KAAK,KAAc,KAAK;AACpE,MAAI,eAAe,eAAe,KAAK,KAAK,IAAI,KAAc,KAAK;AACnE,MAAI,cAAc,eAAe,KAAK,KAAK,MAAM,IAAa,KAAK;AACnE,MAAI,cAAc,aAAa,OAAO,WAAW,EAAE,OAAO,YAAY;AACtE,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,cAAc,KAAK,KAAK;AAC/B,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAEZ,MAAI,OAAO,WAAW,KAAK,KAAK;AAChC,MAAI,QAAQ,oBAAI,IAAI,CAAC,GAAG,CAAC;AAEzB,SAAO,OAAO,QAAQ,QAAQ,KAAK;AACjC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,KAAK,KAAK;AAAA,EAC7B;AAED,SAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAEpC,SAAO,MAAM,QAAQ,QAAQ,KAAK;AAChC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAAA,EACrC;AAED,UAAQ,CAAC,GAAG,KAAK;AACjB,QAAM,KAAK,OAAO;AAClB,SAAO;AACT;AASA,SAAS,eAAe,OAAO,MAAM,SAAS;AAC5C,MAAI,UAAU,MAAM;AAClB,WAAO,EAAE,SAAS,OAAO,OAAO,CAAA,GAAI,QAAQ;EAC7C;AAED,MAAI,SAAS,IAAI,OAAO,IAAI;AAC5B,MAAI,SAAS,OAAO;AACpB,MAAI,UAAU;AACd,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,CAAC,YAAY,SAAS,IAAI,OAAO,CAAC;AAEtC,QAAI,eAAe,WAAW;AAC5B,iBAAW;AAAA,IAEZ,WAAU,eAAe,OAAO,cAAc,KAAK;AAClD,iBAAW,iBAAiB,YAAY,SAAkB;AAAA,IAEhE,OAAW;AACL;AAAA,IACD;AAAA,EACF;AAED,MAAI,OAAO;AACT,eAAW,QAAQ,cAAc,OAAO,QAAQ;AAAA,EACjD;AAED,SAAO,EAAE,SAAS,OAAO,CAAC,KAAK,GAAG,OAAM;AAC1C;AAEA,SAAS,gBAAgB,KAAK,KAAK,KAAK,SAAS;AAC/C,MAAI,SAAS,cAAc,KAAK,GAAG;AACnC,MAAI,SAAS,CAAA;AACb,MAAI,QAAQ;AACZ,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAIC,OAAM,OAAO,CAAC;AAClB,QAAI,MAAM,eAAe,OAAO,KAAK,GAAG,OAAOA,IAAG,GAAG,OAAO;AAC5D,QAAI,QAAQ;AAEZ,QAAI,CAAC,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,SAAS;AACzD,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,MAAM;MACZ;AAED,WAAK,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAC5B,WAAK,SAAS,KAAK,UAAU,aAAa,KAAK,KAAK;AACpD,cAAQA,OAAM;AACd;AAAA,IACD;AAED,QAAI,IAAI,UAAU;AAChB,cAAQ,SAASA,MAAK,KAAK,OAAO;AAAA,IACnC;AAED,QAAI,SAAS,QAAQ,IAAI,UAAU,aAAa,IAAI,KAAK;AACzD,WAAO,KAAK,GAAG;AACf,YAAQA,OAAM;AACd,WAAO;AAAA,EACR;AAED,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,YAAY,QAAQ,cAAc,SAAS;AACtE,MAAI,SAAS,CAAA;AAEb,WAAS,OAAO,KAAK;AACnB,QAAI,EAAE,OAAQ,IAAG;AAGjB,QAAI,CAAC,gBAAgB,CAAC,SAAS,YAAY,UAAU,MAAM,GAAG;AAC5D,aAAO,KAAK,SAAS,MAAM;AAAA,IAC5B;AAGD,QAAI,gBAAgB,SAAS,YAAY,UAAU,MAAM,GAAG;AAC1D,aAAO,KAAK,SAAS,MAAM;AAAA,IAC5B;AAAA,EACF;AACD,SAAO;AACT;AAMA,SAAS,IAAI,GAAG,GAAG;AACjB,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,QAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,QAAQ,GAAG,GAAG;AACrB,SAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAClC;AAEA,SAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,SAAO,IAAI,KAAK,SAAO,IAAI,GAAG,MAAM,GAAG;AACzC;AAEA,SAAS,WAAW,KAAK,KAAK;AAC5B,SAAO,OAAO,OAAO,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI,IAAI,OAAO,GAAG,CAAC;AAC5D;AAEA,SAAS,WAAW,SAAS,OAAO;AAClC,SAAO,UAAW,UAAU,KAAK,IAAI,IAAI,KAAK;AAChD;AAEA,SAAS,aAAa,QAAQ;AAC5B,MAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI;AAC7B,MAAI,QAAQ,QAAQ,GAAG;AACrB,WAAO,IAAI,SAAS,OAAO,MAAM,OAAO;AAAA,EACzC;AACD,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAG,GAAG,SAAS;AACvC,SAAO,IAAI,IAAK,IAAI,MAAM,IAAK,KAAK,MAAM;AAC5C;AAEA,SAAS,WAAW,KAAK;AACvB,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,SAAS,OAAO,KAAK,SAAS;AACrC,MAAI,CAAC,IAAI,UAAU;AACjB,WAAO;AAAA,EACR;AAED,MAAI,OAAO,KAAK,IAAI,IAAI,SAAS,OAAO,KAAK,EAAE,MAAM;AACrD,MAAI,QAAQ,QAAQ,eAAe;AAEnC,UAAQ,MAAI;AAAA,IACV,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO,QAAQ,WAAW;AAAA,IAC5B,SAAS;AACP,aAAO,QAAQ,OAAO,UAAU,KAAK;AAAA,IACtC;AAAA,EACF;AACH;AAMA,aAAa,QAAQ,CAAA;AACrB,aAAa,aAAa,MAAO,aAAa,QAAQ,CAAE;AAMxD,IAAA,iBAAiB;"}

package/dist/__node_modules/trim-newlines/index.cjs

@@ -1,29 +0,0 @@
-"use strict";
-function trimNewlines(string) {
-  let start = 0;
-  let end = string.length;
-  while (start < end && (string[start] === "\r" || string[start] === "\n")) {
-    start++;
-  }
-  while (end > start && (string[end - 1] === "\r" || string[end - 1] === "\n")) {
-    end--;
-  }
-  return start > 0 || end < string.length ? string.slice(start, end) : string;
-}
-trimNewlines.start = (string) => {
-  const end = string.length;
-  let start = 0;
-  while (start < end && (string[start] === "\r" || string[start] === "\n")) {
-    start++;
-  }
-  return start > 0 ? string.slice(start, end) : string;
-};
-trimNewlines.end = (string) => {
-  let end = string.length;
-  while (end > 0 && (string[end - 1] === "\r" || string[end - 1] === "\n")) {
-    end--;
-  }
-  return end < string.length ? string.slice(0, end) : string;
-};
-module.exports = trimNewlines;
-//# sourceMappingURL=index.cjs.map

package/dist/__node_modules/trim-newlines/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/trim-newlines/index.js"],"sourcesContent":["export default function trimNewlines(string) {\n\tlet start = 0;\n\tlet end = string.length;\n\n\twhile (start < end && (string[start] === '\\r' || string[start] === '\\n')) {\n\t\tstart++;\n\t}\n\n\twhile (end > start && (string[end - 1] === '\\r' || string[end - 1] === '\\n')) {\n\t\tend--;\n\t}\n\n\treturn (start > 0 || end < string.length) ? string.slice(start, end) : string;\n}\n\ntrimNewlines.start = string => {\n\tconst end = string.length;\n\tlet start = 0;\n\n\twhile (start < end && (string[start] === '\\r' || string[start] === '\\n')) {\n\t\tstart++;\n\t}\n\n\treturn start > 0 ? string.slice(start, end) : string;\n};\n\ntrimNewlines.end = string => {\n\tlet end = string.length;\n\n\twhile (end > 0 && (string[end - 1] === '\\r' || string[end - 1] === '\\n')) {\n\t\tend--;\n\t}\n\n\treturn end < string.length ? string.slice(0, end) : string;\n};\n"],"names":[],"mappings":";AAAe,SAAS,aAAa,QAAQ;AAC5C,MAAI,QAAQ;AACZ,MAAI,MAAM,OAAO;AAEjB,SAAO,QAAQ,QAAQ,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,OAAO;AACzE;AAAA,EACA;AAED,SAAO,MAAM,UAAU,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,MAAM,CAAC,MAAM,OAAO;AAC7E;AAAA,EACA;AAED,SAAQ,QAAQ,KAAK,MAAM,OAAO,SAAU,OAAO,MAAM,OAAO,GAAG,IAAI;AACxE;AAEA,aAAa,QAAQ,YAAU;AAC9B,QAAM,MAAM,OAAO;AACnB,MAAI,QAAQ;AAEZ,SAAO,QAAQ,QAAQ,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,OAAO;AACzE;AAAA,EACA;AAED,SAAO,QAAQ,IAAI,OAAO,MAAM,OAAO,GAAG,IAAI;AAC/C;AAEA,aAAa,MAAM,YAAU;AAC5B,MAAI,MAAM,OAAO;AAEjB,SAAO,MAAM,MAAM,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,MAAM,CAAC,MAAM,OAAO;AACzE;AAAA,EACA;AAED,SAAO,MAAM,OAAO,SAAS,OAAO,MAAM,GAAG,GAAG,IAAI;AACrD;;"}

package/dist/__node_modules/trim-newlines/index.js

@@ -1,30 +0,0 @@
-function trimNewlines(string) {
-  let start = 0;
-  let end = string.length;
-  while (start < end && (string[start] === "\r" || string[start] === "\n")) {
-    start++;
-  }
-  while (end > start && (string[end - 1] === "\r" || string[end - 1] === "\n")) {
-    end--;
-  }
-  return start > 0 || end < string.length ? string.slice(start, end) : string;
-}
-trimNewlines.start = (string) => {
-  const end = string.length;
-  let start = 0;
-  while (start < end && (string[start] === "\r" || string[start] === "\n")) {
-    start++;
-  }
-  return start > 0 ? string.slice(start, end) : string;
-};
-trimNewlines.end = (string) => {
-  let end = string.length;
-  while (end > 0 && (string[end - 1] === "\r" || string[end - 1] === "\n")) {
-    end--;
-  }
-  return end < string.length ? string.slice(0, end) : string;
-};
-export {
-  trimNewlines as default
-};
-//# sourceMappingURL=index.js.map

package/dist/__node_modules/trim-newlines/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/trim-newlines/index.js"],"sourcesContent":["export default function trimNewlines(string) {\n\tlet start = 0;\n\tlet end = string.length;\n\n\twhile (start < end && (string[start] === '\\r' || string[start] === '\\n')) {\n\t\tstart++;\n\t}\n\n\twhile (end > start && (string[end - 1] === '\\r' || string[end - 1] === '\\n')) {\n\t\tend--;\n\t}\n\n\treturn (start > 0 || end < string.length) ? string.slice(start, end) : string;\n}\n\ntrimNewlines.start = string => {\n\tconst end = string.length;\n\tlet start = 0;\n\n\twhile (start < end && (string[start] === '\\r' || string[start] === '\\n')) {\n\t\tstart++;\n\t}\n\n\treturn start > 0 ? string.slice(start, end) : string;\n};\n\ntrimNewlines.end = string => {\n\tlet end = string.length;\n\n\twhile (end > 0 && (string[end - 1] === '\\r' || string[end - 1] === '\\n')) {\n\t\tend--;\n\t}\n\n\treturn end < string.length ? string.slice(0, end) : string;\n};\n"],"names":[],"mappings":"AAAe,SAAS,aAAa,QAAQ;AAC5C,MAAI,QAAQ;AACZ,MAAI,MAAM,OAAO;AAEjB,SAAO,QAAQ,QAAQ,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,OAAO;AACzE;AAAA,EACA;AAED,SAAO,MAAM,UAAU,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,MAAM,CAAC,MAAM,OAAO;AAC7E;AAAA,EACA;AAED,SAAQ,QAAQ,KAAK,MAAM,OAAO,SAAU,OAAO,MAAM,OAAO,GAAG,IAAI;AACxE;AAEA,aAAa,QAAQ,YAAU;AAC9B,QAAM,MAAM,OAAO;AACnB,MAAI,QAAQ;AAEZ,SAAO,QAAQ,QAAQ,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,OAAO;AACzE;AAAA,EACA;AAED,SAAO,QAAQ,IAAI,OAAO,MAAM,OAAO,GAAG,IAAI;AAC/C;AAEA,aAAa,MAAM,YAAU;AAC5B,MAAI,MAAM,OAAO;AAEjB,SAAO,MAAM,MAAM,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,MAAM,CAAC,MAAM,OAAO;AACzE;AAAA,EACA;AAED,SAAO,MAAM,OAAO,SAAS,OAAO,MAAM,GAAG,GAAG,IAAI;AACrD;"}

package/dist/__node_modules/validate-npm-package-license/index.cjs

@@ -1,70 +0,0 @@
-"use strict";
-const index = require("../spdx-expression-parse/index.cjs");
-const index$1 = require("../spdx-correct/index.cjs");
-var parse = index;
-var correct = index$1;
-var genericWarning = 'license should be a valid SPDX license expression (without "LicenseRef"), "UNLICENSED", or "SEE LICENSE IN <filename>"';
-var fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;
-function startsWith(prefix, string) {
-  return string.slice(0, prefix.length) === prefix;
-}
-function usesLicenseRef(ast) {
-  if (ast.hasOwnProperty("license")) {
-    var license = ast.license;
-    return startsWith("LicenseRef", license) || startsWith("DocumentRef", license);
-  } else {
-    return usesLicenseRef(ast.left) || usesLicenseRef(ast.right);
-  }
-}
-var validateNpmPackageLicense = function(argument) {
-  var ast;
-  try {
-    ast = parse(argument);
-  } catch (e) {
-    var match;
-    if (argument === "UNLICENSED" || argument === "UNLICENCED") {
-      return {
-        validForOldPackages: true,
-        validForNewPackages: true,
-        unlicensed: true
-      };
-    } else if (match = fileReferenceRE.exec(argument)) {
-      return {
-        validForOldPackages: true,
-        validForNewPackages: true,
-        inFile: match[1]
-      };
-    } else {
-      var result = {
-        validForOldPackages: false,
-        validForNewPackages: false,
-        warnings: [genericWarning]
-      };
-      if (argument.trim().length !== 0) {
-        var corrected = correct(argument);
-        if (corrected) {
-          result.warnings.push(
-            'license is similar to the valid expression "' + corrected + '"'
-          );
-        }
-      }
-      return result;
-    }
-  }
-  if (usesLicenseRef(ast)) {
-    return {
-      validForNewPackages: false,
-      validForOldPackages: false,
-      spdx: true,
-      warnings: [genericWarning]
-    };
-  } else {
-    return {
-      validForNewPackages: true,
-      validForOldPackages: true,
-      spdx: true
-    };
-  }
-};
-module.exports = validateNpmPackageLicense;
-//# sourceMappingURL=index.cjs.map

package/dist/__node_modules/validate-npm-package-license/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/validate-npm-package-license/index.js"],"sourcesContent":["var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n  'license should be ' +\n  'a valid SPDX license expression (without \"LicenseRef\"), ' +\n  '\"UNLICENSED\", or ' +\n  '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n  return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n  if (ast.hasOwnProperty('license')) {\n    var license = ast.license;\n    return (\n      startsWith('LicenseRef', license) ||\n      startsWith('DocumentRef', license)\n    );\n  } else {\n    return (\n      usesLicenseRef(ast.left) ||\n      usesLicenseRef(ast.right)\n    );\n  }\n}\n\nmodule.exports = function(argument) {\n  var ast;\n\n  try {\n    ast = parse(argument);\n  } catch (e) {\n    var match\n    if (\n      argument === 'UNLICENSED' ||\n      argument === 'UNLICENCED'\n    ) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        unlicensed: true\n      };\n    } else if (match = fileReferenceRE.exec(argument)) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        inFile: match[1]\n      };\n    } else {\n      var result = {\n        validForOldPackages: false,\n        validForNewPackages: false,\n        warnings: [genericWarning]\n      };\n      if (argument.trim().length !== 0) {\n        var corrected = correct(argument);\n        if (corrected) {\n          result.warnings.push(\n            'license is similar to the valid expression \"' + corrected + '\"'\n          );\n        }\n      }\n      return result;\n    }\n  }\n\n  if (usesLicenseRef(ast)) {\n    return {\n      validForNewPackages: false,\n      validForOldPackages: false,\n      spdx: true,\n      warnings: [genericWarning]\n    };\n  } else {\n    return {\n      validForNewPackages: true,\n      validForOldPackages: true,\n      spdx: true\n    };\n  }\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;AAAA,IAAI,QAAQA;AACZ,IAAI,UAAUC;AAEd,IAAI,iBACF;AAMF,IAAI,kBAAkB;AAEtB,SAAS,WAAW,QAAQ,QAAQ;AAClC,SAAO,OAAO,MAAM,GAAG,OAAO,MAAM,MAAM;AAC5C;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,IAAI,eAAe,SAAS,GAAG;AACjC,QAAI,UAAU,IAAI;AAClB,WACE,WAAW,cAAc,OAAO,KAChC,WAAW,eAAe,OAAO;AAAA,EAEvC,OAAS;AACL,WACE,eAAe,IAAI,IAAI,KACvB,eAAe,IAAI,KAAK;AAAA,EAE3B;AACH;IAEA,4BAAiB,SAAS,UAAU;AAClC,MAAI;AAEJ,MAAI;AACF,UAAM,MAAM,QAAQ;AAAA,EACrB,SAAQ,GAAP;AACA,QAAI;AACJ,QACE,aAAa,gBACb,aAAa,cACb;AACA,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,YAAY;AAAA,MACpB;AAAA,IACK,WAAU,QAAQ,gBAAgB,KAAK,QAAQ,GAAG;AACjD,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,QAAQ,MAAM,CAAC;AAAA,MACvB;AAAA,IACA,OAAW;AACL,UAAI,SAAS;AAAA,QACX,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,UAAU,CAAC,cAAc;AAAA,MACjC;AACM,UAAI,SAAS,OAAO,WAAW,GAAG;AAChC,YAAI,YAAY,QAAQ,QAAQ;AAChC,YAAI,WAAW;AACb,iBAAO,SAAS;AAAA,YACd,iDAAiD,YAAY;AAAA,UACzE;AAAA,QACS;AAAA,MACF;AACD,aAAO;AAAA,IACR;AAAA,EACF;AAED,MAAI,eAAe,GAAG,GAAG;AACvB,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,MACN,UAAU,CAAC,cAAc;AAAA,IAC/B;AAAA,EACA,OAAS;AACL,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,IACZ;AAAA,EACG;AACH;;"}

package/dist/__node_modules/validate-npm-package-license/index.js

@@ -1,71 +0,0 @@
-import spdxExpressionParse from "../spdx-expression-parse/index.js";
-import spdxCorrect from "../spdx-correct/index.js";
-var parse = spdxExpressionParse;
-var correct = spdxCorrect;
-var genericWarning = 'license should be a valid SPDX license expression (without "LicenseRef"), "UNLICENSED", or "SEE LICENSE IN <filename>"';
-var fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;
-function startsWith(prefix, string) {
-  return string.slice(0, prefix.length) === prefix;
-}
-function usesLicenseRef(ast) {
-  if (ast.hasOwnProperty("license")) {
-    var license = ast.license;
-    return startsWith("LicenseRef", license) || startsWith("DocumentRef", license);
-  } else {
-    return usesLicenseRef(ast.left) || usesLicenseRef(ast.right);
-  }
-}
-var validateNpmPackageLicense = function(argument) {
-  var ast;
-  try {
-    ast = parse(argument);
-  } catch (e) {
-    var match;
-    if (argument === "UNLICENSED" || argument === "UNLICENCED") {
-      return {
-        validForOldPackages: true,
-        validForNewPackages: true,
-        unlicensed: true
-      };
-    } else if (match = fileReferenceRE.exec(argument)) {
-      return {
-        validForOldPackages: true,
-        validForNewPackages: true,
-        inFile: match[1]
-      };
-    } else {
-      var result = {
-        validForOldPackages: false,
-        validForNewPackages: false,
-        warnings: [genericWarning]
-      };
-      if (argument.trim().length !== 0) {
-        var corrected = correct(argument);
-        if (corrected) {
-          result.warnings.push(
-            'license is similar to the valid expression "' + corrected + '"'
-          );
-        }
-      }
-      return result;
-    }
-  }
-  if (usesLicenseRef(ast)) {
-    return {
-      validForNewPackages: false,
-      validForOldPackages: false,
-      spdx: true,
-      warnings: [genericWarning]
-    };
-  } else {
-    return {
-      validForNewPackages: true,
-      validForOldPackages: true,
-      spdx: true
-    };
-  }
-};
-export {
-  validateNpmPackageLicense as default
-};
-//# sourceMappingURL=index.js.map

package/dist/__node_modules/validate-npm-package-license/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/validate-npm-package-license/index.js"],"sourcesContent":["var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n  'license should be ' +\n  'a valid SPDX license expression (without \"LicenseRef\"), ' +\n  '\"UNLICENSED\", or ' +\n  '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n  return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n  if (ast.hasOwnProperty('license')) {\n    var license = ast.license;\n    return (\n      startsWith('LicenseRef', license) ||\n      startsWith('DocumentRef', license)\n    );\n  } else {\n    return (\n      usesLicenseRef(ast.left) ||\n      usesLicenseRef(ast.right)\n    );\n  }\n}\n\nmodule.exports = function(argument) {\n  var ast;\n\n  try {\n    ast = parse(argument);\n  } catch (e) {\n    var match\n    if (\n      argument === 'UNLICENSED' ||\n      argument === 'UNLICENCED'\n    ) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        unlicensed: true\n      };\n    } else if (match = fileReferenceRE.exec(argument)) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        inFile: match[1]\n      };\n    } else {\n      var result = {\n        validForOldPackages: false,\n        validForNewPackages: false,\n        warnings: [genericWarning]\n      };\n      if (argument.trim().length !== 0) {\n        var corrected = correct(argument);\n        if (corrected) {\n          result.warnings.push(\n            'license is similar to the valid expression \"' + corrected + '\"'\n          );\n        }\n      }\n      return result;\n    }\n  }\n\n  if (usesLicenseRef(ast)) {\n    return {\n      validForNewPackages: false,\n      validForOldPackages: false,\n      spdx: true,\n      warnings: [genericWarning]\n    };\n  } else {\n    return {\n      validForNewPackages: true,\n      validForOldPackages: true,\n      spdx: true\n    };\n  }\n};\n"],"names":["require$$0","require$$1"],"mappings":";;AAAA,IAAI,QAAQA;AACZ,IAAI,UAAUC;AAEd,IAAI,iBACF;AAMF,IAAI,kBAAkB;AAEtB,SAAS,WAAW,QAAQ,QAAQ;AAClC,SAAO,OAAO,MAAM,GAAG,OAAO,MAAM,MAAM;AAC5C;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,IAAI,eAAe,SAAS,GAAG;AACjC,QAAI,UAAU,IAAI;AAClB,WACE,WAAW,cAAc,OAAO,KAChC,WAAW,eAAe,OAAO;AAAA,EAEvC,OAAS;AACL,WACE,eAAe,IAAI,IAAI,KACvB,eAAe,IAAI,KAAK;AAAA,EAE3B;AACH;IAEA,4BAAiB,SAAS,UAAU;AAClC,MAAI;AAEJ,MAAI;AACF,UAAM,MAAM,QAAQ;AAAA,EACrB,SAAQ,GAAP;AACA,QAAI;AACJ,QACE,aAAa,gBACb,aAAa,cACb;AACA,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,YAAY;AAAA,MACpB;AAAA,IACK,WAAU,QAAQ,gBAAgB,KAAK,QAAQ,GAAG;AACjD,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,QAAQ,MAAM,CAAC;AAAA,MACvB;AAAA,IACA,OAAW;AACL,UAAI,SAAS;AAAA,QACX,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,UAAU,CAAC,cAAc;AAAA,MACjC;AACM,UAAI,SAAS,OAAO,WAAW,GAAG;AAChC,YAAI,YAAY,QAAQ,QAAQ;AAChC,YAAI,WAAW;AACb,iBAAO,SAAS;AAAA,YACd,iDAAiD,YAAY;AAAA,UACzE;AAAA,QACS;AAAA,MACF;AACD,aAAO;AAAA,IACR;AAAA,EACF;AAED,MAAI,eAAe,GAAG,GAAG;AACvB,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,MACN,UAAU,CAAC,cAAc;AAAA,IAC/B;AAAA,EACA,OAAS;AACL,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,IACZ;AAAA,EACG;AACH;"}

package/dist/__node_modules/which/which.cjs

@@ -1,95 +0,0 @@
-"use strict";
-const require$$0 = require("path");
-const index = require("../isexe/index.cjs");
-const isWindows = process.platform === "win32" || process.env.OSTYPE === "cygwin" || process.env.OSTYPE === "msys";
-const path = require$$0;
-const COLON = isWindows ? ";" : ":";
-const isexe = index;
-const getNotFoundError = (cmd) => Object.assign(new Error(`not found: ${cmd}`), { code: "ENOENT" });
-const getPathInfo = (cmd, opt) => {
-  const colon = opt.colon || COLON;
-  const pathEnv = cmd.match(/\//) || isWindows && cmd.match(/\\/) ? [""] : [
-    // windows always checks the cwd first
-    ...isWindows ? [process.cwd()] : [],
-    ...(opt.path || process.env.PATH || /* istanbul ignore next: very unusual */
-    "").split(colon)
-  ];
-  const pathExtExe = isWindows ? opt.pathExt || process.env.PATHEXT || ".EXE;.CMD;.BAT;.COM" : "";
-  const pathExt = isWindows ? pathExtExe.split(colon) : [""];
-  if (isWindows) {
-    if (cmd.indexOf(".") !== -1 && pathExt[0] !== "")
-      pathExt.unshift("");
-  }
-  return {
-    pathEnv,
-    pathExt,
-    pathExtExe
-  };
-};
-const which = (cmd, opt, cb) => {
-  if (typeof opt === "function") {
-    cb = opt;
-    opt = {};
-  }
-  if (!opt)
-    opt = {};
-  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt);
-  const found = [];
-  const step = (i) => new Promise((resolve, reject) => {
-    if (i === pathEnv.length)
-      return opt.all && found.length ? resolve(found) : reject(getNotFoundError(cmd));
-    const ppRaw = pathEnv[i];
-    const pathPart = /^".*"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw;
-    const pCmd = path.join(pathPart, cmd);
-    const p = !pathPart && /^\.[\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd : pCmd;
-    resolve(subStep(p, i, 0));
-  });
-  const subStep = (p, i, ii) => new Promise((resolve, reject) => {
-    if (ii === pathExt.length)
-      return resolve(step(i + 1));
-    const ext = pathExt[ii];
-    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {
-      if (!er && is) {
-        if (opt.all)
-          found.push(p + ext);
-        else
-          return resolve(p + ext);
-      }
-      return resolve(subStep(p, i, ii + 1));
-    });
-  });
-  return cb ? step(0).then((res) => cb(null, res), cb) : step(0);
-};
-const whichSync = (cmd, opt) => {
-  opt = opt || {};
-  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt);
-  const found = [];
-  for (let i = 0; i < pathEnv.length; i++) {
-    const ppRaw = pathEnv[i];
-    const pathPart = /^".*"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw;
-    const pCmd = path.join(pathPart, cmd);
-    const p = !pathPart && /^\.[\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd : pCmd;
-    for (let j = 0; j < pathExt.length; j++) {
-      const cur = p + pathExt[j];
-      try {
-        const is = isexe.sync(cur, { pathExt: pathExtExe });
-        if (is) {
-          if (opt.all)
-            found.push(cur);
-          else
-            return cur;
-        }
-      } catch (ex) {
-      }
-    }
-  }
-  if (opt.all && found.length)
-    return found;
-  if (opt.nothrow)
-    return null;
-  throw getNotFoundError(cmd);
-};
-var which_1 = which;
-which.sync = whichSync;
-module.exports = which_1;
-//# sourceMappingURL=which.cjs.map

package/dist/__node_modules/which/which.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"which.cjs","sources":["../../../../../node_modules/which/which.js"],"sourcesContent":["const isWindows = process.platform === 'win32' ||\n    process.env.OSTYPE === 'cygwin' ||\n    process.env.OSTYPE === 'msys'\n\nconst path = require('path')\nconst COLON = isWindows ? ';' : ':'\nconst isexe = require('isexe')\n\nconst getNotFoundError = (cmd) =>\n  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })\n\nconst getPathInfo = (cmd, opt) => {\n  const colon = opt.colon || COLON\n\n  // If it has a slash, then we don't bother searching the pathenv.\n  // just check the file itself, and that's it.\n  const pathEnv = cmd.match(/\\//) || isWindows && cmd.match(/\\\\/) ? ['']\n    : (\n      [\n        // windows always checks the cwd first\n        ...(isWindows ? [process.cwd()] : []),\n        ...(opt.path || process.env.PATH ||\n          /* istanbul ignore next: very unusual */ '').split(colon),\n      ]\n    )\n  const pathExtExe = isWindows\n    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'\n    : ''\n  const pathExt = isWindows ? pathExtExe.split(colon) : ['']\n\n  if (isWindows) {\n    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')\n      pathExt.unshift('')\n  }\n\n  return {\n    pathEnv,\n    pathExt,\n    pathExtExe,\n  }\n}\n\nconst which = (cmd, opt, cb) => {\n  if (typeof opt === 'function') {\n    cb = opt\n    opt = {}\n  }\n  if (!opt)\n    opt = {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  const step = i => new Promise((resolve, reject) => {\n    if (i === pathEnv.length)\n      return opt.all && found.length ? resolve(found)\n        : reject(getNotFoundError(cmd))\n\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    resolve(subStep(p, i, 0))\n  })\n\n  const subStep = (p, i, ii) => new Promise((resolve, reject) => {\n    if (ii === pathExt.length)\n      return resolve(step(i + 1))\n    const ext = pathExt[ii]\n    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {\n      if (!er && is) {\n        if (opt.all)\n          found.push(p + ext)\n        else\n          return resolve(p + ext)\n      }\n      return resolve(subStep(p, i, ii + 1))\n    })\n  })\n\n  return cb ? step(0).then(res => cb(null, res), cb) : step(0)\n}\n\nconst whichSync = (cmd, opt) => {\n  opt = opt || {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  for (let i = 0; i < pathEnv.length; i ++) {\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    for (let j = 0; j < pathExt.length; j ++) {\n      const cur = p + pathExt[j]\n      try {\n        const is = isexe.sync(cur, { pathExt: pathExtExe })\n        if (is) {\n          if (opt.all)\n            found.push(cur)\n          else\n            return cur\n        }\n      } catch (ex) {}\n    }\n  }\n\n  if (opt.all && found.length)\n    return found\n\n  if (opt.nothrow)\n    return null\n\n  throw getNotFoundError(cmd)\n}\n\nmodule.exports = which\nwhich.sync = whichSync\n"],"names":["require$$1"],"mappings":";;;AAAA,MAAM,YAAY,QAAQ,aAAa,WACnC,QAAQ,IAAI,WAAW,YACvB,QAAQ,IAAI,WAAW;AAE3B,MAAM,OAAO;AACb,MAAM,QAAQ,YAAY,MAAM;AAChC,MAAM,QAAQA;AAEd,MAAM,mBAAmB,CAAC,QACxB,OAAO,OAAO,IAAI,MAAM,cAAc,KAAK,GAAG,EAAE,MAAM,UAAU;AAElE,MAAM,cAAc,CAAC,KAAK,QAAQ;AAChC,QAAM,QAAQ,IAAI,SAAS;AAI3B,QAAM,UAAU,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,IAEjE;AAAA;AAAA,IAEE,GAAI,YAAY,CAAC,QAAQ,IAAK,CAAA,IAAI,CAAA;AAAA,IAClC,IAAI,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACe,IAAI,MAAM,KAAK;AAAA,EAC3D;AAEL,QAAM,aAAa,YACf,IAAI,WAAW,QAAQ,IAAI,WAAW,wBACtC;AACJ,QAAM,UAAU,YAAY,WAAW,MAAM,KAAK,IAAI,CAAC,EAAE;AAEzD,MAAI,WAAW;AACb,QAAI,IAAI,QAAQ,GAAG,MAAM,MAAM,QAAQ,CAAC,MAAM;AAC5C,cAAQ,QAAQ,EAAE;AAAA,EACrB;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACH;AAEA,MAAM,QAAQ,CAAC,KAAK,KAAK,OAAO;AAC9B,MAAI,OAAO,QAAQ,YAAY;AAC7B,SAAK;AACL,UAAM,CAAE;AAAA,EACT;AACD,MAAI,CAAC;AACH,UAAM,CAAE;AAEV,QAAM,EAAE,SAAS,SAAS,WAAY,IAAG,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAE;AAEhB,QAAM,OAAO,OAAK,IAAI,QAAQ,CAAC,SAAS,WAAW;AACjD,QAAI,MAAM,QAAQ;AAChB,aAAO,IAAI,OAAO,MAAM,SAAS,QAAQ,KAAK,IAC1C,OAAO,iBAAiB,GAAG,CAAC;AAElC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,YAAQ,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,EAC5B,CAAG;AAED,QAAM,UAAU,CAAC,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7D,QAAI,OAAO,QAAQ;AACjB,aAAO,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B,UAAM,MAAM,QAAQ,EAAE;AACtB,UAAM,IAAI,KAAK,EAAE,SAAS,cAAc,CAAC,IAAI,OAAO;AAClD,UAAI,CAAC,MAAM,IAAI;AACb,YAAI,IAAI;AACN,gBAAM,KAAK,IAAI,GAAG;AAAA;AAElB,iBAAO,QAAQ,IAAI,GAAG;AAAA,MACzB;AACD,aAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1C,CAAK;AAAA,EACL,CAAG;AAED,SAAO,KAAK,KAAK,CAAC,EAAE,KAAK,SAAO,GAAG,MAAM,GAAG,GAAG,EAAE,IAAI,KAAK,CAAC;AAC7D;AAEA,MAAM,YAAY,CAAC,KAAK,QAAQ;AAC9B,QAAM,OAAO,CAAE;AAEf,QAAM,EAAE,SAAS,SAAS,WAAY,IAAG,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAE;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,YAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,KAAK,EAAE,SAAS,YAAY;AAClD,YAAI,IAAI;AACN,cAAI,IAAI;AACN,kBAAM,KAAK,GAAG;AAAA;AAEd,mBAAO;AAAA,QACV;AAAA,MACT,SAAe,IAAP;AAAA,MAAa;AAAA,IAChB;AAAA,EACF;AAED,MAAI,IAAI,OAAO,MAAM;AACnB,WAAO;AAET,MAAI,IAAI;AACN,WAAO;AAET,QAAM,iBAAiB,GAAG;AAC5B;AAEA,IAAA,UAAiB;AACjB,MAAM,OAAO;;"}