{"remainingRequest":"/data/node_modules/babel-loader/lib/index.js!/data/node_modules/lodash.merge/index.js","dependencies":[{"path":"/data/node_modules/lodash.merge/index.js","mtime":1553611386696},{"path":"/data/.babelrc","mtime":1553611371556},{"path":"/data/node_modules/cache-loader/dist/cjs.js","mtime":1553611387012},{"path":"/data/node_modules/babel-loader/lib/index.js","mtime":1553611386992}],"contextDependencies":[],"result":["'use strict';\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n/**\n * Lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright JS Foundation and other contributors <https://js.foundation/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    asyncTag = '[object AsyncFunction]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    nullTag = '[object Null]',\n    objectTag = '[object Object]',\n    proxyTag = '[object Proxy]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    undefinedTag = '[object Undefined]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] = typedArrayTags[int8Tag] = typedArrayTags[int16Tag] = typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] = typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] = typedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] = typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] = typedArrayTags[dataViewTag] = typedArrayTags[dateTag] = typedArrayTags[errorTag] = typedArrayTags[funcTag] = typedArrayTags[mapTag] = typedArrayTags[numberTag] = typedArrayTags[objectTag] = typedArrayTags[regexpTag] = typedArrayTags[setTag] = typedArrayTags[stringTag] = typedArrayTags[weakMapTag] = false;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = (typeof global === 'undefined' ? 'undefined' : _typeof(global)) == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = (typeof self === 'undefined' ? 'undefined' : _typeof(self)) == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Detect free variable `exports`. */\nvar freeExports = (typeof exports === 'undefined' ? 'undefined' : _typeof(exports)) == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && (typeof module === 'undefined' ? 'undefined' : _typeof(module)) == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = function () {\n  try {\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}();\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0:\n      return func.call(thisArg);\n    case 1:\n      return func.call(thisArg, args[0]);\n    case 2:\n      return func.call(thisArg, args[0], args[1]);\n    case 3:\n      return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function (value) {\n    return func(value);\n  };\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function (arg) {\n    return func(transform(arg));\n  };\n}\n\n/**\n * Gets the value at `key`, unless `key` is \"__proto__\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction safeGet(object, key) {\n  return key == '__proto__' ? undefined : object[key];\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n    funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = function () {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? 'Symbol(src)_1.' + uid : '';\n}();\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' + funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&').replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$');\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    _Symbol = root.Symbol,\n    Uint8Array = root.Uint8Array,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n    getPrototype = overArg(Object.getPrototypeOf, Object),\n    objectCreate = Object.create,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    splice = arrayProto.splice,\n    symToStringTag = _Symbol ? _Symbol.toStringTag : undefined;\n\nvar defineProperty = function () {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}();\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n    nativeMax = Math.max,\n    nativeNow = Date.now;\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map'),\n    nativeCreate = getNative(Object, 'create');\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = function () {\n  function object() {}\n  return function (proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object();\n    object.prototype = undefined;\n    return result;\n  };\n}();\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = nativeCreate && value === undefined ? HASH_UNDEFINED : value;\n  return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash(),\n    'map': new (Map || ListCache)(),\n    'string': new Hash()\n  };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache();\n  this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\n/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\n/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || pairs.length < LARGE_ARRAY_SIZE - 1) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) && !(skipIndexes && (\n    // Safari 9 has enumerable `arguments.length` in strict mode.\n    key == 'length' ||\n    // Node.js 0.10 has enumerable non-index properties on buffers.\n    isBuff && (key == 'offset' || key == 'parent') ||\n    // PhantomJS 2 has enumerable non-index properties on typed arrays.\n    isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset') ||\n    // Skip index properties.\n    isIndex(key, length)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n  if (value !== undefined && !eq(object[key], value) || value === undefined && !(key in object)) {\n    baseAssignValue(object, key, value);\n  }\n}\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) || value === undefined && !(key in object)) {\n    baseAssignValue(object, key, value);\n  }\n}\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return symToStringTag && symToStringTag in Object(value) ? getRawTag(value) : objectToString(value);\n}\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) && isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n  if (object === source) {\n    return;\n  }\n  baseFor(source, function (srcValue, key) {\n    if (isObject(srcValue)) {\n      stack || (stack = new Stack());\n      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n    } else {\n      var newValue = customizer ? customizer(safeGet(object, key), srcValue, key + '', object, source, stack) : undefined;\n\n      if (newValue === undefined) {\n        newValue = srcValue;\n      }\n      assignMergeValue(object, key, newValue);\n    }\n  }, keysIn);\n}\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n  var objValue = safeGet(object, key),\n      srcValue = safeGet(source, key),\n      stacked = stack.get(srcValue);\n\n  if (stacked) {\n    assignMergeValue(object, key, stacked);\n    return;\n  }\n  var newValue = customizer ? customizer(objValue, srcValue, key + '', object, source, stack) : undefined;\n\n  var isCommon = newValue === undefined;\n\n  if (isCommon) {\n    var isArr = isArray(srcValue),\n        isBuff = !isArr && isBuffer(srcValue),\n        isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n    newValue = srcValue;\n    if (isArr || isBuff || isTyped) {\n      if (isArray(objValue)) {\n        newValue = objValue;\n      } else if (isArrayLikeObject(objValue)) {\n        newValue = copyArray(objValue);\n      } else if (isBuff) {\n        isCommon = false;\n        newValue = cloneBuffer(srcValue, true);\n      } else if (isTyped) {\n        isCommon = false;\n        newValue = cloneTypedArray(srcValue, true);\n      } else {\n        newValue = [];\n      }\n    } else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n      newValue = objValue;\n      if (isArguments(objValue)) {\n        newValue = toPlainObject(objValue);\n      } else if (!isObject(objValue) || srcIndex && isFunction(objValue)) {\n        newValue = initCloneObject(srcValue);\n      }\n    } else {\n      isCommon = false;\n    }\n  }\n  if (isCommon) {\n    // Recursively merge objects and arrays (susceptible to call stack limits).\n    stack.set(srcValue, newValue);\n    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n    stack['delete'](srcValue);\n  }\n  assignMergeValue(object, key, newValue);\n}\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function (func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer ? customizer(object[key], source[key], key, object, source) : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function (object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = assigner.length > 3 && typeof customizer == 'function' ? (length--, customizer) : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\n/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function (object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key) ? data[typeof key == 'string' ? 'string' : 'hash'] : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return typeof object.constructor == 'function' && !isPrototype(object) ? baseCreate(getPrototype(object)) : {};\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value === 'undefined' ? 'undefined' : _typeof(value);\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length && (type == 'number' || type != 'symbol' && reIsUint.test(value)) && value > -1 && value % 1 == 0 && value < length;\n}\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index === 'undefined' ? 'undefined' : _typeof(index);\n  if (type == 'number' ? isArrayLike(object) && isIndex(index, object.length) : type == 'string' && index in object) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value === 'undefined' ? 'undefined' : _typeof(value);\n  return type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean' ? value !== '__proto__' : value === null;\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && maskSrcKey in func;\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = typeof Ctor == 'function' && Ctor.prototype || objectProto;\n\n  return value === proto;\n}\n\n/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? func.length - 1 : start, 0);\n  return function () {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function () {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return func + '';\n    } catch (e) {}\n  }\n  return '';\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || value !== value && other !== other;\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function () {\n  return arguments;\n}()) ? baseIsArguments : function (value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee');\n};\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value === 'undefined' ? 'undefined' : _typeof(value);\n  return value != null && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && (typeof value === 'undefined' ? 'undefined' : _typeof(value)) == 'object';\n}\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString;\n}\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\n/**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n *   'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n *   'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\nvar merge = createAssigner(function (object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\n/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function () {\n    return value;\n  };\n}\n\n/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = merge;",{"version":3,"sources":["node_modules/lodash.merge/index.js"],"names":["LARGE_ARRAY_SIZE","HASH_UNDEFINED","HOT_COUNT","HOT_SPAN","MAX_SAFE_INTEGER","argsTag","arrayTag","asyncTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","nullTag","objectTag","proxyTag","regexpTag","setTag","stringTag","undefinedTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reRegExpChar","reIsHostCtor","reIsUint","typedArrayTags","freeGlobal","global","Object","freeSelf","self","root","Function","freeExports","exports","nodeType","freeModule","module","moduleExports","freeProcess","process","nodeUtil","binding","e","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","length","call","baseTimes","n","iteratee","index","result","Array","baseUnary","value","getValue","object","key","undefined","overArg","transform","arg","safeGet","arrayProto","prototype","funcProto","objectProto","coreJsData","funcToString","toString","hasOwnProperty","maskSrcKey","uid","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","reIsNative","RegExp","replace","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","splice","symToStringTag","toStringTag","defineProperty","getNative","nativeIsBuffer","isBuffer","nativeMax","Math","max","nativeNow","Date","now","Map","nativeCreate","baseCreate","proto","isObject","Hash","entries","clear","entry","set","hashClear","__data__","size","hashDelete","has","hashGet","data","hashHas","hashSet","get","ListCache","listCacheClear","listCacheDelete","assocIndexOf","lastIndex","pop","listCacheGet","listCacheHas","listCacheSet","push","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","Stack","stackClear","stackDelete","stackGet","stackHas","stackSet","pairs","arrayLikeKeys","inherited","isArr","isArray","isArg","isArguments","isBuff","isType","skipIndexes","String","isIndex","assignMergeValue","eq","baseAssignValue","assignValue","objValue","array","baseFor","createBaseFor","baseGetTag","getRawTag","objectToString","baseIsArguments","isObjectLike","baseIsNative","isMasked","pattern","isFunction","test","toSource","baseIsTypedArray","isLength","baseKeysIn","nativeKeysIn","isProto","isPrototype","baseMerge","source","srcIndex","customizer","stack","srcValue","baseMergeDeep","newValue","keysIn","mergeFunc","stacked","isCommon","isTyped","isArrayLikeObject","copyArray","cloneBuffer","cloneTypedArray","isPlainObject","toPlainObject","initCloneObject","baseRest","start","setToString","overRest","identity","baseSetToString","string","constant","buffer","isDeep","slice","constructor","copy","cloneArrayBuffer","arrayBuffer","byteLength","typedArray","byteOffset","copyObject","props","isNew","createAssigner","assigner","sources","guard","isIterateeCall","fromRight","keysFunc","iterable","map","isKeyable","isOwn","tag","unmasked","type","isArrayLike","Ctor","arguments","otherArgs","shortOut","count","lastCalled","stamp","remaining","other","stubFalse","merge"],"mappings":";;;;AAAA;;;;;;;;;AASA;AACA,IAAIA,mBAAmB,GAAvB;;AAEA;AACA,IAAIC,iBAAiB,2BAArB;;AAEA;AACA,IAAIC,YAAY,GAAhB;AAAA,IACIC,WAAW,EADf;;AAGA;AACA,IAAIC,mBAAmB,gBAAvB;;AAEA;AACA,IAAIC,UAAU,oBAAd;AAAA,IACIC,WAAW,gBADf;AAAA,IAEIC,WAAW,wBAFf;AAAA,IAGIC,UAAU,kBAHd;AAAA,IAIIC,UAAU,eAJd;AAAA,IAKIC,WAAW,gBALf;AAAA,IAMIC,UAAU,mBANd;AAAA,IAOIC,SAAS,4BAPb;AAAA,IAQIC,SAAS,cARb;AAAA,IASIC,YAAY,iBAThB;AAAA,IAUIC,UAAU,eAVd;AAAA,IAWIC,YAAY,iBAXhB;AAAA,IAYIC,WAAW,gBAZf;AAAA,IAaIC,YAAY,iBAbhB;AAAA,IAcIC,SAAS,cAdb;AAAA,IAeIC,YAAY,iBAfhB;AAAA,IAgBIC,eAAe,oBAhBnB;AAAA,IAiBIC,aAAa,kBAjBjB;;AAmBA,IAAIC,iBAAiB,sBAArB;AAAA,IACIC,cAAc,mBADlB;AAAA,IAEIC,aAAa,uBAFjB;AAAA,IAGIC,aAAa,uBAHjB;AAAA,IAIIC,UAAU,oBAJd;AAAA,IAKIC,WAAW,qBALf;AAAA,IAMIC,WAAW,qBANf;AAAA,IAOIC,WAAW,qBAPf;AAAA,IAQIC,kBAAkB,4BARtB;AAAA,IASIC,YAAY,sBAThB;AAAA,IAUIC,YAAY,sBAVhB;;AAYA;;;;AAIA,IAAIC,eAAe,qBAAnB;;AAEA;AACA,IAAIC,eAAe,6BAAnB;;AAEA;AACA,IAAIC,WAAW,kBAAf;;AAEA;AACA,IAAIC,iBAAiB,EAArB;AACAA,eAAeZ,UAAf,IAA6BY,eAAeX,UAAf,IAC7BW,eAAeV,OAAf,IAA0BU,eAAeT,QAAf,IAC1BS,eAAeR,QAAf,IAA2BQ,eAAeP,QAAf,IAC3BO,eAAeN,eAAf,IAAkCM,eAAeL,SAAf,IAClCK,eAAeJ,SAAf,IAA4B,IAJ5B;AAKAI,eAAehC,OAAf,IAA0BgC,eAAe/B,QAAf,IAC1B+B,eAAed,cAAf,IAAiCc,eAAe7B,OAAf,IACjC6B,eAAeb,WAAf,IAA8Ba,eAAe5B,OAAf,IAC9B4B,eAAe3B,QAAf,IAA2B2B,eAAe1B,OAAf,IAC3B0B,eAAexB,MAAf,IAAyBwB,eAAevB,SAAf,IACzBuB,eAAerB,SAAf,IAA4BqB,eAAenB,SAAf,IAC5BmB,eAAelB,MAAf,IAAyBkB,eAAejB,SAAf,IACzBiB,eAAef,UAAf,IAA6B,KAP7B;;AASA;AACA,IAAIgB,aAAa,QAAOC,MAAP,yCAAOA,MAAP,MAAiB,QAAjB,IAA6BA,MAA7B,IAAuCA,OAAOC,MAAP,KAAkBA,MAAzD,IAAmED,MAApF;;AAEA;AACA,IAAIE,WAAW,QAAOC,IAAP,yCAAOA,IAAP,MAAe,QAAf,IAA2BA,IAA3B,IAAmCA,KAAKF,MAAL,KAAgBA,MAAnD,IAA6DE,IAA5E;;AAEA;AACA,IAAIC,OAAOL,cAAcG,QAAd,IAA0BG,SAAS,aAAT,GAArC;;AAEA;AACA,IAAIC,cAAc,QAAOC,OAAP,yCAAOA,OAAP,MAAkB,QAAlB,IAA8BA,OAA9B,IAAyC,CAACA,QAAQC,QAAlD,IAA8DD,OAAhF;;AAEA;AACA,IAAIE,aAAaH,eAAe,QAAOI,MAAP,yCAAOA,MAAP,MAAiB,QAAhC,IAA4CA,MAA5C,IAAsD,CAACA,OAAOF,QAA9D,IAA0EE,MAA3F;;AAEA;AACA,IAAIC,gBAAgBF,cAAcA,WAAWF,OAAX,KAAuBD,WAAzD;;AAEA;AACA,IAAIM,cAAcD,iBAAiBZ,WAAWc,OAA9C;;AAEA;AACA,IAAIC,WAAY,YAAW;AACzB,MAAI;AACF,WAAOF,eAAeA,YAAYG,OAA3B,IAAsCH,YAAYG,OAAZ,CAAoB,MAApB,CAA7C;AACD,GAFD,CAEE,OAAOC,CAAP,EAAU,CAAE;AACf,CAJe,EAAhB;;AAMA;AACA,IAAIC,mBAAmBH,YAAYA,SAASI,YAA5C;;AAEA;;;;;;;;;;AAUA,SAASC,KAAT,CAAeC,IAAf,EAAqBC,OAArB,EAA8BC,IAA9B,EAAoC;AAClC,UAAQA,KAAKC,MAAb;AACE,SAAK,CAAL;AAAQ,aAAOH,KAAKI,IAAL,CAAUH,OAAV,CAAP;AACR,SAAK,CAAL;AAAQ,aAAOD,KAAKI,IAAL,CAAUH,OAAV,EAAmBC,KAAK,CAAL,CAAnB,CAAP;AACR,SAAK,CAAL;AAAQ,aAAOF,KAAKI,IAAL,CAAUH,OAAV,EAAmBC,KAAK,CAAL,CAAnB,EAA4BA,KAAK,CAAL,CAA5B,CAAP;AACR,SAAK,CAAL;AAAQ,aAAOF,KAAKI,IAAL,CAAUH,OAAV,EAAmBC,KAAK,CAAL,CAAnB,EAA4BA,KAAK,CAAL,CAA5B,EAAqCA,KAAK,CAAL,CAArC,CAAP;AAJV;AAMA,SAAOF,KAAKD,KAAL,CAAWE,OAAX,EAAoBC,IAApB,CAAP;AACD;;AAED;;;;;;;;;AASA,SAASG,SAAT,CAAmBC,CAAnB,EAAsBC,QAAtB,EAAgC;AAC9B,MAAIC,QAAQ,CAAC,CAAb;AAAA,MACIC,SAASC,MAAMJ,CAAN,CADb;;AAGA,SAAO,EAAEE,KAAF,GAAUF,CAAjB,EAAoB;AAClBG,WAAOD,KAAP,IAAgBD,SAASC,KAAT,CAAhB;AACD;AACD,SAAOC,MAAP;AACD;;AAED;;;;;;;AAOA,SAASE,SAAT,CAAmBX,IAAnB,EAAyB;AACvB,SAAO,UAASY,KAAT,EAAgB;AACrB,WAAOZ,KAAKY,KAAL,CAAP;AACD,GAFD;AAGD;;AAED;;;;;;;;AAQA,SAASC,QAAT,CAAkBC,MAAlB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOD,UAAU,IAAV,GAAiBE,SAAjB,GAA6BF,OAAOC,GAAP,CAApC;AACD;;AAED;;;;;;;;AAQA,SAASE,OAAT,CAAiBjB,IAAjB,EAAuBkB,SAAvB,EAAkC;AAChC,SAAO,UAASC,GAAT,EAAc;AACnB,WAAOnB,KAAKkB,UAAUC,GAAV,CAAL,CAAP;AACD,GAFD;AAGD;;AAED;;;;;;;;AAQA,SAASC,OAAT,CAAiBN,MAAjB,EAAyBC,GAAzB,EAA8B;AAC5B,SAAOA,OAAO,WAAP,GACHC,SADG,GAEHF,OAAOC,GAAP,CAFJ;AAGD;;AAED;AACA,IAAIM,aAAaX,MAAMY,SAAvB;AAAA,IACIC,YAAYtC,SAASqC,SADzB;AAAA,IAEIE,cAAc3C,OAAOyC,SAFzB;;AAIA;AACA,IAAIG,aAAazC,KAAK,oBAAL,CAAjB;;AAEA;AACA,IAAI0C,eAAeH,UAAUI,QAA7B;;AAEA;AACA,IAAIC,iBAAiBJ,YAAYI,cAAjC;;AAEA;AACA,IAAIC,aAAc,YAAW;AAC3B,MAAIC,MAAM,SAASC,IAAT,CAAcN,cAAcA,WAAWO,IAAzB,IAAiCP,WAAWO,IAAX,CAAgBC,QAAjD,IAA6D,EAA3E,CAAV;AACA,SAAOH,MAAO,mBAAmBA,GAA1B,GAAiC,EAAxC;AACD,CAHiB,EAAlB;;AAKA;;;;;AAKA,IAAII,uBAAuBV,YAAYG,QAAvC;;AAEA;AACA,IAAIQ,mBAAmBT,aAAatB,IAAb,CAAkBvB,MAAlB,CAAvB;;AAEA;AACA,IAAIuD,aAAaC,OAAO,MACtBX,aAAatB,IAAb,CAAkBwB,cAAlB,EAAkCU,OAAlC,CAA0C/D,YAA1C,EAAwD,MAAxD,EACC+D,OADD,CACS,wDADT,EACmE,OADnE,CADsB,GAEwD,GAF/D,CAAjB;;AAKA;AACA,IAAIC,SAAShD,gBAAgBP,KAAKuD,MAArB,GAA8BvB,SAA3C;AAAA,IACIwB,UAASxD,KAAKwD,MADlB;AAAA,IAEIC,aAAazD,KAAKyD,UAFtB;AAAA,IAGIC,cAAcH,SAASA,OAAOG,WAAhB,GAA8B1B,SAHhD;AAAA,IAII2B,eAAe1B,QAAQpC,OAAO+D,cAAf,EAA+B/D,MAA/B,CAJnB;AAAA,IAKIgE,eAAehE,OAAOiE,MAL1B;AAAA,IAMIC,uBAAuBvB,YAAYuB,oBANvC;AAAA,IAOIC,SAAS3B,WAAW2B,MAPxB;AAAA,IAQIC,iBAAiBT,UAASA,QAAOU,WAAhB,GAA8BlC,SARnD;;AAUA,IAAImC,iBAAkB,YAAW;AAC/B,MAAI;AACF,QAAInD,OAAOoD,UAAUvE,MAAV,EAAkB,gBAAlB,CAAX;AACAmB,SAAK,EAAL,EAAS,EAAT,EAAa,EAAb;AACA,WAAOA,IAAP;AACD,GAJD,CAIE,OAAOJ,CAAP,EAAU,CAAE;AACf,CANqB,EAAtB;;AAQA;AACA,IAAIyD,iBAAiBd,SAASA,OAAOe,QAAhB,GAA2BtC,SAAhD;AAAA,IACIuC,YAAYC,KAAKC,GADrB;AAAA,IAEIC,YAAYC,KAAKC,GAFrB;;AAIA;AACA,IAAIC,MAAMT,UAAUpE,IAAV,EAAgB,KAAhB,CAAV;AAAA,IACI8E,eAAeV,UAAUvE,MAAV,EAAkB,QAAlB,CADnB;;AAGA;;;;;;;;AAQA,IAAIkF,aAAc,YAAW;AAC3B,WAASjD,MAAT,GAAkB,CAAE;AACpB,SAAO,UAASkD,KAAT,EAAgB;AACrB,QAAI,CAACC,SAASD,KAAT,CAAL,EAAsB;AACpB,aAAO,EAAP;AACD;AACD,QAAInB,YAAJ,EAAkB;AAChB,aAAOA,aAAamB,KAAb,CAAP;AACD;AACDlD,WAAOQ,SAAP,GAAmB0C,KAAnB;AACA,QAAIvD,SAAS,IAAIK,MAAJ,EAAb;AACAA,WAAOQ,SAAP,GAAmBN,SAAnB;AACA,WAAOP,MAAP;AACD,GAXD;AAYD,CAdiB,EAAlB;;AAgBA;;;;;;;AAOA,SAASyD,IAAT,CAAcC,OAAd,EAAuB;AACrB,MAAI3D,QAAQ,CAAC,CAAb;AAAA,MACIL,SAASgE,WAAW,IAAX,GAAkB,CAAlB,GAAsBA,QAAQhE,MAD3C;;AAGA,OAAKiE,KAAL;AACA,SAAO,EAAE5D,KAAF,GAAUL,MAAjB,EAAyB;AACvB,QAAIkE,QAAQF,QAAQ3D,KAAR,CAAZ;AACA,SAAK8D,GAAL,CAASD,MAAM,CAAN,CAAT,EAAmBA,MAAM,CAAN,CAAnB;AACD;AACF;;AAED;;;;;;;AAOA,SAASE,SAAT,GAAqB;AACnB,OAAKC,QAAL,GAAgBV,eAAeA,aAAa,IAAb,CAAf,GAAoC,EAApD;AACA,OAAKW,IAAL,GAAY,CAAZ;AACD;;AAED;;;;;;;;;;AAUA,SAASC,UAAT,CAAoB3D,GAApB,EAAyB;AACvB,MAAIN,SAAS,KAAKkE,GAAL,CAAS5D,GAAT,KAAiB,OAAO,KAAKyD,QAAL,CAAczD,GAAd,CAArC;AACA,OAAK0D,IAAL,IAAahE,SAAS,CAAT,GAAa,CAA1B;AACA,SAAOA,MAAP;AACD;;AAED;;;;;;;;;AASA,SAASmE,OAAT,CAAiB7D,GAAjB,EAAsB;AACpB,MAAI8D,OAAO,KAAKL,QAAhB;AACA,MAAIV,YAAJ,EAAkB;AAChB,QAAIrD,SAASoE,KAAK9D,GAAL,CAAb;AACA,WAAON,WAAWnE,cAAX,GAA4B0E,SAA5B,GAAwCP,MAA/C;AACD;AACD,SAAOmB,eAAexB,IAAf,CAAoByE,IAApB,EAA0B9D,GAA1B,IAAiC8D,KAAK9D,GAAL,CAAjC,GAA6CC,SAApD;AACD;;AAED;;;;;;;;;AASA,SAAS8D,OAAT,CAAiB/D,GAAjB,EAAsB;AACpB,MAAI8D,OAAO,KAAKL,QAAhB;AACA,SAAOV,eAAgBe,KAAK9D,GAAL,MAAcC,SAA9B,GAA2CY,eAAexB,IAAf,CAAoByE,IAApB,EAA0B9D,GAA1B,CAAlD;AACD;;AAED;;;;;;;;;;AAUA,SAASgE,OAAT,CAAiBhE,GAAjB,EAAsBH,KAAtB,EAA6B;AAC3B,MAAIiE,OAAO,KAAKL,QAAhB;AACA,OAAKC,IAAL,IAAa,KAAKE,GAAL,CAAS5D,GAAT,IAAgB,CAAhB,GAAoB,CAAjC;AACA8D,OAAK9D,GAAL,IAAa+C,gBAAgBlD,UAAUI,SAA3B,GAAwC1E,cAAxC,GAAyDsE,KAArE;AACA,SAAO,IAAP;AACD;;AAED;AACAsD,KAAK5C,SAAL,CAAe8C,KAAf,GAAuBG,SAAvB;AACAL,KAAK5C,SAAL,CAAe,QAAf,IAA2BoD,UAA3B;AACAR,KAAK5C,SAAL,CAAe0D,GAAf,GAAqBJ,OAArB;AACAV,KAAK5C,SAAL,CAAeqD,GAAf,GAAqBG,OAArB;AACAZ,KAAK5C,SAAL,CAAegD,GAAf,GAAqBS,OAArB;;AAEA;;;;;;;AAOA,SAASE,SAAT,CAAmBd,OAAnB,EAA4B;AAC1B,MAAI3D,QAAQ,CAAC,CAAb;AAAA,MACIL,SAASgE,WAAW,IAAX,GAAkB,CAAlB,GAAsBA,QAAQhE,MAD3C;;AAGA,OAAKiE,KAAL;AACA,SAAO,EAAE5D,KAAF,GAAUL,MAAjB,EAAyB;AACvB,QAAIkE,QAAQF,QAAQ3D,KAAR,CAAZ;AACA,SAAK8D,GAAL,CAASD,MAAM,CAAN,CAAT,EAAmBA,MAAM,CAAN,CAAnB;AACD;AACF;;AAED;;;;;;;AAOA,SAASa,cAAT,GAA0B;AACxB,OAAKV,QAAL,GAAgB,EAAhB;AACA,OAAKC,IAAL,GAAY,CAAZ;AACD;;AAED;;;;;;;;;AASA,SAASU,eAAT,CAAyBpE,GAAzB,EAA8B;AAC5B,MAAI8D,OAAO,KAAKL,QAAhB;AAAA,MACIhE,QAAQ4E,aAAaP,IAAb,EAAmB9D,GAAnB,CADZ;;AAGA,MAAIP,QAAQ,CAAZ,EAAe;AACb,WAAO,KAAP;AACD;AACD,MAAI6E,YAAYR,KAAK1E,MAAL,GAAc,CAA9B;AACA,MAAIK,SAAS6E,SAAb,EAAwB;AACtBR,SAAKS,GAAL;AACD,GAFD,MAEO;AACLtC,WAAO5C,IAAP,CAAYyE,IAAZ,EAAkBrE,KAAlB,EAAyB,CAAzB;AACD;AACD,IAAE,KAAKiE,IAAP;AACA,SAAO,IAAP;AACD;;AAED;;;;;;;;;AASA,SAASc,YAAT,CAAsBxE,GAAtB,EAA2B;AACzB,MAAI8D,OAAO,KAAKL,QAAhB;AAAA,MACIhE,QAAQ4E,aAAaP,IAAb,EAAmB9D,GAAnB,CADZ;;AAGA,SAAOP,QAAQ,CAAR,GAAYQ,SAAZ,GAAwB6D,KAAKrE,KAAL,EAAY,CAAZ,CAA/B;AACD;;AAED;;;;;;;;;AASA,SAASgF,YAAT,CAAsBzE,GAAtB,EAA2B;AACzB,SAAOqE,aAAa,KAAKZ,QAAlB,EAA4BzD,GAA5B,IAAmC,CAAC,CAA3C;AACD;;AAED;;;;;;;;;;AAUA,SAAS0E,YAAT,CAAsB1E,GAAtB,EAA2BH,KAA3B,EAAkC;AAChC,MAAIiE,OAAO,KAAKL,QAAhB;AAAA,MACIhE,QAAQ4E,aAAaP,IAAb,EAAmB9D,GAAnB,CADZ;;AAGA,MAAIP,QAAQ,CAAZ,EAAe;AACb,MAAE,KAAKiE,IAAP;AACAI,SAAKa,IAAL,CAAU,CAAC3E,GAAD,EAAMH,KAAN,CAAV;AACD,GAHD,MAGO;AACLiE,SAAKrE,KAAL,EAAY,CAAZ,IAAiBI,KAAjB;AACD;AACD,SAAO,IAAP;AACD;;AAED;AACAqE,UAAU3D,SAAV,CAAoB8C,KAApB,GAA4Bc,cAA5B;AACAD,UAAU3D,SAAV,CAAoB,QAApB,IAAgC6D,eAAhC;AACAF,UAAU3D,SAAV,CAAoB0D,GAApB,GAA0BO,YAA1B;AACAN,UAAU3D,SAAV,CAAoBqD,GAApB,GAA0Ba,YAA1B;AACAP,UAAU3D,SAAV,CAAoBgD,GAApB,GAA0BmB,YAA1B;;AAEA;;;;;;;AAOA,SAASE,QAAT,CAAkBxB,OAAlB,EAA2B;AACzB,MAAI3D,QAAQ,CAAC,CAAb;AAAA,MACIL,SAASgE,WAAW,IAAX,GAAkB,CAAlB,GAAsBA,QAAQhE,MAD3C;;AAGA,OAAKiE,KAAL;AACA,SAAO,EAAE5D,KAAF,GAAUL,MAAjB,EAAyB;AACvB,QAAIkE,QAAQF,QAAQ3D,KAAR,CAAZ;AACA,SAAK8D,GAAL,CAASD,MAAM,CAAN,CAAT,EAAmBA,MAAM,CAAN,CAAnB;AACD;AACF;;AAED;;;;;;;AAOA,SAASuB,aAAT,GAAyB;AACvB,OAAKnB,IAAL,GAAY,CAAZ;AACA,OAAKD,QAAL,GAAgB;AACd,YAAQ,IAAIN,IAAJ,EADM;AAEd,WAAO,KAAKL,OAAOoB,SAAZ,GAFO;AAGd,cAAU,IAAIf,IAAJ;AAHI,GAAhB;AAKD;;AAED;;;;;;;;;AASA,SAAS2B,cAAT,CAAwB9E,GAAxB,EAA6B;AAC3B,MAAIN,SAASqF,WAAW,IAAX,EAAiB/E,GAAjB,EAAsB,QAAtB,EAAgCA,GAAhC,CAAb;AACA,OAAK0D,IAAL,IAAahE,SAAS,CAAT,GAAa,CAA1B;AACA,SAAOA,MAAP;AACD;;AAED;;;;;;;;;AASA,SAASsF,WAAT,CAAqBhF,GAArB,EAA0B;AACxB,SAAO+E,WAAW,IAAX,EAAiB/E,GAAjB,EAAsBiE,GAAtB,CAA0BjE,GAA1B,CAAP;AACD;;AAED;;;;;;;;;AASA,SAASiF,WAAT,CAAqBjF,GAArB,EAA0B;AACxB,SAAO+E,WAAW,IAAX,EAAiB/E,GAAjB,EAAsB4D,GAAtB,CAA0B5D,GAA1B,CAAP;AACD;;AAED;;;;;;;;;;AAUA,SAASkF,WAAT,CAAqBlF,GAArB,EAA0BH,KAA1B,EAAiC;AAC/B,MAAIiE,OAAOiB,WAAW,IAAX,EAAiB/E,GAAjB,CAAX;AAAA,MACI0D,OAAOI,KAAKJ,IADhB;;AAGAI,OAAKP,GAAL,CAASvD,GAAT,EAAcH,KAAd;AACA,OAAK6D,IAAL,IAAaI,KAAKJ,IAAL,IAAaA,IAAb,GAAoB,CAApB,GAAwB,CAArC;AACA,SAAO,IAAP;AACD;;AAED;AACAkB,SAASrE,SAAT,CAAmB8C,KAAnB,GAA2BwB,aAA3B;AACAD,SAASrE,SAAT,CAAmB,QAAnB,IAA+BuE,cAA/B;AACAF,SAASrE,SAAT,CAAmB0D,GAAnB,GAAyBe,WAAzB;AACAJ,SAASrE,SAAT,CAAmBqD,GAAnB,GAAyBqB,WAAzB;AACAL,SAASrE,SAAT,CAAmBgD,GAAnB,GAAyB2B,WAAzB;;AAEA;;;;;;;AAOA,SAASC,KAAT,CAAe/B,OAAf,EAAwB;AACtB,MAAIU,OAAO,KAAKL,QAAL,GAAgB,IAAIS,SAAJ,CAAcd,OAAd,CAA3B;AACA,OAAKM,IAAL,GAAYI,KAAKJ,IAAjB;AACD;;AAED;;;;;;;AAOA,SAAS0B,UAAT,GAAsB;AACpB,OAAK3B,QAAL,GAAgB,IAAIS,SAAJ,EAAhB;AACA,OAAKR,IAAL,GAAY,CAAZ;AACD;;AAED;;;;;;;;;AASA,SAAS2B,WAAT,CAAqBrF,GAArB,EAA0B;AACxB,MAAI8D,OAAO,KAAKL,QAAhB;AAAA,MACI/D,SAASoE,KAAK,QAAL,EAAe9D,GAAf,CADb;;AAGA,OAAK0D,IAAL,GAAYI,KAAKJ,IAAjB;AACA,SAAOhE,MAAP;AACD;;AAED;;;;;;;;;AASA,SAAS4F,QAAT,CAAkBtF,GAAlB,EAAuB;AACrB,SAAO,KAAKyD,QAAL,CAAcQ,GAAd,CAAkBjE,GAAlB,CAAP;AACD;;AAED;;;;;;;;;AASA,SAASuF,QAAT,CAAkBvF,GAAlB,EAAuB;AACrB,SAAO,KAAKyD,QAAL,CAAcG,GAAd,CAAkB5D,GAAlB,CAAP;AACD;;AAED;;;;;;;;;;AAUA,SAASwF,QAAT,CAAkBxF,GAAlB,EAAuBH,KAAvB,EAA8B;AAC5B,MAAIiE,OAAO,KAAKL,QAAhB;AACA,MAAIK,gBAAgBI,SAApB,EAA+B;AAC7B,QAAIuB,QAAQ3B,KAAKL,QAAjB;AACA,QAAI,CAACX,GAAD,IAAS2C,MAAMrG,MAAN,GAAe9D,mBAAmB,CAA/C,EAAmD;AACjDmK,YAAMd,IAAN,CAAW,CAAC3E,GAAD,EAAMH,KAAN,CAAX;AACA,WAAK6D,IAAL,GAAY,EAAEI,KAAKJ,IAAnB;AACA,aAAO,IAAP;AACD;AACDI,WAAO,KAAKL,QAAL,GAAgB,IAAImB,QAAJ,CAAaa,KAAb,CAAvB;AACD;AACD3B,OAAKP,GAAL,CAASvD,GAAT,EAAcH,KAAd;AACA,OAAK6D,IAAL,GAAYI,KAAKJ,IAAjB;AACA,SAAO,IAAP;AACD;;AAED;AACAyB,MAAM5E,SAAN,CAAgB8C,KAAhB,GAAwB+B,UAAxB;AACAD,MAAM5E,SAAN,CAAgB,QAAhB,IAA4B8E,WAA5B;AACAF,MAAM5E,SAAN,CAAgB0D,GAAhB,GAAsBqB,QAAtB;AACAH,MAAM5E,SAAN,CAAgBqD,GAAhB,GAAsB2B,QAAtB;AACAJ,MAAM5E,SAAN,CAAgBgD,GAAhB,GAAsBiC,QAAtB;;AAEA;;;;;;;;AAQA,SAASE,aAAT,CAAuB7F,KAAvB,EAA8B8F,SAA9B,EAAyC;AACvC,MAAIC,QAAQC,QAAQhG,KAAR,CAAZ;AAAA,MACIiG,QAAQ,CAACF,KAAD,IAAUG,YAAYlG,KAAZ,CADtB;AAAA,MAEImG,SAAS,CAACJ,KAAD,IAAU,CAACE,KAAX,IAAoBvD,SAAS1C,KAAT,CAFjC;AAAA,MAGIoG,SAAS,CAACL,KAAD,IAAU,CAACE,KAAX,IAAoB,CAACE,MAArB,IAA+BjH,aAAac,KAAb,CAH5C;AAAA,MAIIqG,cAAcN,SAASE,KAAT,IAAkBE,MAAlB,IAA4BC,MAJ9C;AAAA,MAKIvG,SAASwG,cAAc5G,UAAUO,MAAMT,MAAhB,EAAwB+G,MAAxB,CAAd,GAAgD,EAL7D;AAAA,MAMI/G,SAASM,OAAON,MANpB;;AAQA,OAAK,IAAIY,GAAT,IAAgBH,KAAhB,EAAuB;AACrB,QAAI,CAAC8F,aAAa9E,eAAexB,IAAf,CAAoBQ,KAApB,EAA2BG,GAA3B,CAAd,KACA,EAAEkG;AACC;AACAlG,WAAO,QAAP;AACA;AACCgG,eAAWhG,OAAO,QAAP,IAAmBA,OAAO,QAArC,CAFD;AAGA;AACCiG,eAAWjG,OAAO,QAAP,IAAmBA,OAAO,YAA1B,IAA0CA,OAAO,YAA5D,CAJD;AAKA;AACAoG,YAAQpG,GAAR,EAAaZ,MAAb,CARD,CAAF,CADJ,EAUQ;AACNM,aAAOiF,IAAP,CAAY3E,GAAZ;AACD;AACF;AACD,SAAON,MAAP;AACD;;AAED;;;;;;;;;AASA,SAAS2G,gBAAT,CAA0BtG,MAA1B,EAAkCC,GAAlC,EAAuCH,KAAvC,EAA8C;AAC5C,MAAKA,UAAUI,SAAV,IAAuB,CAACqG,GAAGvG,OAAOC,GAAP,CAAH,EAAgBH,KAAhB,CAAzB,IACCA,UAAUI,SAAV,IAAuB,EAAED,OAAOD,MAAT,CAD5B,EAC+C;AAC7CwG,oBAAgBxG,MAAhB,EAAwBC,GAAxB,EAA6BH,KAA7B;AACD;AACF;;AAED;;;;;;;;;;AAUA,SAAS2G,WAAT,CAAqBzG,MAArB,EAA6BC,GAA7B,EAAkCH,KAAlC,EAAyC;AACvC,MAAI4G,WAAW1G,OAAOC,GAAP,CAAf;AACA,MAAI,EAAEa,eAAexB,IAAf,CAAoBU,MAApB,EAA4BC,GAA5B,KAAoCsG,GAAGG,QAAH,EAAa5G,KAAb,CAAtC,KACCA,UAAUI,SAAV,IAAuB,EAAED,OAAOD,MAAT,CAD5B,EAC+C;AAC7CwG,oBAAgBxG,MAAhB,EAAwBC,GAAxB,EAA6BH,KAA7B;AACD;AACF;;AAED;;;;;;;;AAQA,SAASwE,YAAT,CAAsBqC,KAAtB,EAA6B1G,GAA7B,EAAkC;AAChC,MAAIZ,SAASsH,MAAMtH,MAAnB;AACA,SAAOA,QAAP,EAAiB;AACf,QAAIkH,GAAGI,MAAMtH,MAAN,EAAc,CAAd,CAAH,EAAqBY,GAArB,CAAJ,EAA+B;AAC7B,aAAOZ,MAAP;AACD;AACF;AACD,SAAO,CAAC,CAAR;AACD;;AAED;;;;;;;;;AASA,SAASmH,eAAT,CAAyBxG,MAAzB,EAAiCC,GAAjC,EAAsCH,KAAtC,EAA6C;AAC3C,MAAIG,OAAO,WAAP,IAAsBoC,cAA1B,EAA0C;AACxCA,mBAAerC,MAAf,EAAuBC,GAAvB,EAA4B;AAC1B,sBAAgB,IADU;AAE1B,oBAAc,IAFY;AAG1B,eAASH,KAHiB;AAI1B,kBAAY;AAJc,KAA5B;AAMD,GAPD,MAOO;AACLE,WAAOC,GAAP,IAAcH,KAAd;AACD;AACF;;AAED;;;;;;;;;;;AAWA,IAAI8G,UAAUC,eAAd;;AAEA;;;;;;;AAOA,SAASC,UAAT,CAAoBhH,KAApB,EAA2B;AACzB,MAAIA,SAAS,IAAb,EAAmB;AACjB,WAAOA,UAAUI,SAAV,GAAsBtD,YAAtB,GAAqCN,OAA5C;AACD;AACD,SAAQ6F,kBAAkBA,kBAAkBpE,OAAO+B,KAAP,CAArC,GACHiH,UAAUjH,KAAV,CADG,GAEHkH,eAAelH,KAAf,CAFJ;AAGD;;AAED;;;;;;;AAOA,SAASmH,eAAT,CAAyBnH,KAAzB,EAAgC;AAC9B,SAAOoH,aAAapH,KAAb,KAAuBgH,WAAWhH,KAAX,KAAqBlE,OAAnD;AACD;;AAED;;;;;;;;AAQA,SAASuL,YAAT,CAAsBrH,KAAtB,EAA6B;AAC3B,MAAI,CAACqD,SAASrD,KAAT,CAAD,IAAoBsH,SAAStH,KAAT,CAAxB,EAAyC;AACvC,WAAO,KAAP;AACD;AACD,MAAIuH,UAAUC,WAAWxH,KAAX,IAAoBwB,UAApB,GAAiC5D,YAA/C;AACA,SAAO2J,QAAQE,IAAR,CAAaC,SAAS1H,KAAT,CAAb,CAAP;AACD;;AAED;;;;;;;AAOA,SAAS2H,gBAAT,CAA0B3H,KAA1B,EAAiC;AAC/B,SAAOoH,aAAapH,KAAb,KACL4H,SAAS5H,MAAMT,MAAf,CADK,IACqB,CAAC,CAACzB,eAAekJ,WAAWhH,KAAX,CAAf,CAD9B;AAED;;AAED;;;;;;;AAOA,SAAS6H,UAAT,CAAoB3H,MAApB,EAA4B;AAC1B,MAAI,CAACmD,SAASnD,MAAT,CAAL,EAAuB;AACrB,WAAO4H,aAAa5H,MAAb,CAAP;AACD;AACD,MAAI6H,UAAUC,YAAY9H,MAAZ,CAAd;AAAA,MACIL,SAAS,EADb;;AAGA,OAAK,IAAIM,GAAT,IAAgBD,MAAhB,EAAwB;AACtB,QAAI,EAAEC,OAAO,aAAP,KAAyB4H,WAAW,CAAC/G,eAAexB,IAAf,CAAoBU,MAApB,EAA4BC,GAA5B,CAArC,CAAF,CAAJ,EAA+E;AAC7EN,aAAOiF,IAAP,CAAY3E,GAAZ;AACD;AACF;AACD,SAAON,MAAP;AACD;;AAED;;;;;;;;;;;AAWA,SAASoI,SAAT,CAAmB/H,MAAnB,EAA2BgI,MAA3B,EAAmCC,QAAnC,EAA6CC,UAA7C,EAAyDC,KAAzD,EAAgE;AAC9D,MAAInI,WAAWgI,MAAf,EAAuB;AACrB;AACD;AACDpB,UAAQoB,MAAR,EAAgB,UAASI,QAAT,EAAmBnI,GAAnB,EAAwB;AACtC,QAAIkD,SAASiF,QAAT,CAAJ,EAAwB;AACtBD,gBAAUA,QAAQ,IAAI/C,KAAJ,EAAlB;AACAiD,oBAAcrI,MAAd,EAAsBgI,MAAtB,EAA8B/H,GAA9B,EAAmCgI,QAAnC,EAA6CF,SAA7C,EAAwDG,UAAxD,EAAoEC,KAApE;AACD,KAHD,MAIK;AACH,UAAIG,WAAWJ,aACXA,WAAW5H,QAAQN,MAAR,EAAgBC,GAAhB,CAAX,EAAiCmI,QAAjC,EAA4CnI,MAAM,EAAlD,EAAuDD,MAAvD,EAA+DgI,MAA/D,EAAuEG,KAAvE,CADW,GAEXjI,SAFJ;;AAIA,UAAIoI,aAAapI,SAAjB,EAA4B;AAC1BoI,mBAAWF,QAAX;AACD;AACD9B,uBAAiBtG,MAAjB,EAAyBC,GAAzB,EAA8BqI,QAA9B;AACD;AACF,GAfD,EAeGC,MAfH;AAgBD;;AAED;;;;;;;;;;;;;;;AAeA,SAASF,aAAT,CAAuBrI,MAAvB,EAA+BgI,MAA/B,EAAuC/H,GAAvC,EAA4CgI,QAA5C,EAAsDO,SAAtD,EAAiEN,UAAjE,EAA6EC,KAA7E,EAAoF;AAClF,MAAIzB,WAAWpG,QAAQN,MAAR,EAAgBC,GAAhB,CAAf;AAAA,MACImI,WAAW9H,QAAQ0H,MAAR,EAAgB/H,GAAhB,CADf;AAAA,MAEIwI,UAAUN,MAAMjE,GAAN,CAAUkE,QAAV,CAFd;;AAIA,MAAIK,OAAJ,EAAa;AACXnC,qBAAiBtG,MAAjB,EAAyBC,GAAzB,EAA8BwI,OAA9B;AACA;AACD;AACD,MAAIH,WAAWJ,aACXA,WAAWxB,QAAX,EAAqB0B,QAArB,EAAgCnI,MAAM,EAAtC,EAA2CD,MAA3C,EAAmDgI,MAAnD,EAA2DG,KAA3D,CADW,GAEXjI,SAFJ;;AAIA,MAAIwI,WAAWJ,aAAapI,SAA5B;;AAEA,MAAIwI,QAAJ,EAAc;AACZ,QAAI7C,QAAQC,QAAQsC,QAAR,CAAZ;AAAA,QACInC,SAAS,CAACJ,KAAD,IAAUrD,SAAS4F,QAAT,CADvB;AAAA,QAEIO,UAAU,CAAC9C,KAAD,IAAU,CAACI,MAAX,IAAqBjH,aAAaoJ,QAAb,CAFnC;;AAIAE,eAAWF,QAAX;AACA,QAAIvC,SAASI,MAAT,IAAmB0C,OAAvB,EAAgC;AAC9B,UAAI7C,QAAQY,QAAR,CAAJ,EAAuB;AACrB4B,mBAAW5B,QAAX;AACD,OAFD,MAGK,IAAIkC,kBAAkBlC,QAAlB,CAAJ,EAAiC;AACpC4B,mBAAWO,UAAUnC,QAAV,CAAX;AACD,OAFI,MAGA,IAAIT,MAAJ,EAAY;AACfyC,mBAAW,KAAX;AACAJ,mBAAWQ,YAAYV,QAAZ,EAAsB,IAAtB,CAAX;AACD,OAHI,MAIA,IAAIO,OAAJ,EAAa;AAChBD,mBAAW,KAAX;AACAJ,mBAAWS,gBAAgBX,QAAhB,EAA0B,IAA1B,CAAX;AACD,OAHI,MAIA;AACHE,mBAAW,EAAX;AACD;AACF,KAlBD,MAmBK,IAAIU,cAAcZ,QAAd,KAA2BpC,YAAYoC,QAAZ,CAA/B,EAAsD;AACzDE,iBAAW5B,QAAX;AACA,UAAIV,YAAYU,QAAZ,CAAJ,EAA2B;AACzB4B,mBAAWW,cAAcvC,QAAd,CAAX;AACD,OAFD,MAGK,IAAI,CAACvD,SAASuD,QAAT,CAAD,IAAwBuB,YAAYX,WAAWZ,QAAX,CAAxC,EAA+D;AAClE4B,mBAAWY,gBAAgBd,QAAhB,CAAX;AACD;AACF,KARI,MASA;AACHM,iBAAW,KAAX;AACD;AACF;AACD,MAAIA,QAAJ,EAAc;AACZ;AACAP,UAAM3E,GAAN,CAAU4E,QAAV,EAAoBE,QAApB;AACAE,cAAUF,QAAV,EAAoBF,QAApB,EAA8BH,QAA9B,EAAwCC,UAAxC,EAAoDC,KAApD;AACAA,UAAM,QAAN,EAAgBC,QAAhB;AACD;AACD9B,mBAAiBtG,MAAjB,EAAyBC,GAAzB,EAA8BqI,QAA9B;AACD;;AAED;;;;;;;;AAQA,SAASa,QAAT,CAAkBjK,IAAlB,EAAwBkK,KAAxB,EAA+B;AAC7B,SAAOC,YAAYC,SAASpK,IAAT,EAAekK,KAAf,EAAsBG,QAAtB,CAAZ,EAA6CrK,OAAO,EAApD,CAAP;AACD;;AAED;;;;;;;;AAQA,IAAIsK,kBAAkB,CAACnH,cAAD,GAAkBkH,QAAlB,GAA6B,UAASrK,IAAT,EAAeuK,MAAf,EAAuB;AACxE,SAAOpH,eAAenD,IAAf,EAAqB,UAArB,EAAiC;AACtC,oBAAgB,IADsB;AAEtC,kBAAc,KAFwB;AAGtC,aAASwK,SAASD,MAAT,CAH6B;AAItC,gBAAY;AAJ0B,GAAjC,CAAP;AAMD,CAPD;;AASA;;;;;;;;AAQA,SAASX,WAAT,CAAqBa,MAArB,EAA6BC,MAA7B,EAAqC;AACnC,MAAIA,MAAJ,EAAY;AACV,WAAOD,OAAOE,KAAP,EAAP;AACD;AACD,MAAIxK,SAASsK,OAAOtK,MAApB;AAAA,MACIM,SAASiC,cAAcA,YAAYvC,MAAZ,CAAd,GAAoC,IAAIsK,OAAOG,WAAX,CAAuBzK,MAAvB,CADjD;;AAGAsK,SAAOI,IAAP,CAAYpK,MAAZ;AACA,SAAOA,MAAP;AACD;;AAED;;;;;;;AAOA,SAASqK,gBAAT,CAA0BC,WAA1B,EAAuC;AACrC,MAAItK,SAAS,IAAIsK,YAAYH,WAAhB,CAA4BG,YAAYC,UAAxC,CAAb;AACA,MAAIvI,UAAJ,CAAehC,MAAf,EAAuB6D,GAAvB,CAA2B,IAAI7B,UAAJ,CAAesI,WAAf,CAA3B;AACA,SAAOtK,MAAP;AACD;;AAED;;;;;;;;AAQA,SAASoJ,eAAT,CAAyBoB,UAAzB,EAAqCP,MAArC,EAA6C;AAC3C,MAAID,SAASC,SAASI,iBAAiBG,WAAWR,MAA5B,CAAT,GAA+CQ,WAAWR,MAAvE;AACA,SAAO,IAAIQ,WAAWL,WAAf,CAA2BH,MAA3B,EAAmCQ,WAAWC,UAA9C,EAA0DD,WAAW9K,MAArE,CAAP;AACD;;AAED;;;;;;;;AAQA,SAASwJ,SAAT,CAAmBb,MAAnB,EAA2BrB,KAA3B,EAAkC;AAChC,MAAIjH,QAAQ,CAAC,CAAb;AAAA,MACIL,SAAS2I,OAAO3I,MADpB;;AAGAsH,YAAUA,QAAQ/G,MAAMP,MAAN,CAAlB;AACA,SAAO,EAAEK,KAAF,GAAUL,MAAjB,EAAyB;AACvBsH,UAAMjH,KAAN,IAAesI,OAAOtI,KAAP,CAAf;AACD;AACD,SAAOiH,KAAP;AACD;;AAED;;;;;;;;;;AAUA,SAAS0D,UAAT,CAAoBrC,MAApB,EAA4BsC,KAA5B,EAAmCtK,MAAnC,EAA2CkI,UAA3C,EAAuD;AACrD,MAAIqC,QAAQ,CAACvK,MAAb;AACAA,aAAWA,SAAS,EAApB;;AAEA,MAAIN,QAAQ,CAAC,CAAb;AAAA,MACIL,SAASiL,MAAMjL,MADnB;;AAGA,SAAO,EAAEK,KAAF,GAAUL,MAAjB,EAAyB;AACvB,QAAIY,MAAMqK,MAAM5K,KAAN,CAAV;;AAEA,QAAI4I,WAAWJ,aACXA,WAAWlI,OAAOC,GAAP,CAAX,EAAwB+H,OAAO/H,GAAP,CAAxB,EAAqCA,GAArC,EAA0CD,MAA1C,EAAkDgI,MAAlD,CADW,GAEX9H,SAFJ;;AAIA,QAAIoI,aAAapI,SAAjB,EAA4B;AAC1BoI,iBAAWN,OAAO/H,GAAP,CAAX;AACD;AACD,QAAIsK,KAAJ,EAAW;AACT/D,sBAAgBxG,MAAhB,EAAwBC,GAAxB,EAA6BqI,QAA7B;AACD,KAFD,MAEO;AACL7B,kBAAYzG,MAAZ,EAAoBC,GAApB,EAAyBqI,QAAzB;AACD;AACF;AACD,SAAOtI,MAAP;AACD;;AAED;;;;;;;AAOA,SAASwK,cAAT,CAAwBC,QAAxB,EAAkC;AAChC,SAAOtB,SAAS,UAASnJ,MAAT,EAAiB0K,OAAjB,EAA0B;AACxC,QAAIhL,QAAQ,CAAC,CAAb;AAAA,QACIL,SAASqL,QAAQrL,MADrB;AAAA,QAEI6I,aAAa7I,SAAS,CAAT,GAAaqL,QAAQrL,SAAS,CAAjB,CAAb,GAAmCa,SAFpD;AAAA,QAGIyK,QAAQtL,SAAS,CAAT,GAAaqL,QAAQ,CAAR,CAAb,GAA0BxK,SAHtC;;AAKAgI,iBAAcuC,SAASpL,MAAT,GAAkB,CAAlB,IAAuB,OAAO6I,UAAP,IAAqB,UAA7C,IACR7I,UAAU6I,UADF,IAEThI,SAFJ;;AAIA,QAAIyK,SAASC,eAAeF,QAAQ,CAAR,CAAf,EAA2BA,QAAQ,CAAR,CAA3B,EAAuCC,KAAvC,CAAb,EAA4D;AAC1DzC,mBAAa7I,SAAS,CAAT,GAAaa,SAAb,GAAyBgI,UAAtC;AACA7I,eAAS,CAAT;AACD;AACDW,aAASjC,OAAOiC,MAAP,CAAT;AACA,WAAO,EAAEN,KAAF,GAAUL,MAAjB,EAAyB;AACvB,UAAI2I,SAAS0C,QAAQhL,KAAR,CAAb;AACA,UAAIsI,MAAJ,EAAY;AACVyC,iBAASzK,MAAT,EAAiBgI,MAAjB,EAAyBtI,KAAzB,EAAgCwI,UAAhC;AACD;AACF;AACD,WAAOlI,MAAP;AACD,GAtBM,CAAP;AAuBD;;AAED;;;;;;;AAOA,SAAS6G,aAAT,CAAuBgE,SAAvB,EAAkC;AAChC,SAAO,UAAS7K,MAAT,EAAiBP,QAAjB,EAA2BqL,QAA3B,EAAqC;AAC1C,QAAIpL,QAAQ,CAAC,CAAb;AAAA,QACIqL,WAAWhN,OAAOiC,MAAP,CADf;AAAA,QAEIsK,QAAQQ,SAAS9K,MAAT,CAFZ;AAAA,QAGIX,SAASiL,MAAMjL,MAHnB;;AAKA,WAAOA,QAAP,EAAiB;AACf,UAAIY,MAAMqK,MAAMO,YAAYxL,MAAZ,GAAqB,EAAEK,KAA7B,CAAV;AACA,UAAID,SAASsL,SAAS9K,GAAT,CAAT,EAAwBA,GAAxB,EAA6B8K,QAA7B,MAA2C,KAA/C,EAAsD;AACpD;AACD;AACF;AACD,WAAO/K,MAAP;AACD,GAbD;AAcD;;AAED;;;;;;;;AAQA,SAASgF,UAAT,CAAoBgG,GAApB,EAAyB/K,GAAzB,EAA8B;AAC5B,MAAI8D,OAAOiH,IAAItH,QAAf;AACA,SAAOuH,UAAUhL,GAAV,IACH8D,KAAK,OAAO9D,GAAP,IAAc,QAAd,GAAyB,QAAzB,GAAoC,MAAzC,CADG,GAEH8D,KAAKiH,GAFT;AAGD;;AAED;;;;;;;;AAQA,SAAS1I,SAAT,CAAmBtC,MAAnB,EAA2BC,GAA3B,EAAgC;AAC9B,MAAIH,QAAQC,SAASC,MAAT,EAAiBC,GAAjB,CAAZ;AACA,SAAOkH,aAAarH,KAAb,IAAsBA,KAAtB,GAA8BI,SAArC;AACD;;AAED;;;;;;;AAOA,SAAS6G,SAAT,CAAmBjH,KAAnB,EAA0B;AACxB,MAAIoL,QAAQpK,eAAexB,IAAf,CAAoBQ,KAApB,EAA2BqC,cAA3B,CAAZ;AAAA,MACIgJ,MAAMrL,MAAMqC,cAAN,CADV;;AAGA,MAAI;AACFrC,UAAMqC,cAAN,IAAwBjC,SAAxB;AACA,QAAIkL,WAAW,IAAf;AACD,GAHD,CAGE,OAAOtM,CAAP,EAAU,CAAE;;AAEd,MAAIa,SAASyB,qBAAqB9B,IAArB,CAA0BQ,KAA1B,CAAb;AACA,MAAIsL,QAAJ,EAAc;AACZ,QAAIF,KAAJ,EAAW;AACTpL,YAAMqC,cAAN,IAAwBgJ,GAAxB;AACD,KAFD,MAEO;AACL,aAAOrL,MAAMqC,cAAN,CAAP;AACD;AACF;AACD,SAAOxC,MAAP;AACD;;AAED;;;;;;;AAOA,SAASuJ,eAAT,CAAyBlJ,MAAzB,EAAiC;AAC/B,SAAQ,OAAOA,OAAO8J,WAAd,IAA6B,UAA7B,IAA2C,CAAChC,YAAY9H,MAAZ,CAA7C,GACHiD,WAAWpB,aAAa7B,MAAb,CAAX,CADG,GAEH,EAFJ;AAGD;;AAED;;;;;;;;AAQA,SAASqG,OAAT,CAAiBvG,KAAjB,EAAwBT,MAAxB,EAAgC;AAC9B,MAAIgM,cAAcvL,KAAd,yCAAcA,KAAd,CAAJ;AACAT,WAASA,UAAU,IAAV,GAAiB1D,gBAAjB,GAAoC0D,MAA7C;;AAEA,SAAO,CAAC,CAACA,MAAF,KACJgM,QAAQ,QAAR,IACEA,QAAQ,QAAR,IAAoB1N,SAAS4J,IAAT,CAAczH,KAAd,CAFlB,KAGAA,QAAQ,CAAC,CAAT,IAAcA,QAAQ,CAAR,IAAa,CAA3B,IAAgCA,QAAQT,MAH/C;AAID;;AAED;;;;;;;;;;AAUA,SAASuL,cAAT,CAAwB9K,KAAxB,EAA+BJ,KAA/B,EAAsCM,MAAtC,EAA8C;AAC5C,MAAI,CAACmD,SAASnD,MAAT,CAAL,EAAuB;AACrB,WAAO,KAAP;AACD;AACD,MAAIqL,cAAc3L,KAAd,yCAAcA,KAAd,CAAJ;AACA,MAAI2L,QAAQ,QAAR,GACKC,YAAYtL,MAAZ,KAAuBqG,QAAQ3G,KAAR,EAAeM,OAAOX,MAAtB,CAD5B,GAEKgM,QAAQ,QAAR,IAAoB3L,SAASM,MAFtC,EAGM;AACJ,WAAOuG,GAAGvG,OAAON,KAAP,CAAH,EAAkBI,KAAlB,CAAP;AACD;AACD,SAAO,KAAP;AACD;;AAED;;;;;;;AAOA,SAASmL,SAAT,CAAmBnL,KAAnB,EAA0B;AACxB,MAAIuL,cAAcvL,KAAd,yCAAcA,KAAd,CAAJ;AACA,SAAQuL,QAAQ,QAAR,IAAoBA,QAAQ,QAA5B,IAAwCA,QAAQ,QAAhD,IAA4DA,QAAQ,SAArE,GACFvL,UAAU,WADR,GAEFA,UAAU,IAFf;AAGD;;AAED;;;;;;;AAOA,SAASsH,QAAT,CAAkBlI,IAAlB,EAAwB;AACtB,SAAO,CAAC,CAAC6B,UAAF,IAAiBA,cAAc7B,IAAtC;AACD;;AAED;;;;;;;AAOA,SAAS4I,WAAT,CAAqBhI,KAArB,EAA4B;AAC1B,MAAIyL,OAAOzL,SAASA,MAAMgK,WAA1B;AAAA,MACI5G,QAAS,OAAOqI,IAAP,IAAe,UAAf,IAA6BA,KAAK/K,SAAnC,IAAiDE,WAD7D;;AAGA,SAAOZ,UAAUoD,KAAjB;AACD;;AAED;;;;;;;;;AASA,SAAS0E,YAAT,CAAsB5H,MAAtB,EAA8B;AAC5B,MAAIL,SAAS,EAAb;AACA,MAAIK,UAAU,IAAd,EAAoB;AAClB,SAAK,IAAIC,GAAT,IAAgBlC,OAAOiC,MAAP,CAAhB,EAAgC;AAC9BL,aAAOiF,IAAP,CAAY3E,GAAZ;AACD;AACF;AACD,SAAON,MAAP;AACD;;AAED;;;;;;;AAOA,SAASqH,cAAT,CAAwBlH,KAAxB,EAA+B;AAC7B,SAAOsB,qBAAqB9B,IAArB,CAA0BQ,KAA1B,CAAP;AACD;;AAED;;;;;;;;;AASA,SAASwJ,QAAT,CAAkBpK,IAAlB,EAAwBkK,KAAxB,EAA+BhJ,SAA/B,EAA0C;AACxCgJ,UAAQ3G,UAAU2G,UAAUlJ,SAAV,GAAuBhB,KAAKG,MAAL,GAAc,CAArC,GAA0C+J,KAApD,EAA2D,CAA3D,CAAR;AACA,SAAO,YAAW;AAChB,QAAIhK,OAAOoM,SAAX;AAAA,QACI9L,QAAQ,CAAC,CADb;AAAA,QAEIL,SAASoD,UAAUrD,KAAKC,MAAL,GAAc+J,KAAxB,EAA+B,CAA/B,CAFb;AAAA,QAGIzC,QAAQ/G,MAAMP,MAAN,CAHZ;;AAKA,WAAO,EAAEK,KAAF,GAAUL,MAAjB,EAAyB;AACvBsH,YAAMjH,KAAN,IAAeN,KAAKgK,QAAQ1J,KAAb,CAAf;AACD;AACDA,YAAQ,CAAC,CAAT;AACA,QAAI+L,YAAY7L,MAAMwJ,QAAQ,CAAd,CAAhB;AACA,WAAO,EAAE1J,KAAF,GAAU0J,KAAjB,EAAwB;AACtBqC,gBAAU/L,KAAV,IAAmBN,KAAKM,KAAL,CAAnB;AACD;AACD+L,cAAUrC,KAAV,IAAmBhJ,UAAUuG,KAAV,CAAnB;AACA,WAAO1H,MAAMC,IAAN,EAAY,IAAZ,EAAkBuM,SAAlB,CAAP;AACD,GAhBD;AAiBD;;AAED;;;;;;;;AAQA,IAAIpC,cAAcqC,SAASlC,eAAT,CAAlB;;AAEA;;;;;;;;;AASA,SAASkC,QAAT,CAAkBxM,IAAlB,EAAwB;AACtB,MAAIyM,QAAQ,CAAZ;AAAA,MACIC,aAAa,CADjB;;AAGA,SAAO,YAAW;AAChB,QAAIC,QAAQjJ,WAAZ;AAAA,QACIkJ,YAAYpQ,YAAYmQ,QAAQD,UAApB,CADhB;;AAGAA,iBAAaC,KAAb;AACA,QAAIC,YAAY,CAAhB,EAAmB;AACjB,UAAI,EAAEH,KAAF,IAAWlQ,SAAf,EAA0B;AACxB,eAAO+P,UAAU,CAAV,CAAP;AACD;AACF,KAJD,MAIO;AACLG,cAAQ,CAAR;AACD;AACD,WAAOzM,KAAKD,KAAL,CAAWiB,SAAX,EAAsBsL,SAAtB,CAAP;AACD,GAbD;AAcD;;AAED;;;;;;;AAOA,SAAShE,QAAT,CAAkBtI,IAAlB,EAAwB;AACtB,MAAIA,QAAQ,IAAZ,EAAkB;AAChB,QAAI;AACF,aAAO0B,aAAatB,IAAb,CAAkBJ,IAAlB,CAAP;AACD,KAFD,CAEE,OAAOJ,CAAP,EAAU,CAAE;AACd,QAAI;AACF,aAAQI,OAAO,EAAf;AACD,KAFD,CAEE,OAAOJ,CAAP,EAAU,CAAE;AACf;AACD,SAAO,EAAP;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA,SAASyH,EAAT,CAAYzG,KAAZ,EAAmBiM,KAAnB,EAA0B;AACxB,SAAOjM,UAAUiM,KAAV,IAAoBjM,UAAUA,KAAV,IAAmBiM,UAAUA,KAAxD;AACD;;AAED;;;;;;;;;;;;;;;;;;AAkBA,IAAI/F,cAAciB,gBAAgB,YAAW;AAAE,SAAOuE,SAAP;AAAmB,CAAhC,EAAhB,IAAsDvE,eAAtD,GAAwE,UAASnH,KAAT,EAAgB;AACxG,SAAOoH,aAAapH,KAAb,KAAuBgB,eAAexB,IAAf,CAAoBQ,KAApB,EAA2B,QAA3B,CAAvB,IACL,CAACmC,qBAAqB3C,IAArB,CAA0BQ,KAA1B,EAAiC,QAAjC,CADH;AAED,CAHD;;AAKA;;;;;;;;;;;;;;;;;;;;;;;AAuBA,IAAIgG,UAAUlG,MAAMkG,OAApB;;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAASwF,WAAT,CAAqBxL,KAArB,EAA4B;AAC1B,SAAOA,SAAS,IAAT,IAAiB4H,SAAS5H,MAAMT,MAAf,CAAjB,IAA2C,CAACiI,WAAWxH,KAAX,CAAnD;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAS8I,iBAAT,CAA2B9I,KAA3B,EAAkC;AAChC,SAAOoH,aAAapH,KAAb,KAAuBwL,YAAYxL,KAAZ,CAA9B;AACD;;AAED;;;;;;;;;;;;;;;;;AAiBA,IAAI0C,WAAWD,kBAAkByJ,SAAjC;;AAEA;;;;;;;;;;;;;;;;;AAiBA,SAAS1E,UAAT,CAAoBxH,KAApB,EAA2B;AACzB,MAAI,CAACqD,SAASrD,KAAT,CAAL,EAAsB;AACpB,WAAO,KAAP;AACD;AACD;AACA;AACA,MAAIqL,MAAMrE,WAAWhH,KAAX,CAAV;AACA,SAAOqL,OAAOjP,OAAP,IAAkBiP,OAAOhP,MAAzB,IAAmCgP,OAAOrP,QAA1C,IAAsDqP,OAAO3O,QAApE;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BA,SAASkL,QAAT,CAAkB5H,KAAlB,EAAyB;AACvB,SAAO,OAAOA,KAAP,IAAgB,QAAhB,IACLA,QAAQ,CAAC,CADJ,IACSA,QAAQ,CAAR,IAAa,CADtB,IAC2BA,SAASnE,gBAD3C;AAED;;AAED;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAASwH,QAAT,CAAkBrD,KAAlB,EAAyB;AACvB,MAAIuL,cAAcvL,KAAd,yCAAcA,KAAd,CAAJ;AACA,SAAOA,SAAS,IAAT,KAAkBuL,QAAQ,QAAR,IAAoBA,QAAQ,UAA9C,CAAP;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAASnE,YAAT,CAAsBpH,KAAtB,EAA6B;AAC3B,SAAOA,SAAS,IAAT,IAAiB,QAAOA,KAAP,yCAAOA,KAAP,MAAgB,QAAxC;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAASkJ,aAAT,CAAuBlJ,KAAvB,EAA8B;AAC5B,MAAI,CAACoH,aAAapH,KAAb,CAAD,IAAwBgH,WAAWhH,KAAX,KAAqBvD,SAAjD,EAA4D;AAC1D,WAAO,KAAP;AACD;AACD,MAAI2G,QAAQrB,aAAa/B,KAAb,CAAZ;AACA,MAAIoD,UAAU,IAAd,EAAoB;AAClB,WAAO,IAAP;AACD;AACD,MAAIqI,OAAOzK,eAAexB,IAAf,CAAoB4D,KAApB,EAA2B,aAA3B,KAA6CA,MAAM4G,WAA9D;AACA,SAAO,OAAOyB,IAAP,IAAe,UAAf,IAA6BA,gBAAgBA,IAA7C,IACL3K,aAAatB,IAAb,CAAkBiM,IAAlB,KAA2BlK,gBAD7B;AAED;;AAED;;;;;;;;;;;;;;;;;AAiBA,IAAIrC,eAAeD,mBAAmBc,UAAUd,gBAAV,CAAnB,GAAiD0I,gBAApE;;AAEA;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAASwB,aAAT,CAAuBnJ,KAAvB,EAA8B;AAC5B,SAAOuK,WAAWvK,KAAX,EAAkByI,OAAOzI,KAAP,CAAlB,CAAP;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAASyI,MAAT,CAAgBvI,MAAhB,EAAwB;AACtB,SAAOsL,YAAYtL,MAAZ,IAAsB2F,cAAc3F,MAAd,EAAsB,IAAtB,CAAtB,GAAoD2H,WAAW3H,MAAX,CAA3D;AACD;;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,IAAIiM,QAAQzB,eAAe,UAASxK,MAAT,EAAiBgI,MAAjB,EAAyBC,QAAzB,EAAmC;AAC5DF,YAAU/H,MAAV,EAAkBgI,MAAlB,EAA0BC,QAA1B;AACD,CAFW,CAAZ;;AAIA;;;;;;;;;;;;;;;;;;;AAmBA,SAASyB,QAAT,CAAkB5J,KAAlB,EAAyB;AACvB,SAAO,YAAW;AAChB,WAAOA,KAAP;AACD,GAFD;AAGD;;AAED;;;;;;;;;;;;;;;;AAgBA,SAASyJ,QAAT,CAAkBzJ,KAAlB,EAAyB;AACvB,SAAOA,KAAP;AACD;;AAED;;;;;;;;;;;;;AAaA,SAASkM,SAAT,GAAqB;AACnB,SAAO,KAAP;AACD;;AAEDxN,OAAOH,OAAP,GAAiB4N,KAAjB","file":"index.js","sourceRoot":"/data","sourcesContent":["/**\n * Lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright JS Foundation and other contributors <https://js.foundation/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    asyncTag = '[object AsyncFunction]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    nullTag = '[object Null]',\n    objectTag = '[object Object]',\n    proxyTag = '[object Proxy]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    undefinedTag = '[object Undefined]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/**\n * Gets the value at `key`, unless `key` is \"__proto__\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction safeGet(object, key) {\n  return key == '__proto__'\n    ? undefined\n    : object[key];\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n    funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    Symbol = root.Symbol,\n    Uint8Array = root.Uint8Array,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n    getPrototype = overArg(Object.getPrototypeOf, Object),\n    objectCreate = Object.create,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    splice = arrayProto.splice,\n    symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n    nativeMax = Math.max,\n    nativeNow = Date.now;\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map'),\n    nativeCreate = getNative(Object, 'create');\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\n/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\n/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n  if ((value !== undefined && !eq(object[key], value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n  if (object === source) {\n    return;\n  }\n  baseFor(source, function(srcValue, key) {\n    if (isObject(srcValue)) {\n      stack || (stack = new Stack);\n      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n    }\n    else {\n      var newValue = customizer\n        ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      if (newValue === undefined) {\n        newValue = srcValue;\n      }\n      assignMergeValue(object, key, newValue);\n    }\n  }, keysIn);\n}\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n  var objValue = safeGet(object, key),\n      srcValue = safeGet(source, key),\n      stacked = stack.get(srcValue);\n\n  if (stacked) {\n    assignMergeValue(object, key, stacked);\n    return;\n  }\n  var newValue = customizer\n    ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n    : undefined;\n\n  var isCommon = newValue === undefined;\n\n  if (isCommon) {\n    var isArr = isArray(srcValue),\n        isBuff = !isArr && isBuffer(srcValue),\n        isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n    newValue = srcValue;\n    if (isArr || isBuff || isTyped) {\n      if (isArray(objValue)) {\n        newValue = objValue;\n      }\n      else if (isArrayLikeObject(objValue)) {\n        newValue = copyArray(objValue);\n      }\n      else if (isBuff) {\n        isCommon = false;\n        newValue = cloneBuffer(srcValue, true);\n      }\n      else if (isTyped) {\n        isCommon = false;\n        newValue = cloneTypedArray(srcValue, true);\n      }\n      else {\n        newValue = [];\n      }\n    }\n    else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n      newValue = objValue;\n      if (isArguments(objValue)) {\n        newValue = toPlainObject(objValue);\n      }\n      else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {\n        newValue = initCloneObject(srcValue);\n      }\n    }\n    else {\n      isCommon = false;\n    }\n  }\n  if (isCommon) {\n    // Recursively merge objects and arrays (susceptible to call stack limits).\n    stack.set(srcValue, newValue);\n    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n    stack['delete'](srcValue);\n  }\n  assignMergeValue(object, key, newValue);\n}\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\n/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\n/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\n/**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n *   'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n *   'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\nvar merge = createAssigner(function(object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\n/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\n/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = merge;\n"]}]}