ember-repl 6.0.0 → 7.0.0

package/dist/index-DxolpiGq.js

@@ -0,0 +1,3336 @@
+import { a as getAugmentedNamespace, g as getDefaultExportFromCjs } from './_commonjsHelpers-BAGoDD49.js';
+
+function _mergeNamespaces(n, m) {
+  m.forEach(function (e) {
+    e && typeof e !== 'string' && !Array.isArray(e) && Object.keys(e).forEach(function (k) {
+      if (k !== 'default' && !(k in n)) {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  });
+  return Object.freeze(n);
+}
+
+var src$1 = {};
+
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// Permission is hereby granted, free of charge, to any person obtaining a
+// copy of this software and associated documentation files (the
+// "Software"), to deal in the Software without restriction, including
+// without limitation the rights to use, copy, modify, merge, publish,
+// distribute, sublicense, and/or sell copies of the Software, and to permit
+// persons to whom the Software is furnished to do so, subject to the
+// following conditions:
+//
+// The above copyright notice and this permission notice shall be included
+// in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+// USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+// resolves . and .. elements in a path array with directory names there
+// must be no slashes, empty elements, or device names (c:\) in the array
+// (so also no leading and trailing slashes - it does not distinguish
+// relative and absolute paths)
+function normalizeArray(parts, allowAboveRoot) {
+  // if the path tries to go above the root, `up` ends up > 0
+  var up = 0;
+  for (var i = parts.length - 1; i >= 0; i--) {
+    var last = parts[i];
+    if (last === '.') {
+      parts.splice(i, 1);
+    } else if (last === '..') {
+      parts.splice(i, 1);
+      up++;
+    } else if (up) {
+      parts.splice(i, 1);
+      up--;
+    }
+  }
+
+  // if the path is allowed to go above the root, restore leading ..s
+  if (allowAboveRoot) {
+    for (; up--; up) {
+      parts.unshift('..');
+    }
+  }
+  return parts;
+}
+
+// Split a filename into [root, dir, basename, ext], unix version
+// 'root' is just a slash, or nothing.
+var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+var splitPath = function (filename) {
+  return splitPathRe.exec(filename).slice(1);
+};
+
+// path.resolve([from ...], to)
+// posix version
+function resolve() {
+  var resolvedPath = '',
+    resolvedAbsolute = false;
+  for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+    var path = i >= 0 ? arguments[i] : '/';
+
+    // Skip empty and invalid entries
+    if (typeof path !== 'string') {
+      throw new TypeError('Arguments to path.resolve must be strings');
+    } else if (!path) {
+      continue;
+    }
+    resolvedPath = path + '/' + resolvedPath;
+    resolvedAbsolute = path.charAt(0) === '/';
+  }
+
+  // At this point the path should be resolved to a full absolute path, but
+  // handle relative paths to be safe (might happen when process.cwd() fails)
+
+  // Normalize the path
+  resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function (p) {
+    return !!p;
+  }), !resolvedAbsolute).join('/');
+  return (resolvedAbsolute ? '/' : '') + resolvedPath || '.';
+}
+
+// path.normalize(path)
+// posix version
+function normalize(path) {
+  var isPathAbsolute = isAbsolute(path),
+    trailingSlash = substr(path, -1) === '/';
+
+  // Normalize the path
+  path = normalizeArray(filter(path.split('/'), function (p) {
+    return !!p;
+  }), !isPathAbsolute).join('/');
+  if (!path && !isPathAbsolute) {
+    path = '.';
+  }
+  if (path && trailingSlash) {
+    path += '/';
+  }
+  return (isPathAbsolute ? '/' : '') + path;
+}
+
+// posix version
+function isAbsolute(path) {
+  return path.charAt(0) === '/';
+}
+
+// posix version
+function join() {
+  var paths = Array.prototype.slice.call(arguments, 0);
+  return normalize(filter(paths, function (p, index) {
+    if (typeof p !== 'string') {
+      throw new TypeError('Arguments to path.join must be strings');
+    }
+    return p;
+  }).join('/'));
+}
+
+// path.relative(from, to)
+// posix version
+function relative(from, to) {
+  from = resolve(from).substr(1);
+  to = resolve(to).substr(1);
+  function trim(arr) {
+    var start = 0;
+    for (; start < arr.length; start++) {
+      if (arr[start] !== '') break;
+    }
+    var end = arr.length - 1;
+    for (; end >= 0; end--) {
+      if (arr[end] !== '') break;
+    }
+    if (start > end) return [];
+    return arr.slice(start, end - start + 1);
+  }
+  var fromParts = trim(from.split('/'));
+  var toParts = trim(to.split('/'));
+  var length = Math.min(fromParts.length, toParts.length);
+  var samePartsLength = length;
+  for (var i = 0; i < length; i++) {
+    if (fromParts[i] !== toParts[i]) {
+      samePartsLength = i;
+      break;
+    }
+  }
+  var outputParts = [];
+  for (var i = samePartsLength; i < fromParts.length; i++) {
+    outputParts.push('..');
+  }
+  outputParts = outputParts.concat(toParts.slice(samePartsLength));
+  return outputParts.join('/');
+}
+var sep = '/';
+var delimiter = ':';
+function dirname(path) {
+  var result = splitPath(path),
+    root = result[0],
+    dir = result[1];
+  if (!root && !dir) {
+    // No dirname whatsoever
+    return '.';
+  }
+  if (dir) {
+    // It has a dirname, strip trailing slash
+    dir = dir.substr(0, dir.length - 1);
+  }
+  return root + dir;
+}
+function basename(path, ext) {
+  var f = splitPath(path)[2];
+  // TODO: make this comparison case-insensitive on windows?
+  if (ext && f.substr(-1 * ext.length) === ext) {
+    f = f.substr(0, f.length - ext.length);
+  }
+  return f;
+}
+function extname(path) {
+  return splitPath(path)[3];
+}
+var path = {
+  extname: extname,
+  basename: basename,
+  dirname: dirname,
+  sep: sep,
+  delimiter: delimiter,
+  relative: relative,
+  join: join,
+  isAbsolute: isAbsolute,
+  normalize: normalize,
+  resolve: resolve
+};
+function filter(xs, f) {
+  if (xs.filter) return xs.filter(f);
+  var res = [];
+  for (var i = 0; i < xs.length; i++) {
+    if (f(xs[i], i, xs)) res.push(xs[i]);
+  }
+  return res;
+}
+
+// String.prototype.substr - negative index don't work in IE8
+var substr = 'ab'.substr(-1) === 'b' ? function (str, start, len) {
+  return str.substr(start, len);
+} : function (str, start, len) {
+  if (start < 0) start = str.length + start;
+  return str.substr(start, len);
+};
+
+var path$1 = /*#__PURE__*/Object.freeze({
+  __proto__: null,
+  basename: basename,
+  default: path,
+  delimiter: delimiter,
+  dirname: dirname,
+  extname: extname,
+  isAbsolute: isAbsolute,
+  join: join,
+  normalize: normalize,
+  relative: relative,
+  resolve: resolve,
+  sep: sep
+});
+
+var require$$0 = /*@__PURE__*/getAugmentedNamespace(path$1);
+
+var macros = {};
+
+var builder = {};
+
+var hasRequiredBuilder;
+
+function requireBuilder () {
+	if (hasRequiredBuilder) return builder;
+	hasRequiredBuilder = 1;
+
+	Object.defineProperty(builder, "__esModule", {
+	  value: true
+	});
+	class Builder {
+	  constructor(t, util, options) {
+	    this.t = t;
+	    this.expressions = [];
+	    this.module = options.module;
+	    this.global = options.global;
+	    this.assertPredicateIndex = options.assertPredicateIndex;
+	    this.isDebug = options.isDebug;
+	    this.util = util;
+	  }
+	  /**
+	   * Expands:
+	   *
+	   * assert($PREDICATE, $MESSAGE)
+	   *
+	   * into
+	   *
+	   * ($DEBUG && console.assert($PREDICATE, $MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && assert($PREDICATE, $MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && $GLOBAL_NS.assert($PREDICATE, $MESSAGE));
+	   */
+	  assert(path) {
+	    let predicate;
+	    const index = this.assertPredicateIndex;
+	    if (index !== undefined) {
+	      predicate = (expression, args) => {
+	        return args[index];
+	      };
+	    }
+	    this._createMacroExpression(path, {
+	      predicate
+	    });
+	  }
+	  /**
+	   * Expands:
+	   *
+	   * warn($MESSAGE)
+	   *
+	   * into
+	   *
+	   * ($DEBUG && console.warn($MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && warn($MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && $GLOBAL_NS.warn($MESSAGE));
+	   */
+	  warn(path) {
+	    this._createMacroExpression(path);
+	  }
+	  /**
+	   * Expands:
+	   *
+	   * log($MESSAGE)
+	   *
+	   * into
+	   *
+	   * ($DEBUG && console.log($MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && log($MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && $GLOBAL_NS.log($MESSAGE));
+	   */
+	  log(path) {
+	    this._createMacroExpression(path);
+	  }
+	  _createMacroExpression(path, options = {}) {
+	    let t = this.t;
+	    let expression = path.node.expression;
+	    let callee = expression.callee;
+	    let args = expression.arguments;
+	    if (options.validate) {
+	      options.validate(expression, args);
+	    }
+	    let callExpression;
+	    if (this.module) {
+	      callExpression = expression;
+	    } else if (this.global) {
+	      callExpression = this._createGlobalExternalHelper(callee, args, this.global);
+	    } else if (options.buildConsoleAPI) {
+	      callExpression = options.buildConsoleAPI(expression, args);
+	    } else {
+	      callExpression = this._createConsoleAPI(options.consoleAPI || callee, args);
+	    }
+	    let prefixedIdentifiers = [];
+	    if (options.predicate) {
+	      let predicate = options.predicate(expression, args) || t.identifier('false');
+	      if (!this.t.isExpression(predicate)) {
+	        throw new Error(`bug: this doesn't support ${predicate.type}`);
+	      }
+	      let negatedPredicate = t.unaryExpression('!', t.parenthesizedExpression(predicate));
+	      prefixedIdentifiers.push(negatedPredicate);
+	    }
+	    this.expressions.push([path, this._buildLogicalExpressions(prefixedIdentifiers, callExpression)]);
+	  }
+	  /**
+	   * Expands:
+	   *
+	   * deprecate($MESSAGE, $PREDICATE)
+	   *
+	   * or
+	   *
+	   * deprecate($MESSAGE, $PREDICATE, {
+	   *  $ID,
+	   *  $URL,
+	   *  $UNIL
+	   * });
+	   *
+	   * into
+	   *
+	   * ($DEBUG && $PREDICATE && console.warn($MESSAGE));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && $PREDICATE && deprecate($MESSAGE, $PREDICATE, { $ID, $URL, $UNTIL }));
+	   *
+	   * or
+	   *
+	   * ($DEBUG && $PREDICATE && $GLOBAL_NS.deprecate($MESSAGE, $PREDICATE, { $ID, $URL, $UNTIL }));
+	   */
+	  deprecate(path) {
+	    this._createMacroExpression(path, {
+	      predicate: (expression, args) => args[1],
+	      buildConsoleAPI: (expression, args) => {
+	        let message = args[0];
+	        return this._createConsoleAPI(this.t.identifier('warn'), [message]);
+	      },
+	      validate: (expression, args) => {
+	        let meta = args[2];
+	        if (meta && this.t.isObjectExpression(meta) && meta.properties && !meta.properties.some(prop => this.t.isObjectProperty(prop) && (this.t.isIdentifier(prop.key) && prop.key.name === 'id' || this.t.isStringLiteral(prop.key) && prop.key.value === 'id'))) {
+	          throw new ReferenceError(`deprecate's meta information requires an "id" field.`);
+	        }
+	      }
+	    });
+	  }
+	  /**
+	   * Performs the actually expansion of macros
+	   */
+	  expandMacros() {
+	    let t = this.t;
+	    for (let i = 0; i < this.expressions.length; i++) {
+	      let expression = this.expressions[i];
+	      let exp = expression[0];
+	      let flag = this._debugExpression(exp);
+	      let logicalExp = expression[1];
+	      exp.replaceWith(t.parenthesizedExpression(logicalExp(flag)));
+	      exp.scope.crawl();
+	    }
+	  }
+	  _debugExpression(target) {
+	    if (typeof this.isDebug === 'boolean') {
+	      return this.t.booleanLiteral(this.isDebug);
+	    } else {
+	      return this.t.callExpression(this.util.import(target, '@embroider/macros', 'isDevelopingApp'), []);
+	    }
+	  }
+	  _createGlobalExternalHelper(identifier, args, ns) {
+	    let t = this.t;
+	    return t.callExpression(t.memberExpression(t.identifier(ns), identifier), args);
+	  }
+	  _createConsoleAPI(identifier, args) {
+	    let t = this.t;
+	    return t.callExpression(t.memberExpression(t.identifier('console'), identifier), args);
+	  }
+	  _buildLogicalExpressions(identifiers, callExpression) {
+	    let t = this.t;
+	    return debugIdentifier => {
+	      identifiers.unshift(debugIdentifier);
+	      identifiers.push(callExpression);
+	      let logicalExpressions;
+	      for (let i = 0; i < identifiers.length; i++) {
+	        let left = identifiers[i];
+	        let right = identifiers[i + 1];
+	        if (!logicalExpressions) {
+	          logicalExpressions = t.logicalExpression('&&', left, right);
+	        } else if (right) {
+	          logicalExpressions = t.logicalExpression('&&', logicalExpressions, right);
+	        }
+	      }
+	      return logicalExpressions;
+	    };
+	  }
+	}
+	builder.default = Builder;
+	return builder;
+}
+
+var babelTypeHelpers = {};
+
+var hasRequiredBabelTypeHelpers;
+
+function requireBabelTypeHelpers () {
+	if (hasRequiredBabelTypeHelpers) return babelTypeHelpers;
+	hasRequiredBabelTypeHelpers = 1;
+
+	Object.defineProperty(babelTypeHelpers, "__esModule", {
+	  value: true
+	});
+	babelTypeHelpers.isCallStatementPath = babelTypeHelpers.isCallIdentifierExpression = babelTypeHelpers.name = void 0;
+	function name(value) {
+	  if (value.type === 'Identifier') {
+	    return value.name;
+	  } else {
+	    return value.value;
+	  }
+	}
+	babelTypeHelpers.name = name;
+	function isCallIdentifierExpression(exp) {
+	  return exp.callee.type === 'Identifier';
+	}
+	babelTypeHelpers.isCallIdentifierExpression = isCallIdentifierExpression;
+	function isCallStatementPath(path) {
+	  return path.node.expression.type === 'CallExpression' && isCallIdentifierExpression(path.node.expression);
+	}
+	babelTypeHelpers.isCallStatementPath = isCallStatementPath;
+	return babelTypeHelpers;
+}
+
+var hasRequiredMacros;
+
+function requireMacros () {
+	if (hasRequiredMacros) return macros;
+	hasRequiredMacros = 1;
+
+	var __importDefault = macros && macros.__importDefault || function (mod) {
+	  return mod && mod.__esModule ? mod : {
+	    "default": mod
+	  };
+	};
+	Object.defineProperty(macros, "__esModule", {
+	  value: true
+	});
+	const builder_1 = __importDefault(requireBuilder());
+	const babel_type_helpers_1 = requireBabelTypeHelpers();
+	const SUPPORTED_MACROS = ['assert', 'deprecate', 'warn', 'log'];
+	class Macros {
+	  constructor(babel, options, util) {
+	    this.localDebugBindings = [];
+	    this.debugHelpers = options.externalizeHelpers;
+	    this.builder = new builder_1.default(babel.types, util, {
+	      module: this.debugHelpers?.module,
+	      global: this.debugHelpers?.global,
+	      assertPredicateIndex: options.debugTools && options.debugTools.assertPredicateIndex,
+	      isDebug: options.debugTools.isDebug
+	    });
+	  }
+	  /**
+	   * Injects the either the env-flags module with the debug binding or
+	   * adds the debug binding if missing from the env-flags module.
+	   */
+	  expand() {
+	    this.builder.expandMacros();
+	    this._cleanImports();
+	  }
+	  /**
+	   * Collects the import bindings for the debug tools.
+	   */
+	  collectDebugToolsSpecifiers(specifiers) {
+	    specifiers.forEach(specifier => {
+	      if (specifier.node.type === 'ImportSpecifier' && SUPPORTED_MACROS.indexOf((0, babel_type_helpers_1.name)(specifier.node.imported)) > -1) {
+	        this.localDebugBindings.push(specifier.get('local'));
+	      }
+	    });
+	  }
+	  /**
+	   * Builds the expressions that the CallExpression will expand into.
+	   */
+	  build(path) {
+	    if (!(0, babel_type_helpers_1.isCallStatementPath)(path)) {
+	      return;
+	    }
+	    if (this.localDebugBindings.some(b => b.node.name === path.node.expression.callee.name)) {
+	      let imported = (0, babel_type_helpers_1.name)(path.scope.getBinding(path.node.expression.callee.name).path.node.imported);
+	      this.builder[`${imported}`](path);
+	    }
+	  }
+	  _cleanImports() {
+	    if (!this.debugHelpers?.module) {
+	      if (this.localDebugBindings.length > 0) {
+	        let importPath = this.localDebugBindings[0].findParent(p => p.isImportDeclaration());
+	        if (importPath === null) {
+	          // import declaration in question seems to have already been removed
+	          return;
+	        }
+	        let specifiers = importPath.get('specifiers');
+	        if (specifiers.length === this.localDebugBindings.length) {
+	          this.localDebugBindings[0].parentPath.parentPath.remove();
+	        } else {
+	          this.localDebugBindings.forEach(binding => binding.parentPath.remove());
+	        }
+	      }
+	    }
+	  }
+	}
+	macros.default = Macros;
+	return macros;
+}
+
+var normalizeOptions = {};
+
+var re = {exports: {}};
+
+var constants;
+var hasRequiredConstants;
+
+function requireConstants () {
+	if (hasRequiredConstants) return constants;
+	hasRequiredConstants = 1;
+
+	// Note: this is the semver.org version of the spec that it implements
+	// Not necessarily the package version of this code.
+	const SEMVER_SPEC_VERSION = '2.0.0';
+	const MAX_LENGTH = 256;
+	const MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */9007199254740991;
+
+	// Max safe segment length for coercion.
+	const MAX_SAFE_COMPONENT_LENGTH = 16;
+
+	// Max safe length for a build identifier. The max length minus 6 characters for
+	// the shortest version with a build 0.0.0+BUILD.
+	const MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6;
+	const RELEASE_TYPES = ['major', 'premajor', 'minor', 'preminor', 'patch', 'prepatch', 'prerelease'];
+	constants = {
+	  MAX_LENGTH,
+	  MAX_SAFE_COMPONENT_LENGTH,
+	  MAX_SAFE_BUILD_LENGTH,
+	  MAX_SAFE_INTEGER,
+	  RELEASE_TYPES,
+	  SEMVER_SPEC_VERSION,
+	  FLAG_INCLUDE_PRERELEASE: 0b001,
+	  FLAG_LOOSE: 0b010
+	};
+	return constants;
+}
+
+var debug_1;
+var hasRequiredDebug;
+
+function requireDebug () {
+	if (hasRequiredDebug) return debug_1;
+	hasRequiredDebug = 1;
+
+	const debug = typeof process === 'object' && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...args) => console.error('SEMVER', ...args) : () => {};
+	debug_1 = debug;
+	return debug_1;
+}
+
+var hasRequiredRe;
+
+function requireRe () {
+	if (hasRequiredRe) return re.exports;
+	hasRequiredRe = 1;
+	(function (module, exports) {
+
+		const {
+		  MAX_SAFE_COMPONENT_LENGTH,
+		  MAX_SAFE_BUILD_LENGTH,
+		  MAX_LENGTH
+		} = requireConstants();
+		const debug = requireDebug();
+		exports = module.exports = {};
+
+		// The actual regexps go on exports.re
+		const re = exports.re = [];
+		const safeRe = exports.safeRe = [];
+		const src = exports.src = [];
+		const safeSrc = exports.safeSrc = [];
+		const t = exports.t = {};
+		let R = 0;
+		const LETTERDASHNUMBER = '[a-zA-Z0-9-]';
+
+		// Replace some greedy regex tokens to prevent regex dos issues. These regex are
+		// used internally via the safeRe object since all inputs in this library get
+		// normalized first to trim and collapse all extra whitespace. The original
+		// regexes are exported for userland consumption and lower level usage. A
+		// future breaking change could export the safer regex only with a note that
+		// all input should have extra whitespace removed.
+		const safeRegexReplacements = [['\\s', 1], ['\\d', MAX_LENGTH], [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH]];
+		const makeSafeRegex = value => {
+		  for (const [token, max] of safeRegexReplacements) {
+		    value = value.split(`${token}*`).join(`${token}{0,${max}}`).split(`${token}+`).join(`${token}{1,${max}}`);
+		  }
+		  return value;
+		};
+		const createToken = (name, value, isGlobal) => {
+		  const safe = makeSafeRegex(value);
+		  const index = R++;
+		  debug(name, index, value);
+		  t[name] = index;
+		  src[index] = value;
+		  safeSrc[index] = safe;
+		  re[index] = new RegExp(value, isGlobal ? 'g' : undefined);
+		  safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined);
+		};
+
+		// The following Regular Expressions can be used for tokenizing,
+		// validating, and parsing SemVer version strings.
+
+		// ## Numeric Identifier
+		// A single `0`, or a non-zero digit followed by zero or more digits.
+
+		createToken('NUMERICIDENTIFIER', '0|[1-9]\\d*');
+		createToken('NUMERICIDENTIFIERLOOSE', '\\d+');
+
+		// ## Non-numeric Identifier
+		// Zero or more digits, followed by a letter or hyphen, and then zero or
+		// more letters, digits, or hyphens.
+
+		createToken('NONNUMERICIDENTIFIER', `\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`);
+
+		// ## Main Version
+		// Three dot-separated numeric identifiers.
+
+		createToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\.` + `(${src[t.NUMERICIDENTIFIER]})\\.` + `(${src[t.NUMERICIDENTIFIER]})`);
+		createToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` + `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` + `(${src[t.NUMERICIDENTIFIERLOOSE]})`);
+
+		// ## Pre-release Version Identifier
+		// A numeric identifier, or a non-numeric identifier.
+		// Non-numberic identifiers include numberic identifiers but can be longer.
+		// Therefore non-numberic identifiers must go first.
+
+		createToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]}|${src[t.NUMERICIDENTIFIER]})`);
+		createToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]}|${src[t.NUMERICIDENTIFIERLOOSE]})`);
+
+		// ## Pre-release Version
+		// Hyphen, followed by one or more dot-separated pre-release version
+		// identifiers.
+
+		createToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]}(?:\\.${src[t.PRERELEASEIDENTIFIER]})*))`);
+		createToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`);
+
+		// ## Build Metadata Identifier
+		// Any combination of digits, letters, or hyphens.
+
+		createToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`);
+
+		// ## Build Metadata
+		// Plus sign, followed by one or more period-separated build metadata
+		// identifiers.
+
+		createToken('BUILD', `(?:\\+(${src[t.BUILDIDENTIFIER]}(?:\\.${src[t.BUILDIDENTIFIER]})*))`);
+
+		// ## Full Version String
+		// A main version, followed optionally by a pre-release version and
+		// build metadata.
+
+		// Note that the only major, minor, patch, and pre-release sections of
+		// the version string are capturing groups.  The build metadata is not a
+		// capturing group, because it should not ever be used in version
+		// comparison.
+
+		createToken('FULLPLAIN', `v?${src[t.MAINVERSION]}${src[t.PRERELEASE]}?${src[t.BUILD]}?`);
+		createToken('FULL', `^${src[t.FULLPLAIN]}$`);
+
+		// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.
+		// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty
+		// common in the npm registry.
+		createToken('LOOSEPLAIN', `[v=\\s]*${src[t.MAINVERSIONLOOSE]}${src[t.PRERELEASELOOSE]}?${src[t.BUILD]}?`);
+		createToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`);
+		createToken('GTLT', '((?:<|>)?=?)');
+
+		// Something like "2.*" or "1.2.x".
+		// Note that "x.x" is a valid xRange identifer, meaning "any version"
+		// Only the first item is strictly required.
+		createToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`);
+		createToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\*`);
+		createToken('XRANGEPLAIN', `[v=\\s]*(${src[t.XRANGEIDENTIFIER]})` + `(?:\\.(${src[t.XRANGEIDENTIFIER]})` + `(?:\\.(${src[t.XRANGEIDENTIFIER]})` + `(?:${src[t.PRERELEASE]})?${src[t.BUILD]}?` + `)?)?`);
+		createToken('XRANGEPLAINLOOSE', `[v=\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` + `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` + `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` + `(?:${src[t.PRERELEASELOOSE]})?${src[t.BUILD]}?` + `)?)?`);
+		createToken('XRANGE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAIN]}$`);
+		createToken('XRANGELOOSE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAINLOOSE]}$`);
+
+		// Coercion.
+		// Extract anything that could conceivably be a part of a valid semver
+		createToken('COERCEPLAIN', `${'(^|[^\\d])' + '(\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` + `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` + `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`);
+		createToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\d])`);
+		createToken('COERCEFULL', src[t.COERCEPLAIN] + `(?:${src[t.PRERELEASE]})?` + `(?:${src[t.BUILD]})?` + `(?:$|[^\\d])`);
+		createToken('COERCERTL', src[t.COERCE], true);
+		createToken('COERCERTLFULL', src[t.COERCEFULL], true);
+
+		// Tilde ranges.
+		// Meaning is "reasonably at or greater than"
+		createToken('LONETILDE', '(?:~>?)');
+		createToken('TILDETRIM', `(\\s*)${src[t.LONETILDE]}\\s+`, true);
+		exports.tildeTrimReplace = '$1~';
+		createToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`);
+		createToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`);
+
+		// Caret ranges.
+		// Meaning is "at least and backwards compatible with"
+		createToken('LONECARET', '(?:\\^)');
+		createToken('CARETTRIM', `(\\s*)${src[t.LONECARET]}\\s+`, true);
+		exports.caretTrimReplace = '$1^';
+		createToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`);
+		createToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`);
+
+		// A simple gt/lt/eq thing, or just "" to indicate "any version"
+		createToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\s*(${src[t.LOOSEPLAIN]})$|^$`);
+		createToken('COMPARATOR', `^${src[t.GTLT]}\\s*(${src[t.FULLPLAIN]})$|^$`);
+
+		// An expression to strip any whitespace between the gtlt and the thing
+		// it modifies, so that `> 1.2.3` ==> `>1.2.3`
+		createToken('COMPARATORTRIM', `(\\s*)${src[t.GTLT]}\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true);
+		exports.comparatorTrimReplace = '$1$2$3';
+
+		// Something like `1.2.3 - 1.2.4`
+		// Note that these all use the loose form, because they'll be
+		// checked against either the strict or loose comparator form
+		// later.
+		createToken('HYPHENRANGE', `^\\s*(${src[t.XRANGEPLAIN]})` + `\\s+-\\s+` + `(${src[t.XRANGEPLAIN]})` + `\\s*$`);
+		createToken('HYPHENRANGELOOSE', `^\\s*(${src[t.XRANGEPLAINLOOSE]})` + `\\s+-\\s+` + `(${src[t.XRANGEPLAINLOOSE]})` + `\\s*$`);
+
+		// Star ranges basically just allow anything at all.
+		createToken('STAR', '(<|>)?=?\\s*\\*');
+		// >=0.0.0 is like a star
+		createToken('GTE0', '^\\s*>=\\s*0\\.0\\.0\\s*$');
+		createToken('GTE0PRE', '^\\s*>=\\s*0\\.0\\.0-0\\s*$'); 
+	} (re, re.exports));
+	return re.exports;
+}
+
+var parseOptions_1;
+var hasRequiredParseOptions;
+
+function requireParseOptions () {
+	if (hasRequiredParseOptions) return parseOptions_1;
+	hasRequiredParseOptions = 1;
+
+	// parse out just the options we care about
+	const looseOption = Object.freeze({
+	  loose: true
+	});
+	const emptyOpts = Object.freeze({});
+	const parseOptions = options => {
+	  if (!options) {
+	    return emptyOpts;
+	  }
+	  if (typeof options !== 'object') {
+	    return looseOption;
+	  }
+	  return options;
+	};
+	parseOptions_1 = parseOptions;
+	return parseOptions_1;
+}
+
+var identifiers;
+var hasRequiredIdentifiers;
+
+function requireIdentifiers () {
+	if (hasRequiredIdentifiers) return identifiers;
+	hasRequiredIdentifiers = 1;
+
+	const numeric = /^[0-9]+$/;
+	const compareIdentifiers = (a, b) => {
+	  const anum = numeric.test(a);
+	  const bnum = numeric.test(b);
+	  if (anum && bnum) {
+	    a = +a;
+	    b = +b;
+	  }
+	  return a === b ? 0 : anum && !bnum ? -1 : bnum && !anum ? 1 : a < b ? -1 : 1;
+	};
+	const rcompareIdentifiers = (a, b) => compareIdentifiers(b, a);
+	identifiers = {
+	  compareIdentifiers,
+	  rcompareIdentifiers
+	};
+	return identifiers;
+}
+
+var semver$1;
+var hasRequiredSemver$1;
+
+function requireSemver$1 () {
+	if (hasRequiredSemver$1) return semver$1;
+	hasRequiredSemver$1 = 1;
+
+	const debug = requireDebug();
+	const {
+	  MAX_LENGTH,
+	  MAX_SAFE_INTEGER
+	} = requireConstants();
+	const {
+	  safeRe: re,
+	  t
+	} = requireRe();
+	const parseOptions = requireParseOptions();
+	const {
+	  compareIdentifiers
+	} = requireIdentifiers();
+	class SemVer {
+	  constructor(version, options) {
+	    options = parseOptions(options);
+	    if (version instanceof SemVer) {
+	      if (version.loose === !!options.loose && version.includePrerelease === !!options.includePrerelease) {
+	        return version;
+	      } else {
+	        version = version.version;
+	      }
+	    } else if (typeof version !== 'string') {
+	      throw new TypeError(`Invalid version. Must be a string. Got type "${typeof version}".`);
+	    }
+	    if (version.length > MAX_LENGTH) {
+	      throw new TypeError(`version is longer than ${MAX_LENGTH} characters`);
+	    }
+	    debug('SemVer', version, options);
+	    this.options = options;
+	    this.loose = !!options.loose;
+	    // this isn't actually relevant for versions, but keep it so that we
+	    // don't run into trouble passing this.options around.
+	    this.includePrerelease = !!options.includePrerelease;
+	    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL]);
+	    if (!m) {
+	      throw new TypeError(`Invalid Version: ${version}`);
+	    }
+	    this.raw = version;
+
+	    // these are actually numbers
+	    this.major = +m[1];
+	    this.minor = +m[2];
+	    this.patch = +m[3];
+	    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {
+	      throw new TypeError('Invalid major version');
+	    }
+	    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {
+	      throw new TypeError('Invalid minor version');
+	    }
+	    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {
+	      throw new TypeError('Invalid patch version');
+	    }
+
+	    // numberify any prerelease numeric ids
+	    if (!m[4]) {
+	      this.prerelease = [];
+	    } else {
+	      this.prerelease = m[4].split('.').map(id => {
+	        if (/^[0-9]+$/.test(id)) {
+	          const num = +id;
+	          if (num >= 0 && num < MAX_SAFE_INTEGER) {
+	            return num;
+	          }
+	        }
+	        return id;
+	      });
+	    }
+	    this.build = m[5] ? m[5].split('.') : [];
+	    this.format();
+	  }
+	  format() {
+	    this.version = `${this.major}.${this.minor}.${this.patch}`;
+	    if (this.prerelease.length) {
+	      this.version += `-${this.prerelease.join('.')}`;
+	    }
+	    return this.version;
+	  }
+	  toString() {
+	    return this.version;
+	  }
+	  compare(other) {
+	    debug('SemVer.compare', this.version, this.options, other);
+	    if (!(other instanceof SemVer)) {
+	      if (typeof other === 'string' && other === this.version) {
+	        return 0;
+	      }
+	      other = new SemVer(other, this.options);
+	    }
+	    if (other.version === this.version) {
+	      return 0;
+	    }
+	    return this.compareMain(other) || this.comparePre(other);
+	  }
+	  compareMain(other) {
+	    if (!(other instanceof SemVer)) {
+	      other = new SemVer(other, this.options);
+	    }
+	    return compareIdentifiers(this.major, other.major) || compareIdentifiers(this.minor, other.minor) || compareIdentifiers(this.patch, other.patch);
+	  }
+	  comparePre(other) {
+	    if (!(other instanceof SemVer)) {
+	      other = new SemVer(other, this.options);
+	    }
+
+	    // NOT having a prerelease is > having one
+	    if (this.prerelease.length && !other.prerelease.length) {
+	      return -1;
+	    } else if (!this.prerelease.length && other.prerelease.length) {
+	      return 1;
+	    } else if (!this.prerelease.length && !other.prerelease.length) {
+	      return 0;
+	    }
+	    let i = 0;
+	    do {
+	      const a = this.prerelease[i];
+	      const b = other.prerelease[i];
+	      debug('prerelease compare', i, a, b);
+	      if (a === undefined && b === undefined) {
+	        return 0;
+	      } else if (b === undefined) {
+	        return 1;
+	      } else if (a === undefined) {
+	        return -1;
+	      } else if (a === b) {
+	        continue;
+	      } else {
+	        return compareIdentifiers(a, b);
+	      }
+	    } while (++i);
+	  }
+	  compareBuild(other) {
+	    if (!(other instanceof SemVer)) {
+	      other = new SemVer(other, this.options);
+	    }
+	    let i = 0;
+	    do {
+	      const a = this.build[i];
+	      const b = other.build[i];
+	      debug('build compare', i, a, b);
+	      if (a === undefined && b === undefined) {
+	        return 0;
+	      } else if (b === undefined) {
+	        return 1;
+	      } else if (a === undefined) {
+	        return -1;
+	      } else if (a === b) {
+	        continue;
+	      } else {
+	        return compareIdentifiers(a, b);
+	      }
+	    } while (++i);
+	  }
+
+	  // preminor will bump the version up to the next minor release, and immediately
+	  // down to pre-release. premajor and prepatch work the same way.
+	  inc(release, identifier, identifierBase) {
+	    if (release.startsWith('pre')) {
+	      if (!identifier && identifierBase === false) {
+	        throw new Error('invalid increment argument: identifier is empty');
+	      }
+	      // Avoid an invalid semver results
+	      if (identifier) {
+	        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE]);
+	        if (!match || match[1] !== identifier) {
+	          throw new Error(`invalid identifier: ${identifier}`);
+	        }
+	      }
+	    }
+	    switch (release) {
+	      case 'premajor':
+	        this.prerelease.length = 0;
+	        this.patch = 0;
+	        this.minor = 0;
+	        this.major++;
+	        this.inc('pre', identifier, identifierBase);
+	        break;
+	      case 'preminor':
+	        this.prerelease.length = 0;
+	        this.patch = 0;
+	        this.minor++;
+	        this.inc('pre', identifier, identifierBase);
+	        break;
+	      case 'prepatch':
+	        // If this is already a prerelease, it will bump to the next version
+	        // drop any prereleases that might already exist, since they are not
+	        // relevant at this point.
+	        this.prerelease.length = 0;
+	        this.inc('patch', identifier, identifierBase);
+	        this.inc('pre', identifier, identifierBase);
+	        break;
+	      // If the input is a non-prerelease version, this acts the same as
+	      // prepatch.
+	      case 'prerelease':
+	        if (this.prerelease.length === 0) {
+	          this.inc('patch', identifier, identifierBase);
+	        }
+	        this.inc('pre', identifier, identifierBase);
+	        break;
+	      case 'release':
+	        if (this.prerelease.length === 0) {
+	          throw new Error(`version ${this.raw} is not a prerelease`);
+	        }
+	        this.prerelease.length = 0;
+	        break;
+	      case 'major':
+	        // If this is a pre-major version, bump up to the same major version.
+	        // Otherwise increment major.
+	        // 1.0.0-5 bumps to 1.0.0
+	        // 1.1.0 bumps to 2.0.0
+	        if (this.minor !== 0 || this.patch !== 0 || this.prerelease.length === 0) {
+	          this.major++;
+	        }
+	        this.minor = 0;
+	        this.patch = 0;
+	        this.prerelease = [];
+	        break;
+	      case 'minor':
+	        // If this is a pre-minor version, bump up to the same minor version.
+	        // Otherwise increment minor.
+	        // 1.2.0-5 bumps to 1.2.0
+	        // 1.2.1 bumps to 1.3.0
+	        if (this.patch !== 0 || this.prerelease.length === 0) {
+	          this.minor++;
+	        }
+	        this.patch = 0;
+	        this.prerelease = [];
+	        break;
+	      case 'patch':
+	        // If this is not a pre-release version, it will increment the patch.
+	        // If it is a pre-release it will bump up to the same patch version.
+	        // 1.2.0-5 patches to 1.2.0
+	        // 1.2.0 patches to 1.2.1
+	        if (this.prerelease.length === 0) {
+	          this.patch++;
+	        }
+	        this.prerelease = [];
+	        break;
+	      // This probably shouldn't be used publicly.
+	      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
+	      case 'pre':
+	        {
+	          const base = Number(identifierBase) ? 1 : 0;
+	          if (this.prerelease.length === 0) {
+	            this.prerelease = [base];
+	          } else {
+	            let i = this.prerelease.length;
+	            while (--i >= 0) {
+	              if (typeof this.prerelease[i] === 'number') {
+	                this.prerelease[i]++;
+	                i = -2;
+	              }
+	            }
+	            if (i === -1) {
+	              // didn't increment anything
+	              if (identifier === this.prerelease.join('.') && identifierBase === false) {
+	                throw new Error('invalid increment argument: identifier already exists');
+	              }
+	              this.prerelease.push(base);
+	            }
+	          }
+	          if (identifier) {
+	            // 1.2.0-beta.1 bumps to 1.2.0-beta.2,
+	            // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0
+	            let prerelease = [identifier, base];
+	            if (identifierBase === false) {
+	              prerelease = [identifier];
+	            }
+	            if (compareIdentifiers(this.prerelease[0], identifier) === 0) {
+	              if (isNaN(this.prerelease[1])) {
+	                this.prerelease = prerelease;
+	              }
+	            } else {
+	              this.prerelease = prerelease;
+	            }
+	          }
+	          break;
+	        }
+	      default:
+	        throw new Error(`invalid increment argument: ${release}`);
+	    }
+	    this.raw = this.format();
+	    if (this.build.length) {
+	      this.raw += `+${this.build.join('.')}`;
+	    }
+	    return this;
+	  }
+	}
+	semver$1 = SemVer;
+	return semver$1;
+}
+
+var parse_1;
+var hasRequiredParse;
+
+function requireParse () {
+	if (hasRequiredParse) return parse_1;
+	hasRequiredParse = 1;
+
+	const SemVer = requireSemver$1();
+	const parse = (version, options, throwErrors = false) => {
+	  if (version instanceof SemVer) {
+	    return version;
+	  }
+	  try {
+	    return new SemVer(version, options);
+	  } catch (er) {
+	    if (!throwErrors) {
+	      return null;
+	    }
+	    throw er;
+	  }
+	};
+	parse_1 = parse;
+	return parse_1;
+}
+
+var valid_1;
+var hasRequiredValid$1;
+
+function requireValid$1 () {
+	if (hasRequiredValid$1) return valid_1;
+	hasRequiredValid$1 = 1;
+
+	const parse = requireParse();
+	const valid = (version, options) => {
+	  const v = parse(version, options);
+	  return v ? v.version : null;
+	};
+	valid_1 = valid;
+	return valid_1;
+}
+
+var clean_1;
+var hasRequiredClean;
+
+function requireClean () {
+	if (hasRequiredClean) return clean_1;
+	hasRequiredClean = 1;
+
+	const parse = requireParse();
+	const clean = (version, options) => {
+	  const s = parse(version.trim().replace(/^[=v]+/, ''), options);
+	  return s ? s.version : null;
+	};
+	clean_1 = clean;
+	return clean_1;
+}
+
+var inc_1;
+var hasRequiredInc;
+
+function requireInc () {
+	if (hasRequiredInc) return inc_1;
+	hasRequiredInc = 1;
+
+	const SemVer = requireSemver$1();
+	const inc = (version, release, options, identifier, identifierBase) => {
+	  if (typeof options === 'string') {
+	    identifierBase = identifier;
+	    identifier = options;
+	    options = undefined;
+	  }
+	  try {
+	    return new SemVer(version instanceof SemVer ? version.version : version, options).inc(release, identifier, identifierBase).version;
+	  } catch (er) {
+	    return null;
+	  }
+	};
+	inc_1 = inc;
+	return inc_1;
+}
+
+var diff_1;
+var hasRequiredDiff;
+
+function requireDiff () {
+	if (hasRequiredDiff) return diff_1;
+	hasRequiredDiff = 1;
+
+	const parse = requireParse();
+	const diff = (version1, version2) => {
+	  const v1 = parse(version1, null, true);
+	  const v2 = parse(version2, null, true);
+	  const comparison = v1.compare(v2);
+	  if (comparison === 0) {
+	    return null;
+	  }
+	  const v1Higher = comparison > 0;
+	  const highVersion = v1Higher ? v1 : v2;
+	  const lowVersion = v1Higher ? v2 : v1;
+	  const highHasPre = !!highVersion.prerelease.length;
+	  const lowHasPre = !!lowVersion.prerelease.length;
+	  if (lowHasPre && !highHasPre) {
+	    // Going from prerelease -> no prerelease requires some special casing
+
+	    // If the low version has only a major, then it will always be a major
+	    // Some examples:
+	    // 1.0.0-1 -> 1.0.0
+	    // 1.0.0-1 -> 1.1.1
+	    // 1.0.0-1 -> 2.0.0
+	    if (!lowVersion.patch && !lowVersion.minor) {
+	      return 'major';
+	    }
+
+	    // If the main part has no difference
+	    if (lowVersion.compareMain(highVersion) === 0) {
+	      if (lowVersion.minor && !lowVersion.patch) {
+	        return 'minor';
+	      }
+	      return 'patch';
+	    }
+	  }
+
+	  // add the `pre` prefix if we are going to a prerelease version
+	  const prefix = highHasPre ? 'pre' : '';
+	  if (v1.major !== v2.major) {
+	    return prefix + 'major';
+	  }
+	  if (v1.minor !== v2.minor) {
+	    return prefix + 'minor';
+	  }
+	  if (v1.patch !== v2.patch) {
+	    return prefix + 'patch';
+	  }
+
+	  // high and low are preleases
+	  return 'prerelease';
+	};
+	diff_1 = diff;
+	return diff_1;
+}
+
+var major_1;
+var hasRequiredMajor;
+
+function requireMajor () {
+	if (hasRequiredMajor) return major_1;
+	hasRequiredMajor = 1;
+
+	const SemVer = requireSemver$1();
+	const major = (a, loose) => new SemVer(a, loose).major;
+	major_1 = major;
+	return major_1;
+}
+
+var minor_1;
+var hasRequiredMinor;
+
+function requireMinor () {
+	if (hasRequiredMinor) return minor_1;
+	hasRequiredMinor = 1;
+
+	const SemVer = requireSemver$1();
+	const minor = (a, loose) => new SemVer(a, loose).minor;
+	minor_1 = minor;
+	return minor_1;
+}
+
+var patch_1;
+var hasRequiredPatch;
+
+function requirePatch () {
+	if (hasRequiredPatch) return patch_1;
+	hasRequiredPatch = 1;
+
+	const SemVer = requireSemver$1();
+	const patch = (a, loose) => new SemVer(a, loose).patch;
+	patch_1 = patch;
+	return patch_1;
+}
+
+var prerelease_1;
+var hasRequiredPrerelease;
+
+function requirePrerelease () {
+	if (hasRequiredPrerelease) return prerelease_1;
+	hasRequiredPrerelease = 1;
+
+	const parse = requireParse();
+	const prerelease = (version, options) => {
+	  const parsed = parse(version, options);
+	  return parsed && parsed.prerelease.length ? parsed.prerelease : null;
+	};
+	prerelease_1 = prerelease;
+	return prerelease_1;
+}
+
+var compare_1;
+var hasRequiredCompare;
+
+function requireCompare () {
+	if (hasRequiredCompare) return compare_1;
+	hasRequiredCompare = 1;
+
+	const SemVer = requireSemver$1();
+	const compare = (a, b, loose) => new SemVer(a, loose).compare(new SemVer(b, loose));
+	compare_1 = compare;
+	return compare_1;
+}
+
+var rcompare_1;
+var hasRequiredRcompare;
+
+function requireRcompare () {
+	if (hasRequiredRcompare) return rcompare_1;
+	hasRequiredRcompare = 1;
+
+	const compare = requireCompare();
+	const rcompare = (a, b, loose) => compare(b, a, loose);
+	rcompare_1 = rcompare;
+	return rcompare_1;
+}
+
+var compareLoose_1;
+var hasRequiredCompareLoose;
+
+function requireCompareLoose () {
+	if (hasRequiredCompareLoose) return compareLoose_1;
+	hasRequiredCompareLoose = 1;
+
+	const compare = requireCompare();
+	const compareLoose = (a, b) => compare(a, b, true);
+	compareLoose_1 = compareLoose;
+	return compareLoose_1;
+}
+
+var compareBuild_1;
+var hasRequiredCompareBuild;
+
+function requireCompareBuild () {
+	if (hasRequiredCompareBuild) return compareBuild_1;
+	hasRequiredCompareBuild = 1;
+
+	const SemVer = requireSemver$1();
+	const compareBuild = (a, b, loose) => {
+	  const versionA = new SemVer(a, loose);
+	  const versionB = new SemVer(b, loose);
+	  return versionA.compare(versionB) || versionA.compareBuild(versionB);
+	};
+	compareBuild_1 = compareBuild;
+	return compareBuild_1;
+}
+
+var sort_1;
+var hasRequiredSort;
+
+function requireSort () {
+	if (hasRequiredSort) return sort_1;
+	hasRequiredSort = 1;
+
+	const compareBuild = requireCompareBuild();
+	const sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose));
+	sort_1 = sort;
+	return sort_1;
+}
+
+var rsort_1;
+var hasRequiredRsort;
+
+function requireRsort () {
+	if (hasRequiredRsort) return rsort_1;
+	hasRequiredRsort = 1;
+
+	const compareBuild = requireCompareBuild();
+	const rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose));
+	rsort_1 = rsort;
+	return rsort_1;
+}
+
+var gt_1;
+var hasRequiredGt;
+
+function requireGt () {
+	if (hasRequiredGt) return gt_1;
+	hasRequiredGt = 1;
+
+	const compare = requireCompare();
+	const gt = (a, b, loose) => compare(a, b, loose) > 0;
+	gt_1 = gt;
+	return gt_1;
+}
+
+var lt_1;
+var hasRequiredLt;
+
+function requireLt () {
+	if (hasRequiredLt) return lt_1;
+	hasRequiredLt = 1;
+
+	const compare = requireCompare();
+	const lt = (a, b, loose) => compare(a, b, loose) < 0;
+	lt_1 = lt;
+	return lt_1;
+}
+
+var eq_1;
+var hasRequiredEq;
+
+function requireEq () {
+	if (hasRequiredEq) return eq_1;
+	hasRequiredEq = 1;
+
+	const compare = requireCompare();
+	const eq = (a, b, loose) => compare(a, b, loose) === 0;
+	eq_1 = eq;
+	return eq_1;
+}
+
+var neq_1;
+var hasRequiredNeq;
+
+function requireNeq () {
+	if (hasRequiredNeq) return neq_1;
+	hasRequiredNeq = 1;
+
+	const compare = requireCompare();
+	const neq = (a, b, loose) => compare(a, b, loose) !== 0;
+	neq_1 = neq;
+	return neq_1;
+}
+
+var gte_1;
+var hasRequiredGte;
+
+function requireGte () {
+	if (hasRequiredGte) return gte_1;
+	hasRequiredGte = 1;
+
+	const compare = requireCompare();
+	const gte = (a, b, loose) => compare(a, b, loose) >= 0;
+	gte_1 = gte;
+	return gte_1;
+}
+
+var lte_1;
+var hasRequiredLte;
+
+function requireLte () {
+	if (hasRequiredLte) return lte_1;
+	hasRequiredLte = 1;
+
+	const compare = requireCompare();
+	const lte = (a, b, loose) => compare(a, b, loose) <= 0;
+	lte_1 = lte;
+	return lte_1;
+}
+
+var cmp_1;
+var hasRequiredCmp;
+
+function requireCmp () {
+	if (hasRequiredCmp) return cmp_1;
+	hasRequiredCmp = 1;
+
+	const eq = requireEq();
+	const neq = requireNeq();
+	const gt = requireGt();
+	const gte = requireGte();
+	const lt = requireLt();
+	const lte = requireLte();
+	const cmp = (a, op, b, loose) => {
+	  switch (op) {
+	    case '===':
+	      if (typeof a === 'object') {
+	        a = a.version;
+	      }
+	      if (typeof b === 'object') {
+	        b = b.version;
+	      }
+	      return a === b;
+	    case '!==':
+	      if (typeof a === 'object') {
+	        a = a.version;
+	      }
+	      if (typeof b === 'object') {
+	        b = b.version;
+	      }
+	      return a !== b;
+	    case '':
+	    case '=':
+	    case '==':
+	      return eq(a, b, loose);
+	    case '!=':
+	      return neq(a, b, loose);
+	    case '>':
+	      return gt(a, b, loose);
+	    case '>=':
+	      return gte(a, b, loose);
+	    case '<':
+	      return lt(a, b, loose);
+	    case '<=':
+	      return lte(a, b, loose);
+	    default:
+	      throw new TypeError(`Invalid operator: ${op}`);
+	  }
+	};
+	cmp_1 = cmp;
+	return cmp_1;
+}
+
+var coerce_1;
+var hasRequiredCoerce;
+
+function requireCoerce () {
+	if (hasRequiredCoerce) return coerce_1;
+	hasRequiredCoerce = 1;
+
+	const SemVer = requireSemver$1();
+	const parse = requireParse();
+	const {
+	  safeRe: re,
+	  t
+	} = requireRe();
+	const coerce = (version, options) => {
+	  if (version instanceof SemVer) {
+	    return version;
+	  }
+	  if (typeof version === 'number') {
+	    version = String(version);
+	  }
+	  if (typeof version !== 'string') {
+	    return null;
+	  }
+	  options = options || {};
+	  let match = null;
+	  if (!options.rtl) {
+	    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE]);
+	  } else {
+	    // Find the right-most coercible string that does not share
+	    // a terminus with a more left-ward coercible string.
+	    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'
+	    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'
+	    //
+	    // Walk through the string checking with a /g regexp
+	    // Manually set the index so as to pick up overlapping matches.
+	    // Stop when we get a match that ends at the string end, since no
+	    // coercible string can be more right-ward without the same terminus.
+	    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL];
+	    let next;
+	    while ((next = coerceRtlRegex.exec(version)) && (!match || match.index + match[0].length !== version.length)) {
+	      if (!match || next.index + next[0].length !== match.index + match[0].length) {
+	        match = next;
+	      }
+	      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length;
+	    }
+	    // leave it in a clean state
+	    coerceRtlRegex.lastIndex = -1;
+	  }
+	  if (match === null) {
+	    return null;
+	  }
+	  const major = match[2];
+	  const minor = match[3] || '0';
+	  const patch = match[4] || '0';
+	  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : '';
+	  const build = options.includePrerelease && match[6] ? `+${match[6]}` : '';
+	  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options);
+	};
+	coerce_1 = coerce;
+	return coerce_1;
+}
+
+var lrucache;
+var hasRequiredLrucache;
+
+function requireLrucache () {
+	if (hasRequiredLrucache) return lrucache;
+	hasRequiredLrucache = 1;
+
+	class LRUCache {
+	  constructor() {
+	    this.max = 1000;
+	    this.map = new Map();
+	  }
+	  get(key) {
+	    const value = this.map.get(key);
+	    if (value === undefined) {
+	      return undefined;
+	    } else {
+	      // Remove the key from the map and add it to the end
+	      this.map.delete(key);
+	      this.map.set(key, value);
+	      return value;
+	    }
+	  }
+	  delete(key) {
+	    return this.map.delete(key);
+	  }
+	  set(key, value) {
+	    const deleted = this.delete(key);
+	    if (!deleted && value !== undefined) {
+	      // If cache is full, delete the least recently used item
+	      if (this.map.size >= this.max) {
+	        const firstKey = this.map.keys().next().value;
+	        this.delete(firstKey);
+	      }
+	      this.map.set(key, value);
+	    }
+	    return this;
+	  }
+	}
+	lrucache = LRUCache;
+	return lrucache;
+}
+
+var range;
+var hasRequiredRange;
+
+function requireRange () {
+	if (hasRequiredRange) return range;
+	hasRequiredRange = 1;
+
+	const SPACE_CHARACTERS = /\s+/g;
+
+	// hoisted class for cyclic dependency
+	class Range {
+	  constructor(range, options) {
+	    options = parseOptions(options);
+	    if (range instanceof Range) {
+	      if (range.loose === !!options.loose && range.includePrerelease === !!options.includePrerelease) {
+	        return range;
+	      } else {
+	        return new Range(range.raw, options);
+	      }
+	    }
+	    if (range instanceof Comparator) {
+	      // just put it in the set and return
+	      this.raw = range.value;
+	      this.set = [[range]];
+	      this.formatted = undefined;
+	      return this;
+	    }
+	    this.options = options;
+	    this.loose = !!options.loose;
+	    this.includePrerelease = !!options.includePrerelease;
+
+	    // First reduce all whitespace as much as possible so we do not have to rely
+	    // on potentially slow regexes like \s*. This is then stored and used for
+	    // future error messages as well.
+	    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ');
+
+	    // First, split on ||
+	    this.set = this.raw.split('||')
+	    // map the range to a 2d array of comparators
+	    .map(r => this.parseRange(r.trim()))
+	    // throw out any comparator lists that are empty
+	    // this generally means that it was not a valid range, which is allowed
+	    // in loose mode, but will still throw if the WHOLE range is invalid.
+	    .filter(c => c.length);
+	    if (!this.set.length) {
+	      throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
+	    }
+
+	    // if we have any that are not the null set, throw out null sets.
+	    if (this.set.length > 1) {
+	      // keep the first one, in case they're all null sets
+	      const first = this.set[0];
+	      this.set = this.set.filter(c => !isNullSet(c[0]));
+	      if (this.set.length === 0) {
+	        this.set = [first];
+	      } else if (this.set.length > 1) {
+	        // if we have any that are *, then the range is just *
+	        for (const c of this.set) {
+	          if (c.length === 1 && isAny(c[0])) {
+	            this.set = [c];
+	            break;
+	          }
+	        }
+	      }
+	    }
+	    this.formatted = undefined;
+	  }
+	  get range() {
+	    if (this.formatted === undefined) {
+	      this.formatted = '';
+	      for (let i = 0; i < this.set.length; i++) {
+	        if (i > 0) {
+	          this.formatted += '||';
+	        }
+	        const comps = this.set[i];
+	        for (let k = 0; k < comps.length; k++) {
+	          if (k > 0) {
+	            this.formatted += ' ';
+	          }
+	          this.formatted += comps[k].toString().trim();
+	        }
+	      }
+	    }
+	    return this.formatted;
+	  }
+	  format() {
+	    return this.range;
+	  }
+	  toString() {
+	    return this.range;
+	  }
+	  parseRange(range) {
+	    // memoize range parsing for performance.
+	    // this is a very hot path, and fully deterministic.
+	    const memoOpts = (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) | (this.options.loose && FLAG_LOOSE);
+	    const memoKey = memoOpts + ':' + range;
+	    const cached = cache.get(memoKey);
+	    if (cached) {
+	      return cached;
+	    }
+	    const loose = this.options.loose;
+	    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`
+	    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE];
+	    range = range.replace(hr, hyphenReplace(this.options.includePrerelease));
+	    debug('hyphen replace', range);
+
+	    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
+	    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace);
+	    debug('comparator trim', range);
+
+	    // `~ 1.2.3` => `~1.2.3`
+	    range = range.replace(re[t.TILDETRIM], tildeTrimReplace);
+	    debug('tilde trim', range);
+
+	    // `^ 1.2.3` => `^1.2.3`
+	    range = range.replace(re[t.CARETTRIM], caretTrimReplace);
+	    debug('caret trim', range);
+
+	    // At this point, the range is completely trimmed and
+	    // ready to be split into comparators.
+
+	    let rangeList = range.split(' ').map(comp => parseComparator(comp, this.options)).join(' ').split(/\s+/)
+	    // >=0.0.0 is equivalent to *
+	    .map(comp => replaceGTE0(comp, this.options));
+	    if (loose) {
+	      // in loose mode, throw out any that are not valid comparators
+	      rangeList = rangeList.filter(comp => {
+	        debug('loose invalid filter', comp, this.options);
+	        return !!comp.match(re[t.COMPARATORLOOSE]);
+	      });
+	    }
+	    debug('range list', rangeList);
+
+	    // if any comparators are the null set, then replace with JUST null set
+	    // if more than one comparator, remove any * comparators
+	    // also, don't include the same comparator more than once
+	    const rangeMap = new Map();
+	    const comparators = rangeList.map(comp => new Comparator(comp, this.options));
+	    for (const comp of comparators) {
+	      if (isNullSet(comp)) {
+	        return [comp];
+	      }
+	      rangeMap.set(comp.value, comp);
+	    }
+	    if (rangeMap.size > 1 && rangeMap.has('')) {
+	      rangeMap.delete('');
+	    }
+	    const result = [...rangeMap.values()];
+	    cache.set(memoKey, result);
+	    return result;
+	  }
+	  intersects(range, options) {
+	    if (!(range instanceof Range)) {
+	      throw new TypeError('a Range is required');
+	    }
+	    return this.set.some(thisComparators => {
+	      return isSatisfiable(thisComparators, options) && range.set.some(rangeComparators => {
+	        return isSatisfiable(rangeComparators, options) && thisComparators.every(thisComparator => {
+	          return rangeComparators.every(rangeComparator => {
+	            return thisComparator.intersects(rangeComparator, options);
+	          });
+	        });
+	      });
+	    });
+	  }
+
+	  // if ANY of the sets match ALL of its comparators, then pass
+	  test(version) {
+	    if (!version) {
+	      return false;
+	    }
+	    if (typeof version === 'string') {
+	      try {
+	        version = new SemVer(version, this.options);
+	      } catch (er) {
+	        return false;
+	      }
+	    }
+	    for (let i = 0; i < this.set.length; i++) {
+	      if (testSet(this.set[i], version, this.options)) {
+	        return true;
+	      }
+	    }
+	    return false;
+	  }
+	}
+	range = Range;
+	const LRU = requireLrucache();
+	const cache = new LRU();
+	const parseOptions = requireParseOptions();
+	const Comparator = requireComparator();
+	const debug = requireDebug();
+	const SemVer = requireSemver$1();
+	const {
+	  safeRe: re,
+	  t,
+	  comparatorTrimReplace,
+	  tildeTrimReplace,
+	  caretTrimReplace
+	} = requireRe();
+	const {
+	  FLAG_INCLUDE_PRERELEASE,
+	  FLAG_LOOSE
+	} = requireConstants();
+	const isNullSet = c => c.value === '<0.0.0-0';
+	const isAny = c => c.value === '';
+
+	// take a set of comparators and determine whether there
+	// exists a version which can satisfy it
+	const isSatisfiable = (comparators, options) => {
+	  let result = true;
+	  const remainingComparators = comparators.slice();
+	  let testComparator = remainingComparators.pop();
+	  while (result && remainingComparators.length) {
+	    result = remainingComparators.every(otherComparator => {
+	      return testComparator.intersects(otherComparator, options);
+	    });
+	    testComparator = remainingComparators.pop();
+	  }
+	  return result;
+	};
+
+	// comprised of xranges, tildes, stars, and gtlt's at this point.
+	// already replaced the hyphen ranges
+	// turn into a set of JUST comparators.
+	const parseComparator = (comp, options) => {
+	  debug('comp', comp, options);
+	  comp = replaceCarets(comp, options);
+	  debug('caret', comp);
+	  comp = replaceTildes(comp, options);
+	  debug('tildes', comp);
+	  comp = replaceXRanges(comp, options);
+	  debug('xrange', comp);
+	  comp = replaceStars(comp, options);
+	  debug('stars', comp);
+	  return comp;
+	};
+	const isX = id => !id || id.toLowerCase() === 'x' || id === '*';
+
+	// ~, ~> --> * (any, kinda silly)
+	// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0
+	// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0
+	// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0
+	// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0
+	// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0
+	// ~0.0.1 --> >=0.0.1 <0.1.0-0
+	const replaceTildes = (comp, options) => {
+	  return comp.trim().split(/\s+/).map(c => replaceTilde(c, options)).join(' ');
+	};
+	const replaceTilde = (comp, options) => {
+	  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE];
+	  return comp.replace(r, (_, M, m, p, pr) => {
+	    debug('tilde', comp, _, M, m, p, pr);
+	    let ret;
+	    if (isX(M)) {
+	      ret = '';
+	    } else if (isX(m)) {
+	      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`;
+	    } else if (isX(p)) {
+	      // ~1.2 == >=1.2.0 <1.3.0-0
+	      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`;
+	    } else if (pr) {
+	      debug('replaceTilde pr', pr);
+	      ret = `>=${M}.${m}.${p}-${pr} <${M}.${+m + 1}.0-0`;
+	    } else {
+	      // ~1.2.3 == >=1.2.3 <1.3.0-0
+	      ret = `>=${M}.${m}.${p} <${M}.${+m + 1}.0-0`;
+	    }
+	    debug('tilde return', ret);
+	    return ret;
+	  });
+	};
+
+	// ^ --> * (any, kinda silly)
+	// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0
+	// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0
+	// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0
+	// ^1.2.3 --> >=1.2.3 <2.0.0-0
+	// ^1.2.0 --> >=1.2.0 <2.0.0-0
+	// ^0.0.1 --> >=0.0.1 <0.0.2-0
+	// ^0.1.0 --> >=0.1.0 <0.2.0-0
+	const replaceCarets = (comp, options) => {
+	  return comp.trim().split(/\s+/).map(c => replaceCaret(c, options)).join(' ');
+	};
+	const replaceCaret = (comp, options) => {
+	  debug('caret', comp, options);
+	  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET];
+	  const z = options.includePrerelease ? '-0' : '';
+	  return comp.replace(r, (_, M, m, p, pr) => {
+	    debug('caret', comp, _, M, m, p, pr);
+	    let ret;
+	    if (isX(M)) {
+	      ret = '';
+	    } else if (isX(m)) {
+	      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`;
+	    } else if (isX(p)) {
+	      if (M === '0') {
+	        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`;
+	      } else {
+	        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`;
+	      }
+	    } else if (pr) {
+	      debug('replaceCaret pr', pr);
+	      if (M === '0') {
+	        if (m === '0') {
+	          ret = `>=${M}.${m}.${p}-${pr} <${M}.${m}.${+p + 1}-0`;
+	        } else {
+	          ret = `>=${M}.${m}.${p}-${pr} <${M}.${+m + 1}.0-0`;
+	        }
+	      } else {
+	        ret = `>=${M}.${m}.${p}-${pr} <${+M + 1}.0.0-0`;
+	      }
+	    } else {
+	      debug('no pr');
+	      if (M === '0') {
+	        if (m === '0') {
+	          ret = `>=${M}.${m}.${p}${z} <${M}.${m}.${+p + 1}-0`;
+	        } else {
+	          ret = `>=${M}.${m}.${p}${z} <${M}.${+m + 1}.0-0`;
+	        }
+	      } else {
+	        ret = `>=${M}.${m}.${p} <${+M + 1}.0.0-0`;
+	      }
+	    }
+	    debug('caret return', ret);
+	    return ret;
+	  });
+	};
+	const replaceXRanges = (comp, options) => {
+	  debug('replaceXRanges', comp, options);
+	  return comp.split(/\s+/).map(c => replaceXRange(c, options)).join(' ');
+	};
+	const replaceXRange = (comp, options) => {
+	  comp = comp.trim();
+	  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE];
+	  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {
+	    debug('xRange', comp, ret, gtlt, M, m, p, pr);
+	    const xM = isX(M);
+	    const xm = xM || isX(m);
+	    const xp = xm || isX(p);
+	    const anyX = xp;
+	    if (gtlt === '=' && anyX) {
+	      gtlt = '';
+	    }
+
+	    // if we're including prereleases in the match, then we need
+	    // to fix this to -0, the lowest possible prerelease value
+	    pr = options.includePrerelease ? '-0' : '';
+	    if (xM) {
+	      if (gtlt === '>' || gtlt === '<') {
+	        // nothing is allowed
+	        ret = '<0.0.0-0';
+	      } else {
+	        // nothing is forbidden
+	        ret = '*';
+	      }
+	    } else if (gtlt && anyX) {
+	      // we know patch is an x, because we have any x at all.
+	      // replace X with 0
+	      if (xm) {
+	        m = 0;
+	      }
+	      p = 0;
+	      if (gtlt === '>') {
+	        // >1 => >=2.0.0
+	        // >1.2 => >=1.3.0
+	        gtlt = '>=';
+	        if (xm) {
+	          M = +M + 1;
+	          m = 0;
+	          p = 0;
+	        } else {
+	          m = +m + 1;
+	          p = 0;
+	        }
+	      } else if (gtlt === '<=') {
+	        // <=0.7.x is actually <0.8.0, since any 0.7.x should
+	        // pass.  Similarly, <=7.x is actually <8.0.0, etc.
+	        gtlt = '<';
+	        if (xm) {
+	          M = +M + 1;
+	        } else {
+	          m = +m + 1;
+	        }
+	      }
+	      if (gtlt === '<') {
+	        pr = '-0';
+	      }
+	      ret = `${gtlt + M}.${m}.${p}${pr}`;
+	    } else if (xm) {
+	      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`;
+	    } else if (xp) {
+	      ret = `>=${M}.${m}.0${pr} <${M}.${+m + 1}.0-0`;
+	    }
+	    debug('xRange return', ret);
+	    return ret;
+	  });
+	};
+
+	// Because * is AND-ed with everything else in the comparator,
+	// and '' means "any version", just remove the *s entirely.
+	const replaceStars = (comp, options) => {
+	  debug('replaceStars', comp, options);
+	  // Looseness is ignored here.  star is always as loose as it gets!
+	  return comp.trim().replace(re[t.STAR], '');
+	};
+	const replaceGTE0 = (comp, options) => {
+	  debug('replaceGTE0', comp, options);
+	  return comp.trim().replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '');
+	};
+
+	// This function is passed to string.replace(re[t.HYPHENRANGE])
+	// M, m, patch, prerelease, build
+	// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5
+	// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do
+	// 1.2 - 3.4 => >=1.2.0 <3.5.0-0
+	// TODO build?
+	const hyphenReplace = incPr => ($0, from, fM, fm, fp, fpr, fb, to, tM, tm, tp, tpr) => {
+	  if (isX(fM)) {
+	    from = '';
+	  } else if (isX(fm)) {
+	    from = `>=${fM}.0.0${incPr ? '-0' : ''}`;
+	  } else if (isX(fp)) {
+	    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`;
+	  } else if (fpr) {
+	    from = `>=${from}`;
+	  } else {
+	    from = `>=${from}${incPr ? '-0' : ''}`;
+	  }
+	  if (isX(tM)) {
+	    to = '';
+	  } else if (isX(tm)) {
+	    to = `<${+tM + 1}.0.0-0`;
+	  } else if (isX(tp)) {
+	    to = `<${tM}.${+tm + 1}.0-0`;
+	  } else if (tpr) {
+	    to = `<=${tM}.${tm}.${tp}-${tpr}`;
+	  } else if (incPr) {
+	    to = `<${tM}.${tm}.${+tp + 1}-0`;
+	  } else {
+	    to = `<=${to}`;
+	  }
+	  return `${from} ${to}`.trim();
+	};
+	const testSet = (set, version, options) => {
+	  for (let i = 0; i < set.length; i++) {
+	    if (!set[i].test(version)) {
+	      return false;
+	    }
+	  }
+	  if (version.prerelease.length && !options.includePrerelease) {
+	    // Find the set of versions that are allowed to have prereleases
+	    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0
+	    // That should allow `1.2.3-pr.2` to pass.
+	    // However, `1.2.4-alpha.notready` should NOT be allowed,
+	    // even though it's within the range set by the comparators.
+	    for (let i = 0; i < set.length; i++) {
+	      debug(set[i].semver);
+	      if (set[i].semver === Comparator.ANY) {
+	        continue;
+	      }
+	      if (set[i].semver.prerelease.length > 0) {
+	        const allowed = set[i].semver;
+	        if (allowed.major === version.major && allowed.minor === version.minor && allowed.patch === version.patch) {
+	          return true;
+	        }
+	      }
+	    }
+
+	    // Version has a -pre, but it's not one of the ones we like.
+	    return false;
+	  }
+	  return true;
+	};
+	return range;
+}
+
+var comparator;
+var hasRequiredComparator;
+
+function requireComparator () {
+	if (hasRequiredComparator) return comparator;
+	hasRequiredComparator = 1;
+
+	const ANY = Symbol('SemVer ANY');
+	// hoisted class for cyclic dependency
+	class Comparator {
+	  static get ANY() {
+	    return ANY;
+	  }
+	  constructor(comp, options) {
+	    options = parseOptions(options);
+	    if (comp instanceof Comparator) {
+	      if (comp.loose === !!options.loose) {
+	        return comp;
+	      } else {
+	        comp = comp.value;
+	      }
+	    }
+	    comp = comp.trim().split(/\s+/).join(' ');
+	    debug('comparator', comp, options);
+	    this.options = options;
+	    this.loose = !!options.loose;
+	    this.parse(comp);
+	    if (this.semver === ANY) {
+	      this.value = '';
+	    } else {
+	      this.value = this.operator + this.semver.version;
+	    }
+	    debug('comp', this);
+	  }
+	  parse(comp) {
+	    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR];
+	    const m = comp.match(r);
+	    if (!m) {
+	      throw new TypeError(`Invalid comparator: ${comp}`);
+	    }
+	    this.operator = m[1] !== undefined ? m[1] : '';
+	    if (this.operator === '=') {
+	      this.operator = '';
+	    }
+
+	    // if it literally is just '>' or '' then allow anything.
+	    if (!m[2]) {
+	      this.semver = ANY;
+	    } else {
+	      this.semver = new SemVer(m[2], this.options.loose);
+	    }
+	  }
+	  toString() {
+	    return this.value;
+	  }
+	  test(version) {
+	    debug('Comparator.test', version, this.options.loose);
+	    if (this.semver === ANY || version === ANY) {
+	      return true;
+	    }
+	    if (typeof version === 'string') {
+	      try {
+	        version = new SemVer(version, this.options);
+	      } catch (er) {
+	        return false;
+	      }
+	    }
+	    return cmp(version, this.operator, this.semver, this.options);
+	  }
+	  intersects(comp, options) {
+	    if (!(comp instanceof Comparator)) {
+	      throw new TypeError('a Comparator is required');
+	    }
+	    if (this.operator === '') {
+	      if (this.value === '') {
+	        return true;
+	      }
+	      return new Range(comp.value, options).test(this.value);
+	    } else if (comp.operator === '') {
+	      if (comp.value === '') {
+	        return true;
+	      }
+	      return new Range(this.value, options).test(comp.semver);
+	    }
+	    options = parseOptions(options);
+
+	    // Special cases where nothing can possibly be lower
+	    if (options.includePrerelease && (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {
+	      return false;
+	    }
+	    if (!options.includePrerelease && (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {
+	      return false;
+	    }
+
+	    // Same direction increasing (> or >=)
+	    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {
+	      return true;
+	    }
+	    // Same direction decreasing (< or <=)
+	    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {
+	      return true;
+	    }
+	    // same SemVer and both sides are inclusive (<= or >=)
+	    if (this.semver.version === comp.semver.version && this.operator.includes('=') && comp.operator.includes('=')) {
+	      return true;
+	    }
+	    // opposite directions less than
+	    if (cmp(this.semver, '<', comp.semver, options) && this.operator.startsWith('>') && comp.operator.startsWith('<')) {
+	      return true;
+	    }
+	    // opposite directions greater than
+	    if (cmp(this.semver, '>', comp.semver, options) && this.operator.startsWith('<') && comp.operator.startsWith('>')) {
+	      return true;
+	    }
+	    return false;
+	  }
+	}
+	comparator = Comparator;
+	const parseOptions = requireParseOptions();
+	const {
+	  safeRe: re,
+	  t
+	} = requireRe();
+	const cmp = requireCmp();
+	const debug = requireDebug();
+	const SemVer = requireSemver$1();
+	const Range = requireRange();
+	return comparator;
+}
+
+var satisfies_1;
+var hasRequiredSatisfies;
+
+function requireSatisfies () {
+	if (hasRequiredSatisfies) return satisfies_1;
+	hasRequiredSatisfies = 1;
+
+	const Range = requireRange();
+	const satisfies = (version, range, options) => {
+	  try {
+	    range = new Range(range, options);
+	  } catch (er) {
+	    return false;
+	  }
+	  return range.test(version);
+	};
+	satisfies_1 = satisfies;
+	return satisfies_1;
+}
+
+var toComparators_1;
+var hasRequiredToComparators;
+
+function requireToComparators () {
+	if (hasRequiredToComparators) return toComparators_1;
+	hasRequiredToComparators = 1;
+
+	const Range = requireRange();
+
+	// Mostly just for testing and legacy API reasons
+	const toComparators = (range, options) => new Range(range, options).set.map(comp => comp.map(c => c.value).join(' ').trim().split(' '));
+	toComparators_1 = toComparators;
+	return toComparators_1;
+}
+
+var maxSatisfying_1;
+var hasRequiredMaxSatisfying;
+
+function requireMaxSatisfying () {
+	if (hasRequiredMaxSatisfying) return maxSatisfying_1;
+	hasRequiredMaxSatisfying = 1;
+
+	const SemVer = requireSemver$1();
+	const Range = requireRange();
+	const maxSatisfying = (versions, range, options) => {
+	  let max = null;
+	  let maxSV = null;
+	  let rangeObj = null;
+	  try {
+	    rangeObj = new Range(range, options);
+	  } catch (er) {
+	    return null;
+	  }
+	  versions.forEach(v => {
+	    if (rangeObj.test(v)) {
+	      // satisfies(v, range, options)
+	      if (!max || maxSV.compare(v) === -1) {
+	        // compare(max, v, true)
+	        max = v;
+	        maxSV = new SemVer(max, options);
+	      }
+	    }
+	  });
+	  return max;
+	};
+	maxSatisfying_1 = maxSatisfying;
+	return maxSatisfying_1;
+}
+
+var minSatisfying_1;
+var hasRequiredMinSatisfying;
+
+function requireMinSatisfying () {
+	if (hasRequiredMinSatisfying) return minSatisfying_1;
+	hasRequiredMinSatisfying = 1;
+
+	const SemVer = requireSemver$1();
+	const Range = requireRange();
+	const minSatisfying = (versions, range, options) => {
+	  let min = null;
+	  let minSV = null;
+	  let rangeObj = null;
+	  try {
+	    rangeObj = new Range(range, options);
+	  } catch (er) {
+	    return null;
+	  }
+	  versions.forEach(v => {
+	    if (rangeObj.test(v)) {
+	      // satisfies(v, range, options)
+	      if (!min || minSV.compare(v) === 1) {
+	        // compare(min, v, true)
+	        min = v;
+	        minSV = new SemVer(min, options);
+	      }
+	    }
+	  });
+	  return min;
+	};
+	minSatisfying_1 = minSatisfying;
+	return minSatisfying_1;
+}
+
+var minVersion_1;
+var hasRequiredMinVersion;
+
+function requireMinVersion () {
+	if (hasRequiredMinVersion) return minVersion_1;
+	hasRequiredMinVersion = 1;
+
+	const SemVer = requireSemver$1();
+	const Range = requireRange();
+	const gt = requireGt();
+	const minVersion = (range, loose) => {
+	  range = new Range(range, loose);
+	  let minver = new SemVer('0.0.0');
+	  if (range.test(minver)) {
+	    return minver;
+	  }
+	  minver = new SemVer('0.0.0-0');
+	  if (range.test(minver)) {
+	    return minver;
+	  }
+	  minver = null;
+	  for (let i = 0; i < range.set.length; ++i) {
+	    const comparators = range.set[i];
+	    let setMin = null;
+	    comparators.forEach(comparator => {
+	      // Clone to avoid manipulating the comparator's semver object.
+	      const compver = new SemVer(comparator.semver.version);
+	      switch (comparator.operator) {
+	        case '>':
+	          if (compver.prerelease.length === 0) {
+	            compver.patch++;
+	          } else {
+	            compver.prerelease.push(0);
+	          }
+	          compver.raw = compver.format();
+	        /* fallthrough */
+	        case '':
+	        case '>=':
+	          if (!setMin || gt(compver, setMin)) {
+	            setMin = compver;
+	          }
+	          break;
+	        case '<':
+	        case '<=':
+	          /* Ignore maximum versions */
+	          break;
+	        /* istanbul ignore next */
+	        default:
+	          throw new Error(`Unexpected operation: ${comparator.operator}`);
+	      }
+	    });
+	    if (setMin && (!minver || gt(minver, setMin))) {
+	      minver = setMin;
+	    }
+	  }
+	  if (minver && range.test(minver)) {
+	    return minver;
+	  }
+	  return null;
+	};
+	minVersion_1 = minVersion;
+	return minVersion_1;
+}
+
+var valid;
+var hasRequiredValid;
+
+function requireValid () {
+	if (hasRequiredValid) return valid;
+	hasRequiredValid = 1;
+
+	const Range = requireRange();
+	const validRange = (range, options) => {
+	  try {
+	    // Return '*' instead of '' so that truthiness works.
+	    // This will throw if it's invalid anyway
+	    return new Range(range, options).range || '*';
+	  } catch (er) {
+	    return null;
+	  }
+	};
+	valid = validRange;
+	return valid;
+}
+
+var outside_1;
+var hasRequiredOutside;
+
+function requireOutside () {
+	if (hasRequiredOutside) return outside_1;
+	hasRequiredOutside = 1;
+
+	const SemVer = requireSemver$1();
+	const Comparator = requireComparator();
+	const {
+	  ANY
+	} = Comparator;
+	const Range = requireRange();
+	const satisfies = requireSatisfies();
+	const gt = requireGt();
+	const lt = requireLt();
+	const lte = requireLte();
+	const gte = requireGte();
+	const outside = (version, range, hilo, options) => {
+	  version = new SemVer(version, options);
+	  range = new Range(range, options);
+	  let gtfn, ltefn, ltfn, comp, ecomp;
+	  switch (hilo) {
+	    case '>':
+	      gtfn = gt;
+	      ltefn = lte;
+	      ltfn = lt;
+	      comp = '>';
+	      ecomp = '>=';
+	      break;
+	    case '<':
+	      gtfn = lt;
+	      ltefn = gte;
+	      ltfn = gt;
+	      comp = '<';
+	      ecomp = '<=';
+	      break;
+	    default:
+	      throw new TypeError('Must provide a hilo val of "<" or ">"');
+	  }
+
+	  // If it satisfies the range it is not outside
+	  if (satisfies(version, range, options)) {
+	    return false;
+	  }
+
+	  // From now on, variable terms are as if we're in "gtr" mode.
+	  // but note that everything is flipped for the "ltr" function.
+
+	  for (let i = 0; i < range.set.length; ++i) {
+	    const comparators = range.set[i];
+	    let high = null;
+	    let low = null;
+	    comparators.forEach(comparator => {
+	      if (comparator.semver === ANY) {
+	        comparator = new Comparator('>=0.0.0');
+	      }
+	      high = high || comparator;
+	      low = low || comparator;
+	      if (gtfn(comparator.semver, high.semver, options)) {
+	        high = comparator;
+	      } else if (ltfn(comparator.semver, low.semver, options)) {
+	        low = comparator;
+	      }
+	    });
+
+	    // If the edge version comparator has a operator then our version
+	    // isn't outside it
+	    if (high.operator === comp || high.operator === ecomp) {
+	      return false;
+	    }
+
+	    // If the lowest version comparator has an operator and our version
+	    // is less than it then it isn't higher than the range
+	    if ((!low.operator || low.operator === comp) && ltefn(version, low.semver)) {
+	      return false;
+	    } else if (low.operator === ecomp && ltfn(version, low.semver)) {
+	      return false;
+	    }
+	  }
+	  return true;
+	};
+	outside_1 = outside;
+	return outside_1;
+}
+
+var gtr_1;
+var hasRequiredGtr;
+
+function requireGtr () {
+	if (hasRequiredGtr) return gtr_1;
+	hasRequiredGtr = 1;
+
+	// Determine if version is greater than all the versions possible in the range.
+	const outside = requireOutside();
+	const gtr = (version, range, options) => outside(version, range, '>', options);
+	gtr_1 = gtr;
+	return gtr_1;
+}
+
+var ltr_1;
+var hasRequiredLtr;
+
+function requireLtr () {
+	if (hasRequiredLtr) return ltr_1;
+	hasRequiredLtr = 1;
+
+	const outside = requireOutside();
+	// Determine if version is less than all the versions possible in the range
+	const ltr = (version, range, options) => outside(version, range, '<', options);
+	ltr_1 = ltr;
+	return ltr_1;
+}
+
+var intersects_1;
+var hasRequiredIntersects;
+
+function requireIntersects () {
+	if (hasRequiredIntersects) return intersects_1;
+	hasRequiredIntersects = 1;
+
+	const Range = requireRange();
+	const intersects = (r1, r2, options) => {
+	  r1 = new Range(r1, options);
+	  r2 = new Range(r2, options);
+	  return r1.intersects(r2, options);
+	};
+	intersects_1 = intersects;
+	return intersects_1;
+}
+
+var simplify;
+var hasRequiredSimplify;
+
+function requireSimplify () {
+	if (hasRequiredSimplify) return simplify;
+	hasRequiredSimplify = 1;
+
+	// given a set of versions and a range, create a "simplified" range
+	// that includes the same versions that the original range does
+	// If the original range is shorter than the simplified one, return that.
+	const satisfies = requireSatisfies();
+	const compare = requireCompare();
+	simplify = (versions, range, options) => {
+	  const set = [];
+	  let first = null;
+	  let prev = null;
+	  const v = versions.sort((a, b) => compare(a, b, options));
+	  for (const version of v) {
+	    const included = satisfies(version, range, options);
+	    if (included) {
+	      prev = version;
+	      if (!first) {
+	        first = version;
+	      }
+	    } else {
+	      if (prev) {
+	        set.push([first, prev]);
+	      }
+	      prev = null;
+	      first = null;
+	    }
+	  }
+	  if (first) {
+	    set.push([first, null]);
+	  }
+	  const ranges = [];
+	  for (const [min, max] of set) {
+	    if (min === max) {
+	      ranges.push(min);
+	    } else if (!max && min === v[0]) {
+	      ranges.push('*');
+	    } else if (!max) {
+	      ranges.push(`>=${min}`);
+	    } else if (min === v[0]) {
+	      ranges.push(`<=${max}`);
+	    } else {
+	      ranges.push(`${min} - ${max}`);
+	    }
+	  }
+	  const simplified = ranges.join(' || ');
+	  const original = typeof range.raw === 'string' ? range.raw : String(range);
+	  return simplified.length < original.length ? simplified : range;
+	};
+	return simplify;
+}
+
+var subset_1;
+var hasRequiredSubset;
+
+function requireSubset () {
+	if (hasRequiredSubset) return subset_1;
+	hasRequiredSubset = 1;
+
+	const Range = requireRange();
+	const Comparator = requireComparator();
+	const {
+	  ANY
+	} = Comparator;
+	const satisfies = requireSatisfies();
+	const compare = requireCompare();
+
+	// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:
+	// - Every simple range `r1, r2, ...` is a null set, OR
+	// - Every simple range `r1, r2, ...` which is not a null set is a subset of
+	//   some `R1, R2, ...`
+	//
+	// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:
+	// - If c is only the ANY comparator
+	//   - If C is only the ANY comparator, return true
+	//   - Else if in prerelease mode, return false
+	//   - else replace c with `[>=0.0.0]`
+	// - If C is only the ANY comparator
+	//   - if in prerelease mode, return true
+	//   - else replace C with `[>=0.0.0]`
+	// - Let EQ be the set of = comparators in c
+	// - If EQ is more than one, return true (null set)
+	// - Let GT be the highest > or >= comparator in c
+	// - Let LT be the lowest < or <= comparator in c
+	// - If GT and LT, and GT.semver > LT.semver, return true (null set)
+	// - If any C is a = range, and GT or LT are set, return false
+	// - If EQ
+	//   - If GT, and EQ does not satisfy GT, return true (null set)
+	//   - If LT, and EQ does not satisfy LT, return true (null set)
+	//   - If EQ satisfies every C, return true
+	//   - Else return false
+	// - If GT
+	//   - If GT.semver is lower than any > or >= comp in C, return false
+	//   - If GT is >=, and GT.semver does not satisfy every C, return false
+	//   - If GT.semver has a prerelease, and not in prerelease mode
+	//     - If no C has a prerelease and the GT.semver tuple, return false
+	// - If LT
+	//   - If LT.semver is greater than any < or <= comp in C, return false
+	//   - If LT is <=, and LT.semver does not satisfy every C, return false
+	//   - If GT.semver has a prerelease, and not in prerelease mode
+	//     - If no C has a prerelease and the LT.semver tuple, return false
+	// - Else return true
+
+	const subset = (sub, dom, options = {}) => {
+	  if (sub === dom) {
+	    return true;
+	  }
+	  sub = new Range(sub, options);
+	  dom = new Range(dom, options);
+	  let sawNonNull = false;
+	  OUTER: for (const simpleSub of sub.set) {
+	    for (const simpleDom of dom.set) {
+	      const isSub = simpleSubset(simpleSub, simpleDom, options);
+	      sawNonNull = sawNonNull || isSub !== null;
+	      if (isSub) {
+	        continue OUTER;
+	      }
+	    }
+	    // the null set is a subset of everything, but null simple ranges in
+	    // a complex range should be ignored.  so if we saw a non-null range,
+	    // then we know this isn't a subset, but if EVERY simple range was null,
+	    // then it is a subset.
+	    if (sawNonNull) {
+	      return false;
+	    }
+	  }
+	  return true;
+	};
+	const minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')];
+	const minimumVersion = [new Comparator('>=0.0.0')];
+	const simpleSubset = (sub, dom, options) => {
+	  if (sub === dom) {
+	    return true;
+	  }
+	  if (sub.length === 1 && sub[0].semver === ANY) {
+	    if (dom.length === 1 && dom[0].semver === ANY) {
+	      return true;
+	    } else if (options.includePrerelease) {
+	      sub = minimumVersionWithPreRelease;
+	    } else {
+	      sub = minimumVersion;
+	    }
+	  }
+	  if (dom.length === 1 && dom[0].semver === ANY) {
+	    if (options.includePrerelease) {
+	      return true;
+	    } else {
+	      dom = minimumVersion;
+	    }
+	  }
+	  const eqSet = new Set();
+	  let gt, lt;
+	  for (const c of sub) {
+	    if (c.operator === '>' || c.operator === '>=') {
+	      gt = higherGT(gt, c, options);
+	    } else if (c.operator === '<' || c.operator === '<=') {
+	      lt = lowerLT(lt, c, options);
+	    } else {
+	      eqSet.add(c.semver);
+	    }
+	  }
+	  if (eqSet.size > 1) {
+	    return null;
+	  }
+	  let gtltComp;
+	  if (gt && lt) {
+	    gtltComp = compare(gt.semver, lt.semver, options);
+	    if (gtltComp > 0) {
+	      return null;
+	    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {
+	      return null;
+	    }
+	  }
+
+	  // will iterate one or zero times
+	  for (const eq of eqSet) {
+	    if (gt && !satisfies(eq, String(gt), options)) {
+	      return null;
+	    }
+	    if (lt && !satisfies(eq, String(lt), options)) {
+	      return null;
+	    }
+	    for (const c of dom) {
+	      if (!satisfies(eq, String(c), options)) {
+	        return false;
+	      }
+	    }
+	    return true;
+	  }
+	  let higher, lower;
+	  let hasDomLT, hasDomGT;
+	  // if the subset has a prerelease, we need a comparator in the superset
+	  // with the same tuple and a prerelease, or it's not a subset
+	  let needDomLTPre = lt && !options.includePrerelease && lt.semver.prerelease.length ? lt.semver : false;
+	  let needDomGTPre = gt && !options.includePrerelease && gt.semver.prerelease.length ? gt.semver : false;
+	  // exception: <1.2.3-0 is the same as <1.2.3
+	  if (needDomLTPre && needDomLTPre.prerelease.length === 1 && lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {
+	    needDomLTPre = false;
+	  }
+	  for (const c of dom) {
+	    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>=';
+	    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<=';
+	    if (gt) {
+	      if (needDomGTPre) {
+	        if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomGTPre.major && c.semver.minor === needDomGTPre.minor && c.semver.patch === needDomGTPre.patch) {
+	          needDomGTPre = false;
+	        }
+	      }
+	      if (c.operator === '>' || c.operator === '>=') {
+	        higher = higherGT(gt, c, options);
+	        if (higher === c && higher !== gt) {
+	          return false;
+	        }
+	      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {
+	        return false;
+	      }
+	    }
+	    if (lt) {
+	      if (needDomLTPre) {
+	        if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomLTPre.major && c.semver.minor === needDomLTPre.minor && c.semver.patch === needDomLTPre.patch) {
+	          needDomLTPre = false;
+	        }
+	      }
+	      if (c.operator === '<' || c.operator === '<=') {
+	        lower = lowerLT(lt, c, options);
+	        if (lower === c && lower !== lt) {
+	          return false;
+	        }
+	      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {
+	        return false;
+	      }
+	    }
+	    if (!c.operator && (lt || gt) && gtltComp !== 0) {
+	      return false;
+	    }
+	  }
+
+	  // if there was a < or >, and nothing in the dom, then must be false
+	  // UNLESS it was limited by another range in the other direction.
+	  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
+	  if (gt && hasDomLT && !lt && gtltComp !== 0) {
+	    return false;
+	  }
+	  if (lt && hasDomGT && !gt && gtltComp !== 0) {
+	    return false;
+	  }
+
+	  // we needed a prerelease range in a specific tuple, but didn't get one
+	  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,
+	  // because it includes prereleases in the 1.2.3 tuple
+	  if (needDomGTPre || needDomLTPre) {
+	    return false;
+	  }
+	  return true;
+	};
+
+	// >=1.2.3 is lower than >1.2.3
+	const higherGT = (a, b, options) => {
+	  if (!a) {
+	    return b;
+	  }
+	  const comp = compare(a.semver, b.semver, options);
+	  return comp > 0 ? a : comp < 0 ? b : b.operator === '>' && a.operator === '>=' ? b : a;
+	};
+
+	// <=1.2.3 is higher than <1.2.3
+	const lowerLT = (a, b, options) => {
+	  if (!a) {
+	    return b;
+	  }
+	  const comp = compare(a.semver, b.semver, options);
+	  return comp < 0 ? a : comp > 0 ? b : b.operator === '<' && a.operator === '<=' ? b : a;
+	};
+	subset_1 = subset;
+	return subset_1;
+}
+
+var semver;
+var hasRequiredSemver;
+
+function requireSemver () {
+	if (hasRequiredSemver) return semver;
+	hasRequiredSemver = 1;
+
+	// just pre-load all the stuff that index.js lazily exports
+	const internalRe = requireRe();
+	const constants = requireConstants();
+	const SemVer = requireSemver$1();
+	const identifiers = requireIdentifiers();
+	const parse = requireParse();
+	const valid = requireValid$1();
+	const clean = requireClean();
+	const inc = requireInc();
+	const diff = requireDiff();
+	const major = requireMajor();
+	const minor = requireMinor();
+	const patch = requirePatch();
+	const prerelease = requirePrerelease();
+	const compare = requireCompare();
+	const rcompare = requireRcompare();
+	const compareLoose = requireCompareLoose();
+	const compareBuild = requireCompareBuild();
+	const sort = requireSort();
+	const rsort = requireRsort();
+	const gt = requireGt();
+	const lt = requireLt();
+	const eq = requireEq();
+	const neq = requireNeq();
+	const gte = requireGte();
+	const lte = requireLte();
+	const cmp = requireCmp();
+	const coerce = requireCoerce();
+	const Comparator = requireComparator();
+	const Range = requireRange();
+	const satisfies = requireSatisfies();
+	const toComparators = requireToComparators();
+	const maxSatisfying = requireMaxSatisfying();
+	const minSatisfying = requireMinSatisfying();
+	const minVersion = requireMinVersion();
+	const validRange = requireValid();
+	const outside = requireOutside();
+	const gtr = requireGtr();
+	const ltr = requireLtr();
+	const intersects = requireIntersects();
+	const simplifyRange = requireSimplify();
+	const subset = requireSubset();
+	semver = {
+	  parse,
+	  valid,
+	  clean,
+	  inc,
+	  diff,
+	  major,
+	  minor,
+	  patch,
+	  prerelease,
+	  compare,
+	  rcompare,
+	  compareLoose,
+	  compareBuild,
+	  sort,
+	  rsort,
+	  gt,
+	  lt,
+	  eq,
+	  neq,
+	  gte,
+	  lte,
+	  cmp,
+	  coerce,
+	  Comparator,
+	  Range,
+	  satisfies,
+	  toComparators,
+	  maxSatisfying,
+	  minSatisfying,
+	  minVersion,
+	  validRange,
+	  outside,
+	  gtr,
+	  ltr,
+	  intersects,
+	  simplifyRange,
+	  subset,
+	  SemVer,
+	  re: internalRe.re,
+	  src: internalRe.src,
+	  tokens: internalRe.t,
+	  SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,
+	  RELEASE_TYPES: constants.RELEASE_TYPES,
+	  compareIdentifiers: identifiers.compareIdentifiers,
+	  rcompareIdentifiers: identifiers.rcompareIdentifiers
+	};
+	return semver;
+}
+
+var hasRequiredNormalizeOptions;
+
+function requireNormalizeOptions () {
+	if (hasRequiredNormalizeOptions) return normalizeOptions;
+	hasRequiredNormalizeOptions = 1;
+
+	Object.defineProperty(normalizeOptions, "__esModule", {
+	  value: true
+	});
+	normalizeOptions.normalizeOptions = void 0;
+	const semver_1 = requireSemver();
+	function parseDebugTools(options) {
+	  let debugTools = options.debugTools || {
+	    isDebug: false,
+	    source: '',
+	    assertPredicateIndex: undefined
+	  };
+	  let isDebug = debugTools.isDebug;
+	  let debugToolsImport = debugTools.source;
+	  let assertPredicateIndex = debugTools.assertPredicateIndex;
+	  return {
+	    isDebug,
+	    debugToolsImport,
+	    assertPredicateIndex
+	  };
+	}
+	function evaluateFlagValue(options, name, flagName, flagValue) {
+	  let svelte = options.svelte;
+	  if (typeof flagValue === 'string' && name) {
+	    if (svelte && svelte[name]) {
+	      return (0, semver_1.gt)(flagValue, svelte[name]);
+	    } else {
+	      return null;
+	    }
+	  } else if (typeof flagValue === 'boolean' || flagValue === null) {
+	    return flagValue;
+	  } else if (flagValue === '@embroider/macros') {
+	    return flagValue;
+	  } else {
+	    throw new Error(`Invalid value specified (${flagValue}) for ${flagName} by ${name}`);
+	  }
+	}
+	function parseFlags(options) {
+	  let flagsProvided = options.flags || [];
+	  let combinedFlags = {};
+	  flagsProvided.forEach(flagsDefinition => {
+	    let source = flagsDefinition.source;
+	    let flagsForSource = combinedFlags[source] = combinedFlags[source] || {};
+	    for (let flagName in flagsDefinition.flags) {
+	      let flagValue = flagsDefinition.flags[flagName];
+	      flagsForSource[flagName] = evaluateFlagValue(options, flagsDefinition.name, flagName, flagValue);
+	    }
+	  });
+	  return combinedFlags;
+	}
+	function normalizeOptions$1(options) {
+	  return {
+	    externalizeHelpers: options.externalizeHelpers,
+	    flags: parseFlags(options),
+	    debugTools: parseDebugTools(options)
+	  };
+	}
+	normalizeOptions.normalizeOptions = normalizeOptions$1;
+	return normalizeOptions;
+}
+
+var src = {};
+
+var hasRequiredSrc$1;
+
+function requireSrc$1 () {
+	if (hasRequiredSrc$1) return src;
+	hasRequiredSrc$1 = 1;
+
+	Object.defineProperty(src, "__esModule", {
+	  value: true
+	});
+	src.ImportUtil = void 0;
+	class ImportUtil {
+	  constructor(t, program) {
+	    this.t = t;
+	    this.program = program;
+	  }
+	  // remove one imported binding. If this is the last thing imported from the
+	  // given moduleSpecifier, the whole statement will also be removed.
+	  removeImport(moduleSpecifier, exportedName) {
+	    for (let topLevelPath of this.program.get('body')) {
+	      if (!matchModule(topLevelPath, moduleSpecifier)) {
+	        continue;
+	      }
+	      let importSpecifierPath = topLevelPath.get('specifiers').find(specifierPath => matchSpecifier(specifierPath, exportedName));
+	      if (importSpecifierPath) {
+	        if (topLevelPath.node.specifiers.length === 1) {
+	          topLevelPath.remove();
+	        } else {
+	          importSpecifierPath.remove();
+	        }
+	      }
+	    }
+	  }
+	  // remove all imports from the given moduleSpecifier
+	  removeAllImports(moduleSpecifier) {
+	    for (let topLevelPath of this.program.get('body')) {
+	      if (matchModule(topLevelPath, moduleSpecifier)) {
+	        topLevelPath.remove();
+	      }
+	    }
+	  }
+	  // Import the given value (if needed) and return an Identifier representing
+	  // it.
+	  import(
+	  // the spot at which you will insert the Identifier we return to you
+	  target,
+	  // the path to the module you're importing from
+	  moduleSpecifier,
+	  // the name you're importing from that module. Use "default" for the default
+	  // export. Use "*" for the namespace.
+	  exportedName,
+	  // Optional hint for helping us pick a name for the imported binding
+	  nameHint) {
+	    var _a;
+	    let isNamespaceImport = exportedName === '*';
+	    let isDefaultImport = exportedName === 'default';
+	    let isNamedImport = !isDefaultImport && !isNamespaceImport;
+	    let declaration = this.findImportFrom(moduleSpecifier);
+	    let hasNamespaceSpecifier = declaration === null || declaration === void 0 ? void 0 : declaration.node.specifiers.find(s => s.type === 'ImportNamespaceSpecifier');
+	    let hasNamedSpecifiers = declaration === null || declaration === void 0 ? void 0 : declaration.node.specifiers.find(s => s.type === 'ImportSpecifier');
+	    /**
+	     * the file has a preexisting non-namespace import and a transform tries to add a namespace import, so they don't get combined
+	     * the file has a preexisting namespace import and a transform tries to add a non-namespace import, so they don't get combined
+	     * the file has a preexisting namespace import and a transform tries to add a namespace import, so they don't get combined
+	     */
+	    let cannotUseExistingDeclaration = hasNamedSpecifiers && isNamespaceImport || hasNamespaceSpecifier && isNamedImport || hasNamespaceSpecifier && isNamespaceImport;
+	    if (!cannotUseExistingDeclaration && declaration) {
+	      let specifier = declaration.get('specifiers').find(spec => matchSpecifier(spec, exportedName));
+	      if (specifier && ((_a = target.scope.getBinding(specifier.node.local.name)) === null || _a === void 0 ? void 0 : _a.kind) === 'module') {
+	        return this.t.identifier(specifier.node.local.name);
+	      } else {
+	        return this.addSpecifier(target, declaration, exportedName, nameHint);
+	      }
+	    } else {
+	      let declaration = this.insertAfterExistingImports(this.t.importDeclaration([], this.t.stringLiteral(moduleSpecifier)));
+	      return this.addSpecifier(target, declaration, exportedName, nameHint);
+	    }
+	  }
+	  importForSideEffect(moduleSpecifier) {
+	    let declaration = this.findImportFrom(moduleSpecifier);
+	    if (!declaration) {
+	      this.insertAfterExistingImports(this.t.importDeclaration([], this.t.stringLiteral(moduleSpecifier)));
+	    }
+	  }
+	  addSpecifier(target, declaration, exportedName, nameHint) {
+	    let local = this.t.identifier(unusedNameLike(target, desiredName(nameHint, exportedName, target)));
+	    let specifier = this.buildSpecifier(exportedName, local);
+	    if (specifier.type === 'ImportDefaultSpecifier') {
+	      declaration.node.specifiers.unshift(specifier);
+	    } else {
+	      declaration.node.specifiers.push(specifier);
+	    }
+	    declaration.scope.registerBinding('module', declaration.get(`specifiers.${declaration.node.specifiers.length - 1}`));
+	    return local;
+	  }
+	  buildSpecifier(exportedName, localName) {
+	    switch (exportedName) {
+	      case 'default':
+	        return this.t.importDefaultSpecifier(localName);
+	      case '*':
+	        return this.t.importNamespaceSpecifier(localName);
+	      default:
+	        return this.t.importSpecifier(localName, this.t.identifier(exportedName));
+	    }
+	  }
+	  findImportFrom(moduleSpecifier) {
+	    for (let path of this.program.get('body')) {
+	      if (path.isImportDeclaration() && path.node.source.value === moduleSpecifier && path.node.importKind !== 'type') {
+	        return path;
+	      }
+	    }
+	    return undefined;
+	  }
+	  insertAfterExistingImports(statement) {
+	    let lastIndex;
+	    for (let [index, node] of this.program.node.body.entries()) {
+	      if (node.type === 'ImportDeclaration') {
+	        lastIndex = index;
+	      }
+	    }
+	    if (lastIndex == null) {
+	      // we are intentionally not using babel's container-aware methods, because
+	      // while in theory it's nice that they schedule other plugins to run on
+	      // our nodes, in practice those nodes might get mutated or removed by some
+	      // other plugin in the intervening time causing failures.
+	      this.program.node.body.unshift(statement);
+	      return this.program.get('body.0');
+	    } else {
+	      this.program.node.body.splice(lastIndex + 1, 0, statement);
+	      return this.program.get(`body.${lastIndex + 1}`);
+	    }
+	  }
+	}
+	src.ImportUtil = ImportUtil;
+	function unusedNameLike(path, name) {
+	  let candidate = name;
+	  let counter = 0;
+	  while (path.scope.hasBinding(candidate)) {
+	    candidate = `${name}${counter++}`;
+	  }
+	  return candidate;
+	}
+	function name(node) {
+	  if (node.type === 'StringLiteral') {
+	    return node.value;
+	  } else {
+	    return node.name;
+	  }
+	}
+	function desiredName(nameHint, exportedName, target) {
+	  if (nameHint) {
+	    // first we opportunistically do camelization when an illegal character is
+	    // followed by a lowercase letter, in an effort to aid readability of the
+	    // output.
+	    let cleaned = nameHint.replace(/[^a-zA-Z_]([a-z])/g, (_m, letter) => letter.toUpperCase());
+	    // then we unliterally strip all remaining illegal characters.
+	    cleaned = cleaned.replace(/[^a-zA-Z_]/g, '');
+	    return cleaned;
+	  }
+	  if (exportedName === 'default' || exportedName === '*') {
+	    if (target.isIdentifier()) {
+	      return target.node.name;
+	    } else {
+	      return target.scope.generateUidIdentifierBasedOnNode(target.node).name;
+	    }
+	  } else {
+	    return exportedName;
+	  }
+	}
+	function matchSpecifier(spec, exportedName) {
+	  switch (exportedName) {
+	    case 'default':
+	      return spec.isImportDefaultSpecifier();
+	    case '*':
+	      return spec.isImportNamespaceSpecifier();
+	    default:
+	      return spec.isImportSpecifier() && name(spec.node.imported) === exportedName;
+	  }
+	}
+	function matchModule(path, moduleSpecifier) {
+	  return path.isImportDeclaration() && path.get('source').node.value === moduleSpecifier;
+	}
+	return src;
+}
+
+var hasRequiredSrc;
+
+function requireSrc () {
+	if (hasRequiredSrc) return src$1;
+	hasRequiredSrc = 1;
+
+	var __importDefault = src$1 && src$1.__importDefault || function (mod) {
+	  return mod && mod.__esModule ? mod : {
+	    "default": mod
+	  };
+	};
+	Object.defineProperty(src$1, "__esModule", {
+	  value: true
+	});
+	const path_1 = __importDefault(require$$0);
+	const macros_1 = __importDefault(requireMacros());
+	const normalize_options_1 = requireNormalizeOptions();
+	const babel_import_util_1 = requireSrc$1();
+	function macros(babel) {
+	  let t = babel.types;
+	  function buildIdentifier(value, name) {
+	    let replacement = t.booleanLiteral(value);
+	    t.addComment(replacement, 'trailing', ` ${name} `);
+	    return replacement;
+	  }
+	  return {
+	    name: 'babel-feature-flags-and-debug-macros',
+	    visitor: {
+	      ImportSpecifier(path, state) {
+	        let importPath = path.parent.source.value;
+	        let flagsForImport = state.opts.flags[importPath];
+	        if (flagsForImport) {
+	          let flagName = t.isIdentifier(path.node.imported) ? path.node.imported.name : path.node.imported.value;
+	          let localBindingName = path.node.local.name;
+	          if (!(flagName in flagsForImport)) {
+	            throw new Error(`Imported ${flagName} from ${importPath} which is not a supported flag.`);
+	          }
+	          let flagValue = flagsForImport[flagName];
+	          if (flagValue === null) {
+	            return;
+	          }
+	          let binding = path.scope.getBinding(localBindingName);
+	          binding.referencePaths.forEach(p => {
+	            if (flagValue === '@embroider/macros') {
+	              p.replaceWith(t.callExpression(state.util.import(p, "@embroider/macros", "isDevelopingApp"), []));
+	              p.scope.crawl();
+	            } else {
+	              p.replaceWith(buildIdentifier(flagValue, flagName));
+	            }
+	          });
+	          path.remove();
+	          path.scope.removeOwnBinding(localBindingName);
+	        }
+	      },
+	      ImportDeclaration: {
+	        exit(path, state) {
+	          let importPath = path.node.source.value;
+	          let flagsForImport = state.opts.flags[importPath];
+	          // remove flag source imports when no specifiers are left
+	          if (flagsForImport && path.get('specifiers').length === 0) {
+	            path.remove();
+	          }
+	        }
+	      },
+	      Program: {
+	        enter(path, state) {
+	          // most of our plugin declares state.opts as already being normalized.
+	          // This is the spot where we force it become so.
+	          state.opts = (0, normalize_options_1.normalizeOptions)(state.opts);
+	          state.util = new babel_import_util_1.ImportUtil(t, path);
+	          this.macroBuilder = new macros_1.default(babel, state.opts, state.util);
+	          let body = path.get('body');
+	          body.forEach(item => {
+	            if (item.isImportDeclaration()) {
+	              let importPath = item.node.source.value;
+	              let debugToolsImport = state.opts.debugTools.debugToolsImport;
+	              if (debugToolsImport && debugToolsImport === importPath) {
+	                if (!item.node.specifiers.length) {
+	                  item.remove();
+	                } else {
+	                  this.macroBuilder.collectDebugToolsSpecifiers(item.get('specifiers'));
+	                }
+	              }
+	            }
+	          });
+	        },
+	        exit() {
+	          this.macroBuilder.expand();
+	        }
+	      },
+	      ExpressionStatement(path) {
+	        this.macroBuilder.build(path);
+	      }
+	    }
+	  };
+	}
+	src$1.default = macros;
+	macros.baseDir = function () {
+	  return path_1.default.resolve(__dirname, '..', '..');
+	};
+	return src$1;
+}
+
+var babelPluginDebugMacros;
+var hasRequiredBabelPluginDebugMacros;
+
+function requireBabelPluginDebugMacros () {
+	if (hasRequiredBabelPluginDebugMacros) return babelPluginDebugMacros;
+	hasRequiredBabelPluginDebugMacros = 1;
+	babelPluginDebugMacros = requireSrc().default;
+	return babelPluginDebugMacros;
+}
+
+var babelPluginDebugMacrosExports = requireBabelPluginDebugMacros();
+var index = /*@__PURE__*/getDefaultExportFromCjs(babelPluginDebugMacrosExports);
+
+var index$1 = /*#__PURE__*/_mergeNamespaces({
+  __proto__: null,
+  default: index
+}, [babelPluginDebugMacrosExports]);
+
+export { index$1 as i };
+//# sourceMappingURL=index-DxolpiGq.js.map