camunda-bpmn-js 0.13.0-alpha.4 → 0.13.0-alpha.5

package/dist/base-modeler.development.js

@@ -61557,6 +61557,49 @@
 	  height: "16"
 	};
 
+	var FeelRequiredIcon = function FeelRequiredIcon(props) {
+	  return o$2("svg", { ...props,
+	    children: [o$2("path", {
+	      d: "M5.8 7.06V5.95h4.307v1.11H5.8zm0 3.071v-1.11h4.307v1.11H5.8z",
+	      fill: "#505562"
+	    }), o$2("path", {
+	      fillRule: "evenodd",
+	      clipRule: "evenodd",
+	      d: "M8 3.268A4.732 4.732 0 1 0 12.732 8H14a6 6 0 1 1-6-6v1.268z",
+	      fill: "#505562"
+	    }), o$2("path", {
+	      d: "m11.28 6.072-.832-.56 1.016-1.224L10 3.848l.312-.912 1.392.584L11.632 2h1.032l-.072 1.52 1.392-.584.312.912-1.464.44 1.008 1.224-.832.552-.864-1.296-.864 1.304z",
+	      fill: "#505562"
+	    })]
+	  });
+	};
+
+	FeelRequiredIcon.defaultProps = {
+	  viewBox: "0 0 16 16",
+	  fill: "none",
+	  xmlns: "http://www.w3.org/2000/svg"
+	};
+
+	var FeelOptionalIcon = function FeelOptionalIcon(props) {
+	  return o$2("svg", { ...props,
+	    children: [o$2("path", {
+	      d: "M5.845 7.04V5.93h4.307v1.11H5.845zm0 3.07V9h4.307v1.11H5.845z",
+	      fill: "#505562"
+	    }), o$2("path", {
+	      fillRule: "evenodd",
+	      clipRule: "evenodd",
+	      d: "M3.286 8a4.714 4.714 0 1 0 9.428 0 4.714 4.714 0 0 0-9.428 0zM8 2a6 6 0 1 0 0 12A6 6 0 0 0 8 2z",
+	      fill: "#505562"
+	    })]
+	  });
+	};
+
+	FeelOptionalIcon.defaultProps = {
+	  viewBox: "0 0 16 16",
+	  fill: "none",
+	  xmlns: "http://www.w3.org/2000/svg"
+	};
+
 	function Group(props) {
 	  const {
 	    element,
@@ -61976,12 +62019,27 @@
 	  return `bio-properties-panel-${id}`;
 	}
 
+	function FeelIcon(props) {
+	  const {
+	    label,
+	    feel = false
+	  } = props;
+	  const feelRequiredLabel = ' must be a FEEL expression';
+	  const feelOptionalLabel = ' can optionally be a FEEL expression';
+	  return o$2("i", {
+	    class: "bio-properties-panel-feel-icon",
+	    title: label + (feel === 'required' ? feelRequiredLabel : feelOptionalLabel),
+	    children: feel === 'required' ? o$2(FeelRequiredIcon, {}) : o$2(FeelOptionalIcon, {})
+	  });
+	}
+
 	function TextArea(props) {
 	  const {
 	    id,
 	    label,
 	    rows = 2,
 	    debounce,
+	    feel,
 	    onInput,
 	    value = '',
 	    disabled,
@@ -61997,7 +62055,10 @@
 	    children: [o$2("label", {
 	      for: prefixId$2(id),
 	      class: "bio-properties-panel-label",
-	      children: label
+	      children: [label, feel && o$2(FeelIcon, {
+	        feel: feel,
+	        label: label
+	      })]
 	    }), o$2("textarea", {
 	      id: prefixId$2(id),
 	      name: id,
@@ -62033,6 +62094,7 @@
 	    id,
 	    description,
 	    debounce,
+	    feel,
 	    label,
 	    getValue,
 	    setValue,
@@ -62052,6 +62114,7 @@
 	      rows: rows,
 	      debounce: debounce,
 	      monospace: monospace,
+	      feel: feel,
 	      disabled: disabled
 	    }), o$2(Description, {
 	      forId: id,
@@ -62065,2918 +62128,207 @@
 	} // helpers /////////////////
 
 	function prefixId$2(id) {
-	  return `bio-properties-panel-${id}`;
-	}
-
-	function Textfield(props) {
-	  const {
-	    debounce,
-	    disabled = false,
-	    id,
-	    label,
-	    onInput,
-	    value = ''
-	  } = props;
-	  const handleInput = d$1(() => {
-	    return debounce(({
-	      target
-	    }) => onInput(target.value.length ? target.value : undefined));
-	  }, [onInput, debounce]);
-	  return o$2("div", {
-	    class: "bio-properties-panel-textfield",
-	    children: [o$2("label", {
-	      for: prefixId$1(id),
-	      class: "bio-properties-panel-label",
-	      children: label
-	    }), o$2("input", {
-	      id: prefixId$1(id),
-	      type: "text",
-	      name: id,
-	      spellCheck: "false",
-	      autoComplete: "off",
-	      disabled: disabled,
-	      class: "bio-properties-panel-input",
-	      onInput: handleInput,
-	      onFocus: props.onFocus,
-	      onBlur: props.onBlur,
-	      value: value || ''
-	    })]
-	  });
-	}
-	/**
-	 * @param {Object} props
-	 * @param {Object} props.element
-	 * @param {String} props.id
-	 * @param {String} props.description
-	 * @param {Boolean} props.debounce
-	 * @param {Boolean} props.disabled
-	 * @param {String} props.label
-	 * @param {Function} props.getValue
-	 * @param {Function} props.setValue
-	 * @param {Function} props.validate
-	 */
-
-
-	function TextfieldEntry(props) {
-	  const {
-	    element,
-	    id,
-	    description,
-	    debounce,
-	    disabled,
-	    label,
-	    getValue,
-	    setValue,
-	    validate
-	  } = props;
-	  const [error, setError] = l(null);
-	  const [invalidValueCache, setInvalidValueCache] = l(null);
-	  let value = getValue(element);
-	  const prevValue = usePrevious(value); // validate again when value prop changed
-
-	  y$1(() => {
-	    const err = validate ? validate(value) : null;
-	    setError(err);
-	  }, [value]); // validate on change
-
-	  const handleChange = newValue => {
-	    const err = validate ? validate(newValue) : null;
-
-	    if (err) {
-	      setInvalidValueCache(newValue);
-	    } else {
-	      setValue(newValue);
-	    }
-
-	    setError(err);
-	  }; // keep showing invalid value on errors, although it was not set
-
-
-	  if (prevValue === value && error) {
-	    value = invalidValueCache;
-	  }
-
-	  return o$2("div", {
-	    class: classnames('bio-properties-panel-entry', error ? 'has-error' : ''),
-	    "data-entry-id": id,
-	    children: [o$2(Textfield, {
-	      id: id,
-	      label: label,
-	      value: value,
-	      onInput: handleChange,
-	      debounce: debounce,
-	      disabled: disabled
-	    }), o$2(Description, {
-	      forId: id,
-	      element: element,
-	      value: description
-	    }), error && o$2("div", {
-	      class: "bio-properties-panel-error",
-	      children: error
-	    })]
-	  });
-	}
-	function isEdited$1(node) {
-	  return node && !!node.value;
-	} // helpers /////////////////
-
-	function prefixId$1(id) {
-	  return `bio-properties-panel-${id}`;
-	}
-
-	const DEFAULT_DEBOUNCE_TIME = 300;
-	function debounceInput(debounceDelay) {
-	  return function _debounceInput(fn) {
-	    if (debounceDelay !== false) {
-	      var debounceTime = isNumber(debounceDelay) ? debounceDelay : DEFAULT_DEBOUNCE_TIME;
-	      return debounce(fn, debounceTime);
-	    } else {
-	      return fn;
-	    }
-	  };
-	}
-	debounceInput.$inject = ['config.debounceInput'];
-
-	var index$2 = {
-	  debounceInput: ['factory', debounceInput]
-	};
-
-	/**
-	 * Failsafe remove an element from a collection
-	 *
-	 * @param  {Array<Object>} [collection]
-	 * @param  {Object} [element]
-	 *
-	 * @return {number} the previous index of the element
-	 */
-
-	/**
-	 * Fail save add an element to the given connection, ensuring
-	 * it does not yet exist.
-	 *
-	 * @param {Array<Object>} collection
-	 * @param {Object} element
-	 * @param {number} idx
-	 */
-	function add$2(collection, element, idx) {
-
-	  if (!collection || !element) {
-	    return;
-	  }
-
-	  if (typeof idx !== 'number') {
-	    idx = -1;
-	  }
-
-	  var currentIdx = collection.indexOf(element);
-
-	  if (currentIdx !== -1) {
-
-	    if (currentIdx === idx) {
-
-	      // nothing to do, position has not changed
-	      return;
-	    } else {
-
-	      if (idx !== -1) {
-
-	        // remove from current position
-	        collection.splice(currentIdx, 1);
-	      } else {
-
-	        // already exists in collection
-	        return;
-	      }
-	    }
-	  }
-
-	  if (idx !== -1) {
-
-	    // insert at specified position
-	    collection.splice(idx, 0, element);
-	  } else {
-
-	    // push to end
-	    collection.push(element);
-	  }
-	}
-
-	// Note: this is the semver.org version of the spec that it implements
-	// Not necessarily the package version of this code.
-	const SEMVER_SPEC_VERSION = '2.0.0';
-
-	const MAX_LENGTH = 256;
-	const MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||
-	  /* istanbul ignore next */ 9007199254740991;
-
-	// Max safe segment length for coercion.
-	const MAX_SAFE_COMPONENT_LENGTH = 16;
-
-	var constants = {
-	  SEMVER_SPEC_VERSION,
-	  MAX_LENGTH,
-	  MAX_SAFE_INTEGER,
-	  MAX_SAFE_COMPONENT_LENGTH
-	};
-
-	const debug = (
-	  typeof process === 'object' &&
-	  process.env &&
-	  process.env.NODE_DEBUG &&
-	  /\bsemver\b/i.test(process.env.NODE_DEBUG)
-	) ? (...args) => console.error('SEMVER', ...args)
-	  : () => {};
-
-	var debug_1 = debug;
-
-	var re_1 = createCommonjsModule(function (module, exports) {
-	const { MAX_SAFE_COMPONENT_LENGTH } = constants;
-
-	exports = module.exports = {};
-
-	// The actual regexps go on exports.re
-	const re = exports.re = [];
-	const src = exports.src = [];
-	const t = exports.t = {};
-	let R = 0;
-
-	const createToken = (name, value, isGlobal) => {
-	  const index = R++;
-	  debug_1(index, value);
-	  t[name] = index;
-	  src[index] = value;
-	  re[index] = new RegExp(value, isGlobal ? 'g' : undefined);
-	};
-
-	// The following Regular Expressions can be used for tokenizing,
-	// validating, and parsing SemVer version strings.
-
-	// ## Numeric Identifier
-	// A single `0`, or a non-zero digit followed by zero or more digits.
-
-	createToken('NUMERICIDENTIFIER', '0|[1-9]\\d*');
-	createToken('NUMERICIDENTIFIERLOOSE', '[0-9]+');
-
-	// ## Non-numeric Identifier
-	// Zero or more digits, followed by a letter or hyphen, and then zero or
-	// more letters, digits, or hyphens.
-
-	createToken('NONNUMERICIDENTIFIER', '\\d*[a-zA-Z-][a-zA-Z0-9-]*');
-
-	// ## Main Version
-	// Three dot-separated numeric identifiers.
-
-	createToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\.` +
-	                   `(${src[t.NUMERICIDENTIFIER]})\\.` +
-	                   `(${src[t.NUMERICIDENTIFIER]})`);
-
-	createToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` +
-	                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` +
-	                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`);
-
-	// ## Pre-release Version Identifier
-	// A numeric identifier, or a non-numeric identifier.
-
-	createToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]
-}|${src[t.NONNUMERICIDENTIFIER]})`);
-
-	createToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]
-}|${src[t.NONNUMERICIDENTIFIER]})`);
-
-	// ## Pre-release Version
-	// Hyphen, followed by one or more dot-separated pre-release version
-	// identifiers.
-
-	createToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]
-}(?:\\.${src[t.PRERELEASEIDENTIFIER]})*))`);
-
-	createToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]
-}(?:\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`);
-
-	// ## Build Metadata Identifier
-	// Any combination of digits, letters, or hyphens.
-
-	createToken('BUILDIDENTIFIER', '[0-9A-Za-z-]+');
-
-	// ## Build Metadata
-	// Plus sign, followed by one or more period-separated build metadata
-	// identifiers.
-
-	createToken('BUILD', `(?:\\+(${src[t.BUILDIDENTIFIER]
-}(?:\\.${src[t.BUILDIDENTIFIER]})*))`);
-
-	// ## Full Version String
-	// A main version, followed optionally by a pre-release version and
-	// build metadata.
-
-	// Note that the only major, minor, patch, and pre-release sections of
-	// the version string are capturing groups.  The build metadata is not a
-	// capturing group, because it should not ever be used in version
-	// comparison.
-
-	createToken('FULLPLAIN', `v?${src[t.MAINVERSION]
-}${src[t.PRERELEASE]}?${
-  src[t.BUILD]}?`);
-
-	createToken('FULL', `^${src[t.FULLPLAIN]}$`);
-
-	// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.
-	// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty
-	// common in the npm registry.
-	createToken('LOOSEPLAIN', `[v=\\s]*${src[t.MAINVERSIONLOOSE]
-}${src[t.PRERELEASELOOSE]}?${
-  src[t.BUILD]}?`);
-
-	createToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`);
-
-	createToken('GTLT', '((?:<|>)?=?)');
-
-	// Something like "2.*" or "1.2.x".
-	// Note that "x.x" is a valid xRange identifer, meaning "any version"
-	// Only the first item is strictly required.
-	createToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`);
-	createToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\*`);
-
-	createToken('XRANGEPLAIN', `[v=\\s]*(${src[t.XRANGEIDENTIFIER]})` +
-	                   `(?:\\.(${src[t.XRANGEIDENTIFIER]})` +
-	                   `(?:\\.(${src[t.XRANGEIDENTIFIER]})` +
-	                   `(?:${src[t.PRERELEASE]})?${
-                     src[t.BUILD]}?` +
-	                   `)?)?`);
-
-	createToken('XRANGEPLAINLOOSE', `[v=\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +
-	                        `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +
-	                        `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +
-	                        `(?:${src[t.PRERELEASELOOSE]})?${
-                          src[t.BUILD]}?` +
-	                        `)?)?`);
-
-	createToken('XRANGE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAIN]}$`);
-	createToken('XRANGELOOSE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAINLOOSE]}$`);
-
-	// Coercion.
-	// Extract anything that could conceivably be a part of a valid semver
-	createToken('COERCE', `${'(^|[^\\d])' +
-              '(\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +
-	              `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +
-	              `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +
-	              `(?:$|[^\\d])`);
-	createToken('COERCERTL', src[t.COERCE], true);
-
-	// Tilde ranges.
-	// Meaning is "reasonably at or greater than"
-	createToken('LONETILDE', '(?:~>?)');
-
-	createToken('TILDETRIM', `(\\s*)${src[t.LONETILDE]}\\s+`, true);
-	exports.tildeTrimReplace = '$1~';
-
-	createToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`);
-	createToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`);
-
-	// Caret ranges.
-	// Meaning is "at least and backwards compatible with"
-	createToken('LONECARET', '(?:\\^)');
-
-	createToken('CARETTRIM', `(\\s*)${src[t.LONECARET]}\\s+`, true);
-	exports.caretTrimReplace = '$1^';
-
-	createToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`);
-	createToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`);
-
-	// A simple gt/lt/eq thing, or just "" to indicate "any version"
-	createToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\s*(${src[t.LOOSEPLAIN]})$|^$`);
-	createToken('COMPARATOR', `^${src[t.GTLT]}\\s*(${src[t.FULLPLAIN]})$|^$`);
-
-	// An expression to strip any whitespace between the gtlt and the thing
-	// it modifies, so that `> 1.2.3` ==> `>1.2.3`
-	createToken('COMPARATORTRIM', `(\\s*)${src[t.GTLT]
-}\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true);
-	exports.comparatorTrimReplace = '$1$2$3';
-
-	// Something like `1.2.3 - 1.2.4`
-	// Note that these all use the loose form, because they'll be
-	// checked against either the strict or loose comparator form
-	// later.
-	createToken('HYPHENRANGE', `^\\s*(${src[t.XRANGEPLAIN]})` +
-	                   `\\s+-\\s+` +
-	                   `(${src[t.XRANGEPLAIN]})` +
-	                   `\\s*$`);
-
-	createToken('HYPHENRANGELOOSE', `^\\s*(${src[t.XRANGEPLAINLOOSE]})` +
-	                        `\\s+-\\s+` +
-	                        `(${src[t.XRANGEPLAINLOOSE]})` +
-	                        `\\s*$`);
-
-	// Star ranges basically just allow anything at all.
-	createToken('STAR', '(<|>)?=?\\s*\\*');
-	// >=0.0.0 is like a star
-	createToken('GTE0', '^\\s*>=\\s*0\.0\.0\\s*$');
-	createToken('GTE0PRE', '^\\s*>=\\s*0\.0\.0-0\\s*$');
-	});
-
-	// parse out just the options we care about so we always get a consistent
-	// obj with keys in a consistent order.
-	const opts = ['includePrerelease', 'loose', 'rtl'];
-	const parseOptions = options =>
-	  !options ? {}
-	  : typeof options !== 'object' ? { loose: true }
-	  : opts.filter(k => options[k]).reduce((options, k) => {
-	    options[k] = true;
-	    return options
-	  }, {});
-	var parseOptions_1 = parseOptions;
-
-	const numeric = /^[0-9]+$/;
-	const compareIdentifiers = (a, b) => {
-	  const anum = numeric.test(a);
-	  const bnum = numeric.test(b);
-
-	  if (anum && bnum) {
-	    a = +a;
-	    b = +b;
-	  }
-
-	  return a === b ? 0
-	    : (anum && !bnum) ? -1
-	    : (bnum && !anum) ? 1
-	    : a < b ? -1
-	    : 1
-	};
-
-	const rcompareIdentifiers = (a, b) => compareIdentifiers(b, a);
-
-	var identifiers = {
-	  compareIdentifiers,
-	  rcompareIdentifiers
-	};
-
-	const { MAX_LENGTH: MAX_LENGTH$1, MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$1 } = constants;
-	const { re: re$2, t: t$2 } = re_1;
-
-
-	const { compareIdentifiers: compareIdentifiers$1 } = identifiers;
-	class SemVer {
-	  constructor (version, options) {
-	    options = parseOptions_1(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: ${version}`)
-	    }
-
-	    if (version.length > MAX_LENGTH$1) {
-	      throw new TypeError(
-	        `version is longer than ${MAX_LENGTH$1} characters`
-	      )
-	    }
-
-	    debug_1('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$2[t$2.LOOSE] : re$2[t$2.FULL]);
-
-	    if (!m) {
-	      throw new TypeError(`Invalid Version: ${version}`)
-	    }
-
-	    this.raw = version;
-
-	    // these are actually numbers
-	    this.major = +m[1];
-	    this.minor = +m[2];
-	    this.patch = +m[3];
-
-	    if (this.major > MAX_SAFE_INTEGER$1 || this.major < 0) {
-	      throw new TypeError('Invalid major version')
-	    }
-
-	    if (this.minor > MAX_SAFE_INTEGER$1 || this.minor < 0) {
-	      throw new TypeError('Invalid minor version')
-	    }
-
-	    if (this.patch > MAX_SAFE_INTEGER$1 || this.patch < 0) {
-	      throw new TypeError('Invalid patch version')
-	    }
-
-	    // numberify any prerelease numeric ids
-	    if (!m[4]) {
-	      this.prerelease = [];
-	    } else {
-	      this.prerelease = m[4].split('.').map((id) => {
-	        if (/^[0-9]+$/.test(id)) {
-	          const num = +id;
-	          if (num >= 0 && num < MAX_SAFE_INTEGER$1) {
-	            return num
-	          }
-	        }
-	        return id
-	      });
-	    }
-
-	    this.build = m[5] ? m[5].split('.') : [];
-	    this.format();
-	  }
-
-	  format () {
-	    this.version = `${this.major}.${this.minor}.${this.patch}`;
-	    if (this.prerelease.length) {
-	      this.version += `-${this.prerelease.join('.')}`;
-	    }
-	    return this.version
-	  }
-
-	  toString () {
-	    return this.version
-	  }
-
-	  compare (other) {
-	    debug_1('SemVer.compare', this.version, this.options, other);
-	    if (!(other instanceof SemVer)) {
-	      if (typeof other === 'string' && other === this.version) {
-	        return 0
-	      }
-	      other = new SemVer(other, this.options);
-	    }
-
-	    if (other.version === this.version) {
-	      return 0
-	    }
-
-	    return this.compareMain(other) || this.comparePre(other)
-	  }
-
-	  compareMain (other) {
-	    if (!(other instanceof SemVer)) {
-	      other = new SemVer(other, this.options);
-	    }
-
-	    return (
-	      compareIdentifiers$1(this.major, other.major) ||
-	      compareIdentifiers$1(this.minor, other.minor) ||
-	      compareIdentifiers$1(this.patch, other.patch)
-	    )
-	  }
-
-	  comparePre (other) {
-	    if (!(other instanceof SemVer)) {
-	      other = new SemVer(other, this.options);
-	    }
-
-	    // NOT having a prerelease is > having one
-	    if (this.prerelease.length && !other.prerelease.length) {
-	      return -1
-	    } else if (!this.prerelease.length && other.prerelease.length) {
-	      return 1
-	    } else if (!this.prerelease.length && !other.prerelease.length) {
-	      return 0
-	    }
-
-	    let i = 0;
-	    do {
-	      const a = this.prerelease[i];
-	      const b = other.prerelease[i];
-	      debug_1('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$1(a, b)
-	      }
-	    } while (++i)
-	  }
-
-	  compareBuild (other) {
-	    if (!(other instanceof SemVer)) {
-	      other = new SemVer(other, this.options);
-	    }
-
-	    let i = 0;
-	    do {
-	      const a = this.build[i];
-	      const b = other.build[i];
-	      debug_1('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$1(a, b)
-	      }
-	    } while (++i)
-	  }
-
-	  // preminor will bump the version up to the next minor release, and immediately
-	  // down to pre-release. premajor and prepatch work the same way.
-	  inc (release, identifier) {
-	    switch (release) {
-	      case 'premajor':
-	        this.prerelease.length = 0;
-	        this.patch = 0;
-	        this.minor = 0;
-	        this.major++;
-	        this.inc('pre', identifier);
-	        break
-	      case 'preminor':
-	        this.prerelease.length = 0;
-	        this.patch = 0;
-	        this.minor++;
-	        this.inc('pre', identifier);
-	        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);
-	        this.inc('pre', identifier);
-	        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);
-	        }
-	        this.inc('pre', identifier);
-	        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':
-	        if (this.prerelease.length === 0) {
-	          this.prerelease = [0];
-	        } 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
-	            this.prerelease.push(0);
-	          }
-	        }
-	        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
-	          if (this.prerelease[0] === identifier) {
-	            if (isNaN(this.prerelease[1])) {
-	              this.prerelease = [identifier, 0];
-	            }
-	          } else {
-	            this.prerelease = [identifier, 0];
-	          }
-	        }
-	        break
-
-	      default:
-	        throw new Error(`invalid increment argument: ${release}`)
-	    }
-	    this.format();
-	    this.raw = this.version;
-	    return this
-	  }
-	}
-
-	var semver = SemVer;
-
-	const {MAX_LENGTH: MAX_LENGTH$2} = constants;
-	const { re: re$3, t: t$3 } = re_1;
-
-
-
-	const parse$2 = (version, options) => {
-	  options = parseOptions_1(options);
-
-	  if (version instanceof semver) {
-	    return version
-	  }
-
-	  if (typeof version !== 'string') {
-	    return null
-	  }
-
-	  if (version.length > MAX_LENGTH$2) {
-	    return null
-	  }
-
-	  const r = options.loose ? re$3[t$3.LOOSE] : re$3[t$3.FULL];
-	  if (!r.test(version)) {
-	    return null
-	  }
-
-	  try {
-	    return new semver(version, options)
-	  } catch (er) {
-	    return null
-	  }
-	};
-
-	var parse_1 = parse$2;
-
-	const valid = (version, options) => {
-	  const v = parse_1(version, options);
-	  return v ? v.version : null
-	};
-	var valid_1 = valid;
-
-	const clean = (version, options) => {
-	  const s = parse_1(version.trim().replace(/^[=v]+/, ''), options);
-	  return s ? s.version : null
-	};
-	var clean_1 = clean;
-
-	const inc = (version, release, options, identifier) => {
-	  if (typeof (options) === 'string') {
-	    identifier = options;
-	    options = undefined;
-	  }
-
-	  try {
-	    return new semver(version, options).inc(release, identifier).version
-	  } catch (er) {
-	    return null
-	  }
-	};
-	var inc_1 = inc;
-
-	const compare = (a, b, loose) =>
-	  new semver(a, loose).compare(new semver(b, loose));
-
-	var compare_1 = compare;
-
-	const eq = (a, b, loose) => compare_1(a, b, loose) === 0;
-	var eq_1 = eq;
-
-	const diff = (version1, version2) => {
-	  if (eq_1(version1, version2)) {
-	    return null
-	  } else {
-	    const v1 = parse_1(version1);
-	    const v2 = parse_1(version2);
-	    const hasPre = v1.prerelease.length || v2.prerelease.length;
-	    const prefix = hasPre ? 'pre' : '';
-	    const defaultResult = hasPre ? 'prerelease' : '';
-	    for (const key in v1) {
-	      if (key === 'major' || key === 'minor' || key === 'patch') {
-	        if (v1[key] !== v2[key]) {
-	          return prefix + key
-	        }
-	      }
-	    }
-	    return defaultResult // may be undefined
-	  }
-	};
-	var diff_1 = diff;
-
-	const major = (a, loose) => new semver(a, loose).major;
-	var major_1 = major;
-
-	const minor = (a, loose) => new semver(a, loose).minor;
-	var minor_1 = minor;
-
-	const patch = (a, loose) => new semver(a, loose).patch;
-	var patch_1 = patch;
-
-	const prerelease = (version, options) => {
-	  const parsed = parse_1(version, options);
-	  return (parsed && parsed.prerelease.length) ? parsed.prerelease : null
-	};
-	var prerelease_1 = prerelease;
-
-	const rcompare = (a, b, loose) => compare_1(b, a, loose);
-	var rcompare_1 = rcompare;
-
-	const compareLoose = (a, b) => compare_1(a, b, true);
-	var compareLoose_1 = compareLoose;
-
-	const compareBuild = (a, b, loose) => {
-	  const versionA = new semver(a, loose);
-	  const versionB = new semver(b, loose);
-	  return versionA.compare(versionB) || versionA.compareBuild(versionB)
-	};
-	var compareBuild_1 = compareBuild;
-
-	const sort = (list, loose) => list.sort((a, b) => compareBuild_1(a, b, loose));
-	var sort_1 = sort;
-
-	const rsort = (list, loose) => list.sort((a, b) => compareBuild_1(b, a, loose));
-	var rsort_1 = rsort;
-
-	const gt = (a, b, loose) => compare_1(a, b, loose) > 0;
-	var gt_1 = gt;
-
-	const lt = (a, b, loose) => compare_1(a, b, loose) < 0;
-	var lt_1 = lt;
-
-	const neq = (a, b, loose) => compare_1(a, b, loose) !== 0;
-	var neq_1 = neq;
-
-	const gte = (a, b, loose) => compare_1(a, b, loose) >= 0;
-	var gte_1 = gte;
-
-	const lte = (a, b, loose) => compare_1(a, b, loose) <= 0;
-	var lte_1 = lte;
-
-	const cmp = (a, op, b, loose) => {
-	  switch (op) {
-	    case '===':
-	      if (typeof a === 'object')
-	        a = a.version;
-	      if (typeof b === 'object')
-	        b = b.version;
-	      return a === b
-
-	    case '!==':
-	      if (typeof a === 'object')
-	        a = a.version;
-	      if (typeof b === 'object')
-	        b = b.version;
-	      return a !== b
-
-	    case '':
-	    case '=':
-	    case '==':
-	      return eq_1(a, b, loose)
-
-	    case '!=':
-	      return neq_1(a, b, loose)
-
-	    case '>':
-	      return gt_1(a, b, loose)
-
-	    case '>=':
-	      return gte_1(a, b, loose)
-
-	    case '<':
-	      return lt_1(a, b, loose)
-
-	    case '<=':
-	      return lte_1(a, b, loose)
-
-	    default:
-	      throw new TypeError(`Invalid operator: ${op}`)
-	  }
-	};
-	var cmp_1 = cmp;
-
-	const {re: re$4, t: t$4} = re_1;
-
-	const coerce = (version, options) => {
-	  if (version instanceof semver) {
-	    return version
-	  }
-
-	  if (typeof version === 'number') {
-	    version = String(version);
-	  }
-
-	  if (typeof version !== 'string') {
-	    return null
-	  }
-
-	  options = options || {};
-
-	  let match = null;
-	  if (!options.rtl) {
-	    match = version.match(re$4[t$4.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$4[t$4.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$4[t$4.COERCERTL].lastIndex = next.index + next[1].length + next[2].length;
-	    }
-	    // leave it in a clean state
-	    re$4[t$4.COERCERTL].lastIndex = -1;
-	  }
-
-	  if (match === null)
-	    return null
-
-	  return parse_1(`${match[2]}.${match[3] || '0'}.${match[4] || '0'}`, options)
-	};
-	var coerce_1 = coerce;
-
-	var iterator = function (Yallist) {
-	  Yallist.prototype[Symbol.iterator] = function* () {
-	    for (let walker = this.head; walker; walker = walker.next) {
-	      yield walker.value;
-	    }
-	  };
-	};
-
-	var yallist = Yallist;
-
-	Yallist.Node = Node$1;
-	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;
-	};
-
-	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
-	};
-
-	function insert (self, node, value) {
-	  var inserted = node === self.head ?
-	    new Node$1(value, null, node, self) :
-	    new Node$1(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$1(item, self.tail, null, self);
-	  if (!self.head) {
-	    self.head = self.tail;
-	  }
-	  self.length++;
-	}
-
-	function unshift (self, item) {
-	  self.head = new Node$1(item, null, self.head, self);
-	  if (!self.tail) {
-	    self.tail = self.head;
-	  }
-	  self.length++;
-	}
-
-	function Node$1 (value, prev, next, list) {
-	  if (!(this instanceof Node$1)) {
-	    return new Node$1(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
-	  iterator(Yallist);
-	} catch (er) {}
-
-	// A linked list to keep track of recently-used-ness
-
-
-	const MAX = Symbol('max');
-	const LENGTH = Symbol('length');
-	const LENGTH_CALCULATOR = Symbol('lengthCalculator');
-	const ALLOW_STALE = Symbol('allowStale');
-	const MAX_AGE = Symbol('maxAge');
-	const DISPOSE = Symbol('dispose');
-	const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
-	const LRU_LIST = Symbol('lruList');
-	const CACHE = Symbol('cache');
-	const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
-
-	const naiveLength = () => 1;
-
-	// lruList is a yallist where the head is the youngest
-	// item, and the tail is the oldest.  the list contains the Hit
-	// objects as the entries.
-	// Each Hit object has a reference to its Yallist.Node.  This
-	// never changes.
-	//
-	// cache is a Map (or PseudoMap) that matches the keys to
-	// the Yallist.Node object.
-	class LRUCache {
-	  constructor (options) {
-	    if (typeof options === 'number')
-	      options = { max: options };
-
-	    if (!options)
-	      options = {};
-
-	    if (options.max && (typeof options.max !== 'number' || options.max < 0))
-	      throw new TypeError('max must be a non-negative number')
-	    // Kind of weird to have a default max of Infinity, but oh well.
-	    this[MAX] = options.max || Infinity;
-
-	    const lc = options.length || naiveLength;
-	    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc;
-	    this[ALLOW_STALE] = options.stale || false;
-	    if (options.maxAge && typeof options.maxAge !== 'number')
-	      throw new TypeError('maxAge must be a number')
-	    this[MAX_AGE] = options.maxAge || 0;
-	    this[DISPOSE] = options.dispose;
-	    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
-	    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
-	    this.reset();
-	  }
-
-	  // resize the cache when the max changes.
-	  set max (mL) {
-	    if (typeof mL !== 'number' || mL < 0)
-	      throw new TypeError('max must be a non-negative number')
-
-	    this[MAX] = mL || Infinity;
-	    trim(this);
-	  }
-	  get max () {
-	    return this[MAX]
-	  }
-
-	  set allowStale (allowStale) {
-	    this[ALLOW_STALE] = !!allowStale;
-	  }
-	  get allowStale () {
-	    return this[ALLOW_STALE]
-	  }
-
-	  set maxAge (mA) {
-	    if (typeof mA !== 'number')
-	      throw new TypeError('maxAge must be a non-negative number')
-
-	    this[MAX_AGE] = mA;
-	    trim(this);
-	  }
-	  get maxAge () {
-	    return this[MAX_AGE]
-	  }
-
-	  // resize the cache when the lengthCalculator changes.
-	  set lengthCalculator (lC) {
-	    if (typeof lC !== 'function')
-	      lC = naiveLength;
-
-	    if (lC !== this[LENGTH_CALCULATOR]) {
-	      this[LENGTH_CALCULATOR] = lC;
-	      this[LENGTH] = 0;
-	      this[LRU_LIST].forEach(hit => {
-	        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
-	        this[LENGTH] += hit.length;
-	      });
-	    }
-	    trim(this);
-	  }
-	  get lengthCalculator () { return this[LENGTH_CALCULATOR] }
-
-	  get length () { return this[LENGTH] }
-	  get itemCount () { return this[LRU_LIST].length }
-
-	  rforEach (fn, thisp) {
-	    thisp = thisp || this;
-	    for (let walker = this[LRU_LIST].tail; walker !== null;) {
-	      const prev = walker.prev;
-	      forEachStep(this, fn, walker, thisp);
-	      walker = prev;
-	    }
-	  }
-
-	  forEach (fn, thisp) {
-	    thisp = thisp || this;
-	    for (let walker = this[LRU_LIST].head; walker !== null;) {
-	      const next = walker.next;
-	      forEachStep(this, fn, walker, thisp);
-	      walker = next;
-	    }
-	  }
-
-	  keys () {
-	    return this[LRU_LIST].toArray().map(k => k.key)
-	  }
-
-	  values () {
-	    return this[LRU_LIST].toArray().map(k => k.value)
-	  }
-
-	  reset () {
-	    if (this[DISPOSE] &&
-	        this[LRU_LIST] &&
-	        this[LRU_LIST].length) {
-	      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value));
-	    }
-
-	    this[CACHE] = new Map(); // hash of items by key
-	    this[LRU_LIST] = new yallist(); // list of items in order of use recency
-	    this[LENGTH] = 0; // length of items in the list
-	  }
-
-	  dump () {
-	    return this[LRU_LIST].map(hit =>
-	      isStale(this, hit) ? false : {
-	        k: hit.key,
-	        v: hit.value,
-	        e: hit.now + (hit.maxAge || 0)
-	      }).toArray().filter(h => h)
-	  }
-
-	  dumpLru () {
-	    return this[LRU_LIST]
-	  }
-
-	  set (key, value, maxAge) {
-	    maxAge = maxAge || this[MAX_AGE];
-
-	    if (maxAge && typeof maxAge !== 'number')
-	      throw new TypeError('maxAge must be a number')
-
-	    const now = maxAge ? Date.now() : 0;
-	    const len = this[LENGTH_CALCULATOR](value, key);
-
-	    if (this[CACHE].has(key)) {
-	      if (len > this[MAX]) {
-	        del(this, this[CACHE].get(key));
-	        return false
-	      }
-
-	      const node = this[CACHE].get(key);
-	      const item = node.value;
-
-	      // dispose of the old one before overwriting
-	      // split out into 2 ifs for better coverage tracking
-	      if (this[DISPOSE]) {
-	        if (!this[NO_DISPOSE_ON_SET])
-	          this[DISPOSE](key, item.value);
-	      }
-
-	      item.now = now;
-	      item.maxAge = maxAge;
-	      item.value = value;
-	      this[LENGTH] += len - item.length;
-	      item.length = len;
-	      this.get(key);
-	      trim(this);
-	      return true
-	    }
-
-	    const hit = new Entry(key, value, len, now, maxAge);
-
-	    // oversized objects fall out of cache automatically.
-	    if (hit.length > this[MAX]) {
-	      if (this[DISPOSE])
-	        this[DISPOSE](key, value);
-
-	      return false
-	    }
-
-	    this[LENGTH] += hit.length;
-	    this[LRU_LIST].unshift(hit);
-	    this[CACHE].set(key, this[LRU_LIST].head);
-	    trim(this);
-	    return true
-	  }
-
-	  has (key) {
-	    if (!this[CACHE].has(key)) return false
-	    const hit = this[CACHE].get(key).value;
-	    return !isStale(this, hit)
-	  }
-
-	  get (key) {
-	    return get$3(this, key, true)
-	  }
-
-	  peek (key) {
-	    return get$3(this, key, false)
-	  }
-
-	  pop () {
-	    const node = this[LRU_LIST].tail;
-	    if (!node)
-	      return null
-
-	    del(this, node);
-	    return node.value
-	  }
-
-	  del (key) {
-	    del(this, this[CACHE].get(key));
-	  }
-
-	  load (arr) {
-	    // reset the cache
-	    this.reset();
-
-	    const now = Date.now();
-	    // A previous serialized cache has the most recent items first
-	    for (let l = arr.length - 1; l >= 0; l--) {
-	      const hit = arr[l];
-	      const expiresAt = hit.e || 0;
-	      if (expiresAt === 0)
-	        // the item was created without expiration in a non aged cache
-	        this.set(hit.k, hit.v);
-	      else {
-	        const maxAge = expiresAt - now;
-	        // dont add already expired items
-	        if (maxAge > 0) {
-	          this.set(hit.k, hit.v, maxAge);
-	        }
-	      }
-	    }
-	  }
-
-	  prune () {
-	    this[CACHE].forEach((value, key) => get$3(this, key, false));
-	  }
-	}
-
-	const get$3 = (self, key, doUse) => {
-	  const node = self[CACHE].get(key);
-	  if (node) {
-	    const hit = node.value;
-	    if (isStale(self, hit)) {
-	      del(self, node);
-	      if (!self[ALLOW_STALE])
-	        return undefined
-	    } else {
-	      if (doUse) {
-	        if (self[UPDATE_AGE_ON_GET])
-	          node.value.now = Date.now();
-	        self[LRU_LIST].unshiftNode(node);
-	      }
-	    }
-	    return hit.value
-	  }
-	};
-
-	const isStale = (self, hit) => {
-	  if (!hit || (!hit.maxAge && !self[MAX_AGE]))
-	    return false
-
-	  const diff = Date.now() - hit.now;
-	  return hit.maxAge ? diff > hit.maxAge
-	    : self[MAX_AGE] && (diff > self[MAX_AGE])
-	};
-
-	const trim = self => {
-	  if (self[LENGTH] > self[MAX]) {
-	    for (let walker = self[LRU_LIST].tail;
-	      self[LENGTH] > self[MAX] && walker !== null;) {
-	      // We know that we're about to delete this one, and also
-	      // what the next least recently used key will be, so just
-	      // go ahead and set it now.
-	      const prev = walker.prev;
-	      del(self, walker);
-	      walker = prev;
-	    }
-	  }
-	};
-
-	const del = (self, node) => {
-	  if (node) {
-	    const hit = node.value;
-	    if (self[DISPOSE])
-	      self[DISPOSE](hit.key, hit.value);
-
-	    self[LENGTH] -= hit.length;
-	    self[CACHE].delete(hit.key);
-	    self[LRU_LIST].removeNode(node);
-	  }
-	};
-
-	class Entry {
-	  constructor (key, value, length, now, maxAge) {
-	    this.key = key;
-	    this.value = value;
-	    this.length = length;
-	    this.now = now;
-	    this.maxAge = maxAge || 0;
-	  }
-	}
-
-	const forEachStep = (self, fn, node, thisp) => {
-	  let hit = node.value;
-	  if (isStale(self, hit)) {
-	    del(self, node);
-	    if (!self[ALLOW_STALE])
-	      hit = undefined;
-	  }
-	  if (hit)
-	    fn.call(thisp, hit.value, hit.key, self);
-	};
-
-	var lruCache = LRUCache;
-
-	// hoisted class for cyclic dependency
-	class Range {
-	  constructor (range, options) {
-	    options = parseOptions_1(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, split based on boolean or ||
-	    this.raw = range;
-	    this.set = range
-	      .split(/\s*\|\|\s*/)
-	      // map the range to a 2d array of comparators
-	      .map(range => this.parseRange(range.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: ${range}`)
-	    }
-
-	    // 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$1(c[0])) {
-	            this.set = [c];
-	            break
-	          }
-	        }
-	      }
-	    }
-
-	    this.format();
-	  }
-
-	  format () {
-	    this.range = this.set
-	      .map((comps) => {
-	        return comps.join(' ').trim()
-	      })
-	      .join('||')
-	      .trim();
-	    return this.range
-	  }
-
-	  toString () {
-	    return this.range
-	  }
-
-	  parseRange (range) {
-	    range = range.trim();
-
-	    // memoize range parsing for performance.
-	    // this is a very hot path, and fully deterministic.
-	    const memoOpts = Object.keys(this.options).join(',');
-	    const memoKey = `parseRange:${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$5[t$5.HYPHENRANGELOOSE] : re$5[t$5.HYPHENRANGE];
-	    range = range.replace(hr, hyphenReplace(this.options.includePrerelease));
-	    debug_1('hyphen replace', range);
-	    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
-	    range = range.replace(re$5[t$5.COMPARATORTRIM], comparatorTrimReplace);
-	    debug_1('comparator trim', range, re$5[t$5.COMPARATORTRIM]);
-
-	    // `~ 1.2.3` => `~1.2.3`
-	    range = range.replace(re$5[t$5.TILDETRIM], tildeTrimReplace);
-
-	    // `^ 1.2.3` => `^1.2.3`
-	    range = range.replace(re$5[t$5.CARETTRIM], caretTrimReplace);
-
-	    // normalize spaces
-	    range = range.split(/\s+/).join(' ');
-
-	    // At this point, the range is completely trimmed and
-	    // ready to be split into comparators.
-
-	    const compRe = loose ? re$5[t$5.COMPARATORLOOSE] : re$5[t$5.COMPARATOR];
-	    const rangeList = range
-	      .split(' ')
-	      .map(comp => parseComparator(comp, this.options))
-	      .join(' ')
-	      .split(/\s+/)
-	      // >=0.0.0 is equivalent to *
-	      .map(comp => replaceGTE0(comp, this.options))
-	      // in loose mode, throw out any that are not valid comparators
-	      .filter(this.options.loose ? comp => !!comp.match(compRe) : () => true)
-	      .map(comp => new comparator(comp, this.options));
-
-	    // 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
-	    rangeList.length;
-	    const rangeMap = new Map();
-	    for (const comp of rangeList) {
-	      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
-	  }
-	}
-	var range = Range;
-
-
-	const cache = new lruCache({ max: 1000 });
-
-
-
-
-
-	const {
-	  re: re$5,
-	  t: t$5,
-	  comparatorTrimReplace,
-	  tildeTrimReplace,
-	  caretTrimReplace
-	} = re_1;
-
-	const isNullSet = c => c.value === '<0.0.0-0';
-	const isAny$1 = c => c.value === '';
-
-	// take a set of comparators and determine whether there
-	// exists a version which can satisfy it
-	const isSatisfiable = (comparators, options) => {
-	  let result = true;
-	  const remainingComparators = comparators.slice();
-	  let testComparator = remainingComparators.pop();
-
-	  while (result && remainingComparators.length) {
-	    result = remainingComparators.every((otherComparator) => {
-	      return testComparator.intersects(otherComparator, options)
-	    });
-
-	    testComparator = remainingComparators.pop();
-	  }
-
-	  return result
-	};
-
-	// comprised of xranges, tildes, stars, and gtlt's at this point.
-	// already replaced the hyphen ranges
-	// turn into a set of JUST comparators.
-	const parseComparator = (comp, options) => {
-	  debug_1('comp', comp, options);
-	  comp = replaceCarets(comp, options);
-	  debug_1('caret', comp);
-	  comp = replaceTildes(comp, options);
-	  debug_1('tildes', comp);
-	  comp = replaceXRanges(comp, options);
-	  debug_1('xrange', comp);
-	  comp = replaceStars(comp, options);
-	  debug_1('stars', comp);
-	  return comp
-	};
-
-	const isX = id => !id || id.toLowerCase() === 'x' || id === '*';
-
-	// ~, ~> --> * (any, kinda silly)
-	// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0
-	// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0
-	// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0
-	// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0
-	// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0
-	const replaceTildes = (comp, options) =>
-	  comp.trim().split(/\s+/).map((comp) => {
-	    return replaceTilde(comp, options)
-	  }).join(' ');
-
-	const replaceTilde = (comp, options) => {
-	  const r = options.loose ? re$5[t$5.TILDELOOSE] : re$5[t$5.TILDE];
-	  return comp.replace(r, (_, M, m, p, pr) => {
-	    debug_1('tilde', comp, _, M, m, p, pr);
-	    let ret;
-
-	    if (isX(M)) {
-	      ret = '';
-	    } else if (isX(m)) {
-	      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`;
-	    } else if (isX(p)) {
-	      // ~1.2 == >=1.2.0 <1.3.0-0
-	      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`;
-	    } else if (pr) {
-	      debug_1('replaceTilde pr', pr);
-	      ret = `>=${M}.${m}.${p}-${pr
-      } <${M}.${+m + 1}.0-0`;
-	    } else {
-	      // ~1.2.3 == >=1.2.3 <1.3.0-0
-	      ret = `>=${M}.${m}.${p
-      } <${M}.${+m + 1}.0-0`;
-	    }
-
-	    debug_1('tilde return', ret);
-	    return ret
-	  })
-	};
-
-	// ^ --> * (any, kinda silly)
-	// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0
-	// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0
-	// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0
-	// ^1.2.3 --> >=1.2.3 <2.0.0-0
-	// ^1.2.0 --> >=1.2.0 <2.0.0-0
-	const replaceCarets = (comp, options) =>
-	  comp.trim().split(/\s+/).map((comp) => {
-	    return replaceCaret(comp, options)
-	  }).join(' ');
-
-	const replaceCaret = (comp, options) => {
-	  debug_1('caret', comp, options);
-	  const r = options.loose ? re$5[t$5.CARETLOOSE] : re$5[t$5.CARET];
-	  const z = options.includePrerelease ? '-0' : '';
-	  return comp.replace(r, (_, M, m, p, pr) => {
-	    debug_1('caret', comp, _, M, m, p, pr);
-	    let ret;
-
-	    if (isX(M)) {
-	      ret = '';
-	    } else if (isX(m)) {
-	      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`;
-	    } else if (isX(p)) {
-	      if (M === '0') {
-	        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`;
-	      } else {
-	        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`;
-	      }
-	    } else if (pr) {
-	      debug_1('replaceCaret pr', pr);
-	      if (M === '0') {
-	        if (m === '0') {
-	          ret = `>=${M}.${m}.${p}-${pr
-          } <${M}.${m}.${+p + 1}-0`;
-	        } else {
-	          ret = `>=${M}.${m}.${p}-${pr
-          } <${M}.${+m + 1}.0-0`;
-	        }
-	      } else {
-	        ret = `>=${M}.${m}.${p}-${pr
-        } <${+M + 1}.0.0-0`;
-	      }
-	    } else {
-	      debug_1('no pr');
-	      if (M === '0') {
-	        if (m === '0') {
-	          ret = `>=${M}.${m}.${p
-          }${z} <${M}.${m}.${+p + 1}-0`;
-	        } else {
-	          ret = `>=${M}.${m}.${p
-          }${z} <${M}.${+m + 1}.0-0`;
-	        }
-	      } else {
-	        ret = `>=${M}.${m}.${p
-        } <${+M + 1}.0.0-0`;
-	      }
-	    }
-
-	    debug_1('caret return', ret);
-	    return ret
-	  })
-	};
-
-	const replaceXRanges = (comp, options) => {
-	  debug_1('replaceXRanges', comp, options);
-	  return comp.split(/\s+/).map((comp) => {
-	    return replaceXRange(comp, options)
-	  }).join(' ')
-	};
-
-	const replaceXRange = (comp, options) => {
-	  comp = comp.trim();
-	  const r = options.loose ? re$5[t$5.XRANGELOOSE] : re$5[t$5.XRANGE];
-	  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {
-	    debug_1('xRange', comp, ret, gtlt, M, m, p, pr);
-	    const xM = isX(M);
-	    const xm = xM || isX(m);
-	    const xp = xm || isX(p);
-	    const anyX = xp;
-
-	    if (gtlt === '=' && anyX) {
-	      gtlt = '';
-	    }
-
-	    // if we're including prereleases in the match, then we need
-	    // to fix this to -0, the lowest possible prerelease value
-	    pr = options.includePrerelease ? '-0' : '';
-
-	    if (xM) {
-	      if (gtlt === '>' || gtlt === '<') {
-	        // nothing is allowed
-	        ret = '<0.0.0-0';
-	      } else {
-	        // nothing is forbidden
-	        ret = '*';
-	      }
-	    } else if (gtlt && anyX) {
-	      // we know patch is an x, because we have any x at all.
-	      // replace X with 0
-	      if (xm) {
-	        m = 0;
-	      }
-	      p = 0;
-
-	      if (gtlt === '>') {
-	        // >1 => >=2.0.0
-	        // >1.2 => >=1.3.0
-	        gtlt = '>=';
-	        if (xm) {
-	          M = +M + 1;
-	          m = 0;
-	          p = 0;
-	        } else {
-	          m = +m + 1;
-	          p = 0;
-	        }
-	      } else if (gtlt === '<=') {
-	        // <=0.7.x is actually <0.8.0, since any 0.7.x should
-	        // pass.  Similarly, <=7.x is actually <8.0.0, etc.
-	        gtlt = '<';
-	        if (xm) {
-	          M = +M + 1;
-	        } else {
-	          m = +m + 1;
-	        }
-	      }
-
-	      if (gtlt === '<')
-	        pr = '-0';
-
-	      ret = `${gtlt + M}.${m}.${p}${pr}`;
-	    } else if (xm) {
-	      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`;
-	    } else if (xp) {
-	      ret = `>=${M}.${m}.0${pr
-      } <${M}.${+m + 1}.0-0`;
-	    }
-
-	    debug_1('xRange return', ret);
-
-	    return ret
-	  })
-	};
-
-	// Because * is AND-ed with everything else in the comparator,
-	// and '' means "any version", just remove the *s entirely.
-	const replaceStars = (comp, options) => {
-	  debug_1('replaceStars', comp, options);
-	  // Looseness is ignored here.  star is always as loose as it gets!
-	  return comp.trim().replace(re$5[t$5.STAR], '')
-	};
-
-	const replaceGTE0 = (comp, options) => {
-	  debug_1('replaceGTE0', comp, options);
-	  return comp.trim()
-	    .replace(re$5[options.includePrerelease ? t$5.GTE0PRE : t$5.GTE0], '')
-	};
-
-	// This function is passed to string.replace(re[t.HYPHENRANGE])
-	// M, m, patch, prerelease, build
-	// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5
-	// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do
-	// 1.2 - 3.4 => >=1.2.0 <3.5.0-0
-	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 = `>=${fM}.0.0${incPr ? '-0' : ''}`;
-	  } else if (isX(fp)) {
-	    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`;
-	  } else if (fpr) {
-	    from = `>=${from}`;
-	  } else {
-	    from = `>=${from}${incPr ? '-0' : ''}`;
-	  }
-
-	  if (isX(tM)) {
-	    to = '';
-	  } else if (isX(tm)) {
-	    to = `<${+tM + 1}.0.0-0`;
-	  } else if (isX(tp)) {
-	    to = `<${tM}.${+tm + 1}.0-0`;
-	  } else if (tpr) {
-	    to = `<=${tM}.${tm}.${tp}-${tpr}`;
-	  } else if (incPr) {
-	    to = `<${tM}.${tm}.${+tp + 1}-0`;
-	  } else {
-	    to = `<=${to}`;
-	  }
-
-	  return (`${from} ${to}`).trim()
-	};
-
-	const testSet = (set, version, options) => {
-	  for (let i = 0; i < set.length; i++) {
-	    if (!set[i].test(version)) {
-	      return false
-	    }
-	  }
-
-	  if (version.prerelease.length && !options.includePrerelease) {
-	    // Find the set of versions that are allowed to have prereleases
-	    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0
-	    // That should allow `1.2.3-pr.2` to pass.
-	    // However, `1.2.4-alpha.notready` should NOT be allowed,
-	    // even though it's within the range set by the comparators.
-	    for (let i = 0; i < set.length; i++) {
-	      debug_1(set[i].semver);
-	      if (set[i].semver === comparator.ANY) {
-	        continue
-	      }
-
-	      if (set[i].semver.prerelease.length > 0) {
-	        const allowed = set[i].semver;
-	        if (allowed.major === version.major &&
-	            allowed.minor === version.minor &&
-	            allowed.patch === version.patch) {
-	          return true
-	        }
-	      }
-	    }
-
-	    // Version has a -pre, but it's not one of the ones we like.
-	    return false
-	  }
-
-	  return true
-	};
-
-	const ANY = Symbol('SemVer ANY');
-	// hoisted class for cyclic dependency
-	class Comparator {
-	  static get ANY () {
-	    return ANY
-	  }
-	  constructor (comp, options) {
-	    options = parseOptions_1(options);
-
-	    if (comp instanceof Comparator) {
-	      if (comp.loose === !!options.loose) {
-	        return comp
-	      } else {
-	        comp = comp.value;
-	      }
-	    }
-
-	    debug_1('comparator', comp, options);
-	    this.options = options;
-	    this.loose = !!options.loose;
-	    this.parse(comp);
+	  return `bio-properties-panel-${id}`;
+	}
 
-	    if (this.semver === ANY) {
-	      this.value = '';
-	    } else {
-	      this.value = this.operator + this.semver.version;
-	    }
+	function Textfield(props) {
+	  const {
+	    debounce,
+	    disabled = false,
+	    id,
+	    label,
+	    onInput,
+	    feel = false,
+	    value = ''
+	  } = props;
+	  const handleInput = d$1(() => {
+	    return debounce(({
+	      target
+	    }) => onInput(target.value.length ? target.value : undefined));
+	  }, [onInput, debounce]);
+	  return o$2("div", {
+	    class: "bio-properties-panel-textfield",
+	    children: [o$2("label", {
+	      for: prefixId$1(id),
+	      class: "bio-properties-panel-label",
+	      children: [label, feel && o$2(FeelIcon, {
+	        feel: feel,
+	        label: label
+	      })]
+	    }), o$2("input", {
+	      id: prefixId$1(id),
+	      type: "text",
+	      name: id,
+	      spellCheck: "false",
+	      autoComplete: "off",
+	      disabled: disabled,
+	      class: "bio-properties-panel-input",
+	      onInput: handleInput,
+	      onFocus: props.onFocus,
+	      onBlur: props.onBlur,
+	      value: value || ''
+	    })]
+	  });
+	}
+	/**
+	 * @param {Object} props
+	 * @param {Object} props.element
+	 * @param {String} props.id
+	 * @param {String} props.description
+	 * @param {Boolean} props.debounce
+	 * @param {Boolean} props.disabled
+	 * @param {String} props.label
+	 * @param {Function} props.getValue
+	 * @param {Function} props.setValue
+	 * @param {Function} props.validate
+	 */
 
-	    debug_1('comp', this);
-	  }
 
-	  parse (comp) {
-	    const r = this.options.loose ? re$6[t$6.COMPARATORLOOSE] : re$6[t$6.COMPARATOR];
-	    const m = comp.match(r);
+	function TextfieldEntry(props) {
+	  const {
+	    element,
+	    id,
+	    description,
+	    debounce,
+	    disabled,
+	    feel,
+	    label,
+	    getValue,
+	    setValue,
+	    validate
+	  } = props;
+	  const [error, setError] = l(null);
+	  const [invalidValueCache, setInvalidValueCache] = l(null);
+	  let value = getValue(element);
+	  const prevValue = usePrevious(value); // validate again when value prop changed
 
-	    if (!m) {
-	      throw new TypeError(`Invalid comparator: ${comp}`)
-	    }
+	  y$1(() => {
+	    const err = validate ? validate(value) : null;
+	    setError(err);
+	  }, [value]); // validate on change
 
-	    this.operator = m[1] !== undefined ? m[1] : '';
-	    if (this.operator === '=') {
-	      this.operator = '';
-	    }
+	  const handleChange = newValue => {
+	    const err = validate ? validate(newValue) : null;
 
-	    // if it literally is just '>' or '' then allow anything.
-	    if (!m[2]) {
-	      this.semver = ANY;
+	    if (err) {
+	      setInvalidValueCache(newValue);
 	    } else {
-	      this.semver = new semver(m[2], this.options.loose);
+	      setValue(newValue);
 	    }
-	  }
 
-	  toString () {
-	    return this.value
-	  }
-
-	  test (version) {
-	    debug_1('Comparator.test', version, this.options.loose);
-
-	    if (this.semver === ANY || version === ANY) {
-	      return true
-	    }
+	    setError(err);
+	  }; // keep showing invalid value on errors, although it was not set
 
-	    if (typeof version === 'string') {
-	      try {
-	        version = new semver(version, this.options);
-	      } catch (er) {
-	        return false
-	      }
-	    }
 
-	    return cmp_1(version, this.operator, this.semver, this.options)
+	  if (prevValue === value && error) {
+	    value = invalidValueCache;
 	  }
 
-	  intersects (comp, options) {
-	    if (!(comp instanceof Comparator)) {
-	      throw new TypeError('a Comparator is required')
-	    }
-
-	    if (!options || typeof options !== 'object') {
-	      options = {
-	        loose: !!options,
-	        includePrerelease: false
-	      };
-	    }
-
-	    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)
-	    }
-
-	    const sameDirectionIncreasing =
-	      (this.operator === '>=' || this.operator === '>') &&
-	      (comp.operator === '>=' || comp.operator === '>');
-	    const sameDirectionDecreasing =
-	      (this.operator === '<=' || this.operator === '<') &&
-	      (comp.operator === '<=' || comp.operator === '<');
-	    const sameSemVer = this.semver.version === comp.semver.version;
-	    const differentDirectionsInclusive =
-	      (this.operator === '>=' || this.operator === '<=') &&
-	      (comp.operator === '>=' || comp.operator === '<=');
-	    const oppositeDirectionsLessThan =
-	      cmp_1(this.semver, '<', comp.semver, options) &&
-	      (this.operator === '>=' || this.operator === '>') &&
-	        (comp.operator === '<=' || comp.operator === '<');
-	    const oppositeDirectionsGreaterThan =
-	      cmp_1(this.semver, '>', comp.semver, options) &&
-	      (this.operator === '<=' || this.operator === '<') &&
-	        (comp.operator === '>=' || comp.operator === '>');
-
-	    return (
-	      sameDirectionIncreasing ||
-	      sameDirectionDecreasing ||
-	      (sameSemVer && differentDirectionsInclusive) ||
-	      oppositeDirectionsLessThan ||
-	      oppositeDirectionsGreaterThan
-	    )
-	  }
+	  return o$2("div", {
+	    class: classnames('bio-properties-panel-entry', error ? 'has-error' : ''),
+	    "data-entry-id": id,
+	    children: [o$2(Textfield, {
+	      id: id,
+	      label: label,
+	      value: value,
+	      onInput: handleChange,
+	      debounce: debounce,
+	      disabled: disabled,
+	      feel: feel
+	    }), o$2(Description, {
+	      forId: id,
+	      element: element,
+	      value: description
+	    }), error && o$2("div", {
+	      class: "bio-properties-panel-error",
+	      children: error
+	    })]
+	  });
 	}
+	function isEdited$1(node) {
+	  return node && !!node.value;
+	} // helpers /////////////////
 
-	var comparator = Comparator;
-
-
-	const {re: re$6, t: t$6} = re_1;
-
-	const satisfies = (version, range$1, options) => {
-	  try {
-	    range$1 = new range(range$1, options);
-	  } catch (er) {
-	    return false
-	  }
-	  return range$1.test(version)
-	};
-	var satisfies_1 = satisfies;
-
-	// Mostly just for testing and legacy API reasons
-	const toComparators = (range$1, options) =>
-	  new range(range$1, options).set
-	    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '));
-
-	var toComparators_1 = toComparators;
+	function prefixId$1(id) {
+	  return `bio-properties-panel-${id}`;
+	}
 
-	const maxSatisfying = (versions, range$1, options) => {
-	  let max = null;
-	  let maxSV = null;
-	  let rangeObj = null;
-	  try {
-	    rangeObj = new range(range$1, options);
-	  } catch (er) {
-	    return null
-	  }
-	  versions.forEach((v) => {
-	    if (rangeObj.test(v)) {
-	      // satisfies(v, range, options)
-	      if (!max || maxSV.compare(v) === -1) {
-	        // compare(max, v, true)
-	        max = v;
-	        maxSV = new semver(max, options);
-	      }
+	const DEFAULT_DEBOUNCE_TIME = 300;
+	function debounceInput(debounceDelay) {
+	  return function _debounceInput(fn) {
+	    if (debounceDelay !== false) {
+	      var debounceTime = isNumber(debounceDelay) ? debounceDelay : DEFAULT_DEBOUNCE_TIME;
+	      return debounce(fn, debounceTime);
+	    } else {
+	      return fn;
 	    }
-	  });
-	  return max
-	};
-	var maxSatisfying_1 = maxSatisfying;
+	  };
+	}
+	debounceInput.$inject = ['config.debounceInput'];
 
-	const minSatisfying = (versions, range$1, options) => {
-	  let min = null;
-	  let minSV = null;
-	  let rangeObj = null;
-	  try {
-	    rangeObj = new range(range$1, options);
-	  } catch (er) {
-	    return null
-	  }
-	  versions.forEach((v) => {
-	    if (rangeObj.test(v)) {
-	      // satisfies(v, range, options)
-	      if (!min || minSV.compare(v) === 1) {
-	        // compare(min, v, true)
-	        min = v;
-	        minSV = new semver(min, options);
-	      }
-	    }
-	  });
-	  return min
+	var index$2 = {
+	  debounceInput: ['factory', debounceInput]
 	};
-	var minSatisfying_1 = minSatisfying;
-
-	const minVersion = (range$1, loose) => {
-	  range$1 = new range(range$1, loose);
-
-	  let minver = new semver('0.0.0');
-	  if (range$1.test(minver)) {
-	    return minver
-	  }
-
-	  minver = new semver('0.0.0-0');
-	  if (range$1.test(minver)) {
-	    return minver
-	  }
 
-	  minver = null;
-	  for (let i = 0; i < range$1.set.length; ++i) {
-	    const comparators = range$1.set[i];
+	/**
+	 * Failsafe remove an element from a collection
+	 *
+	 * @param  {Array<Object>} [collection]
+	 * @param  {Object} [element]
+	 *
+	 * @return {number} the previous index of the element
+	 */
 
-	    let setMin = null;
-	    comparators.forEach((comparator) => {
-	      // Clone to avoid manipulating the comparator's semver object.
-	      const compver = new semver(comparator.semver.version);
-	      switch (comparator.operator) {
-	        case '>':
-	          if (compver.prerelease.length === 0) {
-	            compver.patch++;
-	          } else {
-	            compver.prerelease.push(0);
-	          }
-	          compver.raw = compver.format();
-	          /* fallthrough */
-	        case '':
-	        case '>=':
-	          if (!setMin || gt_1(compver, setMin)) {
-	            setMin = compver;
-	          }
-	          break
-	        case '<':
-	        case '<=':
-	          /* Ignore maximum versions */
-	          break
-	        /* istanbul ignore next */
-	        default:
-	          throw new Error(`Unexpected operation: ${comparator.operator}`)
-	      }
-	    });
-	    if (setMin && (!minver || gt_1(minver, setMin)))
-	      minver = setMin;
-	  }
+	/**
+	 * Fail save add an element to the given connection, ensuring
+	 * it does not yet exist.
+	 *
+	 * @param {Array<Object>} collection
+	 * @param {Object} element
+	 * @param {number} idx
+	 */
+	function add$2(collection, element, idx) {
 
-	  if (minver && range$1.test(minver)) {
-	    return minver
+	  if (!collection || !element) {
+	    return;
 	  }
 
-	  return null
-	};
-	var minVersion_1 = minVersion;
-
-	const validRange = (range$1, options) => {
-	  try {
-	    // Return '*' instead of '' so that truthiness works.
-	    // This will throw if it's invalid anyway
-	    return new range(range$1, options).range || '*'
-	  } catch (er) {
-	    return null
+	  if (typeof idx !== 'number') {
+	    idx = -1;
 	  }
-	};
-	var valid$1 = validRange;
-
-	const {ANY: ANY$1} = comparator;
 
+	  var currentIdx = collection.indexOf(element);
 
+	  if (currentIdx !== -1) {
 
+	    if (currentIdx === idx) {
 
+	      // nothing to do, position has not changed
+	      return;
+	    } else {
 
+	      if (idx !== -1) {
 
+	        // remove from current position
+	        collection.splice(currentIdx, 1);
+	      } else {
 
-	const outside = (version, range$1, hilo, options) => {
-	  version = new semver(version, options);
-	  range$1 = new range(range$1, 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_1(version, range$1, 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$1.set.length; ++i) {
-	    const comparators = range$1.set[i];
-
-	    let high = null;
-	    let low = null;
-
-	    comparators.forEach((comparator$1) => {
-	      if (comparator$1.semver === ANY$1) {
-	        comparator$1 = new comparator('>=0.0.0');
-	      }
-	      high = high || comparator$1;
-	      low = low || comparator$1;
-	      if (gtfn(comparator$1.semver, high.semver, options)) {
-	        high = comparator$1;
-	      } else if (ltfn(comparator$1.semver, low.semver, options)) {
-	        low = comparator$1;
+	        // already exists in collection
+	        return;
 	      }
-	    });
-
-	    // 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;
-
-	// Determine if version is greater than all the versions possible in the range.
-
-	const gtr = (version, range, options) => outside_1(version, range, '>', options);
-	var gtr_1 = gtr;
-
-	// Determine if version is less than all the versions possible in the range
-	const ltr = (version, range, options) => outside_1(version, range, '<', options);
-	var ltr_1 = ltr;
-
-	const intersects = (r1, r2, options) => {
-	  r1 = new range(r1, options);
-	  r2 = new range(r2, options);
-	  return r1.intersects(r2)
-	};
-	var intersects_1 = intersects;
-
-	// 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.
 
+	  if (idx !== -1) {
 
-	var simplify = (versions, range, options) => {
-	  const set = [];
-	  let min = null;
-	  let prev = null;
-	  const v = versions.sort((a, b) => compare_1(a, b, options));
-	  for (const version of v) {
-	    const included = satisfies_1(version, range, options);
-	    if (included) {
-	      prev = version;
-	      if (!min)
-	        min = version;
-	    } else {
-	      if (prev) {
-	        set.push([min, prev]);
-	      }
-	      prev = null;
-	      min = null;
-	    }
-	  }
-	  if (min)
-	    set.push([min, null]);
+	    // insert at specified position
+	    collection.splice(idx, 0, element);
+	  } else {
 
-	  const ranges = [];
-	  for (const [min, max] of set) {
-	    if (min === max)
-	      ranges.push(min);
-	    else if (!max && min === v[0])
-	      ranges.push('*');
-	    else if (!max)
-	      ranges.push(`>=${min}`);
-	    else if (min === v[0])
-	      ranges.push(`<=${max}`);
-	    else
-	      ranges.push(`${min} - ${max}`);
+	    // push to end
+	    collection.push(element);
 	  }
-	  const simplified = ranges.join(' || ');
-	  const original = typeof range.raw === 'string' ? range.raw : String(range);
-	  return simplified.length < original.length ? simplified : range
-	};
-
-	const { ANY: ANY$2 } = comparator;
-
-
-
-	// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:
-	// - Every simple range `r1, r2, ...` is a null set, OR
-	// - Every simple range `r1, r2, ...` which is not a null set is a subset of
-	//   some `R1, R2, ...`
-	//
-	// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:
-	// - If c is only the ANY comparator
-	//   - If C is only the ANY comparator, return true
-	//   - Else if in prerelease mode, return false
-	//   - else replace c with `[>=0.0.0]`
-	// - If C is only the ANY comparator
-	//   - if in prerelease mode, return true
-	//   - else replace C with `[>=0.0.0]`
-	// - Let EQ be the set of = comparators in c
-	// - If EQ is more than one, return true (null set)
-	// - Let GT be the highest > or >= comparator in c
-	// - Let LT be the lowest < or <= comparator in c
-	// - If GT and LT, and GT.semver > LT.semver, return true (null set)
-	// - If any C is a = range, and GT or LT are set, return false
-	// - If EQ
-	//   - If GT, and EQ does not satisfy GT, return true (null set)
-	//   - If LT, and EQ does not satisfy LT, return true (null set)
-	//   - If EQ satisfies every C, return true
-	//   - Else return false
-	// - If GT
-	//   - If GT.semver is lower than any > or >= comp in C, return false
-	//   - If GT is >=, and GT.semver does not satisfy every C, return false
-	//   - If GT.semver has a prerelease, and not in prerelease mode
-	//     - If no C has a prerelease and the GT.semver tuple, return false
-	// - If LT
-	//   - If LT.semver is greater than any < or <= comp in C, return false
-	//   - If LT is <=, and LT.semver does not satisfy every C, return false
-	//   - If GT.semver has a prerelease, and not in prerelease mode
-	//     - If no C has a prerelease and the LT.semver tuple, return false
-	// - Else return true
-
-	const subset = (sub, dom, options = {}) => {
-	  if (sub === dom)
-	    return true
-
-	  sub = new range(sub, options);
-	  dom = new range(dom, options);
-	  let sawNonNull = false;
-
-	  OUTER: for (const simpleSub of sub.set) {
-	    for (const simpleDom of dom.set) {
-	      const isSub = simpleSubset(simpleSub, simpleDom, options);
-	      sawNonNull = sawNonNull || isSub !== null;
-	      if (isSub)
-	        continue OUTER
-	    }
-	    // the null set is a subset of everything, but null simple ranges in
-	    // a complex range should be ignored.  so if we saw a non-null range,
-	    // then we know this isn't a subset, but if EVERY simple range was null,
-	    // then it is a subset.
-	    if (sawNonNull)
-	      return false
-	  }
-	  return true
-	};
-
-	const simpleSubset = (sub, dom, options) => {
-	  if (sub === dom)
-	    return true
-
-	  if (sub.length === 1 && sub[0].semver === ANY$2) {
-	    if (dom.length === 1 && dom[0].semver === ANY$2)
-	      return true
-	    else if (options.includePrerelease)
-	      sub = [ new comparator('>=0.0.0-0') ];
-	    else
-	      sub = [ new comparator('>=0.0.0') ];
-	  }
-
-	  if (dom.length === 1 && dom[0].semver === ANY$2) {
-	    if (options.includePrerelease)
-	      return true
-	    else
-	      dom = [ new comparator('>=0.0.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);
-	    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
-	    }
-
-	    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 false
-	    }
-	    if (lt) {
-	      if (needDomLTPre) {
-	        if (c.semver.prerelease && c.semver.prerelease.length &&
-	            c.semver.major === needDomLTPre.major &&
-	            c.semver.minor === needDomLTPre.minor &&
-	            c.semver.patch === needDomLTPre.patch) {
-	          needDomLTPre = false;
-	        }
-	      }
-	      if (c.operator === '<' || c.operator === '<=') {
-	        lower = lowerLT(lt, c, options);
-	        if (lower === c && lower !== lt)
-	          return false
-	      } else if (lt.operator === '<=' && !satisfies_1(lt.semver, String(c), options))
-	        return false
-	    }
-	    if (!c.operator && (lt || gt) && gtltComp !== 0)
-	      return false
-	  }
-
-	  // if there was a < or >, and nothing in the dom, then must be false
-	  // UNLESS it was limited by another range in the other direction.
-	  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
-	  if (gt && hasDomLT && !lt && gtltComp !== 0)
-	    return false
-
-	  if (lt && hasDomGT && !gt && gtltComp !== 0)
-	    return false
-
-	  // we needed a prerelease range in a specific tuple, but didn't get one
-	  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,
-	  // because it includes prereleases in the 1.2.3 tuple
-	  if (needDomGTPre || needDomLTPre)
-	    return false
-
-	  return true
-	};
-
-	// >=1.2.3 is lower than >1.2.3
-	const higherGT = (a, b, options) => {
-	  if (!a)
-	    return b
-	  const comp = compare_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;
-
-	// just pre-load all the stuff that index.js lazily exports
-
-	({
-	  re: re_1.re,
-	  src: re_1.src,
-	  tokens: re_1.t,
-	  SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,
-	  SemVer: semver,
-	  compareIdentifiers: identifiers.compareIdentifiers,
-	  rcompareIdentifiers: identifiers.rcompareIdentifiers,
-	  parse: parse_1,
-	  valid: valid_1,
-	  clean: clean_1,
-	  inc: inc_1,
-	  diff: diff_1,
-	  major: major_1,
-	  minor: minor_1,
-	  patch: patch_1,
-	  prerelease: prerelease_1,
-	  compare: compare_1,
-	  rcompare: rcompare_1,
-	  compareLoose: compareLoose_1,
-	  compareBuild: compareBuild_1,
-	  sort: sort_1,
-	  rsort: rsort_1,
-	  gt: gt_1,
-	  lt: lt_1,
-	  eq: eq_1,
-	  neq: neq_1,
-	  gte: gte_1,
-	  lte: lte_1,
-	  cmp: cmp_1,
-	  coerce: coerce_1,
-	  Comparator: comparator,
-	  Range: range,
-	  satisfies: satisfies_1,
-	  toComparators: toComparators_1,
-	  maxSatisfying: maxSatisfying_1,
-	  minSatisfying: minSatisfying_1,
-	  minVersion: minVersion_1,
-	  validRange: valid$1,
-	  outside: outside_1,
-	  gtr: gtr_1,
-	  ltr: ltr_1,
-	  intersects: intersects_1,
-	  simplifyRange: simplify,
-	  subset: subset_1,
-	});
+	}
 
 	const BpmnPropertiesPanelContext = q({
 	  selectedElement: null,
@@ -66859,7 +64211,7 @@
 	      label: translate('<none>')
 	    }];
 	    const activities = findActivityRefs(element);
-	    sortByName$7(activities).forEach(function (activity) {
+	    sortByName$6(activities).forEach(function (activity) {
 	      options.push({
 	        value: activity.id,
 	        label: createOptionLabel(activity)
@@ -66982,7 +64334,7 @@
 	  return `${name ? name + ' ' : ''}(id=${id})`;
 	}
 
-	function sortByName$7(elements) {
+	function sortByName$6(elements) {
 	  return sortBy(elements, e => (e.name || '').toLowerCase());
 	}
 
@@ -67286,7 +64638,7 @@
 	      label: translate('Create new ...')
 	    }];
 	    const errors = findRootElementsByType(getBusinessObject(element), 'bpmn:Error');
-	    sortByName$6(errors).forEach(error => {
+	    sortByName$5(errors).forEach(error => {
 	      options.push({
 	        value: error.get('id'),
 	        label: error.get('name')
@@ -67373,7 +64725,7 @@
 	} // helper /////////////////////////
 
 
-	function sortByName$6(elements) {
+	function sortByName$5(elements) {
 	  return sortBy(elements, e => (e.name || '').toLowerCase());
 	}
 
@@ -67480,7 +64832,7 @@
 	      label: translate('Create new ...')
 	    }];
 	    const escalations = findRootElementsByType(getBusinessObject(element), 'bpmn:Escalation');
-	    sortByName$5(escalations).forEach(escalation => {
+	    sortByName$4(escalations).forEach(escalation => {
 	      options.push({
 	        value: escalation.get('id'),
 	        label: escalation.get('name')
@@ -67567,7 +64919,7 @@
 	} // helper /////////////////////////
 
 
-	function sortByName$5(elements) {
+	function sortByName$4(elements) {
 	  return sortBy(elements, e => (e.name || '').toLowerCase());
 	}
 
@@ -67829,7 +65181,7 @@
 	  if (message) {
 	    entries = [...entries, {
 	      id: 'messageName',
-	      component: MessageName,
+	      component: MessageName$1,
 	      isEdited: isEdited$1
 	    }];
 	  }
@@ -67905,7 +65257,7 @@
 	      label: translate('Create new ...')
 	    }];
 	    const messages = findRootElementsByType(getBusinessObject(element), 'bpmn:Message');
-	    sortByName$4(messages).forEach(message => {
+	    sortByName$3(messages).forEach(message => {
 	      options.push({
 	        value: message.get('id'),
 	        label: message.get('name')
@@ -67925,7 +65277,7 @@
 	  });
 	}
 
-	function MessageName(props) {
+	function MessageName$1(props) {
 	  const {
 	    element
 	  } = props;
@@ -67959,7 +65311,7 @@
 	} // helper /////////////////////////
 
 
-	function sortByName$4(elements) {
+	function sortByName$3(elements) {
 	  return sortBy(elements, e => (e.name || '').toLowerCase());
 	}
 
@@ -68525,7 +65877,7 @@
 	      label: translate('Create new ...')
 	    }];
 	    const signals = findRootElementsByType(getBusinessObject(element), 'bpmn:Signal');
-	    sortByName$3(signals).forEach(signal => {
+	    sortByName$2(signals).forEach(signal => {
 	      options.push({
 	        value: signal.get('id'),
 	        label: signal.get('name')
@@ -68579,7 +65931,7 @@
 	} // helper /////////////////////////
 
 
-	function sortByName$3(elements) {
+	function sortByName$2(elements) {
 	  return sortBy(elements, e => (e.name || '').toLowerCase());
 	}