@baloise/ds-core 20.0.0-next.4 → 20.0.0-next.6

package/dist/cjs/array-CioNm_V1.js

@@ -0,0 +1,1985 @@
+/*!
+ * (C) Helvetia Design System https://design.baloise.dev/ - Apache License 2.0
+ */
+'use strict';
+
+var _commonjsHelpers = require('./_commonjsHelpers-DVhpm0hL.js');
+var _getTag = require('./_getTag-B468r9bu.js');
+var isObjectLike = require('./isObjectLike-h-ta_ikf.js');
+var isNil = require('./isNil-DuJ_OV5R.js');
+
+/**
+ * Removes all key-value entries from the list cache.
+ *
+ * @private
+ * @name clear
+ * @memberOf ListCache
+ */
+
+var _listCacheClear;
+var hasRequired_listCacheClear;
+
+function require_listCacheClear () {
+	if (hasRequired_listCacheClear) return _listCacheClear;
+	hasRequired_listCacheClear = 1;
+	function listCacheClear() {
+	  this.__data__ = [];
+	  this.size = 0;
+	}
+
+	_listCacheClear = listCacheClear;
+	return _listCacheClear;
+}
+
+/**
+ * Performs a
+ * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * comparison between two values to determine if they are equivalent.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ * @example
+ *
+ * var object = { 'a': 1 };
+ * var other = { 'a': 1 };
+ *
+ * _.eq(object, object);
+ * // => true
+ *
+ * _.eq(object, other);
+ * // => false
+ *
+ * _.eq('a', 'a');
+ * // => true
+ *
+ * _.eq('a', Object('a'));
+ * // => false
+ *
+ * _.eq(NaN, NaN);
+ * // => true
+ */
+
+var eq_1;
+var hasRequiredEq;
+
+function requireEq () {
+	if (hasRequiredEq) return eq_1;
+	hasRequiredEq = 1;
+	function eq(value, other) {
+	  return value === other || (value !== value && other !== other);
+	}
+
+	eq_1 = eq;
+	return eq_1;
+}
+
+var _assocIndexOf;
+var hasRequired_assocIndexOf;
+
+function require_assocIndexOf () {
+	if (hasRequired_assocIndexOf) return _assocIndexOf;
+	hasRequired_assocIndexOf = 1;
+	var eq = requireEq();
+
+	/**
+	 * Gets the index at which the `key` is found in `array` of key-value pairs.
+	 *
+	 * @private
+	 * @param {Array} array The array to inspect.
+	 * @param {*} key The key to search for.
+	 * @returns {number} Returns the index of the matched value, else `-1`.
+	 */
+	function assocIndexOf(array, key) {
+	  var length = array.length;
+	  while (length--) {
+	    if (eq(array[length][0], key)) {
+	      return length;
+	    }
+	  }
+	  return -1;
+	}
+
+	_assocIndexOf = assocIndexOf;
+	return _assocIndexOf;
+}
+
+var _listCacheDelete;
+var hasRequired_listCacheDelete;
+
+function require_listCacheDelete () {
+	if (hasRequired_listCacheDelete) return _listCacheDelete;
+	hasRequired_listCacheDelete = 1;
+	var assocIndexOf = require_assocIndexOf();
+
+	/** Used for built-in method references. */
+	var arrayProto = Array.prototype;
+
+	/** Built-in value references. */
+	var splice = arrayProto.splice;
+
+	/**
+	 * Removes `key` and its value from the list cache.
+	 *
+	 * @private
+	 * @name delete
+	 * @memberOf ListCache
+	 * @param {string} key The key of the value to remove.
+	 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+	 */
+	function listCacheDelete(key) {
+	  var data = this.__data__,
+	      index = assocIndexOf(data, key);
+
+	  if (index < 0) {
+	    return false;
+	  }
+	  var lastIndex = data.length - 1;
+	  if (index == lastIndex) {
+	    data.pop();
+	  } else {
+	    splice.call(data, index, 1);
+	  }
+	  --this.size;
+	  return true;
+	}
+
+	_listCacheDelete = listCacheDelete;
+	return _listCacheDelete;
+}
+
+var _listCacheGet;
+var hasRequired_listCacheGet;
+
+function require_listCacheGet () {
+	if (hasRequired_listCacheGet) return _listCacheGet;
+	hasRequired_listCacheGet = 1;
+	var assocIndexOf = require_assocIndexOf();
+
+	/**
+	 * Gets the list cache value for `key`.
+	 *
+	 * @private
+	 * @name get
+	 * @memberOf ListCache
+	 * @param {string} key The key of the value to get.
+	 * @returns {*} Returns the entry value.
+	 */
+	function listCacheGet(key) {
+	  var data = this.__data__,
+	      index = assocIndexOf(data, key);
+
+	  return index < 0 ? undefined : data[index][1];
+	}
+
+	_listCacheGet = listCacheGet;
+	return _listCacheGet;
+}
+
+var _listCacheHas;
+var hasRequired_listCacheHas;
+
+function require_listCacheHas () {
+	if (hasRequired_listCacheHas) return _listCacheHas;
+	hasRequired_listCacheHas = 1;
+	var assocIndexOf = require_assocIndexOf();
+
+	/**
+	 * Checks if a list cache value for `key` exists.
+	 *
+	 * @private
+	 * @name has
+	 * @memberOf ListCache
+	 * @param {string} key The key of the entry to check.
+	 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+	 */
+	function listCacheHas(key) {
+	  return assocIndexOf(this.__data__, key) > -1;
+	}
+
+	_listCacheHas = listCacheHas;
+	return _listCacheHas;
+}
+
+var _listCacheSet;
+var hasRequired_listCacheSet;
+
+function require_listCacheSet () {
+	if (hasRequired_listCacheSet) return _listCacheSet;
+	hasRequired_listCacheSet = 1;
+	var assocIndexOf = require_assocIndexOf();
+
+	/**
+	 * Sets the list cache `key` to `value`.
+	 *
+	 * @private
+	 * @name set
+	 * @memberOf ListCache
+	 * @param {string} key The key of the value to set.
+	 * @param {*} value The value to set.
+	 * @returns {Object} Returns the list cache instance.
+	 */
+	function listCacheSet(key, value) {
+	  var data = this.__data__,
+	      index = assocIndexOf(data, key);
+
+	  if (index < 0) {
+	    ++this.size;
+	    data.push([key, value]);
+	  } else {
+	    data[index][1] = value;
+	  }
+	  return this;
+	}
+
+	_listCacheSet = listCacheSet;
+	return _listCacheSet;
+}
+
+var _ListCache;
+var hasRequired_ListCache;
+
+function require_ListCache () {
+	if (hasRequired_ListCache) return _ListCache;
+	hasRequired_ListCache = 1;
+	var listCacheClear = require_listCacheClear(),
+	    listCacheDelete = require_listCacheDelete(),
+	    listCacheGet = require_listCacheGet(),
+	    listCacheHas = require_listCacheHas(),
+	    listCacheSet = require_listCacheSet();
+
+	/**
+	 * Creates an list cache object.
+	 *
+	 * @private
+	 * @constructor
+	 * @param {Array} [entries] The key-value pairs to cache.
+	 */
+	function ListCache(entries) {
+	  var index = -1,
+	      length = entries == null ? 0 : entries.length;
+
+	  this.clear();
+	  while (++index < length) {
+	    var entry = entries[index];
+	    this.set(entry[0], entry[1]);
+	  }
+	}
+
+	// Add methods to `ListCache`.
+	ListCache.prototype.clear = listCacheClear;
+	ListCache.prototype['delete'] = listCacheDelete;
+	ListCache.prototype.get = listCacheGet;
+	ListCache.prototype.has = listCacheHas;
+	ListCache.prototype.set = listCacheSet;
+
+	_ListCache = ListCache;
+	return _ListCache;
+}
+
+var _stackClear;
+var hasRequired_stackClear;
+
+function require_stackClear () {
+	if (hasRequired_stackClear) return _stackClear;
+	hasRequired_stackClear = 1;
+	var ListCache = require_ListCache();
+
+	/**
+	 * Removes all key-value entries from the stack.
+	 *
+	 * @private
+	 * @name clear
+	 * @memberOf Stack
+	 */
+	function stackClear() {
+	  this.__data__ = new ListCache;
+	  this.size = 0;
+	}
+
+	_stackClear = stackClear;
+	return _stackClear;
+}
+
+/**
+ * Removes `key` and its value from the stack.
+ *
+ * @private
+ * @name delete
+ * @memberOf Stack
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+var _stackDelete;
+var hasRequired_stackDelete;
+
+function require_stackDelete () {
+	if (hasRequired_stackDelete) return _stackDelete;
+	hasRequired_stackDelete = 1;
+	function stackDelete(key) {
+	  var data = this.__data__,
+	      result = data['delete'](key);
+
+	  this.size = data.size;
+	  return result;
+	}
+
+	_stackDelete = stackDelete;
+	return _stackDelete;
+}
+
+/**
+ * Gets the stack value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf Stack
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+
+var _stackGet;
+var hasRequired_stackGet;
+
+function require_stackGet () {
+	if (hasRequired_stackGet) return _stackGet;
+	hasRequired_stackGet = 1;
+	function stackGet(key) {
+	  return this.__data__.get(key);
+	}
+
+	_stackGet = stackGet;
+	return _stackGet;
+}
+
+/**
+ * Checks if a stack value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf Stack
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+var _stackHas;
+var hasRequired_stackHas;
+
+function require_stackHas () {
+	if (hasRequired_stackHas) return _stackHas;
+	hasRequired_stackHas = 1;
+	function stackHas(key) {
+	  return this.__data__.has(key);
+	}
+
+	_stackHas = stackHas;
+	return _stackHas;
+}
+
+var _nativeCreate;
+var hasRequired_nativeCreate;
+
+function require_nativeCreate () {
+	if (hasRequired_nativeCreate) return _nativeCreate;
+	hasRequired_nativeCreate = 1;
+	var getNative = _getTag.require_getNative();
+
+	/* Built-in method references that are verified to be native. */
+	var nativeCreate = getNative(Object, 'create');
+
+	_nativeCreate = nativeCreate;
+	return _nativeCreate;
+}
+
+var _hashClear;
+var hasRequired_hashClear;
+
+function require_hashClear () {
+	if (hasRequired_hashClear) return _hashClear;
+	hasRequired_hashClear = 1;
+	var nativeCreate = require_nativeCreate();
+
+	/**
+	 * Removes all key-value entries from the hash.
+	 *
+	 * @private
+	 * @name clear
+	 * @memberOf Hash
+	 */
+	function hashClear() {
+	  this.__data__ = nativeCreate ? nativeCreate(null) : {};
+	  this.size = 0;
+	}
+
+	_hashClear = hashClear;
+	return _hashClear;
+}
+
+/**
+ * Removes `key` and its value from the hash.
+ *
+ * @private
+ * @name delete
+ * @memberOf Hash
+ * @param {Object} hash The hash to modify.
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+var _hashDelete;
+var hasRequired_hashDelete;
+
+function require_hashDelete () {
+	if (hasRequired_hashDelete) return _hashDelete;
+	hasRequired_hashDelete = 1;
+	function hashDelete(key) {
+	  var result = this.has(key) && delete this.__data__[key];
+	  this.size -= result ? 1 : 0;
+	  return result;
+	}
+
+	_hashDelete = hashDelete;
+	return _hashDelete;
+}
+
+var _hashGet;
+var hasRequired_hashGet;
+
+function require_hashGet () {
+	if (hasRequired_hashGet) return _hashGet;
+	hasRequired_hashGet = 1;
+	var nativeCreate = require_nativeCreate();
+
+	/** Used to stand-in for `undefined` hash values. */
+	var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+	/** Used for built-in method references. */
+	var objectProto = Object.prototype;
+
+	/** Used to check objects for own properties. */
+	var hasOwnProperty = objectProto.hasOwnProperty;
+
+	/**
+	 * Gets the hash value for `key`.
+	 *
+	 * @private
+	 * @name get
+	 * @memberOf Hash
+	 * @param {string} key The key of the value to get.
+	 * @returns {*} Returns the entry value.
+	 */
+	function hashGet(key) {
+	  var data = this.__data__;
+	  if (nativeCreate) {
+	    var result = data[key];
+	    return result === HASH_UNDEFINED ? undefined : result;
+	  }
+	  return hasOwnProperty.call(data, key) ? data[key] : undefined;
+	}
+
+	_hashGet = hashGet;
+	return _hashGet;
+}
+
+var _hashHas;
+var hasRequired_hashHas;
+
+function require_hashHas () {
+	if (hasRequired_hashHas) return _hashHas;
+	hasRequired_hashHas = 1;
+	var nativeCreate = require_nativeCreate();
+
+	/** Used for built-in method references. */
+	var objectProto = Object.prototype;
+
+	/** Used to check objects for own properties. */
+	var hasOwnProperty = objectProto.hasOwnProperty;
+
+	/**
+	 * Checks if a hash value for `key` exists.
+	 *
+	 * @private
+	 * @name has
+	 * @memberOf Hash
+	 * @param {string} key The key of the entry to check.
+	 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+	 */
+	function hashHas(key) {
+	  var data = this.__data__;
+	  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);
+	}
+
+	_hashHas = hashHas;
+	return _hashHas;
+}
+
+var _hashSet;
+var hasRequired_hashSet;
+
+function require_hashSet () {
+	if (hasRequired_hashSet) return _hashSet;
+	hasRequired_hashSet = 1;
+	var nativeCreate = require_nativeCreate();
+
+	/** Used to stand-in for `undefined` hash values. */
+	var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+	/**
+	 * Sets the hash `key` to `value`.
+	 *
+	 * @private
+	 * @name set
+	 * @memberOf Hash
+	 * @param {string} key The key of the value to set.
+	 * @param {*} value The value to set.
+	 * @returns {Object} Returns the hash instance.
+	 */
+	function hashSet(key, value) {
+	  var data = this.__data__;
+	  this.size += this.has(key) ? 0 : 1;
+	  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;
+	  return this;
+	}
+
+	_hashSet = hashSet;
+	return _hashSet;
+}
+
+var _Hash;
+var hasRequired_Hash;
+
+function require_Hash () {
+	if (hasRequired_Hash) return _Hash;
+	hasRequired_Hash = 1;
+	var hashClear = require_hashClear(),
+	    hashDelete = require_hashDelete(),
+	    hashGet = require_hashGet(),
+	    hashHas = require_hashHas(),
+	    hashSet = require_hashSet();
+
+	/**
+	 * Creates a hash object.
+	 *
+	 * @private
+	 * @constructor
+	 * @param {Array} [entries] The key-value pairs to cache.
+	 */
+	function Hash(entries) {
+	  var index = -1,
+	      length = entries == null ? 0 : entries.length;
+
+	  this.clear();
+	  while (++index < length) {
+	    var entry = entries[index];
+	    this.set(entry[0], entry[1]);
+	  }
+	}
+
+	// Add methods to `Hash`.
+	Hash.prototype.clear = hashClear;
+	Hash.prototype['delete'] = hashDelete;
+	Hash.prototype.get = hashGet;
+	Hash.prototype.has = hashHas;
+	Hash.prototype.set = hashSet;
+
+	_Hash = Hash;
+	return _Hash;
+}
+
+var _mapCacheClear;
+var hasRequired_mapCacheClear;
+
+function require_mapCacheClear () {
+	if (hasRequired_mapCacheClear) return _mapCacheClear;
+	hasRequired_mapCacheClear = 1;
+	var Hash = require_Hash(),
+	    ListCache = require_ListCache(),
+	    Map = _getTag.require_Map();
+
+	/**
+	 * Removes all key-value entries from the map.
+	 *
+	 * @private
+	 * @name clear
+	 * @memberOf MapCache
+	 */
+	function mapCacheClear() {
+	  this.size = 0;
+	  this.__data__ = {
+	    'hash': new Hash,
+	    'map': new (Map || ListCache),
+	    'string': new Hash
+	  };
+	}
+
+	_mapCacheClear = mapCacheClear;
+	return _mapCacheClear;
+}
+
+/**
+ * Checks if `value` is suitable for use as unique object key.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
+ */
+
+var _isKeyable;
+var hasRequired_isKeyable;
+
+function require_isKeyable () {
+	if (hasRequired_isKeyable) return _isKeyable;
+	hasRequired_isKeyable = 1;
+	function isKeyable(value) {
+	  var type = typeof value;
+	  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
+	    ? (value !== '__proto__')
+	    : (value === null);
+	}
+
+	_isKeyable = isKeyable;
+	return _isKeyable;
+}
+
+var _getMapData;
+var hasRequired_getMapData;
+
+function require_getMapData () {
+	if (hasRequired_getMapData) return _getMapData;
+	hasRequired_getMapData = 1;
+	var isKeyable = require_isKeyable();
+
+	/**
+	 * Gets the data for `map`.
+	 *
+	 * @private
+	 * @param {Object} map The map to query.
+	 * @param {string} key The reference key.
+	 * @returns {*} Returns the map data.
+	 */
+	function getMapData(map, key) {
+	  var data = map.__data__;
+	  return isKeyable(key)
+	    ? data[typeof key == 'string' ? 'string' : 'hash']
+	    : data.map;
+	}
+
+	_getMapData = getMapData;
+	return _getMapData;
+}
+
+var _mapCacheDelete;
+var hasRequired_mapCacheDelete;
+
+function require_mapCacheDelete () {
+	if (hasRequired_mapCacheDelete) return _mapCacheDelete;
+	hasRequired_mapCacheDelete = 1;
+	var getMapData = require_getMapData();
+
+	/**
+	 * Removes `key` and its value from the map.
+	 *
+	 * @private
+	 * @name delete
+	 * @memberOf MapCache
+	 * @param {string} key The key of the value to remove.
+	 * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+	 */
+	function mapCacheDelete(key) {
+	  var result = getMapData(this, key)['delete'](key);
+	  this.size -= result ? 1 : 0;
+	  return result;
+	}
+
+	_mapCacheDelete = mapCacheDelete;
+	return _mapCacheDelete;
+}
+
+var _mapCacheGet;
+var hasRequired_mapCacheGet;
+
+function require_mapCacheGet () {
+	if (hasRequired_mapCacheGet) return _mapCacheGet;
+	hasRequired_mapCacheGet = 1;
+	var getMapData = require_getMapData();
+
+	/**
+	 * Gets the map value for `key`.
+	 *
+	 * @private
+	 * @name get
+	 * @memberOf MapCache
+	 * @param {string} key The key of the value to get.
+	 * @returns {*} Returns the entry value.
+	 */
+	function mapCacheGet(key) {
+	  return getMapData(this, key).get(key);
+	}
+
+	_mapCacheGet = mapCacheGet;
+	return _mapCacheGet;
+}
+
+var _mapCacheHas;
+var hasRequired_mapCacheHas;
+
+function require_mapCacheHas () {
+	if (hasRequired_mapCacheHas) return _mapCacheHas;
+	hasRequired_mapCacheHas = 1;
+	var getMapData = require_getMapData();
+
+	/**
+	 * Checks if a map value for `key` exists.
+	 *
+	 * @private
+	 * @name has
+	 * @memberOf MapCache
+	 * @param {string} key The key of the entry to check.
+	 * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+	 */
+	function mapCacheHas(key) {
+	  return getMapData(this, key).has(key);
+	}
+
+	_mapCacheHas = mapCacheHas;
+	return _mapCacheHas;
+}
+
+var _mapCacheSet;
+var hasRequired_mapCacheSet;
+
+function require_mapCacheSet () {
+	if (hasRequired_mapCacheSet) return _mapCacheSet;
+	hasRequired_mapCacheSet = 1;
+	var getMapData = require_getMapData();
+
+	/**
+	 * Sets the map `key` to `value`.
+	 *
+	 * @private
+	 * @name set
+	 * @memberOf MapCache
+	 * @param {string} key The key of the value to set.
+	 * @param {*} value The value to set.
+	 * @returns {Object} Returns the map cache instance.
+	 */
+	function mapCacheSet(key, value) {
+	  var data = getMapData(this, key),
+	      size = data.size;
+
+	  data.set(key, value);
+	  this.size += data.size == size ? 0 : 1;
+	  return this;
+	}
+
+	_mapCacheSet = mapCacheSet;
+	return _mapCacheSet;
+}
+
+var _MapCache;
+var hasRequired_MapCache;
+
+function require_MapCache () {
+	if (hasRequired_MapCache) return _MapCache;
+	hasRequired_MapCache = 1;
+	var mapCacheClear = require_mapCacheClear(),
+	    mapCacheDelete = require_mapCacheDelete(),
+	    mapCacheGet = require_mapCacheGet(),
+	    mapCacheHas = require_mapCacheHas(),
+	    mapCacheSet = require_mapCacheSet();
+
+	/**
+	 * Creates a map cache object to store key-value pairs.
+	 *
+	 * @private
+	 * @constructor
+	 * @param {Array} [entries] The key-value pairs to cache.
+	 */
+	function MapCache(entries) {
+	  var index = -1,
+	      length = entries == null ? 0 : entries.length;
+
+	  this.clear();
+	  while (++index < length) {
+	    var entry = entries[index];
+	    this.set(entry[0], entry[1]);
+	  }
+	}
+
+	// Add methods to `MapCache`.
+	MapCache.prototype.clear = mapCacheClear;
+	MapCache.prototype['delete'] = mapCacheDelete;
+	MapCache.prototype.get = mapCacheGet;
+	MapCache.prototype.has = mapCacheHas;
+	MapCache.prototype.set = mapCacheSet;
+
+	_MapCache = MapCache;
+	return _MapCache;
+}
+
+var _stackSet;
+var hasRequired_stackSet;
+
+function require_stackSet () {
+	if (hasRequired_stackSet) return _stackSet;
+	hasRequired_stackSet = 1;
+	var ListCache = require_ListCache(),
+	    Map = _getTag.require_Map(),
+	    MapCache = require_MapCache();
+
+	/** Used as the size to enable large array optimizations. */
+	var LARGE_ARRAY_SIZE = 200;
+
+	/**
+	 * Sets the stack `key` to `value`.
+	 *
+	 * @private
+	 * @name set
+	 * @memberOf Stack
+	 * @param {string} key The key of the value to set.
+	 * @param {*} value The value to set.
+	 * @returns {Object} Returns the stack cache instance.
+	 */
+	function stackSet(key, value) {
+	  var data = this.__data__;
+	  if (data instanceof ListCache) {
+	    var pairs = data.__data__;
+	    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
+	      pairs.push([key, value]);
+	      this.size = ++data.size;
+	      return this;
+	    }
+	    data = this.__data__ = new MapCache(pairs);
+	  }
+	  data.set(key, value);
+	  this.size = data.size;
+	  return this;
+	}
+
+	_stackSet = stackSet;
+	return _stackSet;
+}
+
+var _Stack;
+var hasRequired_Stack;
+
+function require_Stack () {
+	if (hasRequired_Stack) return _Stack;
+	hasRequired_Stack = 1;
+	var ListCache = require_ListCache(),
+	    stackClear = require_stackClear(),
+	    stackDelete = require_stackDelete(),
+	    stackGet = require_stackGet(),
+	    stackHas = require_stackHas(),
+	    stackSet = require_stackSet();
+
+	/**
+	 * Creates a stack cache object to store key-value pairs.
+	 *
+	 * @private
+	 * @constructor
+	 * @param {Array} [entries] The key-value pairs to cache.
+	 */
+	function Stack(entries) {
+	  var data = this.__data__ = new ListCache(entries);
+	  this.size = data.size;
+	}
+
+	// Add methods to `Stack`.
+	Stack.prototype.clear = stackClear;
+	Stack.prototype['delete'] = stackDelete;
+	Stack.prototype.get = stackGet;
+	Stack.prototype.has = stackHas;
+	Stack.prototype.set = stackSet;
+
+	_Stack = Stack;
+	return _Stack;
+}
+
+/** Used to stand-in for `undefined` hash values. */
+
+var _setCacheAdd;
+var hasRequired_setCacheAdd;
+
+function require_setCacheAdd () {
+	if (hasRequired_setCacheAdd) return _setCacheAdd;
+	hasRequired_setCacheAdd = 1;
+	var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+	/**
+	 * Adds `value` to the array cache.
+	 *
+	 * @private
+	 * @name add
+	 * @memberOf SetCache
+	 * @alias push
+	 * @param {*} value The value to cache.
+	 * @returns {Object} Returns the cache instance.
+	 */
+	function setCacheAdd(value) {
+	  this.__data__.set(value, HASH_UNDEFINED);
+	  return this;
+	}
+
+	_setCacheAdd = setCacheAdd;
+	return _setCacheAdd;
+}
+
+/**
+ * Checks if `value` is in the array cache.
+ *
+ * @private
+ * @name has
+ * @memberOf SetCache
+ * @param {*} value The value to search for.
+ * @returns {boolean} Returns `true` if `value` is found, else `false`.
+ */
+
+var _setCacheHas;
+var hasRequired_setCacheHas;
+
+function require_setCacheHas () {
+	if (hasRequired_setCacheHas) return _setCacheHas;
+	hasRequired_setCacheHas = 1;
+	function setCacheHas(value) {
+	  return this.__data__.has(value);
+	}
+
+	_setCacheHas = setCacheHas;
+	return _setCacheHas;
+}
+
+var _SetCache;
+var hasRequired_SetCache;
+
+function require_SetCache () {
+	if (hasRequired_SetCache) return _SetCache;
+	hasRequired_SetCache = 1;
+	var MapCache = require_MapCache(),
+	    setCacheAdd = require_setCacheAdd(),
+	    setCacheHas = require_setCacheHas();
+
+	/**
+	 *
+	 * Creates an array cache object to store unique values.
+	 *
+	 * @private
+	 * @constructor
+	 * @param {Array} [values] The values to cache.
+	 */
+	function SetCache(values) {
+	  var index = -1,
+	      length = values == null ? 0 : values.length;
+
+	  this.__data__ = new MapCache;
+	  while (++index < length) {
+	    this.add(values[index]);
+	  }
+	}
+
+	// Add methods to `SetCache`.
+	SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+	SetCache.prototype.has = setCacheHas;
+
+	_SetCache = SetCache;
+	return _SetCache;
+}
+
+/**
+ * A specialized version of `_.some` for arrays without support for iteratee
+ * shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ *  else `false`.
+ */
+
+var _arraySome;
+var hasRequired_arraySome;
+
+function require_arraySome () {
+	if (hasRequired_arraySome) return _arraySome;
+	hasRequired_arraySome = 1;
+	function arraySome(array, predicate) {
+	  var index = -1,
+	      length = array == null ? 0 : array.length;
+
+	  while (++index < length) {
+	    if (predicate(array[index], index, array)) {
+	      return true;
+	    }
+	  }
+	  return false;
+	}
+
+	_arraySome = arraySome;
+	return _arraySome;
+}
+
+/**
+ * Checks if a `cache` value for `key` exists.
+ *
+ * @private
+ * @param {Object} cache The cache to query.
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+var _cacheHas;
+var hasRequired_cacheHas;
+
+function require_cacheHas () {
+	if (hasRequired_cacheHas) return _cacheHas;
+	hasRequired_cacheHas = 1;
+	function cacheHas(cache, key) {
+	  return cache.has(key);
+	}
+
+	_cacheHas = cacheHas;
+	return _cacheHas;
+}
+
+var _equalArrays;
+var hasRequired_equalArrays;
+
+function require_equalArrays () {
+	if (hasRequired_equalArrays) return _equalArrays;
+	hasRequired_equalArrays = 1;
+	var SetCache = require_SetCache(),
+	    arraySome = require_arraySome(),
+	    cacheHas = require_cacheHas();
+
+	/** Used to compose bitmasks for value comparisons. */
+	var COMPARE_PARTIAL_FLAG = 1,
+	    COMPARE_UNORDERED_FLAG = 2;
+
+	/**
+	 * A specialized version of `baseIsEqualDeep` for arrays with support for
+	 * partial deep comparisons.
+	 *
+	 * @private
+	 * @param {Array} array The array to compare.
+	 * @param {Array} other The other array to compare.
+	 * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+	 * @param {Function} customizer The function to customize comparisons.
+	 * @param {Function} equalFunc The function to determine equivalents of values.
+	 * @param {Object} stack Tracks traversed `array` and `other` objects.
+	 * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
+	 */
+	function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
+	  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
+	      arrLength = array.length,
+	      othLength = other.length;
+
+	  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
+	    return false;
+	  }
+	  // Check that cyclic values are equal.
+	  var arrStacked = stack.get(array);
+	  var othStacked = stack.get(other);
+	  if (arrStacked && othStacked) {
+	    return arrStacked == other && othStacked == array;
+	  }
+	  var index = -1,
+	      result = true,
+	      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;
+
+	  stack.set(array, other);
+	  stack.set(other, array);
+
+	  // Ignore non-index properties.
+	  while (++index < arrLength) {
+	    var arrValue = array[index],
+	        othValue = other[index];
+
+	    if (customizer) {
+	      var compared = isPartial
+	        ? customizer(othValue, arrValue, index, other, array, stack)
+	        : customizer(arrValue, othValue, index, array, other, stack);
+	    }
+	    if (compared !== undefined) {
+	      if (compared) {
+	        continue;
+	      }
+	      result = false;
+	      break;
+	    }
+	    // Recursively compare arrays (susceptible to call stack limits).
+	    if (seen) {
+	      if (!arraySome(other, function(othValue, othIndex) {
+	            if (!cacheHas(seen, othIndex) &&
+	                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+	              return seen.push(othIndex);
+	            }
+	          })) {
+	        result = false;
+	        break;
+	      }
+	    } else if (!(
+	          arrValue === othValue ||
+	            equalFunc(arrValue, othValue, bitmask, customizer, stack)
+	        )) {
+	      result = false;
+	      break;
+	    }
+	  }
+	  stack['delete'](array);
+	  stack['delete'](other);
+	  return result;
+	}
+
+	_equalArrays = equalArrays;
+	return _equalArrays;
+}
+
+var _Uint8Array;
+var hasRequired_Uint8Array;
+
+function require_Uint8Array () {
+	if (hasRequired_Uint8Array) return _Uint8Array;
+	hasRequired_Uint8Array = 1;
+	var root = isObjectLike.require_root();
+
+	/** Built-in value references. */
+	var Uint8Array = root.Uint8Array;
+
+	_Uint8Array = Uint8Array;
+	return _Uint8Array;
+}
+
+/**
+ * Converts `map` to its key-value pairs.
+ *
+ * @private
+ * @param {Object} map The map to convert.
+ * @returns {Array} Returns the key-value pairs.
+ */
+
+var _mapToArray;
+var hasRequired_mapToArray;
+
+function require_mapToArray () {
+	if (hasRequired_mapToArray) return _mapToArray;
+	hasRequired_mapToArray = 1;
+	function mapToArray(map) {
+	  var index = -1,
+	      result = Array(map.size);
+
+	  map.forEach(function(value, key) {
+	    result[++index] = [key, value];
+	  });
+	  return result;
+	}
+
+	_mapToArray = mapToArray;
+	return _mapToArray;
+}
+
+/**
+ * Converts `set` to an array of its values.
+ *
+ * @private
+ * @param {Object} set The set to convert.
+ * @returns {Array} Returns the values.
+ */
+
+var _setToArray;
+var hasRequired_setToArray;
+
+function require_setToArray () {
+	if (hasRequired_setToArray) return _setToArray;
+	hasRequired_setToArray = 1;
+	function setToArray(set) {
+	  var index = -1,
+	      result = Array(set.size);
+
+	  set.forEach(function(value) {
+	    result[++index] = value;
+	  });
+	  return result;
+	}
+
+	_setToArray = setToArray;
+	return _setToArray;
+}
+
+var _equalByTag;
+var hasRequired_equalByTag;
+
+function require_equalByTag () {
+	if (hasRequired_equalByTag) return _equalByTag;
+	hasRequired_equalByTag = 1;
+	var Symbol = isObjectLike.require_Symbol(),
+	    Uint8Array = require_Uint8Array(),
+	    eq = requireEq(),
+	    equalArrays = require_equalArrays(),
+	    mapToArray = require_mapToArray(),
+	    setToArray = require_setToArray();
+
+	/** Used to compose bitmasks for value comparisons. */
+	var COMPARE_PARTIAL_FLAG = 1,
+	    COMPARE_UNORDERED_FLAG = 2;
+
+	/** `Object#toString` result references. */
+	var boolTag = '[object Boolean]',
+	    dateTag = '[object Date]',
+	    errorTag = '[object Error]',
+	    mapTag = '[object Map]',
+	    numberTag = '[object Number]',
+	    regexpTag = '[object RegExp]',
+	    setTag = '[object Set]',
+	    stringTag = '[object String]',
+	    symbolTag = '[object Symbol]';
+
+	var arrayBufferTag = '[object ArrayBuffer]',
+	    dataViewTag = '[object DataView]';
+
+	/** Used to convert symbols to primitives and strings. */
+	var symbolProto = Symbol ? Symbol.prototype : undefined,
+	    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
+
+	/**
+	 * A specialized version of `baseIsEqualDeep` for comparing objects of
+	 * the same `toStringTag`.
+	 *
+	 * **Note:** This function only supports comparing values with tags of
+	 * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+	 *
+	 * @private
+	 * @param {Object} object The object to compare.
+	 * @param {Object} other The other object to compare.
+	 * @param {string} tag The `toStringTag` of the objects to compare.
+	 * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+	 * @param {Function} customizer The function to customize comparisons.
+	 * @param {Function} equalFunc The function to determine equivalents of values.
+	 * @param {Object} stack Tracks traversed `object` and `other` objects.
+	 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+	 */
+	function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
+	  switch (tag) {
+	    case dataViewTag:
+	      if ((object.byteLength != other.byteLength) ||
+	          (object.byteOffset != other.byteOffset)) {
+	        return false;
+	      }
+	      object = object.buffer;
+	      other = other.buffer;
+
+	    case arrayBufferTag:
+	      if ((object.byteLength != other.byteLength) ||
+	          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
+	        return false;
+	      }
+	      return true;
+
+	    case boolTag:
+	    case dateTag:
+	    case numberTag:
+	      // Coerce booleans to `1` or `0` and dates to milliseconds.
+	      // Invalid dates are coerced to `NaN`.
+	      return eq(+object, +other);
+
+	    case errorTag:
+	      return object.name == other.name && object.message == other.message;
+
+	    case regexpTag:
+	    case stringTag:
+	      // Coerce regexes to strings and treat strings, primitives and objects,
+	      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
+	      // for more details.
+	      return object == (other + '');
+
+	    case mapTag:
+	      var convert = mapToArray;
+
+	    case setTag:
+	      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;
+	      convert || (convert = setToArray);
+
+	      if (object.size != other.size && !isPartial) {
+	        return false;
+	      }
+	      // Assume cyclic values are equal.
+	      var stacked = stack.get(object);
+	      if (stacked) {
+	        return stacked == other;
+	      }
+	      bitmask |= COMPARE_UNORDERED_FLAG;
+
+	      // Recursively compare objects (susceptible to call stack limits).
+	      stack.set(object, other);
+	      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
+	      stack['delete'](object);
+	      return result;
+
+	    case symbolTag:
+	      if (symbolValueOf) {
+	        return symbolValueOf.call(object) == symbolValueOf.call(other);
+	      }
+	  }
+	  return false;
+	}
+
+	_equalByTag = equalByTag;
+	return _equalByTag;
+}
+
+/**
+ * Appends the elements of `values` to `array`.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {Array} values The values to append.
+ * @returns {Array} Returns `array`.
+ */
+
+var _arrayPush;
+var hasRequired_arrayPush;
+
+function require_arrayPush () {
+	if (hasRequired_arrayPush) return _arrayPush;
+	hasRequired_arrayPush = 1;
+	function arrayPush(array, values) {
+	  var index = -1,
+	      length = values.length,
+	      offset = array.length;
+
+	  while (++index < length) {
+	    array[offset + index] = values[index];
+	  }
+	  return array;
+	}
+
+	_arrayPush = arrayPush;
+	return _arrayPush;
+}
+
+var _baseGetAllKeys;
+var hasRequired_baseGetAllKeys;
+
+function require_baseGetAllKeys () {
+	if (hasRequired_baseGetAllKeys) return _baseGetAllKeys;
+	hasRequired_baseGetAllKeys = 1;
+	var arrayPush = require_arrayPush(),
+	    isArray = isObjectLike.requireIsArray();
+
+	/**
+	 * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
+	 * `keysFunc` and `symbolsFunc` to get the enumerable property names and
+	 * symbols of `object`.
+	 *
+	 * @private
+	 * @param {Object} object The object to query.
+	 * @param {Function} keysFunc The function to get the keys of `object`.
+	 * @param {Function} symbolsFunc The function to get the symbols of `object`.
+	 * @returns {Array} Returns the array of property names and symbols.
+	 */
+	function baseGetAllKeys(object, keysFunc, symbolsFunc) {
+	  var result = keysFunc(object);
+	  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
+	}
+
+	_baseGetAllKeys = baseGetAllKeys;
+	return _baseGetAllKeys;
+}
+
+/**
+ * A specialized version of `_.filter` for arrays without support for
+ * iteratee shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {Array} Returns the new filtered array.
+ */
+
+var _arrayFilter;
+var hasRequired_arrayFilter;
+
+function require_arrayFilter () {
+	if (hasRequired_arrayFilter) return _arrayFilter;
+	hasRequired_arrayFilter = 1;
+	function arrayFilter(array, predicate) {
+	  var index = -1,
+	      length = array == null ? 0 : array.length,
+	      resIndex = 0,
+	      result = [];
+
+	  while (++index < length) {
+	    var value = array[index];
+	    if (predicate(value, index, array)) {
+	      result[resIndex++] = value;
+	    }
+	  }
+	  return result;
+	}
+
+	_arrayFilter = arrayFilter;
+	return _arrayFilter;
+}
+
+/**
+ * This method returns a new empty array.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.13.0
+ * @category Util
+ * @returns {Array} Returns the new empty array.
+ * @example
+ *
+ * var arrays = _.times(2, _.stubArray);
+ *
+ * console.log(arrays);
+ * // => [[], []]
+ *
+ * console.log(arrays[0] === arrays[1]);
+ * // => false
+ */
+
+var stubArray_1;
+var hasRequiredStubArray;
+
+function requireStubArray () {
+	if (hasRequiredStubArray) return stubArray_1;
+	hasRequiredStubArray = 1;
+	function stubArray() {
+	  return [];
+	}
+
+	stubArray_1 = stubArray;
+	return stubArray_1;
+}
+
+var _getSymbols;
+var hasRequired_getSymbols;
+
+function require_getSymbols () {
+	if (hasRequired_getSymbols) return _getSymbols;
+	hasRequired_getSymbols = 1;
+	var arrayFilter = require_arrayFilter(),
+	    stubArray = requireStubArray();
+
+	/** Used for built-in method references. */
+	var objectProto = Object.prototype;
+
+	/** Built-in value references. */
+	var propertyIsEnumerable = objectProto.propertyIsEnumerable;
+
+	/* Built-in method references for those with the same name as other `lodash` methods. */
+	var nativeGetSymbols = Object.getOwnPropertySymbols;
+
+	/**
+	 * Creates an array of the own enumerable symbols of `object`.
+	 *
+	 * @private
+	 * @param {Object} object The object to query.
+	 * @returns {Array} Returns the array of symbols.
+	 */
+	var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
+	  if (object == null) {
+	    return [];
+	  }
+	  object = Object(object);
+	  return arrayFilter(nativeGetSymbols(object), function(symbol) {
+	    return propertyIsEnumerable.call(object, symbol);
+	  });
+	};
+
+	_getSymbols = getSymbols;
+	return _getSymbols;
+}
+
+/**
+ * The base implementation of `_.times` without support for iteratee shorthands
+ * or max array length checks.
+ *
+ * @private
+ * @param {number} n The number of times to invoke `iteratee`.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the array of results.
+ */
+
+var _baseTimes;
+var hasRequired_baseTimes;
+
+function require_baseTimes () {
+	if (hasRequired_baseTimes) return _baseTimes;
+	hasRequired_baseTimes = 1;
+	function baseTimes(n, iteratee) {
+	  var index = -1,
+	      result = Array(n);
+
+	  while (++index < n) {
+	    result[index] = iteratee(index);
+	  }
+	  return result;
+	}
+
+	_baseTimes = baseTimes;
+	return _baseTimes;
+}
+
+/** Used as references for various `Number` constants. */
+
+var _isIndex;
+var hasRequired_isIndex;
+
+function require_isIndex () {
+	if (hasRequired_isIndex) return _isIndex;
+	hasRequired_isIndex = 1;
+	var MAX_SAFE_INTEGER = 9007199254740991;
+
+	/** Used to detect unsigned integer values. */
+	var reIsUint = /^(?:0|[1-9]\d*)$/;
+
+	/**
+	 * Checks if `value` is a valid array-like index.
+	 *
+	 * @private
+	 * @param {*} value The value to check.
+	 * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
+	 * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
+	 */
+	function isIndex(value, length) {
+	  var type = typeof value;
+	  length = length == null ? MAX_SAFE_INTEGER : length;
+
+	  return !!length &&
+	    (type == 'number' ||
+	      (type != 'symbol' && reIsUint.test(value))) &&
+	        (value > -1 && value % 1 == 0 && value < length);
+	}
+
+	_isIndex = isIndex;
+	return _isIndex;
+}
+
+var _arrayLikeKeys;
+var hasRequired_arrayLikeKeys;
+
+function require_arrayLikeKeys () {
+	if (hasRequired_arrayLikeKeys) return _arrayLikeKeys;
+	hasRequired_arrayLikeKeys = 1;
+	var baseTimes = require_baseTimes(),
+	    isArguments = _getTag.requireIsArguments(),
+	    isArray = isObjectLike.requireIsArray(),
+	    isBuffer = _getTag.requireIsBuffer(),
+	    isIndex = require_isIndex(),
+	    isTypedArray = _getTag.requireIsTypedArray();
+
+	/** Used for built-in method references. */
+	var objectProto = Object.prototype;
+
+	/** Used to check objects for own properties. */
+	var hasOwnProperty = objectProto.hasOwnProperty;
+
+	/**
+	 * Creates an array of the enumerable property names of the array-like `value`.
+	 *
+	 * @private
+	 * @param {*} value The value to query.
+	 * @param {boolean} inherited Specify returning inherited property names.
+	 * @returns {Array} Returns the array of property names.
+	 */
+	function arrayLikeKeys(value, inherited) {
+	  var isArr = isArray(value),
+	      isArg = !isArr && isArguments(value),
+	      isBuff = !isArr && !isArg && isBuffer(value),
+	      isType = !isArr && !isArg && !isBuff && isTypedArray(value),
+	      skipIndexes = isArr || isArg || isBuff || isType,
+	      result = skipIndexes ? baseTimes(value.length, String) : [],
+	      length = result.length;
+
+	  for (var key in value) {
+	    if ((inherited || hasOwnProperty.call(value, key)) &&
+	        !(skipIndexes && (
+	           // Safari 9 has enumerable `arguments.length` in strict mode.
+	           key == 'length' ||
+	           // Node.js 0.10 has enumerable non-index properties on buffers.
+	           (isBuff && (key == 'offset' || key == 'parent')) ||
+	           // PhantomJS 2 has enumerable non-index properties on typed arrays.
+	           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
+	           // Skip index properties.
+	           isIndex(key, length)
+	        ))) {
+	      result.push(key);
+	    }
+	  }
+	  return result;
+	}
+
+	_arrayLikeKeys = arrayLikeKeys;
+	return _arrayLikeKeys;
+}
+
+var keys_1;
+var hasRequiredKeys;
+
+function requireKeys () {
+	if (hasRequiredKeys) return keys_1;
+	hasRequiredKeys = 1;
+	var arrayLikeKeys = require_arrayLikeKeys(),
+	    baseKeys = _getTag.require_baseKeys(),
+	    isArrayLike = _getTag.requireIsArrayLike();
+
+	/**
+	 * Creates an array of the own enumerable property names of `object`.
+	 *
+	 * **Note:** Non-object values are coerced to objects. See the
+	 * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+	 * for more details.
+	 *
+	 * @static
+	 * @since 0.1.0
+	 * @memberOf _
+	 * @category Object
+	 * @param {Object} object The object to query.
+	 * @returns {Array} Returns the array of property names.
+	 * @example
+	 *
+	 * function Foo() {
+	 *   this.a = 1;
+	 *   this.b = 2;
+	 * }
+	 *
+	 * Foo.prototype.c = 3;
+	 *
+	 * _.keys(new Foo);
+	 * // => ['a', 'b'] (iteration order is not guaranteed)
+	 *
+	 * _.keys('hi');
+	 * // => ['0', '1']
+	 */
+	function keys(object) {
+	  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
+	}
+
+	keys_1 = keys;
+	return keys_1;
+}
+
+var _getAllKeys;
+var hasRequired_getAllKeys;
+
+function require_getAllKeys () {
+	if (hasRequired_getAllKeys) return _getAllKeys;
+	hasRequired_getAllKeys = 1;
+	var baseGetAllKeys = require_baseGetAllKeys(),
+	    getSymbols = require_getSymbols(),
+	    keys = requireKeys();
+
+	/**
+	 * Creates an array of own enumerable property names and symbols of `object`.
+	 *
+	 * @private
+	 * @param {Object} object The object to query.
+	 * @returns {Array} Returns the array of property names and symbols.
+	 */
+	function getAllKeys(object) {
+	  return baseGetAllKeys(object, keys, getSymbols);
+	}
+
+	_getAllKeys = getAllKeys;
+	return _getAllKeys;
+}
+
+var _equalObjects;
+var hasRequired_equalObjects;
+
+function require_equalObjects () {
+	if (hasRequired_equalObjects) return _equalObjects;
+	hasRequired_equalObjects = 1;
+	var getAllKeys = require_getAllKeys();
+
+	/** Used to compose bitmasks for value comparisons. */
+	var COMPARE_PARTIAL_FLAG = 1;
+
+	/** Used for built-in method references. */
+	var objectProto = Object.prototype;
+
+	/** Used to check objects for own properties. */
+	var hasOwnProperty = objectProto.hasOwnProperty;
+
+	/**
+	 * A specialized version of `baseIsEqualDeep` for objects with support for
+	 * partial deep comparisons.
+	 *
+	 * @private
+	 * @param {Object} object The object to compare.
+	 * @param {Object} other The other object to compare.
+	 * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+	 * @param {Function} customizer The function to customize comparisons.
+	 * @param {Function} equalFunc The function to determine equivalents of values.
+	 * @param {Object} stack Tracks traversed `object` and `other` objects.
+	 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+	 */
+	function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
+	  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
+	      objProps = getAllKeys(object),
+	      objLength = objProps.length,
+	      othProps = getAllKeys(other),
+	      othLength = othProps.length;
+
+	  if (objLength != othLength && !isPartial) {
+	    return false;
+	  }
+	  var index = objLength;
+	  while (index--) {
+	    var key = objProps[index];
+	    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {
+	      return false;
+	    }
+	  }
+	  // Check that cyclic values are equal.
+	  var objStacked = stack.get(object);
+	  var othStacked = stack.get(other);
+	  if (objStacked && othStacked) {
+	    return objStacked == other && othStacked == object;
+	  }
+	  var result = true;
+	  stack.set(object, other);
+	  stack.set(other, object);
+
+	  var skipCtor = isPartial;
+	  while (++index < objLength) {
+	    key = objProps[index];
+	    var objValue = object[key],
+	        othValue = other[key];
+
+	    if (customizer) {
+	      var compared = isPartial
+	        ? customizer(othValue, objValue, key, other, object, stack)
+	        : customizer(objValue, othValue, key, object, other, stack);
+	    }
+	    // Recursively compare objects (susceptible to call stack limits).
+	    if (!(compared === undefined
+	          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))
+	          : compared
+	        )) {
+	      result = false;
+	      break;
+	    }
+	    skipCtor || (skipCtor = key == 'constructor');
+	  }
+	  if (result && !skipCtor) {
+	    var objCtor = object.constructor,
+	        othCtor = other.constructor;
+
+	    // Non `Object` object instances with different constructors are not equal.
+	    if (objCtor != othCtor &&
+	        ('constructor' in object && 'constructor' in other) &&
+	        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
+	          typeof othCtor == 'function' && othCtor instanceof othCtor)) {
+	      result = false;
+	    }
+	  }
+	  stack['delete'](object);
+	  stack['delete'](other);
+	  return result;
+	}
+
+	_equalObjects = equalObjects;
+	return _equalObjects;
+}
+
+var _baseIsEqualDeep;
+var hasRequired_baseIsEqualDeep;
+
+function require_baseIsEqualDeep () {
+	if (hasRequired_baseIsEqualDeep) return _baseIsEqualDeep;
+	hasRequired_baseIsEqualDeep = 1;
+	var Stack = require_Stack(),
+	    equalArrays = require_equalArrays(),
+	    equalByTag = require_equalByTag(),
+	    equalObjects = require_equalObjects(),
+	    getTag = _getTag.require_getTag(),
+	    isArray = isObjectLike.requireIsArray(),
+	    isBuffer = _getTag.requireIsBuffer(),
+	    isTypedArray = _getTag.requireIsTypedArray();
+
+	/** Used to compose bitmasks for value comparisons. */
+	var COMPARE_PARTIAL_FLAG = 1;
+
+	/** `Object#toString` result references. */
+	var argsTag = '[object Arguments]',
+	    arrayTag = '[object Array]',
+	    objectTag = '[object Object]';
+
+	/** Used for built-in method references. */
+	var objectProto = Object.prototype;
+
+	/** Used to check objects for own properties. */
+	var hasOwnProperty = objectProto.hasOwnProperty;
+
+	/**
+	 * A specialized version of `baseIsEqual` for arrays and objects which performs
+	 * deep comparisons and tracks traversed objects enabling objects with circular
+	 * references to be compared.
+	 *
+	 * @private
+	 * @param {Object} object The object to compare.
+	 * @param {Object} other The other object to compare.
+	 * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+	 * @param {Function} customizer The function to customize comparisons.
+	 * @param {Function} equalFunc The function to determine equivalents of values.
+	 * @param {Object} [stack] Tracks traversed `object` and `other` objects.
+	 * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+	 */
+	function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
+	  var objIsArr = isArray(object),
+	      othIsArr = isArray(other),
+	      objTag = objIsArr ? arrayTag : getTag(object),
+	      othTag = othIsArr ? arrayTag : getTag(other);
+
+	  objTag = objTag == argsTag ? objectTag : objTag;
+	  othTag = othTag == argsTag ? objectTag : othTag;
+
+	  var objIsObj = objTag == objectTag,
+	      othIsObj = othTag == objectTag,
+	      isSameTag = objTag == othTag;
+
+	  if (isSameTag && isBuffer(object)) {
+	    if (!isBuffer(other)) {
+	      return false;
+	    }
+	    objIsArr = true;
+	    objIsObj = false;
+	  }
+	  if (isSameTag && !objIsObj) {
+	    stack || (stack = new Stack);
+	    return (objIsArr || isTypedArray(object))
+	      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
+	      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
+	  }
+	  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
+	    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+	        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
+
+	    if (objIsWrapped || othIsWrapped) {
+	      var objUnwrapped = objIsWrapped ? object.value() : object,
+	          othUnwrapped = othIsWrapped ? other.value() : other;
+
+	      stack || (stack = new Stack);
+	      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
+	    }
+	  }
+	  if (!isSameTag) {
+	    return false;
+	  }
+	  stack || (stack = new Stack);
+	  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
+	}
+
+	_baseIsEqualDeep = baseIsEqualDeep;
+	return _baseIsEqualDeep;
+}
+
+var _baseIsEqual;
+var hasRequired_baseIsEqual;
+
+function require_baseIsEqual () {
+	if (hasRequired_baseIsEqual) return _baseIsEqual;
+	hasRequired_baseIsEqual = 1;
+	var baseIsEqualDeep = require_baseIsEqualDeep(),
+	    isObjectLike$1 = isObjectLike.requireIsObjectLike();
+
+	/**
+	 * The base implementation of `_.isEqual` which supports partial comparisons
+	 * and tracks traversed objects.
+	 *
+	 * @private
+	 * @param {*} value The value to compare.
+	 * @param {*} other The other value to compare.
+	 * @param {boolean} bitmask The bitmask flags.
+	 *  1 - Unordered comparison
+	 *  2 - Partial comparison
+	 * @param {Function} [customizer] The function to customize comparisons.
+	 * @param {Object} [stack] Tracks traversed `value` and `other` objects.
+	 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+	 */
+	function baseIsEqual(value, other, bitmask, customizer, stack) {
+	  if (value === other) {
+	    return true;
+	  }
+	  if (value == null || other == null || (!isObjectLike$1(value) && !isObjectLike$1(other))) {
+	    return value !== value && other !== other;
+	  }
+	  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+	}
+
+	_baseIsEqual = baseIsEqual;
+	return _baseIsEqual;
+}
+
+var isEqual_1;
+var hasRequiredIsEqual;
+
+function requireIsEqual () {
+	if (hasRequiredIsEqual) return isEqual_1;
+	hasRequiredIsEqual = 1;
+	var baseIsEqual = require_baseIsEqual();
+
+	/**
+	 * Performs a deep comparison between two values to determine if they are
+	 * equivalent.
+	 *
+	 * **Note:** This method supports comparing arrays, array buffers, booleans,
+	 * date objects, error objects, maps, numbers, `Object` objects, regexes,
+	 * sets, strings, symbols, and typed arrays. `Object` objects are compared
+	 * by their own, not inherited, enumerable properties. Functions and DOM
+	 * nodes are compared by strict equality, i.e. `===`.
+	 *
+	 * @static
+	 * @memberOf _
+	 * @since 0.1.0
+	 * @category Lang
+	 * @param {*} value The value to compare.
+	 * @param {*} other The other value to compare.
+	 * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+	 * @example
+	 *
+	 * var object = { 'a': 1 };
+	 * var other = { 'a': 1 };
+	 *
+	 * _.isEqual(object, other);
+	 * // => true
+	 *
+	 * object === other;
+	 * // => false
+	 */
+	function isEqual(value, other) {
+	  return baseIsEqual(value, other);
+	}
+
+	isEqual_1 = isEqual;
+	return isEqual_1;
+}
+
+var isEqualExports = requireIsEqual();
+var isEqual = /*@__PURE__*/_commonjsHelpers.getDefaultExportFromCjs(isEqualExports);
+
+/**
+ * Returns `true` if the arrays are equal
+ *
+ * ```typescript
+ * areArraysEqual(['a', 'b'], ['b', 'a']) // true
+ * ```
+ */
+function areArraysEqual(a, b) {
+    if (isNil.isNil(a) || isNil.isNil(b)) {
+        return false;
+    }
+    const copyA = [...a].sort();
+    const copyB = [...b].sort();
+    return isEqual(copyA, copyB);
+}
+
+exports.areArraysEqual = areArraysEqual;