@slicemachine/init 2.2.1 → 2.2.2-dev-next-release.4

package/dist/_node_modules/picomatch/lib/utils.js

@@ -1,6 +1,6 @@
 import { __exports as utils } from "../../../_virtual/utils.js";
 import require$$0 from "path";
-import constants from "./constants.js";
+import { c as constants } from "./constants.js";
 (function(exports) {
   const path = require$$0;
   const win32 = process.platform === "win32";
@@ -59,7 +59,4 @@ import constants from "./constants.js";
     return output;
   };
 })(utils);
-export {
-  utils as default
-};
 //# sourceMappingURL=utils.js.map

package/dist/_node_modules/queue-microtask/index.cjs

@@ -1,9 +1,10 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const _commonjsHelpers = require("../../_virtual/_commonjsHelpers.cjs");
 /*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 let promise;
 var queueMicrotask_1 = typeof queueMicrotask === "function" ? queueMicrotask.bind(typeof window !== "undefined" ? window : _commonjsHelpers.commonjsGlobal) : (cb) => (promise || (promise = Promise.resolve())).then(cb).catch((err) => setTimeout(() => {
   throw err;
 }, 0));
-module.exports = queueMicrotask_1;
+exports.queueMicrotask_1 = queueMicrotask_1;
 //# sourceMappingURL=index.cjs.map

package/dist/_node_modules/queue-microtask/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/queue-microtask/index.js"],"sourcesContent":["/*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n  ? queueMicrotask.bind(typeof window !== 'undefined' ? window : global)\n  // reuse resolved promise, and allocate it lazily\n  : cb => (promise || (promise = Promise.resolve()))\n    .then(cb)\n    .catch(err => setTimeout(() => { throw err }, 0))\n"],"names":["global"],"mappings":";;;AACA,IAAI;AAEJ,IAAA,mBAAiB,OAAO,mBAAmB,aACvC,eAAe,KAAK,OAAO,WAAW,cAAc,SAASA,iBAAAA,cAAM,IAEnE,SAAO,YAAY,UAAU,QAAQ,QAAO,IAC3C,KAAK,EAAE,EACP,MAAM,SAAO,WAAW,MAAM;AAAE,QAAM;AAAK,GAAE,CAAC,CAAC;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/queue-microtask/index.js"],"sourcesContent":["/*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n  ? queueMicrotask.bind(typeof window !== 'undefined' ? window : global)\n  // reuse resolved promise, and allocate it lazily\n  : cb => (promise || (promise = Promise.resolve()))\n    .then(cb)\n    .catch(err => setTimeout(() => { throw err }, 0))\n"],"names":["global"],"mappings":";;;;AACA,IAAI;AAEJ,IAAA,mBAAiB,OAAO,mBAAmB,aACvC,eAAe,KAAK,OAAO,WAAW,cAAc,SAASA,iBAAAA,cAAM,IAEnE,SAAO,YAAY,UAAU,QAAQ,QAAO,IAC3C,KAAK,EAAE,EACP,MAAM,SAAO,WAAW,MAAM;AAAE,QAAM;AAAK,GAAE,CAAC,CAAC;;","x_google_ignoreList":[0]}

package/dist/_node_modules/queue-microtask/index.js

@@ -5,6 +5,6 @@ var queueMicrotask_1 = typeof queueMicrotask === "function" ? queueMicrotask.bin
   throw err;
 }, 0));
 export {
-  queueMicrotask_1 as default
+  queueMicrotask_1 as q
 };
 //# sourceMappingURL=index.js.map

package/dist/_node_modules/reusify/reusify.cjs

@@ -1,4 +1,5 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 function reusify(Constructor) {
   var head = new Constructor();
   var tail = head;
@@ -23,5 +24,5 @@ function reusify(Constructor) {
   };
 }
 var reusify_1 = reusify;
-module.exports = reusify_1;
+exports.reusify_1 = reusify_1;
 //# sourceMappingURL=reusify.cjs.map

package/dist/_node_modules/reusify/reusify.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"reusify.cjs","sources":["../../../../../node_modules/reusify/reusify.js"],"sourcesContent":["'use strict'\n\nfunction reusify (Constructor) {\n  var head = new Constructor()\n  var tail = head\n\n  function get () {\n    var current = head\n\n    if (current.next) {\n      head = current.next\n    } else {\n      head = new Constructor()\n      tail = head\n    }\n\n    current.next = null\n\n    return current\n  }\n\n  function release (obj) {\n    tail.next = obj\n    tail = obj\n  }\n\n  return {\n    get: get,\n    release: release\n  }\n}\n\nmodule.exports = reusify\n"],"names":[],"mappings":";AAEA,SAAS,QAAS,aAAa;AAC7B,MAAI,OAAO,IAAI,YAAa;AAC5B,MAAI,OAAO;AAEX,WAAS,MAAO;AACd,QAAI,UAAU;AAEd,QAAI,QAAQ,MAAM;AAChB,aAAO,QAAQ;AAAA,IACrB,OAAW;AACL,aAAO,IAAI,YAAa;AACxB,aAAO;AAAA,IACR;AAED,YAAQ,OAAO;AAEf,WAAO;AAAA,EACR;AAED,WAAS,QAAS,KAAK;AACrB,SAAK,OAAO;AACZ,WAAO;AAAA,EACR;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACD;AACH;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"reusify.cjs","sources":["../../../../../node_modules/reusify/reusify.js"],"sourcesContent":["'use strict'\n\nfunction reusify (Constructor) {\n  var head = new Constructor()\n  var tail = head\n\n  function get () {\n    var current = head\n\n    if (current.next) {\n      head = current.next\n    } else {\n      head = new Constructor()\n      tail = head\n    }\n\n    current.next = null\n\n    return current\n  }\n\n  function release (obj) {\n    tail.next = obj\n    tail = obj\n  }\n\n  return {\n    get: get,\n    release: release\n  }\n}\n\nmodule.exports = reusify\n"],"names":[],"mappings":";;AAEA,SAAS,QAAS,aAAa;AAC7B,MAAI,OAAO,IAAI,YAAa;AAC5B,MAAI,OAAO;AAEX,WAAS,MAAO;AACd,QAAI,UAAU;AAEd,QAAI,QAAQ,MAAM;AAChB,aAAO,QAAQ;AAAA,IACrB,OAAW;AACL,aAAO,IAAI,YAAa;AACxB,aAAO;AAAA,IACR;AAED,YAAQ,OAAO;AAEf,WAAO;AAAA,EACR;AAED,WAAS,QAAS,KAAK;AACrB,SAAK,OAAO;AACZ,WAAO;AAAA,EACR;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACD;AACH;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}

package/dist/_node_modules/reusify/reusify.js

@@ -23,6 +23,6 @@ function reusify(Constructor) {
 }
 var reusify_1 = reusify;
 export {
-  reusify_1 as default
+  reusify_1 as r
 };
 //# sourceMappingURL=reusify.js.map

package/dist/_node_modules/run-parallel/index.cjs

@@ -1,8 +1,9 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const index = require("../queue-microtask/index.cjs");
 /*! run-parallel. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var runParallel_1 = runParallel;
-const queueMicrotask = index;
+const queueMicrotask = index.queueMicrotask_1;
 function runParallel(tasks, cb) {
   let results, pending, keys;
   let isSync = true;
@@ -48,5 +49,5 @@ function runParallel(tasks, cb) {
   }
   isSync = false;
 }
-module.exports = runParallel_1;
+exports.runParallel_1 = runParallel_1;
 //# sourceMappingURL=index.cjs.map

package/dist/_node_modules/run-parallel/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/run-parallel/index.js"],"sourcesContent":["/*! run-parallel. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nmodule.exports = runParallel\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction runParallel (tasks, cb) {\n  let results, pending, keys\n  let isSync = true\n\n  if (Array.isArray(tasks)) {\n    results = []\n    pending = tasks.length\n  } else {\n    keys = Object.keys(tasks)\n    results = {}\n    pending = keys.length\n  }\n\n  function done (err) {\n    function end () {\n      if (cb) cb(err, results)\n      cb = null\n    }\n    if (isSync) queueMicrotask(end)\n    else end()\n  }\n\n  function each (i, err, result) {\n    results[i] = result\n    if (--pending === 0 || err) {\n      done(err)\n    }\n  }\n\n  if (!pending) {\n    // empty\n    done(null)\n  } else if (keys) {\n    // object\n    keys.forEach(function (key) {\n      tasks[key](function (err, result) { each(key, err, result) })\n    })\n  } else {\n    // array\n    tasks.forEach(function (task, i) {\n      task(function (err, result) { each(i, err, result) })\n    })\n  }\n\n  isSync = false\n}\n"],"names":["require$$0"],"mappings":";;;AACA,IAAA,gBAAiB;AAEjB,MAAM,iBAAiBA;AAEvB,SAAS,YAAa,OAAO,IAAI;AAC/B,MAAI,SAAS,SAAS;AACtB,MAAI,SAAS;AAEb,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,cAAU,CAAE;AACZ,cAAU,MAAM;AAAA,EACpB,OAAS;AACL,WAAO,OAAO,KAAK,KAAK;AACxB,cAAU,CAAE;AACZ,cAAU,KAAK;AAAA,EAChB;AAED,WAAS,KAAM,KAAK;AAClB,aAAS,MAAO;AACd,UAAI;AAAI,WAAG,KAAK,OAAO;AACvB,WAAK;AAAA,IACN;AACD,QAAI;AAAQ,qBAAe,GAAG;AAAA;AACzB,UAAK;AAAA,EACX;AAED,WAAS,KAAM,GAAG,KAAK,QAAQ;AAC7B,YAAQ,CAAC,IAAI;AACb,QAAI,EAAE,YAAY,KAAK,KAAK;AAC1B,WAAK,GAAG;AAAA,IACT;AAAA,EACF;AAED,MAAI,CAAC,SAAS;AAEZ,SAAK,IAAI;AAAA,EACV,WAAU,MAAM;AAEf,SAAK,QAAQ,SAAU,KAAK;AAC1B,YAAM,GAAG,EAAE,SAAU,KAAK,QAAQ;AAAE,aAAK,KAAK,KAAK,MAAM;AAAA,OAAG;AAAA,IAClE,CAAK;AAAA,EACL,OAAS;AAEL,UAAM,QAAQ,SAAU,MAAM,GAAG;AAC/B,WAAK,SAAU,KAAK,QAAQ;AAAE,aAAK,GAAG,KAAK,MAAM;AAAA,OAAG;AAAA,IAC1D,CAAK;AAAA,EACF;AAED,WAAS;AACX;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/run-parallel/index.js"],"sourcesContent":["/*! run-parallel. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nmodule.exports = runParallel\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction runParallel (tasks, cb) {\n  let results, pending, keys\n  let isSync = true\n\n  if (Array.isArray(tasks)) {\n    results = []\n    pending = tasks.length\n  } else {\n    keys = Object.keys(tasks)\n    results = {}\n    pending = keys.length\n  }\n\n  function done (err) {\n    function end () {\n      if (cb) cb(err, results)\n      cb = null\n    }\n    if (isSync) queueMicrotask(end)\n    else end()\n  }\n\n  function each (i, err, result) {\n    results[i] = result\n    if (--pending === 0 || err) {\n      done(err)\n    }\n  }\n\n  if (!pending) {\n    // empty\n    done(null)\n  } else if (keys) {\n    // object\n    keys.forEach(function (key) {\n      tasks[key](function (err, result) { each(key, err, result) })\n    })\n  } else {\n    // array\n    tasks.forEach(function (task, i) {\n      task(function (err, result) { each(i, err, result) })\n    })\n  }\n\n  isSync = false\n}\n"],"names":["require$$0"],"mappings":";;;;AACA,IAAA,gBAAiB;AAEjB,MAAM,iBAAiBA,MAA0B;AAEjD,SAAS,YAAa,OAAO,IAAI;AAC/B,MAAI,SAAS,SAAS;AACtB,MAAI,SAAS;AAEb,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,cAAU,CAAE;AACZ,cAAU,MAAM;AAAA,EACpB,OAAS;AACL,WAAO,OAAO,KAAK,KAAK;AACxB,cAAU,CAAE;AACZ,cAAU,KAAK;AAAA,EAChB;AAED,WAAS,KAAM,KAAK;AAClB,aAAS,MAAO;AACd,UAAI;AAAI,WAAG,KAAK,OAAO;AACvB,WAAK;AAAA,IACN;AACD,QAAI;AAAQ,qBAAe,GAAG;AAAA;AACzB,UAAK;AAAA,EACX;AAED,WAAS,KAAM,GAAG,KAAK,QAAQ;AAC7B,YAAQ,CAAC,IAAI;AACb,QAAI,EAAE,YAAY,KAAK,KAAK;AAC1B,WAAK,GAAG;AAAA,IACT;AAAA,EACF;AAED,MAAI,CAAC,SAAS;AAEZ,SAAK,IAAI;AAAA,EACV,WAAU,MAAM;AAEf,SAAK,QAAQ,SAAU,KAAK;AAC1B,YAAM,GAAG,EAAE,SAAU,KAAK,QAAQ;AAAE,aAAK,KAAK,KAAK,MAAM;AAAA,OAAG;AAAA,IAClE,CAAK;AAAA,EACL,OAAS;AAEL,UAAM,QAAQ,SAAU,MAAM,GAAG;AAC/B,WAAK,SAAU,KAAK,QAAQ;AAAE,aAAK,GAAG,KAAK,MAAM;AAAA,OAAG;AAAA,IAC1D,CAAK;AAAA,EACF;AAED,WAAS;AACX;;","x_google_ignoreList":[0]}

package/dist/_node_modules/run-parallel/index.js

@@ -1,4 +1,4 @@
-import queueMicrotask_1 from "../queue-microtask/index.js";
+import { q as queueMicrotask_1 } from "../queue-microtask/index.js";
 /*! run-parallel. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 var runParallel_1 = runParallel;
 const queueMicrotask = queueMicrotask_1;
@@ -48,6 +48,6 @@ function runParallel(tasks, cb) {
   isSync = false;
 }
 export {
-  runParallel_1 as default
+  runParallel_1 as r
 };
 //# sourceMappingURL=index.js.map

package/dist/_node_modules/spdx-correct/index.cjs

@@ -1,7 +1,8 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const index$1 = require("../spdx-expression-parse/index.cjs");
 const index = require("../spdx-license-ids/index.json.cjs");
-var parse = index$1;
+var parse = index$1.spdxExpressionParse;
 var spdxLicenseIds = index;
 function valid(string) {
   try {
@@ -329,5 +330,5 @@ function upgradeGPLs(value) {
     return value;
   }
 }
-module.exports = spdxCorrect;
+exports.spdxCorrect = spdxCorrect;
 //# sourceMappingURL=index.cjs.map

package/dist/_node_modules/spdx-correct/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/spdx-correct/index.js"],"sourcesContent":["/*\nCopyright spdx-correct.js contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n   http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nvar parse = require('spdx-expression-parse')\nvar spdxLicenseIds = require('spdx-license-ids')\n\nfunction valid (string) {\n  try {\n    parse(string)\n    return true\n  } catch (error) {\n    return false\n  }\n}\n\n// Sorting function that orders the given array of transpositions such\n// that a transposition with the longer pattern comes before a transposition\n// with a shorter pattern. This is to prevent e.g. the transposition\n// [\"General Public License\", \"GPL\"] from matching to \"Lesser General Public License\"\n// before a longer and more accurate transposition [\"Lesser General Public License\", \"LGPL\"]\n// has a chance to be recognized.\nfunction sortTranspositions(a, b) {\n  var length = b[0].length - a[0].length\n  if (length !== 0) return length\n  return a[0].toUpperCase().localeCompare(b[0].toUpperCase())\n}\n\n// Common transpositions of license identifier acronyms\nvar transpositions = [\n  ['APGL', 'AGPL'],\n  ['Gpl', 'GPL'],\n  ['GLP', 'GPL'],\n  ['APL', 'Apache'],\n  ['ISD', 'ISC'],\n  ['GLP', 'GPL'],\n  ['IST', 'ISC'],\n  ['Claude', 'Clause'],\n  [' or later', '+'],\n  [' International', ''],\n  ['GNU', 'GPL'],\n  ['GUN', 'GPL'],\n  ['+', ''],\n  ['GNU GPL', 'GPL'],\n  ['GNU LGPL', 'LGPL'],\n  ['GNU/GPL', 'GPL'],\n  ['GNU GLP', 'GPL'],\n  ['GNU LESSER GENERAL PUBLIC LICENSE', 'LGPL'],\n  ['GNU Lesser General Public License', 'LGPL'],\n  ['GNU LESSER GENERAL PUBLIC LICENSE', 'LGPL-2.1'],\n  ['GNU Lesser General Public License', 'LGPL-2.1'],\n  ['LESSER GENERAL PUBLIC LICENSE', 'LGPL'],\n  ['Lesser General Public License', 'LGPL'],\n  ['LESSER GENERAL PUBLIC LICENSE', 'LGPL-2.1'],\n  ['Lesser General Public License', 'LGPL-2.1'],\n  ['GNU General Public License', 'GPL'],\n  ['Gnu public license', 'GPL'],\n  ['GNU Public License', 'GPL'],\n  ['GNU GENERAL PUBLIC LICENSE', 'GPL'],\n  ['MTI', 'MIT'],\n  ['Mozilla Public License', 'MPL'],\n  ['Universal Permissive License', 'UPL'],\n  ['WTH', 'WTF'],\n  ['WTFGPL', 'WTFPL'],\n  ['-License', '']\n].sort(sortTranspositions)\n\nvar TRANSPOSED = 0\nvar CORRECT = 1\n\n// Simple corrections to nearly valid identifiers.\nvar transforms = [\n  // e.g. 'mit'\n  function (argument) {\n    return argument.toUpperCase()\n  },\n  // e.g. 'MIT '\n  function (argument) {\n    return argument.trim()\n  },\n  // e.g. 'M.I.T.'\n  function (argument) {\n    return argument.replace(/\\./g, '')\n  },\n  // e.g. 'Apache- 2.0'\n  function (argument) {\n    return argument.replace(/\\s+/g, '')\n  },\n  // e.g. 'CC BY 4.0''\n  function (argument) {\n    return argument.replace(/\\s+/g, '-')\n  },\n  // e.g. 'LGPLv2.1'\n  function (argument) {\n    return argument.replace('v', '-')\n  },\n  // e.g. 'Apache 2.0'\n  function (argument) {\n    return argument.replace(/,?\\s*(\\d)/, '-$1')\n  },\n  // e.g. 'GPL 2'\n  function (argument) {\n    return argument.replace(/,?\\s*(\\d)/, '-$1.0')\n  },\n  // e.g. 'Apache Version 2.0'\n  function (argument) {\n    return argument\n      .replace(/,?\\s*(V\\.|v\\.|V|v|Version|version)\\s*(\\d)/, '-$2')\n  },\n  // e.g. 'Apache Version 2'\n  function (argument) {\n    return argument\n      .replace(/,?\\s*(V\\.|v\\.|V|v|Version|version)\\s*(\\d)/, '-$2.0')\n  },\n  // e.g. 'ZLIB'\n  function (argument) {\n    return argument[0].toUpperCase() + argument.slice(1)\n  },\n  // e.g. 'MPL/2.0'\n  function (argument) {\n    return argument.replace('/', '-')\n  },\n  // e.g. 'Apache 2'\n  function (argument) {\n    return argument\n      .replace(/\\s*V\\s*(\\d)/, '-$1')\n      .replace(/(\\d)$/, '$1.0')\n  },\n  // e.g. 'GPL-2.0', 'GPL-3.0'\n  function (argument) {\n    if (argument.indexOf('3.0') !== -1) {\n      return argument + '-or-later'\n    } else {\n      return argument + '-only'\n    }\n  },\n  // e.g. 'GPL-2.0-'\n  function (argument) {\n    return argument + 'only'\n  },\n  // e.g. 'GPL2'\n  function (argument) {\n    return argument.replace(/(\\d)$/, '-$1.0')\n  },\n  // e.g. 'BSD 3'\n  function (argument) {\n    return argument.replace(/(-| )?(\\d)$/, '-$2-Clause')\n  },\n  // e.g. 'BSD clause 3'\n  function (argument) {\n    return argument.replace(/(-| )clause(-| )(\\d)/, '-$3-Clause')\n  },\n  // e.g. 'New BSD license'\n  function (argument) {\n    return argument.replace(/\\b(Modified|New|Revised)(-| )?BSD((-| )License)?/i, 'BSD-3-Clause')\n  },\n  // e.g. 'Simplified BSD license'\n  function (argument) {\n    return argument.replace(/\\bSimplified(-| )?BSD((-| )License)?/i, 'BSD-2-Clause')\n  },\n  // e.g. 'Free BSD license'\n  function (argument) {\n    return argument.replace(/\\b(Free|Net)(-| )?BSD((-| )License)?/i, 'BSD-2-Clause-$1BSD')\n  },\n  // e.g. 'Clear BSD license'\n  function (argument) {\n    return argument.replace(/\\bClear(-| )?BSD((-| )License)?/i, 'BSD-3-Clause-Clear')\n  },\n  // e.g. 'Old BSD License'\n  function (argument) {\n    return argument.replace(/\\b(Old|Original)(-| )?BSD((-| )License)?/i, 'BSD-4-Clause')\n  },\n  // e.g. 'BY-NC-4.0'\n  function (argument) {\n    return 'CC-' + argument\n  },\n  // e.g. 'BY-NC'\n  function (argument) {\n    return 'CC-' + argument + '-4.0'\n  },\n  // e.g. 'Attribution-NonCommercial'\n  function (argument) {\n    return argument\n      .replace('Attribution', 'BY')\n      .replace('NonCommercial', 'NC')\n      .replace('NoDerivatives', 'ND')\n      .replace(/ (\\d)/, '-$1')\n      .replace(/ ?International/, '')\n  },\n  // e.g. 'Attribution-NonCommercial'\n  function (argument) {\n    return 'CC-' +\n      argument\n        .replace('Attribution', 'BY')\n        .replace('NonCommercial', 'NC')\n        .replace('NoDerivatives', 'ND')\n        .replace(/ (\\d)/, '-$1')\n        .replace(/ ?International/, '') +\n      '-4.0'\n  }\n]\n\nvar licensesWithVersions = spdxLicenseIds\n  .map(function (id) {\n    var match = /^(.*)-\\d+\\.\\d+$/.exec(id)\n    return match\n      ? [match[0], match[1]]\n      : [id, null]\n  })\n  .reduce(function (objectMap, item) {\n    var key = item[1]\n    objectMap[key] = objectMap[key] || []\n    objectMap[key].push(item[0])\n    return objectMap\n  }, {})\n\nvar licensesWithOneVersion = Object.keys(licensesWithVersions)\n  .map(function makeEntries (key) {\n    return [key, licensesWithVersions[key]]\n  })\n  .filter(function identifySoleVersions (item) {\n    return (\n      // Licenses has just one valid version suffix.\n      item[1].length === 1 &&\n      item[0] !== null &&\n      // APL will be considered Apache, rather than APL-1.0\n      item[0] !== 'APL'\n    )\n  })\n  .map(function createLastResorts (item) {\n    return [item[0], item[1][0]]\n  })\n\nlicensesWithVersions = undefined\n\n// If all else fails, guess that strings containing certain substrings\n// meant to identify certain licenses.\nvar lastResorts = [\n  ['UNLI', 'Unlicense'],\n  ['WTF', 'WTFPL'],\n  ['2 CLAUSE', 'BSD-2-Clause'],\n  ['2-CLAUSE', 'BSD-2-Clause'],\n  ['3 CLAUSE', 'BSD-3-Clause'],\n  ['3-CLAUSE', 'BSD-3-Clause'],\n  ['AFFERO', 'AGPL-3.0-or-later'],\n  ['AGPL', 'AGPL-3.0-or-later'],\n  ['APACHE', 'Apache-2.0'],\n  ['ARTISTIC', 'Artistic-2.0'],\n  ['Affero', 'AGPL-3.0-or-later'],\n  ['BEER', 'Beerware'],\n  ['BOOST', 'BSL-1.0'],\n  ['BSD', 'BSD-2-Clause'],\n  ['CDDL', 'CDDL-1.1'],\n  ['ECLIPSE', 'EPL-1.0'],\n  ['FUCK', 'WTFPL'],\n  ['GNU', 'GPL-3.0-or-later'],\n  ['LGPL', 'LGPL-3.0-or-later'],\n  ['GPLV1', 'GPL-1.0-only'],\n  ['GPL-1', 'GPL-1.0-only'],\n  ['GPLV2', 'GPL-2.0-only'],\n  ['GPL-2', 'GPL-2.0-only'],\n  ['GPL', 'GPL-3.0-or-later'],\n  ['MIT +NO-FALSE-ATTRIBS', 'MITNFA'],\n  ['MIT', 'MIT'],\n  ['MPL', 'MPL-2.0'],\n  ['X11', 'X11'],\n  ['ZLIB', 'Zlib']\n].concat(licensesWithOneVersion).sort(sortTranspositions)\n\nvar SUBSTRING = 0\nvar IDENTIFIER = 1\n\nvar validTransformation = function (identifier) {\n  for (var i = 0; i < transforms.length; i++) {\n    var transformed = transforms[i](identifier).trim()\n    if (transformed !== identifier && valid(transformed)) {\n      return transformed\n    }\n  }\n  return null\n}\n\nvar validLastResort = function (identifier) {\n  var upperCased = identifier.toUpperCase()\n  for (var i = 0; i < lastResorts.length; i++) {\n    var lastResort = lastResorts[i]\n    if (upperCased.indexOf(lastResort[SUBSTRING]) > -1) {\n      return lastResort[IDENTIFIER]\n    }\n  }\n  return null\n}\n\nvar anyCorrection = function (identifier, check) {\n  for (var i = 0; i < transpositions.length; i++) {\n    var transposition = transpositions[i]\n    var transposed = transposition[TRANSPOSED]\n    if (identifier.indexOf(transposed) > -1) {\n      var corrected = identifier.replace(\n        transposed,\n        transposition[CORRECT]\n      )\n      var checked = check(corrected)\n      if (checked !== null) {\n        return checked\n      }\n    }\n  }\n  return null\n}\n\nmodule.exports = function (identifier, options) {\n  options = options || {}\n  var upgrade = options.upgrade === undefined ? true : !!options.upgrade\n  function postprocess (value) {\n    return upgrade ? upgradeGPLs(value) : value\n  }\n  var validArugment = (\n    typeof identifier === 'string' &&\n    identifier.trim().length !== 0\n  )\n  if (!validArugment) {\n    throw Error('Invalid argument. Expected non-empty string.')\n  }\n  identifier = identifier.trim()\n  if (valid(identifier)) {\n    return postprocess(identifier)\n  }\n  var noPlus = identifier.replace(/\\+$/, '').trim()\n  if (valid(noPlus)) {\n    return postprocess(noPlus)\n  }\n  var transformed = validTransformation(identifier)\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  transformed = anyCorrection(identifier, function (argument) {\n    if (valid(argument)) {\n      return argument\n    }\n    return validTransformation(argument)\n  })\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  transformed = validLastResort(identifier)\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  transformed = anyCorrection(identifier, validLastResort)\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  return null\n}\n\nfunction upgradeGPLs (value) {\n  if ([\n    'GPL-1.0', 'LGPL-1.0', 'AGPL-1.0',\n    'GPL-2.0', 'LGPL-2.0', 'AGPL-2.0',\n    'LGPL-2.1'\n  ].indexOf(value) !== -1) {\n    return value + '-only'\n  } else if ([\n    'GPL-1.0+', 'GPL-2.0+', 'GPL-3.0+',\n    'LGPL-2.0+', 'LGPL-2.1+', 'LGPL-3.0+',\n    'AGPL-1.0+', 'AGPL-3.0+'\n  ].indexOf(value) !== -1) {\n    return value.replace(/\\+$/, '-or-later')\n  } else if (['GPL-3.0', 'LGPL-3.0', 'AGPL-3.0'].indexOf(value) !== -1) {\n    return value + '-or-later'\n  } else {\n    return value\n  }\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;AAeA,IAAI,QAAQA;AACZ,IAAI,iBAAiBC;AAErB,SAAS,MAAO,QAAQ;AACtB,MAAI;AACF,UAAM,MAAM;AACZ,WAAO;AAAA,EACR,SAAQ,OAAP;AACA,WAAO;AAAA,EACR;AACH;AAQA,SAAS,mBAAmB,GAAG,GAAG;AAChC,MAAI,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE;AAChC,MAAI,WAAW;AAAG,WAAO;AACzB,SAAO,EAAE,CAAC,EAAE,YAAa,EAAC,cAAc,EAAE,CAAC,EAAE,aAAa;AAC5D;AAGA,IAAI,iBAAiB;AAAA,EACnB,CAAC,QAAQ,MAAM;AAAA,EACf,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,QAAQ;AAAA,EAChB,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,UAAU,QAAQ;AAAA,EACnB,CAAC,aAAa,GAAG;AAAA,EACjB,CAAC,kBAAkB,EAAE;AAAA,EACrB,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,KAAK,EAAE;AAAA,EACR,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,YAAY,MAAM;AAAA,EACnB,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,qCAAqC,MAAM;AAAA,EAC5C,CAAC,qCAAqC,MAAM;AAAA,EAC5C,CAAC,qCAAqC,UAAU;AAAA,EAChD,CAAC,qCAAqC,UAAU;AAAA,EAChD,CAAC,iCAAiC,MAAM;AAAA,EACxC,CAAC,iCAAiC,MAAM;AAAA,EACxC,CAAC,iCAAiC,UAAU;AAAA,EAC5C,CAAC,iCAAiC,UAAU;AAAA,EAC5C,CAAC,8BAA8B,KAAK;AAAA,EACpC,CAAC,sBAAsB,KAAK;AAAA,EAC5B,CAAC,sBAAsB,KAAK;AAAA,EAC5B,CAAC,8BAA8B,KAAK;AAAA,EACpC,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,0BAA0B,KAAK;AAAA,EAChC,CAAC,gCAAgC,KAAK;AAAA,EACtC,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,UAAU,OAAO;AAAA,EAClB,CAAC,YAAY,EAAE;AACjB,EAAE,KAAK,kBAAkB;AAEzB,IAAI,aAAa;AACjB,IAAI,UAAU;AAGd,IAAI,aAAa;AAAA;AAAA,EAEf,SAAU,UAAU;AAClB,WAAO,SAAS,YAAa;AAAA,EAC9B;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,KAAM;AAAA,EACvB;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,OAAO,EAAE;AAAA,EAClC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,QAAQ,EAAE;AAAA,EACnC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,QAAQ,GAAG;AAAA,EACpC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,KAAK,GAAG;AAAA,EACjC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,aAAa,KAAK;AAAA,EAC3C;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,aAAa,OAAO;AAAA,EAC7C;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,6CAA6C,KAAK;AAAA,EAC9D;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,6CAA6C,OAAO;AAAA,EAChE;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,CAAC,EAAE,YAAa,IAAG,SAAS,MAAM,CAAC;AAAA,EACpD;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,KAAK,GAAG;AAAA,EACjC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,eAAe,KAAK,EAC5B,QAAQ,SAAS,MAAM;AAAA,EAC3B;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,QAAI,SAAS,QAAQ,KAAK,MAAM,IAAI;AAClC,aAAO,WAAW;AAAA,IACxB,OAAW;AACL,aAAO,WAAW;AAAA,IACnB;AAAA,EACF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,WAAW;AAAA,EACnB;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,SAAS,OAAO;AAAA,EACzC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,eAAe,YAAY;AAAA,EACpD;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,wBAAwB,YAAY;AAAA,EAC7D;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,qDAAqD,cAAc;AAAA,EAC5F;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,yCAAyC,cAAc;AAAA,EAChF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,yCAAyC,oBAAoB;AAAA,EACtF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,oCAAoC,oBAAoB;AAAA,EACjF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,6CAA6C,cAAc;AAAA,EACpF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,QAAQ;AAAA,EAChB;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,QAAQ,WAAW;AAAA,EAC3B;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,eAAe,IAAI,EAC3B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,SAAS,KAAK,EACtB,QAAQ,mBAAmB,EAAE;AAAA,EACjC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,QACL,SACG,QAAQ,eAAe,IAAI,EAC3B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,SAAS,KAAK,EACtB,QAAQ,mBAAmB,EAAE,IAChC;AAAA,EACH;AACH;AAEA,IAAI,uBAAuB,eACxB,IAAI,SAAU,IAAI;AACjB,MAAI,QAAQ,kBAAkB,KAAK,EAAE;AACrC,SAAO,QACH,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,IACnB,CAAC,IAAI,IAAI;AACjB,CAAG,EACA,OAAO,SAAU,WAAW,MAAM;AACjC,MAAI,MAAM,KAAK,CAAC;AAChB,YAAU,GAAG,IAAI,UAAU,GAAG,KAAK,CAAE;AACrC,YAAU,GAAG,EAAE,KAAK,KAAK,CAAC,CAAC;AAC3B,SAAO;AACR,GAAE,EAAE;AAEP,IAAI,yBAAyB,OAAO,KAAK,oBAAoB,EAC1D,IAAI,SAAS,YAAa,KAAK;AAC9B,SAAO,CAAC,KAAK,qBAAqB,GAAG,CAAC;AAC1C,CAAG,EACA,OAAO,SAAS,qBAAsB,MAAM;AAC3C;AAAA;AAAA,IAEE,KAAK,CAAC,EAAE,WAAW,KACnB,KAAK,CAAC,MAAM;AAAA,IAEZ,KAAK,CAAC,MAAM;AAAA;AAElB,CAAG,EACA,IAAI,SAAS,kBAAmB,MAAM;AACrC,SAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;AAC/B,CAAG;AAEH,uBAAuB;AAIvB,IAAI,cAAc;AAAA,EAChB,CAAC,QAAQ,WAAW;AAAA,EACpB,CAAC,OAAO,OAAO;AAAA,EACf,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,UAAU,mBAAmB;AAAA,EAC9B,CAAC,QAAQ,mBAAmB;AAAA,EAC5B,CAAC,UAAU,YAAY;AAAA,EACvB,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,UAAU,mBAAmB;AAAA,EAC9B,CAAC,QAAQ,UAAU;AAAA,EACnB,CAAC,SAAS,SAAS;AAAA,EACnB,CAAC,OAAO,cAAc;AAAA,EACtB,CAAC,QAAQ,UAAU;AAAA,EACnB,CAAC,WAAW,SAAS;AAAA,EACrB,CAAC,QAAQ,OAAO;AAAA,EAChB,CAAC,OAAO,kBAAkB;AAAA,EAC1B,CAAC,QAAQ,mBAAmB;AAAA,EAC5B,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,OAAO,kBAAkB;AAAA,EAC1B,CAAC,yBAAyB,QAAQ;AAAA,EAClC,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,SAAS;AAAA,EACjB,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,QAAQ,MAAM;AACjB,EAAE,OAAO,sBAAsB,EAAE,KAAK,kBAAkB;AAExD,IAAI,YAAY;AAChB,IAAI,aAAa;AAEjB,IAAI,sBAAsB,SAAU,YAAY;AAC9C,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,QAAI,cAAc,WAAW,CAAC,EAAE,UAAU,EAAE,KAAM;AAClD,QAAI,gBAAgB,cAAc,MAAM,WAAW,GAAG;AACpD,aAAO;AAAA,IACR;AAAA,EACF;AACD,SAAO;AACT;AAEA,IAAI,kBAAkB,SAAU,YAAY;AAC1C,MAAI,aAAa,WAAW,YAAa;AACzC,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,QAAI,aAAa,YAAY,CAAC;AAC9B,QAAI,WAAW,QAAQ,WAAW,SAAS,CAAC,IAAI,IAAI;AAClD,aAAO,WAAW,UAAU;AAAA,IAC7B;AAAA,EACF;AACD,SAAO;AACT;AAEA,IAAI,gBAAgB,SAAU,YAAY,OAAO;AAC/C,WAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,QAAI,gBAAgB,eAAe,CAAC;AACpC,QAAI,aAAa,cAAc,UAAU;AACzC,QAAI,WAAW,QAAQ,UAAU,IAAI,IAAI;AACvC,UAAI,YAAY,WAAW;AAAA,QACzB;AAAA,QACA,cAAc,OAAO;AAAA,MACtB;AACD,UAAI,UAAU,MAAM,SAAS;AAC7B,UAAI,YAAY,MAAM;AACpB,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACD,SAAO;AACT;AAEA,IAAA,cAAiB,SAAU,YAAY,SAAS;AAC9C,YAAU,WAAW,CAAE;AACvB,MAAI,UAAU,QAAQ,YAAY,SAAY,OAAO,CAAC,CAAC,QAAQ;AAC/D,WAAS,YAAa,OAAO;AAC3B,WAAO,UAAU,YAAY,KAAK,IAAI;AAAA,EACvC;AACD,MAAI,gBACF,OAAO,eAAe,YACtB,WAAW,OAAO,WAAW;AAE/B,MAAI,CAAC,eAAe;AAClB,UAAM,MAAM,8CAA8C;AAAA,EAC3D;AACD,eAAa,WAAW,KAAM;AAC9B,MAAI,MAAM,UAAU,GAAG;AACrB,WAAO,YAAY,UAAU;AAAA,EAC9B;AACD,MAAI,SAAS,WAAW,QAAQ,OAAO,EAAE,EAAE,KAAM;AACjD,MAAI,MAAM,MAAM,GAAG;AACjB,WAAO,YAAY,MAAM;AAAA,EAC1B;AACD,MAAI,cAAc,oBAAoB,UAAU;AAChD,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,gBAAc,cAAc,YAAY,SAAU,UAAU;AAC1D,QAAI,MAAM,QAAQ,GAAG;AACnB,aAAO;AAAA,IACR;AACD,WAAO,oBAAoB,QAAQ;AAAA,EACvC,CAAG;AACD,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,gBAAc,gBAAgB,UAAU;AACxC,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,gBAAc,cAAc,YAAY,eAAe;AACvD,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,SAAO;AACT;AAEA,SAAS,YAAa,OAAO;AAC3B,MAAI;AAAA,IACF;AAAA,IAAW;AAAA,IAAY;AAAA,IACvB;AAAA,IAAW;AAAA,IAAY;AAAA,IACvB;AAAA,EACD,EAAC,QAAQ,KAAK,MAAM,IAAI;AACvB,WAAO,QAAQ;AAAA,EACnB,WAAa;AAAA,IACT;AAAA,IAAY;AAAA,IAAY;AAAA,IACxB;AAAA,IAAa;AAAA,IAAa;AAAA,IAC1B;AAAA,IAAa;AAAA,EACd,EAAC,QAAQ,KAAK,MAAM,IAAI;AACvB,WAAO,MAAM,QAAQ,OAAO,WAAW;AAAA,EAC3C,WAAa,CAAC,WAAW,YAAY,UAAU,EAAE,QAAQ,KAAK,MAAM,IAAI;AACpE,WAAO,QAAQ;AAAA,EACnB,OAAS;AACL,WAAO;AAAA,EACR;AACH;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/spdx-correct/index.js"],"sourcesContent":["/*\nCopyright spdx-correct.js contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n   http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nvar parse = require('spdx-expression-parse')\nvar spdxLicenseIds = require('spdx-license-ids')\n\nfunction valid (string) {\n  try {\n    parse(string)\n    return true\n  } catch (error) {\n    return false\n  }\n}\n\n// Sorting function that orders the given array of transpositions such\n// that a transposition with the longer pattern comes before a transposition\n// with a shorter pattern. This is to prevent e.g. the transposition\n// [\"General Public License\", \"GPL\"] from matching to \"Lesser General Public License\"\n// before a longer and more accurate transposition [\"Lesser General Public License\", \"LGPL\"]\n// has a chance to be recognized.\nfunction sortTranspositions(a, b) {\n  var length = b[0].length - a[0].length\n  if (length !== 0) return length\n  return a[0].toUpperCase().localeCompare(b[0].toUpperCase())\n}\n\n// Common transpositions of license identifier acronyms\nvar transpositions = [\n  ['APGL', 'AGPL'],\n  ['Gpl', 'GPL'],\n  ['GLP', 'GPL'],\n  ['APL', 'Apache'],\n  ['ISD', 'ISC'],\n  ['GLP', 'GPL'],\n  ['IST', 'ISC'],\n  ['Claude', 'Clause'],\n  [' or later', '+'],\n  [' International', ''],\n  ['GNU', 'GPL'],\n  ['GUN', 'GPL'],\n  ['+', ''],\n  ['GNU GPL', 'GPL'],\n  ['GNU LGPL', 'LGPL'],\n  ['GNU/GPL', 'GPL'],\n  ['GNU GLP', 'GPL'],\n  ['GNU LESSER GENERAL PUBLIC LICENSE', 'LGPL'],\n  ['GNU Lesser General Public License', 'LGPL'],\n  ['GNU LESSER GENERAL PUBLIC LICENSE', 'LGPL-2.1'],\n  ['GNU Lesser General Public License', 'LGPL-2.1'],\n  ['LESSER GENERAL PUBLIC LICENSE', 'LGPL'],\n  ['Lesser General Public License', 'LGPL'],\n  ['LESSER GENERAL PUBLIC LICENSE', 'LGPL-2.1'],\n  ['Lesser General Public License', 'LGPL-2.1'],\n  ['GNU General Public License', 'GPL'],\n  ['Gnu public license', 'GPL'],\n  ['GNU Public License', 'GPL'],\n  ['GNU GENERAL PUBLIC LICENSE', 'GPL'],\n  ['MTI', 'MIT'],\n  ['Mozilla Public License', 'MPL'],\n  ['Universal Permissive License', 'UPL'],\n  ['WTH', 'WTF'],\n  ['WTFGPL', 'WTFPL'],\n  ['-License', '']\n].sort(sortTranspositions)\n\nvar TRANSPOSED = 0\nvar CORRECT = 1\n\n// Simple corrections to nearly valid identifiers.\nvar transforms = [\n  // e.g. 'mit'\n  function (argument) {\n    return argument.toUpperCase()\n  },\n  // e.g. 'MIT '\n  function (argument) {\n    return argument.trim()\n  },\n  // e.g. 'M.I.T.'\n  function (argument) {\n    return argument.replace(/\\./g, '')\n  },\n  // e.g. 'Apache- 2.0'\n  function (argument) {\n    return argument.replace(/\\s+/g, '')\n  },\n  // e.g. 'CC BY 4.0''\n  function (argument) {\n    return argument.replace(/\\s+/g, '-')\n  },\n  // e.g. 'LGPLv2.1'\n  function (argument) {\n    return argument.replace('v', '-')\n  },\n  // e.g. 'Apache 2.0'\n  function (argument) {\n    return argument.replace(/,?\\s*(\\d)/, '-$1')\n  },\n  // e.g. 'GPL 2'\n  function (argument) {\n    return argument.replace(/,?\\s*(\\d)/, '-$1.0')\n  },\n  // e.g. 'Apache Version 2.0'\n  function (argument) {\n    return argument\n      .replace(/,?\\s*(V\\.|v\\.|V|v|Version|version)\\s*(\\d)/, '-$2')\n  },\n  // e.g. 'Apache Version 2'\n  function (argument) {\n    return argument\n      .replace(/,?\\s*(V\\.|v\\.|V|v|Version|version)\\s*(\\d)/, '-$2.0')\n  },\n  // e.g. 'ZLIB'\n  function (argument) {\n    return argument[0].toUpperCase() + argument.slice(1)\n  },\n  // e.g. 'MPL/2.0'\n  function (argument) {\n    return argument.replace('/', '-')\n  },\n  // e.g. 'Apache 2'\n  function (argument) {\n    return argument\n      .replace(/\\s*V\\s*(\\d)/, '-$1')\n      .replace(/(\\d)$/, '$1.0')\n  },\n  // e.g. 'GPL-2.0', 'GPL-3.0'\n  function (argument) {\n    if (argument.indexOf('3.0') !== -1) {\n      return argument + '-or-later'\n    } else {\n      return argument + '-only'\n    }\n  },\n  // e.g. 'GPL-2.0-'\n  function (argument) {\n    return argument + 'only'\n  },\n  // e.g. 'GPL2'\n  function (argument) {\n    return argument.replace(/(\\d)$/, '-$1.0')\n  },\n  // e.g. 'BSD 3'\n  function (argument) {\n    return argument.replace(/(-| )?(\\d)$/, '-$2-Clause')\n  },\n  // e.g. 'BSD clause 3'\n  function (argument) {\n    return argument.replace(/(-| )clause(-| )(\\d)/, '-$3-Clause')\n  },\n  // e.g. 'New BSD license'\n  function (argument) {\n    return argument.replace(/\\b(Modified|New|Revised)(-| )?BSD((-| )License)?/i, 'BSD-3-Clause')\n  },\n  // e.g. 'Simplified BSD license'\n  function (argument) {\n    return argument.replace(/\\bSimplified(-| )?BSD((-| )License)?/i, 'BSD-2-Clause')\n  },\n  // e.g. 'Free BSD license'\n  function (argument) {\n    return argument.replace(/\\b(Free|Net)(-| )?BSD((-| )License)?/i, 'BSD-2-Clause-$1BSD')\n  },\n  // e.g. 'Clear BSD license'\n  function (argument) {\n    return argument.replace(/\\bClear(-| )?BSD((-| )License)?/i, 'BSD-3-Clause-Clear')\n  },\n  // e.g. 'Old BSD License'\n  function (argument) {\n    return argument.replace(/\\b(Old|Original)(-| )?BSD((-| )License)?/i, 'BSD-4-Clause')\n  },\n  // e.g. 'BY-NC-4.0'\n  function (argument) {\n    return 'CC-' + argument\n  },\n  // e.g. 'BY-NC'\n  function (argument) {\n    return 'CC-' + argument + '-4.0'\n  },\n  // e.g. 'Attribution-NonCommercial'\n  function (argument) {\n    return argument\n      .replace('Attribution', 'BY')\n      .replace('NonCommercial', 'NC')\n      .replace('NoDerivatives', 'ND')\n      .replace(/ (\\d)/, '-$1')\n      .replace(/ ?International/, '')\n  },\n  // e.g. 'Attribution-NonCommercial'\n  function (argument) {\n    return 'CC-' +\n      argument\n        .replace('Attribution', 'BY')\n        .replace('NonCommercial', 'NC')\n        .replace('NoDerivatives', 'ND')\n        .replace(/ (\\d)/, '-$1')\n        .replace(/ ?International/, '') +\n      '-4.0'\n  }\n]\n\nvar licensesWithVersions = spdxLicenseIds\n  .map(function (id) {\n    var match = /^(.*)-\\d+\\.\\d+$/.exec(id)\n    return match\n      ? [match[0], match[1]]\n      : [id, null]\n  })\n  .reduce(function (objectMap, item) {\n    var key = item[1]\n    objectMap[key] = objectMap[key] || []\n    objectMap[key].push(item[0])\n    return objectMap\n  }, {})\n\nvar licensesWithOneVersion = Object.keys(licensesWithVersions)\n  .map(function makeEntries (key) {\n    return [key, licensesWithVersions[key]]\n  })\n  .filter(function identifySoleVersions (item) {\n    return (\n      // Licenses has just one valid version suffix.\n      item[1].length === 1 &&\n      item[0] !== null &&\n      // APL will be considered Apache, rather than APL-1.0\n      item[0] !== 'APL'\n    )\n  })\n  .map(function createLastResorts (item) {\n    return [item[0], item[1][0]]\n  })\n\nlicensesWithVersions = undefined\n\n// If all else fails, guess that strings containing certain substrings\n// meant to identify certain licenses.\nvar lastResorts = [\n  ['UNLI', 'Unlicense'],\n  ['WTF', 'WTFPL'],\n  ['2 CLAUSE', 'BSD-2-Clause'],\n  ['2-CLAUSE', 'BSD-2-Clause'],\n  ['3 CLAUSE', 'BSD-3-Clause'],\n  ['3-CLAUSE', 'BSD-3-Clause'],\n  ['AFFERO', 'AGPL-3.0-or-later'],\n  ['AGPL', 'AGPL-3.0-or-later'],\n  ['APACHE', 'Apache-2.0'],\n  ['ARTISTIC', 'Artistic-2.0'],\n  ['Affero', 'AGPL-3.0-or-later'],\n  ['BEER', 'Beerware'],\n  ['BOOST', 'BSL-1.0'],\n  ['BSD', 'BSD-2-Clause'],\n  ['CDDL', 'CDDL-1.1'],\n  ['ECLIPSE', 'EPL-1.0'],\n  ['FUCK', 'WTFPL'],\n  ['GNU', 'GPL-3.0-or-later'],\n  ['LGPL', 'LGPL-3.0-or-later'],\n  ['GPLV1', 'GPL-1.0-only'],\n  ['GPL-1', 'GPL-1.0-only'],\n  ['GPLV2', 'GPL-2.0-only'],\n  ['GPL-2', 'GPL-2.0-only'],\n  ['GPL', 'GPL-3.0-or-later'],\n  ['MIT +NO-FALSE-ATTRIBS', 'MITNFA'],\n  ['MIT', 'MIT'],\n  ['MPL', 'MPL-2.0'],\n  ['X11', 'X11'],\n  ['ZLIB', 'Zlib']\n].concat(licensesWithOneVersion).sort(sortTranspositions)\n\nvar SUBSTRING = 0\nvar IDENTIFIER = 1\n\nvar validTransformation = function (identifier) {\n  for (var i = 0; i < transforms.length; i++) {\n    var transformed = transforms[i](identifier).trim()\n    if (transformed !== identifier && valid(transformed)) {\n      return transformed\n    }\n  }\n  return null\n}\n\nvar validLastResort = function (identifier) {\n  var upperCased = identifier.toUpperCase()\n  for (var i = 0; i < lastResorts.length; i++) {\n    var lastResort = lastResorts[i]\n    if (upperCased.indexOf(lastResort[SUBSTRING]) > -1) {\n      return lastResort[IDENTIFIER]\n    }\n  }\n  return null\n}\n\nvar anyCorrection = function (identifier, check) {\n  for (var i = 0; i < transpositions.length; i++) {\n    var transposition = transpositions[i]\n    var transposed = transposition[TRANSPOSED]\n    if (identifier.indexOf(transposed) > -1) {\n      var corrected = identifier.replace(\n        transposed,\n        transposition[CORRECT]\n      )\n      var checked = check(corrected)\n      if (checked !== null) {\n        return checked\n      }\n    }\n  }\n  return null\n}\n\nmodule.exports = function (identifier, options) {\n  options = options || {}\n  var upgrade = options.upgrade === undefined ? true : !!options.upgrade\n  function postprocess (value) {\n    return upgrade ? upgradeGPLs(value) : value\n  }\n  var validArugment = (\n    typeof identifier === 'string' &&\n    identifier.trim().length !== 0\n  )\n  if (!validArugment) {\n    throw Error('Invalid argument. Expected non-empty string.')\n  }\n  identifier = identifier.trim()\n  if (valid(identifier)) {\n    return postprocess(identifier)\n  }\n  var noPlus = identifier.replace(/\\+$/, '').trim()\n  if (valid(noPlus)) {\n    return postprocess(noPlus)\n  }\n  var transformed = validTransformation(identifier)\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  transformed = anyCorrection(identifier, function (argument) {\n    if (valid(argument)) {\n      return argument\n    }\n    return validTransformation(argument)\n  })\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  transformed = validLastResort(identifier)\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  transformed = anyCorrection(identifier, validLastResort)\n  if (transformed !== null) {\n    return postprocess(transformed)\n  }\n  return null\n}\n\nfunction upgradeGPLs (value) {\n  if ([\n    'GPL-1.0', 'LGPL-1.0', 'AGPL-1.0',\n    'GPL-2.0', 'LGPL-2.0', 'AGPL-2.0',\n    'LGPL-2.1'\n  ].indexOf(value) !== -1) {\n    return value + '-only'\n  } else if ([\n    'GPL-1.0+', 'GPL-2.0+', 'GPL-3.0+',\n    'LGPL-2.0+', 'LGPL-2.1+', 'LGPL-3.0+',\n    'AGPL-1.0+', 'AGPL-3.0+'\n  ].indexOf(value) !== -1) {\n    return value.replace(/\\+$/, '-or-later')\n  } else if (['GPL-3.0', 'LGPL-3.0', 'AGPL-3.0'].indexOf(value) !== -1) {\n    return value + '-or-later'\n  } else {\n    return value\n  }\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;AAeA,IAAI,QAAQA,QAAgC;AAC5C,IAAI,iBAAiBC;AAErB,SAAS,MAAO,QAAQ;AACtB,MAAI;AACF,UAAM,MAAM;AACZ,WAAO;AAAA,EACR,SAAQ,OAAP;AACA,WAAO;AAAA,EACR;AACH;AAQA,SAAS,mBAAmB,GAAG,GAAG;AAChC,MAAI,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE;AAChC,MAAI,WAAW;AAAG,WAAO;AACzB,SAAO,EAAE,CAAC,EAAE,YAAa,EAAC,cAAc,EAAE,CAAC,EAAE,aAAa;AAC5D;AAGA,IAAI,iBAAiB;AAAA,EACnB,CAAC,QAAQ,MAAM;AAAA,EACf,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,QAAQ;AAAA,EAChB,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,UAAU,QAAQ;AAAA,EACnB,CAAC,aAAa,GAAG;AAAA,EACjB,CAAC,kBAAkB,EAAE;AAAA,EACrB,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,KAAK,EAAE;AAAA,EACR,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,YAAY,MAAM;AAAA,EACnB,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,WAAW,KAAK;AAAA,EACjB,CAAC,qCAAqC,MAAM;AAAA,EAC5C,CAAC,qCAAqC,MAAM;AAAA,EAC5C,CAAC,qCAAqC,UAAU;AAAA,EAChD,CAAC,qCAAqC,UAAU;AAAA,EAChD,CAAC,iCAAiC,MAAM;AAAA,EACxC,CAAC,iCAAiC,MAAM;AAAA,EACxC,CAAC,iCAAiC,UAAU;AAAA,EAC5C,CAAC,iCAAiC,UAAU;AAAA,EAC5C,CAAC,8BAA8B,KAAK;AAAA,EACpC,CAAC,sBAAsB,KAAK;AAAA,EAC5B,CAAC,sBAAsB,KAAK;AAAA,EAC5B,CAAC,8BAA8B,KAAK;AAAA,EACpC,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,0BAA0B,KAAK;AAAA,EAChC,CAAC,gCAAgC,KAAK;AAAA,EACtC,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,UAAU,OAAO;AAAA,EAClB,CAAC,YAAY,EAAE;AACjB,EAAE,KAAK,kBAAkB;AAEzB,IAAI,aAAa;AACjB,IAAI,UAAU;AAGd,IAAI,aAAa;AAAA;AAAA,EAEf,SAAU,UAAU;AAClB,WAAO,SAAS,YAAa;AAAA,EAC9B;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,KAAM;AAAA,EACvB;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,OAAO,EAAE;AAAA,EAClC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,QAAQ,EAAE;AAAA,EACnC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,QAAQ,GAAG;AAAA,EACpC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,KAAK,GAAG;AAAA,EACjC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,aAAa,KAAK;AAAA,EAC3C;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,aAAa,OAAO;AAAA,EAC7C;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,6CAA6C,KAAK;AAAA,EAC9D;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,6CAA6C,OAAO;AAAA,EAChE;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,CAAC,EAAE,YAAa,IAAG,SAAS,MAAM,CAAC;AAAA,EACpD;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,KAAK,GAAG;AAAA,EACjC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,eAAe,KAAK,EAC5B,QAAQ,SAAS,MAAM;AAAA,EAC3B;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,QAAI,SAAS,QAAQ,KAAK,MAAM,IAAI;AAClC,aAAO,WAAW;AAAA,IACxB,OAAW;AACL,aAAO,WAAW;AAAA,IACnB;AAAA,EACF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,WAAW;AAAA,EACnB;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,SAAS,OAAO;AAAA,EACzC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,eAAe,YAAY;AAAA,EACpD;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,wBAAwB,YAAY;AAAA,EAC7D;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,qDAAqD,cAAc;AAAA,EAC5F;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,yCAAyC,cAAc;AAAA,EAChF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,yCAAyC,oBAAoB;AAAA,EACtF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,oCAAoC,oBAAoB;AAAA,EACjF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SAAS,QAAQ,6CAA6C,cAAc;AAAA,EACpF;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,QAAQ;AAAA,EAChB;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,QAAQ,WAAW;AAAA,EAC3B;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,SACJ,QAAQ,eAAe,IAAI,EAC3B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,SAAS,KAAK,EACtB,QAAQ,mBAAmB,EAAE;AAAA,EACjC;AAAA;AAAA,EAED,SAAU,UAAU;AAClB,WAAO,QACL,SACG,QAAQ,eAAe,IAAI,EAC3B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,iBAAiB,IAAI,EAC7B,QAAQ,SAAS,KAAK,EACtB,QAAQ,mBAAmB,EAAE,IAChC;AAAA,EACH;AACH;AAEA,IAAI,uBAAuB,eACxB,IAAI,SAAU,IAAI;AACjB,MAAI,QAAQ,kBAAkB,KAAK,EAAE;AACrC,SAAO,QACH,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,IACnB,CAAC,IAAI,IAAI;AACjB,CAAG,EACA,OAAO,SAAU,WAAW,MAAM;AACjC,MAAI,MAAM,KAAK,CAAC;AAChB,YAAU,GAAG,IAAI,UAAU,GAAG,KAAK,CAAE;AACrC,YAAU,GAAG,EAAE,KAAK,KAAK,CAAC,CAAC;AAC3B,SAAO;AACR,GAAE,EAAE;AAEP,IAAI,yBAAyB,OAAO,KAAK,oBAAoB,EAC1D,IAAI,SAAS,YAAa,KAAK;AAC9B,SAAO,CAAC,KAAK,qBAAqB,GAAG,CAAC;AAC1C,CAAG,EACA,OAAO,SAAS,qBAAsB,MAAM;AAC3C;AAAA;AAAA,IAEE,KAAK,CAAC,EAAE,WAAW,KACnB,KAAK,CAAC,MAAM;AAAA,IAEZ,KAAK,CAAC,MAAM;AAAA;AAElB,CAAG,EACA,IAAI,SAAS,kBAAmB,MAAM;AACrC,SAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;AAC/B,CAAG;AAEH,uBAAuB;AAIvB,IAAI,cAAc;AAAA,EAChB,CAAC,QAAQ,WAAW;AAAA,EACpB,CAAC,OAAO,OAAO;AAAA,EACf,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,UAAU,mBAAmB;AAAA,EAC9B,CAAC,QAAQ,mBAAmB;AAAA,EAC5B,CAAC,UAAU,YAAY;AAAA,EACvB,CAAC,YAAY,cAAc;AAAA,EAC3B,CAAC,UAAU,mBAAmB;AAAA,EAC9B,CAAC,QAAQ,UAAU;AAAA,EACnB,CAAC,SAAS,SAAS;AAAA,EACnB,CAAC,OAAO,cAAc;AAAA,EACtB,CAAC,QAAQ,UAAU;AAAA,EACnB,CAAC,WAAW,SAAS;AAAA,EACrB,CAAC,QAAQ,OAAO;AAAA,EAChB,CAAC,OAAO,kBAAkB;AAAA,EAC1B,CAAC,QAAQ,mBAAmB;AAAA,EAC5B,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,SAAS,cAAc;AAAA,EACxB,CAAC,OAAO,kBAAkB;AAAA,EAC1B,CAAC,yBAAyB,QAAQ;AAAA,EAClC,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,OAAO,SAAS;AAAA,EACjB,CAAC,OAAO,KAAK;AAAA,EACb,CAAC,QAAQ,MAAM;AACjB,EAAE,OAAO,sBAAsB,EAAE,KAAK,kBAAkB;AAExD,IAAI,YAAY;AAChB,IAAI,aAAa;AAEjB,IAAI,sBAAsB,SAAU,YAAY;AAC9C,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,QAAI,cAAc,WAAW,CAAC,EAAE,UAAU,EAAE,KAAM;AAClD,QAAI,gBAAgB,cAAc,MAAM,WAAW,GAAG;AACpD,aAAO;AAAA,IACR;AAAA,EACF;AACD,SAAO;AACT;AAEA,IAAI,kBAAkB,SAAU,YAAY;AAC1C,MAAI,aAAa,WAAW,YAAa;AACzC,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,QAAI,aAAa,YAAY,CAAC;AAC9B,QAAI,WAAW,QAAQ,WAAW,SAAS,CAAC,IAAI,IAAI;AAClD,aAAO,WAAW,UAAU;AAAA,IAC7B;AAAA,EACF;AACD,SAAO;AACT;AAEA,IAAI,gBAAgB,SAAU,YAAY,OAAO;AAC/C,WAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,QAAI,gBAAgB,eAAe,CAAC;AACpC,QAAI,aAAa,cAAc,UAAU;AACzC,QAAI,WAAW,QAAQ,UAAU,IAAI,IAAI;AACvC,UAAI,YAAY,WAAW;AAAA,QACzB;AAAA,QACA,cAAc,OAAO;AAAA,MACtB;AACD,UAAI,UAAU,MAAM,SAAS;AAC7B,UAAI,YAAY,MAAM;AACpB,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACD,SAAO;AACT;AAEA,IAAA,cAAiB,SAAU,YAAY,SAAS;AAC9C,YAAU,WAAW,CAAE;AACvB,MAAI,UAAU,QAAQ,YAAY,SAAY,OAAO,CAAC,CAAC,QAAQ;AAC/D,WAAS,YAAa,OAAO;AAC3B,WAAO,UAAU,YAAY,KAAK,IAAI;AAAA,EACvC;AACD,MAAI,gBACF,OAAO,eAAe,YACtB,WAAW,OAAO,WAAW;AAE/B,MAAI,CAAC,eAAe;AAClB,UAAM,MAAM,8CAA8C;AAAA,EAC3D;AACD,eAAa,WAAW,KAAM;AAC9B,MAAI,MAAM,UAAU,GAAG;AACrB,WAAO,YAAY,UAAU;AAAA,EAC9B;AACD,MAAI,SAAS,WAAW,QAAQ,OAAO,EAAE,EAAE,KAAM;AACjD,MAAI,MAAM,MAAM,GAAG;AACjB,WAAO,YAAY,MAAM;AAAA,EAC1B;AACD,MAAI,cAAc,oBAAoB,UAAU;AAChD,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,gBAAc,cAAc,YAAY,SAAU,UAAU;AAC1D,QAAI,MAAM,QAAQ,GAAG;AACnB,aAAO;AAAA,IACR;AACD,WAAO,oBAAoB,QAAQ;AAAA,EACvC,CAAG;AACD,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,gBAAc,gBAAgB,UAAU;AACxC,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,gBAAc,cAAc,YAAY,eAAe;AACvD,MAAI,gBAAgB,MAAM;AACxB,WAAO,YAAY,WAAW;AAAA,EAC/B;AACD,SAAO;AACT;AAEA,SAAS,YAAa,OAAO;AAC3B,MAAI;AAAA,IACF;AAAA,IAAW;AAAA,IAAY;AAAA,IACvB;AAAA,IAAW;AAAA,IAAY;AAAA,IACvB;AAAA,EACD,EAAC,QAAQ,KAAK,MAAM,IAAI;AACvB,WAAO,QAAQ;AAAA,EACnB,WAAa;AAAA,IACT;AAAA,IAAY;AAAA,IAAY;AAAA,IACxB;AAAA,IAAa;AAAA,IAAa;AAAA,IAC1B;AAAA,IAAa;AAAA,EACd,EAAC,QAAQ,KAAK,MAAM,IAAI;AACvB,WAAO,MAAM,QAAQ,OAAO,WAAW;AAAA,EAC3C,WAAa,CAAC,WAAW,YAAY,UAAU,EAAE,QAAQ,KAAK,MAAM,IAAI;AACpE,WAAO,QAAQ;AAAA,EACnB,OAAS;AACL,WAAO;AAAA,EACR;AACH;;","x_google_ignoreList":[0]}

package/dist/_node_modules/spdx-correct/index.js

@@ -1,4 +1,4 @@
-import spdxExpressionParse from "../spdx-expression-parse/index.js";
+import { s as spdxExpressionParse } from "../spdx-expression-parse/index.js";
 import require$$1 from "../spdx-license-ids/index.json.js";
 var parse = spdxExpressionParse;
 var spdxLicenseIds = require$$1;
@@ -329,6 +329,6 @@ function upgradeGPLs(value) {
   }
 }
 export {
-  spdxCorrect as default
+  spdxCorrect as s
 };
 //# sourceMappingURL=index.js.map

package/dist/_node_modules/spdx-expression-parse/index.cjs

@@ -1,10 +1,11 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const scan$1 = require("./scan.cjs");
 const parse$1 = require("./parse.cjs");
-var scan = scan$1;
-var parse = parse$1;
+var scan = scan$1.scan;
+var parse = parse$1.parse;
 var spdxExpressionParse = function(source) {
   return parse(scan(source));
 };
-module.exports = spdxExpressionParse;
+exports.spdxExpressionParse = spdxExpressionParse;
 //# sourceMappingURL=index.cjs.map

package/dist/_node_modules/spdx-expression-parse/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/spdx-expression-parse/index.js"],"sourcesContent":["'use strict'\n\nvar scan = require('./scan')\nvar parse = require('./parse')\n\nmodule.exports = function (source) {\n  return parse(scan(source))\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;AAEA,IAAI,OAAOA;AACX,IAAI,QAAQC;IAEZ,sBAAiB,SAAU,QAAQ;AACjC,SAAO,MAAM,KAAK,MAAM,CAAC;AAC3B;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/spdx-expression-parse/index.js"],"sourcesContent":["'use strict'\n\nvar scan = require('./scan')\nvar parse = require('./parse')\n\nmodule.exports = function (source) {\n  return parse(scan(source))\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;;AAEA,IAAI,OAAOA,OAAiB;AAC5B,IAAI,QAAQC,QAAkB;IAE9B,sBAAiB,SAAU,QAAQ;AACjC,SAAO,MAAM,KAAK,MAAM,CAAC;AAC3B;;","x_google_ignoreList":[0]}

package/dist/_node_modules/spdx-expression-parse/index.js

@@ -1,11 +1,11 @@
-import scan$1 from "./scan.js";
-import parse$1 from "./parse.js";
+import { s as scan$1 } from "./scan.js";
+import { p as parse$1 } from "./parse.js";
 var scan = scan$1;
 var parse = parse$1;
 var spdxExpressionParse = function(source) {
   return parse(scan(source));
 };
 export {
-  spdxExpressionParse as default
+  spdxExpressionParse as s
 };
 //# sourceMappingURL=index.js.map

package/dist/_node_modules/spdx-expression-parse/parse.cjs

@@ -1,4 +1,5 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 var parse = function(tokens) {
   var index = 0;
   function hasMore() {
@@ -106,5 +107,5 @@ var parse = function(tokens) {
   }
   return node;
 };
-module.exports = parse;
+exports.parse = parse;
 //# sourceMappingURL=parse.cjs.map

package/dist/_node_modules/spdx-expression-parse/parse.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"parse.cjs","sources":["../../../../../node_modules/spdx-expression-parse/parse.js"],"sourcesContent":["'use strict'\n\n// The ABNF grammar in the spec is totally ambiguous.\n//\n// This parser follows the operator precedence defined in the\n// `Order of Precedence and Parentheses` section.\n\nmodule.exports = function (tokens) {\n  var index = 0\n\n  function hasMore () {\n    return index < tokens.length\n  }\n\n  function token () {\n    return hasMore() ? tokens[index] : null\n  }\n\n  function next () {\n    if (!hasMore()) {\n      throw new Error()\n    }\n    index++\n  }\n\n  function parseOperator (operator) {\n    var t = token()\n    if (t && t.type === 'OPERATOR' && operator === t.string) {\n      next()\n      return t.string\n    }\n  }\n\n  function parseWith () {\n    if (parseOperator('WITH')) {\n      var t = token()\n      if (t && t.type === 'EXCEPTION') {\n        next()\n        return t.string\n      }\n      throw new Error('Expected exception after `WITH`')\n    }\n  }\n\n  function parseLicenseRef () {\n    // TODO: Actually, everything is concatenated into one string\n    // for backward-compatibility but it could be better to return\n    // a nice structure.\n    var begin = index\n    var string = ''\n    var t = token()\n    if (t.type === 'DOCUMENTREF') {\n      next()\n      string += 'DocumentRef-' + t.string + ':'\n      if (!parseOperator(':')) {\n        throw new Error('Expected `:` after `DocumentRef-...`')\n      }\n    }\n    t = token()\n    if (t.type === 'LICENSEREF') {\n      next()\n      string += 'LicenseRef-' + t.string\n      return { license: string }\n    }\n    index = begin\n  }\n\n  function parseLicense () {\n    var t = token()\n    if (t && t.type === 'LICENSE') {\n      next()\n      var node = { license: t.string }\n      if (parseOperator('+')) {\n        node.plus = true\n      }\n      var exception = parseWith()\n      if (exception) {\n        node.exception = exception\n      }\n      return node\n    }\n  }\n\n  function parseParenthesizedExpression () {\n    var left = parseOperator('(')\n    if (!left) {\n      return\n    }\n\n    var expr = parseExpression()\n\n    if (!parseOperator(')')) {\n      throw new Error('Expected `)`')\n    }\n\n    return expr\n  }\n\n  function parseAtom () {\n    return (\n      parseParenthesizedExpression() ||\n      parseLicenseRef() ||\n      parseLicense()\n    )\n  }\n\n  function makeBinaryOpParser (operator, nextParser) {\n    return function parseBinaryOp () {\n      var left = nextParser()\n      if (!left) {\n        return\n      }\n\n      if (!parseOperator(operator)) {\n        return left\n      }\n\n      var right = parseBinaryOp()\n      if (!right) {\n        throw new Error('Expected expression')\n      }\n      return {\n        left: left,\n        conjunction: operator.toLowerCase(),\n        right: right\n      }\n    }\n  }\n\n  var parseAnd = makeBinaryOpParser('AND', parseAtom)\n  var parseExpression = makeBinaryOpParser('OR', parseAnd)\n\n  var node = parseExpression()\n  if (!node || hasMore()) {\n    throw new Error('Syntax error')\n  }\n  return node\n}\n"],"names":["node"],"mappings":";IAOA,QAAiB,SAAU,QAAQ;AACjC,MAAI,QAAQ;AAEZ,WAAS,UAAW;AAClB,WAAO,QAAQ,OAAO;AAAA,EACvB;AAED,WAAS,QAAS;AAChB,WAAO,QAAS,IAAG,OAAO,KAAK,IAAI;AAAA,EACpC;AAED,WAAS,OAAQ;AACf,QAAI,CAAC,QAAO,GAAI;AACd,YAAM,IAAI,MAAO;AAAA,IAClB;AACD;AAAA,EACD;AAED,WAAS,cAAe,UAAU;AAChC,QAAI,IAAI,MAAO;AACf,QAAI,KAAK,EAAE,SAAS,cAAc,aAAa,EAAE,QAAQ;AACvD,WAAM;AACN,aAAO,EAAE;AAAA,IACV;AAAA,EACF;AAED,WAAS,YAAa;AACpB,QAAI,cAAc,MAAM,GAAG;AACzB,UAAI,IAAI,MAAO;AACf,UAAI,KAAK,EAAE,SAAS,aAAa;AAC/B,aAAM;AACN,eAAO,EAAE;AAAA,MACV;AACD,YAAM,IAAI,MAAM,iCAAiC;AAAA,IAClD;AAAA,EACF;AAED,WAAS,kBAAmB;AAI1B,QAAI,QAAQ;AACZ,QAAI,SAAS;AACb,QAAI,IAAI,MAAO;AACf,QAAI,EAAE,SAAS,eAAe;AAC5B,WAAM;AACN,gBAAU,iBAAiB,EAAE,SAAS;AACtC,UAAI,CAAC,cAAc,GAAG,GAAG;AACvB,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACvD;AAAA,IACF;AACD,QAAI,MAAO;AACX,QAAI,EAAE,SAAS,cAAc;AAC3B,WAAM;AACN,gBAAU,gBAAgB,EAAE;AAC5B,aAAO,EAAE,SAAS,OAAQ;AAAA,IAC3B;AACD,YAAQ;AAAA,EACT;AAED,WAAS,eAAgB;AACvB,QAAI,IAAI,MAAO;AACf,QAAI,KAAK,EAAE,SAAS,WAAW;AAC7B,WAAM;AACN,UAAIA,QAAO,EAAE,SAAS,EAAE,OAAQ;AAChC,UAAI,cAAc,GAAG,GAAG;AACtB,QAAAA,MAAK,OAAO;AAAA,MACb;AACD,UAAI,YAAY,UAAW;AAC3B,UAAI,WAAW;AACb,QAAAA,MAAK,YAAY;AAAA,MAClB;AACD,aAAOA;AAAA,IACR;AAAA,EACF;AAED,WAAS,+BAAgC;AACvC,QAAI,OAAO,cAAc,GAAG;AAC5B,QAAI,CAAC,MAAM;AACT;AAAA,IACD;AAED,QAAI,OAAO,gBAAiB;AAE5B,QAAI,CAAC,cAAc,GAAG,GAAG;AACvB,YAAM,IAAI,MAAM,cAAc;AAAA,IAC/B;AAED,WAAO;AAAA,EACR;AAED,WAAS,YAAa;AACpB,WACE,6BAA8B,KAC9B,gBAAiB,KACjB,aAAc;AAAA,EAEjB;AAED,WAAS,mBAAoB,UAAU,YAAY;AACjD,WAAO,SAAS,gBAAiB;AAC/B,UAAI,OAAO,WAAY;AACvB,UAAI,CAAC,MAAM;AACT;AAAA,MACD;AAED,UAAI,CAAC,cAAc,QAAQ,GAAG;AAC5B,eAAO;AAAA,MACR;AAED,UAAI,QAAQ,cAAe;AAC3B,UAAI,CAAC,OAAO;AACV,cAAM,IAAI,MAAM,qBAAqB;AAAA,MACtC;AACD,aAAO;AAAA,QACL;AAAA,QACA,aAAa,SAAS,YAAa;AAAA,QACnC;AAAA,MACD;AAAA,IACF;AAAA,EACF;AAED,MAAI,WAAW,mBAAmB,OAAO,SAAS;AAClD,MAAI,kBAAkB,mBAAmB,MAAM,QAAQ;AAEvD,MAAI,OAAO,gBAAiB;AAC5B,MAAI,CAAC,QAAQ,WAAW;AACtB,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"parse.cjs","sources":["../../../../../node_modules/spdx-expression-parse/parse.js"],"sourcesContent":["'use strict'\n\n// The ABNF grammar in the spec is totally ambiguous.\n//\n// This parser follows the operator precedence defined in the\n// `Order of Precedence and Parentheses` section.\n\nmodule.exports = function (tokens) {\n  var index = 0\n\n  function hasMore () {\n    return index < tokens.length\n  }\n\n  function token () {\n    return hasMore() ? tokens[index] : null\n  }\n\n  function next () {\n    if (!hasMore()) {\n      throw new Error()\n    }\n    index++\n  }\n\n  function parseOperator (operator) {\n    var t = token()\n    if (t && t.type === 'OPERATOR' && operator === t.string) {\n      next()\n      return t.string\n    }\n  }\n\n  function parseWith () {\n    if (parseOperator('WITH')) {\n      var t = token()\n      if (t && t.type === 'EXCEPTION') {\n        next()\n        return t.string\n      }\n      throw new Error('Expected exception after `WITH`')\n    }\n  }\n\n  function parseLicenseRef () {\n    // TODO: Actually, everything is concatenated into one string\n    // for backward-compatibility but it could be better to return\n    // a nice structure.\n    var begin = index\n    var string = ''\n    var t = token()\n    if (t.type === 'DOCUMENTREF') {\n      next()\n      string += 'DocumentRef-' + t.string + ':'\n      if (!parseOperator(':')) {\n        throw new Error('Expected `:` after `DocumentRef-...`')\n      }\n    }\n    t = token()\n    if (t.type === 'LICENSEREF') {\n      next()\n      string += 'LicenseRef-' + t.string\n      return { license: string }\n    }\n    index = begin\n  }\n\n  function parseLicense () {\n    var t = token()\n    if (t && t.type === 'LICENSE') {\n      next()\n      var node = { license: t.string }\n      if (parseOperator('+')) {\n        node.plus = true\n      }\n      var exception = parseWith()\n      if (exception) {\n        node.exception = exception\n      }\n      return node\n    }\n  }\n\n  function parseParenthesizedExpression () {\n    var left = parseOperator('(')\n    if (!left) {\n      return\n    }\n\n    var expr = parseExpression()\n\n    if (!parseOperator(')')) {\n      throw new Error('Expected `)`')\n    }\n\n    return expr\n  }\n\n  function parseAtom () {\n    return (\n      parseParenthesizedExpression() ||\n      parseLicenseRef() ||\n      parseLicense()\n    )\n  }\n\n  function makeBinaryOpParser (operator, nextParser) {\n    return function parseBinaryOp () {\n      var left = nextParser()\n      if (!left) {\n        return\n      }\n\n      if (!parseOperator(operator)) {\n        return left\n      }\n\n      var right = parseBinaryOp()\n      if (!right) {\n        throw new Error('Expected expression')\n      }\n      return {\n        left: left,\n        conjunction: operator.toLowerCase(),\n        right: right\n      }\n    }\n  }\n\n  var parseAnd = makeBinaryOpParser('AND', parseAtom)\n  var parseExpression = makeBinaryOpParser('OR', parseAnd)\n\n  var node = parseExpression()\n  if (!node || hasMore()) {\n    throw new Error('Syntax error')\n  }\n  return node\n}\n"],"names":["node"],"mappings":";;IAOA,QAAiB,SAAU,QAAQ;AACjC,MAAI,QAAQ;AAEZ,WAAS,UAAW;AAClB,WAAO,QAAQ,OAAO;AAAA,EACvB;AAED,WAAS,QAAS;AAChB,WAAO,QAAS,IAAG,OAAO,KAAK,IAAI;AAAA,EACpC;AAED,WAAS,OAAQ;AACf,QAAI,CAAC,QAAO,GAAI;AACd,YAAM,IAAI,MAAO;AAAA,IAClB;AACD;AAAA,EACD;AAED,WAAS,cAAe,UAAU;AAChC,QAAI,IAAI,MAAO;AACf,QAAI,KAAK,EAAE,SAAS,cAAc,aAAa,EAAE,QAAQ;AACvD,WAAM;AACN,aAAO,EAAE;AAAA,IACV;AAAA,EACF;AAED,WAAS,YAAa;AACpB,QAAI,cAAc,MAAM,GAAG;AACzB,UAAI,IAAI,MAAO;AACf,UAAI,KAAK,EAAE,SAAS,aAAa;AAC/B,aAAM;AACN,eAAO,EAAE;AAAA,MACV;AACD,YAAM,IAAI,MAAM,iCAAiC;AAAA,IAClD;AAAA,EACF;AAED,WAAS,kBAAmB;AAI1B,QAAI,QAAQ;AACZ,QAAI,SAAS;AACb,QAAI,IAAI,MAAO;AACf,QAAI,EAAE,SAAS,eAAe;AAC5B,WAAM;AACN,gBAAU,iBAAiB,EAAE,SAAS;AACtC,UAAI,CAAC,cAAc,GAAG,GAAG;AACvB,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACvD;AAAA,IACF;AACD,QAAI,MAAO;AACX,QAAI,EAAE,SAAS,cAAc;AAC3B,WAAM;AACN,gBAAU,gBAAgB,EAAE;AAC5B,aAAO,EAAE,SAAS,OAAQ;AAAA,IAC3B;AACD,YAAQ;AAAA,EACT;AAED,WAAS,eAAgB;AACvB,QAAI,IAAI,MAAO;AACf,QAAI,KAAK,EAAE,SAAS,WAAW;AAC7B,WAAM;AACN,UAAIA,QAAO,EAAE,SAAS,EAAE,OAAQ;AAChC,UAAI,cAAc,GAAG,GAAG;AACtB,QAAAA,MAAK,OAAO;AAAA,MACb;AACD,UAAI,YAAY,UAAW;AAC3B,UAAI,WAAW;AACb,QAAAA,MAAK,YAAY;AAAA,MAClB;AACD,aAAOA;AAAA,IACR;AAAA,EACF;AAED,WAAS,+BAAgC;AACvC,QAAI,OAAO,cAAc,GAAG;AAC5B,QAAI,CAAC,MAAM;AACT;AAAA,IACD;AAED,QAAI,OAAO,gBAAiB;AAE5B,QAAI,CAAC,cAAc,GAAG,GAAG;AACvB,YAAM,IAAI,MAAM,cAAc;AAAA,IAC/B;AAED,WAAO;AAAA,EACR;AAED,WAAS,YAAa;AACpB,WACE,6BAA8B,KAC9B,gBAAiB,KACjB,aAAc;AAAA,EAEjB;AAED,WAAS,mBAAoB,UAAU,YAAY;AACjD,WAAO,SAAS,gBAAiB;AAC/B,UAAI,OAAO,WAAY;AACvB,UAAI,CAAC,MAAM;AACT;AAAA,MACD;AAED,UAAI,CAAC,cAAc,QAAQ,GAAG;AAC5B,eAAO;AAAA,MACR;AAED,UAAI,QAAQ,cAAe;AAC3B,UAAI,CAAC,OAAO;AACV,cAAM,IAAI,MAAM,qBAAqB;AAAA,MACtC;AACD,aAAO;AAAA,QACL;AAAA,QACA,aAAa,SAAS,YAAa;AAAA,QACnC;AAAA,MACD;AAAA,IACF;AAAA,EACF;AAED,MAAI,WAAW,mBAAmB,OAAO,SAAS;AAClD,MAAI,kBAAkB,mBAAmB,MAAM,QAAQ;AAEvD,MAAI,OAAO,gBAAiB;AAC5B,MAAI,CAAC,QAAQ,WAAW;AACtB,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/_node_modules/spdx-expression-parse/parse.js

@@ -106,6 +106,6 @@ var parse = function(tokens) {
   return node;
 };
 export {
-  parse as default
+  parse as p
 };
 //# sourceMappingURL=parse.js.map

package/dist/_node_modules/spdx-expression-parse/scan.cjs

@@ -1,4 +1,5 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const index = require("../spdx-license-ids/index.json.cjs");
 const deprecated = require("../spdx-license-ids/deprecated.json.cjs");
 const index$1 = require("../spdx-exceptions/index.json.cjs");
@@ -99,5 +100,5 @@ var scan = function(source) {
   }
   return tokens;
 };
-module.exports = scan;
+exports.scan = scan;
 //# sourceMappingURL=scan.cjs.map

package/dist/_node_modules/spdx-expression-parse/scan.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"scan.cjs","sources":["../../../../../node_modules/spdx-expression-parse/scan.js"],"sourcesContent":["'use strict'\n\nvar licenses = []\n  .concat(require('spdx-license-ids'))\n  .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n  var index = 0\n\n  function hasMore () {\n    return index < source.length\n  }\n\n  // `value` can be a regexp or a string.\n  // If it is recognized, the matching source string is returned and\n  // the index is incremented. Otherwise `undefined` is returned.\n  function read (value) {\n    if (value instanceof RegExp) {\n      var chars = source.slice(index)\n      var match = chars.match(value)\n      if (match) {\n        index += match[0].length\n        return match[0]\n      }\n    } else {\n      if (source.indexOf(value, index) === index) {\n        index += value.length\n        return value\n      }\n    }\n  }\n\n  function skipWhitespace () {\n    read(/[ ]*/)\n  }\n\n  function operator () {\n    var string\n    var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n    for (var i = 0; i < possibilities.length; i++) {\n      string = read(possibilities[i])\n      if (string) {\n        break\n      }\n    }\n\n    if (string === '+' && index > 1 && source[index - 2] === ' ') {\n      throw new Error('Space before `+`')\n    }\n\n    return string && {\n      type: 'OPERATOR',\n      string: string\n    }\n  }\n\n  function idstring () {\n    return read(/[A-Za-z0-9-.]+/)\n  }\n\n  function expectIdstring () {\n    var string = idstring()\n    if (!string) {\n      throw new Error('Expected idstring at offset ' + index)\n    }\n    return string\n  }\n\n  function documentRef () {\n    if (read('DocumentRef-')) {\n      var string = expectIdstring()\n      return { type: 'DOCUMENTREF', string: string }\n    }\n  }\n\n  function licenseRef () {\n    if (read('LicenseRef-')) {\n      var string = expectIdstring()\n      return { type: 'LICENSEREF', string: string }\n    }\n  }\n\n  function identifier () {\n    var begin = index\n    var string = idstring()\n\n    if (licenses.indexOf(string) !== -1) {\n      return {\n        type: 'LICENSE',\n        string: string\n      }\n    } else if (exceptions.indexOf(string) !== -1) {\n      return {\n        type: 'EXCEPTION',\n        string: string\n      }\n    }\n\n    index = begin\n  }\n\n  // Tries to read the next token. Returns `undefined` if no token is\n  // recognized.\n  function parseToken () {\n    // Ordering matters\n    return (\n      operator() ||\n      documentRef() ||\n      licenseRef() ||\n      identifier()\n    )\n  }\n\n  var tokens = []\n  while (hasMore()) {\n    skipWhitespace()\n    if (!hasMore()) {\n      break\n    }\n\n    var token = parseToken()\n    if (!token) {\n      throw new Error('Unexpected `' + source[index] +\n                      '` at offset ' + index)\n    }\n\n    tokens.push(token)\n  }\n  return tokens\n}\n"],"names":["require$$0","require$$1","require$$2","index"],"mappings":";;;;AAEA,IAAI,WAAW,CAAE,EACd,OAAOA,KAA2B,EAClC,OAAOC,UAAsC;AAChD,IAAI,aAAaC;IAEjB,OAAiB,SAAU,QAAQ;AACjC,MAAIC,SAAQ;AAEZ,WAAS,UAAW;AAClB,WAAOA,SAAQ,OAAO;AAAA,EACvB;AAKD,WAAS,KAAM,OAAO;AACpB,QAAI,iBAAiB,QAAQ;AAC3B,UAAI,QAAQ,OAAO,MAAMA,MAAK;AAC9B,UAAI,QAAQ,MAAM,MAAM,KAAK;AAC7B,UAAI,OAAO;AACT,QAAAA,UAAS,MAAM,CAAC,EAAE;AAClB,eAAO,MAAM,CAAC;AAAA,MACf;AAAA,IACP,OAAW;AACL,UAAI,OAAO,QAAQ,OAAOA,MAAK,MAAMA,QAAO;AAC1C,QAAAA,UAAS,MAAM;AACf,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAED,WAAS,iBAAkB;AACzB,SAAK,MAAM;AAAA,EACZ;AAED,WAAS,WAAY;AACnB,QAAI;AACJ,QAAI,gBAAgB,CAAC,QAAQ,OAAO,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5D,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,eAAS,KAAK,cAAc,CAAC,CAAC;AAC9B,UAAI,QAAQ;AACV;AAAA,MACD;AAAA,IACF;AAED,QAAI,WAAW,OAAOA,SAAQ,KAAK,OAAOA,SAAQ,CAAC,MAAM,KAAK;AAC5D,YAAM,IAAI,MAAM,kBAAkB;AAAA,IACnC;AAED,WAAO,UAAU;AAAA,MACf,MAAM;AAAA,MACN;AAAA,IACD;AAAA,EACF;AAED,WAAS,WAAY;AACnB,WAAO,KAAK,gBAAgB;AAAA,EAC7B;AAED,WAAS,iBAAkB;AACzB,QAAI,SAAS,SAAU;AACvB,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,iCAAiCA,MAAK;AAAA,IACvD;AACD,WAAO;AAAA,EACR;AAED,WAAS,cAAe;AACtB,QAAI,KAAK,cAAc,GAAG;AACxB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,eAAe,OAAgB;AAAA,IAC/C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,KAAK,aAAa,GAAG;AACvB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,cAAc,OAAgB;AAAA,IAC9C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,QAAQA;AACZ,QAAI,SAAS,SAAU;AAEvB,QAAI,SAAS,QAAQ,MAAM,MAAM,IAAI;AACnC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF,WAAU,WAAW,QAAQ,MAAM,MAAM,IAAI;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF;AAED,IAAAA,SAAQ;AAAA,EACT;AAID,WAAS,aAAc;AAErB,WACE,SAAU,KACV,YAAa,KACb,WAAY,KACZ,WAAY;AAAA,EAEf;AAED,MAAI,SAAS,CAAE;AACf,SAAO,QAAO,GAAI;AAChB,mBAAgB;AAChB,QAAI,CAAC,QAAO,GAAI;AACd;AAAA,IACD;AAED,QAAI,QAAQ,WAAY;AACxB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,iBAAiB,OAAOA,MAAK,IAC7B,iBAAiBA,MAAK;AAAA,IACvC;AAED,WAAO,KAAK,KAAK;AAAA,EAClB;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"scan.cjs","sources":["../../../../../node_modules/spdx-expression-parse/scan.js"],"sourcesContent":["'use strict'\n\nvar licenses = []\n  .concat(require('spdx-license-ids'))\n  .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n  var index = 0\n\n  function hasMore () {\n    return index < source.length\n  }\n\n  // `value` can be a regexp or a string.\n  // If it is recognized, the matching source string is returned and\n  // the index is incremented. Otherwise `undefined` is returned.\n  function read (value) {\n    if (value instanceof RegExp) {\n      var chars = source.slice(index)\n      var match = chars.match(value)\n      if (match) {\n        index += match[0].length\n        return match[0]\n      }\n    } else {\n      if (source.indexOf(value, index) === index) {\n        index += value.length\n        return value\n      }\n    }\n  }\n\n  function skipWhitespace () {\n    read(/[ ]*/)\n  }\n\n  function operator () {\n    var string\n    var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n    for (var i = 0; i < possibilities.length; i++) {\n      string = read(possibilities[i])\n      if (string) {\n        break\n      }\n    }\n\n    if (string === '+' && index > 1 && source[index - 2] === ' ') {\n      throw new Error('Space before `+`')\n    }\n\n    return string && {\n      type: 'OPERATOR',\n      string: string\n    }\n  }\n\n  function idstring () {\n    return read(/[A-Za-z0-9-.]+/)\n  }\n\n  function expectIdstring () {\n    var string = idstring()\n    if (!string) {\n      throw new Error('Expected idstring at offset ' + index)\n    }\n    return string\n  }\n\n  function documentRef () {\n    if (read('DocumentRef-')) {\n      var string = expectIdstring()\n      return { type: 'DOCUMENTREF', string: string }\n    }\n  }\n\n  function licenseRef () {\n    if (read('LicenseRef-')) {\n      var string = expectIdstring()\n      return { type: 'LICENSEREF', string: string }\n    }\n  }\n\n  function identifier () {\n    var begin = index\n    var string = idstring()\n\n    if (licenses.indexOf(string) !== -1) {\n      return {\n        type: 'LICENSE',\n        string: string\n      }\n    } else if (exceptions.indexOf(string) !== -1) {\n      return {\n        type: 'EXCEPTION',\n        string: string\n      }\n    }\n\n    index = begin\n  }\n\n  // Tries to read the next token. Returns `undefined` if no token is\n  // recognized.\n  function parseToken () {\n    // Ordering matters\n    return (\n      operator() ||\n      documentRef() ||\n      licenseRef() ||\n      identifier()\n    )\n  }\n\n  var tokens = []\n  while (hasMore()) {\n    skipWhitespace()\n    if (!hasMore()) {\n      break\n    }\n\n    var token = parseToken()\n    if (!token) {\n      throw new Error('Unexpected `' + source[index] +\n                      '` at offset ' + index)\n    }\n\n    tokens.push(token)\n  }\n  return tokens\n}\n"],"names":["require$$0","require$$1","require$$2","index"],"mappings":";;;;;AAEA,IAAI,WAAW,CAAE,EACd,OAAOA,KAA2B,EAClC,OAAOC,UAAsC;AAChD,IAAI,aAAaC;IAEjB,OAAiB,SAAU,QAAQ;AACjC,MAAIC,SAAQ;AAEZ,WAAS,UAAW;AAClB,WAAOA,SAAQ,OAAO;AAAA,EACvB;AAKD,WAAS,KAAM,OAAO;AACpB,QAAI,iBAAiB,QAAQ;AAC3B,UAAI,QAAQ,OAAO,MAAMA,MAAK;AAC9B,UAAI,QAAQ,MAAM,MAAM,KAAK;AAC7B,UAAI,OAAO;AACT,QAAAA,UAAS,MAAM,CAAC,EAAE;AAClB,eAAO,MAAM,CAAC;AAAA,MACf;AAAA,IACP,OAAW;AACL,UAAI,OAAO,QAAQ,OAAOA,MAAK,MAAMA,QAAO;AAC1C,QAAAA,UAAS,MAAM;AACf,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAED,WAAS,iBAAkB;AACzB,SAAK,MAAM;AAAA,EACZ;AAED,WAAS,WAAY;AACnB,QAAI;AACJ,QAAI,gBAAgB,CAAC,QAAQ,OAAO,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5D,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,eAAS,KAAK,cAAc,CAAC,CAAC;AAC9B,UAAI,QAAQ;AACV;AAAA,MACD;AAAA,IACF;AAED,QAAI,WAAW,OAAOA,SAAQ,KAAK,OAAOA,SAAQ,CAAC,MAAM,KAAK;AAC5D,YAAM,IAAI,MAAM,kBAAkB;AAAA,IACnC;AAED,WAAO,UAAU;AAAA,MACf,MAAM;AAAA,MACN;AAAA,IACD;AAAA,EACF;AAED,WAAS,WAAY;AACnB,WAAO,KAAK,gBAAgB;AAAA,EAC7B;AAED,WAAS,iBAAkB;AACzB,QAAI,SAAS,SAAU;AACvB,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,iCAAiCA,MAAK;AAAA,IACvD;AACD,WAAO;AAAA,EACR;AAED,WAAS,cAAe;AACtB,QAAI,KAAK,cAAc,GAAG;AACxB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,eAAe,OAAgB;AAAA,IAC/C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,KAAK,aAAa,GAAG;AACvB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,cAAc,OAAgB;AAAA,IAC9C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,QAAQA;AACZ,QAAI,SAAS,SAAU;AAEvB,QAAI,SAAS,QAAQ,MAAM,MAAM,IAAI;AACnC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF,WAAU,WAAW,QAAQ,MAAM,MAAM,IAAI;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF;AAED,IAAAA,SAAQ;AAAA,EACT;AAID,WAAS,aAAc;AAErB,WACE,SAAU,KACV,YAAa,KACb,WAAY,KACZ,WAAY;AAAA,EAEf;AAED,MAAI,SAAS,CAAE;AACf,SAAO,QAAO,GAAI;AAChB,mBAAgB;AAChB,QAAI,CAAC,QAAO,GAAI;AACd;AAAA,IACD;AAED,QAAI,QAAQ,WAAY;AACxB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,iBAAiB,OAAOA,MAAK,IAC7B,iBAAiBA,MAAK;AAAA,IACvC;AAED,WAAO,KAAK,KAAK;AAAA,EAClB;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/_node_modules/spdx-expression-parse/scan.js

@@ -99,6 +99,6 @@ var scan = function(source) {
   return tokens;
 };
 export {
-  scan as default
+  scan as s
 };
 //# sourceMappingURL=scan.js.map

package/dist/_node_modules/{is-number → to-regex-range/_node_modules/is-number}/index.cjs

@@ -1,4 +1,5 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 /*!
  * is-number <https://github.com/jonschlinkert/is-number>
  *
@@ -14,5 +15,5 @@ var isNumber = function(num) {
   }
   return false;
 };
-module.exports = isNumber;
+exports.isNumber = isNumber;
 //# sourceMappingURL=index.cjs.map

package/dist/_node_modules/to-regex-range/_node_modules/is-number/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/to-regex-range/node_modules/is-number/index.js"],"sourcesContent":["/*!\n * is-number <https://github.com/jonschlinkert/is-number>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nmodule.exports = function(num) {\n  if (typeof num === 'number') {\n    return num - num === 0;\n  }\n  if (typeof num === 'string' && num.trim() !== '') {\n    return Number.isFinite ? Number.isFinite(+num) : isFinite(+num);\n  }\n  return false;\n};\n"],"names":[],"mappings":";;;;;;;;IASA,WAAiB,SAAS,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,MAAM,QAAQ;AAAA,EACtB;AACD,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAI,MAAO,IAAI;AAChD,WAAO,OAAO,WAAW,OAAO,SAAS,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AAAA,EAC/D;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/_node_modules/{is-number → to-regex-range/_node_modules/is-number}/index.js

@@ -14,6 +14,6 @@ var isNumber = function(num) {
   return false;
 };
 export {
-  isNumber as default
+  isNumber as i
 };
 //# sourceMappingURL=index.js.map

package/dist/_node_modules/to-regex-range/_node_modules/is-number/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/to-regex-range/node_modules/is-number/index.js"],"sourcesContent":["/*!\n * is-number <https://github.com/jonschlinkert/is-number>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nmodule.exports = function(num) {\n  if (typeof num === 'number') {\n    return num - num === 0;\n  }\n  if (typeof num === 'string' && num.trim() !== '') {\n    return Number.isFinite ? Number.isFinite(+num) : isFinite(+num);\n  }\n  return false;\n};\n"],"names":[],"mappings":";;;;;;IASA,WAAiB,SAAS,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,MAAM,QAAQ;AAAA,EACtB;AACD,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAI,MAAO,IAAI;AAChD,WAAO,OAAO,WAAW,OAAO,SAAS,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AAAA,EAC/D;AACD,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/_node_modules/to-regex-range/index.cjs

@@ -1,12 +1,13 @@
 "use strict";
-const index = require("../is-number/index.cjs");
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const index = require('./_node_modules/is-number/index.cjs');
 /*!
  * to-regex-range <https://github.com/micromatch/to-regex-range>
  *
  * Copyright (c) 2015-present, Jon Schlinkert.
  * Released under the MIT License.
  */
-const isNumber = index;
+const isNumber = index.isNumber;
 const toRegexRange = (min, max, options) => {
   if (isNumber(min) === false) {
     throw new TypeError("toRegexRange: expected the first argument to be a number");
@@ -211,5 +212,5 @@ function padZeros(value, tok, options) {
 toRegexRange.cache = {};
 toRegexRange.clearCache = () => toRegexRange.cache = {};
 var toRegexRange_1 = toRegexRange;
-module.exports = toRegexRange_1;
+exports.toRegexRange_1 = toRegexRange_1;
 //# sourceMappingURL=index.cjs.map

package/dist/_node_modules/to-regex-range/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","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;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","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,MAAAA;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;;","x_google_ignoreList":[0]}

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

@@ -1,4 +1,4 @@
-import isNumber$1 from "../is-number/index.js";
+import { i as isNumber$1 } from './_node_modules/is-number/index.js';
 /*!
  * to-regex-range <https://github.com/micromatch/to-regex-range>
  *
@@ -211,6 +211,6 @@ toRegexRange.cache = {};
 toRegexRange.clearCache = () => toRegexRange.cache = {};
 var toRegexRange_1 = toRegexRange;
 export {
-  toRegexRange_1 as default
+  toRegexRange_1 as t
 };
 //# sourceMappingURL=index.js.map

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

@@ -1,8 +1,9 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const index = require("../spdx-expression-parse/index.cjs");
 const index$1 = require("../spdx-correct/index.cjs");
-var parse = index;
-var correct = index$1;
+var parse = index.spdxExpressionParse;
+var correct = index$1.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) {
@@ -66,5 +67,5 @@ var validateNpmPackageLicense = function(argument) {
     };
   }
 };
-module.exports = validateNpmPackageLicense;
+exports.validateNpmPackageLicense = validateNpmPackageLicense;
 //# sourceMappingURL=index.cjs.map

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

@@ -1 +1 @@
-{"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;;","x_google_ignoreList":[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,MAAAA;AACZ,IAAI,UAAUC,QAAAA;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;;","x_google_ignoreList":[0]}

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

@@ -1,5 +1,5 @@
-import spdxExpressionParse from "../spdx-expression-parse/index.js";
-import spdxCorrect from "../spdx-correct/index.js";
+import { s as spdxExpressionParse } from "../spdx-expression-parse/index.js";
+import { s as 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>"';
@@ -66,6 +66,6 @@ var validateNpmPackageLicense = function(argument) {
   }
 };
 export {
-  validateNpmPackageLicense as default
+  validateNpmPackageLicense as v
 };
 //# sourceMappingURL=index.js.map

package/dist/_node_modules/yallist/iterator.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.cjs","sources":["../../../../../node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;;;AACc,aAAG,SAAU,SAAS;AAClC,YAAQ,UAAU,OAAO,QAAQ,IAAI,aAAa;AAChD,eAAS,SAAS,KAAK,MAAM,QAAQ,SAAS,OAAO,MAAM;AACzD,cAAM,OAAO;AAAA,MACd;AAAA,IACF;AAAA,EACH;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/yallist/iterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.js","sources":["../../../../../node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;AACc,aAAG,SAAU,SAAS;AAClC,YAAQ,UAAU,OAAO,QAAQ,IAAI,aAAa;AAChD,eAAS,SAAS,KAAK,MAAM,QAAQ,SAAS,OAAO,MAAM;AACzD,cAAM,OAAO;AAAA,MACd;AAAA,IACF;AAAA,EACH;;;","x_google_ignoreList":[0]}