@undp/data-viz 2.6.0 → 2.6.1

package/dist/index-BuwmuDFJ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-BuwmuDFJ.js","sources":["../node_modules/lodash.intersection/index.js"],"sourcesContent":["/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\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 to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]';\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/** 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/**\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 * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array ? array.length : 0;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\n/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array ? array.length : 0;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array ? array.length : 0,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  if (value !== value) {\n    return baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\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 * Checks if a cache value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\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 cacheHas(cache, key) {\n  return cache.has(key);\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 * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n  // Many host objects are `Object` objects that can coerce to strings\n  // despite having improperly defined `toString` methods.\n  var result = false;\n  if (value != null && typeof value.toString != 'function') {\n    try {\n      result = !!(value + '');\n    } catch (e) {}\n  }\n  return result;\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 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/** 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/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\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 splice = arrayProto.splice;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\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 * 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 ? entries.length : 0;\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}\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  return this.has(key) && delete this.__data__[key];\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  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 ? entries.length : 0;\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}\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  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    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 ? entries.length : 0;\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.__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  return getMapData(this, key)['delete'](key);\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  getMapData(this, key).set(key, value);\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 *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values ? values.length : 0;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\n/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\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 methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\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) || isHostObject(value)) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\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  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] = array;\n    return apply(func, this, otherArgs);\n  };\n}\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\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 * 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 * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to process.\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 * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order of result values is determined by the\n * order they occur in the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\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 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 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  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\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 && (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 && typeof value == 'object';\n}\n\nmodule.exports = intersection;\n"],"names":["HASH_UNDEFINED","MAX_SAFE_INTEGER","funcTag","genTag","reRegExpChar","reIsHostCtor","freeGlobal","global","freeSelf","root","apply","func","thisArg","args","arrayIncludes","array","value","length","baseIndexOf","arrayMap","iteratee","index","result","baseFindIndex","predicate","fromIndex","fromRight","baseIsNaN","cacheHas","cache","key","getValue","object","isHostObject","arrayProto","funcProto","objectProto","coreJsData","maskSrcKey","uid","funcToString","hasOwnProperty","objectToString","reIsNative","splice","nativeMax","nativeMin","Map","getNative","nativeCreate","Hash","entries","entry","hashClear","hashDelete","hashGet","data","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","lastIndex","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","SetCache","values","setCacheAdd","setCacheHas","eq","baseIntersection","arrays","comparator","includes","othLength","othIndex","caches","maxLength","seen","outer","computed","baseIsNative","isObject","isMasked","pattern","isFunction","toSource","baseRest","start","otherArgs","castArrayLikeObject","isArrayLikeObject","map","isKeyable","type","intersection","mapped","other","isArrayLike","isLength","isObjectLike","tag","lodash_intersection"],"mappings":";;;;;AAUA,MAAIA,IAAiB,6BAGjBC,IAAmB,kBAGnBC,IAAU,qBACVC,IAAS,8BAMTC,IAAe,uBAGfC,IAAe,+BAGfC,IAAa,OAAOC,KAAU,YAAYA,KAAUA,EAAO,WAAW,UAAUA,GAGhFC,IAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU,MAGxEC,IAAOH,KAAcE,KAAY,SAAS,aAAa,EAAC;AAY5D,WAASE,EAAMC,GAAMC,GAASC,GAAM;AAClC,YAAQA,EAAK,QAAM;AAAA,MACjB,KAAK;AAAG,eAAOF,EAAK,KAAKC,CAAO;AAAA,MAChC,KAAK;AAAG,eAAOD,EAAK,KAAKC,GAASC,EAAK,CAAC,CAAC;AAAA,MACzC,KAAK;AAAG,eAAOF,EAAK,KAAKC,GAASC,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,MAClD,KAAK;AAAG,eAAOF,EAAK,KAAKC,GAASC,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IAC/D;AACE,WAAOF,EAAK,MAAMC,GAASC,CAAI;AAAA,EACjC;AAWA,WAASC,EAAcC,GAAOC,GAAO;AACnC,QAAIC,IAASF,IAAQA,EAAM,SAAS;AACpC,WAAO,CAAC,CAACE,KAAUC,EAAYH,GAAOC,GAAO,CAAC,IAAI;AAAA,EACpD;AAgCA,WAASG,EAASJ,GAAOK,GAAU;AAKjC,aAJIC,IAAQ,IACRJ,IAASF,IAAQA,EAAM,SAAS,GAChCO,IAAS,MAAML,CAAM,GAElB,EAAEI,IAAQJ;AACf,MAAAK,EAAOD,CAAK,IAAID,EAASL,EAAMM,CAAK,GAAGA,GAAON,CAAK;AAErD,WAAOO;AAAA,EACT;AAaA,WAASC,EAAcR,GAAOS,GAAWC,GAAWC,GAAW;AAI7D,aAHIT,IAASF,EAAM,QACfM,IAAQI,IAA6B,IAEX,EAAEJ,IAAQJ;AACtC,UAAIO,EAAUT,EAAMM,CAAK,GAAGA,GAAON,CAAK;AACtC,eAAOM;AAGX,WAAO;AAAA,EACT;AAWA,WAASH,EAAYH,GAAOC,GAAOS,GAAW;AAC5C,QAAIT,MAAUA;AACZ,aAAOO,EAAcR,GAAOY,GAAWF,CAAS;AAKlD,aAHIJ,IAAQI,IAAY,GACpBR,IAASF,EAAM,QAEZ,EAAEM,IAAQJ;AACf,UAAIF,EAAMM,CAAK,MAAML;AACnB,eAAOK;AAGX,WAAO;AAAA,EACT;AASA,WAASM,EAAUX,GAAO;AACxB,WAAOA,MAAUA;AAAA,EACnB;AAuBA,WAASY,EAASC,GAAOC,GAAK;AAC5B,WAAOD,EAAM,IAAIC,CAAG;AAAA,EACtB;AAUA,WAASC,EAASC,GAAQF,GAAK;AAC7B,WAAoCE,IAAOF,CAAG;AAAA,EAChD;AASA,WAASG,EAAajB,GAAO;AAG3B,QAAIM,IAAS;AACb,QAAIN,KAAS,QAAQ,OAAOA,EAAM,YAAY;AAC5C,UAAI;AACF,QAAAM,IAAS,CAAC,EAAEN,IAAQ;AAAA,MAC1B,QAAgB;AAAA,MAAA;AAEd,WAAOM;AAAA,EACT;AAGA,MAAIY,IAAa,MAAM,WACnBC,KAAY,SAAS,WACrBC,IAAc,OAAO,WAGrBC,IAAa5B,EAAK,oBAAoB,GAGtC6B,KAAc,WAAW;AAC3B,QAAIC,IAAM,SAAS,KAAKF,KAAcA,EAAW,QAAQA,EAAW,KAAK,YAAY,EAAE;AACvF,WAAOE,IAAO,mBAAmBA,IAAO;AAAA,EAC1C,MAGIC,IAAeL,GAAU,UAGzBM,IAAiBL,EAAY,gBAO7BM,KAAiBN,EAAY,UAG7BO,KAAa;AAAA,IAAO,MACtBH,EAAa,KAAKC,CAAc,EAAE,QAAQrC,GAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAAA,KAI5EwC,KAASV,EAAW,QAGpBW,IAAY,KAAK,KACjBC,KAAY,KAAK,KAGjBC,KAAMC,EAAUvC,GAAM,KAAK,GAC3BwC,IAAeD,EAAU,QAAQ,QAAQ;AAS7C,WAASE,EAAKC,GAAS;AACrB,QAAI9B,IAAQ,IACRJ,IAASkC,IAAUA,EAAQ,SAAS;AAGxC,SADA,KAAK,MAAK,GACH,EAAE9B,IAAQJ,KAAQ;AACvB,UAAImC,IAAQD,EAAQ9B,CAAK;AACzB,WAAK,IAAI+B,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IAC/B;AAAA,EACA;AASA,WAASC,KAAY;AACnB,SAAK,WAAWJ,IAAeA,EAAa,IAAI,IAAI,CAAA;AAAA,EACtD;AAYA,WAASK,GAAWxB,GAAK;AACvB,WAAO,KAAK,IAAIA,CAAG,KAAK,OAAO,KAAK,SAASA,CAAG;AAAA,EAClD;AAWA,WAASyB,GAAQzB,GAAK;AACpB,QAAI0B,IAAO,KAAK;AAChB,QAAIP,GAAc;AAChB,UAAI3B,IAASkC,EAAK1B,CAAG;AACrB,aAAOR,MAAWtB,IAAiB,SAAYsB;AAAA,IACnD;AACE,WAAOmB,EAAe,KAAKe,GAAM1B,CAAG,IAAI0B,EAAK1B,CAAG,IAAI;AAAA,EACtD;AAWA,WAAS2B,GAAQ3B,GAAK;AACpB,QAAI0B,IAAO,KAAK;AAChB,WAAOP,IAAeO,EAAK1B,CAAG,MAAM,SAAYW,EAAe,KAAKe,GAAM1B,CAAG;AAAA,EAC/E;AAYA,WAAS4B,GAAQ5B,GAAKd,GAAO;AAC3B,QAAIwC,IAAO,KAAK;AAChB,WAAAA,EAAK1B,CAAG,IAAKmB,KAAgBjC,MAAU,SAAahB,IAAiBgB,GAC9D;AAAA,EACT;AAGA,EAAAkC,EAAK,UAAU,QAAQG,IACvBH,EAAK,UAAU,SAAYI,IAC3BJ,EAAK,UAAU,MAAMK,IACrBL,EAAK,UAAU,MAAMO,IACrBP,EAAK,UAAU,MAAMQ;AASrB,WAASC,EAAUR,GAAS;AAC1B,QAAI9B,IAAQ,IACRJ,IAASkC,IAAUA,EAAQ,SAAS;AAGxC,SADA,KAAK,MAAK,GACH,EAAE9B,IAAQJ,KAAQ;AACvB,UAAImC,IAAQD,EAAQ9B,CAAK;AACzB,WAAK,IAAI+B,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IAC/B;AAAA,EACA;AASA,WAASQ,KAAiB;AACxB,SAAK,WAAW,CAAA;AAAA,EAClB;AAWA,WAASC,GAAgB/B,GAAK;AAC5B,QAAI0B,IAAO,KAAK,UACZnC,IAAQyC,EAAaN,GAAM1B,CAAG;AAElC,QAAIT,IAAQ;AACV,aAAO;AAET,QAAI0C,IAAYP,EAAK,SAAS;AAC9B,WAAInC,KAAS0C,IACXP,EAAK,IAAG,IAERZ,GAAO,KAAKY,GAAMnC,GAAO,CAAC,GAErB;AAAA,EACT;AAWA,WAAS2C,GAAalC,GAAK;AACzB,QAAI0B,IAAO,KAAK,UACZnC,IAAQyC,EAAaN,GAAM1B,CAAG;AAElC,WAAOT,IAAQ,IAAI,SAAYmC,EAAKnC,CAAK,EAAE,CAAC;AAAA,EAC9C;AAWA,WAAS4C,GAAanC,GAAK;AACzB,WAAOgC,EAAa,KAAK,UAAUhC,CAAG,IAAI;AAAA,EAC5C;AAYA,WAASoC,GAAapC,GAAKd,GAAO;AAChC,QAAIwC,IAAO,KAAK,UACZnC,IAAQyC,EAAaN,GAAM1B,CAAG;AAElC,WAAIT,IAAQ,IACVmC,EAAK,KAAK,CAAC1B,GAAKd,CAAK,CAAC,IAEtBwC,EAAKnC,CAAK,EAAE,CAAC,IAAIL,GAEZ;AAAA,EACT;AAGA,EAAA2C,EAAU,UAAU,QAAQC,IAC5BD,EAAU,UAAU,SAAYE,IAChCF,EAAU,UAAU,MAAMK,IAC1BL,EAAU,UAAU,MAAMM,IAC1BN,EAAU,UAAU,MAAMO;AAS1B,WAASC,EAAShB,GAAS;AACzB,QAAI9B,IAAQ,IACRJ,IAASkC,IAAUA,EAAQ,SAAS;AAGxC,SADA,KAAK,MAAK,GACH,EAAE9B,IAAQJ,KAAQ;AACvB,UAAImC,IAAQD,EAAQ9B,CAAK;AACzB,WAAK,IAAI+B,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IAC/B;AAAA,EACA;AASA,WAASgB,KAAgB;AACvB,SAAK,WAAW;AAAA,MACd,MAAQ,IAAIlB;AAAA,MACZ,KAAO,KAAKH,MAAOY;AAAA,MACnB,QAAU,IAAIT;AAAA;EAElB;AAWA,WAASmB,GAAevC,GAAK;AAC3B,WAAOwC,EAAW,MAAMxC,CAAG,EAAE,OAAUA,CAAG;AAAA,EAC5C;AAWA,WAASyC,GAAYzC,GAAK;AACxB,WAAOwC,EAAW,MAAMxC,CAAG,EAAE,IAAIA,CAAG;AAAA,EACtC;AAWA,WAAS0C,GAAY1C,GAAK;AACxB,WAAOwC,EAAW,MAAMxC,CAAG,EAAE,IAAIA,CAAG;AAAA,EACtC;AAYA,WAAS2C,GAAY3C,GAAKd,GAAO;AAC/B,WAAAsD,EAAW,MAAMxC,CAAG,EAAE,IAAIA,GAAKd,CAAK,GAC7B;AAAA,EACT;AAGA,EAAAmD,EAAS,UAAU,QAAQC,IAC3BD,EAAS,UAAU,SAAYE,IAC/BF,EAAS,UAAU,MAAMI,IACzBJ,EAAS,UAAU,MAAMK,IACzBL,EAAS,UAAU,MAAMM;AAUzB,WAASC,EAASC,GAAQ;AACxB,QAAItD,IAAQ,IACRJ,IAAS0D,IAASA,EAAO,SAAS;AAGtC,SADA,KAAK,WAAW,IAAIR,KACb,EAAE9C,IAAQJ;AACf,WAAK,IAAI0D,EAAOtD,CAAK,CAAC;AAAA,EAE1B;AAYA,WAASuD,GAAY5D,GAAO;AAC1B,gBAAK,SAAS,IAAIA,GAAOhB,CAAc,GAChC;AAAA,EACT;AAWA,WAAS6E,GAAY7D,GAAO;AAC1B,WAAO,KAAK,SAAS,IAAIA,CAAK;AAAA,EAChC;AAGA,EAAA0D,EAAS,UAAU,MAAMA,EAAS,UAAU,OAAOE,IACnDF,EAAS,UAAU,MAAMG;AAUzB,WAASf,EAAa/C,GAAOe,GAAK;AAEhC,aADIb,IAASF,EAAM,QACZE;AACL,UAAI6D,GAAG/D,EAAME,CAAM,EAAE,CAAC,GAAGa,CAAG;AAC1B,eAAOb;AAGX,WAAO;AAAA,EACT;AAYA,WAAS8D,GAAiBC,GAAQ5D,GAAU6D,GAAY;AAStD,aARIC,IAA4CpE,GAC5CG,IAAS+D,EAAO,CAAC,EAAE,QACnBG,IAAYH,EAAO,QACnBI,IAAWD,GACXE,IAAS,MAAMF,CAAS,GACxBG,IAAY,OACZhE,IAAS,CAAA,GAEN8D,OAAY;AACjB,UAAIrE,IAAQiE,EAAOI,CAAQ;AAI3B,MAAAE,IAAYxC,GAAU/B,EAAM,QAAQuE,CAAS,GAC7CD,EAAOD,CAAQ,IAAiCnE,KAAU,OAAOF,EAAM,UAAU,MAC7E,IAAI2D,EAASU,KAAYrE,CAAK,IAC9B;AAAA,IACR;AACE,IAAAA,IAAQiE,EAAO,CAAC;AAEhB,QAAI3D,IAAQ,IACRkE,IAAOF,EAAO,CAAC;AAEnB,IAAAG;AACA,aAAO,EAAEnE,IAAQJ,KAAUK,EAAO,SAASgE,KAAW;AACpD,YAAItE,IAAQD,EAAMM,CAAK,GACnBoE,IAAwCzE;AAG5C,YADAA,IAAuBA,MAAU,IAAKA,IAAQ,GAC1C,EAAEuE,IACE3D,EAAS2D,GAAME,CAAQ,IACvBP,EAAS5D,GAAQmE,CAAoB,IACtC;AAEL,eADAL,IAAWD,GACJ,EAAEC,KAAU;AACjB,gBAAIvD,IAAQwD,EAAOD,CAAQ;AAC3B,gBAAI,EAAEvD,IACED,EAASC,GAAO4D,CAAQ,IACxBP,EAASF,EAAOI,CAAQ,GAAGK,CAAoB;AAErD,uBAASD;AAAA,UAEnB;AACM,UAAID,KACFA,EAAK,KAAKE,CAAQ,GAEpBnE,EAAO,KAAKN,CAAK;AAAA,QACvB;AAAA,MACA;AACE,WAAOM;AAAA,EACT;AAUA,WAASoE,GAAa1E,GAAO;AAC3B,QAAI,CAAC2E,EAAS3E,CAAK,KAAK4E,GAAS5E,CAAK;AACpC,aAAO;AAET,QAAI6E,IAAWC,EAAW9E,CAAK,KAAKiB,EAAajB,CAAK,IAAK2B,KAAatC;AACxE,WAAOwF,EAAQ,KAAKE,GAAS/E,CAAK,CAAC;AAAA,EACrC;AAUA,WAASgF,GAASrF,GAAMsF,GAAO;AAC7B,WAAAA,IAAQpD,EAAUoD,MAAU,SAAatF,EAAK,SAAS,IAAKsF,GAAO,CAAC,GAC7D,WAAW;AAMhB,eALIpF,IAAO,WACPQ,IAAQ,IACRJ,IAAS4B,EAAUhC,EAAK,SAASoF,GAAO,CAAC,GACzClF,IAAQ,MAAME,CAAM,GAEjB,EAAEI,IAAQJ;AACf,QAAAF,EAAMM,CAAK,IAAIR,EAAKoF,IAAQ5E,CAAK;AAEnC,MAAAA,IAAQ;AAER,eADI6E,IAAY,MAAMD,IAAQ,CAAC,GACxB,EAAE5E,IAAQ4E;AACf,QAAAC,EAAU7E,CAAK,IAAIR,EAAKQ,CAAK;AAE/B,aAAA6E,EAAUD,CAAK,IAAIlF,GACZL,EAAMC,GAAM,MAAMuF,CAAS;AAAA,IACtC;AAAA,EACA;AASA,WAASC,GAAoBnF,GAAO;AAClC,WAAOoF,GAAkBpF,CAAK,IAAIA,IAAQ,CAAA;AAAA,EAC5C;AAUA,WAASsD,EAAW+B,GAAKvE,GAAK;AAC5B,QAAI0B,IAAO6C,EAAI;AACf,WAAOC,GAAUxE,CAAG,IAChB0B,EAAK,OAAO1B,KAAO,WAAW,WAAW,MAAM,IAC/C0B,EAAK;AAAA,EACX;AAUA,WAASR,EAAUhB,GAAQF,GAAK;AAC9B,QAAId,IAAQe,EAASC,GAAQF,CAAG;AAChC,WAAO4D,GAAa1E,CAAK,IAAIA,IAAQ;AAAA,EACvC;AASA,WAASsF,GAAUtF,GAAO;AACxB,QAAIuF,IAAO,OAAOvF;AAClB,WAAQuF,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YACvEvF,MAAU,cACVA,MAAU;AAAA,EACjB;AASA,WAAS4E,GAASjF,GAAM;AACtB,WAAO,CAAC,CAAC2B,KAAeA,KAAc3B;AAAA,EACxC;AASA,WAASoF,GAASpF,GAAM;AACtB,QAAIA,KAAQ,MAAM;AAChB,UAAI;AACF,eAAO6B,EAAa,KAAK7B,CAAI;AAAA,MACnC,QAAgB;AAAA,MAAA;AACZ,UAAI;AACF,eAAQA,IAAO;AAAA,MACrB,QAAgB;AAAA,MAAA;AAAA,IAChB;AACE,WAAO;AAAA,EACT;AAmBA,MAAI6F,KAAeR,GAAS,SAAShB,GAAQ;AAC3C,QAAIyB,IAAStF,EAAS6D,GAAQmB,EAAmB;AACjD,WAAQM,EAAO,UAAUA,EAAO,CAAC,MAAMzB,EAAO,CAAC,IAC3CD,GAAiB0B,CAAM,IACvB,CAAA;AAAA,EACN,CAAC;AAkCD,WAAS3B,GAAG9D,GAAO0F,GAAO;AACxB,WAAO1F,MAAU0F,KAAU1F,MAAUA,KAAS0F,MAAUA;AAAA,EAC1D;AA2BA,WAASC,GAAY3F,GAAO;AAC1B,WAAOA,KAAS,QAAQ4F,GAAS5F,EAAM,MAAM,KAAK,CAAC8E,EAAW9E,CAAK;AAAA,EACrE;AA2BA,WAASoF,GAAkBpF,GAAO;AAChC,WAAO6F,GAAa7F,CAAK,KAAK2F,GAAY3F,CAAK;AAAA,EACjD;AAmBA,WAAS8E,EAAW9E,GAAO;AAGzB,QAAI8F,IAAMnB,EAAS3E,CAAK,IAAI0B,GAAe,KAAK1B,CAAK,IAAI;AACzD,WAAO8F,KAAO5G,KAAW4G,KAAO3G;AAAA,EAClC;AA4BA,WAASyG,GAAS5F,GAAO;AACvB,WAAO,OAAOA,KAAS,YACrBA,IAAQ,MAAMA,IAAQ,KAAK,KAAKA,KAASf;AAAA,EAC7C;AA2BA,WAAS0F,EAAS3E,GAAO;AACvB,QAAIuF,IAAO,OAAOvF;AAClB,WAAO,CAAC,CAACA,MAAUuF,KAAQ,YAAYA,KAAQ;AAAA,EACjD;AA0BA,WAASM,GAAa7F,GAAO;AAC3B,WAAO,CAAC,CAACA,KAAS,OAAOA,KAAS;AAAA,EACpC;AAEA,SAAA+F,IAAiBP;;;;","x_google_ignoreList":[0]}

package/dist/index-Bwrro8-q.js

@@ -1,35 +0,0 @@
-import { g as l } from "./_commonjsHelpers-ByX85dGu.js";
-var o, c;
-function a() {
-  return c || (c = 1, o = function n(r, t) {
-    if (r === t) return !0;
-    if (r && t && typeof r == "object" && typeof t == "object") {
-      if (r.constructor !== t.constructor) return !1;
-      var u, e, f;
-      if (Array.isArray(r)) {
-        if (u = r.length, u != t.length) return !1;
-        for (e = u; e-- !== 0; )
-          if (!n(r[e], t[e])) return !1;
-        return !0;
-      }
-      if (r.constructor === RegExp) return r.source === t.source && r.flags === t.flags;
-      if (r.valueOf !== Object.prototype.valueOf) return r.valueOf() === t.valueOf();
-      if (r.toString !== Object.prototype.toString) return r.toString() === t.toString();
-      if (f = Object.keys(r), u = f.length, u !== Object.keys(t).length) return !1;
-      for (e = u; e-- !== 0; )
-        if (!Object.prototype.hasOwnProperty.call(t, f[e])) return !1;
-      for (e = u; e-- !== 0; ) {
-        var s = f[e];
-        if (!n(r[s], t[s])) return !1;
-      }
-      return !0;
-    }
-    return r !== r && t !== t;
-  }), o;
-}
-var p = a();
-const O = /* @__PURE__ */ l(p);
-export {
-  O as i
-};
-//# sourceMappingURL=index-Bwrro8-q.js.map

package/dist/index-Bwrro8-q.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-Bwrro8-q.js","sources":["../node_modules/fast-deep-equal/index.js"],"sourcesContent":["'use strict';\n\n// do not edit .js files directly - edit src/index.jst\n\n\n\nmodule.exports = function equal(a, b) {\n  if (a === b) return true;\n\n  if (a && b && typeof a == 'object' && typeof b == 'object') {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0;)\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0;) {\n      var key = keys[i];\n\n      if (!equal(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a!==a && b!==b;\n};\n"],"names":["fastDeepEqual","equal","a","b","length","i","keys","key"],"mappings":";;;sBAMAA,IAAiB,SAASC,EAAMC,GAAGC,GAAG;AACpC,QAAID,MAAMC,EAAG,QAAO;AAEpB,QAAID,KAAKC,KAAK,OAAOD,KAAK,YAAY,OAAOC,KAAK,UAAU;AAC1D,UAAID,EAAE,gBAAgBC,EAAE,YAAa,QAAO;AAE5C,UAAIC,GAAQC,GAAGC;AACf,UAAI,MAAM,QAAQJ,CAAC,GAAG;AAEpB,YADAE,IAASF,EAAE,QACPE,KAAUD,EAAE,OAAQ,QAAO;AAC/B,aAAKE,IAAID,GAAQC,QAAQ;AACvB,cAAI,CAACJ,EAAMC,EAAEG,CAAC,GAAGF,EAAEE,CAAC,CAAC,EAAG,QAAO;AACjC,eAAO;AAAA,MACb;AAII,UAAIH,EAAE,gBAAgB,OAAQ,QAAOA,EAAE,WAAWC,EAAE,UAAUD,EAAE,UAAUC,EAAE;AAC5E,UAAID,EAAE,YAAY,OAAO,UAAU,QAAS,QAAOA,EAAE,QAAO,MAAOC,EAAE,QAAO;AAC5E,UAAID,EAAE,aAAa,OAAO,UAAU,SAAU,QAAOA,EAAE,SAAQ,MAAOC,EAAE,SAAQ;AAIhF,UAFAG,IAAO,OAAO,KAAKJ,CAAC,GACpBE,IAASE,EAAK,QACVF,MAAW,OAAO,KAAKD,CAAC,EAAE,OAAQ,QAAO;AAE7C,WAAKE,IAAID,GAAQC,QAAQ;AACvB,YAAI,CAAC,OAAO,UAAU,eAAe,KAAKF,GAAGG,EAAKD,CAAC,CAAC,EAAG,QAAO;AAEhE,WAAKA,IAAID,GAAQC,QAAQ,KAAI;AAC3B,YAAIE,IAAMD,EAAKD,CAAC;AAEhB,YAAI,CAACJ,EAAMC,EAAEK,CAAG,GAAGJ,EAAEI,CAAG,CAAC,EAAG,QAAO;AAAA,MACzC;AAEI,aAAO;AAAA,IACX;AAGE,WAAOL,MAAIA,KAAKC,MAAIA;AAAA,EACtB;;;;","x_google_ignoreList":[0]}

package/dist/index-C5K--w8d.cjs

@@ -1,2 +0,0 @@
-"use strict";const Xr=require("./_commonjsHelpers-BH3jXuIh.cjs");var Cr=63710088e-1;function Yr(l,c,s={}){const f={type:"Feature"};return(s.id===0||s.id)&&(f.id=s.id),s.bbox&&(f.bbox=s.bbox),f.properties=c||{},f.geometry=l,f}function hr(l,c,s={}){if(!l)throw new Error("coordinates is required");if(!Array.isArray(l))throw new Error("coordinates must be an Array");if(l.length<2)throw new Error("coordinates must be at least 2 numbers long");if(!mr(l[0])||!mr(l[1]))throw new Error("coordinates must contain numbers");return Yr({type:"Point",coordinates:l},c,s)}function Sr(l,c,s={}){for(const g of l){if(g.length<4)throw new Error("Each LinearRing of a Polygon must have 4 or more Positions.");if(g[g.length-1].length!==g[0].length)throw new Error("First and last Position are not equivalent.");for(let v=0;v<g[g.length-1].length;v++)if(g[g.length-1][v]!==g[0][v])throw new Error("First and last Position are not equivalent.")}return Yr({type:"Polygon",coordinates:l},c,s)}function mr(l){return!isNaN(l)&&l!==null&&!Array.isArray(l)}function ir(l,c,s){if(l!==null)for(var f,g,v,Y,B,X,E,C=0,F=0,A,L=l.type,w=L==="FeatureCollection",q=L==="Feature",$=w?l.features.length:1,H=0;H<$;H++){E=w?l.features[H].geometry:q?l.geometry:l,A=E?E.type==="GeometryCollection":!1,B=A?E.geometries.length:1;for(var t=0;t<B;t++){var i=0,r=0;if(Y=A?E.geometries[t]:E,Y!==null){X=Y.coordinates;var e=Y.type;switch(C=s&&(e==="Polygon"||e==="MultiPolygon")?1:0,e){case null:break;case"Point":if(c(X,F,H,i,r)===!1)return!1;F++,i++;break;case"LineString":case"MultiPoint":for(f=0;f<X.length;f++){if(c(X[f],F,H,i,r)===!1)return!1;F++,e==="MultiPoint"&&i++}e==="LineString"&&i++;break;case"Polygon":case"MultiLineString":for(f=0;f<X.length;f++){for(g=0;g<X[f].length-C;g++){if(c(X[f][g],F,H,i,r)===!1)return!1;F++}e==="MultiLineString"&&i++,e==="Polygon"&&r++}e==="Polygon"&&i++;break;case"MultiPolygon":for(f=0;f<X.length;f++){for(r=0,g=0;g<X[f].length;g++){for(v=0;v<X[f][g].length-C;v++){if(c(X[f][g][v],F,H,i,r)===!1)return!1;F++}r++}i++}break;case"GeometryCollection":for(f=0;f<Y.geometries.length;f++)if(ir(Y.geometries[f],c,s)===!1)return!1;break;default:throw new Error("Unknown Geometry Type")}}}}}function qr(l,c){var s,f,g,v,Y,B,X,E,C,F,A=0,L=l.type==="FeatureCollection",w=l.type==="Feature",q=L?l.features.length:1;for(s=0;s<q;s++){for(B=L?l.features[s].geometry:w?l.geometry:l,E=L?l.features[s].properties:w?l.properties:{},C=L?l.features[s].bbox:w?l.bbox:void 0,F=L?l.features[s].id:w?l.id:void 0,X=B?B.type==="GeometryCollection":!1,Y=X?B.geometries.length:1,g=0;g<Y;g++){if(v=X?B.geometries[g]:B,v===null){if(c(null,A,E,C,F)===!1)return!1;continue}switch(v.type){case"Point":case"LineString":case"MultiPoint":case"Polygon":case"MultiLineString":case"MultiPolygon":{if(c(v,A,E,C,F)===!1)return!1;break}case"GeometryCollection":{for(f=0;f<v.geometries.length;f++)if(c(v.geometries[f],A,E,C,F)===!1)return!1;break}default:throw new Error("Unknown Geometry Type")}}A++}}function Ar(l,c,s){var f=s;return qr(l,function(g,v,Y,B,X){v===0&&s===void 0?f=g:f=c(f,g,v,Y,B,X)}),f}var ar={exports:{}},or={exports:{}},Rr=or.exports,vr;function Nr(){return vr||(vr=1,(function(l,c){(function(s,f){l.exports=f()})(Rr,function(){function s(t,i,r,e,n){(function a(o,u,h,m,d){for(;m>h;){if(m-h>600){var M=m-h+1,S=u-h+1,z=Math.log(M),_=.5*Math.exp(2*z/3),R=.5*Math.sqrt(z*_*(M-_)/M)*(S-M/2<0?-1:1),N=Math.max(h,Math.floor(u-S*_/M+R)),k=Math.min(m,Math.floor(u+(M-S)*_/M+R));a(o,u,N,k,d)}var p=o[u],y=h,x=m;for(f(o,h,u),d(o[m],p)>0&&f(o,h,m);y<x;){for(f(o,y,x),y++,x--;d(o[y],p)<0;)y++;for(;d(o[x],p)>0;)x--}d(o[h],p)===0?f(o,h,x):f(o,++x,m),x<=u&&(h=x+1),u<=x&&(m=x-1)}})(t,i,r||0,e||t.length-1,n||g)}function f(t,i,r){var e=t[i];t[i]=t[r],t[r]=e}function g(t,i){return t<i?-1:t>i?1:0}var v=function(t){t===void 0&&(t=9),this._maxEntries=Math.max(4,t),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function Y(t,i,r){if(!r)return i.indexOf(t);for(var e=0;e<i.length;e++)if(r(t,i[e]))return e;return-1}function B(t,i){X(t,0,t.children.length,i,t)}function X(t,i,r,e,n){n||(n=$(null)),n.minX=1/0,n.minY=1/0,n.maxX=-1/0,n.maxY=-1/0;for(var a=i;a<r;a++){var o=t.children[a];E(n,t.leaf?e(o):o)}return n}function E(t,i){return t.minX=Math.min(t.minX,i.minX),t.minY=Math.min(t.minY,i.minY),t.maxX=Math.max(t.maxX,i.maxX),t.maxY=Math.max(t.maxY,i.maxY),t}function C(t,i){return t.minX-i.minX}function F(t,i){return t.minY-i.minY}function A(t){return(t.maxX-t.minX)*(t.maxY-t.minY)}function L(t){return t.maxX-t.minX+(t.maxY-t.minY)}function w(t,i){return t.minX<=i.minX&&t.minY<=i.minY&&i.maxX<=t.maxX&&i.maxY<=t.maxY}function q(t,i){return i.minX<=t.maxX&&i.minY<=t.maxY&&i.maxX>=t.minX&&i.maxY>=t.minY}function $(t){return{children:t,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function H(t,i,r,e,n){for(var a=[i,r];a.length;)if(!((r=a.pop())-(i=a.pop())<=e)){var o=i+Math.ceil((r-i)/e/2)*e;s(t,o,i,r,n),a.push(i,o,o,r)}}return v.prototype.all=function(){return this._all(this.data,[])},v.prototype.search=function(t){var i=this.data,r=[];if(!q(t,i))return r;for(var e=this.toBBox,n=[];i;){for(var a=0;a<i.children.length;a++){var o=i.children[a],u=i.leaf?e(o):o;q(t,u)&&(i.leaf?r.push(o):w(t,u)?this._all(o,r):n.push(o))}i=n.pop()}return r},v.prototype.collides=function(t){var i=this.data;if(!q(t,i))return!1;for(var r=[];i;){for(var e=0;e<i.children.length;e++){var n=i.children[e],a=i.leaf?this.toBBox(n):n;if(q(t,a)){if(i.leaf||w(t,a))return!0;r.push(n)}}i=r.pop()}return!1},v.prototype.load=function(t){if(!t||!t.length)return this;if(t.length<this._minEntries){for(var i=0;i<t.length;i++)this.insert(t[i]);return this}var r=this._build(t.slice(),0,t.length-1,0);if(this.data.children.length)if(this.data.height===r.height)this._splitRoot(this.data,r);else{if(this.data.height<r.height){var e=this.data;this.data=r,r=e}this._insert(r,this.data.height-r.height-1,!0)}else this.data=r;return this},v.prototype.insert=function(t){return t&&this._insert(t,this.data.height-1),this},v.prototype.clear=function(){return this.data=$([]),this},v.prototype.remove=function(t,i){if(!t)return this;for(var r,e,n,a=this.data,o=this.toBBox(t),u=[],h=[];a||u.length;){if(a||(a=u.pop(),e=u[u.length-1],r=h.pop(),n=!0),a.leaf){var m=Y(t,a.children,i);if(m!==-1)return a.children.splice(m,1),u.push(a),this._condense(u),this}n||a.leaf||!w(a,o)?e?(r++,a=e.children[r],n=!1):a=null:(u.push(a),h.push(r),r=0,e=a,a=a.children[0])}return this},v.prototype.toBBox=function(t){return t},v.prototype.compareMinX=function(t,i){return t.minX-i.minX},v.prototype.compareMinY=function(t,i){return t.minY-i.minY},v.prototype.toJSON=function(){return this.data},v.prototype.fromJSON=function(t){return this.data=t,this},v.prototype._all=function(t,i){for(var r=[];t;)t.leaf?i.push.apply(i,t.children):r.push.apply(r,t.children),t=r.pop();return i},v.prototype._build=function(t,i,r,e){var n,a=r-i+1,o=this._maxEntries;if(a<=o)return B(n=$(t.slice(i,r+1)),this.toBBox),n;e||(e=Math.ceil(Math.log(a)/Math.log(o)),o=Math.ceil(a/Math.pow(o,e-1))),(n=$([])).leaf=!1,n.height=e;var u=Math.ceil(a/o),h=u*Math.ceil(Math.sqrt(o));H(t,i,r,h,this.compareMinX);for(var m=i;m<=r;m+=h){var d=Math.min(m+h-1,r);H(t,m,d,u,this.compareMinY);for(var M=m;M<=d;M+=u){var S=Math.min(M+u-1,d);n.children.push(this._build(t,M,S,e-1))}}return B(n,this.toBBox),n},v.prototype._chooseSubtree=function(t,i,r,e){for(;e.push(i),!i.leaf&&e.length-1!==r;){for(var n=1/0,a=1/0,o=void 0,u=0;u<i.children.length;u++){var h=i.children[u],m=A(h),d=(M=t,S=h,(Math.max(S.maxX,M.maxX)-Math.min(S.minX,M.minX))*(Math.max(S.maxY,M.maxY)-Math.min(S.minY,M.minY))-m);d<a?(a=d,n=m<n?m:n,o=h):d===a&&m<n&&(n=m,o=h)}i=o||i.children[0]}var M,S;return i},v.prototype._insert=function(t,i,r){var e=r?t:this.toBBox(t),n=[],a=this._chooseSubtree(e,this.data,i,n);for(a.children.push(t),E(a,e);i>=0&&n[i].children.length>this._maxEntries;)this._split(n,i),i--;this._adjustParentBBoxes(e,n,i)},v.prototype._split=function(t,i){var r=t[i],e=r.children.length,n=this._minEntries;this._chooseSplitAxis(r,n,e);var a=this._chooseSplitIndex(r,n,e),o=$(r.children.splice(a,r.children.length-a));o.height=r.height,o.leaf=r.leaf,B(r,this.toBBox),B(o,this.toBBox),i?t[i-1].children.push(o):this._splitRoot(r,o)},v.prototype._splitRoot=function(t,i){this.data=$([t,i]),this.data.height=t.height+1,this.data.leaf=!1,B(this.data,this.toBBox)},v.prototype._chooseSplitIndex=function(t,i,r){for(var e,n,a,o,u,h,m,d=1/0,M=1/0,S=i;S<=r-i;S++){var z=X(t,0,S,this.toBBox),_=X(t,S,r,this.toBBox),R=(n=z,a=_,o=void 0,u=void 0,h=void 0,m=void 0,o=Math.max(n.minX,a.minX),u=Math.max(n.minY,a.minY),h=Math.min(n.maxX,a.maxX),m=Math.min(n.maxY,a.maxY),Math.max(0,h-o)*Math.max(0,m-u)),N=A(z)+A(_);R<d?(d=R,e=S,M=N<M?N:M):R===d&&N<M&&(M=N,e=S)}return e||r-i},v.prototype._chooseSplitAxis=function(t,i,r){var e=t.leaf?this.compareMinX:C,n=t.leaf?this.compareMinY:F;this._allDistMargin(t,i,r,e)<this._allDistMargin(t,i,r,n)&&t.children.sort(e)},v.prototype._allDistMargin=function(t,i,r,e){t.children.sort(e);for(var n=this.toBBox,a=X(t,0,i,n),o=X(t,r-i,r,n),u=L(a)+L(o),h=i;h<r-i;h++){var m=t.children[h];E(a,t.leaf?n(m):m),u+=L(a)}for(var d=r-i-1;d>=i;d--){var M=t.children[d];E(o,t.leaf?n(M):M),u+=L(o)}return u},v.prototype._adjustParentBBoxes=function(t,i,r){for(var e=r;e>=0;e--)E(i[e],t)},v.prototype._condense=function(t){for(var i=t.length-1,r=void 0;i>=0;i--)t[i].children.length===0?i>0?(r=t[i-1].children).splice(r.indexOf(t[i]),1):this.clear():B(t[i],this.toBBox)},v})})(or)),or.exports}class Dr{constructor(c=[],s=Gr){if(this.data=c,this.length=this.data.length,this.compare=s,this.length>0)for(let f=(this.length>>1)-1;f>=0;f--)this._down(f)}push(c){this.data.push(c),this.length++,this._up(this.length-1)}pop(){if(this.length===0)return;const c=this.data[0],s=this.data.pop();return this.length--,this.length>0&&(this.data[0]=s,this._down(0)),c}peek(){return this.data[0]}_up(c){const{data:s,compare:f}=this,g=s[c];for(;c>0;){const v=c-1>>1,Y=s[v];if(f(g,Y)>=0)break;s[c]=Y,c=v}s[c]=g}_down(c){const{data:s,compare:f}=this,g=this.length>>1,v=s[c];for(;c<g;){let Y=(c<<1)+1,B=s[Y];const X=Y+1;if(X<this.length&&f(s[X],B)<0&&(Y=X,B=s[X]),f(B,v)>=0)break;s[c]=B,c=Y}s[c]=v}}function Gr(l,c){return l<c?-1:l>c?1:0}const Fr=Object.freeze(Object.defineProperty({__proto__:null,default:Dr},Symbol.toStringTag,{value:"Module"})),Or=Xr.getAugmentedNamespace(Fr);var tr={exports:{}},fr,pr;function kr(){return pr||(pr=1,fr=function(c,s,f,g){var v=c[0],Y=c[1],B=!1;f===void 0&&(f=0),g===void 0&&(g=s.length);for(var X=(g-f)/2,E=0,C=X-1;E<X;C=E++){var F=s[f+E*2+0],A=s[f+E*2+1],L=s[f+C*2+0],w=s[f+C*2+1],q=A>Y!=w>Y&&v<(L-F)*(Y-A)/(w-A)+F;q&&(B=!B)}return B}),fr}var lr,gr;function Lr(){return gr||(gr=1,lr=function(c,s,f,g){var v=c[0],Y=c[1],B=!1;f===void 0&&(f=0),g===void 0&&(g=s.length);for(var X=g-f,E=0,C=X-1;E<X;C=E++){var F=s[E+f][0],A=s[E+f][1],L=s[C+f][0],w=s[C+f][1],q=A>Y!=w>Y&&v<(L-F)*(Y-A)/(w-A)+F;q&&(B=!B)}return B}),lr}var dr;function $r(){if(dr)return tr.exports;dr=1;var l=kr(),c=Lr();return tr.exports=function(f,g,v,Y){return g.length>0&&Array.isArray(g[0])?c(f,g,v,Y):l(f,g,v,Y)},tr.exports.nested=c,tr.exports.flat=l,tr.exports}var nr={exports:{}},Hr=nr.exports,yr;function Jr(){return yr||(yr=1,(function(l,c){(function(s,f){f(c)})(Hr,function(s){const g=33306690738754706e-32;function v(q,$,H,t,i){let r,e,n,a,o=$[0],u=t[0],h=0,m=0;u>o==u>-o?(r=o,o=$[++h]):(r=u,u=t[++m]);let d=0;if(h<q&&m<H)for(u>o==u>-o?(n=r-((e=o+r)-o),o=$[++h]):(n=r-((e=u+r)-u),u=t[++m]),r=e,n!==0&&(i[d++]=n);h<q&&m<H;)u>o==u>-o?(n=r-((e=r+o)-(a=e-r))+(o-a),o=$[++h]):(n=r-((e=r+u)-(a=e-r))+(u-a),u=t[++m]),r=e,n!==0&&(i[d++]=n);for(;h<q;)n=r-((e=r+o)-(a=e-r))+(o-a),o=$[++h],r=e,n!==0&&(i[d++]=n);for(;m<H;)n=r-((e=r+u)-(a=e-r))+(u-a),u=t[++m],r=e,n!==0&&(i[d++]=n);return r===0&&d!==0||(i[d++]=r),d}function Y(q){return new Float64Array(q)}const B=33306690738754716e-32,X=22204460492503146e-32,E=11093356479670487e-47,C=Y(4),F=Y(8),A=Y(12),L=Y(16),w=Y(4);s.orient2d=function(q,$,H,t,i,r){const e=($-r)*(H-i),n=(q-i)*(t-r),a=e-n;if(e===0||n===0||e>0!=n>0)return a;const o=Math.abs(e+n);return Math.abs(a)>=B*o?a:-(function(u,h,m,d,M,S,z){let _,R,N,k,p,y,x,J,O,D,P,G,U,Q,K,V,j,Z;const W=u-M,T=m-M,I=h-S,b=d-S;p=(K=(J=W-(x=(y=134217729*W)-(y-W)))*(D=b-(O=(y=134217729*b)-(y-b)))-((Q=W*b)-x*O-J*O-x*D))-(P=K-(j=(J=I-(x=(y=134217729*I)-(y-I)))*(D=T-(O=(y=134217729*T)-(y-T)))-((V=I*T)-x*O-J*O-x*D))),C[0]=K-(P+p)+(p-j),p=(U=Q-((G=Q+P)-(p=G-Q))+(P-p))-(P=U-V),C[1]=U-(P+p)+(p-V),p=(Z=G+P)-G,C[2]=G-(Z-p)+(P-p),C[3]=Z;let rr=(function(Er,sr){let cr=sr[0];for(let ur=1;ur<Er;ur++)cr+=sr[ur];return cr})(4,C),er=X*z;if(rr>=er||-rr>=er||(_=u-(W+(p=u-W))+(p-M),N=m-(T+(p=m-T))+(p-M),R=h-(I+(p=h-I))+(p-S),k=d-(b+(p=d-b))+(p-S),_===0&&R===0&&N===0&&k===0)||(er=E*z+g*Math.abs(rr),(rr+=W*k+b*_-(I*N+T*R))>=er||-rr>=er))return rr;p=(K=(J=_-(x=(y=134217729*_)-(y-_)))*(D=b-(O=(y=134217729*b)-(y-b)))-((Q=_*b)-x*O-J*O-x*D))-(P=K-(j=(J=R-(x=(y=134217729*R)-(y-R)))*(D=T-(O=(y=134217729*T)-(y-T)))-((V=R*T)-x*O-J*O-x*D))),w[0]=K-(P+p)+(p-j),p=(U=Q-((G=Q+P)-(p=G-Q))+(P-p))-(P=U-V),w[1]=U-(P+p)+(p-V),p=(Z=G+P)-G,w[2]=G-(Z-p)+(P-p),w[3]=Z;const wr=v(4,C,4,w,F);p=(K=(J=W-(x=(y=134217729*W)-(y-W)))*(D=k-(O=(y=134217729*k)-(y-k)))-((Q=W*k)-x*O-J*O-x*D))-(P=K-(j=(J=I-(x=(y=134217729*I)-(y-I)))*(D=N-(O=(y=134217729*N)-(y-N)))-((V=I*N)-x*O-J*O-x*D))),w[0]=K-(P+p)+(p-j),p=(U=Q-((G=Q+P)-(p=G-Q))+(P-p))-(P=U-V),w[1]=U-(P+p)+(p-V),p=(Z=G+P)-G,w[2]=G-(Z-p)+(P-p),w[3]=Z;const Br=v(wr,F,4,w,A);p=(K=(J=_-(x=(y=134217729*_)-(y-_)))*(D=k-(O=(y=134217729*k)-(y-k)))-((Q=_*k)-x*O-J*O-x*D))-(P=K-(j=(J=R-(x=(y=134217729*R)-(y-R)))*(D=N-(O=(y=134217729*N)-(y-N)))-((V=R*N)-x*O-J*O-x*D))),w[0]=K-(P+p)+(p-j),p=(U=Q-((G=Q+P)-(p=G-Q))+(P-p))-(P=U-V),w[1]=U-(P+p)+(p-V),p=(Z=G+P)-G,w[2]=G-(Z-p)+(P-p),w[3]=Z;const Pr=v(Br,A,4,w,L);return L[Pr-1]})(q,$,H,t,i,r,o)},s.orient2dfast=function(q,$,H,t,i,r){return($-r)*(H-i)-(q-i)*(t-r)},Object.defineProperty(s,"__esModule",{value:!0})})})(nr,nr.exports)),nr.exports}var xr;function Qr(){if(xr)return ar.exports;xr=1;var l=Nr(),c=Or,s=$r(),f=Jr().orient2d;c.default&&(c=c.default),ar.exports=g,ar.exports.default=g;function g(r,e,n){e=Math.max(0,e===void 0?2:e),n=n||0;var a=L(r),o=new l(16);o.toBBox=function(x){return{minX:x[0],minY:x[1],maxX:x[0],maxY:x[1]}},o.compareMinX=function(x,J){return x[0]-J[0]},o.compareMinY=function(x,J){return x[1]-J[1]},o.load(r);for(var u=[],h=0,m;h<a.length;h++){var d=a[h];o.remove(d),m=w(d,m),u.push(m)}var M=new l(16);for(h=0;h<u.length;h++)M.insert(A(u[h]));for(var S=e*e,z=n*n;u.length;){var _=u.shift(),R=_.p,N=_.next.p,k=q(R,N);if(!(k<z)){var p=k/S;d=v(o,_.prev.p,R,N,_.next.next.p,p,M),d&&Math.min(q(d,R),q(d,N))<=p&&(u.push(_),u.push(w(d,_)),o.remove(d),M.remove(_),M.insert(A(_)),M.insert(A(_.next)))}}_=m;var y=[];do y.push(_.p),_=_.next;while(_!==m);return y.push(_.p),y}function v(r,e,n,a,o,u,h){for(var m=new c([],Y),d=r.data;d;){for(var M=0;M<d.children.length;M++){var S=d.children[M],z=d.leaf?$(S,n,a):B(n,a,S);z>u||m.push({node:S,dist:z})}for(;m.length&&!m.peek().node.children;){var _=m.pop(),R=_.node,N=$(R,e,n),k=$(R,a,o);if(_.dist<N&&_.dist<k&&E(n,R,h)&&E(a,R,h))return R}d=m.pop(),d&&(d=d.node)}return null}function Y(r,e){return r.dist-e.dist}function B(r,e,n){if(X(r,n)||X(e,n))return 0;var a=H(r[0],r[1],e[0],e[1],n.minX,n.minY,n.maxX,n.minY);if(a===0)return 0;var o=H(r[0],r[1],e[0],e[1],n.minX,n.minY,n.minX,n.maxY);if(o===0)return 0;var u=H(r[0],r[1],e[0],e[1],n.maxX,n.minY,n.maxX,n.maxY);if(u===0)return 0;var h=H(r[0],r[1],e[0],e[1],n.minX,n.maxY,n.maxX,n.maxY);return h===0?0:Math.min(a,o,u,h)}function X(r,e){return r[0]>=e.minX&&r[0]<=e.maxX&&r[1]>=e.minY&&r[1]<=e.maxY}function E(r,e,n){for(var a=Math.min(r[0],e[0]),o=Math.min(r[1],e[1]),u=Math.max(r[0],e[0]),h=Math.max(r[1],e[1]),m=n.search({minX:a,minY:o,maxX:u,maxY:h}),d=0;d<m.length;d++)if(F(m[d].p,m[d].next.p,r,e))return!1;return!0}function C(r,e,n){return f(r[0],r[1],e[0],e[1],n[0],n[1])}function F(r,e,n,a){return r!==a&&e!==n&&C(r,e,n)>0!=C(r,e,a)>0&&C(n,a,r)>0!=C(n,a,e)>0}function A(r){var e=r.p,n=r.next.p;return r.minX=Math.min(e[0],n[0]),r.minY=Math.min(e[1],n[1]),r.maxX=Math.max(e[0],n[0]),r.maxY=Math.max(e[1],n[1]),r}function L(r){for(var e=r[0],n=r[0],a=r[0],o=r[0],u=0;u<r.length;u++){var h=r[u];h[0]<e[0]&&(e=h),h[0]>a[0]&&(a=h),h[1]<n[1]&&(n=h),h[1]>o[1]&&(o=h)}var m=[e,n,a,o],d=m.slice();for(u=0;u<r.length;u++)s(r[u],m)||d.push(r[u]);return i(d)}function w(r,e){var n={p:r,prev:null,next:null,minX:0,minY:0,maxX:0,maxY:0};return e?(n.next=e.next,n.prev=e,e.next.prev=n,e.next=n):(n.prev=n,n.next=n),n}function q(r,e){var n=r[0]-e[0],a=r[1]-e[1];return n*n+a*a}function $(r,e,n){var a=e[0],o=e[1],u=n[0]-a,h=n[1]-o;if(u!==0||h!==0){var m=((r[0]-a)*u+(r[1]-o)*h)/(u*u+h*h);m>1?(a=n[0],o=n[1]):m>0&&(a+=u*m,o+=h*m)}return u=r[0]-a,h=r[1]-o,u*u+h*h}function H(r,e,n,a,o,u,h,m){var d=n-r,M=a-e,S=h-o,z=m-u,_=r-o,R=e-u,N=d*d+M*M,k=d*S+M*z,p=S*S+z*z,y=d*_+M*R,x=S*_+z*R,J=N*p-k*k,O,D,P,G,U=J,Q=J;J===0?(D=0,U=1,G=x,Q=p):(D=k*x-p*y,G=N*x-k*y,D<0?(D=0,G=x,Q=p):D>U&&(D=U,G=x+k,Q=p)),G<0?(G=0,-y<0?D=0:-y>N?D=U:(D=-y,U=N)):G>Q&&(G=Q,-y+k<0?D=0:-y+k>N?D=U:(D=-y+k,U=N)),O=D===0?0:D/U,P=G===0?0:G/Q;var K=(1-O)*r+O*n,V=(1-O)*e+O*a,j=(1-P)*o+P*h,Z=(1-P)*u+P*m,W=j-K,T=Z-V;return W*W+T*T}function t(r,e){return r[0]===e[0]?r[1]-e[1]:r[0]-e[0]}function i(r){r.sort(t);for(var e=[],n=0;n<r.length;n++){for(;e.length>=2&&C(e[e.length-2],e[e.length-1],r[n])<=0;)e.pop();e.push(r[n])}for(var a=[],o=r.length-1;o>=0;o--){for(;a.length>=2&&C(a[a.length-2],a[a.length-1],r[o])<=0;)a.pop();a.push(r[o])}return a.pop(),e.pop(),e.concat(a)}return ar.exports}var Ur=Qr();const zr=Xr.getDefaultExportFromCjs(Ur);function Kr(l,c={}){c.concavity=c.concavity||1/0;const s=[];if(ir(l,g=>{s.push([g[0],g[1]])}),!s.length)return null;const f=zr(s,c.concavity);return f.length>3?Sr([f]):null}function Mr(l,c={}){let s=0,f=0,g=0;return ir(l,function(v){s+=v[0],f+=v[1],g++},!0),hr([s/g,f/g],c.properties)}function Vr(l){if(!l)throw new Error("coord is required");if(!Array.isArray(l)){if(l.type==="Feature"&&l.geometry!==null&&l.geometry.type==="Point")return[...l.geometry.coordinates];if(l.type==="Point")return[...l.coordinates]}if(Array.isArray(l)&&l.length>=2&&!Array.isArray(l[0])&&!Array.isArray(l[1]))return[...l];throw new Error("coord must be GeoJSON Point or an Array of numbers")}function Zr(l,c){return l.type==="FeatureCollection"?"FeatureCollection":l.type==="GeometryCollection"?"GeometryCollection":l.type==="Feature"&&l.geometry!==null?l.geometry.type:l.type}function _r(l,c={}){switch(Zr(l)){case"Point":return hr(Vr(l),c.properties);case"Polygon":var s=[];ir(l,function(r){s.push(r)});var f=Mr(l,{properties:c.properties}),g=f.geometry.coordinates,v=0,Y=0,B=0,X,E,C,F,A,L,w,q,$=s.map(function(r){return[r[0]-g[0],r[1]-g[1]]});for(X=0;X<s.length-1;X++)E=$[X],F=E[0],L=E[1],C=$[X+1],A=C[0],w=C[1],q=F*w-A*L,B+=q,v+=(F+A)*q,Y+=(L+w)*q;if(B===0)return f;var H=B*.5,t=1/(6*H);return hr([g[0]+t*v,g[1]+t*Y],c.properties);default:var i=Kr(l);return i?_r(i,{properties:c.properties}):Mr(l,{properties:c.properties})}}var Wr=_r;exports.coordEach=ir;exports.earthRadius=Cr;exports.geomReduce=Ar;exports.index_default=Wr;
-//# sourceMappingURL=index-C5K--w8d.cjs.map

package/dist/index-C5K--w8d.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-C5K--w8d.cjs","sources":["../node_modules/@turf/helpers/dist/esm/index.js","../node_modules/@turf/meta/dist/esm/index.js","../node_modules/rbush/rbush.min.js","../node_modules/tinyqueue/index.js","../node_modules/point-in-polygon/flat.js","../node_modules/point-in-polygon/nested.js","../node_modules/point-in-polygon/index.js","../node_modules/robust-predicates/umd/orient2d.min.js","../node_modules/concaveman/index.js","../node_modules/@turf/convex/dist/esm/index.js","../node_modules/@turf/centroid/dist/esm/index.js","../node_modules/@turf/invariant/dist/esm/index.js","../node_modules/@turf/center-of-mass/dist/esm/index.js"],"sourcesContent":["// index.ts\nvar earthRadius = 63710088e-1;\nvar factors = {\n  centimeters: earthRadius * 100,\n  centimetres: earthRadius * 100,\n  degrees: 360 / (2 * Math.PI),\n  feet: earthRadius * 3.28084,\n  inches: earthRadius * 39.37,\n  kilometers: earthRadius / 1e3,\n  kilometres: earthRadius / 1e3,\n  meters: earthRadius,\n  metres: earthRadius,\n  miles: earthRadius / 1609.344,\n  millimeters: earthRadius * 1e3,\n  millimetres: earthRadius * 1e3,\n  nauticalmiles: earthRadius / 1852,\n  radians: 1,\n  yards: earthRadius * 1.0936\n};\nvar areaFactors = {\n  acres: 247105e-9,\n  centimeters: 1e4,\n  centimetres: 1e4,\n  feet: 10.763910417,\n  hectares: 1e-4,\n  inches: 1550.003100006,\n  kilometers: 1e-6,\n  kilometres: 1e-6,\n  meters: 1,\n  metres: 1,\n  miles: 386e-9,\n  nauticalmiles: 29155334959812285e-23,\n  millimeters: 1e6,\n  millimetres: 1e6,\n  yards: 1.195990046\n};\nfunction feature(geom, properties, options = {}) {\n  const feat = { type: \"Feature\" };\n  if (options.id === 0 || options.id) {\n    feat.id = options.id;\n  }\n  if (options.bbox) {\n    feat.bbox = options.bbox;\n  }\n  feat.properties = properties || {};\n  feat.geometry = geom;\n  return feat;\n}\nfunction geometry(type, coordinates, _options = {}) {\n  switch (type) {\n    case \"Point\":\n      return point(coordinates).geometry;\n    case \"LineString\":\n      return lineString(coordinates).geometry;\n    case \"Polygon\":\n      return polygon(coordinates).geometry;\n    case \"MultiPoint\":\n      return multiPoint(coordinates).geometry;\n    case \"MultiLineString\":\n      return multiLineString(coordinates).geometry;\n    case \"MultiPolygon\":\n      return multiPolygon(coordinates).geometry;\n    default:\n      throw new Error(type + \" is invalid\");\n  }\n}\nfunction point(coordinates, properties, options = {}) {\n  if (!coordinates) {\n    throw new Error(\"coordinates is required\");\n  }\n  if (!Array.isArray(coordinates)) {\n    throw new Error(\"coordinates must be an Array\");\n  }\n  if (coordinates.length < 2) {\n    throw new Error(\"coordinates must be at least 2 numbers long\");\n  }\n  if (!isNumber(coordinates[0]) || !isNumber(coordinates[1])) {\n    throw new Error(\"coordinates must contain numbers\");\n  }\n  const geom = {\n    type: \"Point\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction points(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return point(coords, properties);\n    }),\n    options\n  );\n}\nfunction polygon(coordinates, properties, options = {}) {\n  for (const ring of coordinates) {\n    if (ring.length < 4) {\n      throw new Error(\n        \"Each LinearRing of a Polygon must have 4 or more Positions.\"\n      );\n    }\n    if (ring[ring.length - 1].length !== ring[0].length) {\n      throw new Error(\"First and last Position are not equivalent.\");\n    }\n    for (let j = 0; j < ring[ring.length - 1].length; j++) {\n      if (ring[ring.length - 1][j] !== ring[0][j]) {\n        throw new Error(\"First and last Position are not equivalent.\");\n      }\n    }\n  }\n  const geom = {\n    type: \"Polygon\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction polygons(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return polygon(coords, properties);\n    }),\n    options\n  );\n}\nfunction lineString(coordinates, properties, options = {}) {\n  if (coordinates.length < 2) {\n    throw new Error(\"coordinates must be an array of two or more positions\");\n  }\n  const geom = {\n    type: \"LineString\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction lineStrings(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return lineString(coords, properties);\n    }),\n    options\n  );\n}\nfunction featureCollection(features, options = {}) {\n  const fc = { type: \"FeatureCollection\" };\n  if (options.id) {\n    fc.id = options.id;\n  }\n  if (options.bbox) {\n    fc.bbox = options.bbox;\n  }\n  fc.features = features;\n  return fc;\n}\nfunction multiLineString(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiLineString\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction multiPoint(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiPoint\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction multiPolygon(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiPolygon\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction geometryCollection(geometries, properties, options = {}) {\n  const geom = {\n    type: \"GeometryCollection\",\n    geometries\n  };\n  return feature(geom, properties, options);\n}\nfunction round(num, precision = 0) {\n  if (precision && !(precision >= 0)) {\n    throw new Error(\"precision must be a positive number\");\n  }\n  const multiplier = Math.pow(10, precision || 0);\n  return Math.round(num * multiplier) / multiplier;\n}\nfunction radiansToLength(radians, units = \"kilometers\") {\n  const factor = factors[units];\n  if (!factor) {\n    throw new Error(units + \" units is invalid\");\n  }\n  return radians * factor;\n}\nfunction lengthToRadians(distance, units = \"kilometers\") {\n  const factor = factors[units];\n  if (!factor) {\n    throw new Error(units + \" units is invalid\");\n  }\n  return distance / factor;\n}\nfunction lengthToDegrees(distance, units) {\n  return radiansToDegrees(lengthToRadians(distance, units));\n}\nfunction bearingToAzimuth(bearing) {\n  let angle = bearing % 360;\n  if (angle < 0) {\n    angle += 360;\n  }\n  return angle;\n}\nfunction azimuthToBearing(angle) {\n  angle = angle % 360;\n  if (angle > 180) {\n    return angle - 360;\n  } else if (angle < -180) {\n    return angle + 360;\n  }\n  return angle;\n}\nfunction radiansToDegrees(radians) {\n  const normalisedRadians = radians % (2 * Math.PI);\n  return normalisedRadians * 180 / Math.PI;\n}\nfunction degreesToRadians(degrees) {\n  const normalisedDegrees = degrees % 360;\n  return normalisedDegrees * Math.PI / 180;\n}\nfunction convertLength(length, originalUnit = \"kilometers\", finalUnit = \"kilometers\") {\n  if (!(length >= 0)) {\n    throw new Error(\"length must be a positive number\");\n  }\n  return radiansToLength(lengthToRadians(length, originalUnit), finalUnit);\n}\nfunction convertArea(area, originalUnit = \"meters\", finalUnit = \"kilometers\") {\n  if (!(area >= 0)) {\n    throw new Error(\"area must be a positive number\");\n  }\n  const startFactor = areaFactors[originalUnit];\n  if (!startFactor) {\n    throw new Error(\"invalid original units\");\n  }\n  const finalFactor = areaFactors[finalUnit];\n  if (!finalFactor) {\n    throw new Error(\"invalid final units\");\n  }\n  return area / startFactor * finalFactor;\n}\nfunction isNumber(num) {\n  return !isNaN(num) && num !== null && !Array.isArray(num);\n}\nfunction isObject(input) {\n  return input !== null && typeof input === \"object\" && !Array.isArray(input);\n}\nfunction validateBBox(bbox) {\n  if (!bbox) {\n    throw new Error(\"bbox is required\");\n  }\n  if (!Array.isArray(bbox)) {\n    throw new Error(\"bbox must be an Array\");\n  }\n  if (bbox.length !== 4 && bbox.length !== 6) {\n    throw new Error(\"bbox must be an Array of 4 or 6 numbers\");\n  }\n  bbox.forEach((num) => {\n    if (!isNumber(num)) {\n      throw new Error(\"bbox must only contain numbers\");\n    }\n  });\n}\nfunction validateId(id) {\n  if (!id) {\n    throw new Error(\"id is required\");\n  }\n  if ([\"string\", \"number\"].indexOf(typeof id) === -1) {\n    throw new Error(\"id must be a number or a string\");\n  }\n}\nexport {\n  areaFactors,\n  azimuthToBearing,\n  bearingToAzimuth,\n  convertArea,\n  convertLength,\n  degreesToRadians,\n  earthRadius,\n  factors,\n  feature,\n  featureCollection,\n  geometry,\n  geometryCollection,\n  isNumber,\n  isObject,\n  lengthToDegrees,\n  lengthToRadians,\n  lineString,\n  lineStrings,\n  multiLineString,\n  multiPoint,\n  multiPolygon,\n  point,\n  points,\n  polygon,\n  polygons,\n  radiansToDegrees,\n  radiansToLength,\n  round,\n  validateBBox,\n  validateId\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { feature, point, lineString, isObject } from \"@turf/helpers\";\nfunction coordEach(geojson, callback, excludeWrapCoord) {\n  if (geojson === null) return;\n  var j, k, l, geometry, stopG, coords, geometryMaybeCollection, wrapShrink = 0, coordIndex = 0, isGeometryCollection, type = geojson.type, isFeatureCollection = type === \"FeatureCollection\", isFeature = type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (var featureIndex = 0; featureIndex < stop; featureIndex++) {\n    geometryMaybeCollection = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[featureIndex].geometry\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.geometry\n    ) : geojson;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (var geomIndex = 0; geomIndex < stopG; geomIndex++) {\n      var multiFeatureIndex = 0;\n      var geometryIndex = 0;\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[geomIndex] : geometryMaybeCollection;\n      if (geometry === null) continue;\n      coords = geometry.coordinates;\n      var geomType = geometry.type;\n      wrapShrink = excludeWrapCoord && (geomType === \"Polygon\" || geomType === \"MultiPolygon\") ? 1 : 0;\n      switch (geomType) {\n        case null:\n          break;\n        case \"Point\":\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              coords,\n              coordIndex,\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false\n          )\n            return false;\n          coordIndex++;\n          multiFeatureIndex++;\n          break;\n        case \"LineString\":\n        case \"MultiPoint\":\n          for (j = 0; j < coords.length; j++) {\n            if (\n              // @ts-expect-error: Known type conflict\n              callback(\n                coords[j],\n                coordIndex,\n                featureIndex,\n                multiFeatureIndex,\n                geometryIndex\n              ) === false\n            )\n              return false;\n            coordIndex++;\n            if (geomType === \"MultiPoint\") multiFeatureIndex++;\n          }\n          if (geomType === \"LineString\") multiFeatureIndex++;\n          break;\n        case \"Polygon\":\n        case \"MultiLineString\":\n          for (j = 0; j < coords.length; j++) {\n            for (k = 0; k < coords[j].length - wrapShrink; k++) {\n              if (\n                // @ts-expect-error: Known type conflict\n                callback(\n                  coords[j][k],\n                  coordIndex,\n                  featureIndex,\n                  multiFeatureIndex,\n                  geometryIndex\n                ) === false\n              )\n                return false;\n              coordIndex++;\n            }\n            if (geomType === \"MultiLineString\") multiFeatureIndex++;\n            if (geomType === \"Polygon\") geometryIndex++;\n          }\n          if (geomType === \"Polygon\") multiFeatureIndex++;\n          break;\n        case \"MultiPolygon\":\n          for (j = 0; j < coords.length; j++) {\n            geometryIndex = 0;\n            for (k = 0; k < coords[j].length; k++) {\n              for (l = 0; l < coords[j][k].length - wrapShrink; l++) {\n                if (\n                  // @ts-expect-error: Known type conflict\n                  callback(\n                    coords[j][k][l],\n                    coordIndex,\n                    featureIndex,\n                    multiFeatureIndex,\n                    geometryIndex\n                  ) === false\n                )\n                  return false;\n                coordIndex++;\n              }\n              geometryIndex++;\n            }\n            multiFeatureIndex++;\n          }\n          break;\n        case \"GeometryCollection\":\n          for (j = 0; j < geometry.geometries.length; j++)\n            if (\n              // @ts-expect-error: Known type conflict\n              coordEach(geometry.geometries[j], callback, excludeWrapCoord) === false\n            )\n              return false;\n          break;\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n  }\n}\nfunction coordReduce(geojson, callback, initialValue, excludeWrapCoord) {\n  var previousValue = initialValue;\n  coordEach(\n    geojson,\n    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (coordIndex === 0 && initialValue === void 0)\n        previousValue = currentCoord;\n      else\n        previousValue = callback(\n          // @ts-expect-error: Known type conflict\n          previousValue,\n          currentCoord,\n          coordIndex,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    },\n    excludeWrapCoord\n  );\n  return previousValue;\n}\nfunction propEach(geojson, callback) {\n  var i;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      for (i = 0; i < geojson.features.length; i++) {\n        if (callback(geojson.features[i].properties, i) === false) break;\n      }\n      break;\n    case \"Feature\":\n      callback(geojson.properties, 0);\n      break;\n  }\n}\nfunction propReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  propEach(geojson, function(currentProperties, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentProperties;\n    else\n      previousValue = callback(previousValue, currentProperties, featureIndex);\n  });\n  return previousValue;\n}\nfunction featureEach(geojson, callback) {\n  if (geojson.type === \"Feature\") {\n    callback(geojson, 0);\n  } else if (geojson.type === \"FeatureCollection\") {\n    for (var i = 0; i < geojson.features.length; i++) {\n      if (callback(geojson.features[i], i) === false) break;\n    }\n  }\n}\nfunction featureReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  featureEach(geojson, function(currentFeature, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentFeature;\n    else previousValue = callback(previousValue, currentFeature, featureIndex);\n  });\n  return previousValue;\n}\nfunction coordAll(geojson) {\n  var coords = [];\n  coordEach(geojson, function(coord) {\n    coords.push(coord);\n  });\n  return coords;\n}\nfunction geomEach(geojson, callback) {\n  var i, j, g, geometry, stopG, geometryMaybeCollection, isGeometryCollection, featureProperties, featureBBox, featureId, featureIndex = 0, isFeatureCollection = geojson.type === \"FeatureCollection\", isFeature = geojson.type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (i = 0; i < stop; i++) {\n    geometryMaybeCollection = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].geometry\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.geometry\n    ) : geojson;\n    featureProperties = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].properties\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.properties\n    ) : {};\n    featureBBox = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].bbox\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.bbox\n    ) : void 0;\n    featureId = isFeatureCollection ? (\n      // @ts-expect-error: Known type conflict\n      geojson.features[i].id\n    ) : isFeature ? (\n      // @ts-expect-error: Known type conflict\n      geojson.id\n    ) : void 0;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (g = 0; g < stopG; g++) {\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[g] : geometryMaybeCollection;\n      if (geometry === null) {\n        if (\n          // @ts-expect-error: Known type conflict\n          callback(\n            // @ts-expect-error: Known type conflict\n            null,\n            featureIndex,\n            featureProperties,\n            featureBBox,\n            featureId\n          ) === false\n        )\n          return false;\n        continue;\n      }\n      switch (geometry.type) {\n        case \"Point\":\n        case \"LineString\":\n        case \"MultiPoint\":\n        case \"Polygon\":\n        case \"MultiLineString\":\n        case \"MultiPolygon\": {\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              geometry,\n              featureIndex,\n              featureProperties,\n              featureBBox,\n              featureId\n            ) === false\n          )\n            return false;\n          break;\n        }\n        case \"GeometryCollection\": {\n          for (j = 0; j < geometry.geometries.length; j++) {\n            if (\n              // @ts-expect-error: Known type conflict\n              callback(\n                geometry.geometries[j],\n                featureIndex,\n                featureProperties,\n                featureBBox,\n                featureId\n              ) === false\n            )\n              return false;\n          }\n          break;\n        }\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n    featureIndex++;\n  }\n}\nfunction geomReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  geomEach(\n    geojson,\n    function(currentGeometry, featureIndex, featureProperties, featureBBox, featureId) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentGeometry;\n      else\n        previousValue = callback(\n          // @ts-expect-error: Known type conflict\n          previousValue,\n          currentGeometry,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        );\n    }\n  );\n  return previousValue;\n}\nfunction flattenEach(geojson, callback) {\n  geomEach(geojson, function(geometry, featureIndex, properties, bbox, id) {\n    var type = geometry === null ? null : geometry.type;\n    switch (type) {\n      case null:\n      case \"Point\":\n      case \"LineString\":\n      case \"Polygon\":\n        if (\n          // @ts-expect-error: Known type conflict\n          callback(\n            feature(geometry, properties, { bbox, id }),\n            featureIndex,\n            0\n          ) === false\n        )\n          return false;\n        return;\n    }\n    var geomType;\n    switch (type) {\n      case \"MultiPoint\":\n        geomType = \"Point\";\n        break;\n      case \"MultiLineString\":\n        geomType = \"LineString\";\n        break;\n      case \"MultiPolygon\":\n        geomType = \"Polygon\";\n        break;\n    }\n    for (\n      var multiFeatureIndex = 0;\n      // @ts-expect-error: Known type conflict\n      multiFeatureIndex < geometry.coordinates.length;\n      multiFeatureIndex++\n    ) {\n      var coordinate = geometry.coordinates[multiFeatureIndex];\n      var geom = {\n        type: geomType,\n        coordinates: coordinate\n      };\n      if (\n        // @ts-expect-error: Known type conflict\n        callback(feature(geom, properties), featureIndex, multiFeatureIndex) === false\n      )\n        return false;\n    }\n  });\n}\nfunction flattenReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  flattenEach(\n    geojson,\n    function(currentFeature, featureIndex, multiFeatureIndex) {\n      if (featureIndex === 0 && multiFeatureIndex === 0 && initialValue === void 0)\n        previousValue = currentFeature;\n      else\n        previousValue = callback(\n          // @ts-expect-error: Known type conflict\n          previousValue,\n          currentFeature,\n          featureIndex,\n          multiFeatureIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction segmentEach(geojson, callback) {\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    var segmentIndex = 0;\n    if (!feature2.geometry) return;\n    var type = feature2.geometry.type;\n    if (type === \"Point\" || type === \"MultiPoint\") return;\n    var previousCoords;\n    var previousFeatureIndex = 0;\n    var previousMultiIndex = 0;\n    var prevGeomIndex = 0;\n    if (\n      // @ts-expect-error: Known type conflict\n      coordEach(\n        feature2,\n        function(currentCoord, coordIndex, featureIndexCoord, multiPartIndexCoord, geometryIndex) {\n          if (\n            // @ts-expect-error: Known type conflict\n            previousCoords === void 0 || featureIndex > previousFeatureIndex || multiPartIndexCoord > previousMultiIndex || geometryIndex > prevGeomIndex\n          ) {\n            previousCoords = currentCoord;\n            previousFeatureIndex = featureIndex;\n            previousMultiIndex = multiPartIndexCoord;\n            prevGeomIndex = geometryIndex;\n            segmentIndex = 0;\n            return;\n          }\n          var currentSegment = lineString(\n            // @ts-expect-error: Known type conflict\n            [previousCoords, currentCoord],\n            feature2.properties\n          );\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              // @ts-expect-error: Known type conflict\n              currentSegment,\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex,\n              segmentIndex\n            ) === false\n          )\n            return false;\n          segmentIndex++;\n          previousCoords = currentCoord;\n        }\n      ) === false\n    )\n      return false;\n  });\n}\nfunction segmentReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  var started = false;\n  segmentEach(\n    geojson,\n    function(currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex) {\n      if (started === false && initialValue === void 0)\n        previousValue = currentSegment;\n      else\n        previousValue = callback(\n          previousValue,\n          // @ts-expect-error: Known type conflict\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        );\n      started = true;\n    }\n  );\n  return previousValue;\n}\nfunction lineEach(geojson, callback) {\n  if (!geojson) throw new Error(\"geojson is required\");\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    if (feature2.geometry === null) return;\n    var type = feature2.geometry.type;\n    var coords = feature2.geometry.coordinates;\n    switch (type) {\n      case \"LineString\":\n        if (callback(feature2, featureIndex, multiFeatureIndex, 0, 0) === false)\n          return false;\n        break;\n      case \"Polygon\":\n        for (var geometryIndex = 0; geometryIndex < coords.length; geometryIndex++) {\n          if (\n            // @ts-expect-error: Known type conflict\n            callback(\n              // @ts-expect-error: Known type conflict\n              lineString(coords[geometryIndex], feature2.properties),\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false\n          )\n            return false;\n        }\n        break;\n    }\n  });\n}\nfunction lineReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  lineEach(\n    geojson,\n    function(currentLine, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentLine;\n      else\n        previousValue = callback(\n          previousValue,\n          currentLine,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction findSegment(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var segmentIndex = options.segmentIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n      if (segmentIndex < 0) segmentIndex = coords.length + segmentIndex - 1;\n      return lineString(\n        // @ts-expect-error: Known type conflict\n        [coords[segmentIndex], coords[segmentIndex + 1]],\n        properties,\n        options\n      );\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[geometryIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          // @ts-expect-error: Known type conflict\n          coords[geometryIndex][segmentIndex],\n          // @ts-expect-error: Known type conflict\n          coords[geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[multiFeatureIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][segmentIndex],\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = // @ts-expect-error: Known type conflict\n        coords[multiFeatureIndex][geometryIndex].length - segmentIndex - 1;\n      return lineString(\n        [\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][geometryIndex][segmentIndex],\n          // @ts-expect-error: Known type conflict\n          coords[multiFeatureIndex][geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nfunction findPoint(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var coordIndex = options.coordIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n      return point(coords, properties, options);\n    case \"MultiPoint\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      return point(coords[multiFeatureIndex], properties, options);\n    case \"LineString\":\n      if (coordIndex < 0) coordIndex = coords.length + coordIndex;\n      return point(coords[coordIndex], properties, options);\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[geometryIndex].length + coordIndex;\n      return point(coords[geometryIndex][coordIndex], properties, options);\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex].length + coordIndex;\n      return point(coords[multiFeatureIndex][coordIndex], properties, options);\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex][geometryIndex].length - coordIndex;\n      return point(\n        coords[multiFeatureIndex][geometryIndex][coordIndex],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nexport {\n  coordAll,\n  coordEach,\n  coordReduce,\n  featureEach,\n  featureReduce,\n  findPoint,\n  findSegment,\n  flattenEach,\n  flattenReduce,\n  geomEach,\n  geomReduce,\n  lineEach,\n  lineReduce,\n  propEach,\n  propReduce,\n  segmentEach,\n  segmentReduce\n};\n//# sourceMappingURL=index.js.map","!function(t,i){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=i():\"function\"==typeof define&&define.amd?define(i):(t=t||self).RBush=i()}(this,function(){\"use strict\";function t(t,r,e,a,h){!function t(n,r,e,a,h){for(;a>e;){if(a-e>600){var o=a-e+1,s=r-e+1,l=Math.log(o),f=.5*Math.exp(2*l/3),u=.5*Math.sqrt(l*f*(o-f)/o)*(s-o/2<0?-1:1),m=Math.max(e,Math.floor(r-s*f/o+u)),c=Math.min(a,Math.floor(r+(o-s)*f/o+u));t(n,r,m,c,h)}var p=n[r],d=e,x=a;for(i(n,e,r),h(n[a],p)>0&&i(n,e,a);d<x;){for(i(n,d,x),d++,x--;h(n[d],p)<0;)d++;for(;h(n[x],p)>0;)x--}0===h(n[e],p)?i(n,e,x):i(n,++x,a),x<=r&&(e=x+1),r<=x&&(a=x-1)}}(t,r,e||0,a||t.length-1,h||n)}function i(t,i,n){var r=t[i];t[i]=t[n],t[n]=r}function n(t,i){return t<i?-1:t>i?1:0}var r=function(t){void 0===t&&(t=9),this._maxEntries=Math.max(4,t),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function e(t,i,n){if(!n)return i.indexOf(t);for(var r=0;r<i.length;r++)if(n(t,i[r]))return r;return-1}function a(t,i){h(t,0,t.children.length,i,t)}function h(t,i,n,r,e){e||(e=p(null)),e.minX=1/0,e.minY=1/0,e.maxX=-1/0,e.maxY=-1/0;for(var a=i;a<n;a++){var h=t.children[a];o(e,t.leaf?r(h):h)}return e}function o(t,i){return t.minX=Math.min(t.minX,i.minX),t.minY=Math.min(t.minY,i.minY),t.maxX=Math.max(t.maxX,i.maxX),t.maxY=Math.max(t.maxY,i.maxY),t}function s(t,i){return t.minX-i.minX}function l(t,i){return t.minY-i.minY}function f(t){return(t.maxX-t.minX)*(t.maxY-t.minY)}function u(t){return t.maxX-t.minX+(t.maxY-t.minY)}function m(t,i){return t.minX<=i.minX&&t.minY<=i.minY&&i.maxX<=t.maxX&&i.maxY<=t.maxY}function c(t,i){return i.minX<=t.maxX&&i.minY<=t.maxY&&i.maxX>=t.minX&&i.maxY>=t.minY}function p(t){return{children:t,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function d(i,n,r,e,a){for(var h=[n,r];h.length;)if(!((r=h.pop())-(n=h.pop())<=e)){var o=n+Math.ceil((r-n)/e/2)*e;t(i,o,n,r,a),h.push(n,o,o,r)}}return r.prototype.all=function(){return this._all(this.data,[])},r.prototype.search=function(t){var i=this.data,n=[];if(!c(t,i))return n;for(var r=this.toBBox,e=[];i;){for(var a=0;a<i.children.length;a++){var h=i.children[a],o=i.leaf?r(h):h;c(t,o)&&(i.leaf?n.push(h):m(t,o)?this._all(h,n):e.push(h))}i=e.pop()}return n},r.prototype.collides=function(t){var i=this.data;if(!c(t,i))return!1;for(var n=[];i;){for(var r=0;r<i.children.length;r++){var e=i.children[r],a=i.leaf?this.toBBox(e):e;if(c(t,a)){if(i.leaf||m(t,a))return!0;n.push(e)}}i=n.pop()}return!1},r.prototype.load=function(t){if(!t||!t.length)return this;if(t.length<this._minEntries){for(var i=0;i<t.length;i++)this.insert(t[i]);return this}var n=this._build(t.slice(),0,t.length-1,0);if(this.data.children.length)if(this.data.height===n.height)this._splitRoot(this.data,n);else{if(this.data.height<n.height){var r=this.data;this.data=n,n=r}this._insert(n,this.data.height-n.height-1,!0)}else this.data=n;return this},r.prototype.insert=function(t){return t&&this._insert(t,this.data.height-1),this},r.prototype.clear=function(){return this.data=p([]),this},r.prototype.remove=function(t,i){if(!t)return this;for(var n,r,a,h=this.data,o=this.toBBox(t),s=[],l=[];h||s.length;){if(h||(h=s.pop(),r=s[s.length-1],n=l.pop(),a=!0),h.leaf){var f=e(t,h.children,i);if(-1!==f)return h.children.splice(f,1),s.push(h),this._condense(s),this}a||h.leaf||!m(h,o)?r?(n++,h=r.children[n],a=!1):h=null:(s.push(h),l.push(n),n=0,r=h,h=h.children[0])}return this},r.prototype.toBBox=function(t){return t},r.prototype.compareMinX=function(t,i){return t.minX-i.minX},r.prototype.compareMinY=function(t,i){return t.minY-i.minY},r.prototype.toJSON=function(){return this.data},r.prototype.fromJSON=function(t){return this.data=t,this},r.prototype._all=function(t,i){for(var n=[];t;)t.leaf?i.push.apply(i,t.children):n.push.apply(n,t.children),t=n.pop();return i},r.prototype._build=function(t,i,n,r){var e,h=n-i+1,o=this._maxEntries;if(h<=o)return a(e=p(t.slice(i,n+1)),this.toBBox),e;r||(r=Math.ceil(Math.log(h)/Math.log(o)),o=Math.ceil(h/Math.pow(o,r-1))),(e=p([])).leaf=!1,e.height=r;var s=Math.ceil(h/o),l=s*Math.ceil(Math.sqrt(o));d(t,i,n,l,this.compareMinX);for(var f=i;f<=n;f+=l){var u=Math.min(f+l-1,n);d(t,f,u,s,this.compareMinY);for(var m=f;m<=u;m+=s){var c=Math.min(m+s-1,u);e.children.push(this._build(t,m,c,r-1))}}return a(e,this.toBBox),e},r.prototype._chooseSubtree=function(t,i,n,r){for(;r.push(i),!i.leaf&&r.length-1!==n;){for(var e=1/0,a=1/0,h=void 0,o=0;o<i.children.length;o++){var s=i.children[o],l=f(s),u=(m=t,c=s,(Math.max(c.maxX,m.maxX)-Math.min(c.minX,m.minX))*(Math.max(c.maxY,m.maxY)-Math.min(c.minY,m.minY))-l);u<a?(a=u,e=l<e?l:e,h=s):u===a&&l<e&&(e=l,h=s)}i=h||i.children[0]}var m,c;return i},r.prototype._insert=function(t,i,n){var r=n?t:this.toBBox(t),e=[],a=this._chooseSubtree(r,this.data,i,e);for(a.children.push(t),o(a,r);i>=0&&e[i].children.length>this._maxEntries;)this._split(e,i),i--;this._adjustParentBBoxes(r,e,i)},r.prototype._split=function(t,i){var n=t[i],r=n.children.length,e=this._minEntries;this._chooseSplitAxis(n,e,r);var h=this._chooseSplitIndex(n,e,r),o=p(n.children.splice(h,n.children.length-h));o.height=n.height,o.leaf=n.leaf,a(n,this.toBBox),a(o,this.toBBox),i?t[i-1].children.push(o):this._splitRoot(n,o)},r.prototype._splitRoot=function(t,i){this.data=p([t,i]),this.data.height=t.height+1,this.data.leaf=!1,a(this.data,this.toBBox)},r.prototype._chooseSplitIndex=function(t,i,n){for(var r,e,a,o,s,l,u,m=1/0,c=1/0,p=i;p<=n-i;p++){var d=h(t,0,p,this.toBBox),x=h(t,p,n,this.toBBox),v=(e=d,a=x,o=void 0,s=void 0,l=void 0,u=void 0,o=Math.max(e.minX,a.minX),s=Math.max(e.minY,a.minY),l=Math.min(e.maxX,a.maxX),u=Math.min(e.maxY,a.maxY),Math.max(0,l-o)*Math.max(0,u-s)),M=f(d)+f(x);v<m?(m=v,r=p,c=M<c?M:c):v===m&&M<c&&(c=M,r=p)}return r||n-i},r.prototype._chooseSplitAxis=function(t,i,n){var r=t.leaf?this.compareMinX:s,e=t.leaf?this.compareMinY:l;this._allDistMargin(t,i,n,r)<this._allDistMargin(t,i,n,e)&&t.children.sort(r)},r.prototype._allDistMargin=function(t,i,n,r){t.children.sort(r);for(var e=this.toBBox,a=h(t,0,i,e),s=h(t,n-i,n,e),l=u(a)+u(s),f=i;f<n-i;f++){var m=t.children[f];o(a,t.leaf?e(m):m),l+=u(a)}for(var c=n-i-1;c>=i;c--){var p=t.children[c];o(s,t.leaf?e(p):p),l+=u(s)}return l},r.prototype._adjustParentBBoxes=function(t,i,n){for(var r=n;r>=0;r--)o(i[r],t)},r.prototype._condense=function(t){for(var i=t.length-1,n=void 0;i>=0;i--)0===t[i].children.length?i>0?(n=t[i-1].children).splice(n.indexOf(t[i]),1):this.clear():a(t[i],this.toBBox)},r});\n","\nexport default class TinyQueue {\n    constructor(data = [], compare = defaultCompare) {\n        this.data = data;\n        this.length = this.data.length;\n        this.compare = compare;\n\n        if (this.length > 0) {\n            for (let i = (this.length >> 1) - 1; i >= 0; i--) this._down(i);\n        }\n    }\n\n    push(item) {\n        this.data.push(item);\n        this.length++;\n        this._up(this.length - 1);\n    }\n\n    pop() {\n        if (this.length === 0) return undefined;\n\n        const top = this.data[0];\n        const bottom = this.data.pop();\n        this.length--;\n\n        if (this.length > 0) {\n            this.data[0] = bottom;\n            this._down(0);\n        }\n\n        return top;\n    }\n\n    peek() {\n        return this.data[0];\n    }\n\n    _up(pos) {\n        const {data, compare} = this;\n        const item = data[pos];\n\n        while (pos > 0) {\n            const parent = (pos - 1) >> 1;\n            const current = data[parent];\n            if (compare(item, current) >= 0) break;\n            data[pos] = current;\n            pos = parent;\n        }\n\n        data[pos] = item;\n    }\n\n    _down(pos) {\n        const {data, compare} = this;\n        const halfLength = this.length >> 1;\n        const item = data[pos];\n\n        while (pos < halfLength) {\n            let left = (pos << 1) + 1;\n            let best = data[left];\n            const right = left + 1;\n\n            if (right < this.length && compare(data[right], best) < 0) {\n                left = right;\n                best = data[right];\n            }\n            if (compare(best, item) >= 0) break;\n\n            data[pos] = best;\n            pos = left;\n        }\n\n        data[pos] = item;\n    }\n}\n\nfunction defaultCompare(a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n}\n","module.exports = function pointInPolygonFlat (point, vs, start, end) {\n    var x = point[0], y = point[1];\n    var inside = false;\n    if (start === undefined) start = 0;\n    if (end === undefined) end = vs.length;\n    var len = (end-start)/2;\n    for (var i = 0, j = len - 1; i < len; j = i++) {\n        var xi = vs[start+i*2+0], yi = vs[start+i*2+1];\n        var xj = vs[start+j*2+0], yj = vs[start+j*2+1];\n        var intersect = ((yi > y) !== (yj > y))\n            && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n        if (intersect) inside = !inside;\n    }\n    return inside;\n};\n","// ray-casting algorithm based on\n// https://wrf.ecse.rpi.edu/Research/Short_Notes/pnpoly.html\n\nmodule.exports = function pointInPolygonNested (point, vs, start, end) {\n    var x = point[0], y = point[1];\n    var inside = false;\n    if (start === undefined) start = 0;\n    if (end === undefined) end = vs.length;\n    var len = end - start;\n    for (var i = 0, j = len - 1; i < len; j = i++) {\n        var xi = vs[i+start][0], yi = vs[i+start][1];\n        var xj = vs[j+start][0], yj = vs[j+start][1];\n        var intersect = ((yi > y) !== (yj > y))\n            && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n        if (intersect) inside = !inside;\n    }\n    return inside;\n};\n","var pointInPolygonFlat = require('./flat.js')\nvar pointInPolygonNested = require('./nested.js')\n\nmodule.exports = function pointInPolygon (point, vs, start, end) {\n    if (vs.length > 0 && Array.isArray(vs[0])) {\n        return pointInPolygonNested(point, vs, start, end);\n    } else {\n        return pointInPolygonFlat(point, vs, start, end);\n    }\n}\nmodule.exports.nested = pointInPolygonNested\nmodule.exports.flat = pointInPolygonFlat\n","!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?e(exports):\"function\"==typeof define&&define.amd?define([\"exports\"],e):e((t=t||self).predicates={})}(this,function(t){\"use strict\";const e=134217729,n=33306690738754706e-32;function r(t,e,n,r,o){let f,i,u,c,s=e[0],a=r[0],d=0,l=0;a>s==a>-s?(f=s,s=e[++d]):(f=a,a=r[++l]);let p=0;if(d<t&&l<n)for(a>s==a>-s?(u=f-((i=s+f)-s),s=e[++d]):(u=f-((i=a+f)-a),a=r[++l]),f=i,0!==u&&(o[p++]=u);d<t&&l<n;)a>s==a>-s?(u=f-((i=f+s)-(c=i-f))+(s-c),s=e[++d]):(u=f-((i=f+a)-(c=i-f))+(a-c),a=r[++l]),f=i,0!==u&&(o[p++]=u);for(;d<t;)u=f-((i=f+s)-(c=i-f))+(s-c),s=e[++d],f=i,0!==u&&(o[p++]=u);for(;l<n;)u=f-((i=f+a)-(c=i-f))+(a-c),a=r[++l],f=i,0!==u&&(o[p++]=u);return 0===f&&0!==p||(o[p++]=f),p}function o(t){return new Float64Array(t)}const f=33306690738754716e-32,i=22204460492503146e-32,u=11093356479670487e-47,c=o(4),s=o(8),a=o(12),d=o(16),l=o(4);t.orient2d=function(t,o,p,b,y,h){const M=(o-h)*(p-y),x=(t-y)*(b-h),j=M-x;if(0===M||0===x||M>0!=x>0)return j;const m=Math.abs(M+x);return Math.abs(j)>=f*m?j:-function(t,o,f,p,b,y,h){let M,x,j,m,_,v,w,A,F,O,P,g,k,q,z,B,C,D;const E=t-b,G=f-b,H=o-y,I=p-y;_=(z=(A=E-(w=(v=e*E)-(v-E)))*(O=I-(F=(v=e*I)-(v-I)))-((q=E*I)-w*F-A*F-w*O))-(P=z-(C=(A=H-(w=(v=e*H)-(v-H)))*(O=G-(F=(v=e*G)-(v-G)))-((B=H*G)-w*F-A*F-w*O))),c[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),c[1]=k-(P+_)+(_-B),_=(D=g+P)-g,c[2]=g-(D-_)+(P-_),c[3]=D;let J=function(t,e){let n=e[0];for(let r=1;r<t;r++)n+=e[r];return n}(4,c),K=i*h;if(J>=K||-J>=K)return J;if(M=t-(E+(_=t-E))+(_-b),j=f-(G+(_=f-G))+(_-b),x=o-(H+(_=o-H))+(_-y),m=p-(I+(_=p-I))+(_-y),0===M&&0===x&&0===j&&0===m)return J;if(K=u*h+n*Math.abs(J),(J+=E*m+I*M-(H*j+G*x))>=K||-J>=K)return J;_=(z=(A=M-(w=(v=e*M)-(v-M)))*(O=I-(F=(v=e*I)-(v-I)))-((q=M*I)-w*F-A*F-w*O))-(P=z-(C=(A=x-(w=(v=e*x)-(v-x)))*(O=G-(F=(v=e*G)-(v-G)))-((B=x*G)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const L=r(4,c,4,l,s);_=(z=(A=E-(w=(v=e*E)-(v-E)))*(O=m-(F=(v=e*m)-(v-m)))-((q=E*m)-w*F-A*F-w*O))-(P=z-(C=(A=H-(w=(v=e*H)-(v-H)))*(O=j-(F=(v=e*j)-(v-j)))-((B=H*j)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const N=r(L,s,4,l,a);_=(z=(A=M-(w=(v=e*M)-(v-M)))*(O=m-(F=(v=e*m)-(v-m)))-((q=M*m)-w*F-A*F-w*O))-(P=z-(C=(A=x-(w=(v=e*x)-(v-x)))*(O=j-(F=(v=e*j)-(v-j)))-((B=x*j)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const Q=r(N,a,4,l,d);return d[Q-1]}(t,o,p,b,y,h,m)},t.orient2dfast=function(t,e,n,r,o,f){return(e-f)*(n-o)-(t-o)*(r-f)},Object.defineProperty(t,\"__esModule\",{value:!0})});\n","'use strict';\n\nvar RBush = require('rbush');\nvar Queue = require('tinyqueue');\nvar pointInPolygon = require('point-in-polygon');\nvar orient = require('robust-predicates/umd/orient2d.min.js').orient2d;\n\n// Fix for require issue in webpack https://github.com/mapbox/concaveman/issues/18\nif (Queue.default) {\n    Queue = Queue.default;\n}\n\nmodule.exports = concaveman;\nmodule.exports.default = concaveman;\n\nfunction concaveman(points, concavity, lengthThreshold) {\n    // a relative measure of concavity; higher value means simpler hull\n    concavity = Math.max(0, concavity === undefined ? 2 : concavity);\n\n    // when a segment goes below this length threshold, it won't be drilled down further\n    lengthThreshold = lengthThreshold || 0;\n\n    // start with a convex hull of the points\n    var hull = fastConvexHull(points);\n\n    // index the points with an R-tree\n    var tree = new RBush(16);\n    tree.toBBox = function (a) {\n        return {\n            minX: a[0],\n            minY: a[1],\n            maxX: a[0],\n            maxY: a[1]\n        };\n    };\n    tree.compareMinX = function (a, b) { return a[0] - b[0]; };\n    tree.compareMinY = function (a, b) { return a[1] - b[1]; };\n\n    tree.load(points);\n\n    // turn the convex hull into a linked list and populate the initial edge queue with the nodes\n    var queue = [];\n    for (var i = 0, last; i < hull.length; i++) {\n        var p = hull[i];\n        tree.remove(p);\n        last = insertNode(p, last);\n        queue.push(last);\n    }\n\n    // index the segments with an R-tree (for intersection checks)\n    var segTree = new RBush(16);\n    for (i = 0; i < queue.length; i++) segTree.insert(updateBBox(queue[i]));\n\n    var sqConcavity = concavity * concavity;\n    var sqLenThreshold = lengthThreshold * lengthThreshold;\n\n    // process edges one by one\n    while (queue.length) {\n        var node = queue.shift();\n        var a = node.p;\n        var b = node.next.p;\n\n        // skip the edge if it's already short enough\n        var sqLen = getSqDist(a, b);\n        if (sqLen < sqLenThreshold) continue;\n\n        var maxSqLen = sqLen / sqConcavity;\n\n        // find the best connection point for the current edge to flex inward to\n        p = findCandidate(tree, node.prev.p, a, b, node.next.next.p, maxSqLen, segTree);\n\n        // if we found a connection and it satisfies our concavity measure\n        if (p && Math.min(getSqDist(p, a), getSqDist(p, b)) <= maxSqLen) {\n            // connect the edge endpoints through this point and add 2 new edges to the queue\n            queue.push(node);\n            queue.push(insertNode(p, node));\n\n            // update point and segment indexes\n            tree.remove(p);\n            segTree.remove(node);\n            segTree.insert(updateBBox(node));\n            segTree.insert(updateBBox(node.next));\n        }\n    }\n\n    // convert the resulting hull linked list to an array of points\n    node = last;\n    var concave = [];\n    do {\n        concave.push(node.p);\n        node = node.next;\n    } while (node !== last);\n\n    concave.push(node.p);\n\n    return concave;\n}\n\nfunction findCandidate(tree, a, b, c, d, maxDist, segTree) {\n    var queue = new Queue([], compareDist);\n    var node = tree.data;\n\n    // search through the point R-tree with a depth-first search using a priority queue\n    // in the order of distance to the edge (b, c)\n    while (node) {\n        for (var i = 0; i < node.children.length; i++) {\n            var child = node.children[i];\n\n            var dist = node.leaf ? sqSegDist(child, b, c) : sqSegBoxDist(b, c, child);\n            if (dist > maxDist) continue; // skip the node if it's farther than we ever need\n\n            queue.push({\n                node: child,\n                dist: dist\n            });\n        }\n\n        while (queue.length && !queue.peek().node.children) {\n            var item = queue.pop();\n            var p = item.node;\n\n            // skip all points that are as close to adjacent edges (a,b) and (c,d),\n            // and points that would introduce self-intersections when connected\n            var d0 = sqSegDist(p, a, b);\n            var d1 = sqSegDist(p, c, d);\n            if (item.dist < d0 && item.dist < d1 &&\n                noIntersections(b, p, segTree) &&\n                noIntersections(c, p, segTree)) return p;\n        }\n\n        node = queue.pop();\n        if (node) node = node.node;\n    }\n\n    return null;\n}\n\nfunction compareDist(a, b) {\n    return a.dist - b.dist;\n}\n\n// square distance from a segment bounding box to the given one\nfunction sqSegBoxDist(a, b, bbox) {\n    if (inside(a, bbox) || inside(b, bbox)) return 0;\n    var d1 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.minX, bbox.minY, bbox.maxX, bbox.minY);\n    if (d1 === 0) return 0;\n    var d2 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.minX, bbox.minY, bbox.minX, bbox.maxY);\n    if (d2 === 0) return 0;\n    var d3 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.maxX, bbox.minY, bbox.maxX, bbox.maxY);\n    if (d3 === 0) return 0;\n    var d4 = sqSegSegDist(a[0], a[1], b[0], b[1], bbox.minX, bbox.maxY, bbox.maxX, bbox.maxY);\n    if (d4 === 0) return 0;\n    return Math.min(d1, d2, d3, d4);\n}\n\nfunction inside(a, bbox) {\n    return a[0] >= bbox.minX &&\n           a[0] <= bbox.maxX &&\n           a[1] >= bbox.minY &&\n           a[1] <= bbox.maxY;\n}\n\n// check if the edge (a,b) doesn't intersect any other edges\nfunction noIntersections(a, b, segTree) {\n    var minX = Math.min(a[0], b[0]);\n    var minY = Math.min(a[1], b[1]);\n    var maxX = Math.max(a[0], b[0]);\n    var maxY = Math.max(a[1], b[1]);\n\n    var edges = segTree.search({minX: minX, minY: minY, maxX: maxX, maxY: maxY});\n    for (var i = 0; i < edges.length; i++) {\n        if (intersects(edges[i].p, edges[i].next.p, a, b)) return false;\n    }\n    return true;\n}\n\nfunction cross(p1, p2, p3) {\n    return orient(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\n// check if the edges (p1,q1) and (p2,q2) intersect\nfunction intersects(p1, q1, p2, q2) {\n    return p1 !== q2 && q1 !== p2 &&\n        cross(p1, q1, p2) > 0 !== cross(p1, q1, q2) > 0 &&\n        cross(p2, q2, p1) > 0 !== cross(p2, q2, q1) > 0;\n}\n\n// update the bounding box of a node's edge\nfunction updateBBox(node) {\n    var p1 = node.p;\n    var p2 = node.next.p;\n    node.minX = Math.min(p1[0], p2[0]);\n    node.minY = Math.min(p1[1], p2[1]);\n    node.maxX = Math.max(p1[0], p2[0]);\n    node.maxY = Math.max(p1[1], p2[1]);\n    return node;\n}\n\n// speed up convex hull by filtering out points inside quadrilateral formed by 4 extreme points\nfunction fastConvexHull(points) {\n    var left = points[0];\n    var top = points[0];\n    var right = points[0];\n    var bottom = points[0];\n\n    // find the leftmost, rightmost, topmost and bottommost points\n    for (var i = 0; i < points.length; i++) {\n        var p = points[i];\n        if (p[0] < left[0]) left = p;\n        if (p[0] > right[0]) right = p;\n        if (p[1] < top[1]) top = p;\n        if (p[1] > bottom[1]) bottom = p;\n    }\n\n    // filter out points that are inside the resulting quadrilateral\n    var cull = [left, top, right, bottom];\n    var filtered = cull.slice();\n    for (i = 0; i < points.length; i++) {\n        if (!pointInPolygon(points[i], cull)) filtered.push(points[i]);\n    }\n\n    // get convex hull around the filtered points\n    return convexHull(filtered);\n}\n\n// create a new node in a doubly linked list\nfunction insertNode(p, prev) {\n    var node = {\n        p: p,\n        prev: null,\n        next: null,\n        minX: 0,\n        minY: 0,\n        maxX: 0,\n        maxY: 0\n    };\n\n    if (!prev) {\n        node.prev = node;\n        node.next = node;\n\n    } else {\n        node.next = prev.next;\n        node.prev = prev;\n        prev.next.prev = node;\n        prev.next = node;\n    }\n    return node;\n}\n\n// square distance between 2 points\nfunction getSqDist(p1, p2) {\n\n    var dx = p1[0] - p2[0],\n        dy = p1[1] - p2[1];\n\n    return dx * dx + dy * dy;\n}\n\n// square distance from a point to a segment\nfunction sqSegDist(p, p1, p2) {\n\n    var x = p1[0],\n        y = p1[1],\n        dx = p2[0] - x,\n        dy = p2[1] - y;\n\n    if (dx !== 0 || dy !== 0) {\n\n        var t = ((p[0] - x) * dx + (p[1] - y) * dy) / (dx * dx + dy * dy);\n\n        if (t > 1) {\n            x = p2[0];\n            y = p2[1];\n\n        } else if (t > 0) {\n            x += dx * t;\n            y += dy * t;\n        }\n    }\n\n    dx = p[0] - x;\n    dy = p[1] - y;\n\n    return dx * dx + dy * dy;\n}\n\n// segment to segment distance, ported from http://geomalgorithms.com/a07-_distance.html by Dan Sunday\nfunction sqSegSegDist(x0, y0, x1, y1, x2, y2, x3, y3) {\n    var ux = x1 - x0;\n    var uy = y1 - y0;\n    var vx = x3 - x2;\n    var vy = y3 - y2;\n    var wx = x0 - x2;\n    var wy = y0 - y2;\n    var a = ux * ux + uy * uy;\n    var b = ux * vx + uy * vy;\n    var c = vx * vx + vy * vy;\n    var d = ux * wx + uy * wy;\n    var e = vx * wx + vy * wy;\n    var D = a * c - b * b;\n\n    var sc, sN, tc, tN;\n    var sD = D;\n    var tD = D;\n\n    if (D === 0) {\n        sN = 0;\n        sD = 1;\n        tN = e;\n        tD = c;\n    } else {\n        sN = b * e - c * d;\n        tN = a * e - b * d;\n        if (sN < 0) {\n            sN = 0;\n            tN = e;\n            tD = c;\n        } else if (sN > sD) {\n            sN = sD;\n            tN = e + b;\n            tD = c;\n        }\n    }\n\n    if (tN < 0.0) {\n        tN = 0.0;\n        if (-d < 0.0) sN = 0.0;\n        else if (-d > a) sN = sD;\n        else {\n            sN = -d;\n            sD = a;\n        }\n    } else if (tN > tD) {\n        tN = tD;\n        if ((-d + b) < 0.0) sN = 0;\n        else if (-d + b > a) sN = sD;\n        else {\n            sN = -d + b;\n            sD = a;\n        }\n    }\n\n    sc = sN === 0 ? 0 : sN / sD;\n    tc = tN === 0 ? 0 : tN / tD;\n\n    var cx = (1 - sc) * x0 + sc * x1;\n    var cy = (1 - sc) * y0 + sc * y1;\n    var cx2 = (1 - tc) * x2 + tc * x3;\n    var cy2 = (1 - tc) * y2 + tc * y3;\n    var dx = cx2 - cx;\n    var dy = cy2 - cy;\n\n    return dx * dx + dy * dy;\n}\n\nfunction compareByX(a, b) {\n    return a[0] === b[0] ? a[1] - b[1] : a[0] - b[0];\n}\n\nfunction convexHull(points) {\n    points.sort(compareByX);\n\n    var lower = [];\n    for (var i = 0; i < points.length; i++) {\n        while (lower.length >= 2 && cross(lower[lower.length - 2], lower[lower.length - 1], points[i]) <= 0) {\n            lower.pop();\n        }\n        lower.push(points[i]);\n    }\n\n    var upper = [];\n    for (var ii = points.length - 1; ii >= 0; ii--) {\n        while (upper.length >= 2 && cross(upper[upper.length - 2], upper[upper.length - 1], points[ii]) <= 0) {\n            upper.pop();\n        }\n        upper.push(points[ii]);\n    }\n\n    upper.pop();\n    lower.pop();\n    return lower.concat(upper);\n}\n","// index.ts\nimport { polygon } from \"@turf/helpers\";\nimport { coordEach } from \"@turf/meta\";\nimport concaveman from \"concaveman\";\nfunction convex(geojson, options = {}) {\n  options.concavity = options.concavity || Infinity;\n  const points = [];\n  coordEach(geojson, (coord) => {\n    points.push([coord[0], coord[1]]);\n  });\n  if (!points.length) {\n    return null;\n  }\n  const convexHull = concaveman(points, options.concavity);\n  if (convexHull.length > 3) {\n    return polygon([convexHull]);\n  }\n  return null;\n}\nvar index_default = convex;\nexport {\n  convex,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { point } from \"@turf/helpers\";\nimport { coordEach } from \"@turf/meta\";\nfunction centroid(geojson, options = {}) {\n  let xSum = 0;\n  let ySum = 0;\n  let len = 0;\n  coordEach(\n    geojson,\n    function(coord) {\n      xSum += coord[0];\n      ySum += coord[1];\n      len++;\n    },\n    true\n  );\n  return point([xSum / len, ySum / len], options.properties);\n}\nvar index_default = centroid;\nexport {\n  centroid,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { isNumber } from \"@turf/helpers\";\nfunction getCoord(coord) {\n  if (!coord) {\n    throw new Error(\"coord is required\");\n  }\n  if (!Array.isArray(coord)) {\n    if (coord.type === \"Feature\" && coord.geometry !== null && coord.geometry.type === \"Point\") {\n      return [...coord.geometry.coordinates];\n    }\n    if (coord.type === \"Point\") {\n      return [...coord.coordinates];\n    }\n  }\n  if (Array.isArray(coord) && coord.length >= 2 && !Array.isArray(coord[0]) && !Array.isArray(coord[1])) {\n    return [...coord];\n  }\n  throw new Error(\"coord must be GeoJSON Point or an Array of numbers\");\n}\nfunction getCoords(coords) {\n  if (Array.isArray(coords)) {\n    return coords;\n  }\n  if (coords.type === \"Feature\") {\n    if (coords.geometry !== null) {\n      return coords.geometry.coordinates;\n    }\n  } else {\n    if (coords.coordinates) {\n      return coords.coordinates;\n    }\n  }\n  throw new Error(\n    \"coords must be GeoJSON Feature, Geometry Object or an Array\"\n  );\n}\nfunction containsNumber(coordinates) {\n  if (coordinates.length > 1 && isNumber(coordinates[0]) && isNumber(coordinates[1])) {\n    return true;\n  }\n  if (Array.isArray(coordinates[0]) && coordinates[0].length) {\n    return containsNumber(coordinates[0]);\n  }\n  throw new Error(\"coordinates must only contain numbers\");\n}\nfunction geojsonType(value, type, name) {\n  if (!type || !name) {\n    throw new Error(\"type and name required\");\n  }\n  if (!value || value.type !== type) {\n    throw new Error(\n      \"Invalid input to \" + name + \": must be a \" + type + \", given \" + value.type\n    );\n  }\n}\nfunction featureOf(feature, type, name) {\n  if (!feature) {\n    throw new Error(\"No feature passed\");\n  }\n  if (!name) {\n    throw new Error(\".featureOf() requires a name\");\n  }\n  if (!feature || feature.type !== \"Feature\" || !feature.geometry) {\n    throw new Error(\n      \"Invalid input to \" + name + \", Feature with geometry required\"\n    );\n  }\n  if (!feature.geometry || feature.geometry.type !== type) {\n    throw new Error(\n      \"Invalid input to \" + name + \": must be a \" + type + \", given \" + feature.geometry.type\n    );\n  }\n}\nfunction collectionOf(featureCollection, type, name) {\n  if (!featureCollection) {\n    throw new Error(\"No featureCollection passed\");\n  }\n  if (!name) {\n    throw new Error(\".collectionOf() requires a name\");\n  }\n  if (!featureCollection || featureCollection.type !== \"FeatureCollection\") {\n    throw new Error(\n      \"Invalid input to \" + name + \", FeatureCollection required\"\n    );\n  }\n  for (const feature of featureCollection.features) {\n    if (!feature || feature.type !== \"Feature\" || !feature.geometry) {\n      throw new Error(\n        \"Invalid input to \" + name + \", Feature with geometry required\"\n      );\n    }\n    if (!feature.geometry || feature.geometry.type !== type) {\n      throw new Error(\n        \"Invalid input to \" + name + \": must be a \" + type + \", given \" + feature.geometry.type\n      );\n    }\n  }\n}\nfunction getGeom(geojson) {\n  if (geojson.type === \"Feature\") {\n    return geojson.geometry;\n  }\n  return geojson;\n}\nfunction getType(geojson, _name) {\n  if (geojson.type === \"FeatureCollection\") {\n    return \"FeatureCollection\";\n  }\n  if (geojson.type === \"GeometryCollection\") {\n    return \"GeometryCollection\";\n  }\n  if (geojson.type === \"Feature\" && geojson.geometry !== null) {\n    return geojson.geometry.type;\n  }\n  return geojson.type;\n}\nexport {\n  collectionOf,\n  containsNumber,\n  featureOf,\n  geojsonType,\n  getCoord,\n  getCoords,\n  getGeom,\n  getType\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { convex } from \"@turf/convex\";\nimport { centroid } from \"@turf/centroid\";\nimport { point } from \"@turf/helpers\";\nimport { getType, getCoord } from \"@turf/invariant\";\nimport { coordEach } from \"@turf/meta\";\nfunction centerOfMass(geojson, options = {}) {\n  switch (getType(geojson)) {\n    case \"Point\":\n      return point(getCoord(geojson), options.properties);\n    case \"Polygon\":\n      var coords = [];\n      coordEach(geojson, function(coord) {\n        coords.push(coord);\n      });\n      var centre = centroid(geojson, { properties: options.properties });\n      var translation = centre.geometry.coordinates;\n      var sx = 0;\n      var sy = 0;\n      var sArea = 0;\n      var i, pi, pj, xi, xj, yi, yj, a;\n      var neutralizedPoints = coords.map(function(point2) {\n        return [point2[0] - translation[0], point2[1] - translation[1]];\n      });\n      for (i = 0; i < coords.length - 1; i++) {\n        pi = neutralizedPoints[i];\n        xi = pi[0];\n        yi = pi[1];\n        pj = neutralizedPoints[i + 1];\n        xj = pj[0];\n        yj = pj[1];\n        a = xi * yj - xj * yi;\n        sArea += a;\n        sx += (xi + xj) * a;\n        sy += (yi + yj) * a;\n      }\n      if (sArea === 0) {\n        return centre;\n      } else {\n        var area = sArea * 0.5;\n        var areaFactor = 1 / (6 * area);\n        return point(\n          [translation[0] + areaFactor * sx, translation[1] + areaFactor * sy],\n          options.properties\n        );\n      }\n    default:\n      var hull = convex(geojson);\n      if (hull) return centerOfMass(hull, { properties: options.properties });\n      else return centroid(geojson, { properties: options.properties });\n  }\n}\nvar index_default = centerOfMass;\nexport {\n  centerOfMass,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map"],"names":["earthRadius","feature","geom","properties","options","feat","point","coordinates","isNumber","polygon","ring","j","num","coordEach","geojson","callback","excludeWrapCoord","k","l","geometry","stopG","coords","geometryMaybeCollection","wrapShrink","coordIndex","isGeometryCollection","type","isFeatureCollection","isFeature","stop","featureIndex","geomIndex","multiFeatureIndex","geometryIndex","geomType","geomEach","i","featureProperties","featureBBox","featureId","geomReduce","initialValue","previousValue","currentGeometry","t","module","this","r","e","a","h","n","o","s","f","u","m","c","d","p","x","v","M","TinyQueue","data","compare","defaultCompare","item","top","bottom","pos","parent","current","halfLength","left","best","right","b","flat","vs","start","end","y","inside","len","xi","yi","xj","yj","intersect","nested","pointInPolygonFlat","require$$0","pointInPolygonNested","require$$1","pointInPolygonModule","exports","_","w","A","F","O","g","q","z","B","C","D","E","G","H","I","J","K","L","N","Q","RBush","Queue","pointInPolygon","require$$2","orient","require$$3","concavemanModule","concaveman","points","concavity","lengthThreshold","hull","fastConvexHull","tree","queue","last","insertNode","segTree","updateBBox","sqConcavity","sqLenThreshold","node","sqLen","getSqDist","maxSqLen","findCandidate","concave","maxDist","compareDist","child","dist","sqSegDist","sqSegBoxDist","d0","d1","noIntersections","bbox","sqSegSegDist","d2","d3","d4","minX","minY","maxX","maxY","edges","intersects","cross","p1","p2","p3","q1","q2","cull","filtered","convexHull","prev","dx","dy","x0","y0","x1","y1","x2","y2","x3","y3","ux","uy","vx","vy","wx","wy","sc","sN","tc","tN","sD","tD","cx","cy","cx2","cy2","compareByX","lower","upper","ii","convex","coord","centroid","xSum","ySum","getCoord","getType","_name","centerOfMass","centre","translation","sx","sy","sArea","pi","pj","neutralizedPoints","point2","area","areaFactor","index_default"],"mappings":"iEACG,IAACA,GAAc,YAmClB,SAASC,GAAQC,EAAMC,EAAYC,EAAU,CAAA,EAAI,CAC/C,MAAMC,EAAO,CAAE,KAAM,SAAS,EAC9B,OAAID,EAAQ,KAAO,GAAKA,EAAQ,MAC9BC,EAAK,GAAKD,EAAQ,IAEhBA,EAAQ,OACVC,EAAK,KAAOD,EAAQ,MAEtBC,EAAK,WAAaF,GAAc,CAAA,EAChCE,EAAK,SAAWH,EACTG,CACT,CAmBA,SAASC,GAAMC,EAAaJ,EAAYC,EAAU,CAAA,EAAI,CACpD,GAAI,CAACG,EACH,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAI,CAAC,MAAM,QAAQA,CAAW,EAC5B,MAAM,IAAI,MAAM,8BAA8B,EAEhD,GAAIA,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM,6CAA6C,EAE/D,GAAI,CAACC,GAASD,EAAY,CAAC,CAAC,GAAK,CAACC,GAASD,EAAY,CAAC,CAAC,EACvD,MAAM,IAAI,MAAM,kCAAkC,EAMpD,OAAON,GAJM,CACX,KAAM,QACN,YAAAM,CACJ,EACuBJ,EAAYC,CAAO,CAC1C,CASA,SAASK,GAAQF,EAAaJ,EAAYC,EAAU,CAAA,EAAI,CACtD,UAAWM,KAAQH,EAAa,CAC9B,GAAIG,EAAK,OAAS,EAChB,MAAM,IAAI,MACR,6DACR,EAEI,GAAIA,EAAKA,EAAK,OAAS,CAAC,EAAE,SAAWA,EAAK,CAAC,EAAE,OAC3C,MAAM,IAAI,MAAM,6CAA6C,EAE/D,QAASC,EAAI,EAAGA,EAAID,EAAKA,EAAK,OAAS,CAAC,EAAE,OAAQC,IAChD,GAAID,EAAKA,EAAK,OAAS,CAAC,EAAEC,CAAC,IAAMD,EAAK,CAAC,EAAEC,CAAC,EACxC,MAAM,IAAI,MAAM,6CAA6C,CAGnE,CAKA,OAAOV,GAJM,CACX,KAAM,UACN,YAAAM,CACJ,EACuBJ,EAAYC,CAAO,CAC1C,CAsIA,SAASI,GAASI,EAAK,CACrB,MAAO,CAAC,MAAMA,CAAG,GAAKA,IAAQ,MAAQ,CAAC,MAAM,QAAQA,CAAG,CAC1D,CCxPA,SAASC,GAAUC,EAASC,EAAUC,EAAkB,CACtD,GAAIF,IAAY,KAEhB,QADIH,EAAGM,EAAGC,EAAGC,EAAUC,EAAOC,EAAQC,EAAyBC,EAAa,EAAGC,EAAa,EAAGC,EAAsBC,EAAOZ,EAAQ,KAAMa,EAAsBD,IAAS,oBAAqBE,EAAYF,IAAS,UAAWG,EAAOF,EAAsBb,EAAQ,SAAS,OAAS,EAC5QgB,EAAe,EAAGA,EAAeD,EAAMC,IAAgB,CAC9DR,EAA0BK,EAExBb,EAAQ,SAASgB,CAAY,EAAE,SAC7BF,EAEFd,EAAQ,SACNA,EACJW,EAAuBH,EAA0BA,EAAwB,OAAS,qBAAuB,GACzGF,EAAQK,EAAuBH,EAAwB,WAAW,OAAS,EAC3E,QAASS,EAAY,EAAGA,EAAYX,EAAOW,IAAa,CACtD,IAAIC,EAAoB,EACpBC,EAAgB,EAEpB,GADAd,EAAWM,EAAuBH,EAAwB,WAAWS,CAAS,EAAIT,EAC9EH,IAAa,KACjB,CAAAE,EAASF,EAAS,YAClB,IAAIe,EAAWf,EAAS,KAExB,OADAI,EAAaP,IAAqBkB,IAAa,WAAaA,IAAa,gBAAkB,EAAI,EACvFA,EAAQ,CACd,KAAK,KACH,MACF,IAAK,QACH,GAEEnB,EACEM,EACAG,EACAM,EACAE,EACAC,CACd,IAAkB,GAEN,MAAO,GACTT,IACAQ,IACA,MACF,IAAK,aACL,IAAK,aACH,IAAKrB,EAAI,EAAGA,EAAIU,EAAO,OAAQV,IAAK,CAClC,GAEEI,EACEM,EAAOV,CAAC,EACRa,EACAM,EACAE,EACAC,CAChB,IAAoB,GAEN,MAAO,GACTT,IACIU,IAAa,cAAcF,GACjC,CACIE,IAAa,cAAcF,IAC/B,MACF,IAAK,UACL,IAAK,kBACH,IAAKrB,EAAI,EAAGA,EAAIU,EAAO,OAAQV,IAAK,CAClC,IAAKM,EAAI,EAAGA,EAAII,EAAOV,CAAC,EAAE,OAASY,EAAYN,IAAK,CAClD,GAEEF,EACEM,EAAOV,CAAC,EAAEM,CAAC,EACXO,EACAM,EACAE,EACAC,CAClB,IAAsB,GAEN,MAAO,GACTT,GACF,CACIU,IAAa,mBAAmBF,IAChCE,IAAa,WAAWD,GAC9B,CACIC,IAAa,WAAWF,IAC5B,MACF,IAAK,eACH,IAAKrB,EAAI,EAAGA,EAAIU,EAAO,OAAQV,IAAK,CAElC,IADAsB,EAAgB,EACXhB,EAAI,EAAGA,EAAII,EAAOV,CAAC,EAAE,OAAQM,IAAK,CACrC,IAAKC,EAAI,EAAGA,EAAIG,EAAOV,CAAC,EAAEM,CAAC,EAAE,OAASM,EAAYL,IAAK,CACrD,GAEEH,EACEM,EAAOV,CAAC,EAAEM,CAAC,EAAEC,CAAC,EACdM,EACAM,EACAE,EACAC,CACpB,IAAwB,GAEN,MAAO,GACTT,GACF,CACAS,GACF,CACAD,GACF,CACA,MACF,IAAK,qBACH,IAAKrB,EAAI,EAAGA,EAAIQ,EAAS,WAAW,OAAQR,IAC1C,GAEEE,GAAUM,EAAS,WAAWR,CAAC,EAAGI,EAAUC,CAAgB,IAAM,GAElE,MAAO,GACX,MACF,QACE,MAAM,IAAI,MAAM,uBAAuB,CACjD,EACI,CACF,CACF,CAuEA,SAASmB,GAASrB,EAASC,EAAU,CACnC,IAAIqB,EAAGzB,EAAG,EAAGQ,EAAUC,EAAOE,EAAyBG,EAAsBY,EAAmBC,EAAaC,EAAWT,EAAe,EAAGH,EAAsBb,EAAQ,OAAS,oBAAqBc,EAAYd,EAAQ,OAAS,UAAWe,EAAOF,EAAsBb,EAAQ,SAAS,OAAS,EACrS,IAAKsB,EAAI,EAAGA,EAAIP,EAAMO,IAAK,CA+BzB,IA9BAd,EAA0BK,EAExBb,EAAQ,SAASsB,CAAC,EAAE,SAClBR,EAEFd,EAAQ,SACNA,EACJuB,EAAoBV,EAElBb,EAAQ,SAASsB,CAAC,EAAE,WAClBR,EAEFd,EAAQ,WACN,CAAA,EACJwB,EAAcX,EAEZb,EAAQ,SAASsB,CAAC,EAAE,KAClBR,EAEFd,EAAQ,KACN,OACJyB,EAAYZ,EAEVb,EAAQ,SAASsB,CAAC,EAAE,GAClBR,EAEFd,EAAQ,GACN,OACJW,EAAuBH,EAA0BA,EAAwB,OAAS,qBAAuB,GACzGF,EAAQK,EAAuBH,EAAwB,WAAW,OAAS,EACtE,EAAI,EAAG,EAAIF,EAAO,IAAK,CAE1B,GADAD,EAAWM,EAAuBH,EAAwB,WAAW,CAAC,EAAIA,EACtEH,IAAa,KAAM,CACrB,GAEEJ,EAEE,KACAe,EACAO,EACAC,EACAC,CACZ,IAAgB,GAEN,MAAO,GACT,QACF,CACA,OAAQpB,EAAS,KAAI,CACnB,IAAK,QACL,IAAK,aACL,IAAK,aACL,IAAK,UACL,IAAK,kBACL,IAAK,eAAgB,CACnB,GAEEJ,EACEI,EACAW,EACAO,EACAC,EACAC,CACd,IAAkB,GAEN,MAAO,GACT,KACF,CACA,IAAK,qBAAsB,CACzB,IAAK5B,EAAI,EAAGA,EAAIQ,EAAS,WAAW,OAAQR,IAC1C,GAEEI,EACEI,EAAS,WAAWR,CAAC,EACrBmB,EACAO,EACAC,EACAC,CAChB,IAAoB,GAEN,MAAO,GAEX,KACF,CACA,QACE,MAAM,IAAI,MAAM,uBAAuB,CACjD,CACI,CACAT,GACF,CACF,CACA,SAASU,GAAW1B,EAASC,EAAU0B,EAAc,CACnD,IAAIC,EAAgBD,EACpB,OAAAN,GACErB,EACA,SAAS6B,EAAiBb,EAAcO,EAAmBC,EAAaC,EAAW,CAC7ET,IAAiB,GAAKW,IAAiB,OACzCC,EAAgBC,EAEhBD,EAAgB3B,EAEd2B,EACAC,EACAb,EACAO,EACAC,EACAC,CACV,CACI,CACJ,EACSG,CACT,qGC9SC,SAASE,EAAER,EAAE,CAAsDS,UAAeT,EAAC,CAAwE,GAAEU,GAAK,UAAU,CAAc,SAASF,EAAE,EAAEG,EAAEC,EAAEC,EAAEC,EAAE,EAAE,SAASN,EAAEO,EAAEJ,EAAEC,EAAEC,EAAEC,EAAE,CAAC,KAAKD,EAAED,GAAG,CAAC,GAAGC,EAAED,EAAE,IAAI,CAAC,IAAII,EAAEH,EAAED,EAAE,EAAEK,EAAEN,EAAEC,EAAE,EAAE9B,EAAE,KAAK,IAAIkC,CAAC,EAAEE,EAAE,GAAG,KAAK,IAAI,EAAEpC,EAAE,CAAC,EAAEqC,EAAE,GAAG,KAAK,KAAKrC,EAAEoC,GAAGF,EAAEE,GAAGF,CAAC,GAAGC,EAAED,EAAE,EAAE,EAAE,GAAG,GAAGI,EAAE,KAAK,IAAIR,EAAE,KAAK,MAAMD,EAAEM,EAAEC,EAAEF,EAAEG,CAAC,CAAC,EAAEE,EAAE,KAAK,IAAIR,EAAE,KAAK,MAAMF,GAAGK,EAAEC,GAAGC,EAAEF,EAAEG,CAAC,CAAC,EAAEX,EAAEO,EAAEJ,EAAES,EAAEC,EAAEP,CAAC,CAAC,CAAC,IAAI,EAAEC,EAAEJ,CAAC,EAAEW,EAAEV,EAAE,EAAEC,EAAE,IAAIb,EAAEe,EAAEH,EAAED,CAAC,EAAEG,EAAEC,EAAEF,CAAC,EAAE,CAAC,EAAE,GAAGb,EAAEe,EAAEH,EAAEC,CAAC,EAAES,EAAE,GAAG,CAAC,IAAItB,EAAEe,EAAEO,EAAE,CAAC,EAAEA,IAAI,IAAIR,EAAEC,EAAEO,CAAC,EAAE,CAAC,EAAE,GAAGA,IAAI,KAAKR,EAAEC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,CAAKD,EAAEC,EAAEH,CAAC,EAAE,CAAC,IAAZ,EAAcZ,EAAEe,EAAEH,EAAE,CAAC,EAAEZ,EAAEe,EAAE,EAAE,EAAEF,CAAC,EAAE,GAAGF,IAAIC,EAAE,EAAE,GAAGD,GAAG,IAAIE,EAAE,EAAE,EAAE,CAAC,GAAE,EAAEF,EAAEC,GAAG,EAAEC,GAAG,EAAE,OAAO,EAAEC,GAAGC,CAAC,CAAC,CAAC,SAASf,EAAE,EAAE,EAAEe,EAAE,CAAC,IAAIJ,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAEI,CAAC,EAAE,EAAEA,CAAC,EAAEJ,CAAC,CAAC,SAASI,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,IAAIJ,EAAE,SAAS,EAAE,CAAU,IAAT,SAAa,EAAE,GAAG,KAAK,YAAY,KAAK,IAAI,EAAE,CAAC,EAAE,KAAK,YAAY,KAAK,IAAI,EAAE,KAAK,KAAK,GAAG,KAAK,WAAW,CAAC,EAAE,KAAK,MAAK,CAAE,EAAE,SAASC,EAAE,EAAE,EAAEG,EAAE,CAAC,GAAG,CAACA,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,QAAQJ,EAAE,EAAEA,EAAE,EAAE,OAAOA,IAAI,GAAGI,EAAE,EAAE,EAAEJ,CAAC,CAAC,EAAE,OAAOA,EAAE,MAAM,EAAE,CAAC,SAASE,EAAE,EAAE,EAAE,CAACC,EAAE,EAAE,EAAE,EAAE,SAAS,OAAO,EAAE,CAAC,CAAC,CAAC,SAASA,EAAE,EAAE,EAAEC,EAAEJ,EAAEC,EAAE,CAACA,IAAIA,EAAEW,EAAE,IAAI,GAAGX,EAAE,KAAK,IAAIA,EAAE,KAAK,IAAIA,EAAE,KAAK,KAAKA,EAAE,KAAK,KAAK,QAAQ,EAAE,EAAE,EAAEG,EAAE,IAAI,CAAC,IAAID,EAAE,EAAE,SAAS,CAAC,EAAEE,EAAEJ,EAAE,EAAE,KAAKD,EAAEG,CAAC,EAAEA,CAAC,CAAC,CAAC,OAAOF,CAAC,CAAC,SAASI,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,SAASC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,SAASnC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,SAASoC,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,SAASC,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,SAASC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,SAASC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,SAASE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,SAASD,EAAEtB,EAAEe,EAAE,EAAE,EAAEF,EAAE,CAAC,QAAQC,EAAE,CAACC,EAAE,CAAC,EAAED,EAAE,QAAQ,GAAG,GAAG,EAAEA,EAAE,IAAG,IAAKC,EAAED,EAAE,IAAG,IAAK,GAAG,CAAC,IAAI,EAAEC,EAAE,KAAK,MAAM,EAAEA,GAAG,EAAE,CAAC,EAAE,EAAEP,EAAER,EAAE,EAAEe,EAAE,EAAEF,CAAC,EAAEC,EAAE,KAAKC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAOJ,EAAE,UAAU,IAAI,UAAU,CAAC,OAAO,KAAK,KAAK,KAAK,KAAK,EAAE,CAAC,EAAEA,EAAE,UAAU,OAAO,SAAS,EAAE,CAAC,IAAI,EAAE,KAAK,KAAKI,EAAE,CAAA,EAAG,GAAG,CAACM,EAAE,EAAE,CAAC,EAAE,OAAON,EAAE,QAAQJ,EAAE,KAAK,OAAOC,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,SAAS,OAAO,IAAI,CAAC,IAAIE,EAAE,EAAE,SAAS,CAAC,EAAEE,EAAE,EAAE,KAAKL,EAAEG,CAAC,EAAEA,EAAEO,EAAE,EAAEL,CAAC,IAAI,EAAE,KAAKD,EAAE,KAAKD,CAAC,EAAEM,EAAE,EAAEJ,CAAC,EAAE,KAAK,KAAKF,EAAEC,CAAC,EAAEH,EAAE,KAAKE,CAAC,EAAE,CAAC,EAAEF,EAAE,KAAK,CAAC,OAAOG,CAAC,EAAEJ,EAAE,UAAU,SAAS,SAAS,EAAE,CAAC,IAAI,EAAE,KAAK,KAAK,GAAG,CAACU,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,QAAQN,EAAE,GAAG,GAAG,CAAC,QAAQJ,EAAE,EAAEA,EAAE,EAAE,SAAS,OAAOA,IAAI,CAAC,IAAIC,EAAE,EAAE,SAASD,CAAC,EAAE,EAAE,EAAE,KAAK,KAAK,OAAOC,CAAC,EAAEA,EAAE,GAAGS,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,MAAMD,EAAE,EAAE,CAAC,EAAE,MAAM,GAAGL,EAAE,KAAKH,CAAC,CAAC,CAAC,CAAC,EAAEG,EAAE,KAAK,CAAC,MAAM,EAAE,EAAEJ,EAAE,UAAU,KAAK,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,OAAO,KAAK,GAAG,EAAE,OAAO,KAAK,YAAY,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,OAAO,IAAI,KAAK,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,IAAI,CAAC,IAAII,EAAE,KAAK,OAAO,EAAE,MAAK,EAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,KAAK,KAAK,SAAS,OAAO,GAAG,KAAK,KAAK,SAASA,EAAE,OAAO,KAAK,WAAW,KAAK,KAAKA,CAAC,MAAM,CAAC,GAAG,KAAK,KAAK,OAAOA,EAAE,OAAO,CAAC,IAAIJ,EAAE,KAAK,KAAK,KAAK,KAAKI,EAAEA,EAAEJ,CAAC,CAAC,KAAK,QAAQI,EAAE,KAAK,KAAK,OAAOA,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,KAAK,KAAKA,EAAE,OAAO,IAAI,EAAEJ,EAAE,UAAU,OAAO,SAAS,EAAE,CAAC,OAAO,GAAG,KAAK,QAAQ,EAAE,KAAK,KAAK,OAAO,CAAC,EAAE,IAAI,EAAEA,EAAE,UAAU,MAAM,UAAU,CAAC,OAAO,KAAK,KAAKY,EAAE,CAAA,CAAE,EAAE,IAAI,EAAEZ,EAAE,UAAU,OAAO,SAAS,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK,QAAQI,EAAEJ,EAAEE,EAAEC,EAAE,KAAK,KAAK,EAAE,KAAK,OAAO,CAAC,EAAEG,EAAE,CAAA,EAAGnC,EAAE,CAAA,EAAGgC,GAAGG,EAAE,QAAQ,CAAC,GAAGH,IAAIA,EAAEG,EAAE,IAAG,EAAGN,EAAEM,EAAEA,EAAE,OAAO,CAAC,EAAEF,EAAEjC,EAAE,MAAM+B,EAAE,IAAIC,EAAE,KAAK,CAAC,IAAII,EAAEN,EAAE,EAAEE,EAAE,SAAS,CAAC,EAAE,GAAQI,IAAL,GAAO,OAAOJ,EAAE,SAAS,OAAOI,EAAE,CAAC,EAAED,EAAE,KAAKH,CAAC,EAAE,KAAK,UAAUG,CAAC,EAAE,IAAI,CAACJ,GAAGC,EAAE,MAAM,CAACM,EAAEN,EAAE,CAAC,EAAEH,GAAGI,IAAID,EAAEH,EAAE,SAASI,CAAC,EAAEF,EAAE,IAAIC,EAAE,MAAMG,EAAE,KAAKH,CAAC,EAAEhC,EAAE,KAAKiC,CAAC,EAAEA,EAAE,EAAEJ,EAAEG,EAAEA,EAAEA,EAAE,SAAS,CAAC,EAAE,CAAC,OAAO,IAAI,EAAEH,EAAE,UAAU,OAAO,SAAS,EAAE,CAAC,OAAO,CAAC,EAAEA,EAAE,UAAU,YAAY,SAAS,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAEA,EAAE,UAAU,YAAY,SAAS,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAEA,EAAE,UAAU,OAAO,UAAU,CAAC,OAAO,KAAK,IAAI,EAAEA,EAAE,UAAU,SAAS,SAAS,EAAE,CAAC,OAAO,KAAK,KAAK,EAAE,IAAI,EAAEA,EAAE,UAAU,KAAK,SAAS,EAAE,EAAE,CAAC,QAAQI,EAAE,CAAA,EAAG,GAAG,EAAE,KAAK,EAAE,KAAK,MAAM,EAAE,EAAE,QAAQ,EAAEA,EAAE,KAAK,MAAMA,EAAE,EAAE,QAAQ,EAAE,EAAEA,EAAE,IAAG,EAAG,OAAO,CAAC,EAAEJ,EAAE,UAAU,OAAO,SAAS,EAAE,EAAEI,EAAEJ,EAAE,CAAC,IAAIC,EAAEE,EAAEC,EAAE,EAAE,EAAE,EAAE,KAAK,YAAY,GAAGD,GAAG,EAAE,OAAOD,EAAED,EAAEW,EAAE,EAAE,MAAM,EAAER,EAAE,CAAC,CAAC,EAAE,KAAK,MAAM,EAAEH,EAAED,IAAIA,EAAE,KAAK,KAAK,KAAK,IAAIG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,EAAE,KAAK,KAAKA,EAAE,KAAK,IAAI,EAAEH,EAAE,CAAC,CAAC,IAAIC,EAAEW,EAAE,CAAA,CAAE,GAAG,KAAK,GAAGX,EAAE,OAAOD,EAAE,IAAIM,EAAE,KAAK,KAAKH,EAAE,CAAC,EAAEhC,EAAEmC,EAAE,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC,EAAEK,EAAE,EAAE,EAAEP,EAAEjC,EAAE,KAAK,WAAW,EAAE,QAAQoC,EAAE,EAAEA,GAAGH,EAAEG,GAAGpC,EAAE,CAAC,IAAIqC,EAAE,KAAK,IAAID,EAAEpC,EAAE,EAAEiC,CAAC,EAAEO,EAAE,EAAEJ,EAAEC,EAAEF,EAAE,KAAK,WAAW,EAAE,QAAQG,EAAEF,EAAEE,GAAGD,EAAEC,GAAGH,EAAE,CAAC,IAAII,EAAE,KAAK,IAAID,EAAEH,EAAE,EAAEE,CAAC,EAAEP,EAAE,SAAS,KAAK,KAAK,OAAO,EAAEQ,EAAEC,EAAEV,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAOE,EAAED,EAAE,KAAK,MAAM,EAAEA,CAAC,EAAED,EAAE,UAAU,eAAe,SAAS,EAAE,EAAEI,EAAEJ,EAAE,CAAC,KAAKA,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,MAAMA,EAAE,OAAO,IAAII,GAAG,CAAC,QAAQH,EAAE,IAAI,EAAE,IAAIE,EAAE,OAAOE,EAAE,EAAEA,EAAE,EAAE,SAAS,OAAOA,IAAI,CAAC,IAAIC,EAAE,EAAE,SAASD,CAAC,EAAElC,EAAEoC,EAAED,CAAC,EAAEE,GAAGC,EAAE,EAAEC,EAAEJ,GAAG,KAAK,IAAII,EAAE,KAAKD,EAAE,IAAI,EAAE,KAAK,IAAIC,EAAE,KAAKD,EAAE,IAAI,IAAI,KAAK,IAAIC,EAAE,KAAKD,EAAE,IAAI,EAAE,KAAK,IAAIC,EAAE,KAAKD,EAAE,IAAI,GAAGtC,GAAGqC,EAAE,GAAG,EAAEA,EAAEP,EAAE9B,EAAE8B,EAAE9B,EAAE8B,EAAEE,EAAEG,GAAGE,IAAI,GAAGrC,EAAE8B,IAAIA,EAAE9B,EAAEgC,EAAEG,EAAE,CAAC,EAAEH,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,IAAIM,EAAEC,EAAE,OAAO,CAAC,EAAEV,EAAE,UAAU,QAAQ,SAAS,EAAE,EAAEI,EAAE,CAAC,IAAIJ,EAAEI,EAAE,EAAE,KAAK,OAAO,CAAC,EAAEH,EAAE,CAAA,EAAG,EAAE,KAAK,eAAeD,EAAE,KAAK,KAAK,EAAEC,CAAC,EAAE,IAAI,EAAE,SAAS,KAAK,CAAC,EAAEI,EAAE,EAAEL,CAAC,EAAE,GAAG,GAAGC,EAAE,CAAC,EAAE,SAAS,OAAO,KAAK,aAAa,KAAK,OAAOA,EAAE,CAAC,EAAE,IAAI,KAAK,oBAAoBD,EAAEC,EAAE,CAAC,CAAC,EAAED,EAAE,UAAU,OAAO,SAAS,EAAE,EAAE,CAAC,IAAII,EAAE,EAAE,CAAC,EAAEJ,EAAEI,EAAE,SAAS,OAAOH,EAAE,KAAK,YAAY,KAAK,iBAAiBG,EAAEH,EAAED,CAAC,EAAE,IAAIG,EAAE,KAAK,kBAAkBC,EAAEH,EAAED,CAAC,EAAE,EAAEY,EAAER,EAAE,SAAS,OAAOD,EAAEC,EAAE,SAAS,OAAOD,CAAC,CAAC,EAAE,EAAE,OAAOC,EAAE,OAAO,EAAE,KAAKA,EAAE,KAAKF,EAAEE,EAAE,KAAK,MAAM,EAAEF,EAAE,EAAE,KAAK,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,KAAK,WAAWE,EAAE,CAAC,CAAC,EAAEJ,EAAE,UAAU,WAAW,SAAS,EAAE,EAAE,CAAC,KAAK,KAAKY,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,OAAO,EAAE,OAAO,EAAE,KAAK,KAAK,KAAK,GAAGV,EAAE,KAAK,KAAK,KAAK,MAAM,CAAC,EAAEF,EAAE,UAAU,kBAAkB,SAAS,EAAE,EAAEI,EAAE,CAAC,QAAQJ,EAAEC,EAAE,EAAE,EAAEK,EAAEnC,EAAEqC,EAAEC,EAAE,IAAIC,EAAE,IAAIE,EAAE,EAAEA,GAAGR,EAAE,EAAEQ,IAAI,CAAC,IAAID,EAAER,EAAE,EAAE,EAAES,EAAE,KAAK,MAAM,EAAEC,EAAEV,EAAE,EAAES,EAAER,EAAE,KAAK,MAAM,EAAEU,GAAGb,EAAEU,EAAE,EAAEE,EAAE,EAAE,OAAOP,EAAE,OAAOnC,EAAE,OAAOqC,EAAE,OAAO,EAAE,KAAK,IAAIP,EAAE,KAAK,EAAE,IAAI,EAAEK,EAAE,KAAK,IAAIL,EAAE,KAAK,EAAE,IAAI,EAAE9B,EAAE,KAAK,IAAI8B,EAAE,KAAK,EAAE,IAAI,EAAEO,EAAE,KAAK,IAAIP,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE9B,EAAE,CAAC,EAAE,KAAK,IAAI,EAAEqC,EAAEF,CAAC,GAAGS,EAAER,EAAEI,CAAC,EAAEJ,EAAEM,CAAC,EAAEC,EAAEL,GAAGA,EAAEK,EAAEd,EAAEY,EAAEF,EAAEK,EAAEL,EAAEK,EAAEL,GAAGI,IAAIL,GAAGM,EAAEL,IAAIA,EAAEK,EAAEf,EAAEY,EAAE,CAAC,OAAOZ,GAAGI,EAAE,CAAC,EAAEJ,EAAE,UAAU,iBAAiB,SAAS,EAAE,EAAEI,EAAE,CAAC,IAAIJ,EAAE,EAAE,KAAK,KAAK,YAAYM,EAAEL,EAAE,EAAE,KAAK,KAAK,YAAY9B,EAAE,KAAK,eAAe,EAAE,EAAEiC,EAAEJ,CAAC,EAAE,KAAK,eAAe,EAAE,EAAEI,EAAEH,CAAC,GAAG,EAAE,SAAS,KAAKD,CAAC,CAAC,EAAEA,EAAE,UAAU,eAAe,SAAS,EAAE,EAAEI,EAAEJ,EAAE,CAAC,EAAE,SAAS,KAAKA,CAAC,EAAE,QAAQC,EAAE,KAAK,OAAO,EAAEE,EAAE,EAAE,EAAE,EAAEF,CAAC,EAAEK,EAAEH,EAAE,EAAEC,EAAE,EAAEA,EAAEH,CAAC,EAAE9B,EAAEqC,EAAE,CAAC,EAAEA,EAAEF,CAAC,EAAEC,EAAE,EAAEA,EAAEH,EAAE,EAAEG,IAAI,CAAC,IAAI,EAAE,EAAE,SAASA,CAAC,EAAEF,EAAE,EAAE,EAAE,KAAKJ,EAAE,CAAC,EAAE,CAAC,EAAE9B,GAAGqC,EAAE,CAAC,CAAC,CAAC,QAAQE,EAAEN,EAAE,EAAE,EAAEM,GAAG,EAAEA,IAAI,CAAC,IAAIE,EAAE,EAAE,SAASF,CAAC,EAAEL,EAAEC,EAAE,EAAE,KAAKL,EAAEW,CAAC,EAAEA,CAAC,EAAEzC,GAAGqC,EAAEF,CAAC,CAAC,CAAC,OAAOnC,CAAC,EAAE6B,EAAE,UAAU,oBAAoB,SAAS,EAAE,EAAEI,EAAE,CAAC,QAAQJ,EAAEI,EAAEJ,GAAG,EAAEA,IAAIK,EAAE,EAAEL,CAAC,EAAE,CAAC,CAAC,EAAEA,EAAE,UAAU,UAAU,SAAS,EAAE,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAEI,EAAE,OAAO,GAAG,EAAE,IAAQ,EAAE,CAAC,EAAE,SAAS,SAAlB,EAAyB,EAAE,GAAGA,EAAE,EAAE,EAAE,CAAC,EAAE,UAAU,OAAOA,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,MAAK,EAAGF,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAEF,CAAC,CAAC,oBCC9yM,MAAMgB,EAAU,CAC3B,YAAYC,EAAO,GAAIC,EAAUC,GAAgB,CAK7C,GAJA,KAAK,KAAOF,EACZ,KAAK,OAAS,KAAK,KAAK,OACxB,KAAK,QAAUC,EAEX,KAAK,OAAS,EACd,QAAS7B,GAAK,KAAK,QAAU,GAAK,EAAGA,GAAK,EAAGA,IAAK,KAAK,MAAMA,CAAC,CAEtE,CAEA,KAAK+B,EAAM,CACP,KAAK,KAAK,KAAKA,CAAI,EACnB,KAAK,SACL,KAAK,IAAI,KAAK,OAAS,CAAC,CAC5B,CAEA,KAAM,CACF,GAAI,KAAK,SAAW,EAAG,OAEvB,MAAMC,EAAM,KAAK,KAAK,CAAC,EACjBC,EAAS,KAAK,KAAK,IAAG,EAC5B,YAAK,SAED,KAAK,OAAS,IACd,KAAK,KAAK,CAAC,EAAIA,EACf,KAAK,MAAM,CAAC,GAGTD,CACX,CAEA,MAAO,CACH,OAAO,KAAK,KAAK,CAAC,CACtB,CAEA,IAAIE,EAAK,CACL,KAAM,CAAC,KAAAN,EAAM,QAAAC,CAAO,EAAI,KAClBE,EAAOH,EAAKM,CAAG,EAErB,KAAOA,EAAM,GAAG,CACZ,MAAMC,EAAUD,EAAM,GAAM,EACtBE,EAAUR,EAAKO,CAAM,EAC3B,GAAIN,EAAQE,EAAMK,CAAO,GAAK,EAAG,MACjCR,EAAKM,CAAG,EAAIE,EACZF,EAAMC,CACV,CAEAP,EAAKM,CAAG,EAAIH,CAChB,CAEA,MAAMG,EAAK,CACP,KAAM,CAAC,KAAAN,EAAM,QAAAC,CAAO,EAAI,KAClBQ,EAAa,KAAK,QAAU,EAC5BN,EAAOH,EAAKM,CAAG,EAErB,KAAOA,EAAMG,GAAY,CACrB,IAAIC,GAAQJ,GAAO,GAAK,EACpBK,EAAOX,EAAKU,CAAI,EACpB,MAAME,EAAQF,EAAO,EAMrB,GAJIE,EAAQ,KAAK,QAAUX,EAAQD,EAAKY,CAAK,EAAGD,CAAI,EAAI,IACpDD,EAAOE,EACPD,EAAOX,EAAKY,CAAK,GAEjBX,EAAQU,EAAMR,CAAI,GAAK,EAAG,MAE9BH,EAAKM,CAAG,EAAIK,EACZL,EAAMI,CACV,CAEAV,EAAKM,CAAG,EAAIH,CAChB,CACJ,CAEA,SAASD,GAAejB,EAAG4B,EAAG,CAC1B,OAAO5B,EAAI4B,EAAI,GAAK5B,EAAI4B,EAAI,EAAI,CACpC,yMC9EAC,GAAiB,SAA6BxE,EAAOyE,EAAIC,EAAOC,EAAK,CACjE,IAAIrB,EAAItD,EAAM,CAAC,EAAG4E,EAAI5E,EAAM,CAAC,EACzB6E,EAAS,GACTH,IAAU,SAAWA,EAAQ,GAC7BC,IAAQ,SAAWA,EAAMF,EAAG,QAEhC,QADIK,GAAOH,EAAID,GAAO,EACb5C,EAAI,EAAGzB,EAAIyE,EAAM,EAAGhD,EAAIgD,EAAKzE,EAAIyB,IAAK,CAC3C,IAAIiD,EAAKN,EAAGC,EAAM5C,EAAE,EAAE,CAAC,EAAGkD,EAAKP,EAAGC,EAAM5C,EAAE,EAAE,CAAC,EACzCmD,EAAKR,EAAGC,EAAMrE,EAAE,EAAE,CAAC,EAAG6E,EAAKT,EAAGC,EAAMrE,EAAE,EAAE,CAAC,EACzC8E,EAAcH,EAAKJ,GAAQM,EAAKN,GAC5BtB,GAAK2B,EAAKF,IAAOH,EAAII,IAAOE,EAAKF,GAAMD,EAC3CI,IAAWN,EAAS,CAACA,EACjC,CACI,OAAOA,CACX,+CCXAO,GAAiB,SAA+BpF,EAAOyE,EAAIC,EAAOC,EAAK,CACnE,IAAIrB,EAAItD,EAAM,CAAC,EAAG4E,EAAI5E,EAAM,CAAC,EACzB6E,EAAS,GACTH,IAAU,SAAWA,EAAQ,GAC7BC,IAAQ,SAAWA,EAAMF,EAAG,QAEhC,QADIK,EAAMH,EAAMD,EACP5C,EAAI,EAAGzB,EAAIyE,EAAM,EAAGhD,EAAIgD,EAAKzE,EAAIyB,IAAK,CAC3C,IAAIiD,EAAKN,EAAG3C,EAAE4C,CAAK,EAAE,CAAC,EAAGM,EAAKP,EAAG3C,EAAE4C,CAAK,EAAE,CAAC,EACvCO,EAAKR,EAAGpE,EAAEqE,CAAK,EAAE,CAAC,EAAGQ,EAAKT,EAAGpE,EAAEqE,CAAK,EAAE,CAAC,EACvCS,EAAcH,EAAKJ,GAAQM,EAAKN,GAC5BtB,GAAK2B,EAAKF,IAAOH,EAAII,IAAOE,EAAKF,GAAMD,EAC3CI,IAAWN,EAAS,CAACA,EACjC,CACI,OAAOA,CACX,wDCjBA,IAAIQ,EAAqBC,GAAA,EACrBC,EAAuBC,GAAA,EAE3BC,OAAAA,GAAA,QAAiB,SAAyBzF,EAAOyE,EAAIC,EAAOC,EAAK,CAC7D,OAAIF,EAAG,OAAS,GAAK,MAAM,QAAQA,EAAG,CAAC,CAAC,EAC7Bc,EAAqBvF,EAAOyE,EAAIC,EAAOC,CAAG,EAE1CU,EAAmBrF,EAAOyE,EAAIC,EAAOC,CAAG,CAEvD,EACAc,GAAA,QAAA,OAAwBF,EACxBE,GAAA,QAAA,KAAsBJ,iGCXrB,SAAS/C,EAAEI,EAAE,CAAsDA,EAAEgD,CAAO,CAA0F,GAAElD,GAAK,SAASF,EAAE,CAAc,MAAkBO,EAAE,sBAAsB,SAASJ,EAAEH,EAAEI,EAAEG,EAAEJ,EAAEK,EAAE,CAAC,IAAIE,EAAElB,EAAEmB,EAAEE,EAAEJ,EAAEL,EAAE,CAAC,EAAEC,EAAEF,EAAE,CAAC,EAAEW,EAAE,EAAExC,EAAE,EAAE+B,EAAEI,GAAGJ,EAAE,CAACI,GAAGC,EAAED,EAAEA,EAAEL,EAAE,EAAEU,CAAC,IAAIJ,EAAEL,EAAEA,EAAEF,EAAE,EAAE7B,CAAC,GAAG,IAAIyC,EAAE,EAAE,GAAGD,EAAEd,GAAG1B,EAAEiC,EAAE,IAAIF,EAAEI,GAAGJ,EAAE,CAACI,GAAGE,EAAED,IAAIlB,EAAEiB,EAAEC,GAAGD,GAAGA,EAAEL,EAAE,EAAEU,CAAC,IAAIH,EAAED,IAAIlB,EAAEa,EAAEK,GAAGL,GAAGA,EAAEF,EAAE,EAAE7B,CAAC,GAAGoC,EAAElB,EAAMmB,IAAJ,IAAQH,EAAEO,GAAG,EAAEJ,GAAGG,EAAEd,GAAG1B,EAAEiC,GAAGF,EAAEI,GAAGJ,EAAE,CAACI,GAAGE,EAAED,IAAIlB,EAAEkB,EAAED,IAAII,EAAErB,EAAEkB,KAAKD,EAAEI,GAAGJ,EAAEL,EAAE,EAAEU,CAAC,IAAIH,EAAED,IAAIlB,EAAEkB,EAAEL,IAAIQ,EAAErB,EAAEkB,KAAKL,EAAEQ,GAAGR,EAAEF,EAAE,EAAE7B,CAAC,GAAGoC,EAAElB,EAAMmB,IAAJ,IAAQH,EAAEO,GAAG,EAAEJ,GAAG,KAAKG,EAAEd,GAAGW,EAAED,IAAIlB,EAAEkB,EAAED,IAAII,EAAErB,EAAEkB,KAAKD,EAAEI,GAAGJ,EAAEL,EAAE,EAAEU,CAAC,EAAEJ,EAAElB,EAAMmB,IAAJ,IAAQH,EAAEO,GAAG,EAAEJ,GAAG,KAAKrC,EAAEiC,GAAGI,EAAED,IAAIlB,EAAEkB,EAAEL,IAAIQ,EAAErB,EAAEkB,KAAKL,EAAEQ,GAAGR,EAAEF,EAAE,EAAE7B,CAAC,EAAEoC,EAAElB,EAAMmB,IAAJ,IAAQH,EAAEO,GAAG,EAAEJ,GAAG,OAAWD,IAAJ,GAAWK,IAAJ,IAAQP,EAAEO,GAAG,EAAEL,GAAGK,CAAC,CAAC,SAASP,EAAER,EAAE,CAAC,OAAO,IAAI,aAAaA,CAAC,CAAC,CAAC,MAAMU,EAAE,sBAAsBlB,EAAE,sBAAsBmB,EAAE,sBAAsBE,EAAEL,EAAE,CAAC,EAAEC,EAAED,EAAE,CAAC,EAAEH,EAAEG,EAAE,EAAE,EAAEM,EAAEN,EAAE,EAAE,EAAElC,EAAEkC,EAAE,CAAC,EAAER,EAAE,SAAS,SAASA,EAAEQ,EAAEO,EAAEkB,EAAEK,EAAEhC,EAAE,CAAC,MAAMY,GAAGV,EAAEF,IAAIS,EAAEuB,GAAGtB,GAAGhB,EAAEsC,IAAIL,EAAE3B,GAAGvC,EAAEmD,EAAEF,EAAE,GAAOE,IAAJ,GAAWF,IAAJ,GAAOE,EAAE,GAAGF,EAAE,EAAE,OAAOjD,EAAE,MAAM6C,EAAE,KAAK,IAAIM,EAAEF,CAAC,EAAE,OAAO,KAAK,IAAIjD,CAAC,GAAG2C,EAAEE,EAAE7C,EAAE,EAAC,SAASiC,EAAEQ,EAAEE,EAAEK,EAAEkB,EAAEK,EAAEhC,EAAE,CAAC,IAAIY,EAAEF,EAAEjD,EAAE6C,EAAEyC,EAAEpC,EAAEqC,EAAEC,EAAEC,EAAEC,EAAE,EAAEC,EAAErF,EAAEsF,EAAEC,EAAEC,EAAEC,EAAEC,EAAE,MAAMC,EAAEhE,EAAEiC,EAAEgC,EAAEvD,EAAEuB,EAAEiC,EAAE1D,EAAE8B,EAAE6B,EAAEpD,EAAEuB,EAAEe,GAAGO,GAAGL,EAAES,GAAGV,GAAGrC,EAAE,UAAE+C,IAAI/C,EAAE+C,MAAMP,EAAEU,GAAGX,GAAGvC,EAAE,UAAEkD,IAAIlD,EAAEkD,OAAOR,EAAEK,EAAEG,GAAGb,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAK,EAAEG,GAAGE,GAAGP,EAAEW,GAAGZ,GAAGrC,EAAE,UAAEiD,IAAIjD,EAAEiD,MAAMT,EAAEQ,GAAGT,GAAGvC,EAAE,UAAEgD,IAAIhD,EAAEgD,OAAOJ,EAAEK,EAAED,GAAGX,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAK5C,EAAE,CAAC,EAAE+C,GAAG,EAAEP,IAAIA,EAAES,GAAGT,GAAGhF,EAAEsF,IAAID,EAAEC,EAAE,IAAIN,EAAEK,EAAEC,KAAK,EAAEN,KAAK,EAAEhF,EAAEwF,GAAGhD,EAAE,CAAC,EAAExC,GAAG,EAAEgF,IAAIA,EAAEQ,GAAGR,GAAGU,EAAEL,EAAE,GAAGA,EAAE7C,EAAE,CAAC,EAAE6C,GAAGK,EAAEV,IAAI,EAAEA,GAAGxC,EAAE,CAAC,EAAEkD,EAAE,IAAIK,IAAE,SAASpE,GAAEI,GAAE,CAAC,IAAIG,GAAEH,GAAE,CAAC,EAAE,QAAQD,GAAE,EAAEA,GAAEH,GAAEG,KAAII,IAAGH,GAAED,EAAC,EAAE,OAAOI,EAAC,GAAE,EAAEM,CAAC,EAAEwD,GAAE7E,EAAEc,EAAyJ,GAApJ8D,IAAGC,IAAG,CAACD,IAAGC,KAAcnD,EAAElB,GAAGgE,GAAGX,EAAErD,EAAEgE,KAAKX,EAAEpB,GAAGlE,EAAE2C,GAAGuD,GAAGZ,EAAE3C,EAAEuD,KAAKZ,EAAEpB,GAAGjB,EAAER,GAAG0D,GAAGb,EAAE7C,EAAE0D,KAAKb,EAAEf,GAAG1B,EAAEG,GAAGoD,GAAGd,EAAEtC,EAAEoD,KAAKd,EAAEf,GAAOpB,IAAJ,GAAWF,IAAJ,GAAWjD,IAAJ,GAAW6C,IAAJ,KAAkByD,GAAE1D,EAAEL,EAAEC,EAAE,KAAK,IAAI6D,EAAC,GAAGA,IAAGJ,EAAEpD,EAAEuD,EAAEjD,GAAGgD,EAAEnG,EAAEkG,EAAEjD,KAAKqD,IAAG,CAACD,IAAGC,IAAE,OAAOD,GAAEf,GAAGO,GAAGL,EAAErC,GAAGoC,GAAGrC,EAAE,UAAEC,IAAID,EAAEC,MAAMuC,EAAEU,GAAGX,GAAGvC,EAAE,UAAEkD,IAAIlD,EAAEkD,OAAOR,EAAEzC,EAAEiD,GAAGb,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAK,EAAEG,GAAGE,GAAGP,EAAEvC,GAAGsC,GAAGrC,EAAE,UAAED,IAAIC,EAAED,MAAMyC,EAAEQ,GAAGT,GAAGvC,EAAE,UAAEgD,IAAIhD,EAAEgD,OAAOJ,EAAE7C,EAAEiD,GAAGX,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAKnF,EAAE,CAAC,EAAEsF,GAAG,EAAEP,IAAIA,EAAES,GAAGT,GAAGhF,EAAEsF,IAAID,EAAEC,EAAE,IAAIN,EAAEK,EAAEC,KAAK,EAAEN,KAAK,EAAEhF,EAAEwF,GAAGvF,EAAE,CAAC,EAAED,GAAG,EAAEgF,IAAIA,EAAEQ,GAAGR,GAAGU,EAAEL,EAAE,GAAGA,EAAEpF,EAAE,CAAC,EAAEoF,GAAGK,EAAEV,IAAI,EAAEA,GAAG/E,EAAE,CAAC,EAAEyF,EAAE,MAAMO,GAAEnE,EAAE,EAAEU,EAAE,EAAEvC,EAAEmC,CAAC,EAAE4C,GAAGO,GAAGL,EAAES,GAAGV,GAAGrC,EAAE,UAAE+C,IAAI/C,EAAE+C,MAAMP,EAAE7C,GAAG4C,GAAGvC,EAAE,UAAEL,IAAIK,EAAEL,OAAO+C,EAAEK,EAAEpD,GAAG0C,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAK,EAAEG,GAAGE,GAAGP,EAAEW,GAAGZ,GAAGrC,EAAE,UAAEiD,IAAIjD,EAAEiD,MAAMT,EAAE1F,GAAGyF,GAAGvC,EAAE,UAAElD,IAAIkD,EAAElD,OAAO8F,EAAEK,EAAEnG,GAAGuF,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAKnF,EAAE,CAAC,EAAEsF,GAAG,EAAEP,IAAIA,EAAES,GAAGT,GAAGhF,EAAEsF,IAAID,EAAEC,EAAE,IAAIN,EAAEK,EAAEC,KAAK,EAAEN,KAAK,EAAEhF,EAAEwF,GAAGvF,EAAE,CAAC,EAAED,GAAG,EAAEgF,IAAIA,EAAEQ,GAAGR,GAAGU,EAAEL,EAAE,GAAGA,EAAEpF,EAAE,CAAC,EAAEoF,GAAGK,EAAEV,IAAI,EAAEA,GAAG/E,EAAE,CAAC,EAAEyF,EAAE,MAAMQ,GAAEpE,EAAEmE,GAAE7D,EAAE,EAAEnC,EAAE+B,CAAC,EAAEgD,GAAGO,GAAGL,EAAErC,GAAGoC,GAAGrC,EAAE,UAAEC,IAAID,EAAEC,MAAMuC,EAAE7C,GAAG4C,GAAGvC,EAAE,UAAEL,IAAIK,EAAEL,OAAO+C,EAAEzC,EAAEN,GAAG0C,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAK,EAAEG,GAAGE,GAAGP,EAAEvC,GAAGsC,GAAGrC,EAAE,UAAED,IAAIC,EAAED,MAAMyC,EAAE1F,GAAGyF,GAAGvC,EAAE,UAAElD,IAAIkD,EAAElD,OAAO8F,EAAE7C,EAAEjD,GAAGuF,EAAEE,EAAED,EAAEC,EAAEF,EAAEG,KAAKnF,EAAE,CAAC,EAAEsF,GAAG,EAAEP,IAAIA,EAAES,GAAGT,GAAGhF,EAAEsF,IAAID,EAAEC,EAAE,IAAIN,EAAEK,EAAEC,KAAK,EAAEN,KAAK,EAAEhF,EAAEwF,GAAGvF,EAAE,CAAC,EAAED,GAAG,EAAEgF,IAAIA,EAAEQ,GAAGR,GAAGU,EAAEL,EAAE,GAAGA,EAAEpF,EAAE,CAAC,EAAEoF,GAAGK,EAAEV,IAAI,EAAEA,GAAG/E,EAAE,CAAC,EAAEyF,EAAE,MAAMS,GAAErE,EAAEoE,GAAElE,EAAE,EAAE/B,EAAEwC,CAAC,EAAE,OAAOA,EAAE0D,GAAE,CAAC,CAAC,GAAExE,EAAEQ,EAAEO,EAAEkB,EAAEK,EAAEhC,EAAEM,CAAC,CAAC,EAAEZ,EAAE,aAAa,SAASA,EAAEI,EAAEG,EAAEJ,EAAEK,EAAEE,EAAE,CAAC,OAAON,EAAEM,IAAIH,EAAEC,IAAIR,EAAEQ,IAAIL,EAAEO,EAAE,EAAE,OAAO,eAAeV,EAAE,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,iFCErrF,IAAIyE,EAAQzB,GAAA,EACR0B,EAAQxB,GACRyB,EAAiBC,GAAA,EACjBC,EAASC,GAAA,EAAiD,SAG1DJ,EAAM,UACNA,EAAQA,EAAM,SAGlBK,GAAA,QAAiBC,EACjBD,GAAA,QAAA,QAAyBC,EAEzB,SAASA,EAAWC,EAAQC,EAAWC,EAAiB,CAEpDD,EAAY,KAAK,IAAI,EAAGA,IAAc,OAAY,EAAIA,CAAS,EAG/DC,EAAkBA,GAAmB,EAGrC,IAAIC,EAAOC,EAAeJ,CAAM,EAG5BK,EAAO,IAAIb,EAAM,EAAE,EACvBa,EAAK,OAAS,SAAUjF,EAAG,CACvB,MAAO,CACH,KAAMA,EAAE,CAAC,EACT,KAAMA,EAAE,CAAC,EACT,KAAMA,EAAE,CAAC,EACT,KAAMA,EAAE,CAAC,EAErB,EACIiF,EAAK,YAAc,SAAUjF,EAAG4B,EAAG,CAAE,OAAO5B,EAAE,CAAC,EAAI4B,EAAE,CAAC,CAAE,EACxDqD,EAAK,YAAc,SAAUjF,EAAG4B,EAAG,CAAE,OAAO5B,EAAE,CAAC,EAAI4B,EAAE,CAAC,CAAE,EAExDqD,EAAK,KAAKL,CAAM,EAIhB,QADIM,EAAQ,CAAA,EACH/F,EAAI,EAAGgG,EAAMhG,EAAI4F,EAAK,OAAQ5F,IAAK,CACxC,IAAIuB,EAAIqE,EAAK5F,CAAC,EACd8F,EAAK,OAAOvE,CAAC,EACbyE,EAAOC,EAAW1E,EAAGyE,CAAI,EACzBD,EAAM,KAAKC,CAAI,CACvB,CAGI,IAAIE,EAAU,IAAIjB,EAAM,EAAE,EAC1B,IAAKjF,EAAI,EAAGA,EAAI+F,EAAM,OAAQ/F,IAAKkG,EAAQ,OAAOC,EAAWJ,EAAM/F,CAAC,CAAC,CAAC,EAMtE,QAJIoG,EAAcV,EAAYA,EAC1BW,EAAiBV,EAAkBA,EAGhCI,EAAM,QAAQ,CACjB,IAAIO,EAAOP,EAAM,MAAK,EAClBlF,EAAIyF,EAAK,EACT7D,EAAI6D,EAAK,KAAK,EAGdC,EAAQC,EAAU3F,EAAG4B,CAAC,EAC1B,GAAI,EAAA8D,EAAQF,GAEZ,KAAII,EAAWF,EAAQH,EAGvB7E,EAAImF,EAAcZ,EAAMQ,EAAK,KAAK,EAAGzF,EAAG4B,EAAG6D,EAAK,KAAK,KAAK,EAAGG,EAAUP,CAAO,EAG1E3E,GAAK,KAAK,IAAIiF,EAAUjF,EAAGV,CAAC,EAAG2F,EAAUjF,EAAGkB,CAAC,CAAC,GAAKgE,IAEnDV,EAAM,KAAKO,CAAI,EACfP,EAAM,KAAKE,EAAW1E,EAAG+E,CAAI,CAAC,EAG9BR,EAAK,OAAOvE,CAAC,EACb2E,EAAQ,OAAOI,CAAI,EACnBJ,EAAQ,OAAOC,EAAWG,CAAI,CAAC,EAC/BJ,EAAQ,OAAOC,EAAWG,EAAK,IAAI,CAAC,GAEhD,CAGIA,EAAON,EACP,IAAIW,EAAU,CAAA,EACd,GACIA,EAAQ,KAAKL,EAAK,CAAC,EACnBA,EAAOA,EAAK,WACPA,IAASN,GAElB,OAAAW,EAAQ,KAAKL,EAAK,CAAC,EAEZK,CACX,CAEA,SAASD,EAAcZ,EAAMjF,EAAG4B,EAAGpB,EAAGC,EAAGsF,EAASV,EAAS,CAMvD,QALIH,EAAQ,IAAIb,EAAM,CAAA,EAAI2B,CAAW,EACjCP,EAAOR,EAAK,KAITQ,GAAM,CACT,QAAStG,EAAI,EAAGA,EAAIsG,EAAK,SAAS,OAAQtG,IAAK,CAC3C,IAAI8G,EAAQR,EAAK,SAAStG,CAAC,EAEvB+G,EAAOT,EAAK,KAAOU,EAAUF,EAAOrE,EAAGpB,CAAC,EAAI4F,EAAaxE,EAAGpB,EAAGyF,CAAK,EACpEC,EAAOH,GAEXb,EAAM,KAAK,CACP,KAAMe,EACN,KAAMC,CACtB,CAAa,CACb,CAEQ,KAAOhB,EAAM,QAAU,CAACA,EAAM,KAAI,EAAG,KAAK,UAAU,CAChD,IAAIhE,EAAOgE,EAAM,IAAG,EAChBxE,EAAIQ,EAAK,KAITmF,EAAKF,EAAUzF,EAAGV,EAAG4B,CAAC,EACtB0E,EAAKH,EAAUzF,EAAGF,EAAGC,CAAC,EAC1B,GAAIS,EAAK,KAAOmF,GAAMnF,EAAK,KAAOoF,GAC9BC,EAAgB3E,EAAGlB,EAAG2E,CAAO,GAC7BkB,EAAgB/F,EAAGE,EAAG2E,CAAO,EAAG,OAAO3E,CACvD,CAEQ+E,EAAOP,EAAM,IAAG,EACZO,IAAMA,EAAOA,EAAK,KAC9B,CAEI,OAAO,IACX,CAEA,SAASO,EAAYhG,EAAG4B,EAAG,CACvB,OAAO5B,EAAE,KAAO4B,EAAE,IACtB,CAGA,SAASwE,EAAapG,EAAG4B,EAAG4E,EAAM,CAC9B,GAAItE,EAAOlC,EAAGwG,CAAI,GAAKtE,EAAON,EAAG4E,CAAI,EAAG,MAAO,GAC/C,IAAIF,EAAKG,EAAazG,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4B,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4E,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EACxF,GAAIF,IAAO,EAAG,MAAO,GACrB,IAAII,EAAKD,EAAazG,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4B,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4E,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EACxF,GAAIE,IAAO,EAAG,MAAO,GACrB,IAAIC,EAAKF,EAAazG,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4B,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4E,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EACxF,GAAIG,IAAO,EAAG,MAAO,GACrB,IAAIC,EAAKH,EAAazG,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4B,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG4E,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EACxF,OAAII,IAAO,EAAU,EACd,KAAK,IAAIN,EAAII,EAAIC,EAAIC,CAAE,CAClC,CAEA,SAAS1E,EAAOlC,EAAGwG,EAAM,CACrB,OAAOxG,EAAE,CAAC,GAAKwG,EAAK,MACbxG,EAAE,CAAC,GAAKwG,EAAK,MACbxG,EAAE,CAAC,GAAKwG,EAAK,MACbxG,EAAE,CAAC,GAAKwG,EAAK,IACxB,CAGA,SAASD,EAAgBvG,EAAG4B,EAAGyD,EAAS,CAOpC,QANIwB,EAAO,KAAK,IAAI7G,EAAE,CAAC,EAAG4B,EAAE,CAAC,CAAC,EAC1BkF,EAAO,KAAK,IAAI9G,EAAE,CAAC,EAAG4B,EAAE,CAAC,CAAC,EAC1BmF,EAAO,KAAK,IAAI/G,EAAE,CAAC,EAAG4B,EAAE,CAAC,CAAC,EAC1BoF,EAAO,KAAK,IAAIhH,EAAE,CAAC,EAAG4B,EAAE,CAAC,CAAC,EAE1BqF,EAAQ5B,EAAQ,OAAO,CAAC,KAAMwB,EAAM,KAAMC,EAAM,KAAMC,EAAM,KAAMC,CAAI,CAAC,EAClE7H,EAAI,EAAGA,EAAI8H,EAAM,OAAQ9H,IAC9B,GAAI+H,EAAWD,EAAM9H,CAAC,EAAE,EAAG8H,EAAM9H,CAAC,EAAE,KAAK,EAAGa,EAAG4B,CAAC,EAAG,MAAO,GAE9D,MAAO,EACX,CAEA,SAASuF,EAAMC,EAAIC,EAAIC,EAAI,CACvB,OAAO9C,EAAO4C,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGA,EAAG,CAAC,CAAC,CAC1D,CAGA,SAASJ,EAAWE,EAAIG,EAAIF,EAAIG,EAAI,CAChC,OAAOJ,IAAOI,GAAMD,IAAOF,GACvBF,EAAMC,EAAIG,EAAIF,CAAE,EAAI,GAAMF,EAAMC,EAAIG,EAAIC,CAAE,EAAI,GAC9CL,EAAME,EAAIG,EAAIJ,CAAE,EAAI,GAAMD,EAAME,EAAIG,EAAID,CAAE,EAAI,CACtD,CAGA,SAASjC,EAAWG,EAAM,CACtB,IAAI2B,EAAK3B,EAAK,EACV4B,EAAK5B,EAAK,KAAK,EACnB,OAAAA,EAAK,KAAO,KAAK,IAAI2B,EAAG,CAAC,EAAGC,EAAG,CAAC,CAAC,EACjC5B,EAAK,KAAO,KAAK,IAAI2B,EAAG,CAAC,EAAGC,EAAG,CAAC,CAAC,EACjC5B,EAAK,KAAO,KAAK,IAAI2B,EAAG,CAAC,EAAGC,EAAG,CAAC,CAAC,EACjC5B,EAAK,KAAO,KAAK,IAAI2B,EAAG,CAAC,EAAGC,EAAG,CAAC,CAAC,EAC1B5B,CACX,CAGA,SAAST,EAAeJ,EAAQ,CAO5B,QANInD,EAAOmD,EAAO,CAAC,EACfzD,EAAMyD,EAAO,CAAC,EACdjD,EAAQiD,EAAO,CAAC,EAChBxD,EAASwD,EAAO,CAAC,EAGZzF,EAAI,EAAGA,EAAIyF,EAAO,OAAQzF,IAAK,CACpC,IAAIuB,EAAIkE,EAAOzF,CAAC,EACZuB,EAAE,CAAC,EAAIe,EAAK,CAAC,IAAGA,EAAOf,GACvBA,EAAE,CAAC,EAAIiB,EAAM,CAAC,IAAGA,EAAQjB,GACzBA,EAAE,CAAC,EAAIS,EAAI,CAAC,IAAGA,EAAMT,GACrBA,EAAE,CAAC,EAAIU,EAAO,CAAC,IAAGA,EAASV,EACvC,CAGI,IAAI+G,EAAO,CAAChG,EAAMN,EAAKQ,EAAOP,CAAM,EAChCsG,EAAWD,EAAK,MAAK,EACzB,IAAKtI,EAAI,EAAGA,EAAIyF,EAAO,OAAQzF,IACtBmF,EAAeM,EAAOzF,CAAC,EAAGsI,CAAI,GAAGC,EAAS,KAAK9C,EAAOzF,CAAC,CAAC,EAIjE,OAAOwI,EAAWD,CAAQ,CAC9B,CAGA,SAAStC,EAAW1E,EAAGkH,EAAM,CACzB,IAAInC,EAAO,CACP,EAAG/E,EACH,KAAM,KACN,KAAM,KACN,KAAM,EACN,KAAM,EACN,KAAM,EACN,KAAM,GAGV,OAAKkH,GAKDnC,EAAK,KAAOmC,EAAK,KACjBnC,EAAK,KAAOmC,EACZA,EAAK,KAAK,KAAOnC,EACjBmC,EAAK,KAAOnC,IAPZA,EAAK,KAAOA,EACZA,EAAK,KAAOA,GAQTA,CACX,CAGA,SAASE,EAAUyB,EAAIC,EAAI,CAEvB,IAAIQ,EAAKT,EAAG,CAAC,EAAIC,EAAG,CAAC,EACjBS,EAAKV,EAAG,CAAC,EAAIC,EAAG,CAAC,EAErB,OAAOQ,EAAKA,EAAKC,EAAKA,CAC1B,CAGA,SAAS3B,EAAUzF,EAAG0G,EAAIC,EAAI,CAE1B,IAAI1G,EAAIyG,EAAG,CAAC,EACRnF,EAAImF,EAAG,CAAC,EACRS,EAAKR,EAAG,CAAC,EAAI1G,EACbmH,EAAKT,EAAG,CAAC,EAAIpF,EAEjB,GAAI4F,IAAO,GAAKC,IAAO,EAAG,CAEtB,IAAInI,IAAMe,EAAE,CAAC,EAAIC,GAAKkH,GAAMnH,EAAE,CAAC,EAAIuB,GAAK6F,IAAOD,EAAKA,EAAKC,EAAKA,GAE1DnI,EAAI,GACJgB,EAAI0G,EAAG,CAAC,EACRpF,EAAIoF,EAAG,CAAC,GAED1H,EAAI,IACXgB,GAAKkH,EAAKlI,EACVsC,GAAK6F,EAAKnI,EAEtB,CAEI,OAAAkI,EAAKnH,EAAE,CAAC,EAAIC,EACZmH,EAAKpH,EAAE,CAAC,EAAIuB,EAEL4F,EAAKA,EAAKC,EAAKA,CAC1B,CAGA,SAASrB,EAAasB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CAClD,IAAIC,EAAKN,EAAKF,EACVS,EAAKN,EAAKF,EACVS,EAAKJ,EAAKF,EACVO,EAAKJ,EAAKF,EACVO,EAAKZ,EAAKI,EACVS,EAAKZ,EAAKI,EACVpI,EAAIuI,EAAKA,EAAKC,EAAKA,EACnB5G,EAAI2G,EAAKE,EAAKD,EAAKE,EACnBlI,EAAIiI,EAAKA,EAAKC,EAAKA,EACnBjI,EAAI8H,EAAKI,EAAKH,EAAKI,EACnB7I,EAAI0I,EAAKE,EAAKD,EAAKE,EACnBlF,EAAI1D,EAAIQ,EAAIoB,EAAIA,EAEhBiH,EAAIC,EAAIC,EAAIC,EACZC,EAAKvF,EACLwF,EAAKxF,EAELA,IAAM,GACNoF,EAAK,EACLG,EAAK,EACLD,EAAKjJ,EACLmJ,EAAK1I,IAELsI,EAAKlH,EAAI7B,EAAIS,EAAIC,EACjBuI,EAAKhJ,EAAID,EAAI6B,EAAInB,EACbqI,EAAK,GACLA,EAAK,EACLE,EAAKjJ,EACLmJ,EAAK1I,GACEsI,EAAKG,IACZH,EAAKG,EACLD,EAAKjJ,EAAI6B,EACTsH,EAAK1I,IAITwI,EAAK,GACLA,EAAK,EACD,CAACvI,EAAI,EAAKqI,EAAK,EACV,CAACrI,EAAIT,EAAG8I,EAAKG,GAElBH,EAAK,CAACrI,EACNwI,EAAKjJ,IAEFgJ,EAAKE,IACZF,EAAKE,EACA,CAACzI,EAAImB,EAAK,EAAKkH,EAAK,EAChB,CAACrI,EAAImB,EAAI5B,EAAG8I,EAAKG,GAEtBH,EAAK,CAACrI,EAAImB,EACVqH,EAAKjJ,IAIb6I,EAAKC,IAAO,EAAI,EAAIA,EAAKG,EACzBF,EAAKC,IAAO,EAAI,EAAIA,EAAKE,EAEzB,IAAIC,GAAM,EAAIN,GAAMd,EAAKc,EAAKZ,EAC1BmB,GAAM,EAAIP,GAAMb,EAAKa,EAAKX,EAC1BmB,GAAO,EAAIN,GAAMZ,EAAKY,EAAKV,EAC3BiB,GAAO,EAAIP,GAAMX,EAAKW,EAAKT,EAC3BT,EAAKwB,EAAMF,EACXrB,EAAKwB,EAAMF,EAEf,OAAOvB,EAAKA,EAAKC,EAAKA,CAC1B,CAEA,SAASyB,EAAWvJ,EAAG4B,EAAG,CACtB,OAAO5B,EAAE,CAAC,IAAM4B,EAAE,CAAC,EAAI5B,EAAE,CAAC,EAAI4B,EAAE,CAAC,EAAI5B,EAAE,CAAC,EAAI4B,EAAE,CAAC,CACnD,CAEA,SAAS+F,EAAW/C,EAAQ,CACxBA,EAAO,KAAK2E,CAAU,EAGtB,QADIC,EAAQ,CAAA,EACHrK,EAAI,EAAGA,EAAIyF,EAAO,OAAQzF,IAAK,CACpC,KAAOqK,EAAM,QAAU,GAAKrC,EAAMqC,EAAMA,EAAM,OAAS,CAAC,EAAGA,EAAMA,EAAM,OAAS,CAAC,EAAG5E,EAAOzF,CAAC,CAAC,GAAK,GAC9FqK,EAAM,IAAG,EAEbA,EAAM,KAAK5E,EAAOzF,CAAC,CAAC,CAC5B,CAGI,QADIsK,EAAQ,CAAA,EACHC,EAAK9E,EAAO,OAAS,EAAG8E,GAAM,EAAGA,IAAM,CAC5C,KAAOD,EAAM,QAAU,GAAKtC,EAAMsC,EAAMA,EAAM,OAAS,CAAC,EAAGA,EAAMA,EAAM,OAAS,CAAC,EAAG7E,EAAO8E,CAAE,CAAC,GAAK,GAC/FD,EAAM,IAAG,EAEbA,EAAM,KAAK7E,EAAO8E,CAAE,CAAC,CAC7B,CAEI,OAAAD,EAAM,IAAG,EACTD,EAAM,IAAG,EACFA,EAAM,OAAOC,CAAK,CAC7B,uEC1XA,SAASE,GAAO9L,EAASV,EAAU,GAAI,CACrCA,EAAQ,UAAYA,EAAQ,WAAa,IACzC,MAAMyH,EAAS,CAAA,EAIf,GAHAhH,GAAUC,EAAU+L,GAAU,CAC5BhF,EAAO,KAAK,CAACgF,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,CAAC,CAClC,CAAC,EACG,CAAChF,EAAO,OACV,OAAO,KAET,MAAM+C,EAAahD,GAAWC,EAAQzH,EAAQ,SAAS,EACvD,OAAIwK,EAAW,OAAS,EACfnK,GAAQ,CAACmK,CAAU,CAAC,EAEtB,IACT,CCfA,SAASkC,GAAShM,EAASV,EAAU,GAAI,CACvC,IAAI2M,EAAO,EACPC,EAAO,EACP5H,EAAM,EACV,OAAAvE,GACEC,EACA,SAAS+L,EAAO,CACdE,GAAQF,EAAM,CAAC,EACfG,GAAQH,EAAM,CAAC,EACfzH,GACF,EACA,EACJ,EACS9E,GAAM,CAACyM,EAAO3H,EAAK4H,EAAO5H,CAAG,EAAGhF,EAAQ,UAAU,CAC3D,CCfA,SAAS6M,GAASJ,EAAO,CACvB,GAAI,CAACA,EACH,MAAM,IAAI,MAAM,mBAAmB,EAErC,GAAI,CAAC,MAAM,QAAQA,CAAK,EAAG,CACzB,GAAIA,EAAM,OAAS,WAAaA,EAAM,WAAa,MAAQA,EAAM,SAAS,OAAS,QACjF,MAAO,CAAC,GAAGA,EAAM,SAAS,WAAW,EAEvC,GAAIA,EAAM,OAAS,QACjB,MAAO,CAAC,GAAGA,EAAM,WAAW,CAEhC,CACA,GAAI,MAAM,QAAQA,CAAK,GAAKA,EAAM,QAAU,GAAK,CAAC,MAAM,QAAQA,EAAM,CAAC,CAAC,GAAK,CAAC,MAAM,QAAQA,EAAM,CAAC,CAAC,EAClG,MAAO,CAAC,GAAGA,CAAK,EAElB,MAAM,IAAI,MAAM,oDAAoD,CACtE,CAsFA,SAASK,GAAQpM,EAASqM,EAAO,CAC/B,OAAIrM,EAAQ,OAAS,oBACZ,oBAELA,EAAQ,OAAS,qBACZ,qBAELA,EAAQ,OAAS,WAAaA,EAAQ,WAAa,KAC9CA,EAAQ,SAAS,KAEnBA,EAAQ,IACjB,CC7GA,SAASsM,GAAatM,EAASV,EAAU,GAAI,CAC3C,OAAQ8M,GAAQpM,CAAO,EAAC,CACtB,IAAK,QACH,OAAOR,GAAM2M,GAASnM,CAAO,EAAGV,EAAQ,UAAU,EACpD,IAAK,UACH,IAAIiB,EAAS,CAAA,EACbR,GAAUC,EAAS,SAAS+L,EAAO,CACjCxL,EAAO,KAAKwL,CAAK,CACnB,CAAC,EACD,IAAIQ,EAASP,GAAShM,EAAS,CAAE,WAAYV,EAAQ,WAAY,EAC7DkN,EAAcD,EAAO,SAAS,YAC9BE,EAAK,EACLC,EAAK,EACLC,EAAQ,EACRrL,EAAGsL,EAAIC,EAAItI,EAAIE,EAAID,EAAIE,EAAIvC,EAC3B2K,EAAoBvM,EAAO,IAAI,SAASwM,EAAQ,CAClD,MAAO,CAACA,EAAO,CAAC,EAAIP,EAAY,CAAC,EAAGO,EAAO,CAAC,EAAIP,EAAY,CAAC,CAAC,CAChE,CAAC,EACD,IAAKlL,EAAI,EAAGA,EAAIf,EAAO,OAAS,EAAGe,IACjCsL,EAAKE,EAAkBxL,CAAC,EACxBiD,EAAKqI,EAAG,CAAC,EACTpI,EAAKoI,EAAG,CAAC,EACTC,EAAKC,EAAkBxL,EAAI,CAAC,EAC5BmD,EAAKoI,EAAG,CAAC,EACTnI,EAAKmI,EAAG,CAAC,EACT1K,EAAIoC,EAAKG,EAAKD,EAAKD,EACnBmI,GAASxK,EACTsK,IAAOlI,EAAKE,GAAMtC,EAClBuK,IAAOlI,EAAKE,GAAMvC,EAEpB,GAAIwK,IAAU,EACZ,OAAOJ,EAEP,IAAIS,EAAOL,EAAQ,GACfM,EAAa,GAAK,EAAID,GAC1B,OAAOxN,GACL,CAACgN,EAAY,CAAC,EAAIS,EAAaR,EAAID,EAAY,CAAC,EAAIS,EAAaP,CAAE,EACnEpN,EAAQ,UAClB,EAEI,QACE,IAAI4H,EAAO4E,GAAO9L,CAAO,EACzB,OAAIkH,EAAaoF,GAAapF,EAAM,CAAE,WAAY5H,EAAQ,WAAY,EAC1D0M,GAAShM,EAAS,CAAE,WAAYV,EAAQ,UAAU,CAAE,CACtE,CACA,CACG,IAAC4N,GAAgBZ","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12]}