@nebula.js/stardust 4.3.0 → 4.4.0

package/core/esm/dev.js

@@ -1,5 +1,5 @@
 /*
-* @nebula.js/stardust v4.3.0
+* @nebula.js/stardust v4.4.0
 * Copyright (c) 2023 QlikTech International AB
 * Released under the MIT license.
 */
@@ -482,7 +482,7 @@ var runtime = {exports: {}};
       };
     };
     function values(iterable) {
-      if (iterable) {
+      if (iterable || iterable === "") {
         var iteratorMethod = iterable[iteratorSymbol];
         if (iteratorMethod) {
           return iteratorMethod.call(iterable);
@@ -507,11 +507,7 @@ var runtime = {exports: {}};
           return next.next = next;
         }
       }
-
-      // Return an iterator with no values.
-      return {
-        next: doneResult
-      };
+      throw new TypeError(typeof iterable + " is not iterable");
     }
     exports.values = values;
     function doneResult() {
@@ -1555,26 +1551,6 @@ var ScreenReader_OneSelected = {
 		"zh-TW": "有一個選取的值。"
 	}
 };
-var ScreenReader_SearchFieldLabel = {
-	id: "ScreenReader.SearchFieldLabel",
-	locale: {
-		"de-DE": "Suchfeld",
-		"en-US": "Search Field",
-		"es-ES": "Buscar campo",
-		"fr-FR": "Champ de recherche",
-		"it-IT": "Campo di ricerca",
-		"ja-JP": "検索フィールド",
-		"ko-KR": "검색 필드",
-		"nl-NL": "Zoekveld",
-		"pl-PL": "Pole wyszukiwania",
-		"pt-BR": "Campo de busca",
-		"ru-RU": "Поле поиска",
-		"sv-SE": "Sökfält",
-		"tr-TR": "Arama Alanı",
-		"zh-CN": "搜索字段",
-		"zh-TW": "搜尋欄位"
-	}
-};
 var ScreenReader_ZeroSelected = {
 	id: "ScreenReader.ZeroSelected",
 	locale: {
@@ -1989,7 +1965,6 @@ var all = {
 	ScreenReader_ManySelected: ScreenReader_ManySelected,
 	ScreenReader_OneSearchResult: ScreenReader_OneSearchResult,
 	ScreenReader_OneSelected: ScreenReader_OneSelected,
-	ScreenReader_SearchFieldLabel: ScreenReader_SearchFieldLabel,
 	ScreenReader_ZeroSelected: ScreenReader_ZeroSelected,
 	Selection_Cancel: Selection_Cancel,
 	Selection_Clear: Selection_Clear,
@@ -4301,7 +4276,7 @@ function resolveProps(defaultProps, props) {
 function composeClasses(slots, getUtilityClass, classes = undefined) {
   const output = {};
   Object.keys(slots).forEach(
-  // `Objet.keys(slots)` can't be wider than `T` because we infer `T` from `slots`.
+  // `Object.keys(slots)` can't be wider than `T` because we infer `T` from `slots`.
   // @ts-expect-error https://github.com/microsoft/TypeScript/pull/12253#issuecomment-263132208
   slot => {
     output[slot] = slots[slot].reduce((acc, key) => {
@@ -4570,7 +4545,7 @@ function hash (value, length) {
  * @param {string} value
  * @return {string}
  */
-function trim (value) {
+function trim$1 (value) {
 	return value.trim()
 }
 
@@ -4787,7 +4762,7 @@ function dealloc (value) {
  * @return {string}
  */
 function delimit (type) {
-	return trim(slice(position - 1, delimiter(type === 91 ? type + 2 : type === 40 ? type + 1 : type)))
+	return trim$1(slice(position - 1, delimiter(type === 91 ? type + 2 : type === 40 ? type + 1 : type)))
 }
 
 /**
@@ -4880,7 +4855,7 @@ function identifier (index) {
  * @return {object[]}
  */
 function compile (value) {
-	return dealloc(parse$7('', null, null, null, [''], value = alloc(value), 0, [0], value))
+	return dealloc(parse('', null, null, null, [''], value = alloc(value), 0, [0], value))
 }
 
 /**
@@ -4895,7 +4870,7 @@ function compile (value) {
  * @param {string[]} declarations
  * @return {object}
  */
-function parse$7 (value, root, parent, rule, rules, rulesets, pseudo, points, declarations) {
+function parse (value, root, parent, rule, rules, rulesets, pseudo, points, declarations) {
 	var index = 0;
 	var offset = 0;
 	var length = pseudo;
@@ -4964,15 +4939,15 @@ function parse$7 (value, root, parent, rule, rules, rulesets, pseudo, points, de
 
 						if (character === 123)
 							if (offset === 0)
-								parse$7(characters, root, reference, reference, props, rulesets, length, points, children);
+								parse(characters, root, reference, reference, props, rulesets, length, points, children);
 							else
 								switch (atrule === 99 && charat(characters, 3) === 110 ? 100 : atrule) {
 									// d l m s
 									case 100: case 108: case 109: case 115:
-										parse$7(value, reference, reference, rule && append(ruleset(value, reference, reference, 0, 0, rules, points, type, rules, props = [], length), children), rules, children, length, points, rule ? props : children);
+										parse(value, reference, reference, rule && append(ruleset(value, reference, reference, 0, 0, rules, points, type, rules, props = [], length), children), rules, children, length, points, rule ? props : children);
 										break
 									default:
-										parse$7(characters, reference, reference, reference, [''], children, 0, points, children);
+										parse(characters, reference, reference, reference, [''], children, 0, points, children);
 								}
 				}
 
@@ -5036,7 +5011,7 @@ function ruleset (value, root, parent, index, offset, rules, points, type, props
 
 	for (var i = 0, j = 0, k = 0; i < index; ++i)
 		for (var x = 0, y = substr(value, post + 1, post = abs(j = points[i])), z = value; x < size; ++x)
-			if (z = trim(j > 0 ? rule[x] + ' ' + y : replace(y, /&\f/g, rule[x])))
+			if (z = trim$1(j > 0 ? rule[x] + ' ' + y : replace(y, /&\f/g, rule[x])))
 				props[k++] = z;
 
 	return node(value, root, parent, offset === 0 ? RULESET : type, props, children, length)
@@ -6659,6 +6634,8 @@ function unstable_createStyleFunctionSx() {
     if (val == null) {
       return null;
     }
+
+    // TODO v6: remove, see https://github.com/mui/material-ui/pull/38123
     if (themeKey === 'typography' && val === 'inherit') {
       return {
         [prop]: val
@@ -6883,6 +6860,12 @@ function shouldForwardProp(prop) {
   return prop !== 'ownerState' && prop !== 'theme' && prop !== 'sx' && prop !== 'as';
 }
 const systemDefaultTheme = createTheme$1();
+const lowercaseFirstLetter = string => {
+  if (!string) {
+    return string;
+  }
+  return string.charAt(0).toLowerCase() + string.slice(1);
+};
 function resolveTheme({
   defaultTheme,
   theme,
@@ -6890,6 +6873,12 @@ function resolveTheme({
 }) {
   return isEmpty$1(theme) ? defaultTheme : theme[themeId] || theme;
 }
+function defaultOverridesResolver(slot) {
+  if (!slot) {
+    return null;
+  }
+  return (props, styles) => styles[slot];
+}
 function createStyled(input = {}) {
   const {
     themeId,
@@ -6914,16 +6903,24 @@ function createStyled(input = {}) {
         slot: componentSlot,
         skipVariantsResolver: inputSkipVariantsResolver,
         skipSx: inputSkipSx,
-        overridesResolver
+        // TODO v6: remove `lowercaseFirstLetter()` in the next major release
+        // For more details: https://github.com/mui/material-ui/pull/37908
+        overridesResolver = defaultOverridesResolver(lowercaseFirstLetter(componentSlot))
       } = inputOptions,
       options = _objectWithoutPropertiesLoose(inputOptions, _excluded$c);
 
     // if skipVariantsResolver option is defined, take the value, otherwise, true for root and false for other slots.
-    const skipVariantsResolver = inputSkipVariantsResolver !== undefined ? inputSkipVariantsResolver : componentSlot && componentSlot !== 'Root' || false;
+    const skipVariantsResolver = inputSkipVariantsResolver !== undefined ? inputSkipVariantsResolver :
+    // TODO v6: remove `Root` in the next major release
+    // For more details: https://github.com/mui/material-ui/pull/37908
+    componentSlot && componentSlot !== 'Root' && componentSlot !== 'root' || false;
     const skipSx = inputSkipSx || false;
     let label;
     let shouldForwardPropOption = shouldForwardProp;
-    if (componentSlot === 'Root') {
+
+    // TODO v6: remove `Root` in the next major release
+    // For more details: https://github.com/mui/material-ui/pull/37908
+    if (componentSlot === 'Root' || componentSlot === 'root') {
       shouldForwardPropOption = rootShouldForwardProp;
     } else if (componentSlot) {
       // any other slot specified
@@ -7905,6 +7902,7 @@ function createTypography(palette, typography) {
     button: buildVariant(fontWeightMedium, 14, 1.75, 0.4, caseAllCaps),
     caption: buildVariant(fontWeightRegular, 12, 1.66, 0.4),
     overline: buildVariant(fontWeightRegular, 12, 2.66, 1, caseAllCaps),
+    // TODO v6: Remove handling of 'inherit' variant from the theme as it is already handled in Material UI's Typography component. Also, remember to remove the associated types.
     inherit: {
       fontFamily: 'inherit',
       fontWeight: 'inherit',
@@ -8451,7 +8449,7 @@ function create$3(definition) {
   return cache[key];
 }
 
-const NEBULA_VERSION_HASH = "c9e4" ;
+const NEBULA_VERSION_HASH = "9b4b" ;
 ClassNameGenerator$1.configure(componentName => {
   return "njs-".concat(NEBULA_VERSION_HASH, "-").concat(componentName.replace('Mui', ''));
 });
@@ -8712,7 +8710,7 @@ function boot(_ref2) {
   const appRef = React__default.createRef();
   const element = document.createElement('div');
   element.style.display = 'none';
-  element.setAttribute('data-nebulajs-version', "4.3.0" );
+  element.setAttribute('data-nebulajs-version', "4.4.0" );
   element.setAttribute('data-app-id', app.id);
   document.body.appendChild(element);
   if (context) {
@@ -8877,6 +8875,9 @@ function useCurrentSelectionsModel(app) {
   return useSessionModel(definition, app);
 }
 
+const sleep = delay => new Promise(resolve => {
+  setTimeout(resolve, delay);
+});
 const rpcReducer = (state, action) => {
   const {
     rpcResultStore,
@@ -8966,7 +8967,9 @@ function useRpc(model, method) {
       });
     }
     try {
-      // await sleep(5000);
+      // To avoid possible race condition causing an infinite loop.
+      // Problem has been observed for mocked models appeared after switching to react 18 (reactDOM render -> createRoot).
+      await sleep(0);
       const result = await cache.rpc;
       dispatch({
         type: 'VALID',
@@ -10642,7 +10645,7 @@ const LOC_STATES = {
 };
 function getValueLabel(_ref) {
   let {
-    translator,
+    translator: translatorDynamic,
     label,
     qState,
     isSelected,
@@ -10651,15 +10654,15 @@ function getValueLabel(_ref) {
     showSearch
   } = _ref;
   const stateTranslation = LOC_STATES[qState];
-  const state = translator.get(stateTranslation);
+  const state = translatorDynamic.get(stateTranslation);
   const srStringArr = [];
   if (isSelected) {
     const navTranslation = showSearch ? 'Listbox.ScreenReader.SearchThenSelectionsMenu.WithAccSelMenu' : 'Listbox.ScreenReader.SelectionMenu.WithAccSelMenu';
-    const nav = translator.get(navTranslation);
+    const nav = translatorDynamic.get(navTranslation);
     srStringArr.push(nav);
   }
   const valueString = "".concat(label, " ").concat(state);
-  const indexString = translator.get('CurrentSelections.Of', [currentIndex + 1, maxIndex + 1]); // E.g. 3 of 20
+  const indexString = translatorDynamic.get('CurrentSelections.Of', [currentIndex + 1, maxIndex + 1]); // E.g. 3 of 20
   srStringArr.unshift(valueString, indexString);
   const srString = srStringArr.join('. ').trim();
   return srString;
@@ -10678,7 +10681,7 @@ function ScreenReaderForSelections(_ref2) {
     layout
   } = _ref2;
   const {
-    translator
+    translator: translatorDynamic
   } = useContext(InstanceContext);
   const {
     qStateCounts: s = {}
@@ -10696,7 +10699,7 @@ function ScreenReaderForSelections(_ref2) {
       t = 'ScreenReader.ManySelected';
       break;
   }
-  const text = translator.get(t, [count]);
+  const text = translatorDynamic.get(t, [count]);
   return /*#__PURE__*/React__default.createElement("div", {
     className: "screenReaderOnly",
     "aria-live": "assertive"
@@ -13366,17 +13369,17 @@ function ListBoxDisclaimer(_ref2) {
     tooltip
   } = _ref2;
   const {
-    translator
+    translator: translatorDynamic
   } = useContext(InstanceContext);
   return /*#__PURE__*/React__default.createElement(Tooltip, {
-    title: tooltip ? translator.get(text) : ''
+    title: tooltip ? translatorDynamic.get(text) : ''
   }, /*#__PURE__*/React__default.createElement(StyledText, {
     width: width,
     dense: dense,
     component: "div",
     variant: "body1",
     py: "12px"
-  }, translator.get(text)));
+  }, translatorDynamic.get(text)));
 }
 
 var Close = {};
@@ -13802,7 +13805,7 @@ function ListBox(_ref) {
     isModal
   } = _ref;
   const {
-    translator
+    translator: translatorDynamic
   } = useContext(InstanceContext);
   const [initScrollPosIsSet, setInitScrollPosIsSet] = useState$1(false);
   const isSingleSelect = !!(layout && layout.qListObject.qDimensionInfo.qIsOneAndOnlyOne);
@@ -13973,7 +13976,7 @@ function ListBox(_ref) {
   useEffect$1(() => {
     if (inputText) {
       const srText = getScreenReaderSearchText(listCount);
-      const srFinalText = translator.get(srText, [listCount]);
+      const srFinalText = translatorDynamic.get(srText, [listCount]);
       setScreenReaderText(srFinalText);
     }
   }, [inputText, listCount]);
@@ -14068,7 +14071,7 @@ function ListBox(_ref) {
     constraints,
     frequencyMax,
     freqIsAllowed,
-    translator,
+    translator: translatorDynamic,
     showSearch,
     isModal
   });
@@ -14614,7 +14617,8 @@ function ActionsToolbar(_ref3) {
     focusHandler = null,
     actionsRefMock = null,
     // for testing
-    direction = 'ltr'
+    direction = 'ltr',
+    autoConfirm
   } = _ref3;
   const defaultSelectionActions = useDefaultSelectionActions(selections);
   const {
@@ -14660,6 +14664,16 @@ function ActionsToolbar(_ref3) {
     focusHandler.on('focus_toolbar_first', focusFirst);
     focusHandler.on('focus_toolbar_last', focusLast);
   }, []);
+  if (autoConfirm) {
+    const canConfirm = selections.show;
+    if (canConfirm) {
+      const confirm = defaultSelectionActions.find(o => o.key === 'confirm') || {
+        action: () => {}
+      };
+      confirm.action();
+    }
+    return null;
+  }
   let moreEnabled = more$1.enabled;
   let moreActions = more$1.actions;
   const moreAlignTo = more$1.alignTo || moreRef;
@@ -14972,7 +14986,7 @@ function ListBoxSearch(_ref3) {
         textAlign: "".concat(inpuTextAlign)
       },
       'data-testid': 'search-input-field',
-      'aria-label': translator.get('ScreenReader.SearchFieldLabel')
+      'aria-label': translator.get('Listbox.Search.ScreenReaderInstructions')
     }
   });
 }
@@ -16994,9 +17008,11 @@ function getListboxActionProps(_ref) {
     isLocked,
     listboxSelectionToolbarItems,
     selections,
-    keyboard
+    keyboard,
+    autoConfirm
   } = _ref;
   return {
+    autoConfirm,
     show: showToolbar && !isDetached,
     popover: {
       show: showToolbar && isDetached,
@@ -17038,9 +17054,9 @@ function ListBoxError(_ref) {
     text
   } = _ref;
   const {
-    translator
+    translator: translatorDynamic
   } = useContext(InstanceContext);
-  return /*#__PURE__*/React__default.createElement(StyledDiv, null, translator.get(text));
+  return /*#__PURE__*/React__default.createElement(StyledDiv, null, translatorDynamic.get(text));
 }
 
 function isDirectQueryEnabled(_ref) {
@@ -17264,6 +17280,7 @@ function ListBoxInline(_ref4) {
   const {
     wildCardSearch,
     searchEnabled,
+    autoConfirm = false,
     layoutOptions = {}
   } = layout !== null && layout !== void 0 ? layout : {};
   const showSearchIcon = searchEnabled !== false && search === 'toggle';
@@ -17325,7 +17342,8 @@ function ListBoxInline(_ref4) {
     isLocked,
     listboxSelectionToolbarItems,
     selections,
-    keyboard
+    keyboard,
+    autoConfirm
   });
   const shouldAutoFocus = searchVisible && search === 'toggle';
 
@@ -17395,7 +17413,8 @@ function ListBoxInline(_ref4) {
       containerRef.current = el;
       containerRectRef(el);
     },
-    isGridMode: isGridMode
+    isGridMode: isGridMode,
+    "aria-label": keyboard.active ? translator.get('Listbox.ScreenReaderInstructions') : ''
   }, showToolbarWithTitle && /*#__PURE__*/React__default.createElement(Grid, {
     item: true,
     container: true,
@@ -17446,9 +17465,7 @@ function ListBoxInline(_ref4) {
   }, /*#__PURE__*/React__default.createElement(Grid, {
     item: true,
     ref: searchContainerRef
-  }, /*#__PURE__*/React__default.createElement("div", {
-    className: classes$4.screenReaderOnly
-  }, translator.get('Listbox.Search.ScreenReaderInstructions')), /*#__PURE__*/React__default.createElement(ListBoxSearch, {
+  }, /*#__PURE__*/React__default.createElement(ListBoxSearch, {
     selections: selections,
     selectionState: selectionState$1,
     model: model,
@@ -17465,9 +17482,7 @@ function ListBoxInline(_ref4) {
     item: true,
     xs: true,
     className: classes$4.listboxWrapper
-  }, /*#__PURE__*/React__default.createElement("div", {
-    className: classes$4.screenReaderOnly
-  }, translator.get('Listbox.ScreenReaderInstructions')), isInvalid ? /*#__PURE__*/React__default.createElement(ListBoxError, {
+  }, isInvalid ? /*#__PURE__*/React__default.createElement(ListBoxError, {
     text: errorText
   }) : /*#__PURE__*/React__default.createElement(AutoSizer, null, _ref5 => {
     let {
@@ -17657,6 +17672,12 @@ const listdef = {
    * @default
    */
   wildCardSearch: false,
+  /**
+   * Automatically confirm selections without showing the selections toolbar.
+   * @type {boolean=}
+   * @default
+   */
+  autoConfirm: false,
   /**
    * Layout settings.
    * @type {object=}
@@ -21608,14 +21629,14 @@ function emptyObject(obj) {
  * @param {Object} a The second object to compare
  * @returns {Boolean} Whether the objects are identical
  */
-function compare$c(a, b) {
+function compare$7(a, b) {
   let isIdentical = true;
   if (isObject(a) && isObject(b)) {
     if (Object.keys(a).length !== Object.keys(b).length) {
       return false;
     }
     Object.keys(a).forEach(key => {
-      if (!compare$c(a[key], b[key])) {
+      if (!compare$7(a[key], b[key])) {
         isIdentical = false;
       }
     });
@@ -21626,7 +21647,7 @@ function compare$c(a, b) {
       return false;
     }
     for (let i = 0, l = a.length; i < l; i += 1) {
-      if (!compare$c(a[i], b[i])) {
+      if (!compare$7(a[i], b[i])) {
         return false;
       }
     }
@@ -21662,7 +21683,7 @@ function patchArray(original, newA, basePath) {
     }
     return -1;
   }
-  if (compare$c(newA, oldA)) {
+  if (compare$7(newA, oldA)) {
     // array is unchanged
     return patches;
   }
@@ -21729,7 +21750,7 @@ JSONPatch.generate = function generate(original, newData, basePath) {
     const val = generateValue(newData[key]);
     const oldVal = original[key];
     const tmpPath = "".concat(basePath, "/").concat(key);
-    if (compare$c(val, oldVal) || isSpecialProperty(newData, key)) {
+    if (compare$7(val, oldVal) || isSpecialProperty(newData, key)) {
       return;
     }
     if (isUndef(oldVal)) {
@@ -23722,1957 +23743,1292 @@ function generatorFn(UserSN, galaxy) {
   return generator;
 }
 
-var re$2 = {exports: {}};
+var iterator;
+var hasRequiredIterator;
 
-// 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$1 = 256;
-const MAX_SAFE_INTEGER$1 = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */9007199254740991;
+function requireIterator () {
+	if (hasRequiredIterator) return iterator;
+	hasRequiredIterator = 1;
+	iterator = function (Yallist) {
+	  Yallist.prototype[Symbol.iterator] = function* () {
+	    for (let walker = this.head; walker; walker = walker.next) {
+	      yield walker.value;
+	    }
+	  };
+	};
+	return iterator;
+}
 
-// Max safe segment length for coercion.
-const MAX_SAFE_COMPONENT_LENGTH = 16;
+var yallist = Yallist$1;
 
-// 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$1 - 6;
-const RELEASE_TYPES = ['major', 'premajor', 'minor', 'preminor', 'patch', 'prepatch', 'prerelease'];
-var constants$1 = {
-  MAX_LENGTH: MAX_LENGTH$1,
-  MAX_SAFE_COMPONENT_LENGTH,
-  MAX_SAFE_BUILD_LENGTH,
-  MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$1,
-  RELEASE_TYPES,
-  SEMVER_SPEC_VERSION,
-  FLAG_INCLUDE_PRERELEASE: 0b001,
-  FLAG_LOOSE: 0b010
-};
+Yallist$1.Node = Node;
+Yallist$1.create = Yallist$1;
 
-const debug$1 = typeof process === 'object' && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? function () {
-  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
-    args[_key] = arguments[_key];
+function Yallist$1 (list) {
+  var self = this;
+  if (!(self instanceof Yallist$1)) {
+    self = new Yallist$1();
   }
-  return console.error('SEMVER', ...args);
-} : () => {};
-var debug_1 = debug$1;
-
-(function (module, exports) {
-  const {
-    MAX_SAFE_COMPONENT_LENGTH,
-    MAX_SAFE_BUILD_LENGTH,
-    MAX_LENGTH
-  } = constants$1;
-  const debug = debug_1;
-  exports = module.exports = {};
 
-  // The actual regexps go on exports.re
-  const re = exports.re = [];
-  const safeRe = exports.safeRe = [];
-  const src = exports.src = [];
-  const t = exports.t = {};
-  let R = 0;
-  const LETTERDASHNUMBER = '[a-zA-Z0-9-]';
+  self.tail = null;
+  self.head = null;
+  self.length = 0;
 
-  // 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("".concat(token, "*")).join("".concat(token, "{0,").concat(max, "}")).split("".concat(token, "+")).join("".concat(token, "{1,").concat(max, "}"));
+  if (list && typeof list.forEach === 'function') {
+    list.forEach(function (item) {
+      self.push(item);
+    });
+  } else if (arguments.length > 0) {
+    for (var i = 0, l = arguments.length; i < l; i++) {
+      self.push(arguments[i]);
     }
-    return value;
-  };
-  const createToken = (name, value, isGlobal) => {
-    const safe = makeSafeRegex(value);
-    const index = R++;
-    debug(name, index, value);
-    t[name] = index;
-    src[index] = value;
-    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.
+  return self
+}
 
-  createToken('NUMERICIDENTIFIER', '0|[1-9]\\d*');
-  createToken('NUMERICIDENTIFIERLOOSE', '\\d+');
+Yallist$1.prototype.removeNode = function (node) {
+  if (node.list !== this) {
+    throw new Error('removing node which does not belong to this list')
+  }
 
-  // ## Non-numeric Identifier
-  // Zero or more digits, followed by a letter or hyphen, and then zero or
-  // more letters, digits, or hyphens.
+  var next = node.next;
+  var prev = node.prev;
 
-  createToken('NONNUMERICIDENTIFIER', "\\d*[a-zA-Z-]".concat(LETTERDASHNUMBER, "*"));
+  if (next) {
+    next.prev = prev;
+  }
 
-  // ## Main Version
-  // Three dot-separated numeric identifiers.
+  if (prev) {
+    prev.next = next;
+  }
 
-  createToken('MAINVERSION', "(".concat(src[t.NUMERICIDENTIFIER], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIER], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIER], ")"));
-  createToken('MAINVERSIONLOOSE', "(".concat(src[t.NUMERICIDENTIFIERLOOSE], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIERLOOSE], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIERLOOSE], ")"));
+  if (node === this.head) {
+    this.head = next;
+  }
+  if (node === this.tail) {
+    this.tail = prev;
+  }
 
-  // ## Pre-release Version Identifier
-  // A numeric identifier, or a non-numeric identifier.
+  node.list.length--;
+  node.next = null;
+  node.prev = null;
+  node.list = null;
 
-  createToken('PRERELEASEIDENTIFIER', "(?:".concat(src[t.NUMERICIDENTIFIER], "|").concat(src[t.NONNUMERICIDENTIFIER], ")"));
-  createToken('PRERELEASEIDENTIFIERLOOSE', "(?:".concat(src[t.NUMERICIDENTIFIERLOOSE], "|").concat(src[t.NONNUMERICIDENTIFIER], ")"));
+  return next
+};
 
-  // ## Pre-release Version
-  // Hyphen, followed by one or more dot-separated pre-release version
-  // identifiers.
+Yallist$1.prototype.unshiftNode = function (node) {
+  if (node === this.head) {
+    return
+  }
 
-  createToken('PRERELEASE', "(?:-(".concat(src[t.PRERELEASEIDENTIFIER], "(?:\\.").concat(src[t.PRERELEASEIDENTIFIER], ")*))"));
-  createToken('PRERELEASELOOSE', "(?:-?(".concat(src[t.PRERELEASEIDENTIFIERLOOSE], "(?:\\.").concat(src[t.PRERELEASEIDENTIFIERLOOSE], ")*))"));
+  if (node.list) {
+    node.list.removeNode(node);
+  }
 
-  // ## Build Metadata Identifier
-  // Any combination of digits, letters, or hyphens.
+  var head = this.head;
+  node.list = this;
+  node.next = head;
+  if (head) {
+    head.prev = node;
+  }
 
-  createToken('BUILDIDENTIFIER', "".concat(LETTERDASHNUMBER, "+"));
+  this.head = node;
+  if (!this.tail) {
+    this.tail = node;
+  }
+  this.length++;
+};
 
-  // ## Build Metadata
-  // Plus sign, followed by one or more period-separated build metadata
-  // identifiers.
+Yallist$1.prototype.pushNode = function (node) {
+  if (node === this.tail) {
+    return
+  }
 
-  createToken('BUILD', "(?:\\+(".concat(src[t.BUILDIDENTIFIER], "(?:\\.").concat(src[t.BUILDIDENTIFIER], ")*))"));
+  if (node.list) {
+    node.list.removeNode(node);
+  }
 
-  // ## Full Version String
-  // A main version, followed optionally by a pre-release version and
-  // build metadata.
+  var tail = this.tail;
+  node.list = this;
+  node.prev = tail;
+  if (tail) {
+    tail.next = node;
+  }
 
-  // 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.
+  this.tail = node;
+  if (!this.head) {
+    this.head = node;
+  }
+  this.length++;
+};
 
-  createToken('FULLPLAIN', "v?".concat(src[t.MAINVERSION]).concat(src[t.PRERELEASE], "?").concat(src[t.BUILD], "?"));
-  createToken('FULL', "^".concat(src[t.FULLPLAIN], "$"));
+Yallist$1.prototype.push = function () {
+  for (var i = 0, l = arguments.length; i < l; i++) {
+    push(this, arguments[i]);
+  }
+  return this.length
+};
 
-  // 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]*".concat(src[t.MAINVERSIONLOOSE]).concat(src[t.PRERELEASELOOSE], "?").concat(src[t.BUILD], "?"));
-  createToken('LOOSE', "^".concat(src[t.LOOSEPLAIN], "$"));
-  createToken('GTLT', '((?:<|>)?=?)');
+Yallist$1.prototype.unshift = function () {
+  for (var i = 0, l = arguments.length; i < l; i++) {
+    unshift(this, arguments[i]);
+  }
+  return this.length
+};
 
-  // 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', "".concat(src[t.NUMERICIDENTIFIERLOOSE], "|x|X|\\*"));
-  createToken('XRANGEIDENTIFIER', "".concat(src[t.NUMERICIDENTIFIER], "|x|X|\\*"));
-  createToken('XRANGEPLAIN', "[v=\\s]*(".concat(src[t.XRANGEIDENTIFIER], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIER], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIER], ")") + "(?:".concat(src[t.PRERELEASE], ")?").concat(src[t.BUILD], "?") + ")?)?");
-  createToken('XRANGEPLAINLOOSE', "[v=\\s]*(".concat(src[t.XRANGEIDENTIFIERLOOSE], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIERLOOSE], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIERLOOSE], ")") + "(?:".concat(src[t.PRERELEASELOOSE], ")?").concat(src[t.BUILD], "?") + ")?)?");
-  createToken('XRANGE', "^".concat(src[t.GTLT], "\\s*").concat(src[t.XRANGEPLAIN], "$"));
-  createToken('XRANGELOOSE', "^".concat(src[t.GTLT], "\\s*").concat(src[t.XRANGEPLAINLOOSE], "$"));
+Yallist$1.prototype.pop = function () {
+  if (!this.tail) {
+    return undefined
+  }
 
-  // Coercion.
-  // Extract anything that could conceivably be a part of a valid semver
-  createToken('COERCE', "".concat('(^|[^\\d])' + '(\\d{1,').concat(MAX_SAFE_COMPONENT_LENGTH, "})") + "(?:\\.(\\d{1,".concat(MAX_SAFE_COMPONENT_LENGTH, "}))?") + "(?:\\.(\\d{1,".concat(MAX_SAFE_COMPONENT_LENGTH, "}))?") + "(?:$|[^\\d])");
-  createToken('COERCERTL', src[t.COERCE], true);
+  var res = this.tail.value;
+  this.tail = this.tail.prev;
+  if (this.tail) {
+    this.tail.next = null;
+  } else {
+    this.head = null;
+  }
+  this.length--;
+  return res
+};
 
-  // Tilde ranges.
-  // Meaning is "reasonably at or greater than"
-  createToken('LONETILDE', '(?:~>?)');
-  createToken('TILDETRIM', "(\\s*)".concat(src[t.LONETILDE], "\\s+"), true);
-  exports.tildeTrimReplace = '$1~';
-  createToken('TILDE', "^".concat(src[t.LONETILDE]).concat(src[t.XRANGEPLAIN], "$"));
-  createToken('TILDELOOSE', "^".concat(src[t.LONETILDE]).concat(src[t.XRANGEPLAINLOOSE], "$"));
+Yallist$1.prototype.shift = function () {
+  if (!this.head) {
+    return undefined
+  }
 
-  // Caret ranges.
-  // Meaning is "at least and backwards compatible with"
-  createToken('LONECARET', '(?:\\^)');
-  createToken('CARETTRIM', "(\\s*)".concat(src[t.LONECARET], "\\s+"), true);
-  exports.caretTrimReplace = '$1^';
-  createToken('CARET', "^".concat(src[t.LONECARET]).concat(src[t.XRANGEPLAIN], "$"));
-  createToken('CARETLOOSE', "^".concat(src[t.LONECARET]).concat(src[t.XRANGEPLAINLOOSE], "$"));
+  var res = this.head.value;
+  this.head = this.head.next;
+  if (this.head) {
+    this.head.prev = null;
+  } else {
+    this.tail = null;
+  }
+  this.length--;
+  return res
+};
 
-  // A simple gt/lt/eq thing, or just "" to indicate "any version"
-  createToken('COMPARATORLOOSE', "^".concat(src[t.GTLT], "\\s*(").concat(src[t.LOOSEPLAIN], ")$|^$"));
-  createToken('COMPARATOR', "^".concat(src[t.GTLT], "\\s*(").concat(src[t.FULLPLAIN], ")$|^$"));
+Yallist$1.prototype.forEach = function (fn, thisp) {
+  thisp = thisp || this;
+  for (var walker = this.head, i = 0; walker !== null; i++) {
+    fn.call(thisp, walker.value, i, this);
+    walker = walker.next;
+  }
+};
 
-  // 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*)".concat(src[t.GTLT], "\\s*(").concat(src[t.LOOSEPLAIN], "|").concat(src[t.XRANGEPLAIN], ")"), true);
-  exports.comparatorTrimReplace = '$1$2$3';
+Yallist$1.prototype.forEachReverse = function (fn, thisp) {
+  thisp = thisp || this;
+  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {
+    fn.call(thisp, walker.value, i, this);
+    walker = walker.prev;
+  }
+};
 
-  // 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*(".concat(src[t.XRANGEPLAIN], ")") + "\\s+-\\s+" + "(".concat(src[t.XRANGEPLAIN], ")") + "\\s*$");
-  createToken('HYPHENRANGELOOSE', "^\\s*(".concat(src[t.XRANGEPLAINLOOSE], ")") + "\\s+-\\s+" + "(".concat(src[t.XRANGEPLAINLOOSE], ")") + "\\s*$");
+Yallist$1.prototype.get = function (n) {
+  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
+    // abort out of the list early if we hit a cycle
+    walker = walker.next;
+  }
+  if (i === n && walker !== null) {
+    return walker.value
+  }
+};
 
-  // 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$2, re$2.exports);
-var reExports = re$2.exports;
+Yallist$1.prototype.getReverse = function (n) {
+  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
+    // abort out of the list early if we hit a cycle
+    walker = walker.prev;
+  }
+  if (i === n && walker !== null) {
+    return walker.value
+  }
+};
 
-// parse out just the options we care about
-const looseOption = Object.freeze({
-  loose: true
-});
-const emptyOpts = Object.freeze({});
-const parseOptions$1 = options => {
-  if (!options) {
-    return emptyOpts;
+Yallist$1.prototype.map = function (fn, thisp) {
+  thisp = thisp || this;
+  var res = new Yallist$1();
+  for (var walker = this.head; walker !== null;) {
+    res.push(fn.call(thisp, walker.value, this));
+    walker = walker.next;
   }
-  if (typeof options !== 'object') {
-    return looseOption;
+  return res
+};
+
+Yallist$1.prototype.mapReverse = function (fn, thisp) {
+  thisp = thisp || this;
+  var res = new Yallist$1();
+  for (var walker = this.tail; walker !== null;) {
+    res.push(fn.call(thisp, walker.value, this));
+    walker = walker.prev;
   }
-  return options;
+  return res
 };
-var parseOptions_1 = parseOptions$1;
 
-const numeric = /^[0-9]+$/;
-const compareIdentifiers$1 = (a, b) => {
-  const anum = numeric.test(a);
-  const bnum = numeric.test(b);
-  if (anum && bnum) {
-    a = +a;
-    b = +b;
+Yallist$1.prototype.reduce = function (fn, initial) {
+  var acc;
+  var walker = this.head;
+  if (arguments.length > 1) {
+    acc = initial;
+  } else if (this.head) {
+    walker = this.head.next;
+    acc = this.head.value;
+  } else {
+    throw new TypeError('Reduce of empty list with no initial value')
   }
-  return a === b ? 0 : anum && !bnum ? -1 : bnum && !anum ? 1 : a < b ? -1 : 1;
+
+  for (var i = 0; walker !== null; i++) {
+    acc = fn(acc, walker.value, i);
+    walker = walker.next;
+  }
+
+  return acc
 };
-const rcompareIdentifiers = (a, b) => compareIdentifiers$1(b, a);
-var identifiers$1 = {
-  compareIdentifiers: compareIdentifiers$1,
-  rcompareIdentifiers
+
+Yallist$1.prototype.reduceReverse = function (fn, initial) {
+  var acc;
+  var walker = this.tail;
+  if (arguments.length > 1) {
+    acc = initial;
+  } else if (this.tail) {
+    walker = this.tail.prev;
+    acc = this.tail.value;
+  } else {
+    throw new TypeError('Reduce of empty list with no initial value')
+  }
+
+  for (var i = this.length - 1; walker !== null; i--) {
+    acc = fn(acc, walker.value, i);
+    walker = walker.prev;
+  }
+
+  return acc
 };
 
-const debug = debug_1;
-const {
-  MAX_LENGTH,
-  MAX_SAFE_INTEGER
-} = constants$1;
-const {
-  safeRe: re$1,
-  t: t$1
-} = reExports;
-const parseOptions = parseOptions_1;
-const {
-  compareIdentifiers
-} = identifiers$1;
-let SemVer$d = 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 \"".concat(typeof version, "\"."));
-    }
-    if (version.length > MAX_LENGTH) {
-      throw new TypeError("version is longer than ".concat(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$1[t$1.LOOSE] : re$1[t$1.FULL]);
-    if (!m) {
-      throw new TypeError("Invalid Version: ".concat(version));
-    }
-    this.raw = version;
+Yallist$1.prototype.toArray = function () {
+  var arr = new Array(this.length);
+  for (var i = 0, walker = this.head; walker !== null; i++) {
+    arr[i] = walker.value;
+    walker = walker.next;
+  }
+  return arr
+};
 
-    // 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');
-    }
+Yallist$1.prototype.toArrayReverse = function () {
+  var arr = new Array(this.length);
+  for (var i = 0, walker = this.tail; walker !== null; i++) {
+    arr[i] = walker.value;
+    walker = walker.prev;
+  }
+  return arr
+};
 
-    // 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;
+Yallist$1.prototype.slice = function (from, to) {
+  to = to || this.length;
+  if (to < 0) {
+    to += this.length;
+  }
+  from = from || 0;
+  if (from < 0) {
+    from += this.length;
+  }
+  var ret = new Yallist$1();
+  if (to < from || to < 0) {
+    return ret
+  }
+  if (from < 0) {
+    from = 0;
+  }
+  if (to > this.length) {
+    to = this.length;
+  }
+  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
+    walker = walker.next;
+  }
+  for (; walker !== null && i < to; i++, walker = walker.next) {
+    ret.push(walker.value);
+  }
+  return ret
+};
+
+Yallist$1.prototype.sliceReverse = function (from, to) {
+  to = to || this.length;
+  if (to < 0) {
+    to += this.length;
+  }
+  from = from || 0;
+  if (from < 0) {
+    from += this.length;
+  }
+  var ret = new Yallist$1();
+  if (to < from || to < 0) {
+    return ret
+  }
+  if (from < 0) {
+    from = 0;
+  }
+  if (to > this.length) {
+    to = this.length;
+  }
+  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {
+    walker = walker.prev;
+  }
+  for (; walker !== null && i > from; i--, walker = walker.prev) {
+    ret.push(walker.value);
+  }
+  return ret
+};
+
+Yallist$1.prototype.splice = function (start, deleteCount, ...nodes) {
+  if (start > this.length) {
+    start = this.length - 1;
+  }
+  if (start < 0) {
+    start = this.length + start;
+  }
+
+  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
+    walker = walker.next;
+  }
+
+  var ret = [];
+  for (var i = 0; walker && i < deleteCount; i++) {
+    ret.push(walker.value);
+    walker = this.removeNode(walker);
+  }
+  if (walker === null) {
+    walker = this.tail;
+  }
+
+  if (walker !== this.head && walker !== this.tail) {
+    walker = walker.prev;
+  }
+
+  for (var i = 0; i < nodes.length; i++) {
+    walker = insert(this, walker, nodes[i]);
+  }
+  return ret;
+};
+
+Yallist$1.prototype.reverse = function () {
+  var head = this.head;
+  var tail = this.tail;
+  for (var walker = head; walker !== null; walker = walker.prev) {
+    var p = walker.prev;
+    walker.prev = walker.next;
+    walker.next = p;
+  }
+  this.head = tail;
+  this.tail = head;
+  return this
+};
+
+function insert (self, node, value) {
+  var inserted = node === self.head ?
+    new Node(value, null, node, self) :
+    new Node(value, node, node.next, self);
+
+  if (inserted.next === null) {
+    self.tail = inserted;
+  }
+  if (inserted.prev === null) {
+    self.head = inserted;
+  }
+
+  self.length++;
+
+  return inserted
+}
+
+function push (self, item) {
+  self.tail = new Node(item, self.tail, null, self);
+  if (!self.head) {
+    self.head = self.tail;
+  }
+  self.length++;
+}
+
+function unshift (self, item) {
+  self.head = new Node(item, null, self.head, self);
+  if (!self.tail) {
+    self.tail = self.head;
+  }
+  self.length++;
+}
+
+function Node (value, prev, next, list) {
+  if (!(this instanceof Node)) {
+    return new Node(value, prev, next, list)
+  }
+
+  this.list = list;
+  this.value = value;
+
+  if (prev) {
+    prev.next = this;
+    this.prev = prev;
+  } else {
+    this.prev = null;
+  }
+
+  if (next) {
+    next.prev = this;
+    this.next = next;
+  } else {
+    this.next = null;
+  }
+}
+
+try {
+  // add if support for Symbol.iterator is present
+  requireIterator()(Yallist$1);
+} catch (er) {}
+
+// A linked list to keep track of recently-used-ness
+const Yallist = yallist;
+const MAX = Symbol('max');
+const LENGTH = Symbol('length');
+const LENGTH_CALCULATOR = Symbol('lengthCalculator');
+const ALLOW_STALE = Symbol('allowStale');
+const MAX_AGE = Symbol('maxAge');
+const DISPOSE = Symbol('dispose');
+const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
+const LRU_LIST = Symbol('lruList');
+const CACHE = Symbol('cache');
+const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
+const naiveLength = () => 1;
+
+// lruList is a yallist where the head is the youngest
+// item, and the tail is the oldest.  the list contains the Hit
+// objects as the entries.
+// Each Hit object has a reference to its Yallist.Node.  This
+// never changes.
+//
+// cache is a Map (or PseudoMap) that matches the keys to
+// the Yallist.Node object.
+class LRUCache {
+  constructor(options) {
+    if (typeof options === 'number') options = {
+      max: options
+    };
+    if (!options) options = {};
+    if (options.max && (typeof options.max !== 'number' || options.max < 0)) throw new TypeError('max must be a non-negative number');
+    // Kind of weird to have a default max of Infinity, but oh well.
+    this[MAX] = options.max || Infinity;
+    const lc = options.length || naiveLength;
+    this[LENGTH_CALCULATOR] = typeof lc !== 'function' ? naiveLength : lc;
+    this[ALLOW_STALE] = options.stale || false;
+    if (options.maxAge && typeof options.maxAge !== 'number') throw new TypeError('maxAge must be a number');
+    this[MAX_AGE] = options.maxAge || 0;
+    this[DISPOSE] = options.dispose;
+    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
+    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
+    this.reset();
+  }
+
+  // resize the cache when the max changes.
+  set max(mL) {
+    if (typeof mL !== 'number' || mL < 0) throw new TypeError('max must be a non-negative number');
+    this[MAX] = mL || Infinity;
+    trim(this);
+  }
+  get max() {
+    return this[MAX];
+  }
+  set allowStale(allowStale) {
+    this[ALLOW_STALE] = !!allowStale;
+  }
+  get allowStale() {
+    return this[ALLOW_STALE];
+  }
+  set maxAge(mA) {
+    if (typeof mA !== 'number') throw new TypeError('maxAge must be a non-negative number');
+    this[MAX_AGE] = mA;
+    trim(this);
+  }
+  get maxAge() {
+    return this[MAX_AGE];
+  }
+
+  // resize the cache when the lengthCalculator changes.
+  set lengthCalculator(lC) {
+    if (typeof lC !== 'function') lC = naiveLength;
+    if (lC !== this[LENGTH_CALCULATOR]) {
+      this[LENGTH_CALCULATOR] = lC;
+      this[LENGTH] = 0;
+      this[LRU_LIST].forEach(hit => {
+        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
+        this[LENGTH] += hit.length;
       });
     }
-    this.build = m[5] ? m[5].split('.') : [];
-    this.format();
+    trim(this);
   }
-  format() {
-    this.version = "".concat(this.major, ".").concat(this.minor, ".").concat(this.patch);
-    if (this.prerelease.length) {
-      this.version += "-".concat(this.prerelease.join('.'));
-    }
-    return this.version;
+  get lengthCalculator() {
+    return this[LENGTH_CALCULATOR];
   }
-  toString() {
-    return this.version;
+  get length() {
+    return this[LENGTH];
   }
-  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);
+  get itemCount() {
+    return this[LRU_LIST].length;
+  }
+  rforEach(fn, thisp) {
+    thisp = thisp || this;
+    for (let walker = this[LRU_LIST].tail; walker !== null;) {
+      const prev = walker.prev;
+      forEachStep(this, fn, walker, thisp);
+      walker = prev;
     }
-    if (other.version === this.version) {
-      return 0;
+  }
+  forEach(fn, thisp) {
+    thisp = thisp || this;
+    for (let walker = this[LRU_LIST].head; walker !== null;) {
+      const next = walker.next;
+      forEachStep(this, fn, walker, thisp);
+      walker = next;
     }
-    return this.compareMain(other) || this.comparePre(other);
   }
-  compareMain(other) {
-    if (!(other instanceof SemVer)) {
-      other = new SemVer(other, this.options);
+  keys() {
+    return this[LRU_LIST].toArray().map(k => k.key);
+  }
+  values() {
+    return this[LRU_LIST].toArray().map(k => k.value);
+  }
+  reset() {
+    if (this[DISPOSE] && this[LRU_LIST] && this[LRU_LIST].length) {
+      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value));
     }
-    return compareIdentifiers(this.major, other.major) || compareIdentifiers(this.minor, other.minor) || compareIdentifiers(this.patch, other.patch);
+    this[CACHE] = new Map(); // hash of items by key
+    this[LRU_LIST] = new Yallist(); // list of items in order of use recency
+    this[LENGTH] = 0; // length of items in the list
   }
-  comparePre(other) {
-    if (!(other instanceof SemVer)) {
-      other = new SemVer(other, this.options);
+
+  dump() {
+    return this[LRU_LIST].map(hit => isStale(this, hit) ? false : {
+      k: hit.key,
+      v: hit.value,
+      e: hit.now + (hit.maxAge || 0)
+    }).toArray().filter(h => h);
+  }
+  dumpLru() {
+    return this[LRU_LIST];
+  }
+  set(key, value, maxAge) {
+    maxAge = maxAge || this[MAX_AGE];
+    if (maxAge && typeof maxAge !== 'number') throw new TypeError('maxAge must be a number');
+    const now = maxAge ? Date.now() : 0;
+    const len = this[LENGTH_CALCULATOR](value, key);
+    if (this[CACHE].has(key)) {
+      if (len > this[MAX]) {
+        del(this, this[CACHE].get(key));
+        return false;
+      }
+      const node = this[CACHE].get(key);
+      const item = node.value;
+
+      // dispose of the old one before overwriting
+      // split out into 2 ifs for better coverage tracking
+      if (this[DISPOSE]) {
+        if (!this[NO_DISPOSE_ON_SET]) this[DISPOSE](key, item.value);
+      }
+      item.now = now;
+      item.maxAge = maxAge;
+      item.value = value;
+      this[LENGTH] += len - item.length;
+      item.length = len;
+      this.get(key);
+      trim(this);
+      return true;
     }
+    const hit = new Entry(key, value, len, now, maxAge);
 
-    // 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;
+    // oversized objects fall out of cache automatically.
+    if (hit.length > this[MAX]) {
+      if (this[DISPOSE]) this[DISPOSE](key, value);
+      return false;
     }
-    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);
+    this[LENGTH] += hit.length;
+    this[LRU_LIST].unshift(hit);
+    this[CACHE].set(key, this[LRU_LIST].head);
+    trim(this);
+    return true;
   }
-  compareBuild(other) {
-    if (!(other instanceof SemVer)) {
-      other = new SemVer(other, this.options);
+  has(key) {
+    if (!this[CACHE].has(key)) return false;
+    const hit = this[CACHE].get(key).value;
+    return !isStale(this, hit);
+  }
+  get(key) {
+    return get(this, key, true);
+  }
+  peek(key) {
+    return get(this, key, false);
+  }
+  pop() {
+    const node = this[LRU_LIST].tail;
+    if (!node) return null;
+    del(this, node);
+    return node.value;
+  }
+  del(key) {
+    del(this, this[CACHE].get(key));
+  }
+  load(arr) {
+    // reset the cache
+    this.reset();
+    const now = Date.now();
+    // A previous serialized cache has the most recent items first
+    for (let l = arr.length - 1; l >= 0; l--) {
+      const hit = arr[l];
+      const expiresAt = hit.e || 0;
+      if (expiresAt === 0)
+        // the item was created without expiration in a non aged cache
+        this.set(hit.k, hit.v);else {
+        const maxAge = expiresAt - now;
+        // dont add already expired items
+        if (maxAge > 0) {
+          this.set(hit.k, hit.v, maxAge);
+        }
+      }
     }
-    let i = 0;
-    do {
-      const a = this.build[i];
-      const b = other.build[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);
+  }
+  prune() {
+    this[CACHE].forEach((value, key) => get(this, key, false));
+  }
+}
+const get = (self, key, doUse) => {
+  const node = self[CACHE].get(key);
+  if (node) {
+    const hit = node.value;
+    if (isStale(self, hit)) {
+      del(self, node);
+      if (!self[ALLOW_STALE]) return undefined;
+    } else {
+      if (doUse) {
+        if (self[UPDATE_AGE_ON_GET]) node.value.now = Date.now();
+        self[LRU_LIST].unshiftNode(node);
       }
-    } while (++i);
+    }
+    return hit.value;
+  }
+};
+const isStale = (self, hit) => {
+  if (!hit || !hit.maxAge && !self[MAX_AGE]) return false;
+  const diff = Date.now() - hit.now;
+  return hit.maxAge ? diff > hit.maxAge : self[MAX_AGE] && diff > self[MAX_AGE];
+};
+const trim = self => {
+  if (self[LENGTH] > self[MAX]) {
+    for (let walker = self[LRU_LIST].tail; self[LENGTH] > self[MAX] && walker !== null;) {
+      // We know that we're about to delete this one, and also
+      // what the next least recently used key will be, so just
+      // go ahead and set it now.
+      const prev = walker.prev;
+      del(self, walker);
+      walker = prev;
+    }
+  }
+};
+const del = (self, node) => {
+  if (node) {
+    const hit = node.value;
+    if (self[DISPOSE]) self[DISPOSE](hit.key, hit.value);
+    self[LENGTH] -= hit.length;
+    self[CACHE].delete(hit.key);
+    self[LRU_LIST].removeNode(node);
+  }
+};
+class Entry {
+  constructor(key, value, length, now, maxAge) {
+    this.key = key;
+    this.value = value;
+    this.length = length;
+    this.now = now;
+    this.maxAge = maxAge || 0;
+  }
+}
+const forEachStep = (self, fn, node, thisp) => {
+  let hit = node.value;
+  if (isStale(self, hit)) {
+    del(self, node);
+    if (!self[ALLOW_STALE]) hit = undefined;
   }
+  if (hit) fn.call(thisp, hit.value, hit.key, self);
+};
+var lruCache = LRUCache;
 
-  // 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) {
-    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 '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 (!identifier && identifierBase === false) {
-            throw new Error('invalid increment argument: identifier is empty');
-          }
-          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: ".concat(release));
-    }
-    this.raw = this.format();
-    if (this.build.length) {
-      this.raw += "+".concat(this.build.join('.'));
-    }
-    return this;
-  }
-};
-var semver$1 = SemVer$d;
-
-const SemVer$c = semver$1;
-const parse$6 = function (version, options) {
-  let throwErrors = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
-  if (version instanceof SemVer$c) {
-    return version;
+// parse out just the options we care about
+const looseOption = Object.freeze({
+  loose: true
+});
+const emptyOpts = Object.freeze({});
+const parseOptions$1 = options => {
+  if (!options) {
+    return emptyOpts;
   }
-  try {
-    return new SemVer$c(version, options);
-  } catch (er) {
-    if (!throwErrors) {
-      return null;
-    }
-    throw er;
+  if (typeof options !== 'object') {
+    return looseOption;
   }
+  return options;
 };
-var parse_1 = parse$6;
+var parseOptions_1 = parseOptions$1;
 
-const parse$5 = parse_1;
-const valid$2 = (version, options) => {
-  const v = parse$5(version, options);
-  return v ? v.version : null;
-};
-var valid_1 = valid$2;
+var re$1 = {exports: {}};
 
-const parse$4 = parse_1;
-const clean$1 = (version, options) => {
-  const s = parse$4(version.trim().replace(/^[=v]+/, ''), options);
-  return s ? s.version : null;
-};
-var clean_1 = clean$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$1 = 256;
+const MAX_SAFE_INTEGER$1 = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */9007199254740991;
 
-const SemVer$b = semver$1;
-const inc$1 = (version, release, options, identifier, identifierBase) => {
-  if (typeof options === 'string') {
-    identifierBase = identifier;
-    identifier = options;
-    options = undefined;
-  }
-  try {
-    return new SemVer$b(version instanceof SemVer$b ? version.version : version, options).inc(release, identifier, identifierBase).version;
-  } catch (er) {
-    return null;
-  }
+// 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$1 - 6;
+const RELEASE_TYPES = ['major', 'premajor', 'minor', 'preminor', 'patch', 'prepatch', 'prerelease'];
+var constants = {
+  MAX_LENGTH: MAX_LENGTH$1,
+  MAX_SAFE_COMPONENT_LENGTH,
+  MAX_SAFE_BUILD_LENGTH,
+  MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$1,
+  RELEASE_TYPES,
+  SEMVER_SPEC_VERSION,
+  FLAG_INCLUDE_PRERELEASE: 0b001,
+  FLAG_LOOSE: 0b010
 };
-var inc_1 = inc$1;
 
-const parse$3 = parse_1;
-const diff$1 = (version1, version2) => {
-  const v1 = parse$3(version1, null, true);
-  const v2 = parse$3(version2, null, true);
-  const comparison = v1.compare(v2);
-  if (comparison === 0) {
-    return null;
+const debug$1 = typeof process === 'object' && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? function () {
+  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+    args[_key] = arguments[_key];
   }
-  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
+  return console.error('SEMVER', ...args);
+} : () => {};
+var debug_1 = debug$1;
 
-    // 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';
-    }
+(function (module, exports) {
+  const {
+    MAX_SAFE_COMPONENT_LENGTH,
+    MAX_SAFE_BUILD_LENGTH,
+    MAX_LENGTH
+  } = constants;
+  const debug = debug_1;
+  exports = module.exports = {};
 
-    // Otherwise it can be determined by checking the high version
+  // The actual regexps go on exports.re
+  const re = exports.re = [];
+  const safeRe = exports.safeRe = [];
+  const src = exports.src = [];
+  const t = exports.t = {};
+  let R = 0;
+  const LETTERDASHNUMBER = '[a-zA-Z0-9-]';
 
-    if (highVersion.patch) {
-      // anything higher than a patch bump would result in the wrong version
-      return 'patch';
-    }
-    if (highVersion.minor) {
-      // anything higher than a minor bump would result in the wrong version
-      return 'minor';
+  // 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("".concat(token, "*")).join("".concat(token, "{0,").concat(max, "}")).split("".concat(token, "+")).join("".concat(token, "{1,").concat(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;
+    re[index] = new RegExp(value, isGlobal ? 'g' : undefined);
+    safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined);
+  };
 
-    // bumping major/minor/patch all have same result
-    return 'major';
-  }
+  // The following Regular Expressions can be used for tokenizing,
+  // validating, and parsing SemVer version strings.
 
-  // 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';
-  }
+  // ## Numeric Identifier
+  // A single `0`, or a non-zero digit followed by zero or more digits.
 
-  // high and low are preleases
-  return 'prerelease';
-};
-var diff_1 = diff$1;
+  createToken('NUMERICIDENTIFIER', '0|[1-9]\\d*');
+  createToken('NUMERICIDENTIFIERLOOSE', '\\d+');
 
-const SemVer$a = semver$1;
-const major$1 = (a, loose) => new SemVer$a(a, loose).major;
-var major_1 = major$1;
+  // ## Non-numeric Identifier
+  // Zero or more digits, followed by a letter or hyphen, and then zero or
+  // more letters, digits, or hyphens.
 
-const SemVer$9 = semver$1;
-const minor$1 = (a, loose) => new SemVer$9(a, loose).minor;
-var minor_1 = minor$1;
+  createToken('NONNUMERICIDENTIFIER', "\\d*[a-zA-Z-]".concat(LETTERDASHNUMBER, "*"));
 
-const SemVer$8 = semver$1;
-const patch$1 = (a, loose) => new SemVer$8(a, loose).patch;
-var patch_1 = patch$1;
+  // ## Main Version
+  // Three dot-separated numeric identifiers.
 
-const parse$2 = parse_1;
-const prerelease$1 = (version, options) => {
-  const parsed = parse$2(version, options);
-  return parsed && parsed.prerelease.length ? parsed.prerelease : null;
-};
-var prerelease_1 = prerelease$1;
+  createToken('MAINVERSION', "(".concat(src[t.NUMERICIDENTIFIER], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIER], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIER], ")"));
+  createToken('MAINVERSIONLOOSE', "(".concat(src[t.NUMERICIDENTIFIERLOOSE], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIERLOOSE], ")\\.") + "(".concat(src[t.NUMERICIDENTIFIERLOOSE], ")"));
 
-const SemVer$7 = semver$1;
-const compare$b = (a, b, loose) => new SemVer$7(a, loose).compare(new SemVer$7(b, loose));
-var compare_1 = compare$b;
+  // ## Pre-release Version Identifier
+  // A numeric identifier, or a non-numeric identifier.
 
-const compare$a = compare_1;
-const rcompare$1 = (a, b, loose) => compare$a(b, a, loose);
-var rcompare_1 = rcompare$1;
+  createToken('PRERELEASEIDENTIFIER', "(?:".concat(src[t.NUMERICIDENTIFIER], "|").concat(src[t.NONNUMERICIDENTIFIER], ")"));
+  createToken('PRERELEASEIDENTIFIERLOOSE', "(?:".concat(src[t.NUMERICIDENTIFIERLOOSE], "|").concat(src[t.NONNUMERICIDENTIFIER], ")"));
 
-const compare$9 = compare_1;
-const compareLoose$1 = (a, b) => compare$9(a, b, true);
-var compareLoose_1 = compareLoose$1;
+  // ## Pre-release Version
+  // Hyphen, followed by one or more dot-separated pre-release version
+  // identifiers.
 
-const SemVer$6 = semver$1;
-const compareBuild$3 = (a, b, loose) => {
-  const versionA = new SemVer$6(a, loose);
-  const versionB = new SemVer$6(b, loose);
-  return versionA.compare(versionB) || versionA.compareBuild(versionB);
-};
-var compareBuild_1 = compareBuild$3;
+  createToken('PRERELEASE', "(?:-(".concat(src[t.PRERELEASEIDENTIFIER], "(?:\\.").concat(src[t.PRERELEASEIDENTIFIER], ")*))"));
+  createToken('PRERELEASELOOSE', "(?:-?(".concat(src[t.PRERELEASEIDENTIFIERLOOSE], "(?:\\.").concat(src[t.PRERELEASEIDENTIFIERLOOSE], ")*))"));
 
-const compareBuild$2 = compareBuild_1;
-const sort$1 = (list, loose) => list.sort((a, b) => compareBuild$2(a, b, loose));
-var sort_1 = sort$1;
+  // ## Build Metadata Identifier
+  // Any combination of digits, letters, or hyphens.
 
-const compareBuild$1 = compareBuild_1;
-const rsort$1 = (list, loose) => list.sort((a, b) => compareBuild$1(b, a, loose));
-var rsort_1 = rsort$1;
+  createToken('BUILDIDENTIFIER', "".concat(LETTERDASHNUMBER, "+"));
 
-const compare$8 = compare_1;
-const gt$4 = (a, b, loose) => compare$8(a, b, loose) > 0;
-var gt_1 = gt$4;
+  // ## Build Metadata
+  // Plus sign, followed by one or more period-separated build metadata
+  // identifiers.
 
-const compare$7 = compare_1;
-const lt$3 = (a, b, loose) => compare$7(a, b, loose) < 0;
-var lt_1 = lt$3;
+  createToken('BUILD', "(?:\\+(".concat(src[t.BUILDIDENTIFIER], "(?:\\.").concat(src[t.BUILDIDENTIFIER], ")*))"));
 
-const compare$6 = compare_1;
-const eq$2 = (a, b, loose) => compare$6(a, b, loose) === 0;
-var eq_1 = eq$2;
+  // ## Full Version String
+  // A main version, followed optionally by a pre-release version and
+  // build metadata.
 
-const compare$5 = compare_1;
-const neq$2 = (a, b, loose) => compare$5(a, b, loose) !== 0;
-var neq_1 = neq$2;
+  // 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.
 
-const compare$4 = compare_1;
-const gte$3 = (a, b, loose) => compare$4(a, b, loose) >= 0;
-var gte_1 = gte$3;
+  createToken('FULLPLAIN', "v?".concat(src[t.MAINVERSION]).concat(src[t.PRERELEASE], "?").concat(src[t.BUILD], "?"));
+  createToken('FULL', "^".concat(src[t.FULLPLAIN], "$"));
 
-const compare$3 = compare_1;
-const lte$3 = (a, b, loose) => compare$3(a, b, loose) <= 0;
-var lte_1 = lte$3;
-
-const eq$1 = eq_1;
-const neq$1 = neq_1;
-const gt$3 = gt_1;
-const gte$2 = gte_1;
-const lt$2 = lt_1;
-const lte$2 = lte_1;
-const cmp$1 = (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$1(a, b, loose);
-    case '!=':
-      return neq$1(a, b, loose);
-    case '>':
-      return gt$3(a, b, loose);
-    case '>=':
-      return gte$2(a, b, loose);
-    case '<':
-      return lt$2(a, b, loose);
-    case '<=':
-      return lte$2(a, b, loose);
-    default:
-      throw new TypeError("Invalid operator: ".concat(op));
-  }
-};
-var cmp_1 = cmp$1;
-
-const SemVer$5 = semver$1;
-const parse$1 = parse_1;
-const {
-  safeRe: re,
-  t
-} = reExports;
-const coerce$1 = (version, options) => {
-  if (version instanceof SemVer$5) {
-    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(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'
-    //
-    // 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.
-    let next;
-    while ((next = re[t.COERCERTL].exec(version)) && (!match || match.index + match[0].length !== version.length)) {
-      if (!match || next.index + next[0].length !== match.index + match[0].length) {
-        match = next;
-      }
-      re[t.COERCERTL].lastIndex = next.index + next[1].length + next[2].length;
-    }
-    // leave it in a clean state
-    re[t.COERCERTL].lastIndex = -1;
-  }
-  if (match === null) {
-    return null;
-  }
-  return parse$1("".concat(match[2], ".").concat(match[3] || '0', ".").concat(match[4] || '0'), options);
-};
-var coerce_1 = coerce$1;
-
-var iterator;
-var hasRequiredIterator;
-
-function requireIterator () {
-	if (hasRequiredIterator) return iterator;
-	hasRequiredIterator = 1;
-	iterator = function (Yallist) {
-	  Yallist.prototype[Symbol.iterator] = function* () {
-	    for (let walker = this.head; walker; walker = walker.next) {
-	      yield walker.value;
-	    }
-	  };
-	};
-	return iterator;
-}
-
-var yallist;
-var hasRequiredYallist;
-
-function requireYallist () {
-	if (hasRequiredYallist) return yallist;
-	hasRequiredYallist = 1;
-	yallist = Yallist;
-
-	Yallist.Node = Node;
-	Yallist.create = Yallist;
-
-	function Yallist (list) {
-	  var self = this;
-	  if (!(self instanceof Yallist)) {
-	    self = new Yallist();
-	  }
-
-	  self.tail = null;
-	  self.head = null;
-	  self.length = 0;
-
-	  if (list && typeof list.forEach === 'function') {
-	    list.forEach(function (item) {
-	      self.push(item);
-	    });
-	  } else if (arguments.length > 0) {
-	    for (var i = 0, l = arguments.length; i < l; i++) {
-	      self.push(arguments[i]);
-	    }
-	  }
-
-	  return self
-	}
-
-	Yallist.prototype.removeNode = function (node) {
-	  if (node.list !== this) {
-	    throw new Error('removing node which does not belong to this list')
-	  }
-
-	  var next = node.next;
-	  var prev = node.prev;
-
-	  if (next) {
-	    next.prev = prev;
-	  }
-
-	  if (prev) {
-	    prev.next = next;
-	  }
-
-	  if (node === this.head) {
-	    this.head = next;
-	  }
-	  if (node === this.tail) {
-	    this.tail = prev;
-	  }
-
-	  node.list.length--;
-	  node.next = null;
-	  node.prev = null;
-	  node.list = null;
-
-	  return next
-	};
-
-	Yallist.prototype.unshiftNode = function (node) {
-	  if (node === this.head) {
-	    return
-	  }
-
-	  if (node.list) {
-	    node.list.removeNode(node);
-	  }
-
-	  var head = this.head;
-	  node.list = this;
-	  node.next = head;
-	  if (head) {
-	    head.prev = node;
-	  }
-
-	  this.head = node;
-	  if (!this.tail) {
-	    this.tail = node;
-	  }
-	  this.length++;
-	};
-
-	Yallist.prototype.pushNode = function (node) {
-	  if (node === this.tail) {
-	    return
-	  }
-
-	  if (node.list) {
-	    node.list.removeNode(node);
-	  }
-
-	  var tail = this.tail;
-	  node.list = this;
-	  node.prev = tail;
-	  if (tail) {
-	    tail.next = node;
-	  }
-
-	  this.tail = node;
-	  if (!this.head) {
-	    this.head = node;
-	  }
-	  this.length++;
-	};
-
-	Yallist.prototype.push = function () {
-	  for (var i = 0, l = arguments.length; i < l; i++) {
-	    push(this, arguments[i]);
-	  }
-	  return this.length
-	};
-
-	Yallist.prototype.unshift = function () {
-	  for (var i = 0, l = arguments.length; i < l; i++) {
-	    unshift(this, arguments[i]);
-	  }
-	  return this.length
-	};
-
-	Yallist.prototype.pop = function () {
-	  if (!this.tail) {
-	    return undefined
-	  }
-
-	  var res = this.tail.value;
-	  this.tail = this.tail.prev;
-	  if (this.tail) {
-	    this.tail.next = null;
-	  } else {
-	    this.head = null;
-	  }
-	  this.length--;
-	  return res
-	};
-
-	Yallist.prototype.shift = function () {
-	  if (!this.head) {
-	    return undefined
-	  }
-
-	  var res = this.head.value;
-	  this.head = this.head.next;
-	  if (this.head) {
-	    this.head.prev = null;
-	  } else {
-	    this.tail = null;
-	  }
-	  this.length--;
-	  return res
-	};
-
-	Yallist.prototype.forEach = function (fn, thisp) {
-	  thisp = thisp || this;
-	  for (var walker = this.head, i = 0; walker !== null; i++) {
-	    fn.call(thisp, walker.value, i, this);
-	    walker = walker.next;
-	  }
-	};
-
-	Yallist.prototype.forEachReverse = function (fn, thisp) {
-	  thisp = thisp || this;
-	  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {
-	    fn.call(thisp, walker.value, i, this);
-	    walker = walker.prev;
-	  }
-	};
-
-	Yallist.prototype.get = function (n) {
-	  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
-	    // abort out of the list early if we hit a cycle
-	    walker = walker.next;
-	  }
-	  if (i === n && walker !== null) {
-	    return walker.value
-	  }
-	};
-
-	Yallist.prototype.getReverse = function (n) {
-	  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
-	    // abort out of the list early if we hit a cycle
-	    walker = walker.prev;
-	  }
-	  if (i === n && walker !== null) {
-	    return walker.value
-	  }
-	};
-
-	Yallist.prototype.map = function (fn, thisp) {
-	  thisp = thisp || this;
-	  var res = new Yallist();
-	  for (var walker = this.head; walker !== null;) {
-	    res.push(fn.call(thisp, walker.value, this));
-	    walker = walker.next;
-	  }
-	  return res
-	};
-
-	Yallist.prototype.mapReverse = function (fn, thisp) {
-	  thisp = thisp || this;
-	  var res = new Yallist();
-	  for (var walker = this.tail; walker !== null;) {
-	    res.push(fn.call(thisp, walker.value, this));
-	    walker = walker.prev;
-	  }
-	  return res
-	};
-
-	Yallist.prototype.reduce = function (fn, initial) {
-	  var acc;
-	  var walker = this.head;
-	  if (arguments.length > 1) {
-	    acc = initial;
-	  } else if (this.head) {
-	    walker = this.head.next;
-	    acc = this.head.value;
-	  } else {
-	    throw new TypeError('Reduce of empty list with no initial value')
-	  }
-
-	  for (var i = 0; walker !== null; i++) {
-	    acc = fn(acc, walker.value, i);
-	    walker = walker.next;
-	  }
-
-	  return acc
-	};
-
-	Yallist.prototype.reduceReverse = function (fn, initial) {
-	  var acc;
-	  var walker = this.tail;
-	  if (arguments.length > 1) {
-	    acc = initial;
-	  } else if (this.tail) {
-	    walker = this.tail.prev;
-	    acc = this.tail.value;
-	  } else {
-	    throw new TypeError('Reduce of empty list with no initial value')
-	  }
-
-	  for (var i = this.length - 1; walker !== null; i--) {
-	    acc = fn(acc, walker.value, i);
-	    walker = walker.prev;
-	  }
-
-	  return acc
-	};
-
-	Yallist.prototype.toArray = function () {
-	  var arr = new Array(this.length);
-	  for (var i = 0, walker = this.head; walker !== null; i++) {
-	    arr[i] = walker.value;
-	    walker = walker.next;
-	  }
-	  return arr
-	};
-
-	Yallist.prototype.toArrayReverse = function () {
-	  var arr = new Array(this.length);
-	  for (var i = 0, walker = this.tail; walker !== null; i++) {
-	    arr[i] = walker.value;
-	    walker = walker.prev;
-	  }
-	  return arr
-	};
-
-	Yallist.prototype.slice = function (from, to) {
-	  to = to || this.length;
-	  if (to < 0) {
-	    to += this.length;
-	  }
-	  from = from || 0;
-	  if (from < 0) {
-	    from += this.length;
-	  }
-	  var ret = new Yallist();
-	  if (to < from || to < 0) {
-	    return ret
-	  }
-	  if (from < 0) {
-	    from = 0;
-	  }
-	  if (to > this.length) {
-	    to = this.length;
-	  }
-	  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
-	    walker = walker.next;
-	  }
-	  for (; walker !== null && i < to; i++, walker = walker.next) {
-	    ret.push(walker.value);
-	  }
-	  return ret
-	};
-
-	Yallist.prototype.sliceReverse = function (from, to) {
-	  to = to || this.length;
-	  if (to < 0) {
-	    to += this.length;
-	  }
-	  from = from || 0;
-	  if (from < 0) {
-	    from += this.length;
-	  }
-	  var ret = new Yallist();
-	  if (to < from || to < 0) {
-	    return ret
-	  }
-	  if (from < 0) {
-	    from = 0;
-	  }
-	  if (to > this.length) {
-	    to = this.length;
-	  }
-	  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {
-	    walker = walker.prev;
-	  }
-	  for (; walker !== null && i > from; i--, walker = walker.prev) {
-	    ret.push(walker.value);
-	  }
-	  return ret
-	};
-
-	Yallist.prototype.splice = function (start, deleteCount, ...nodes) {
-	  if (start > this.length) {
-	    start = this.length - 1;
-	  }
-	  if (start < 0) {
-	    start = this.length + start;
-	  }
-
-	  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
-	    walker = walker.next;
-	  }
-
-	  var ret = [];
-	  for (var i = 0; walker && i < deleteCount; i++) {
-	    ret.push(walker.value);
-	    walker = this.removeNode(walker);
-	  }
-	  if (walker === null) {
-	    walker = this.tail;
-	  }
-
-	  if (walker !== this.head && walker !== this.tail) {
-	    walker = walker.prev;
-	  }
-
-	  for (var i = 0; i < nodes.length; i++) {
-	    walker = insert(this, walker, nodes[i]);
-	  }
-	  return ret;
-	};
+  // 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]*".concat(src[t.MAINVERSIONLOOSE]).concat(src[t.PRERELEASELOOSE], "?").concat(src[t.BUILD], "?"));
+  createToken('LOOSE', "^".concat(src[t.LOOSEPLAIN], "$"));
+  createToken('GTLT', '((?:<|>)?=?)');
 
-	Yallist.prototype.reverse = function () {
-	  var head = this.head;
-	  var tail = this.tail;
-	  for (var walker = head; walker !== null; walker = walker.prev) {
-	    var p = walker.prev;
-	    walker.prev = walker.next;
-	    walker.next = p;
-	  }
-	  this.head = tail;
-	  this.tail = head;
-	  return this
-	};
+  // 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', "".concat(src[t.NUMERICIDENTIFIERLOOSE], "|x|X|\\*"));
+  createToken('XRANGEIDENTIFIER', "".concat(src[t.NUMERICIDENTIFIER], "|x|X|\\*"));
+  createToken('XRANGEPLAIN', "[v=\\s]*(".concat(src[t.XRANGEIDENTIFIER], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIER], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIER], ")") + "(?:".concat(src[t.PRERELEASE], ")?").concat(src[t.BUILD], "?") + ")?)?");
+  createToken('XRANGEPLAINLOOSE', "[v=\\s]*(".concat(src[t.XRANGEIDENTIFIERLOOSE], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIERLOOSE], ")") + "(?:\\.(".concat(src[t.XRANGEIDENTIFIERLOOSE], ")") + "(?:".concat(src[t.PRERELEASELOOSE], ")?").concat(src[t.BUILD], "?") + ")?)?");
+  createToken('XRANGE', "^".concat(src[t.GTLT], "\\s*").concat(src[t.XRANGEPLAIN], "$"));
+  createToken('XRANGELOOSE', "^".concat(src[t.GTLT], "\\s*").concat(src[t.XRANGEPLAINLOOSE], "$"));
 
-	function insert (self, node, value) {
-	  var inserted = node === self.head ?
-	    new Node(value, null, node, self) :
-	    new Node(value, node, node.next, self);
+  // Coercion.
+  // Extract anything that could conceivably be a part of a valid semver
+  createToken('COERCE', "".concat('(^|[^\\d])' + '(\\d{1,').concat(MAX_SAFE_COMPONENT_LENGTH, "})") + "(?:\\.(\\d{1,".concat(MAX_SAFE_COMPONENT_LENGTH, "}))?") + "(?:\\.(\\d{1,".concat(MAX_SAFE_COMPONENT_LENGTH, "}))?") + "(?:$|[^\\d])");
+  createToken('COERCERTL', src[t.COERCE], true);
 
-	  if (inserted.next === null) {
-	    self.tail = inserted;
-	  }
-	  if (inserted.prev === null) {
-	    self.head = inserted;
-	  }
+  // Tilde ranges.
+  // Meaning is "reasonably at or greater than"
+  createToken('LONETILDE', '(?:~>?)');
+  createToken('TILDETRIM', "(\\s*)".concat(src[t.LONETILDE], "\\s+"), true);
+  exports.tildeTrimReplace = '$1~';
+  createToken('TILDE', "^".concat(src[t.LONETILDE]).concat(src[t.XRANGEPLAIN], "$"));
+  createToken('TILDELOOSE', "^".concat(src[t.LONETILDE]).concat(src[t.XRANGEPLAINLOOSE], "$"));
 
-	  self.length++;
+  // Caret ranges.
+  // Meaning is "at least and backwards compatible with"
+  createToken('LONECARET', '(?:\\^)');
+  createToken('CARETTRIM', "(\\s*)".concat(src[t.LONECARET], "\\s+"), true);
+  exports.caretTrimReplace = '$1^';
+  createToken('CARET', "^".concat(src[t.LONECARET]).concat(src[t.XRANGEPLAIN], "$"));
+  createToken('CARETLOOSE', "^".concat(src[t.LONECARET]).concat(src[t.XRANGEPLAINLOOSE], "$"));
 
-	  return inserted
-	}
+  // A simple gt/lt/eq thing, or just "" to indicate "any version"
+  createToken('COMPARATORLOOSE', "^".concat(src[t.GTLT], "\\s*(").concat(src[t.LOOSEPLAIN], ")$|^$"));
+  createToken('COMPARATOR', "^".concat(src[t.GTLT], "\\s*(").concat(src[t.FULLPLAIN], ")$|^$"));
 
-	function push (self, item) {
-	  self.tail = new Node(item, self.tail, null, self);
-	  if (!self.head) {
-	    self.head = self.tail;
-	  }
-	  self.length++;
-	}
+  // 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*)".concat(src[t.GTLT], "\\s*(").concat(src[t.LOOSEPLAIN], "|").concat(src[t.XRANGEPLAIN], ")"), true);
+  exports.comparatorTrimReplace = '$1$2$3';
 
-	function unshift (self, item) {
-	  self.head = new Node(item, null, self.head, self);
-	  if (!self.tail) {
-	    self.tail = self.head;
-	  }
-	  self.length++;
-	}
+  // 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*(".concat(src[t.XRANGEPLAIN], ")") + "\\s+-\\s+" + "(".concat(src[t.XRANGEPLAIN], ")") + "\\s*$");
+  createToken('HYPHENRANGELOOSE', "^\\s*(".concat(src[t.XRANGEPLAINLOOSE], ")") + "\\s+-\\s+" + "(".concat(src[t.XRANGEPLAINLOOSE], ")") + "\\s*$");
 
-	function Node (value, prev, next, list) {
-	  if (!(this instanceof Node)) {
-	    return new Node(value, prev, next, list)
-	  }
-
-	  this.list = list;
-	  this.value = value;
-
-	  if (prev) {
-	    prev.next = this;
-	    this.prev = prev;
-	  } else {
-	    this.prev = null;
-	  }
-
-	  if (next) {
-	    next.prev = this;
-	    this.next = next;
-	  } else {
-	    this.next = null;
-	  }
-	}
+  // 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$1, re$1.exports);
+var reExports = re$1.exports;
 
-	try {
-	  // add if support for Symbol.iterator is present
-	  requireIterator()(Yallist);
-	} catch (er) {}
-	return yallist;
-}
-
-var lruCache;
-var hasRequiredLruCache;
-function requireLruCache() {
-  if (hasRequiredLruCache) return lruCache;
-  hasRequiredLruCache = 1;
-
-  // A linked list to keep track of recently-used-ness
-  const Yallist = requireYallist();
-  const MAX = Symbol('max');
-  const LENGTH = Symbol('length');
-  const LENGTH_CALCULATOR = Symbol('lengthCalculator');
-  const ALLOW_STALE = Symbol('allowStale');
-  const MAX_AGE = Symbol('maxAge');
-  const DISPOSE = Symbol('dispose');
-  const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
-  const LRU_LIST = Symbol('lruList');
-  const CACHE = Symbol('cache');
-  const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
-  const naiveLength = () => 1;
-
-  // lruList is a yallist where the head is the youngest
-  // item, and the tail is the oldest.  the list contains the Hit
-  // objects as the entries.
-  // Each Hit object has a reference to its Yallist.Node.  This
-  // never changes.
-  //
-  // cache is a Map (or PseudoMap) that matches the keys to
-  // the Yallist.Node object.
-  class LRUCache {
-    constructor(options) {
-      if (typeof options === 'number') options = {
-        max: options
-      };
-      if (!options) options = {};
-      if (options.max && (typeof options.max !== 'number' || options.max < 0)) throw new TypeError('max must be a non-negative number');
-      // Kind of weird to have a default max of Infinity, but oh well.
-      this[MAX] = options.max || Infinity;
-      const lc = options.length || naiveLength;
-      this[LENGTH_CALCULATOR] = typeof lc !== 'function' ? naiveLength : lc;
-      this[ALLOW_STALE] = options.stale || false;
-      if (options.maxAge && typeof options.maxAge !== 'number') throw new TypeError('maxAge must be a number');
-      this[MAX_AGE] = options.maxAge || 0;
-      this[DISPOSE] = options.dispose;
-      this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
-      this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
-      this.reset();
-    }
-
-    // resize the cache when the max changes.
-    set max(mL) {
-      if (typeof mL !== 'number' || mL < 0) throw new TypeError('max must be a non-negative number');
-      this[MAX] = mL || Infinity;
-      trim(this);
-    }
-    get max() {
-      return this[MAX];
-    }
-    set allowStale(allowStale) {
-      this[ALLOW_STALE] = !!allowStale;
-    }
-    get allowStale() {
-      return this[ALLOW_STALE];
-    }
-    set maxAge(mA) {
-      if (typeof mA !== 'number') throw new TypeError('maxAge must be a non-negative number');
-      this[MAX_AGE] = mA;
-      trim(this);
-    }
-    get maxAge() {
-      return this[MAX_AGE];
-    }
+const numeric = /^[0-9]+$/;
+const compareIdentifiers$1 = (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$1(b, a);
+var identifiers = {
+  compareIdentifiers: compareIdentifiers$1,
+  rcompareIdentifiers
+};
 
-    // resize the cache when the lengthCalculator changes.
-    set lengthCalculator(lC) {
-      if (typeof lC !== 'function') lC = naiveLength;
-      if (lC !== this[LENGTH_CALCULATOR]) {
-        this[LENGTH_CALCULATOR] = lC;
-        this[LENGTH] = 0;
-        this[LRU_LIST].forEach(hit => {
-          hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
-          this[LENGTH] += hit.length;
-        });
+const debug = debug_1;
+const {
+  MAX_LENGTH,
+  MAX_SAFE_INTEGER
+} = constants;
+const {
+  safeRe: re,
+  t
+} = reExports;
+const parseOptions = parseOptions_1;
+const {
+  compareIdentifiers
+} = identifiers;
+let SemVer$1 = 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;
       }
-      trim(this);
-    }
-    get lengthCalculator() {
-      return this[LENGTH_CALCULATOR];
-    }
-    get length() {
-      return this[LENGTH];
+    } else if (typeof version !== 'string') {
+      throw new TypeError("Invalid version. Must be a string. Got type \"".concat(typeof version, "\"."));
     }
-    get itemCount() {
-      return this[LRU_LIST].length;
+    if (version.length > MAX_LENGTH) {
+      throw new TypeError("version is longer than ".concat(MAX_LENGTH, " characters"));
     }
-    rforEach(fn, thisp) {
-      thisp = thisp || this;
-      for (let walker = this[LRU_LIST].tail; walker !== null;) {
-        const prev = walker.prev;
-        forEachStep(this, fn, walker, thisp);
-        walker = prev;
-      }
+    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: ".concat(version));
     }
-    forEach(fn, thisp) {
-      thisp = thisp || this;
-      for (let walker = this[LRU_LIST].head; walker !== null;) {
-        const next = walker.next;
-        forEachStep(this, fn, walker, thisp);
-        walker = next;
-      }
+    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');
     }
-    keys() {
-      return this[LRU_LIST].toArray().map(k => k.key);
+    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {
+      throw new TypeError('Invalid minor version');
     }
-    values() {
-      return this[LRU_LIST].toArray().map(k => k.value);
+    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {
+      throw new TypeError('Invalid patch version');
     }
-    reset() {
-      if (this[DISPOSE] && this[LRU_LIST] && this[LRU_LIST].length) {
-        this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value));
-      }
-      this[CACHE] = new Map(); // hash of items by key
-      this[LRU_LIST] = new Yallist(); // list of items in order of use recency
-      this[LENGTH] = 0; // length of items in the list
-    }
-
-    dump() {
-      return this[LRU_LIST].map(hit => isStale(this, hit) ? false : {
-        k: hit.key,
-        v: hit.value,
-        e: hit.now + (hit.maxAge || 0)
-      }).toArray().filter(h => h);
-    }
-    dumpLru() {
-      return this[LRU_LIST];
-    }
-    set(key, value, maxAge) {
-      maxAge = maxAge || this[MAX_AGE];
-      if (maxAge && typeof maxAge !== 'number') throw new TypeError('maxAge must be a number');
-      const now = maxAge ? Date.now() : 0;
-      const len = this[LENGTH_CALCULATOR](value, key);
-      if (this[CACHE].has(key)) {
-        if (len > this[MAX]) {
-          del(this, this[CACHE].get(key));
-          return false;
-        }
-        const node = this[CACHE].get(key);
-        const item = node.value;
-
-        // dispose of the old one before overwriting
-        // split out into 2 ifs for better coverage tracking
-        if (this[DISPOSE]) {
-          if (!this[NO_DISPOSE_ON_SET]) this[DISPOSE](key, item.value);
-        }
-        item.now = now;
-        item.maxAge = maxAge;
-        item.value = value;
-        this[LENGTH] += len - item.length;
-        item.length = len;
-        this.get(key);
-        trim(this);
-        return true;
-      }
-      const hit = new Entry(key, value, len, now, maxAge);
 
-      // oversized objects fall out of cache automatically.
-      if (hit.length > this[MAX]) {
-        if (this[DISPOSE]) this[DISPOSE](key, value);
-        return false;
-      }
-      this[LENGTH] += hit.length;
-      this[LRU_LIST].unshift(hit);
-      this[CACHE].set(key, this[LRU_LIST].head);
-      trim(this);
-      return true;
-    }
-    has(key) {
-      if (!this[CACHE].has(key)) return false;
-      const hit = this[CACHE].get(key).value;
-      return !isStale(this, hit);
-    }
-    get(key) {
-      return get(this, key, true);
-    }
-    peek(key) {
-      return get(this, key, false);
-    }
-    pop() {
-      const node = this[LRU_LIST].tail;
-      if (!node) return null;
-      del(this, node);
-      return node.value;
-    }
-    del(key) {
-      del(this, this[CACHE].get(key));
-    }
-    load(arr) {
-      // reset the cache
-      this.reset();
-      const now = Date.now();
-      // A previous serialized cache has the most recent items first
-      for (let l = arr.length - 1; l >= 0; l--) {
-        const hit = arr[l];
-        const expiresAt = hit.e || 0;
-        if (expiresAt === 0)
-          // the item was created without expiration in a non aged cache
-          this.set(hit.k, hit.v);else {
-          const maxAge = expiresAt - now;
-          // dont add already expired items
-          if (maxAge > 0) {
-            this.set(hit.k, hit.v, maxAge);
+    // 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;
           }
         }
-      }
-    }
-    prune() {
-      this[CACHE].forEach((value, key) => get(this, key, false));
+        return id;
+      });
     }
+    this.build = m[5] ? m[5].split('.') : [];
+    this.format();
   }
-  const get = (self, key, doUse) => {
-    const node = self[CACHE].get(key);
-    if (node) {
-      const hit = node.value;
-      if (isStale(self, hit)) {
-        del(self, node);
-        if (!self[ALLOW_STALE]) return undefined;
-      } else {
-        if (doUse) {
-          if (self[UPDATE_AGE_ON_GET]) node.value.now = Date.now();
-          self[LRU_LIST].unshiftNode(node);
-        }
-      }
-      return hit.value;
+  format() {
+    this.version = "".concat(this.major, ".").concat(this.minor, ".").concat(this.patch);
+    if (this.prerelease.length) {
+      this.version += "-".concat(this.prerelease.join('.'));
     }
-  };
-  const isStale = (self, hit) => {
-    if (!hit || !hit.maxAge && !self[MAX_AGE]) return false;
-    const diff = Date.now() - hit.now;
-    return hit.maxAge ? diff > hit.maxAge : self[MAX_AGE] && diff > self[MAX_AGE];
-  };
-  const trim = self => {
-    if (self[LENGTH] > self[MAX]) {
-      for (let walker = self[LRU_LIST].tail; self[LENGTH] > self[MAX] && walker !== null;) {
-        // We know that we're about to delete this one, and also
-        // what the next least recently used key will be, so just
-        // go ahead and set it now.
-        const prev = walker.prev;
-        del(self, walker);
-        walker = prev;
+    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);
     }
-  };
-  const del = (self, node) => {
-    if (node) {
-      const hit = node.value;
-      if (self[DISPOSE]) self[DISPOSE](hit.key, hit.value);
-      self[LENGTH] -= hit.length;
-      self[CACHE].delete(hit.key);
-      self[LRU_LIST].removeNode(node);
+    if (other.version === this.version) {
+      return 0;
     }
-  };
-  class Entry {
-    constructor(key, value, length, now, maxAge) {
-      this.key = key;
-      this.value = value;
-      this.length = length;
-      this.now = now;
-      this.maxAge = maxAge || 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);
   }
-  const forEachStep = (self, fn, node, thisp) => {
-    let hit = node.value;
-    if (isStale(self, hit)) {
-      del(self, node);
-      if (!self[ALLOW_STALE]) hit = undefined;
+  comparePre(other) {
+    if (!(other instanceof SemVer)) {
+      other = new SemVer(other, this.options);
     }
-    if (hit) fn.call(thisp, hit.value, hit.key, self);
-  };
-  lruCache = LRUCache;
-  return lruCache;
-}
 
-var range;
-var hasRequiredRange;
-function requireRange() {
-  if (hasRequiredRange) return range;
-  hasRequiredRange = 1;
-  // 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.format();
-        return this;
+    // 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);
       }
-      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().split(/\s+/).join(' ');
-
-      // 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: ".concat(this.raw));
+    } 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('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);
+  }
 
-      // 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;
+  // 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) {
+    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 '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 (!identifier && identifierBase === false) {
+            throw new Error('invalid increment argument: identifier is empty');
+          }
+          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;
         }
-      }
-      this.format();
+      default:
+        throw new Error("invalid increment argument: ".concat(release));
     }
-    format() {
-      this.range = this.set.map(comps => comps.join(' ').trim()).join('||').trim();
-      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;
+    this.raw = this.format();
+    if (this.build.length) {
+      this.raw += "+".concat(this.build.join('.'));
     }
+    return this;
   }
-  range = Range;
-  const LRU = requireLruCache();
-  const cache = new LRU({
-    max: 1000
-  });
-  const parseOptions = parseOptions_1;
-  const Comparator = requireComparator();
-  const debug = debug_1;
-  const SemVer = semver$1;
-  const {
-    safeRe: re,
-    t,
-    comparatorTrimReplace,
-    tildeTrimReplace,
-    caretTrimReplace
-  } = reExports;
-  const {
-    FLAG_INCLUDE_PRERELEASE,
-    FLAG_LOOSE
-  } = constants$1;
-  const isNullSet = c => c.value === '<0.0.0-0';
-  const isAny = c => c.value === '';
+};
+var semver = SemVer$1;
 
-  // 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;
-  };
+const SemVer = semver;
+const compare$6 = (a, b, loose) => new SemVer(a, loose).compare(new SemVer(b, loose));
+var compare_1 = compare$6;
 
-  // 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 === '*';
+const compare$5 = compare_1;
+const eq$1 = (a, b, loose) => compare$5(a, b, loose) === 0;
+var eq_1 = eq$1;
 
-  // ~, ~> --> * (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 = ">=".concat(M, ".0.0 <").concat(+M + 1, ".0.0-0");
-      } else if (isX(p)) {
-        // ~1.2 == >=1.2.0 <1.3.0-0
-        ret = ">=".concat(M, ".").concat(m, ".0 <").concat(M, ".").concat(+m + 1, ".0-0");
-      } else if (pr) {
-        debug('replaceTilde pr', pr);
-        ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(M, ".").concat(+m + 1, ".0-0");
-      } else {
-        // ~1.2.3 == >=1.2.3 <1.3.0-0
-        ret = ">=".concat(M, ".").concat(m, ".").concat(p, " <").concat(M, ".").concat(+m + 1, ".0-0");
-      }
-      debug('tilde return', ret);
-      return ret;
-    });
-  };
+const compare$4 = compare_1;
+const neq$1 = (a, b, loose) => compare$4(a, b, loose) !== 0;
+var neq_1 = neq$1;
 
-  // ^ --> * (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 = ">=".concat(M, ".0.0").concat(z, " <").concat(+M + 1, ".0.0-0");
-      } else if (isX(p)) {
-        if (M === '0') {
-          ret = ">=".concat(M, ".").concat(m, ".0").concat(z, " <").concat(M, ".").concat(+m + 1, ".0-0");
-        } else {
-          ret = ">=".concat(M, ".").concat(m, ".0").concat(z, " <").concat(+M + 1, ".0.0-0");
-        }
-      } else if (pr) {
-        debug('replaceCaret pr', pr);
-        if (M === '0') {
-          if (m === '0') {
-            ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(M, ".").concat(m, ".").concat(+p + 1, "-0");
-          } else {
-            ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(M, ".").concat(+m + 1, ".0-0");
-          }
-        } else {
-          ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(+M + 1, ".0.0-0");
-        }
-      } else {
-        debug('no pr');
-        if (M === '0') {
-          if (m === '0') {
-            ret = ">=".concat(M, ".").concat(m, ".").concat(p).concat(z, " <").concat(M, ".").concat(m, ".").concat(+p + 1, "-0");
-          } else {
-            ret = ">=".concat(M, ".").concat(m, ".").concat(p).concat(z, " <").concat(M, ".").concat(+m + 1, ".0-0");
-          }
-        } else {
-          ret = ">=".concat(M, ".").concat(m, ".").concat(p, " <").concat(+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 = '';
-      }
+const compare$3 = compare_1;
+const gt$1 = (a, b, loose) => compare$3(a, b, loose) > 0;
+var gt_1 = gt$1;
 
-      // 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 = "".concat(gtlt + M, ".").concat(m, ".").concat(p).concat(pr);
-      } else if (xm) {
-        ret = ">=".concat(M, ".0.0").concat(pr, " <").concat(+M + 1, ".0.0-0");
-      } else if (xp) {
-        ret = ">=".concat(M, ".").concat(m, ".0").concat(pr, " <").concat(M, ".").concat(+m + 1, ".0-0");
-      }
-      debug('xRange return', ret);
-      return ret;
-    });
-  };
+const compare$2 = compare_1;
+const gte$1 = (a, b, loose) => compare$2(a, b, loose) >= 0;
+var gte_1 = gte$1;
 
-  // 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], '');
-  };
+const compare$1 = compare_1;
+const lt$1 = (a, b, loose) => compare$1(a, b, loose) < 0;
+var lt_1 = lt$1;
 
-  // 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
-  const hyphenReplace = incPr => ($0, from, fM, fm, fp, fpr, fb, to, tM, tm, tp, tpr, tb) => {
-    if (isX(fM)) {
-      from = '';
-    } else if (isX(fm)) {
-      from = ">=".concat(fM, ".0.0").concat(incPr ? '-0' : '');
-    } else if (isX(fp)) {
-      from = ">=".concat(fM, ".").concat(fm, ".0").concat(incPr ? '-0' : '');
-    } else if (fpr) {
-      from = ">=".concat(from);
-    } else {
-      from = ">=".concat(from).concat(incPr ? '-0' : '');
-    }
-    if (isX(tM)) {
-      to = '';
-    } else if (isX(tm)) {
-      to = "<".concat(+tM + 1, ".0.0-0");
-    } else if (isX(tp)) {
-      to = "<".concat(tM, ".").concat(+tm + 1, ".0-0");
-    } else if (tpr) {
-      to = "<=".concat(tM, ".").concat(tm, ".").concat(tp, "-").concat(tpr);
-    } else if (incPr) {
-      to = "<".concat(tM, ".").concat(tm, ".").concat(+tp + 1, "-0");
-    } else {
-      to = "<=".concat(to);
-    }
-    return "".concat(from, " ").concat(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;
-          }
-        }
+const compare = compare_1;
+const lte$1 = (a, b, loose) => compare(a, b, loose) <= 0;
+var lte_1 = lte$1;
+
+const eq = eq_1;
+const neq = neq_1;
+const gt = gt_1;
+const gte = gte_1;
+const lt = lt_1;
+const lte = lte_1;
+const cmp = (a, op, b, loose) => {
+  switch (op) {
+    case '===':
+      if (typeof a === 'object') {
+        a = a.version;
       }
-
-      // Version has a -pre, but it's not one of the ones we like.
-      return false;
-    }
-    return true;
-  };
-  return range;
-}
+      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: ".concat(op));
+  }
+};
+var cmp_1 = cmp;
 
 var comparator;
 var hasRequiredComparator;
@@ -25694,43 +25050,263 @@ function requireComparator() {
           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;
+      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: ".concat(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 = parseOptions_1;
+  const {
+    safeRe: re,
+    t
+  } = reExports;
+  const cmp = cmp_1;
+  const debug = debug_1;
+  const SemVer = semver;
+  const Range = requireRange();
+  return comparator;
+}
+
+var range;
+var hasRequiredRange;
+function requireRange() {
+  if (hasRequiredRange) return range;
+  hasRequiredRange = 1;
+  // 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.format();
+        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().split(/\s+/).join(' ');
+
+      // 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: ".concat(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.format();
+    }
+    format() {
+      this.range = this.set.map(comps => comps.join(' ').trim()).join('||').trim();
+      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('');
       }
-      debug('comp', this);
+      const result = [...rangeMap.values()];
+      cache.set(memoKey, result);
+      return result;
     }
-    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: ".concat(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);
+    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);
+            });
+          });
+        });
+      });
     }
-    toString() {
-      return this.value;
-    }
+
+    // if ANY of the sets match ALL of its comparators, then pass
     test(version) {
-      debug('Comparator.test', version, this.options.loose);
-      if (this.semver === ANY || version === ANY) {
-        return true;
+      if (!version) {
+        return false;
       }
       if (typeof version === 'string') {
         try {
@@ -25739,651 +25315,317 @@ function requireComparator() {
           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 === '') {
+      for (let i = 0; i < this.set.length; i++) {
+        if (testSet(this.set[i], version, this.options)) {
           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;
+  range = Range;
+  const LRU = lruCache;
+  const cache = new LRU({
+    max: 1000
+  });
   const parseOptions = parseOptions_1;
+  const Comparator = requireComparator();
+  const debug = debug_1;
+  const SemVer = semver;
   const {
     safeRe: re,
-    t
+    t,
+    comparatorTrimReplace,
+    tildeTrimReplace,
+    caretTrimReplace
   } = reExports;
-  const cmp = cmp_1;
-  const debug = debug_1;
-  const SemVer = semver$1;
-  const Range = requireRange();
-  return comparator;
-}
-
-const Range$9 = requireRange();
-const satisfies$4 = (version, range, options) => {
-  try {
-    range = new Range$9(range, options);
-  } catch (er) {
-    return false;
-  }
-  return range.test(version);
-};
-var satisfies_1 = satisfies$4;
+  const {
+    FLAG_INCLUDE_PRERELEASE,
+    FLAG_LOOSE
+  } = constants;
+  const isNullSet = c => c.value === '<0.0.0-0';
+  const isAny = c => c.value === '';
 
-const Range$8 = requireRange();
+  // 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;
+  };
 
-// Mostly just for testing and legacy API reasons
-const toComparators$1 = (range, options) => new Range$8(range, options).set.map(comp => comp.map(c => c.value).join(' ').trim().split(' '));
-var toComparators_1 = toComparators$1;
+  // 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 === '*';
 
-const SemVer$4 = semver$1;
-const Range$7 = requireRange();
-const maxSatisfying$1 = (versions, range, options) => {
-  let max = null;
-  let maxSV = null;
-  let rangeObj = null;
-  try {
-    rangeObj = new Range$7(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$4(max, options);
+  // ~, ~> --> * (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 = ">=".concat(M, ".0.0 <").concat(+M + 1, ".0.0-0");
+      } else if (isX(p)) {
+        // ~1.2 == >=1.2.0 <1.3.0-0
+        ret = ">=".concat(M, ".").concat(m, ".0 <").concat(M, ".").concat(+m + 1, ".0-0");
+      } else if (pr) {
+        debug('replaceTilde pr', pr);
+        ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(M, ".").concat(+m + 1, ".0-0");
+      } else {
+        // ~1.2.3 == >=1.2.3 <1.3.0-0
+        ret = ">=".concat(M, ".").concat(m, ".").concat(p, " <").concat(M, ".").concat(+m + 1, ".0-0");
       }
-    }
-  });
-  return max;
-};
-var maxSatisfying_1 = maxSatisfying$1;
+      debug('tilde return', ret);
+      return ret;
+    });
+  };
 
-const SemVer$3 = semver$1;
-const Range$6 = requireRange();
-const minSatisfying$1 = (versions, range, options) => {
-  let min = null;
-  let minSV = null;
-  let rangeObj = null;
-  try {
-    rangeObj = new Range$6(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$3(min, options);
-      }
-    }
-  });
-  return min;
-};
-var minSatisfying_1 = minSatisfying$1;
-
-const SemVer$2 = semver$1;
-const Range$5 = requireRange();
-const gt$2 = gt_1;
-const minVersion$1 = (range, loose) => {
-  range = new Range$5(range, loose);
-  let minver = new SemVer$2('0.0.0');
-  if (range.test(minver)) {
-    return minver;
-  }
-  minver = new SemVer$2('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$2(comparator.semver.version);
-      switch (comparator.operator) {
-        case '>':
-          if (compver.prerelease.length === 0) {
-            compver.patch++;
+  // ^ --> * (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 = ">=".concat(M, ".0.0").concat(z, " <").concat(+M + 1, ".0.0-0");
+      } else if (isX(p)) {
+        if (M === '0') {
+          ret = ">=".concat(M, ".").concat(m, ".0").concat(z, " <").concat(M, ".").concat(+m + 1, ".0-0");
+        } else {
+          ret = ">=".concat(M, ".").concat(m, ".0").concat(z, " <").concat(+M + 1, ".0.0-0");
+        }
+      } else if (pr) {
+        debug('replaceCaret pr', pr);
+        if (M === '0') {
+          if (m === '0') {
+            ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(M, ".").concat(m, ".").concat(+p + 1, "-0");
+          } else {
+            ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(M, ".").concat(+m + 1, ".0-0");
+          }
+        } else {
+          ret = ">=".concat(M, ".").concat(m, ".").concat(p, "-").concat(pr, " <").concat(+M + 1, ".0.0-0");
+        }
+      } else {
+        debug('no pr');
+        if (M === '0') {
+          if (m === '0') {
+            ret = ">=".concat(M, ".").concat(m, ".").concat(p).concat(z, " <").concat(M, ".").concat(m, ".").concat(+p + 1, "-0");
           } else {
-            compver.prerelease.push(0);
-          }
-          compver.raw = compver.format();
-        /* fallthrough */
-        case '':
-        case '>=':
-          if (!setMin || gt$2(compver, setMin)) {
-            setMin = compver;
+            ret = ">=".concat(M, ".").concat(m, ".").concat(p).concat(z, " <").concat(M, ".").concat(+m + 1, ".0-0");
           }
-          break;
-        case '<':
-        case '<=':
-          /* Ignore maximum versions */
-          break;
-        /* istanbul ignore next */
-        default:
-          throw new Error("Unexpected operation: ".concat(comparator.operator));
+        } else {
+          ret = ">=".concat(M, ".").concat(m, ".").concat(p, " <").concat(+M + 1, ".0.0-0");
+        }
       }
+      debug('caret return', ret);
+      return ret;
     });
-    if (setMin && (!minver || gt$2(minver, setMin))) {
-      minver = setMin;
-    }
-  }
-  if (minver && range.test(minver)) {
-    return minver;
-  }
-  return null;
-};
-var minVersion_1 = minVersion$1;
-
-const Range$4 = requireRange();
-const validRange$1 = (range, options) => {
-  try {
-    // Return '*' instead of '' so that truthiness works.
-    // This will throw if it's invalid anyway
-    return new Range$4(range, options).range || '*';
-  } catch (er) {
-    return null;
-  }
-};
-var valid$1 = validRange$1;
-
-const SemVer$1 = semver$1;
-const Comparator$2 = requireComparator();
-const {
-  ANY: ANY$1
-} = Comparator$2;
-const Range$3 = requireRange();
-const satisfies$3 = satisfies_1;
-const gt$1 = gt_1;
-const lt$1 = lt_1;
-const lte$1 = lte_1;
-const gte$1 = gte_1;
-const outside$3 = (version, range, hilo, options) => {
-  version = new SemVer$1(version, options);
-  range = new Range$3(range, options);
-  let gtfn, ltefn, ltfn, comp, ecomp;
-  switch (hilo) {
-    case '>':
-      gtfn = gt$1;
-      ltefn = lte$1;
-      ltfn = lt$1;
-      comp = '>';
-      ecomp = '>=';
-      break;
-    case '<':
-      gtfn = lt$1;
-      ltefn = gte$1;
-      ltfn = gt$1;
-      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$3(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$1) {
-        comparator = new Comparator$2('>=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;
+  };
+  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 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;
-};
-var outside_1 = outside$3;
-
-// Determine if version is greater than all the versions possible in the range.
-const outside$2 = outside_1;
-const gtr$1 = (version, range, options) => outside$2(version, range, '>', options);
-var gtr_1 = gtr$1;
-
-const outside$1 = outside_1;
-// Determine if version is less than all the versions possible in the range
-const ltr$1 = (version, range, options) => outside$1(version, range, '<', options);
-var ltr_1 = ltr$1;
-
-const Range$2 = requireRange();
-const intersects$1 = (r1, r2, options) => {
-  r1 = new Range$2(r1, options);
-  r2 = new Range$2(r2, options);
-  return r1.intersects(r2, options);
-};
-var intersects_1 = intersects$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$2 = satisfies_1;
-const compare$2 = compare_1;
-var simplify = (versions, range, options) => {
-  const set = [];
-  let first = null;
-  let prev = null;
-  const v = versions.sort((a, b) => compare$2(a, b, options));
-  for (const version of v) {
-    const included = satisfies$2(version, range, options);
-    if (included) {
-      prev = version;
-      if (!first) {
-        first = version;
+      // 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 = "".concat(gtlt + M, ".").concat(m, ".").concat(p).concat(pr);
+      } else if (xm) {
+        ret = ">=".concat(M, ".0.0").concat(pr, " <").concat(+M + 1, ".0.0-0");
+      } else if (xp) {
+        ret = ">=".concat(M, ".").concat(m, ".0").concat(pr, " <").concat(M, ".").concat(+m + 1, ".0-0");
       }
-    } 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(">=".concat(min));
-    } else if (min === v[0]) {
-      ranges.push("<=".concat(max));
-    } else {
-      ranges.push("".concat(min, " - ").concat(max));
-    }
-  }
-  const simplified = ranges.join(' || ');
-  const original = typeof range.raw === 'string' ? range.raw : String(range);
-  return simplified.length < original.length ? simplified : range;
-};
+      debug('xRange return', ret);
+      return ret;
+    });
+  };
 
-const Range$1 = requireRange();
-const Comparator$1 = requireComparator();
-const {
-  ANY
-} = Comparator$1;
-const satisfies$1 = satisfies_1;
-const compare$1 = compare_1;
+  // 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], '');
+  };
 
-// 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$1 = function (sub, dom) {
-  let options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
-  if (sub === dom) {
-    return true;
-  }
-  sub = new Range$1(sub, options);
-  dom = new Range$1(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$1('>=0.0.0-0')];
-const minimumVersion = [new Comparator$1('>=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;
+  // 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
+  const hyphenReplace = incPr => ($0, from, fM, fm, fp, fpr, fb, to, tM, tm, tp, tpr, tb) => {
+    if (isX(fM)) {
+      from = '';
+    } else if (isX(fm)) {
+      from = ">=".concat(fM, ".0.0").concat(incPr ? '-0' : '');
+    } else if (isX(fp)) {
+      from = ">=".concat(fM, ".").concat(fm, ".0").concat(incPr ? '-0' : '');
+    } else if (fpr) {
+      from = ">=".concat(from);
     } else {
-      dom = minimumVersion;
+      from = ">=".concat(from).concat(incPr ? '-0' : '');
     }
-  }
-  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);
+    if (isX(tM)) {
+      to = '';
+    } else if (isX(tm)) {
+      to = "<".concat(+tM + 1, ".0.0-0");
+    } else if (isX(tp)) {
+      to = "<".concat(tM, ".").concat(+tm + 1, ".0-0");
+    } else if (tpr) {
+      to = "<=".concat(tM, ".").concat(tm, ".").concat(tp, "-").concat(tpr);
+    } else if (incPr) {
+      to = "<".concat(tM, ".").concat(tm, ".").concat(+tp + 1, "-0");
     } else {
-      eqSet.add(c.semver);
-    }
-  }
-  if (eqSet.size > 1) {
-    return null;
-  }
-  let gtltComp;
-  if (gt && lt) {
-    gtltComp = compare$1(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$1(eq, String(gt), options)) {
-      return null;
-    }
-    if (lt && !satisfies$1(eq, String(lt), options)) {
-      return null;
-    }
-    for (const c of dom) {
-      if (!satisfies$1(eq, String(c), options)) {
-        return false;
-      }
+      to = "<=".concat(to);
     }
-    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$1(gt.semver, String(c), options)) {
+    return "".concat(from, " ").concat(to).trim();
+  };
+  const testSet = (set, version, options) => {
+    for (let i = 0; i < set.length; i++) {
+      if (!set[i].test(version)) {
         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 (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 (c.operator === '<' || c.operator === '<=') {
-        lower = lowerLT(lt, c, options);
-        if (lower === c && lower !== lt) {
-          return false;
+        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;
+          }
         }
-      } else if (lt.operator === '<=' && !satisfies$1(lt.semver, String(c), options)) {
-        return false;
       }
-    }
-    if (!c.operator && (lt || gt) && gtltComp !== 0) {
+
+      // Version has a -pre, but it's not one of the ones we like.
       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;
-  }
+    return true;
+  };
+  return range;
+}
 
-  // 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) {
+const Range = requireRange();
+const satisfies = (version, range, options) => {
+  try {
+    range = new Range(range, options);
+  } catch (er) {
     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$1(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$1(a.semver, b.semver, options);
-  return comp < 0 ? a : comp > 0 ? b : b.operator === '<' && a.operator === '<=' ? b : a;
-};
-var subset_1 = subset$1;
-
-// just pre-load all the stuff that index.js lazily exports
-const internalRe = reExports;
-const constants = constants$1;
-const SemVer = semver$1;
-const identifiers = identifiers$1;
-const parse = parse_1;
-const valid = valid_1;
-const clean = clean_1;
-const inc = inc_1;
-const diff = diff_1;
-const major = major_1;
-const minor = minor_1;
-const patch = patch_1;
-const prerelease = prerelease_1;
-const compare = compare_1;
-const rcompare = rcompare_1;
-const compareLoose = compareLoose_1;
-const compareBuild = compareBuild_1;
-const sort = sort_1;
-const rsort = rsort_1;
-const gt = gt_1;
-const lt = lt_1;
-const eq = eq_1;
-const neq = neq_1;
-const gte = gte_1;
-const lte = lte_1;
-const cmp = cmp_1;
-const coerce = coerce_1;
-const Comparator = requireComparator();
-const Range = requireRange();
-const satisfies = satisfies_1;
-const toComparators = toComparators_1;
-const maxSatisfying = maxSatisfying_1;
-const minSatisfying = minSatisfying_1;
-const minVersion = minVersion_1;
-const validRange = valid$1;
-const outside = outside_1;
-const gtr = gtr_1;
-const ltr = ltr_1;
-const intersects = intersects_1;
-const simplifyRange = simplify;
-const subset = subset_1;
-var 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 range.test(version);
 };
+var satisfies_1 = satisfies;
+var satisfies$1 = /*@__PURE__*/getDefaultExportFromCjs(satisfies_1);
 
 const LOADED = {};
 
@@ -26454,7 +25696,7 @@ function create$1(info, halo) {
     version: info.version,
     supportsPropertiesVersion(v) {
       if (v && meta && meta.deps && meta.deps.properties) {
-        return semver.satisfies(v, meta.deps.properties);
+        return satisfies$1(v, meta.deps.properties);
       }
       return true;
     },
@@ -27442,6 +26684,7 @@ function fromGenericObjects(genericObjects) {
     id: "app - ".concat(+Date.now()),
     session,
     createSessionObject,
+    destroySessionObject: async () => {},
     getObject,
     getAppLayout
   };