@donmahallem/lerna2codecov 0.2.4 → 0.2.7

package/dist/esm/packages/lerna2codecov/node_modules/is-arrayish/index.mjs

@@ -1,11 +0,0 @@
-var isArrayish = function isArrayish(obj) {
-	if (!obj) {
-		return false;
-	}
-
-	return obj instanceof Array || Array.isArray(obj) ||
-		(obj.length >= 0 && obj.splice instanceof Function);
-};
-
-export { isArrayish as default };
-//# sourceMappingURL=index.mjs.map

package/dist/esm/packages/lerna2codecov/node_modules/is-arrayish/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../node_modules/is-arrayish/index.js"],"sourcesContent":["'use strict';\n\nmodule.exports = function isArrayish(obj) {\n\tif (!obj) {\n\t\treturn false;\n\t}\n\n\treturn obj instanceof Array || Array.isArray(obj) ||\n\t\t(obj.length >= 0 && obj.splice instanceof Function);\n};\n"],"names":[],"mappings":"AAEA,IAAA,UAAc,GAAG,SAAS,UAAU,CAAC,GAAG,EAAE;AAC1C,CAAC,IAAI,CAAC,GAAG,EAAE;AACX,EAAE,OAAO,KAAK,CAAC;AACf,EAAE;AACF;AACA,CAAC,OAAO,GAAG,YAAY,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;AAClD,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,YAAY,QAAQ,CAAC,CAAC;AACtD;;;;"}

package/dist/esm/packages/lerna2codecov/node_modules/js-tokens/index.mjs

@@ -1,26 +0,0 @@
-import { __exports as jsTokens } from '../../../../_virtual/index12.mjs';
-
-// Copyright 2014, 2015, 2016, 2017, 2018 Simon Lydell
-// License: MIT. (See LICENSE.)
-
-Object.defineProperty(jsTokens, "__esModule", {
-  value: true
-});
-
-// This regex comes from regex.coffee, and is inserted here by generate-index.js
-// (run `npm run build`).
-jsTokens.default = /((['"])(?:(?!\2|\\).|\\(?:\r\n|[\s\S]))*(\2)?|`(?:[^`\\$]|\\[\s\S]|\$(?!\{)|\$\{(?:[^{}]|\{[^}]*\}?)*\}?)*(`)?)|(\/\/.*)|(\/\*(?:[^*]|\*(?!\/))*(\*\/)?)|(\/(?!\*)(?:\[(?:(?![\]\\]).|\\.)*\]|(?![\/\]\\]).|\\.)+\/(?:(?!\s*(?:\b|[\u0080-\uFFFF$\\'"~({]|[+\-!](?!=)|\.?\d))|[gmiyus]{1,6}\b(?![\u0080-\uFFFF$\\]|\s*(?:[+\-*%&|^<>!=?({]|\/(?![\/*])))))|(0[xX][\da-fA-F]+|0[oO][0-7]+|0[bB][01]+|(?:\d*\.\d+|\d+\.?)(?:[eE][+-]?\d+)?)|((?!\d)(?:(?!\s)[$\w\u0080-\uFFFF]|\\u[\da-fA-F]{4}|\\u\{[\da-fA-F]+\})+)|(--|\+\+|&&|\|\||=>|\.{3}|(?:[+\-\/%&|^]|\*{1,2}|<{1,2}|>{1,3}|!=?|={1,2})=?|[?~.,:;[\](){}])|(\s+)|(^$|[\s\S])/g;
-
-jsTokens.matchToToken = function(match) {
-  var token = {type: "invalid", value: match[0], closed: undefined};
-       if (match[ 1]) token.type = "string" , token.closed = !!(match[3] || match[4]);
-  else if (match[ 5]) token.type = "comment";
-  else if (match[ 6]) token.type = "comment", token.closed = !!match[7];
-  else if (match[ 8]) token.type = "regex";
-  else if (match[ 9]) token.type = "number";
-  else if (match[10]) token.type = "name";
-  else if (match[11]) token.type = "punctuator";
-  else if (match[12]) token.type = "whitespace";
-  return token
-};
-//# sourceMappingURL=index.mjs.map

package/dist/esm/packages/lerna2codecov/node_modules/js-tokens/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../node_modules/js-tokens/index.js"],"sourcesContent":["// Copyright 2014, 2015, 2016, 2017, 2018 Simon Lydell\n// License: MIT. (See LICENSE.)\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n})\n\n// This regex comes from regex.coffee, and is inserted here by generate-index.js\n// (run `npm run build`).\nexports.default = /((['\"])(?:(?!\\2|\\\\).|\\\\(?:\\r\\n|[\\s\\S]))*(\\2)?|`(?:[^`\\\\$]|\\\\[\\s\\S]|\\$(?!\\{)|\\$\\{(?:[^{}]|\\{[^}]*\\}?)*\\}?)*(`)?)|(\\/\\/.*)|(\\/\\*(?:[^*]|\\*(?!\\/))*(\\*\\/)?)|(\\/(?!\\*)(?:\\[(?:(?![\\]\\\\]).|\\\\.)*\\]|(?![\\/\\]\\\\]).|\\\\.)+\\/(?:(?!\\s*(?:\\b|[\\u0080-\\uFFFF$\\\\'\"~({]|[+\\-!](?!=)|\\.?\\d))|[gmiyus]{1,6}\\b(?![\\u0080-\\uFFFF$\\\\]|\\s*(?:[+\\-*%&|^<>!=?({]|\\/(?![\\/*])))))|(0[xX][\\da-fA-F]+|0[oO][0-7]+|0[bB][01]+|(?:\\d*\\.\\d+|\\d+\\.?)(?:[eE][+-]?\\d+)?)|((?!\\d)(?:(?!\\s)[$\\w\\u0080-\\uFFFF]|\\\\u[\\da-fA-F]{4}|\\\\u\\{[\\da-fA-F]+\\})+)|(--|\\+\\+|&&|\\|\\||=>|\\.{3}|(?:[+\\-\\/%&|^]|\\*{1,2}|<{1,2}|>{1,3}|!=?|={1,2})=?|[?~.,:;[\\](){}])|(\\s+)|(^$|[\\s\\S])/g\n\nexports.matchToToken = function(match) {\n  var token = {type: \"invalid\", value: match[0], closed: undefined}\n       if (match[ 1]) token.type = \"string\" , token.closed = !!(match[3] || match[4])\n  else if (match[ 5]) token.type = \"comment\"\n  else if (match[ 6]) token.type = \"comment\", token.closed = !!match[7]\n  else if (match[ 8]) token.type = \"regex\"\n  else if (match[ 9]) token.type = \"number\"\n  else if (match[10]) token.type = \"name\"\n  else if (match[11]) token.type = \"punctuator\"\n  else if (match[12]) token.type = \"whitespace\"\n  return token\n}\n"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA,MAAM,CAAC,cAAc,CAAC,QAAO,EAAE,YAAY,EAAE;AAC7C,EAAE,KAAK,EAAE,IAAI;AACb,CAAC,EAAC;AACF;AACA;AACA;AACA,QAAA,CAAA,OAAe,GAAG,umBAAsmB;AACxnB;AACoB,QAAA,CAAA,YAAA,GAAG,SAAS,KAAK,EAAE;AACvC,EAAE,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAC;AACnE,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAC;AACrF,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,UAAS;AAC5C,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,SAAS,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAC;AACvE,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,QAAO;AAC1C,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,SAAQ;AAC3C,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,OAAM;AACzC,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,aAAY;AAC/C,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,aAAY;AAC/C,EAAE,OAAO,KAAK;AACd"}

package/dist/esm/packages/lerna2codecov/node_modules/json-parse-even-better-errors/index.mjs

@@ -1,122 +0,0 @@
-const hexify = char => {
-  const h = char.charCodeAt(0).toString(16).toUpperCase();
-  return '0x' + (h.length % 2 ? '0' : '') + h
-};
-
-const parseError = (e, txt, context) => {
-  if (!txt) {
-    return {
-      message: e.message + ' while parsing empty string',
-      position: 0,
-    }
-  }
-  const badToken = e.message.match(/^Unexpected token (.) .*position\s+(\d+)/i);
-  const errIdx = badToken ? +badToken[2]
-    : e.message.match(/^Unexpected end of JSON.*/i) ? txt.length - 1
-    : null;
-
-  const msg = badToken ? e.message.replace(/^Unexpected token ./, `Unexpected token ${
-      JSON.stringify(badToken[1])
-    } (${hexify(badToken[1])})`)
-    : e.message;
-
-  if (errIdx !== null && errIdx !== undefined) {
-    const start = errIdx <= context ? 0
-      : errIdx - context;
-
-    const end = errIdx + context >= txt.length ? txt.length
-      : errIdx + context;
-
-    const slice = (start === 0 ? '' : '...') +
-      txt.slice(start, end) +
-      (end === txt.length ? '' : '...');
-
-    const near = txt === slice ? '' : 'near ';
-
-    return {
-      message: msg + ` while parsing ${near}${JSON.stringify(slice)}`,
-      position: errIdx,
-    }
-  } else {
-    return {
-      message: msg + ` while parsing '${txt.slice(0, context * 2)}'`,
-      position: 0,
-    }
-  }
-};
-
-class JSONParseError extends SyntaxError {
-  constructor (er, txt, context, caller) {
-    context = context || 20;
-    const metadata = parseError(er, txt, context);
-    super(metadata.message);
-    Object.assign(this, metadata);
-    this.code = 'EJSONPARSE';
-    this.systemError = er;
-    Error.captureStackTrace(this, caller || this.constructor);
-  }
-  get name () { return this.constructor.name }
-  set name (n) {}
-  get [Symbol.toStringTag] () { return this.constructor.name }
-}
-
-const kIndent = Symbol.for('indent');
-const kNewline = Symbol.for('newline');
-// only respect indentation if we got a line break, otherwise squash it
-// things other than objects and arrays aren't indented, so ignore those
-// Important: in both of these regexps, the $1 capture group is the newline
-// or undefined, and the $2 capture group is the indent, or undefined.
-const formatRE = /^\s*[{\[]((?:\r?\n)+)([\s\t]*)/;
-const emptyRE = /^(?:\{\}|\[\])((?:\r?\n)+)?$/;
-
-const parseJson = (txt, reviver, context) => {
-  const parseText = stripBOM(txt);
-  context = context || 20;
-  try {
-    // get the indentation so that we can save it back nicely
-    // if the file starts with {" then we have an indent of '', ie, none
-    // otherwise, pick the indentation of the next line after the first \n
-    // If the pattern doesn't match, then it means no indentation.
-    // JSON.stringify ignores symbols, so this is reasonably safe.
-    // if the string is '{}' or '[]', then use the default 2-space indent.
-    const [, newline = '\n', indent = '  '] = parseText.match(emptyRE) ||
-      parseText.match(formatRE) ||
-      [, '', ''];
-
-    const result = JSON.parse(parseText, reviver);
-    if (result && typeof result === 'object') {
-      result[kNewline] = newline;
-      result[kIndent] = indent;
-    }
-    return result
-  } catch (e) {
-    if (typeof txt !== 'string' && !Buffer.isBuffer(txt)) {
-      const isEmptyArray = Array.isArray(txt) && txt.length === 0;
-      throw Object.assign(new TypeError(
-        `Cannot parse ${isEmptyArray ? 'an empty array' : String(txt)}`
-      ), {
-        code: 'EJSONPARSE',
-        systemError: e,
-      })
-    }
-
-    throw new JSONParseError(e, parseText, context, parseJson)
-  }
-};
-
-// Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)
-// because the buffer-to-string conversion in `fs.readFileSync()`
-// translates it to FEFF, the UTF-16 BOM.
-const stripBOM = txt => String(txt).replace(/^\uFEFF/, '');
-
-var jsonParseEvenBetterErrors = parseJson;
-parseJson.JSONParseError = JSONParseError;
-
-parseJson.noExceptions = (txt, reviver) => {
-  try {
-    return JSON.parse(stripBOM(txt), reviver)
-  } catch (e) {}
-};
-
-export { jsonParseEvenBetterErrors as default };
-//# sourceMappingURL=index.mjs.map

package/dist/esm/packages/lerna2codecov/node_modules/json-parse-even-better-errors/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../node_modules/json-parse-even-better-errors/index.js"],"sourcesContent":["'use strict'\n\nconst hexify = char => {\n  const h = char.charCodeAt(0).toString(16).toUpperCase()\n  return '0x' + (h.length % 2 ? '0' : '') + h\n}\n\nconst parseError = (e, txt, context) => {\n  if (!txt) {\n    return {\n      message: e.message + ' while parsing empty string',\n      position: 0,\n    }\n  }\n  const badToken = e.message.match(/^Unexpected token (.) .*position\\s+(\\d+)/i)\n  const errIdx = badToken ? +badToken[2]\n    : e.message.match(/^Unexpected end of JSON.*/i) ? txt.length - 1\n    : null\n\n  const msg = badToken ? e.message.replace(/^Unexpected token ./, `Unexpected token ${\n      JSON.stringify(badToken[1])\n    } (${hexify(badToken[1])})`)\n    : e.message\n\n  if (errIdx !== null && errIdx !== undefined) {\n    const start = errIdx <= context ? 0\n      : errIdx - context\n\n    const end = errIdx + context >= txt.length ? txt.length\n      : errIdx + context\n\n    const slice = (start === 0 ? '' : '...') +\n      txt.slice(start, end) +\n      (end === txt.length ? '' : '...')\n\n    const near = txt === slice ? '' : 'near '\n\n    return {\n      message: msg + ` while parsing ${near}${JSON.stringify(slice)}`,\n      position: errIdx,\n    }\n  } else {\n    return {\n      message: msg + ` while parsing '${txt.slice(0, context * 2)}'`,\n      position: 0,\n    }\n  }\n}\n\nclass JSONParseError extends SyntaxError {\n  constructor (er, txt, context, caller) {\n    context = context || 20\n    const metadata = parseError(er, txt, context)\n    super(metadata.message)\n    Object.assign(this, metadata)\n    this.code = 'EJSONPARSE'\n    this.systemError = er\n    Error.captureStackTrace(this, caller || this.constructor)\n  }\n  get name () { return this.constructor.name }\n  set name (n) {}\n  get [Symbol.toStringTag] () { return this.constructor.name }\n}\n\nconst kIndent = Symbol.for('indent')\nconst kNewline = Symbol.for('newline')\n// only respect indentation if we got a line break, otherwise squash it\n// things other than objects and arrays aren't indented, so ignore those\n// Important: in both of these regexps, the $1 capture group is the newline\n// or undefined, and the $2 capture group is the indent, or undefined.\nconst formatRE = /^\\s*[{\\[]((?:\\r?\\n)+)([\\s\\t]*)/\nconst emptyRE = /^(?:\\{\\}|\\[\\])((?:\\r?\\n)+)?$/\n\nconst parseJson = (txt, reviver, context) => {\n  const parseText = stripBOM(txt)\n  context = context || 20\n  try {\n    // get the indentation so that we can save it back nicely\n    // if the file starts with {\" then we have an indent of '', ie, none\n    // otherwise, pick the indentation of the next line after the first \\n\n    // If the pattern doesn't match, then it means no indentation.\n    // JSON.stringify ignores symbols, so this is reasonably safe.\n    // if the string is '{}' or '[]', then use the default 2-space indent.\n    const [, newline = '\\n', indent = '  '] = parseText.match(emptyRE) ||\n      parseText.match(formatRE) ||\n      [, '', '']\n\n    const result = JSON.parse(parseText, reviver)\n    if (result && typeof result === 'object') {\n      result[kNewline] = newline\n      result[kIndent] = indent\n    }\n    return result\n  } catch (e) {\n    if (typeof txt !== 'string' && !Buffer.isBuffer(txt)) {\n      const isEmptyArray = Array.isArray(txt) && txt.length === 0\n      throw Object.assign(new TypeError(\n        `Cannot parse ${isEmptyArray ? 'an empty array' : String(txt)}`\n      ), {\n        code: 'EJSONPARSE',\n        systemError: e,\n      })\n    }\n\n    throw new JSONParseError(e, parseText, context, parseJson)\n  }\n}\n\n// Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)\n// because the buffer-to-string conversion in `fs.readFileSync()`\n// translates it to FEFF, the UTF-16 BOM.\nconst stripBOM = txt => String(txt).replace(/^\\uFEFF/, '')\n\nmodule.exports = parseJson\nparseJson.JSONParseError = JSONParseError\n\nparseJson.noExceptions = (txt, reviver) => {\n  try {\n    return JSON.parse(stripBOM(txt), reviver)\n  } catch (e) {}\n}\n"],"names":[],"mappings":"AAEA,MAAM,MAAM,GAAG,IAAI,IAAI;AACvB,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,GAAE;AACzD,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC;AAC7C,EAAC;AACD;AACA,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,KAAK;AACxC,EAAE,IAAI,CAAC,GAAG,EAAE;AACZ,IAAI,OAAO;AACX,MAAM,OAAO,EAAE,CAAC,CAAC,OAAO,GAAG,6BAA6B;AACxD,MAAM,QAAQ,EAAE,CAAC;AACjB,KAAK;AACL,GAAG;AACH,EAAE,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,2CAA2C,EAAC;AAC/E,EAAE,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;AACxC,MAAM,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,4BAA4B,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC;AACpE,MAAM,KAAI;AACV;AACA,EAAE,MAAM,GAAG,GAAG,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,qBAAqB,EAAE,CAAC,iBAAiB;AACpF,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AACjC,KAAK,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,MAAM,CAAC,CAAC,QAAO;AACf;AACA,EAAE,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS,EAAE;AAC/C,IAAI,MAAM,KAAK,GAAG,MAAM,IAAI,OAAO,GAAG,CAAC;AACvC,QAAQ,MAAM,GAAG,QAAO;AACxB;AACA,IAAI,MAAM,GAAG,GAAG,MAAM,GAAG,OAAO,IAAI,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM;AAC3D,QAAQ,MAAM,GAAG,QAAO;AACxB;AACA,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,KAAK,CAAC,GAAG,EAAE,GAAG,KAAK;AAC3C,MAAM,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC;AAC3B,OAAO,GAAG,KAAK,GAAG,CAAC,MAAM,GAAG,EAAE,GAAG,KAAK,EAAC;AACvC;AACA,IAAI,MAAM,IAAI,GAAG,GAAG,KAAK,KAAK,GAAG,EAAE,GAAG,QAAO;AAC7C;AACA,IAAI,OAAO;AACX,MAAM,OAAO,EAAE,GAAG,GAAG,CAAC,eAAe,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE,MAAM,QAAQ,EAAE,MAAM;AACtB,KAAK;AACL,GAAG,MAAM;AACT,IAAI,OAAO;AACX,MAAM,OAAO,EAAE,GAAG,GAAG,CAAC,gBAAgB,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACpE,MAAM,QAAQ,EAAE,CAAC;AACjB,KAAK;AACL,GAAG;AACH,EAAC;AACD;AACA,MAAM,cAAc,SAAS,WAAW,CAAC;AACzC,EAAE,WAAW,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE;AACzC,IAAI,OAAO,GAAG,OAAO,IAAI,GAAE;AAC3B,IAAI,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,EAAC;AACjD,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAC;AAC3B,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAC;AACjC,IAAI,IAAI,CAAC,IAAI,GAAG,aAAY;AAC5B,IAAI,IAAI,CAAC,WAAW,GAAG,GAAE;AACzB,IAAI,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI,CAAC,WAAW,EAAC;AAC7D,GAAG;AACH,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE;AAC9C,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;AACjB,EAAE,KAAK,MAAM,CAAC,WAAW,EAAE,GAAG,EAAE,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE;AAC9D,CAAC;AACD;AACA,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAC;AACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,EAAC;AACtC;AACA;AACA;AACA;AACA,MAAM,QAAQ,GAAG,iCAAgC;AACjD,MAAM,OAAO,GAAG,+BAA8B;AAC9C;AACA,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,KAAK;AAC7C,EAAE,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,EAAC;AACjC,EAAE,OAAO,GAAG,OAAO,IAAI,GAAE;AACzB,EAAE,IAAI;AACN;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,MAAM,GAAG,OAAO,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC;AACtE,MAAM,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC;AAC/B,MAAM,GAAG,EAAE,EAAE,EAAE,EAAC;AAChB;AACA,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAC;AACjD,IAAI,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;AAC9C,MAAM,MAAM,CAAC,QAAQ,CAAC,GAAG,QAAO;AAChC,MAAM,MAAM,CAAC,OAAO,CAAC,GAAG,OAAM;AAC9B,KAAK;AACL,IAAI,OAAO,MAAM;AACjB,GAAG,CAAC,OAAO,CAAC,EAAE;AACd,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;AAC1D,MAAM,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,EAAC;AACjE,MAAM,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,SAAS;AACvC,QAAQ,CAAC,aAAa,EAAE,YAAY,GAAG,gBAAgB,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACvE,OAAO,EAAE;AACT,QAAQ,IAAI,EAAE,YAAY;AAC1B,QAAQ,WAAW,EAAE,CAAC;AACtB,OAAO,CAAC;AACR,KAAK;AACL;AACA,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC;AAC9D,GAAG;AACH,EAAC;AACD;AACA;AACA;AACA;AACA,MAAM,QAAQ,GAAG,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,EAAC;AAC1D;AACA,IAAA,yBAAc,GAAG,UAAS;AAC1B,SAAS,CAAC,cAAc,GAAG,eAAc;AACzC;AACA,SAAS,CAAC,YAAY,GAAG,CAAC,GAAG,EAAE,OAAO,KAAK;AAC3C,EAAE,IAAI;AACN,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC;AAC7C,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE;AAChB;;;;"}

package/dist/esm/packages/lerna2codecov/node_modules/lines-and-columns/build/index.mjs

@@ -1,66 +0,0 @@
-import { __exports as build } from '../../../../../_virtual/index6.mjs';
-
-(function (exports) {
-	exports.__esModule = true;
-	exports.LinesAndColumns = void 0;
-	var LF = '\n';
-	var CR = '\r';
-	var LinesAndColumns = /** @class */ (function () {
-	    function LinesAndColumns(string) {
-	        this.string = string;
-	        var offsets = [0];
-	        for (var offset = 0; offset < string.length;) {
-	            switch (string[offset]) {
-	                case LF:
-	                    offset += LF.length;
-	                    offsets.push(offset);
-	                    break;
-	                case CR:
-	                    offset += CR.length;
-	                    if (string[offset] === LF) {
-	                        offset += LF.length;
-	                    }
-	                    offsets.push(offset);
-	                    break;
-	                default:
-	                    offset++;
-	                    break;
-	            }
-	        }
-	        this.offsets = offsets;
-	    }
-	    LinesAndColumns.prototype.locationForIndex = function (index) {
-	        if (index < 0 || index > this.string.length) {
-	            return null;
-	        }
-	        var line = 0;
-	        var offsets = this.offsets;
-	        while (offsets[line + 1] <= index) {
-	            line++;
-	        }
-	        var column = index - offsets[line];
-	        return { line: line, column: column };
-	    };
-	    LinesAndColumns.prototype.indexForLocation = function (location) {
-	        var line = location.line, column = location.column;
-	        if (line < 0 || line >= this.offsets.length) {
-	            return null;
-	        }
-	        if (column < 0 || column > this.lengthOfLine(line)) {
-	            return null;
-	        }
-	        return this.offsets[line] + column;
-	    };
-	    LinesAndColumns.prototype.lengthOfLine = function (line) {
-	        var offset = this.offsets[line];
-	        var nextOffset = line === this.offsets.length - 1
-	            ? this.string.length
-	            : this.offsets[line + 1];
-	        return nextOffset - offset;
-	    };
-	    return LinesAndColumns;
-	}());
-	exports.LinesAndColumns = LinesAndColumns;
-	exports["default"] = LinesAndColumns;
-} (build));
-//# sourceMappingURL=index.mjs.map

package/dist/esm/packages/lerna2codecov/node_modules/lines-and-columns/build/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../node_modules/lines-and-columns/build/index.js"],"sourcesContent":["\"use strict\";\nexports.__esModule = true;\nexports.LinesAndColumns = void 0;\nvar LF = '\\n';\nvar CR = '\\r';\nvar LinesAndColumns = /** @class */ (function () {\n    function LinesAndColumns(string) {\n        this.string = string;\n        var offsets = [0];\n        for (var offset = 0; offset < string.length;) {\n            switch (string[offset]) {\n                case LF:\n                    offset += LF.length;\n                    offsets.push(offset);\n                    break;\n                case CR:\n                    offset += CR.length;\n                    if (string[offset] === LF) {\n                        offset += LF.length;\n                    }\n                    offsets.push(offset);\n                    break;\n                default:\n                    offset++;\n                    break;\n            }\n        }\n        this.offsets = offsets;\n    }\n    LinesAndColumns.prototype.locationForIndex = function (index) {\n        if (index < 0 || index > this.string.length) {\n            return null;\n        }\n        var line = 0;\n        var offsets = this.offsets;\n        while (offsets[line + 1] <= index) {\n            line++;\n        }\n        var column = index - offsets[line];\n        return { line: line, column: column };\n    };\n    LinesAndColumns.prototype.indexForLocation = function (location) {\n        var line = location.line, column = location.column;\n        if (line < 0 || line >= this.offsets.length) {\n            return null;\n        }\n        if (column < 0 || column > this.lengthOfLine(line)) {\n            return null;\n        }\n        return this.offsets[line] + column;\n    };\n    LinesAndColumns.prototype.lengthOfLine = function (line) {\n        var offset = this.offsets[line];\n        var nextOffset = line === this.offsets.length - 1\n            ? this.string.length\n            : this.offsets[line + 1];\n        return nextOffset - offset;\n    };\n    return LinesAndColumns;\n}());\nexports.LinesAndColumns = LinesAndColumns;\nexports[\"default\"] = LinesAndColumns;\n"],"names":[],"mappings":";;;AACA,CAAA,OAAA,CAAA,UAAA,GAAqB,IAAI,CAAC;CAC1B,OAA0B,CAAA,eAAA,GAAA,KAAK,CAAC,CAAC;CACjC,IAAI,EAAE,GAAG,IAAI,CAAC;CACd,IAAI,EAAE,GAAG,IAAI,CAAC;CACd,IAAI,eAAe,kBAAkB,YAAY;AACjD,KAAI,SAAS,eAAe,CAAC,MAAM,EAAE;AACrC,SAAQ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AAC7B,SAAQ,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;SAClB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG;AACtD,aAAY,QAAQ,MAAM,CAAC,MAAM,CAAC;AAClC,iBAAgB,KAAK,EAAE;AACvB,qBAAoB,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC;AACxC,qBAAoB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACzC,qBAAoB,MAAM;AAC1B,iBAAgB,KAAK,EAAE;AACvB,qBAAoB,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC;AACxC,qBAAoB,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE;AAC/C,yBAAwB,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC;sBACvB;AACrB,qBAAoB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACzC,qBAAoB,MAAM;iBACV;qBACI,MAAM,EAAE,CAAC;AAC7B,qBAAoB,MAAM;cACb;UACJ;AACT,SAAQ,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;MAC1B;KACD,eAAe,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAU,KAAK,EAAE;AAClE,SAAQ,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;aACzC,OAAO,IAAI,CAAC;UACf;AACT,SAAQ,IAAI,IAAI,GAAG,CAAC,CAAC;AACrB,SAAQ,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;SAC3B,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,EAAE;aAC/B,IAAI,EAAE,CAAC;UACV;SACD,IAAI,MAAM,GAAG,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;SACnC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC9C,MAAK,CAAC;KACF,eAAe,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAU,QAAQ,EAAE;AACrE,SAAQ,IAAI,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;AAC3D,SAAQ,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;aACzC,OAAO,IAAI,CAAC;UACf;AACT,SAAQ,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE;aAChD,OAAO,IAAI,CAAC;UACf;SACD,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AAC3C,MAAK,CAAC;KACF,eAAe,CAAC,SAAS,CAAC,YAAY,GAAG,UAAU,IAAI,EAAE;SACrD,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;SAChC,IAAI,UAAU,GAAG,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;AACzD,eAAc,IAAI,CAAC,MAAM,CAAC,MAAM;eAClB,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AACrC,SAAQ,OAAO,UAAU,GAAG,MAAM,CAAC;AACnC,MAAK,CAAC;KACF,OAAO,eAAe,CAAC;EAC1B,EAAE,CAAC,CAAC;AACL,CAAA,OAAA,CAAA,eAAA,GAA0B,eAAe,CAAC;AAC1C,CAAA,OAAO,CAAC,SAAS,CAAC,GAAG,eAAe,CAAA;"}

package/dist/esm/packages/lerna2codecov/node_modules/load-json-file/index.mjs

@@ -1,30 +0,0 @@
-import { l as loadJsonFile } from '../../../../_virtual/index.mjs';
-import '../../../../node_modules/path/path.mjs';
-import { __require as requireUtil } from '../../../../node_modules/util/util.mjs';
-import { g as gracefulFs } from '../graceful-fs/graceful-fs.mjs';
-import stripBom$1 from '../strip-bom/index.mjs';
-import parseJson_1 from '../parse-json/index.mjs';
-import { p as path$1 } from '../../../../_virtual/path.mjs';
-
-const path = path$1.exports;
-const {promisify} = requireUtil();
-const fs = gracefulFs;
-const stripBom = stripBom$1;
-const parseJson = parseJson_1;
-
-const parse = (data, filePath, options = {}) => {
-	data = stripBom(data);
-
-	if (typeof options.beforeParse === 'function') {
-		data = options.beforeParse(data);
-	}
-
-	return parseJson(data, options.reviver, path.relative(process.cwd(), filePath));
-};
-
-loadJsonFile.exports = async (filePath, options) => parse(await promisify(fs.readFile)(filePath, 'utf8'), filePath, options);
-loadJsonFile.exports.sync = (filePath, options) => parse(fs.readFileSync(filePath, 'utf8'), filePath, options);
-
-const exports = loadJsonFile.exports;
-export { exports as default };
-//# sourceMappingURL=index.mjs.map

package/dist/esm/packages/lerna2codecov/node_modules/load-json-file/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../node_modules/load-json-file/index.js"],"sourcesContent":["'use strict';\nconst path = require('path');\nconst {promisify} = require('util');\nconst fs = require('graceful-fs');\nconst stripBom = require('strip-bom');\nconst parseJson = require('parse-json');\n\nconst parse = (data, filePath, options = {}) => {\n\tdata = stripBom(data);\n\n\tif (typeof options.beforeParse === 'function') {\n\t\tdata = options.beforeParse(data);\n\t}\n\n\treturn parseJson(data, options.reviver, path.relative(process.cwd(), filePath));\n};\n\nmodule.exports = async (filePath, options) => parse(await promisify(fs.readFile)(filePath, 'utf8'), filePath, options);\nmodule.exports.sync = (filePath, options) => parse(fs.readFileSync(filePath, 'utf8'), filePath, options);\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","loadJsonFileModule","loadJsonFile"],"mappings":";;;;;;;;AACA,MAAM,IAAI,GAAGA,cAAe,CAAC;AAC7B,MAAM,CAAC,SAAS,CAAC,GAAGC,aAAe,CAAC;AACpC,MAAM,EAAE,GAAGC,UAAsB,CAAC;AAClC,MAAM,QAAQ,GAAGC,UAAoB,CAAC;AACtC,MAAM,SAAS,GAAGC,WAAqB,CAAC;AACxC;AACA,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,GAAG,EAAE,KAAK;AAChD,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;AACvB;AACA,CAAC,IAAI,OAAO,OAAO,CAAC,WAAW,KAAK,UAAU,EAAE;AAChD,EAAE,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AACnC,EAAE;AACF;AACA,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;AACjF,CAAC,CAAC;AACF;AACAC,YAAc,CAAA,OAAA,GAAG,OAAO,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC,MAAM,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AACpGC,oBAAA,CAAA,IAAA,GAAG,CAAC,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,OAAO;;;;;"}

package/dist/esm/packages/lerna2codecov/node_modules/lru-cache/index.mjs

@@ -1,346 +0,0 @@
-import { __require as requireYallist } from '../yallist/yallist.mjs';
-
-var lruCache;
-var hasRequiredLruCache;
-
-function requireLruCache () {
-	if (hasRequiredLruCache) return lruCache;
-	hasRequiredLruCache = 1;
-
-	// A linked list to keep track of recently-used-ness
-	const Yallist = requireYallist();
-
-	const MAX = Symbol('max');
-	const LENGTH = Symbol('length');
-	const LENGTH_CALCULATOR = Symbol('lengthCalculator');
-	const ALLOW_STALE = Symbol('allowStale');
-	const MAX_AGE = Symbol('maxAge');
-	const DISPOSE = Symbol('dispose');
-	const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
-	const LRU_LIST = Symbol('lruList');
-	const CACHE = Symbol('cache');
-	const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
-
-	const naiveLength = () => 1;
-
-	// lruList is a yallist where the head is the youngest
-	// item, and the tail is the oldest.  the list contains the Hit
-	// objects as the entries.
-	// Each Hit object has a reference to its Yallist.Node.  This
-	// never changes.
-	//
-	// cache is a Map (or PseudoMap) that matches the keys to
-	// the Yallist.Node object.
-	class LRUCache {
-	  constructor (options) {
-	    if (typeof options === 'number')
-	      options = { max: options };
-
-	    if (!options)
-	      options = {};
-
-	    if (options.max && (typeof options.max !== 'number' || options.max < 0))
-	      throw new TypeError('max must be a non-negative number')
-	    // Kind of weird to have a default max of Infinity, but oh well.
-	    this[MAX] = options.max || Infinity;
-
-	    const lc = options.length || naiveLength;
-	    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc;
-	    this[ALLOW_STALE] = options.stale || false;
-	    if (options.maxAge && typeof options.maxAge !== 'number')
-	      throw new TypeError('maxAge must be a number')
-	    this[MAX_AGE] = options.maxAge || 0;
-	    this[DISPOSE] = options.dispose;
-	    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
-	    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
-	    this.reset();
-	  }
-
-	  // resize the cache when the max changes.
-	  set max (mL) {
-	    if (typeof mL !== 'number' || mL < 0)
-	      throw new TypeError('max must be a non-negative number')
-
-	    this[MAX] = mL || Infinity;
-	    trim(this);
-	  }
-	  get max () {
-	    return this[MAX]
-	  }
-
-	  set allowStale (allowStale) {
-	    this[ALLOW_STALE] = !!allowStale;
-	  }
-	  get allowStale () {
-	    return this[ALLOW_STALE]
-	  }
-
-	  set maxAge (mA) {
-	    if (typeof mA !== 'number')
-	      throw new TypeError('maxAge must be a non-negative number')
-
-	    this[MAX_AGE] = mA;
-	    trim(this);
-	  }
-	  get maxAge () {
-	    return this[MAX_AGE]
-	  }
-
-	  // resize the cache when the lengthCalculator changes.
-	  set lengthCalculator (lC) {
-	    if (typeof lC !== 'function')
-	      lC = naiveLength;
-
-	    if (lC !== this[LENGTH_CALCULATOR]) {
-	      this[LENGTH_CALCULATOR] = lC;
-	      this[LENGTH] = 0;
-	      this[LRU_LIST].forEach(hit => {
-	        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
-	        this[LENGTH] += hit.length;
-	      });
-	    }
-	    trim(this);
-	  }
-	  get lengthCalculator () { return this[LENGTH_CALCULATOR] }
-
-	  get length () { return this[LENGTH] }
-	  get itemCount () { return this[LRU_LIST].length }
-
-	  rforEach (fn, thisp) {
-	    thisp = thisp || this;
-	    for (let walker = this[LRU_LIST].tail; walker !== null;) {
-	      const prev = walker.prev;
-	      forEachStep(this, fn, walker, thisp);
-	      walker = prev;
-	    }
-	  }
-
-	  forEach (fn, thisp) {
-	    thisp = thisp || this;
-	    for (let walker = this[LRU_LIST].head; walker !== null;) {
-	      const next = walker.next;
-	      forEachStep(this, fn, walker, thisp);
-	      walker = next;
-	    }
-	  }
-
-	  keys () {
-	    return this[LRU_LIST].toArray().map(k => k.key)
-	  }
-
-	  values () {
-	    return this[LRU_LIST].toArray().map(k => k.value)
-	  }
-
-	  reset () {
-	    if (this[DISPOSE] &&
-	        this[LRU_LIST] &&
-	        this[LRU_LIST].length) {
-	      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value));
-	    }
-
-	    this[CACHE] = new Map(); // hash of items by key
-	    this[LRU_LIST] = new Yallist(); // list of items in order of use recency
-	    this[LENGTH] = 0; // length of items in the list
-	  }
-
-	  dump () {
-	    return this[LRU_LIST].map(hit =>
-	      isStale(this, hit) ? false : {
-	        k: hit.key,
-	        v: hit.value,
-	        e: hit.now + (hit.maxAge || 0)
-	      }).toArray().filter(h => h)
-	  }
-
-	  dumpLru () {
-	    return this[LRU_LIST]
-	  }
-
-	  set (key, value, maxAge) {
-	    maxAge = maxAge || this[MAX_AGE];
-
-	    if (maxAge && typeof maxAge !== 'number')
-	      throw new TypeError('maxAge must be a number')
-
-	    const now = maxAge ? Date.now() : 0;
-	    const len = this[LENGTH_CALCULATOR](value, key);
-
-	    if (this[CACHE].has(key)) {
-	      if (len > this[MAX]) {
-	        del(this, this[CACHE].get(key));
-	        return false
-	      }
-
-	      const node = this[CACHE].get(key);
-	      const item = node.value;
-
-	      // dispose of the old one before overwriting
-	      // split out into 2 ifs for better coverage tracking
-	      if (this[DISPOSE]) {
-	        if (!this[NO_DISPOSE_ON_SET])
-	          this[DISPOSE](key, item.value);
-	      }
-
-	      item.now = now;
-	      item.maxAge = maxAge;
-	      item.value = value;
-	      this[LENGTH] += len - item.length;
-	      item.length = len;
-	      this.get(key);
-	      trim(this);
-	      return true
-	    }
-
-	    const hit = new Entry(key, value, len, now, maxAge);
-
-	    // oversized objects fall out of cache automatically.
-	    if (hit.length > this[MAX]) {
-	      if (this[DISPOSE])
-	        this[DISPOSE](key, value);
-
-	      return false
-	    }
-
-	    this[LENGTH] += hit.length;
-	    this[LRU_LIST].unshift(hit);
-	    this[CACHE].set(key, this[LRU_LIST].head);
-	    trim(this);
-	    return true
-	  }
-
-	  has (key) {
-	    if (!this[CACHE].has(key)) return false
-	    const hit = this[CACHE].get(key).value;
-	    return !isStale(this, hit)
-	  }
-
-	  get (key) {
-	    return get(this, key, true)
-	  }
-
-	  peek (key) {
-	    return get(this, key, false)
-	  }
-
-	  pop () {
-	    const node = this[LRU_LIST].tail;
-	    if (!node)
-	      return null
-
-	    del(this, node);
-	    return node.value
-	  }
-
-	  del (key) {
-	    del(this, this[CACHE].get(key));
-	  }
-
-	  load (arr) {
-	    // reset the cache
-	    this.reset();
-
-	    const now = Date.now();
-	    // A previous serialized cache has the most recent items first
-	    for (let l = arr.length - 1; l >= 0; l--) {
-	      const hit = arr[l];
-	      const expiresAt = hit.e || 0;
-	      if (expiresAt === 0)
-	        // the item was created without expiration in a non aged cache
-	        this.set(hit.k, hit.v);
-	      else {
-	        const maxAge = expiresAt - now;
-	        // dont add already expired items
-	        if (maxAge > 0) {
-	          this.set(hit.k, hit.v, maxAge);
-	        }
-	      }
-	    }
-	  }
-
-	  prune () {
-	    this[CACHE].forEach((value, key) => get(this, key, false));
-	  }
-	}
-
-	const get = (self, key, doUse) => {
-	  const node = self[CACHE].get(key);
-	  if (node) {
-	    const hit = node.value;
-	    if (isStale(self, hit)) {
-	      del(self, node);
-	      if (!self[ALLOW_STALE])
-	        return undefined
-	    } else {
-	      if (doUse) {
-	        if (self[UPDATE_AGE_ON_GET])
-	          node.value.now = Date.now();
-	        self[LRU_LIST].unshiftNode(node);
-	      }
-	    }
-	    return hit.value
-	  }
-	};
-
-	const isStale = (self, hit) => {
-	  if (!hit || (!hit.maxAge && !self[MAX_AGE]))
-	    return false
-
-	  const diff = Date.now() - hit.now;
-	  return hit.maxAge ? diff > hit.maxAge
-	    : self[MAX_AGE] && (diff > self[MAX_AGE])
-	};
-
-	const trim = self => {
-	  if (self[LENGTH] > self[MAX]) {
-	    for (let walker = self[LRU_LIST].tail;
-	      self[LENGTH] > self[MAX] && walker !== null;) {
-	      // We know that we're about to delete this one, and also
-	      // what the next least recently used key will be, so just
-	      // go ahead and set it now.
-	      const prev = walker.prev;
-	      del(self, walker);
-	      walker = prev;
-	    }
-	  }
-	};
-
-	const del = (self, node) => {
-	  if (node) {
-	    const hit = node.value;
-	    if (self[DISPOSE])
-	      self[DISPOSE](hit.key, hit.value);
-
-	    self[LENGTH] -= hit.length;
-	    self[CACHE].delete(hit.key);
-	    self[LRU_LIST].removeNode(node);
-	  }
-	};
-
-	class Entry {
-	  constructor (key, value, length, now, maxAge) {
-	    this.key = key;
-	    this.value = value;
-	    this.length = length;
-	    this.now = now;
-	    this.maxAge = maxAge || 0;
-	  }
-	}
-
-	const forEachStep = (self, fn, node, thisp) => {
-	  let hit = node.value;
-	  if (isStale(self, hit)) {
-	    del(self, node);
-	    if (!self[ALLOW_STALE])
-	      hit = undefined;
-	  }
-	  if (hit)
-	    fn.call(thisp, hit.value, hit.key, self);
-	};
-
-	lruCache = LRUCache;
-	return lruCache;
-}
-
-export { requireLruCache as __require };
-//# sourceMappingURL=index.mjs.map