{
  "version": 3,
  "sources": ["../../../.yarn/berry/cache/osmtogeojson-npm-3.0.0-beta.5-84cd10c360-8.zip/node_modules/osmtogeojson/lodash.custom.js", "../../../.yarn/berry/cache/@mapbox-geojson-rewind-npm-0.5.2-716dd1ae97-8.zip/node_modules/@mapbox/geojson-rewind/index.js", "../../../.yarn/berry/cache/osm-polygon-features-npm-0.9.2-2b3b34a619-8.zip/node_modules/osm-polygon-features/index.js", "../../../.yarn/berry/cache/osmtogeojson-npm-3.0.0-beta.5-84cd10c360-8.zip/node_modules/osmtogeojson/index.js", "../src/overpass_worker.js", "../../../.yarn/berry/cache/@turf-helpers-npm-6.5.0-a40ad42565-8.zip/node_modules/@turf/helpers/dist/es/index.js", "../../../.yarn/berry/cache/@turf-meta-npm-6.5.0-66a9378eac-8.zip/node_modules/@turf/meta/dist/es/index.js", "../../../.yarn/berry/cache/@turf-explode-npm-6.5.0-ee11f9a870-8.zip/node_modules/@turf/explode/dist/es/index.js", "../../../.yarn/berry/cache/@turf-bbox-npm-6.5.0-7e0db31887-8.zip/node_modules/@turf/bbox/dist/es/index.js", "../../../.yarn/berry/cache/@turf-center-npm-6.5.0-d242b19710-8.zip/node_modules/@turf/center/dist/es/index.js", "../../../.yarn/berry/cache/@turf-clone-npm-6.5.0-8b7001cf50-8.zip/node_modules/@turf/clone/dist/es/index.js", "../../../.yarn/berry/cache/@turf-invariant-npm-6.5.0-63bdebfa9a-8.zip/node_modules/@turf/invariant/dist/es/index.js", "../../../.yarn/berry/cache/@turf-distance-npm-6.5.0-31f0d31a23-8.zip/node_modules/@turf/distance/dist/es/index.js", "../../../.yarn/berry/cache/@turf-nearest-point-npm-6.5.0-349e1d6e25-8.zip/node_modules/@turf/nearest-point/dist/es/index.js", "../../../.yarn/berry/cache/@turf-boolean-point-in-polygon-npm-6.5.0-a1fdefa88c-8.zip/node_modules/@turf/boolean-point-in-polygon/dist/es/index.js", "../../../.yarn/berry/cache/@turf-point-on-feature-npm-6.5.0-6f9e626d77-8.zip/node_modules/@turf/point-on-feature/dist/es/index.js"],
  "sourcesContent": ["/**\n * @license\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash exports=\"node\" include=\"clone,merge,isEmpty,isArray,compact,each\" -d`\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;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.15.0';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Used as the `TypeError` message for \"Functions\" methods. */\n  var FUNC_ERROR_TEXT = 'Expected a function';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used to compose bitmasks for comparison styles. */\n  var UNORDERED_COMPARE_FLAG = 1,\n      PARTIAL_COMPARE_FLAG = 2;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991;\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      weakMapTag = '[object WeakMap]';\n\n  var arrayBufferTag = '[object ArrayBuffer]',\n      dataViewTag = '[object DataView]',\n      float32Tag = '[object Float32Array]',\n      float64Tag = '[object Float64Array]',\n      int8Tag = '[object Int8Array]',\n      int16Tag = '[object Int16Array]',\n      int32Tag = '[object Int32Array]',\n      uint8Tag = '[object Uint8Array]',\n      uint8ClampedTag = '[object Uint8ClampedArray]',\n      uint16Tag = '[object Uint16Array]',\n      uint32Tag = '[object Uint32Array]';\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      reLeadingDot = /^\\./,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var nodeUtil = (function() {\n    try {\n      return freeProcess && freeProcess.binding('util');\n    } catch (e) {}\n  }());\n\n  /* Node.js helper references. */\n  var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Adds the key-value `pair` to `map`.\n   *\n   * @private\n   * @param {Object} map The map to modify.\n   * @param {Array} pair The key-value pair to add.\n   * @returns {Object} Returns `map`.\n   */\n  function addMapEntry(map, pair) {\n    // Don't return `map.set` because it's not chainable in IE 11.\n    map.set(pair[0], pair[1]);\n    return map;\n  }\n\n  /**\n   * Adds `value` to `set`.\n   *\n   * @private\n   * @param {Object} set The set to modify.\n   * @param {*} value The value to add.\n   * @returns {Object} Returns `set`.\n   */\n  function addSetEntry(set, value) {\n    // Don't return `set.add` because it's not chainable in IE 11.\n    set.add(value);\n    return set;\n  }\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   */\n  function 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 `_.forEach` for arrays without support for\n   * iteratee 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 `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array ? array.length : 0;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * Appends the elements of `values` to `array`.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {Array} values The values to append.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayPush(array, values) {\n    var index = -1,\n        length = values.length,\n        offset = array.length;\n\n    while (++index < length) {\n      array[offset + index] = values[index];\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array ? array.length : 0;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.some` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if any element passes the predicate check,\n   *  else `false`.\n   */\n  function arraySome(array, predicate) {\n    var index = -1,\n        length = array ? array.length : 0;\n\n    while (++index < length) {\n      if (predicate(array[index], index, array)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * The base implementation of `_.property` without support for deep paths.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.times` without support for iteratee shorthands\n   * or max array length checks.\n   *\n   * @private\n   * @param {number} n The number of times to invoke `iteratee`.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the array of results.\n   */\n  function baseTimes(n, iteratee) {\n    var index = -1,\n        result = Array(n);\n\n    while (++index < n) {\n      result[index] = iteratee(index);\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.unary` without support for storing metadata.\n   *\n   * @private\n   * @param {Function} func The function to cap arguments for.\n   * @returns {Function} Returns the new capped function.\n   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * Gets the value at `key` of `object`.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {string} key The key of the property to get.\n   * @returns {*} Returns the property value.\n   */\n  function 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   */\n  function 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  /**\n   * Converts `map` to its key-value pairs.\n   *\n   * @private\n   * @param {Object} map The map to convert.\n   * @returns {Array} Returns the key-value pairs.\n   */\n  function mapToArray(map) {\n    var index = -1,\n        result = Array(map.size);\n\n    map.forEach(function(value, key) {\n      result[++index] = [key, value];\n    });\n    return result;\n  }\n\n  /**\n   * Creates a unary function that invokes `func` with its argument transformed.\n   *\n   * @private\n   * @param {Function} func The function to wrap.\n   * @param {Function} transform The argument transform.\n   * @returns {Function} Returns the new function.\n   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Converts `set` to an array of its values.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the values.\n   */\n  function setToArray(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = value;\n    });\n    return result;\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /** Used for built-in method references. */\n  var arrayProto = Array.prototype,\n      funcProto = Function.prototype,\n      objectProto = Object.prototype;\n\n  /** Used to detect overreaching core-js shims. */\n  var coreJsData = root['__core-js_shared__'];\n\n  /** Used to detect methods masquerading as native. */\n  var 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. */\n  var funcToString = funcProto.toString;\n\n  /** Used to check objects for own properties. */\n  var hasOwnProperty = objectProto.hasOwnProperty;\n\n  /** Used to infer the `Object` constructor. */\n  var objectCtorString = funcToString.call(Object);\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   */\n  var objectToString = objectProto.toString;\n\n  /** Used to detect if a method is native. */\n  var reIsNative = RegExp('^' +\n    funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n    .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n  );\n\n  /** Built-in value references. */\n  var Buffer = moduleExports ? root.Buffer : undefined,\n      Symbol = root.Symbol,\n      Uint8Array = root.Uint8Array,\n      getPrototype = overArg(Object.getPrototypeOf, Object),\n      objectCreate = Object.create,\n      propertyIsEnumerable = objectProto.propertyIsEnumerable,\n      splice = arrayProto.splice;\n\n  /* Built-in method references for those with the same name as other `lodash` methods. */\n  var nativeGetSymbols = Object.getOwnPropertySymbols,\n      nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n      nativeKeys = overArg(Object.keys, Object),\n      nativeMax = Math.max;\n\n  /* Built-in method references that are verified to be native. */\n  var DataView = getNative(root, 'DataView'),\n      Map = getNative(root, 'Map'),\n      Promise = getNative(root, 'Promise'),\n      Set = getNative(root, 'Set'),\n      WeakMap = getNative(root, 'WeakMap'),\n      nativeCreate = getNative(Object, 'create');\n\n  /** Detect if properties shadowing those on `Object.prototype` are non-enumerable. */\n  var nonEnumShadows = !propertyIsEnumerable.call({ 'valueOf': 1 }, 'valueOf');\n\n  /** Used to lookup unminified function names. */\n  var realNames = {};\n\n  /** Used to detect maps, sets, and weakmaps. */\n  var dataViewCtorString = toSource(DataView),\n      mapCtorString = toSource(Map),\n      promiseCtorString = toSource(Promise),\n      setCtorString = toSource(Set),\n      weakMapCtorString = toSource(WeakMap);\n\n  /** Used to convert symbols to primitives and strings. */\n  var symbolProto = Symbol ? Symbol.prototype : undefined,\n      symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n      symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates a `lodash` object which wraps `value` to enable implicit method\n   * chain sequences. Methods that operate on and return arrays, collections,\n   * and functions can be chained together. Methods that retrieve a single value\n   * or may return a primitive value will automatically end the chain sequence\n   * and return the unwrapped value. Otherwise, the value must be unwrapped\n   * with `_#value`.\n   *\n   * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n   * enabled using `_.chain`.\n   *\n   * The execution of chained methods is lazy, that is, it's deferred until\n   * `_#value` is implicitly or explicitly called.\n   *\n   * Lazy evaluation allows several methods to support shortcut fusion.\n   * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n   * the creation of intermediate arrays and can greatly reduce the number of\n   * iteratee executions. Sections of a chain sequence qualify for shortcut\n   * fusion if the section is applied to an array of at least `200` elements\n   * and any iteratees accept only one argument. The heuristic for whether a\n   * section qualifies for shortcut fusion is subject to change.\n   *\n   * Chaining is supported in custom builds as long as the `_#value` method is\n   * directly or indirectly included in the build.\n   *\n   * In addition to lodash methods, wrappers have `Array` and `String` methods.\n   *\n   * The wrapper `Array` methods are:\n   * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n   *\n   * The wrapper `String` methods are:\n   * `replace` and `split`\n   *\n   * The wrapper methods that support shortcut fusion are:\n   * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n   * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n   * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n   *\n   * The chainable wrapper methods are:\n   * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n   * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n   * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n   * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n   * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n   * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n   * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n   * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n   * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n   * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n   * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n   * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n   * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n   * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n   * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n   * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n   * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n   * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n   * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n   * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n   * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n   * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n   * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n   * `zipObject`, `zipObjectDeep`, and `zipWith`\n   *\n   * The wrapper methods that are **not** chainable by default are:\n   * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n   * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n   * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n   * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n   * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n   * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n   * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n   * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n   * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n   * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n   * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n   * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n   * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n   * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n   * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n   * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n   * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n   * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n   * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n   * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n   * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n   * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n   * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n   * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n   * `upperFirst`, `value`, and `words`\n   *\n   * @name _\n   * @constructor\n   * @category Seq\n   * @param {*} value The value to wrap in a `lodash` instance.\n   * @returns {Object} Returns the new `lodash` wrapper instance.\n   * @example\n   *\n   * function square(n) {\n   *   return n * n;\n   * }\n   *\n   * var wrapped = _([1, 2, 3]);\n   *\n   * // Returns an unwrapped value.\n   * wrapped.reduce(_.add);\n   * // => 6\n   *\n   * // Returns a wrapped value.\n   * var squares = wrapped.map(square);\n   *\n   * _.isArray(squares);\n   * // => false\n   *\n   * _.isArray(squares.value());\n   * // => true\n   */\n  function lodash() {\n    // No operation performed.\n  }\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates a hash object.\n   *\n   * @private\n   * @constructor\n   * @param {Array} [entries] The key-value pairs to cache.\n   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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`.\n  Hash.prototype.clear = hashClear;\n  Hash.prototype['delete'] = hashDelete;\n  Hash.prototype.get = hashGet;\n  Hash.prototype.has = hashHas;\n  Hash.prototype.set = hashSet;\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates an list cache object.\n   *\n   * @private\n   * @constructor\n   * @param {Array} [entries] The key-value pairs to cache.\n   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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`.\n  ListCache.prototype.clear = listCacheClear;\n  ListCache.prototype['delete'] = listCacheDelete;\n  ListCache.prototype.get = listCacheGet;\n  ListCache.prototype.has = listCacheHas;\n  ListCache.prototype.set = listCacheSet;\n\n  /*------------------------------------------------------------------------*/\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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function mapCacheSet(key, value) {\n    getMapData(this, key).set(key, value);\n    return this;\n  }\n\n  // Add methods to `MapCache`.\n  MapCache.prototype.clear = mapCacheClear;\n  MapCache.prototype['delete'] = mapCacheDelete;\n  MapCache.prototype.get = mapCacheGet;\n  MapCache.prototype.has = mapCacheHas;\n  MapCache.prototype.set = mapCacheSet;\n\n  /*------------------------------------------------------------------------*/\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   */\n  function 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   */\n  function 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   */\n  function setCacheHas(value) {\n    return this.__data__.has(value);\n  }\n\n  // Add methods to `SetCache`.\n  SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n  SetCache.prototype.has = setCacheHas;\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates a stack cache object to store key-value pairs.\n   *\n   * @private\n   * @constructor\n   * @param {Array} [entries] The key-value pairs to cache.\n   */\n  function Stack(entries) {\n    this.__data__ = new ListCache(entries);\n  }\n\n  /**\n   * Removes all key-value entries from the stack.\n   *\n   * @private\n   * @name clear\n   * @memberOf Stack\n   */\n  function stackClear() {\n    this.__data__ = new ListCache;\n  }\n\n  /**\n   * Removes `key` and its value from the stack.\n   *\n   * @private\n   * @name delete\n   * @memberOf Stack\n   * @param {string} key The key of the value to remove.\n   * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n   */\n  function stackDelete(key) {\n    return this.__data__['delete'](key);\n  }\n\n  /**\n   * Gets the stack value for `key`.\n   *\n   * @private\n   * @name get\n   * @memberOf Stack\n   * @param {string} key The key of the value to get.\n   * @returns {*} Returns the entry value.\n   */\n  function stackGet(key) {\n    return this.__data__.get(key);\n  }\n\n  /**\n   * Checks if a stack value for `key` exists.\n   *\n   * @private\n   * @name has\n   * @memberOf Stack\n   * @param {string} key The key of the entry to check.\n   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n   */\n  function stackHas(key) {\n    return this.__data__.has(key);\n  }\n\n  /**\n   * Sets the stack `key` to `value`.\n   *\n   * @private\n   * @name set\n   * @memberOf Stack\n   * @param {string} key The key of the value to set.\n   * @param {*} value The value to set.\n   * @returns {Object} Returns the stack cache instance.\n   */\n  function stackSet(key, value) {\n    var cache = this.__data__;\n    if (cache instanceof ListCache) {\n      var pairs = cache.__data__;\n      if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n        pairs.push([key, value]);\n        return this;\n      }\n      cache = this.__data__ = new MapCache(pairs);\n    }\n    cache.set(key, value);\n    return this;\n  }\n\n  // Add methods to `Stack`.\n  Stack.prototype.clear = stackClear;\n  Stack.prototype['delete'] = stackDelete;\n  Stack.prototype.get = stackGet;\n  Stack.prototype.has = stackHas;\n  Stack.prototype.set = stackSet;\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates an array of the enumerable property names of the array-like `value`.\n   *\n   * @private\n   * @param {*} value The value to query.\n   * @param {boolean} inherited Specify returning inherited property names.\n   * @returns {Array} Returns the array of property names.\n   */\n  function arrayLikeKeys(value, inherited) {\n    // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n    // Safari 9 makes `arguments.length` enumerable in strict mode.\n    var result = (isArray(value) || isArguments(value))\n      ? baseTimes(value.length, String)\n      : [];\n\n    var length = result.length,\n        skipIndexes = !!length;\n\n    for (var key in value) {\n      if ((inherited || hasOwnProperty.call(value, key)) &&\n          !(skipIndexes && (key == 'length' || isIndex(key, length)))) {\n        result.push(key);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * This function is like `assignValue` except that it doesn't assign\n   * `undefined` values.\n   *\n   * @private\n   * @param {Object} object The object to modify.\n   * @param {string} key The key of the property to assign.\n   * @param {*} value The value to assign.\n   */\n  function assignMergeValue(object, key, value) {\n    if ((value !== undefined && !eq(object[key], value)) ||\n        (typeof key == 'number' && value === undefined && !(key in object))) {\n      object[key] = value;\n    }\n  }\n\n  /**\n   * Assigns `value` to `key` of `object` if the existing value is not equivalent\n   * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n   * for equality comparisons.\n   *\n   * @private\n   * @param {Object} object The object to modify.\n   * @param {string} key The key of the property to assign.\n   * @param {*} value The value to assign.\n   */\n  function assignValue(object, key, value) {\n    var objValue = object[key];\n    if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n        (value === undefined && !(key in object))) {\n      object[key] = value;\n    }\n  }\n\n  /**\n   * Gets the index at which the `key` is found in `array` of key-value pairs.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} key The key to search for.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function 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 `_.assign` without support for multiple sources\n   * or `customizer` functions.\n   *\n   * @private\n   * @param {Object} object The destination object.\n   * @param {Object} source The source object.\n   * @returns {Object} Returns `object`.\n   */\n  function baseAssign(object, source) {\n    return object && copyObject(source, keys(source), object);\n  }\n\n  /**\n   * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n   * traversed objects.\n   *\n   * @private\n   * @param {*} value The value to clone.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @param {boolean} [isFull] Specify a clone including symbols.\n   * @param {Function} [customizer] The function to customize cloning.\n   * @param {string} [key] The key of `value`.\n   * @param {Object} [object] The parent object of `value`.\n   * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n   * @returns {*} Returns the cloned value.\n   */\n  function baseClone(value, isDeep, isFull, customizer, key, object, stack) {\n    var result;\n    if (customizer) {\n      result = object ? customizer(value, key, object, stack) : customizer(value);\n    }\n    if (result !== undefined) {\n      return result;\n    }\n    if (!isObject(value)) {\n      return value;\n    }\n    var isArr = isArray(value);\n    if (isArr) {\n      result = initCloneArray(value);\n      if (!isDeep) {\n        return copyArray(value, result);\n      }\n    } else {\n      var tag = getTag(value),\n          isFunc = tag == funcTag || tag == genTag;\n\n      if (isBuffer(value)) {\n        return cloneBuffer(value, isDeep);\n      }\n      if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n        if (isHostObject(value)) {\n          return object ? value : {};\n        }\n        result = initCloneObject(isFunc ? {} : value);\n        if (!isDeep) {\n          return copySymbols(value, baseAssign(result, value));\n        }\n      } else {\n        if (!cloneableTags[tag]) {\n          return object ? value : {};\n        }\n        result = initCloneByTag(value, tag, baseClone, isDeep);\n      }\n    }\n    // Check for circular references and return its corresponding clone.\n    stack || (stack = new Stack);\n    var stacked = stack.get(value);\n    if (stacked) {\n      return stacked;\n    }\n    stack.set(value, result);\n\n    if (!isArr) {\n      var props = isFull ? getAllKeys(value) : keys(value);\n    }\n    arrayEach(props || value, function(subValue, key) {\n      if (props) {\n        key = subValue;\n        subValue = value[key];\n      }\n      // Recursively populate clone (susceptible to call stack limits).\n      assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));\n    });\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.create` without support for assigning\n   * properties to the created object.\n   *\n   * @private\n   * @param {Object} prototype The object to inherit from.\n   * @returns {Object} Returns the new object.\n   */\n  function baseCreate(proto) {\n    return isObject(proto) ? objectCreate(proto) : {};\n  }\n\n  /**\n   * The base implementation of `_.forEach` without support for iteratee shorthands.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array|Object} Returns `collection`.\n   */\n  var baseEach = createBaseEach(baseForOwn);\n\n  /**\n   * The base implementation of `baseForOwn` which iterates over `object`\n   * properties returned by `keysFunc` and invokes `iteratee` for each property.\n   * Iteratee functions may exit iteration early by explicitly returning `false`.\n   *\n   * @private\n   * @param {Object} object The object to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {Function} keysFunc The function to get the keys of `object`.\n   * @returns {Object} Returns `object`.\n   */\n  var baseFor = createBaseFor();\n\n  /**\n   * The base implementation of `_.forOwn` without support for iteratee shorthands.\n   *\n   * @private\n   * @param {Object} object The object to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Object} Returns `object`.\n   */\n  function baseForOwn(object, iteratee) {\n    return object && baseFor(object, iteratee, keys);\n  }\n\n  /**\n   * The base implementation of `_.get` without support for default values.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array|string} path The path of the property to get.\n   * @returns {*} Returns the resolved value.\n   */\n  function baseGet(object, path) {\n    path = isKey(path, object) ? [path] : castPath(path);\n\n    var index = 0,\n        length = path.length;\n\n    while (object != null && index < length) {\n      object = object[toKey(path[index++])];\n    }\n    return (index && index == length) ? object : undefined;\n  }\n\n  /**\n   * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n   * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n   * symbols of `object`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Function} keysFunc The function to get the keys of `object`.\n   * @param {Function} symbolsFunc The function to get the symbols of `object`.\n   * @returns {Array} Returns the array of property names and symbols.\n   */\n  function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n    var result = keysFunc(object);\n    return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n  }\n\n  /**\n   * The base implementation of `getTag`.\n   *\n   * @private\n   * @param {*} value The value to query.\n   * @returns {string} Returns the `toStringTag`.\n   */\n  function baseGetTag(value) {\n    return objectToString.call(value);\n  }\n\n  /**\n   * The base implementation of `_.hasIn` without support for deep paths.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {Array|string} key The key to check.\n   * @returns {boolean} Returns `true` if `key` exists, else `false`.\n   */\n  function baseHasIn(object, key) {\n    return object != null && key in Object(object);\n  }\n\n  /**\n   * The base implementation of `_.isEqual` which supports partial comparisons\n   * and tracks traversed objects.\n   *\n   * @private\n   * @param {*} value The value to compare.\n   * @param {*} other The other value to compare.\n   * @param {Function} [customizer] The function to customize comparisons.\n   * @param {boolean} [bitmask] The bitmask of comparison flags.\n   *  The bitmask may be composed of the following flags:\n   *     1 - Unordered comparison\n   *     2 - Partial comparison\n   * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n   * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n   */\n  function baseIsEqual(value, other, customizer, bitmask, stack) {\n    if (value === other) {\n      return true;\n    }\n    if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {\n      return value !== value && other !== other;\n    }\n    return baseIsEqualDeep(value, other, baseIsEqual, customizer, bitmask, stack);\n  }\n\n  /**\n   * A specialized version of `baseIsEqual` for arrays and objects which performs\n   * deep comparisons and tracks traversed objects enabling objects with circular\n   * references to be compared.\n   *\n   * @private\n   * @param {Object} object The object to compare.\n   * @param {Object} other The other object to compare.\n   * @param {Function} equalFunc The function to determine equivalents of values.\n   * @param {Function} [customizer] The function to customize comparisons.\n   * @param {number} [bitmask] The bitmask of comparison flags. See `baseIsEqual`\n   *  for more details.\n   * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n   * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n   */\n  function baseIsEqualDeep(object, other, equalFunc, customizer, bitmask, stack) {\n    var objIsArr = isArray(object),\n        othIsArr = isArray(other),\n        objTag = arrayTag,\n        othTag = arrayTag;\n\n    if (!objIsArr) {\n      objTag = getTag(object);\n      objTag = objTag == argsTag ? objectTag : objTag;\n    }\n    if (!othIsArr) {\n      othTag = getTag(other);\n      othTag = othTag == argsTag ? objectTag : othTag;\n    }\n    var objIsObj = objTag == objectTag && !isHostObject(object),\n        othIsObj = othTag == objectTag && !isHostObject(other),\n        isSameTag = objTag == othTag;\n\n    if (isSameTag && !objIsObj) {\n      stack || (stack = new Stack);\n      return (objIsArr || isTypedArray(object))\n        ? equalArrays(object, other, equalFunc, customizer, bitmask, stack)\n        : equalByTag(object, other, objTag, equalFunc, customizer, bitmask, stack);\n    }\n    if (!(bitmask & PARTIAL_COMPARE_FLAG)) {\n      var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n          othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n      if (objIsWrapped || othIsWrapped) {\n        var objUnwrapped = objIsWrapped ? object.value() : object,\n            othUnwrapped = othIsWrapped ? other.value() : other;\n\n        stack || (stack = new Stack);\n        return equalFunc(objUnwrapped, othUnwrapped, customizer, bitmask, stack);\n      }\n    }\n    if (!isSameTag) {\n      return false;\n    }\n    stack || (stack = new Stack);\n    return equalObjects(object, other, equalFunc, customizer, bitmask, stack);\n  }\n\n  /**\n   * The base implementation of `_.isMatch` without support for iteratee shorthands.\n   *\n   * @private\n   * @param {Object} object The object to inspect.\n   * @param {Object} source The object of property values to match.\n   * @param {Array} matchData The property names, values, and compare flags to match.\n   * @param {Function} [customizer] The function to customize comparisons.\n   * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n   */\n  function baseIsMatch(object, source, matchData, customizer) {\n    var index = matchData.length,\n        length = index,\n        noCustomizer = !customizer;\n\n    if (object == null) {\n      return !length;\n    }\n    object = Object(object);\n    while (index--) {\n      var data = matchData[index];\n      if ((noCustomizer && data[2])\n            ? data[1] !== object[data[0]]\n            : !(data[0] in object)\n          ) {\n        return false;\n      }\n    }\n    while (++index < length) {\n      data = matchData[index];\n      var key = data[0],\n          objValue = object[key],\n          srcValue = data[1];\n\n      if (noCustomizer && data[2]) {\n        if (objValue === undefined && !(key in object)) {\n          return false;\n        }\n      } else {\n        var stack = new Stack;\n        if (customizer) {\n          var result = customizer(objValue, srcValue, key, object, source, stack);\n        }\n        if (!(result === undefined\n              ? baseIsEqual(srcValue, objValue, customizer, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG, stack)\n              : result\n            )) {\n          return false;\n        }\n      }\n    }\n    return true;\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   */\n  function 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 `_.isTypedArray` without Node.js optimizations.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n   */\n  function baseIsTypedArray(value) {\n    return isObjectLike(value) &&\n      isLength(value.length) && !!typedArrayTags[objectToString.call(value)];\n  }\n\n  /**\n   * The base implementation of `_.iteratee`.\n   *\n   * @private\n   * @param {*} [value=_.identity] The value to convert to an iteratee.\n   * @returns {Function} Returns the iteratee.\n   */\n  function baseIteratee(value) {\n    // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n    // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n    if (typeof value == 'function') {\n      return value;\n    }\n    if (value == null) {\n      return identity;\n    }\n    if (typeof value == 'object') {\n      return isArray(value)\n        ? baseMatchesProperty(value[0], value[1])\n        : baseMatches(value);\n    }\n    return property(value);\n  }\n\n  /**\n   * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of property names.\n   */\n  function baseKeys(object) {\n    if (!isPrototype(object)) {\n      return nativeKeys(object);\n    }\n    var result = [];\n    for (var key in Object(object)) {\n      if (hasOwnProperty.call(object, key) && key != 'constructor') {\n        result.push(key);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of property names.\n   */\n  function baseKeysIn(object) {\n    if (!isObject(object)) {\n      return nativeKeysIn(object);\n    }\n    var isProto = isPrototype(object),\n        result = [];\n\n    for (var key in object) {\n      if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n        result.push(key);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.matches` which doesn't clone `source`.\n   *\n   * @private\n   * @param {Object} source The object of property values to match.\n   * @returns {Function} Returns the new spec function.\n   */\n  function baseMatches(source) {\n    var matchData = getMatchData(source);\n    if (matchData.length == 1 && matchData[0][2]) {\n      return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n    }\n    return function(object) {\n      return object === source || baseIsMatch(object, source, matchData);\n    };\n  }\n\n  /**\n   * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n   *\n   * @private\n   * @param {string} path The path of the property to get.\n   * @param {*} srcValue The value to match.\n   * @returns {Function} Returns the new spec function.\n   */\n  function baseMatchesProperty(path, srcValue) {\n    if (isKey(path) && isStrictComparable(srcValue)) {\n      return matchesStrictComparable(toKey(path), srcValue);\n    }\n    return function(object) {\n      var objValue = get(object, path);\n      return (objValue === undefined && objValue === srcValue)\n        ? hasIn(object, path)\n        : baseIsEqual(srcValue, objValue, undefined, UNORDERED_COMPARE_FLAG | PARTIAL_COMPARE_FLAG);\n    };\n  }\n\n  /**\n   * The base implementation of `_.merge` without support for multiple sources.\n   *\n   * @private\n   * @param {Object} object The destination object.\n   * @param {Object} source The source object.\n   * @param {number} srcIndex The index of `source`.\n   * @param {Function} [customizer] The function to customize merged values.\n   * @param {Object} [stack] Tracks traversed source values and their merged\n   *  counterparts.\n   */\n  function baseMerge(object, source, srcIndex, customizer, stack) {\n    if (object === source) {\n      return;\n    }\n    if (!(isArray(source) || isTypedArray(source))) {\n      var props = baseKeysIn(source);\n    }\n    arrayEach(props || source, function(srcValue, key) {\n      if (props) {\n        key = srcValue;\n        srcValue = source[key];\n      }\n      if (isObject(srcValue)) {\n        stack || (stack = new Stack);\n        baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n      }\n      else {\n        var newValue = customizer\n          ? customizer(object[key], srcValue, (key + ''), object, source, stack)\n          : undefined;\n\n        if (newValue === undefined) {\n          newValue = srcValue;\n        }\n        assignMergeValue(object, key, newValue);\n      }\n    });\n  }\n\n  /**\n   * A specialized version of `baseMerge` for arrays and objects which performs\n   * deep merges and tracks traversed objects enabling objects with circular\n   * references to be merged.\n   *\n   * @private\n   * @param {Object} object The destination object.\n   * @param {Object} source The source object.\n   * @param {string} key The key of the value to merge.\n   * @param {number} srcIndex The index of `source`.\n   * @param {Function} mergeFunc The function to merge values.\n   * @param {Function} [customizer] The function to customize assigned values.\n   * @param {Object} [stack] Tracks traversed source values and their merged\n   *  counterparts.\n   */\n  function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n    var objValue = object[key],\n        srcValue = source[key],\n        stacked = stack.get(srcValue);\n\n    if (stacked) {\n      assignMergeValue(object, key, stacked);\n      return;\n    }\n    var newValue = customizer\n      ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n      : undefined;\n\n    var isCommon = newValue === undefined;\n\n    if (isCommon) {\n      newValue = srcValue;\n      if (isArray(srcValue) || isTypedArray(srcValue)) {\n        if (isArray(objValue)) {\n          newValue = objValue;\n        }\n        else if (isArrayLikeObject(objValue)) {\n          newValue = copyArray(objValue);\n        }\n        else {\n          isCommon = false;\n          newValue = baseClone(srcValue, true);\n        }\n      }\n      else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n        if (isArguments(objValue)) {\n          newValue = toPlainObject(objValue);\n        }\n        else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {\n          isCommon = false;\n          newValue = baseClone(srcValue, true);\n        }\n        else {\n          newValue = objValue;\n        }\n      }\n      else {\n        isCommon = false;\n      }\n    }\n    if (isCommon) {\n      // Recursively merge objects and arrays (susceptible to call stack limits).\n      stack.set(srcValue, newValue);\n      mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n      stack['delete'](srcValue);\n    }\n    assignMergeValue(object, key, newValue);\n  }\n\n  /**\n   * A specialized version of `baseProperty` which supports deep paths.\n   *\n   * @private\n   * @param {Array|string} path The path of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyDeep(path) {\n    return function(object) {\n      return baseGet(object, path);\n    };\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   */\n  function 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   * The base implementation of `_.toString` which doesn't convert nullish\n   * values to empty strings.\n   *\n   * @private\n   * @param {*} value The value to process.\n   * @returns {string} Returns the string.\n   */\n  function baseToString(value) {\n    // Exit early for strings to avoid a performance hit in some environments.\n    if (typeof value == 'string') {\n      return value;\n    }\n    if (isSymbol(value)) {\n      return symbolToString ? symbolToString.call(value) : '';\n    }\n    var result = (value + '');\n    return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n  }\n\n  /**\n   * Casts `value` to a path array if it's not one.\n   *\n   * @private\n   * @param {*} value The value to inspect.\n   * @returns {Array} Returns the cast property path array.\n   */\n  function castPath(value) {\n    return isArray(value) ? value : stringToPath(value);\n  }\n\n  /**\n   * Creates a clone of  `buffer`.\n   *\n   * @private\n   * @param {Buffer} buffer The buffer to clone.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @returns {Buffer} Returns the cloned buffer.\n   */\n  function cloneBuffer(buffer, isDeep) {\n    if (isDeep) {\n      return buffer.slice();\n    }\n    var result = new buffer.constructor(buffer.length);\n    buffer.copy(result);\n    return result;\n  }\n\n  /**\n   * Creates a clone of `arrayBuffer`.\n   *\n   * @private\n   * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n   * @returns {ArrayBuffer} Returns the cloned array buffer.\n   */\n  function cloneArrayBuffer(arrayBuffer) {\n    var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n    new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n    return result;\n  }\n\n  /**\n   * Creates a clone of `dataView`.\n   *\n   * @private\n   * @param {Object} dataView The data view to clone.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @returns {Object} Returns the cloned data view.\n   */\n  function cloneDataView(dataView, isDeep) {\n    var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n    return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n  }\n\n  /**\n   * Creates a clone of `map`.\n   *\n   * @private\n   * @param {Object} map The map to clone.\n   * @param {Function} cloneFunc The function to clone values.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @returns {Object} Returns the cloned map.\n   */\n  function cloneMap(map, isDeep, cloneFunc) {\n    var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);\n    return arrayReduce(array, addMapEntry, new map.constructor);\n  }\n\n  /**\n   * Creates a clone of `regexp`.\n   *\n   * @private\n   * @param {Object} regexp The regexp to clone.\n   * @returns {Object} Returns the cloned regexp.\n   */\n  function cloneRegExp(regexp) {\n    var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n    result.lastIndex = regexp.lastIndex;\n    return result;\n  }\n\n  /**\n   * Creates a clone of `set`.\n   *\n   * @private\n   * @param {Object} set The set to clone.\n   * @param {Function} cloneFunc The function to clone values.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @returns {Object} Returns the cloned set.\n   */\n  function cloneSet(set, isDeep, cloneFunc) {\n    var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);\n    return arrayReduce(array, addSetEntry, new set.constructor);\n  }\n\n  /**\n   * Creates a clone of the `symbol` object.\n   *\n   * @private\n   * @param {Object} symbol The symbol object to clone.\n   * @returns {Object} Returns the cloned symbol object.\n   */\n  function cloneSymbol(symbol) {\n    return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n  }\n\n  /**\n   * Creates a clone of `typedArray`.\n   *\n   * @private\n   * @param {Object} typedArray The typed array to clone.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @returns {Object} Returns the cloned typed array.\n   */\n  function cloneTypedArray(typedArray, isDeep) {\n    var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n    return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n  }\n\n  /**\n   * Copies the values of `source` to `array`.\n   *\n   * @private\n   * @param {Array} source The array to copy values from.\n   * @param {Array} [array=[]] The array to copy values to.\n   * @returns {Array} Returns `array`.\n   */\n  function copyArray(source, array) {\n    var index = -1,\n        length = source.length;\n\n    array || (array = Array(length));\n    while (++index < length) {\n      array[index] = source[index];\n    }\n    return array;\n  }\n\n  /**\n   * Copies properties of `source` to `object`.\n   *\n   * @private\n   * @param {Object} source The object to copy properties from.\n   * @param {Array} props The property identifiers to copy.\n   * @param {Object} [object={}] The object to copy properties to.\n   * @param {Function} [customizer] The function to customize copied values.\n   * @returns {Object} Returns `object`.\n   */\n  function copyObject(source, props, object, customizer) {\n    object || (object = {});\n\n    var index = -1,\n        length = props.length;\n\n    while (++index < length) {\n      var key = props[index];\n\n      var newValue = customizer\n        ? customizer(object[key], source[key], key, object, source)\n        : undefined;\n\n      assignValue(object, key, newValue === undefined ? source[key] : newValue);\n    }\n    return object;\n  }\n\n  /**\n   * Copies own symbol properties of `source` to `object`.\n   *\n   * @private\n   * @param {Object} source The object to copy symbols from.\n   * @param {Object} [object={}] The object to copy symbols to.\n   * @returns {Object} Returns `object`.\n   */\n  function copySymbols(source, object) {\n    return copyObject(source, getSymbols(source), object);\n  }\n\n  /**\n   * Creates a function like `_.assign`.\n   *\n   * @private\n   * @param {Function} assigner The function to assign values.\n   * @returns {Function} Returns the new assigner function.\n   */\n  function createAssigner(assigner) {\n    return baseRest(function(object, sources) {\n      var index = -1,\n          length = sources.length,\n          customizer = length > 1 ? sources[length - 1] : undefined,\n          guard = length > 2 ? sources[2] : undefined;\n\n      customizer = (assigner.length > 3 && typeof customizer == 'function')\n        ? (length--, customizer)\n        : undefined;\n\n      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n        customizer = length < 3 ? undefined : customizer;\n        length = 1;\n      }\n      object = Object(object);\n      while (++index < length) {\n        var source = sources[index];\n        if (source) {\n          assigner(object, source, index, customizer);\n        }\n      }\n      return object;\n    });\n  }\n\n  /**\n   * Creates a `baseEach` or `baseEachRight` function.\n   *\n   * @private\n   * @param {Function} eachFunc The function to iterate over a collection.\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {Function} Returns the new base function.\n   */\n  function createBaseEach(eachFunc, fromRight) {\n    return function(collection, iteratee) {\n      if (collection == null) {\n        return collection;\n      }\n      if (!isArrayLike(collection)) {\n        return eachFunc(collection, iteratee);\n      }\n      var length = collection.length,\n          index = fromRight ? length : -1,\n          iterable = Object(collection);\n\n      while ((fromRight ? index-- : ++index < length)) {\n        if (iteratee(iterable[index], index, iterable) === false) {\n          break;\n        }\n      }\n      return collection;\n    };\n  }\n\n  /**\n   * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n   *\n   * @private\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {Function} Returns the new base function.\n   */\n  function createBaseFor(fromRight) {\n    return function(object, iteratee, keysFunc) {\n      var index = -1,\n          iterable = Object(object),\n          props = keysFunc(object),\n          length = props.length;\n\n      while (length--) {\n        var key = props[fromRight ? length : ++index];\n        if (iteratee(iterable[key], key, iterable) === false) {\n          break;\n        }\n      }\n      return object;\n    };\n  }\n\n  /**\n   * A specialized version of `baseIsEqualDeep` for arrays with support for\n   * partial deep comparisons.\n   *\n   * @private\n   * @param {Array} array The array to compare.\n   * @param {Array} other The other array to compare.\n   * @param {Function} equalFunc The function to determine equivalents of values.\n   * @param {Function} customizer The function to customize comparisons.\n   * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`\n   *  for more details.\n   * @param {Object} stack Tracks traversed `array` and `other` objects.\n   * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n   */\n  function equalArrays(array, other, equalFunc, customizer, bitmask, stack) {\n    var isPartial = bitmask & PARTIAL_COMPARE_FLAG,\n        arrLength = array.length,\n        othLength = other.length;\n\n    if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n      return false;\n    }\n    // Assume cyclic values are equal.\n    var stacked = stack.get(array);\n    if (stacked && stack.get(other)) {\n      return stacked == other;\n    }\n    var index = -1,\n        result = true,\n        seen = (bitmask & UNORDERED_COMPARE_FLAG) ? new SetCache : undefined;\n\n    stack.set(array, other);\n    stack.set(other, array);\n\n    // Ignore non-index properties.\n    while (++index < arrLength) {\n      var arrValue = array[index],\n          othValue = other[index];\n\n      if (customizer) {\n        var compared = isPartial\n          ? customizer(othValue, arrValue, index, other, array, stack)\n          : customizer(arrValue, othValue, index, array, other, stack);\n      }\n      if (compared !== undefined) {\n        if (compared) {\n          continue;\n        }\n        result = false;\n        break;\n      }\n      // Recursively compare arrays (susceptible to call stack limits).\n      if (seen) {\n        if (!arraySome(other, function(othValue, othIndex) {\n              if (!seen.has(othIndex) &&\n                  (arrValue === othValue || equalFunc(arrValue, othValue, customizer, bitmask, stack))) {\n                return seen.add(othIndex);\n              }\n            })) {\n          result = false;\n          break;\n        }\n      } else if (!(\n            arrValue === othValue ||\n              equalFunc(arrValue, othValue, customizer, bitmask, stack)\n          )) {\n        result = false;\n        break;\n      }\n    }\n    stack['delete'](array);\n    stack['delete'](other);\n    return result;\n  }\n\n  /**\n   * A specialized version of `baseIsEqualDeep` for comparing objects of\n   * the same `toStringTag`.\n   *\n   * **Note:** This function only supports comparing values with tags of\n   * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n   *\n   * @private\n   * @param {Object} object The object to compare.\n   * @param {Object} other The other object to compare.\n   * @param {string} tag The `toStringTag` of the objects to compare.\n   * @param {Function} equalFunc The function to determine equivalents of values.\n   * @param {Function} customizer The function to customize comparisons.\n   * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`\n   *  for more details.\n   * @param {Object} stack Tracks traversed `object` and `other` objects.\n   * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n   */\n  function equalByTag(object, other, tag, equalFunc, customizer, bitmask, stack) {\n    switch (tag) {\n      case dataViewTag:\n        if ((object.byteLength != other.byteLength) ||\n            (object.byteOffset != other.byteOffset)) {\n          return false;\n        }\n        object = object.buffer;\n        other = other.buffer;\n\n      case arrayBufferTag:\n        if ((object.byteLength != other.byteLength) ||\n            !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n          return false;\n        }\n        return true;\n\n      case boolTag:\n      case dateTag:\n      case numberTag:\n        // Coerce booleans to `1` or `0` and dates to milliseconds.\n        // Invalid dates are coerced to `NaN`.\n        return eq(+object, +other);\n\n      case errorTag:\n        return object.name == other.name && object.message == other.message;\n\n      case regexpTag:\n      case stringTag:\n        // Coerce regexes to strings and treat strings, primitives and objects,\n        // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n        // for more details.\n        return object == (other + '');\n\n      case mapTag:\n        var convert = mapToArray;\n\n      case setTag:\n        var isPartial = bitmask & PARTIAL_COMPARE_FLAG;\n        convert || (convert = setToArray);\n\n        if (object.size != other.size && !isPartial) {\n          return false;\n        }\n        // Assume cyclic values are equal.\n        var stacked = stack.get(object);\n        if (stacked) {\n          return stacked == other;\n        }\n        bitmask |= UNORDERED_COMPARE_FLAG;\n\n        // Recursively compare objects (susceptible to call stack limits).\n        stack.set(object, other);\n        var result = equalArrays(convert(object), convert(other), equalFunc, customizer, bitmask, stack);\n        stack['delete'](object);\n        return result;\n\n      case symbolTag:\n        if (symbolValueOf) {\n          return symbolValueOf.call(object) == symbolValueOf.call(other);\n        }\n    }\n    return false;\n  }\n\n  /**\n   * A specialized version of `baseIsEqualDeep` for objects with support for\n   * partial deep comparisons.\n   *\n   * @private\n   * @param {Object} object The object to compare.\n   * @param {Object} other The other object to compare.\n   * @param {Function} equalFunc The function to determine equivalents of values.\n   * @param {Function} customizer The function to customize comparisons.\n   * @param {number} bitmask The bitmask of comparison flags. See `baseIsEqual`\n   *  for more details.\n   * @param {Object} stack Tracks traversed `object` and `other` objects.\n   * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n   */\n  function equalObjects(object, other, equalFunc, customizer, bitmask, stack) {\n    var isPartial = bitmask & PARTIAL_COMPARE_FLAG,\n        objProps = keys(object),\n        objLength = objProps.length,\n        othProps = keys(other),\n        othLength = othProps.length;\n\n    if (objLength != othLength && !isPartial) {\n      return false;\n    }\n    var index = objLength;\n    while (index--) {\n      var key = objProps[index];\n      if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n        return false;\n      }\n    }\n    // Assume cyclic values are equal.\n    var stacked = stack.get(object);\n    if (stacked && stack.get(other)) {\n      return stacked == other;\n    }\n    var result = true;\n    stack.set(object, other);\n    stack.set(other, object);\n\n    var skipCtor = isPartial;\n    while (++index < objLength) {\n      key = objProps[index];\n      var objValue = object[key],\n          othValue = other[key];\n\n      if (customizer) {\n        var compared = isPartial\n          ? customizer(othValue, objValue, key, other, object, stack)\n          : customizer(objValue, othValue, key, object, other, stack);\n      }\n      // Recursively compare objects (susceptible to call stack limits).\n      if (!(compared === undefined\n            ? (objValue === othValue || equalFunc(objValue, othValue, customizer, bitmask, stack))\n            : compared\n          )) {\n        result = false;\n        break;\n      }\n      skipCtor || (skipCtor = key == 'constructor');\n    }\n    if (result && !skipCtor) {\n      var objCtor = object.constructor,\n          othCtor = other.constructor;\n\n      // Non `Object` object instances with different constructors are not equal.\n      if (objCtor != othCtor &&\n          ('constructor' in object && 'constructor' in other) &&\n          !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n            typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n        result = false;\n      }\n    }\n    stack['delete'](object);\n    stack['delete'](other);\n    return result;\n  }\n\n  /**\n   * Creates an array of own enumerable property names and symbols of `object`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of property names and symbols.\n   */\n  function getAllKeys(object) {\n    return baseGetAllKeys(object, keys, getSymbols);\n  }\n\n  /**\n   * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n   * this function returns the custom method, otherwise it returns `baseIteratee`.\n   * If arguments are provided, the chosen function is invoked with them and\n   * its result is returned.\n   *\n   * @private\n   * @param {*} [value] The value to convert to an iteratee.\n   * @param {number} [arity] The arity of the created iteratee.\n   * @returns {Function} Returns the chosen function or its result.\n   */\n  function getIteratee() {\n    var result = lodash.iteratee || iteratee;\n    result = result === iteratee ? baseIteratee : result;\n    return arguments.length ? result(arguments[0], arguments[1]) : result;\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   */\n  function 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 property names, values, and compare flags of `object`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the match data of `object`.\n   */\n  function getMatchData(object) {\n    var result = keys(object),\n        length = result.length;\n\n    while (length--) {\n      var key = result[length],\n          value = object[key];\n\n      result[length] = [key, value, isStrictComparable(value)];\n    }\n    return result;\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   */\n  function getNative(object, key) {\n    var value = getValue(object, key);\n    return baseIsNative(value) ? value : undefined;\n  }\n\n  /**\n   * Creates an array of the own enumerable symbol properties of `object`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of symbols.\n   */\n  var getSymbols = nativeGetSymbols ? overArg(nativeGetSymbols, Object) : stubArray;\n\n  /**\n   * Gets the `toStringTag` of `value`.\n   *\n   * @private\n   * @param {*} value The value to query.\n   * @returns {string} Returns the `toStringTag`.\n   */\n  var getTag = baseGetTag;\n\n  // Fallback for data views, maps, sets, and weak maps in IE 11,\n  // for data views in Edge < 14, and promises in Node.js.\n  if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n      (Map && getTag(new Map) != mapTag) ||\n      (Promise && getTag(Promise.resolve()) != promiseTag) ||\n      (Set && getTag(new Set) != setTag) ||\n      (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n    getTag = function(value) {\n      var result = objectToString.call(value),\n          Ctor = result == objectTag ? value.constructor : undefined,\n          ctorString = Ctor ? toSource(Ctor) : undefined;\n\n      if (ctorString) {\n        switch (ctorString) {\n          case dataViewCtorString: return dataViewTag;\n          case mapCtorString: return mapTag;\n          case promiseCtorString: return promiseTag;\n          case setCtorString: return setTag;\n          case weakMapCtorString: return weakMapTag;\n        }\n      }\n      return result;\n    };\n  }\n\n  /**\n   * Checks if `path` exists on `object`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array|string} path The path to check.\n   * @param {Function} hasFunc The function to check properties.\n   * @returns {boolean} Returns `true` if `path` exists, else `false`.\n   */\n  function hasPath(object, path, hasFunc) {\n    path = isKey(path, object) ? [path] : castPath(path);\n\n    var result,\n        index = -1,\n        length = path.length;\n\n    while (++index < length) {\n      var key = toKey(path[index]);\n      if (!(result = object != null && hasFunc(object, key))) {\n        break;\n      }\n      object = object[key];\n    }\n    if (result) {\n      return result;\n    }\n    var length = object ? object.length : 0;\n    return !!length && isLength(length) && isIndex(key, length) &&\n      (isArray(object) || isArguments(object));\n  }\n\n  /**\n   * Initializes an array clone.\n   *\n   * @private\n   * @param {Array} array The array to clone.\n   * @returns {Array} Returns the initialized clone.\n   */\n  function initCloneArray(array) {\n    var length = array.length,\n        result = array.constructor(length);\n\n    // Add properties assigned by `RegExp#exec`.\n    if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n      result.index = array.index;\n      result.input = array.input;\n    }\n    return result;\n  }\n\n  /**\n   * Initializes an object clone.\n   *\n   * @private\n   * @param {Object} object The object to clone.\n   * @returns {Object} Returns the initialized clone.\n   */\n  function initCloneObject(object) {\n    return (typeof object.constructor == 'function' && !isPrototype(object))\n      ? baseCreate(getPrototype(object))\n      : {};\n  }\n\n  /**\n   * Initializes an object clone based on its `toStringTag`.\n   *\n   * **Note:** This function only supports cloning values with tags of\n   * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n   *\n   * @private\n   * @param {Object} object The object to clone.\n   * @param {string} tag The `toStringTag` of the object to clone.\n   * @param {Function} cloneFunc The function to clone values.\n   * @param {boolean} [isDeep] Specify a deep clone.\n   * @returns {Object} Returns the initialized clone.\n   */\n  function initCloneByTag(object, tag, cloneFunc, isDeep) {\n    var Ctor = object.constructor;\n    switch (tag) {\n      case arrayBufferTag:\n        return cloneArrayBuffer(object);\n\n      case boolTag:\n      case dateTag:\n        return new Ctor(+object);\n\n      case dataViewTag:\n        return cloneDataView(object, isDeep);\n\n      case float32Tag: case float64Tag:\n      case int8Tag: case int16Tag: case int32Tag:\n      case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n        return cloneTypedArray(object, isDeep);\n\n      case mapTag:\n        return cloneMap(object, isDeep, cloneFunc);\n\n      case numberTag:\n      case stringTag:\n        return new Ctor(object);\n\n      case regexpTag:\n        return cloneRegExp(object);\n\n      case setTag:\n        return cloneSet(object, isDeep, cloneFunc);\n\n      case symbolTag:\n        return cloneSymbol(object);\n    }\n  }\n\n  /**\n   * Checks if `value` is a valid array-like index.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n   * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n   */\n  function isIndex(value, length) {\n    length = length == null ? MAX_SAFE_INTEGER : length;\n    return !!length &&\n      (typeof value == 'number' || reIsUint.test(value)) &&\n      (value > -1 && value % 1 == 0 && value < length);\n  }\n\n  /**\n   * Checks if the given arguments are from an iteratee call.\n   *\n   * @private\n   * @param {*} value The potential iteratee value argument.\n   * @param {*} index The potential iteratee index or key argument.\n   * @param {*} object The potential iteratee object argument.\n   * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n   *  else `false`.\n   */\n  function isIterateeCall(value, index, object) {\n    if (!isObject(object)) {\n      return false;\n    }\n    var type = typeof index;\n    if (type == 'number'\n          ? (isArrayLike(object) && isIndex(index, object.length))\n          : (type == 'string' && index in object)\n        ) {\n      return eq(object[index], value);\n    }\n    return false;\n  }\n\n  /**\n   * Checks if `value` is a property name and not a property path.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @param {Object} [object] The object to query keys on.\n   * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n   */\n  function isKey(value, object) {\n    if (isArray(value)) {\n      return false;\n    }\n    var type = typeof value;\n    if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n        value == null || isSymbol(value)) {\n      return true;\n    }\n    return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n      (object != null && value in Object(object));\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   */\n  function 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   */\n  function isMasked(func) {\n    return !!maskSrcKey && (maskSrcKey in func);\n  }\n\n  /**\n   * Checks if `value` is likely a prototype object.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n   */\n  function isPrototype(value) {\n    var Ctor = value && value.constructor,\n        proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n    return value === proto;\n  }\n\n  /**\n   * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` if suitable for strict\n   *  equality comparisons, else `false`.\n   */\n  function isStrictComparable(value) {\n    return value === value && !isObject(value);\n  }\n\n  /**\n   * A specialized version of `matchesProperty` for source values suitable\n   * for strict equality comparisons, i.e. `===`.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @param {*} srcValue The value to match.\n   * @returns {Function} Returns the new spec function.\n   */\n  function matchesStrictComparable(key, srcValue) {\n    return function(object) {\n      if (object == null) {\n        return false;\n      }\n      return object[key] === srcValue &&\n        (srcValue !== undefined || (key in Object(object)));\n    };\n  }\n\n  /**\n   * This function is like\n   * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n   * except that it includes inherited enumerable properties.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of property names.\n   */\n  function nativeKeysIn(object) {\n    var result = [];\n    if (object != null) {\n      for (var key in Object(object)) {\n        result.push(key);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Converts `string` to a property path array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the property path array.\n   */\n  var stringToPath = memoize(function(string) {\n    string = toString(string);\n\n    var result = [];\n    if (reLeadingDot.test(string)) {\n      result.push('');\n    }\n    string.replace(rePropName, function(match, number, quote, string) {\n      result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));\n    });\n    return result;\n  });\n\n  /**\n   * Converts `value` to a string key if it's not a string or symbol.\n   *\n   * @private\n   * @param {*} value The value to inspect.\n   * @returns {string|symbol} Returns the key.\n   */\n  function toKey(value) {\n    if (typeof value == 'string' || isSymbol(value)) {\n      return value;\n    }\n    var result = (value + '');\n    return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\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   */\n  function 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\n  /**\n   * Creates an array with all falsey values removed. The values `false`, `null`,\n   * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.1.0\n   * @category Array\n   * @param {Array} array The array to compact.\n   * @returns {Array} Returns the new array of filtered values.\n   * @example\n   *\n   * _.compact([0, 1, false, 2, '', 3]);\n   * // => [1, 2, 3]\n   */\n  function compact(array) {\n    var index = -1,\n        length = array ? array.length : 0,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value) {\n        result[resIndex++] = value;\n      }\n    }\n    return result;\n  }\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Iterates over elements of `collection` and invokes `iteratee` for each element.\n   * The iteratee is invoked with three arguments: (value, index|key, collection).\n   * Iteratee functions may exit iteration early by explicitly returning `false`.\n   *\n   * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n   * property are iterated like arrays. To avoid this behavior use `_.forIn`\n   * or `_.forOwn` for object iteration.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.1.0\n   * @alias each\n   * @category Collection\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n   * @returns {Array|Object} Returns `collection`.\n   * @see _.forEachRight\n   * @example\n   *\n   * _([1, 2]).forEach(function(value) {\n   *   console.log(value);\n   * });\n   * // => Logs `1` then `2`.\n   *\n   * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n   *   console.log(key);\n   * });\n   * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n   */\n  function forEach(collection, iteratee) {\n    var func = isArray(collection) ? arrayEach : baseEach;\n    return func(collection, getIteratee(iteratee, 3));\n  }\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates a function that memoizes the result of `func`. If `resolver` is\n   * provided, it determines the cache key for storing the result based on the\n   * arguments provided to the memoized function. By default, the first argument\n   * provided to the memoized function is used as the map cache key. The `func`\n   * is invoked with the `this` binding of the memoized function.\n   *\n   * **Note:** The cache is exposed as the `cache` property on the memoized\n   * function. Its creation may be customized by replacing the `_.memoize.Cache`\n   * constructor with one whose instances implement the\n   * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n   * method interface of `delete`, `get`, `has`, and `set`.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.1.0\n   * @category Function\n   * @param {Function} func The function to have its output memoized.\n   * @param {Function} [resolver] The function to resolve the cache key.\n   * @returns {Function} Returns the new memoized function.\n   * @example\n   *\n   * var object = { 'a': 1, 'b': 2 };\n   * var other = { 'c': 3, 'd': 4 };\n   *\n   * var values = _.memoize(_.values);\n   * values(object);\n   * // => [1, 2]\n   *\n   * values(other);\n   * // => [3, 4]\n   *\n   * object.a = 2;\n   * values(object);\n   * // => [1, 2]\n   *\n   * // Modify the result cache.\n   * values.cache.set(object, ['a', 'b']);\n   * values(object);\n   * // => ['a', 'b']\n   *\n   * // Replace `_.memoize.Cache`.\n   * _.memoize.Cache = WeakMap;\n   */\n  function memoize(func, resolver) {\n    if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {\n      throw new TypeError(FUNC_ERROR_TEXT);\n    }\n    var memoized = function() {\n      var args = arguments,\n          key = resolver ? resolver.apply(this, args) : args[0],\n          cache = memoized.cache;\n\n      if (cache.has(key)) {\n        return cache.get(key);\n      }\n      var result = func.apply(this, args);\n      memoized.cache = cache.set(key, result);\n      return result;\n    };\n    memoized.cache = new (memoize.Cache || MapCache);\n    return memoized;\n  }\n\n  // Assign cache to `_.memoize`.\n  memoize.Cache = MapCache;\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Creates a shallow clone of `value`.\n   *\n   * **Note:** This method is loosely based on the\n   * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n   * and supports cloning arrays, array buffers, booleans, date objects, maps,\n   * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n   * arrays. The own enumerable properties of `arguments` objects are cloned\n   * as plain objects. An empty object is returned for uncloneable values such\n   * as error objects, functions, DOM nodes, and WeakMaps.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.1.0\n   * @category Lang\n   * @param {*} value The value to clone.\n   * @returns {*} Returns the cloned value.\n   * @see _.cloneDeep\n   * @example\n   *\n   * var objects = [{ 'a': 1 }, { 'b': 2 }];\n   *\n   * var shallow = _.clone(objects);\n   * console.log(shallow[0] === objects[0]);\n   * // => true\n   */\n  function clone(value) {\n    return baseClone(value, false, true);\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   */\n  function eq(value, other) {\n    return value === other || (value !== value && other !== other);\n  }\n\n  /**\n   * Checks if `value` is likely an `arguments` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.1.0\n   * @category Lang\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n   *  else `false`.\n   * @example\n   *\n   * _.isArguments(function() { return arguments; }());\n   * // => true\n   *\n   * _.isArguments([1, 2, 3]);\n   * // => false\n   */\n  function isArguments(value) {\n    // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n    return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n      (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n  }\n\n  /**\n   * Checks if `value` is classified as an `Array` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.1.0\n   * @category Lang\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n   * @example\n   *\n   * _.isArray([1, 2, 3]);\n   * // => true\n   *\n   * _.isArray(document.body.children);\n   * // => false\n   *\n   * _.isArray('abc');\n   * // => false\n   *\n   * _.isArray(_.noop);\n   * // => false\n   */\n  var isArray = Array.isArray;\n\n  /**\n   * Checks if `value` is array-like. A value is considered array-like if it's\n   * not a function and has a `value.length` that's an integer greater than or\n   * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n   *\n   * @static\n   * @memberOf _\n   * @since 4.0.0\n   * @category Lang\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n   * @example\n   *\n   * _.isArrayLike([1, 2, 3]);\n   * // => true\n   *\n   * _.isArrayLike(document.body.children);\n   * // => true\n   *\n   * _.isArrayLike('abc');\n   * // => true\n   *\n   * _.isArrayLike(_.noop);\n   * // => false\n   */\n  function 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   */\n  function isArrayLikeObject(value) {\n    return isObjectLike(value) && isArrayLike(value);\n  }\n\n  /**\n   * Checks if `value` is a buffer.\n   *\n   * @static\n   * @memberOf _\n   * @since 4.3.0\n   * @category Lang\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n   * @example\n   *\n   * _.isBuffer(new Buffer(2));\n   * // => true\n   *\n   * _.isBuffer(new Uint8Array(2));\n   * // => false\n   */\n  var isBuffer = nativeIsBuffer || stubFalse;\n\n  /**\n   * Checks if `value` is an empty object, collection, map, or set.\n   *\n   * Objects are considered empty if they have no own enumerable string keyed\n   * properties.\n   *\n   * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n   * jQuery-like collections are considered empty if they have a `length` of `0`.\n   * Similarly, maps and sets are considered empty if they have a `size` of `0`.\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 empty, else `false`.\n   * @example\n   *\n   * _.isEmpty(null);\n   * // => true\n   *\n   * _.isEmpty(true);\n   * // => true\n   *\n   * _.isEmpty(1);\n   * // => true\n   *\n   * _.isEmpty([1, 2, 3]);\n   * // => false\n   *\n   * _.isEmpty({ 'a': 1 });\n   * // => false\n   */\n  function isEmpty(value) {\n    if (isArrayLike(value) &&\n        (isArray(value) || typeof value == 'string' ||\n          typeof value.splice == 'function' || isBuffer(value) || isArguments(value))) {\n      return !value.length;\n    }\n    var tag = getTag(value);\n    if (tag == mapTag || tag == setTag) {\n      return !value.size;\n    }\n    if (nonEnumShadows || isPrototype(value)) {\n      return !nativeKeys(value).length;\n    }\n    for (var key in value) {\n      if (hasOwnProperty.call(value, key)) {\n        return false;\n      }\n    }\n    return true;\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   */\n  function 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   */\n  function 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   */\n  function 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   */\n  function isObjectLike(value) {\n    return !!value && typeof value == 'object';\n  }\n\n  /**\n   * Checks if `value` is a plain object, that is, an object created by the\n   * `Object` constructor or one with a `[[Prototype]]` of `null`.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.8.0\n   * @category Lang\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n   * @example\n   *\n   * function Foo() {\n   *   this.a = 1;\n   * }\n   *\n   * _.isPlainObject(new Foo);\n   * // => false\n   *\n   * _.isPlainObject([1, 2, 3]);\n   * // => false\n   *\n   * _.isPlainObject({ 'x': 0, 'y': 0 });\n   * // => true\n   *\n   * _.isPlainObject(Object.create(null));\n   * // => true\n   */\n  function isPlainObject(value) {\n    if (!isObjectLike(value) ||\n        objectToString.call(value) != objectTag || isHostObject(value)) {\n      return false;\n    }\n    var proto = getPrototype(value);\n    if (proto === null) {\n      return true;\n    }\n    var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n    return (typeof Ctor == 'function' &&\n      Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString);\n  }\n\n  /**\n   * Checks if `value` is classified as a `Symbol` primitive or 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 a symbol, else `false`.\n   * @example\n   *\n   * _.isSymbol(Symbol.iterator);\n   * // => true\n   *\n   * _.isSymbol('abc');\n   * // => false\n   */\n  function isSymbol(value) {\n    return typeof value == 'symbol' ||\n      (isObjectLike(value) && objectToString.call(value) == symbolTag);\n  }\n\n  /**\n   * Checks if `value` is classified as a typed array.\n   *\n   * @static\n   * @memberOf _\n   * @since 3.0.0\n   * @category Lang\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n   * @example\n   *\n   * _.isTypedArray(new Uint8Array);\n   * // => true\n   *\n   * _.isTypedArray([]);\n   * // => false\n   */\n  var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n  /**\n   * Converts `value` to a plain object flattening inherited enumerable string\n   * keyed properties of `value` to own properties of the plain object.\n   *\n   * @static\n   * @memberOf _\n   * @since 3.0.0\n   * @category Lang\n   * @param {*} value The value to convert.\n   * @returns {Object} Returns the converted plain object.\n   * @example\n   *\n   * function Foo() {\n   *   this.b = 2;\n   * }\n   *\n   * Foo.prototype.c = 3;\n   *\n   * _.assign({ 'a': 1 }, new Foo);\n   * // => { 'a': 1, 'b': 2 }\n   *\n   * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n   * // => { 'a': 1, 'b': 2, 'c': 3 }\n   */\n  function toPlainObject(value) {\n    return copyObject(value, keysIn(value));\n  }\n\n  /**\n   * Converts `value` to a string. An empty string is returned for `null`\n   * and `undefined` values. The sign of `-0` is preserved.\n   *\n   * @static\n   * @memberOf _\n   * @since 4.0.0\n   * @category Lang\n   * @param {*} value The value to process.\n   * @returns {string} Returns the string.\n   * @example\n   *\n   * _.toString(null);\n   * // => ''\n   *\n   * _.toString(-0);\n   * // => '-0'\n   *\n   * _.toString([1, 2, 3]);\n   * // => '1,2,3'\n   */\n  function toString(value) {\n    return value == null ? '' : baseToString(value);\n  }\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * Gets the value at `path` of `object`. If the resolved value is\n   * `undefined`, the `defaultValue` is returned in its place.\n   *\n   * @static\n   * @memberOf _\n   * @since 3.7.0\n   * @category Object\n   * @param {Object} object The object to query.\n   * @param {Array|string} path The path of the property to get.\n   * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n   * @returns {*} Returns the resolved value.\n   * @example\n   *\n   * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n   *\n   * _.get(object, 'a[0].b.c');\n   * // => 3\n   *\n   * _.get(object, ['a', '0', 'b', 'c']);\n   * // => 3\n   *\n   * _.get(object, 'a.b.c', 'default');\n   * // => 'default'\n   */\n  function get(object, path, defaultValue) {\n    var result = object == null ? undefined : baseGet(object, path);\n    return result === undefined ? defaultValue : result;\n  }\n\n  /**\n   * Checks if `path` is a direct or inherited property of `object`.\n   *\n   * @static\n   * @memberOf _\n   * @since 4.0.0\n   * @category Object\n   * @param {Object} object The object to query.\n   * @param {Array|string} path The path to check.\n   * @returns {boolean} Returns `true` if `path` exists, else `false`.\n   * @example\n   *\n   * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n   *\n   * _.hasIn(object, 'a');\n   * // => true\n   *\n   * _.hasIn(object, 'a.b');\n   * // => true\n   *\n   * _.hasIn(object, ['a', 'b']);\n   * // => true\n   *\n   * _.hasIn(object, 'b');\n   * // => false\n   */\n  function hasIn(object, path) {\n    return object != null && hasPath(object, path, baseHasIn);\n  }\n\n  /**\n   * Creates an array of the own enumerable property names of `object`.\n   *\n   * **Note:** Non-object values are coerced to objects. See the\n   * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n   * for more details.\n   *\n   * @static\n   * @since 0.1.0\n   * @memberOf _\n   * @category Object\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of property names.\n   * @example\n   *\n   * function Foo() {\n   *   this.a = 1;\n   *   this.b = 2;\n   * }\n   *\n   * Foo.prototype.c = 3;\n   *\n   * _.keys(new Foo);\n   * // => ['a', 'b'] (iteration order is not guaranteed)\n   *\n   * _.keys('hi');\n   * // => ['0', '1']\n   */\n  function keys(object) {\n    return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n  }\n\n  /**\n   * Creates an array of the own and inherited enumerable property names of `object`.\n   *\n   * **Note:** Non-object values are coerced to objects.\n   *\n   * @static\n   * @memberOf _\n   * @since 3.0.0\n   * @category Object\n   * @param {Object} object The object to query.\n   * @returns {Array} Returns the array of property names.\n   * @example\n   *\n   * function Foo() {\n   *   this.a = 1;\n   *   this.b = 2;\n   * }\n   *\n   * Foo.prototype.c = 3;\n   *\n   * _.keysIn(new Foo);\n   * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n   */\n  function keysIn(object) {\n    return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n  }\n\n  /**\n   * This method is like `_.assign` except that it recursively merges own and\n   * inherited enumerable string keyed properties of source objects into the\n   * destination object. Source properties that resolve to `undefined` are\n   * skipped if a destination value exists. Array and plain object properties\n   * are merged recursively. Other objects and value types are overridden by\n   * assignment. Source objects are applied from left to right. Subsequent\n   * sources overwrite property assignments of previous sources.\n   *\n   * **Note:** This method mutates `object`.\n   *\n   * @static\n   * @memberOf _\n   * @since 0.5.0\n   * @category Object\n   * @param {Object} object The destination object.\n   * @param {...Object} [sources] The source objects.\n   * @returns {Object} Returns `object`.\n   * @example\n   *\n   * var object = {\n   *   'a': [{ 'b': 2 }, { 'd': 4 }]\n   * };\n   *\n   * var other = {\n   *   'a': [{ 'c': 3 }, { 'e': 5 }]\n   * };\n   *\n   * _.merge(object, other);\n   * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n   */\n  var merge = createAssigner(function(object, source, srcIndex) {\n    baseMerge(object, source, srcIndex);\n  });\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * This method returns the first argument it receives.\n   *\n   * @static\n   * @since 0.1.0\n   * @memberOf _\n   * @category Util\n   * @param {*} value Any value.\n   * @returns {*} Returns `value`.\n   * @example\n   *\n   * var object = { 'a': 1 };\n   *\n   * console.log(_.identity(object) === object);\n   * // => true\n   */\n  function identity(value) {\n    return value;\n  }\n\n  /**\n   * Creates a function that invokes `func` with the arguments of the created\n   * function. If `func` is a property name, the created function returns the\n   * property value for a given element. If `func` is an array or object, the\n   * created function returns `true` for elements that contain the equivalent\n   * source properties, otherwise it returns `false`.\n   *\n   * @static\n   * @since 4.0.0\n   * @memberOf _\n   * @category Util\n   * @param {*} [func=_.identity] The value to convert to a callback.\n   * @returns {Function} Returns the callback.\n   * @example\n   *\n   * var users = [\n   *   { 'user': 'barney', 'age': 36, 'active': true },\n   *   { 'user': 'fred',   'age': 40, 'active': false }\n   * ];\n   *\n   * // The `_.matches` iteratee shorthand.\n   * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n   * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n   *\n   * // The `_.matchesProperty` iteratee shorthand.\n   * _.filter(users, _.iteratee(['user', 'fred']));\n   * // => [{ 'user': 'fred', 'age': 40 }]\n   *\n   * // The `_.property` iteratee shorthand.\n   * _.map(users, _.iteratee('user'));\n   * // => ['barney', 'fred']\n   *\n   * // Create custom iteratee shorthands.\n   * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n   *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n   *     return func.test(string);\n   *   };\n   * });\n   *\n   * _.filter(['abc', 'def'], /ef/);\n   * // => ['def']\n   */\n  function iteratee(func) {\n    return baseIteratee(typeof func == 'function' ? func : baseClone(func, true));\n  }\n\n  /**\n   * Creates a function that returns the value at `path` of a given object.\n   *\n   * @static\n   * @memberOf _\n   * @since 2.4.0\n   * @category Util\n   * @param {Array|string} path The path of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   * @example\n   *\n   * var objects = [\n   *   { 'a': { 'b': 2 } },\n   *   { 'a': { 'b': 1 } }\n   * ];\n   *\n   * _.map(objects, _.property('a.b'));\n   * // => [2, 1]\n   *\n   * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n   * // => [1, 2]\n   */\n  function property(path) {\n    return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n  }\n\n  /**\n   * This method returns a new empty array.\n   *\n   * @static\n   * @memberOf _\n   * @since 4.13.0\n   * @category Util\n   * @returns {Array} Returns the new empty array.\n   * @example\n   *\n   * var arrays = _.times(2, _.stubArray);\n   *\n   * console.log(arrays);\n   * // => [[], []]\n   *\n   * console.log(arrays[0] === arrays[1]);\n   * // => false\n   */\n  function stubArray() {\n    return [];\n  }\n\n  /**\n   * This method returns `false`.\n   *\n   * @static\n   * @memberOf _\n   * @since 4.13.0\n   * @category Util\n   * @returns {boolean} Returns `false`.\n   * @example\n   *\n   * _.times(2, _.stubFalse);\n   * // => [false, false]\n   */\n  function stubFalse() {\n    return false;\n  }\n\n  /*------------------------------------------------------------------------*/\n\n  // Add methods that return wrapped values in chain sequences.\n  lodash.compact = compact;\n  lodash.iteratee = iteratee;\n  lodash.keys = keys;\n  lodash.keysIn = keysIn;\n  lodash.memoize = memoize;\n  lodash.merge = merge;\n  lodash.property = property;\n  lodash.toPlainObject = toPlainObject;\n\n  /*------------------------------------------------------------------------*/\n\n  // Add methods that return unwrapped values in chain sequences.\n  lodash.clone = clone;\n  lodash.eq = eq;\n  lodash.forEach = forEach;\n  lodash.get = get;\n  lodash.hasIn = hasIn;\n  lodash.identity = identity;\n  lodash.isArguments = isArguments;\n  lodash.isArray = isArray;\n  lodash.isArrayLike = isArrayLike;\n  lodash.isArrayLikeObject = isArrayLikeObject;\n  lodash.isBuffer = isBuffer;\n  lodash.isEmpty = isEmpty;\n  lodash.isFunction = isFunction;\n  lodash.isLength = isLength;\n  lodash.isObject = isObject;\n  lodash.isObjectLike = isObjectLike;\n  lodash.isPlainObject = isPlainObject;\n  lodash.isSymbol = isSymbol;\n  lodash.isTypedArray = isTypedArray;\n  lodash.stubArray = stubArray;\n  lodash.stubFalse = stubFalse;\n  lodash.toString = toString;\n\n  // Add aliases.\n  lodash.each = forEach;\n\n  /*------------------------------------------------------------------------*/\n\n  /**\n   * The semantic version number.\n   *\n   * @static\n   * @memberOf _\n   * @type {string}\n   */\n  lodash.VERSION = VERSION;\n\n  /*--------------------------------------------------------------------------*/\n\n  if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = lodash)._ = lodash;\n    // Export for CommonJS support.\n    freeExports._ = lodash;\n  }\n}.call(this));\n", "\nmodule.exports = rewind;\n\nfunction rewind(gj, outer) {\n    var type = gj && gj.type, i;\n\n    if (type === 'FeatureCollection') {\n        for (i = 0; i < gj.features.length; i++) rewind(gj.features[i], outer);\n\n    } else if (type === 'GeometryCollection') {\n        for (i = 0; i < gj.geometries.length; i++) rewind(gj.geometries[i], outer);\n\n    } else if (type === 'Feature') {\n        rewind(gj.geometry, outer);\n\n    } else if (type === 'Polygon') {\n        rewindRings(gj.coordinates, outer);\n\n    } else if (type === 'MultiPolygon') {\n        for (i = 0; i < gj.coordinates.length; i++) rewindRings(gj.coordinates[i], outer);\n    }\n\n    return gj;\n}\n\nfunction rewindRings(rings, outer) {\n    if (rings.length === 0) return;\n\n    rewindRing(rings[0], outer);\n    for (var i = 1; i < rings.length; i++) {\n        rewindRing(rings[i], !outer);\n    }\n}\n\nfunction rewindRing(ring, dir) {\n    var area = 0, err = 0;\n    for (var i = 0, len = ring.length, j = len - 1; i < len; j = i++) {\n        var k = (ring[i][0] - ring[j][0]) * (ring[j][1] + ring[i][1]);\n        var m = area + k;\n        err += Math.abs(area) >= Math.abs(k) ? area - m + k : k - m + area;\n        area = m;\n    }\n    if (area + err >= 0 !== !!dir) ring.reverse();\n}\n", "module.exports = require('./polygon-features.json')\n", "var _ = require(\"./lodash.custom.js\");\nvar rewind = require(\"@mapbox/geojson-rewind\");\n\n// see https://wiki.openstreetmap.org/wiki/Overpass_turbo/Polygon_Features\nvar polygonFeatures = {};\nrequire(\"osm-polygon-features\").forEach(function(tags) {\n  if (tags.polygon === \"all\")\n    polygonFeatures[tags.key] = true;\n  else {\n    var list = (tags.polygon === \"whitelist\") ? \"included_values\" : \"excluded_values\",\n        tagValuesObj = {};\n    tags.values.forEach(function(value) { tagValuesObj[value] = true; });\n    polygonFeatures[tags.key] = {};\n    polygonFeatures[tags.key][list] = tagValuesObj;\n  }\n});\n\n// default deduplication helper function\nfunction default_deduplicator(objectA, objectB) {\n  // default deduplication handler:\n  // if object versions differ, use highest available version\n  if ((objectA.version || objectB.version) &&\n      (objectA.version !== objectB.version)) {\n    return (+objectA.version || 0) > (+objectB.version || 0)\n      ? objectA\n      : objectB;\n  }\n  // otherwise: return merged obj properties\n  return _.merge(objectA, objectB);\n}\n\nvar osmtogeojson = {};\n\nosmtogeojson = function( data, options, featureCallback ) {\n\n  options = _.merge(\n    {\n      verbose: false,\n      flatProperties: true,\n      uninterestingTags: {\n        \"source\": true,\n        \"source_ref\": true,\n        \"source:ref\": true,\n        \"history\": true,\n        \"attribution\": true,\n        \"created_by\": true,\n        \"tiger:county\": true,\n        \"tiger:tlid\": true,\n        \"tiger:upload_uuid\": true\n      },\n      polygonFeatures: polygonFeatures,\n      deduplicator: default_deduplicator\n    },\n    options\n  );\n\n  var result;\n  if ( ((typeof XMLDocument !== \"undefined\") && data instanceof XMLDocument ||\n        (typeof XMLDocument === \"undefined\") && data.childNodes) )\n    result = _osmXML2geoJSON(data);\n  else\n    result = _overpassJSON2geoJSON(data);\n  return result;\n\n  function _overpassJSON2geoJSON(json) {\n    // sort elements\n    var nodes = new Array();\n    var ways  = new Array();\n    var rels  = new Array();\n    // helper functions\n    function centerGeometry(object) {\n      var pseudoNode = _.clone(object);\n      pseudoNode.lat = object.center.lat;\n      pseudoNode.lon = object.center.lon;\n      pseudoNode.__is_center_placeholder = true;\n      nodes.push(pseudoNode);\n    }\n    function boundsGeometry(object) {\n      var pseudoWay = _.clone(object);\n      pseudoWay.nodes = [];\n      function addPseudoNode(lat,lon,i) {\n        var pseudoNode = {\n          type:\"node\",\n          id:  \"_\"+pseudoWay.type+\"/\"+pseudoWay.id+\"bounds\"+i,\n          lat: lat,\n          lon: lon\n        }\n        pseudoWay.nodes.push(pseudoNode.id);\n        nodes.push(pseudoNode);\n      }\n      addPseudoNode(pseudoWay.bounds.minlat,pseudoWay.bounds.minlon,1);\n      addPseudoNode(pseudoWay.bounds.maxlat,pseudoWay.bounds.minlon,2);\n      addPseudoNode(pseudoWay.bounds.maxlat,pseudoWay.bounds.maxlon,3);\n      addPseudoNode(pseudoWay.bounds.minlat,pseudoWay.bounds.maxlon,4);\n      pseudoWay.nodes.push(pseudoWay.nodes[0]);\n      pseudoWay.__is_bounds_placeholder = true;\n      ways.push(pseudoWay);\n    }\n    function fullGeometryWay(way) {\n      function addFullGeometryNode(lat,lon,id) {\n        var geometryNode = {\n          type:\"node\",\n          id:  id,\n          lat: lat,\n          lon: lon\n        }\n        nodes.push(geometryNode);\n      }\n      if (!_.isArray(way.nodes)) {\n        way.nodes = way.geometry.map(function(nd) {\n          if (nd !== null) // have to skip ref-less nodes\n            return \"_anonymous@\"+nd.lat+\"/\"+nd.lon;\n          else\n            return \"_anonymous@unknown_location\";\n        });\n      }\n      way.geometry.forEach(function(nd, i) {\n        if (nd) {\n          addFullGeometryNode(\n            nd.lat,\n            nd.lon,\n            way.nodes[i]\n          );\n        }\n      });\n    }\n    function fullGeometryRelation(rel) {\n      function addFullGeometryNode(lat,lon,id) {\n        var geometryNode = {\n          type:\"node\",\n          id:  id,\n          lat: lat,\n          lon: lon\n        }\n        nodes.push(geometryNode);\n      }\n      function addFullGeometryWay(geometry,id) {\n        // shared multipolygon ways cannot be defined multiple times with the same id.\n        if (ways.some(function (way) { // todo: this is slow :(\n          return way.type == \"way\" && way.id == id;\n        })) return;\n        var geometryWay = {\n          type: \"way\",\n          id:   id,\n          nodes:[]\n        }\n        function addFullGeometryWayPseudoNode(lat,lon) {\n          // todo? do not save the same pseudo node multiple times\n          var geometryPseudoNode = {\n            type:\"node\",\n            id:  \"_anonymous@\"+lat+\"/\"+lon,\n            lat: lat,\n            lon: lon\n          }\n          geometryWay.nodes.push(geometryPseudoNode.id);\n          nodes.push(geometryPseudoNode);\n        }\n        geometry.forEach(function(nd) {\n          if (nd) {\n            addFullGeometryWayPseudoNode(\n              nd.lat,\n              nd.lon\n            );\n          } else {\n            geometryWay.nodes.push(undefined);\n          }\n        });\n        ways.push(geometryWay);\n      }\n      rel.members.forEach(function(member, i) {\n        if (member.type == \"node\") {\n          if (member.lat) {\n            addFullGeometryNode(\n              member.lat,\n              member.lon,\n              member.ref\n            );\n          }\n        } else if (member.type == \"way\") {\n          if (member.geometry) {\n            member.ref = \"_fullGeom\"+member.ref;\n            addFullGeometryWay(\n              member.geometry,\n              member.ref\n            );\n          }\n        }\n      });\n    }\n    // create copies of individual json objects to make sure the original data doesn't get altered\n    // todo: cloning is slow: see if this can be done differently!\n    for (var i=0;i<json.elements.length;i++) {\n      switch (json.elements[i].type) {\n      case \"node\":\n        var node = json.elements[i];\n        nodes.push(node);\n      break;\n      case \"way\":\n        var way = _.clone(json.elements[i]);\n        way.nodes = _.clone(way.nodes);\n        ways.push(way);\n        if (way.center)\n          centerGeometry(way);\n        if (way.geometry)\n          fullGeometryWay(way);\n        else if (way.bounds)\n          boundsGeometry(way);\n      break;\n      case \"relation\":\n        var rel = _.clone(json.elements[i]);\n        rel.members = _.clone(rel.members);\n        rels.push(rel);\n        var has_full_geometry = rel.members && rel.members.some(function (member) {\n          return member.type == \"node\" && member.lat ||\n                 member.type == \"way\"  && member.geometry && member.geometry.length > 0\n        });\n        if (rel.center)\n          centerGeometry(rel);\n        if (has_full_geometry)\n          fullGeometryRelation(rel);\n        else if (rel.bounds)\n          boundsGeometry(rel);\n      break;\n      default:\n      // type=area (from coord-query) is an example for this case.\n      }\n    }\n    return _convert2geoJSON(nodes,ways,rels);\n  }\n  function _osmXML2geoJSON(xml) {\n    // sort elements\n    var nodes = new Array();\n    var ways  = new Array();\n    var rels  = new Array();\n    // helper function\n    function copy_attribute( x, o, attr ) {\n      if (x.hasAttribute(attr))\n        o[attr] = x.getAttribute(attr);\n    }\n    function centerGeometry(object, centroid) {\n      var pseudoNode = _.clone(object);\n      copy_attribute(centroid, pseudoNode, 'lat');\n      copy_attribute(centroid, pseudoNode, 'lon');\n      pseudoNode.__is_center_placeholder = true;\n      nodes.push(pseudoNode);\n    }\n    function boundsGeometry(object, bounds) {\n      var pseudoWay = _.clone(object);\n      pseudoWay.nodes = [];\n      function addPseudoNode(lat,lon,i) {\n        var pseudoNode = {\n          type:\"node\",\n          id:  \"_\"+pseudoWay.type+\"/\"+pseudoWay.id+\"bounds\"+i,\n          lat: lat,\n          lon: lon\n        }\n        pseudoWay.nodes.push(pseudoNode.id);\n        nodes.push(pseudoNode);\n      }\n      addPseudoNode(bounds.getAttribute('minlat'),bounds.getAttribute('minlon'),1);\n      addPseudoNode(bounds.getAttribute('maxlat'),bounds.getAttribute('minlon'),2);\n      addPseudoNode(bounds.getAttribute('maxlat'),bounds.getAttribute('maxlon'),3);\n      addPseudoNode(bounds.getAttribute('minlat'),bounds.getAttribute('maxlon'),4);\n      pseudoWay.nodes.push(pseudoWay.nodes[0]);\n      pseudoWay.__is_bounds_placeholder = true;\n      ways.push(pseudoWay);\n    }\n    function fullGeometryWay(way, nds) {\n      function addFullGeometryNode(lat,lon,id) {\n        var geometryNode = {\n          type:\"node\",\n          id:  id,\n          lat: lat,\n          lon: lon\n        }\n        nodes.push(geometryNode);\n        return geometryNode.id;\n      }\n      if (!_.isArray(way.nodes)) {\n        way.nodes = [];\n        _.each( nds, function( nd, i ) {\n          way.nodes.push(\"_anonymous@\"+nd.getAttribute('lat')+\"/\"+nd.getAttribute('lon'));\n        });\n      }\n      _.each( nds, function( nd, i ) {\n        if (nd.getAttribute('lat')) {\n          addFullGeometryNode(\n            nd.getAttribute('lat'),\n            nd.getAttribute('lon'),\n            way.nodes[i]\n          );\n        }\n      });\n    }\n    function fullGeometryRelation(rel, members) {\n      function addFullGeometryNode(lat,lon,id) {\n        var geometryNode = {\n          type:\"node\",\n          id:  id,\n          lat: lat,\n          lon: lon\n        }\n        nodes.push(geometryNode);\n      }\n      function addFullGeometryWay(nds,id) {\n        // shared multipolygon ways cannot be defined multiple times with the same id.\n        if (ways.some(function (way) { // todo: this is slow :(\n          return way.type == \"way\" && way.id == id;\n        })) return;\n        var geometryWay = {\n          type: \"way\",\n          id:   id,\n          nodes:[]\n        }\n        function addFullGeometryWayPseudoNode(lat,lon) {\n          // todo? do not save the same pseudo node multiple times\n          var geometryPseudoNode = {\n            type:\"node\",\n            id:  \"_anonymous@\"+lat+\"/\"+lon,\n            lat: lat,\n            lon: lon\n          }\n          geometryWay.nodes.push(geometryPseudoNode.id);\n          nodes.push(geometryPseudoNode);\n        }\n        _.each(nds, function(nd) {\n          if (nd.getAttribute('lat')) {\n            addFullGeometryWayPseudoNode(\n              nd.getAttribute('lat'),\n              nd.getAttribute('lon')\n            );\n          } else {\n            geometryWay.nodes.push(undefined);\n          }\n        });\n        ways.push(geometryWay);\n      }\n      _.each( members, function( member, i ) {\n        if (rel.members[i].type == \"node\") {\n          if (member.getAttribute('lat')) {\n            addFullGeometryNode(\n              member.getAttribute('lat'),\n              member.getAttribute('lon'),\n              rel.members[i].ref\n            );\n          }\n        } else if (rel.members[i].type == \"way\") {\n          if (member.getElementsByTagName('nd').length > 0) {\n            rel.members[i].ref = \"_fullGeom\"+rel.members[i].ref;\n            addFullGeometryWay(\n              member.getElementsByTagName('nd'),\n              rel.members[i].ref\n            );\n          }\n        }\n      });\n    }\n    // nodes\n    _.each( xml.getElementsByTagName('node'), function( node, i ) {\n      var tags = {};\n      _.each( node.getElementsByTagName('tag'), function( tag ) {\n        tags[tag.getAttribute('k')] = tag.getAttribute('v');\n      });\n      var nodeObject = {\n        'type': 'node'\n      };\n      copy_attribute( node, nodeObject, 'id' );\n      copy_attribute( node, nodeObject, 'lat' );\n      copy_attribute( node, nodeObject, 'lon' );\n      copy_attribute( node, nodeObject, 'version' );\n      copy_attribute( node, nodeObject, 'timestamp' );\n      copy_attribute( node, nodeObject, 'changeset' );\n      copy_attribute( node, nodeObject, 'uid' );\n      copy_attribute( node, nodeObject, 'user' );\n      if (!_.isEmpty(tags))\n        nodeObject.tags = tags;\n      nodes.push(nodeObject);\n    });\n    // ways\n    var centroid,bounds;\n    _.each( xml.getElementsByTagName('way'), function( way, i ) {\n      var tags = {};\n      var wnodes = [];\n      _.each( way.getElementsByTagName('tag'), function( tag ) {\n        tags[tag.getAttribute('k')] = tag.getAttribute('v');\n      });\n      var has_full_geometry = false;\n      _.each( way.getElementsByTagName('nd'), function( nd, i ) {\n        var id;\n        if (id = nd.getAttribute('ref'))\n          wnodes[i] = id;\n        if (!has_full_geometry && nd.getAttribute('lat'))\n          has_full_geometry = true;\n      });\n      var wayObject = {\n        \"type\": \"way\"\n      };\n      copy_attribute( way, wayObject, 'id' );\n      copy_attribute( way, wayObject, 'version' );\n      copy_attribute( way, wayObject, 'timestamp' );\n      copy_attribute( way, wayObject, 'changeset' );\n      copy_attribute( way, wayObject, 'uid' );\n      copy_attribute( way, wayObject, 'user' );\n      if (wnodes.length > 0)\n        wayObject.nodes = wnodes;\n      if (!_.isEmpty(tags))\n        wayObject.tags = tags;\n      if (centroid = way.getElementsByTagName('center')[0])\n        centerGeometry(wayObject,centroid);\n      if (has_full_geometry)\n        fullGeometryWay(wayObject, way.getElementsByTagName('nd'));\n      else if (bounds = way.getElementsByTagName('bounds')[0])\n        boundsGeometry(wayObject,bounds);\n      ways.push(wayObject);\n    });\n    // relations\n    _.each( xml.getElementsByTagName('relation'), function( relation, i ) {\n      var tags = {};\n      var members = [];\n      _.each( relation.getElementsByTagName('tag'), function( tag ) {\n        tags[tag.getAttribute('k')] = tag.getAttribute('v');\n      });\n      var has_full_geometry = false;\n      _.each( relation.getElementsByTagName('member'), function( member, i ) {\n        members[i] = {};\n        copy_attribute( member, members[i], 'ref' );\n        copy_attribute( member, members[i], 'role' );\n        copy_attribute( member, members[i], 'type' );\n        if (!has_full_geometry &&\n             (members[i].type == 'node' && member.getAttribute('lat')) ||\n             (members[i].type == 'way'  && member.getElementsByTagName('nd').length>0) )\n          has_full_geometry = true;\n      });\n      var relObject = {\n        \"type\": \"relation\"\n      }\n      copy_attribute( relation, relObject, 'id' );\n      copy_attribute( relation, relObject, 'version' );\n      copy_attribute( relation, relObject, 'timestamp' );\n      copy_attribute( relation, relObject, 'changeset' );\n      copy_attribute( relation, relObject, 'uid' );\n      copy_attribute( relation, relObject, 'user' );\n      if (members.length > 0)\n        relObject.members = members;\n      if (!_.isEmpty(tags))\n        relObject.tags = tags;\n      if (centroid = relation.getElementsByTagName('center')[0])\n        centerGeometry(relObject,centroid);\n      if (has_full_geometry)\n        fullGeometryRelation(relObject, relation.getElementsByTagName('member'));\n      else if (bounds = relation.getElementsByTagName('bounds')[0])\n        boundsGeometry(relObject,bounds);\n      rels.push(relObject);\n    });\n    return _convert2geoJSON(nodes,ways,rels);\n  }\n  function _convert2geoJSON(nodes,ways,rels) {\n\n    // helper function that checks if there are any tags other than \"created_by\", \"source\", etc. or any tag provided in ignore_tags\n    function has_interesting_tags(t, ignore_tags) {\n      if (typeof ignore_tags !== \"object\")\n        ignore_tags={};\n      if (typeof options.uninterestingTags === \"function\")\n        return !options.uninterestingTags(t, ignore_tags);\n      for (var k in t)\n        if (!(options.uninterestingTags[k]===true) &&\n            !(ignore_tags[k]===true || ignore_tags[k]===t[k]))\n          return true;\n      return false;\n    };\n    // helper function to extract meta information\n    function build_meta_information(object) {\n      var res = {\n        \"timestamp\": object.timestamp,\n        \"version\": object.version,\n        \"changeset\": object.changeset,\n        \"user\": object.user,\n        \"uid\": object.uid\n      };\n      for (var k in res)\n        if (res[k] === undefined)\n          delete res[k];\n      return res;\n    }\n\n    // some data processing (e.g. filter nodes only used for ways)\n    var nodeids = new Object();\n    var poinids = new Object();\n    for (var i=0;i<nodes.length;i++) {\n      var node = nodes[i];\n      if (nodeids[node.id] !== undefined) {\n        // handle input data duplication\n        node = options.deduplicator(node, nodeids[node.id]);\n      }\n      nodeids[node.id] = node;\n      if (typeof node.tags != 'undefined' &&\n          has_interesting_tags(node.tags)) // this checks if the node has any tags other than \"created_by\"\n        poinids[node.id] = true;\n    }\n    // todo -> after deduplication of relations??\n    for (var i=0;i<rels.length;i++) {\n      if (_.isArray(rels[i].members)) {\n        for (var j=0;j<rels[i].members.length;j++) {\n          if (rels[i].members[j].type == \"node\")\n            poinids[rels[i].members[j].ref] = true;\n        }\n      }\n    }\n    var wayids = new Object();\n    var waynids = new Object();\n    for (var i=0;i<ways.length;i++) {\n      var way = ways[i];\n      if (wayids[way.id]) {\n        // handle input data duplication\n        way = options.deduplicator(way, wayids[way.id]);\n      }\n      wayids[way.id] = way;\n      if (_.isArray(way.nodes)) {\n        for (var j=0;j<way.nodes.length;j++) {\n          if (typeof way.nodes[j] === \"object\") continue; // ignore already replaced way node objects\n          waynids[way.nodes[j]] = true;\n          way.nodes[j] = nodeids[way.nodes[j]];\n        }\n      }\n    }\n    var pois = new Array();\n    for (var id in nodeids) {\n      var node = nodeids[id];\n      if (!waynids[id] || poinids[id])\n        pois.push(node);\n    }\n    var relids = new Array();\n    for (var i=0;i<rels.length;i++) {\n      var rel = rels[i];\n      if (relids[rel.id]) {\n        // handle input data duplication\n        rel = options.deduplicator(rel, relids[rel.id]);\n      }\n      relids[rel.id] = rel;\n    }\n    var relsmap = {node: {}, way: {}, relation: {}};\n    for (var id in relids) {\n      var rel = relids[id];\n      if (!_.isArray(rel.members)) {\n        if (options.verbose) console.warn('Relation',rel.type+'/'+rel.id,'ignored because it has no members');\n        continue; // ignore relations without members (e.g. returned by an ids_only query)\n      }\n      for (var j=0;j<rel.members.length;j++) {\n        var m_type = rel.members[j].type;\n        var m_ref = rel.members[j].ref;\n        if (typeof m_ref !== \"number\") {\n          // de-namespace full geometry content\n          m_ref = m_ref.replace(\"_fullGeom\", \"\");\n        }\n        if (!relsmap[m_type]) {\n          if (options.verbose) console.warn('Relation',rel.type+'/'+rel.id,'member',m_type+'/'+m_ref,'ignored because it has an invalid type');\n          continue;\n        }\n        if (typeof relsmap[m_type][m_ref] === \"undefined\")\n          relsmap[m_type][m_ref] = [];\n        relsmap[m_type][m_ref].push({\n          \"role\" : rel.members[j].role,\n          \"rel\" : rel.id,\n          \"reltags\" : rel.tags,\n        });\n      }\n    }\n    // construct geojson\n    var geojson;\n    var geojsonnodes = [];\n    for (i=0;i<pois.length;i++) {\n      if (typeof pois[i].lon == \"undefined\" || typeof pois[i].lat == \"undefined\") {\n        if (options.verbose) console.warn('POI',pois[i].type+'/'+pois[i].id,'ignored because it lacks coordinates');\n        continue; // lon and lat are required for showing a point\n      }\n      var feature = {\n        \"type\"       : \"Feature\",\n        \"id\"         : pois[i].type+\"/\"+pois[i].id,\n        \"properties\" : {\n          \"type\" : pois[i].type,\n          \"id\"   : pois[i].id,\n          \"tags\" : pois[i].tags || {},\n          \"relations\" : relsmap[\"node\"][pois[i].id] || [],\n          \"meta\": build_meta_information(pois[i])\n        },\n        \"geometry\"   : {\n          \"type\" : \"Point\",\n          \"coordinates\" : [+pois[i].lon, +pois[i].lat],\n        }\n      };\n      if (pois[i].__is_center_placeholder)\n        feature.properties[\"geometry\"] = \"center\";\n      if (!featureCallback)\n        geojsonnodes.push(feature);\n      else\n        featureCallback(feature);\n    }\n    var geojsonlines = [];\n    var geojsonpolygons = [];\n    // process multipolygons\n    for (var i=0;i<rels.length;i++) {\n      // todo: refactor such that this loops over relids instead of rels?\n      if (relids[rels[i].id] !== rels[i]) {\n        // skip relation because it's a deduplication artifact\n        continue;\n      }\n      if ((typeof rels[i].tags != \"undefined\") &&\n          (rels[i].tags[\"type\"] == \"route\" || rels[i].tags[\"type\"] == \"waterway\")) {\n        if (!_.isArray(rels[i].members)) {\n          if (options.verbose) console.warn('Route',rels[i].type+'/'+rels[i].id,'ignored because it has no members');\n          continue; // ignore relations without members (e.g. returned by an ids_only query)\n        }\n        rels[i].members.forEach(function(m) {\n          if (wayids[m.ref] && !has_interesting_tags(wayids[m.ref].tags))\n              wayids[m.ref].is_skippablerelationmember = true;\n        });\n        feature = construct_multilinestring(rels[i]);\n        if (feature === false) {\n          if (options.verbose) console.warn('Route relation',rels[i].type+'/'+rels[i].id,'ignored because it has invalid geometry');\n          continue; // abort if feature could not be constructed\n        }\n        if (!featureCallback)\n          geojsonpolygons.push(feature);\n        else\n          featureCallback(rewind(feature));\n\n        function construct_multilinestring(rel) {\n          var is_tainted = false;\n          // prepare route members\n          var members;\n          members = rel.members.filter(function(m) {return m.type === \"way\";});\n          members = members.map(function(m) {\n            var way = wayids[m.ref];\n            if (way === undefined || way.nodes === undefined) { // check for missing ways\n              if (options.verbose) console.warn('Route '+rel.type+'/'+rel.id, 'tainted by a missing or incomplete  way', m.type+'/'+m.ref);\n              is_tainted = true;\n              return;\n            }\n            return { // TODO: this is slow! :(\n              id: m.ref,\n              role: m.role,\n              way: way,\n              nodes: way.nodes.filter(function(n) {\n                if (n !== undefined)\n                  return true;\n                is_tainted = true;\n                if (options.verbose) console.warn('Route', rel.type+'/'+rel.id,  'tainted by a way', m.type+'/'+m.ref, 'with a missing node');\n                return false;\n              })\n            };\n          });\n          members = _.compact(members);\n          // construct connected linestrings\n          var linestrings;\n          linestrings = join(members);\n\n          // sanitize mp-coordinates (remove empty clusters or rings, {lat,lon,...} to [lon,lat]\n          var coords = [];\n          coords = _.compact(linestrings.map(function(linestring) {\n            return _.compact(linestring.map(function(node) {\n              return [+node.lon,+node.lat];\n            }));\n          }));\n\n          if (coords.length == 0) {\n            if (options.verbose) console.warn('Route', rel.type+'/'+rel.id, 'contains no coordinates');\n            return false; // ignore routes without coordinates\n          }\n\n          // mp parsed, now construct the geoJSON\n          var feature = {\n            \"type\"       : \"Feature\",\n            \"id\"         : rel.type+\"/\"+rel.id,\n            \"properties\" : {\n              \"type\" : rel.type,\n              \"id\"   : rel.id,\n              \"tags\" : rel.tags || {},\n              \"relations\" :  relsmap[rel.type][rel.id] || [],\n              \"meta\": build_meta_information(rel)\n            },\n            \"geometry\"   : {\n              \"type\" : coords.length === 1 ? \"LineString\" : \"MultiLineString\",\n              \"coordinates\" : coords.length === 1 ? coords[0] : coords,\n            }\n          }\n          if (is_tainted) {\n            if (options.verbose) console.warn('Route', rel.type+'/'+rel.id, 'is tainted');\n            feature.properties[\"tainted\"] = true;\n          }\n          return feature;\n        }\n      } // end construct multilinestring for route relations\n      if ((typeof rels[i].tags != \"undefined\") &&\n          (rels[i].tags[\"type\"] == \"multipolygon\" || rels[i].tags[\"type\"] == \"boundary\")) {\n        if (!_.isArray(rels[i].members)) {\n          if (options.verbose) console.warn('Multipolygon',rels[i].type+'/'+rels[i].id,'ignored because it has no members');\n          continue; // ignore relations without members (e.g. returned by an ids_only query)\n        }\n        var outer_count = 0;\n        for (var j=0;j<rels[i].members.length;j++)\n          if (rels[i].members[j].role == \"outer\")\n            outer_count++;\n          else if (options.verbose && rels[i].members[j].role != \"inner\")\n            console.warn('Multipolygon',rels[i].type+'/'+rels[i].id,'member',rels[i].members[j].type+'/'+rels[i].members[j].ref,'ignored because it has an invalid role: \"' + rels[i].members[j].role + '\"');\n        rels[i].members.forEach(function(m) {\n          if (wayids[m.ref]) {\n            // this even works in the following corner case:\n            // a multipolygon amenity=xxx with outer line tagged amenity=yyy\n            // see https://github.com/tyrasd/osmtogeojson/issues/7\n            if (m.role===\"outer\" && !has_interesting_tags(wayids[m.ref].tags,rels[i].tags))\n              wayids[m.ref].is_skippablerelationmember = true;\n            if (m.role===\"inner\" && !has_interesting_tags(wayids[m.ref].tags))\n              wayids[m.ref].is_skippablerelationmember = true;\n          }\n        });\n        if (outer_count == 0) {\n          if (options.verbose) console.warn('Multipolygon relation',rels[i].type+'/'+rels[i].id,'ignored because it has no outer ways');\n          continue; // ignore multipolygons without outer ways\n        }\n        var simple_mp = false;\n        if (outer_count == 1 && !has_interesting_tags(rels[i].tags, {\"type\":true}))\n          simple_mp = true;\n        var feature = null;\n        if (!simple_mp) {\n          feature = construct_multipolygon(rels[i], rels[i]);\n        } else {\n          // simple multipolygon\n          var outer_way = rels[i].members.filter(function(m) {return m.role === \"outer\";})[0];\n          outer_way = wayids[outer_way.ref];\n          if (outer_way === undefined) {\n            if (options.verbose) console.warn('Multipolygon relation',rels[i].type+'/'+rels[i].id,'ignored because outer way', outer_way.type+'/'+outer_way.ref,'is missing');\n            continue; // abort if outer way object is not present\n          }\n          outer_way.is_skippablerelationmember = true;\n          feature = construct_multipolygon(outer_way, rels[i]);\n        }\n        if (feature === false) {\n          if (options.verbose) console.warn('Multipolygon relation',rels[i].type+'/'+rels[i].id,'ignored because it has invalid geometry');\n          continue; // abort if feature could not be constructed\n        }\n        if (!featureCallback)\n          geojsonpolygons.push(feature);\n        else\n          featureCallback(rewind(feature));\n\n        function construct_multipolygon(tag_object, rel) {\n          var is_tainted = false;\n          var mp_geometry = simple_mp ? 'way' : 'relation',\n              mp_id = typeof tag_object.id === \"number\" ? tag_object.id : +(tag_object.id.replace(\"_fullGeom\", \"\"));\n          // prepare mp members\n          var members;\n          members = rel.members.filter(function(m) {return m.type === \"way\";});\n          members = members.map(function(m) {\n            var way = wayids[m.ref];\n            if (way === undefined || way.nodes === undefined) { // check for missing ways\n              if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id, 'tainted by a missing or incomplete way', m.type+'/'+m.ref);\n              is_tainted = true;\n              return;\n            }\n            return { // TODO: this is slow! :(\n              id: m.ref,\n              role: m.role || \"outer\",\n              way: way,\n              nodes: way.nodes.filter(function(n) {\n                if (n !== undefined)\n                  return true;\n                is_tainted = true;\n                if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id,  'tainted by a way', m.type+'/'+m.ref, 'with a missing node');\n                return false;\n              })\n            };\n          });\n          members = _.compact(members);\n          // construct outer and inner rings\n          var outers, inners;\n          outers = join(members.filter(function(m) {return m.role===\"outer\";}));\n          inners = join(members.filter(function(m) {return m.role===\"inner\";}));\n          // sort rings\n          var mp;\n          function findOuter(inner) {\n            var polygonIntersectsPolygon = function(outer, inner) {\n              for (var i=0; i<inner.length; i++)\n                if (pointInPolygon(inner[i], outer))\n                  return true;\n              return false;\n            }\n            var mapCoordinates = function(from) {\n              return from.map(function(n) {\n                return [+n.lat,+n.lon];\n              });\n            }\n            // stolen from iD/geo.js,\n            // based on https://github.com/substack/point-in-polygon,\n            // ray-casting algorithm based on http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html\n            var pointInPolygon = function(point, polygon) {\n              var x = point[0], y = point[1], inside = false;\n              for (var i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {\n                var xi = polygon[i][0], yi = polygon[i][1];\n                var xj = polygon[j][0], yj = polygon[j][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            // stolen from iD/relation.js\n            var o, outer;\n            // todo: all this coordinate mapping makes this unneccesarily slow.\n            // see the \"todo: this is slow! :(\" above.\n            inner = mapCoordinates(inner);\n            /*for (o = 0; o < outers.length; o++) {\n              outer = mapCoordinates(outers[o]);\n              if (polygonContainsPolygon(outer, inner))\n                return o;\n            }*/\n            for (o = 0; o < outers.length; o++) {\n              outer = mapCoordinates(outers[o]);\n              if (polygonIntersectsPolygon(outer, inner))\n                return o;\n            }\n          }\n          mp = outers.map(function(o) {return [o];});\n          for (var j=0; j<inners.length; j++) {\n            var o = findOuter(inners[j]);\n            if (o !== undefined)\n              mp[o].push(inners[j]);\n            else\n              if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id, 'contains an inner ring with no containing outer');\n              // so, no outer ring for this inner ring is found.\n              // We're going to ignore holes in empty space.\n              ;\n          }\n          // sanitize mp-coordinates (remove empty clusters or rings, {lat,lon,...} to [lon,lat]\n          var mp_coords = [];\n          mp_coords = _.compact(mp.map(function(cluster) {\n            var cl = _.compact(cluster.map(function(ring) {\n              if (ring.length < 4) { // todo: is this correct: ring.length < 4 ?\n                if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id, 'contains a ring with less than four nodes');\n                return;\n              }\n              return _.compact(ring.map(function(node) {\n                return [+node.lon,+node.lat];\n              }));\n            }));\n            if (cl.length == 0) {\n              if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id, 'contains an empty ring cluster');\n              return;\n            }\n            return cl;\n          }));\n\n          if (mp_coords.length == 0) {\n            if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id, 'contains no coordinates');\n            return false; // ignore multipolygons without coordinates\n          }\n          var mp_type = \"MultiPolygon\";\n          if (mp_coords.length === 1) {\n            mp_type = \"Polygon\";\n            mp_coords = mp_coords[0];\n          }\n          // mp parsed, now construct the geoJSON\n          var feature = {\n            \"type\"       : \"Feature\",\n            \"id\"         : tag_object.type+\"/\"+mp_id,\n            \"properties\" : {\n              \"type\" : tag_object.type,\n              \"id\"   : mp_id,\n              \"tags\" : tag_object.tags || {},\n              \"relations\" :  relsmap[tag_object.type][tag_object.id] || [],\n              \"meta\": build_meta_information(tag_object)\n            },\n            \"geometry\"   : {\n              \"type\" : mp_type,\n              \"coordinates\" : mp_coords,\n            }\n          }\n          if (is_tainted) {\n            if (options.verbose) console.warn('Multipolygon', mp_geometry+'/'+mp_id, 'is tainted');\n            feature.properties[\"tainted\"] = true;\n          }\n          return feature;\n        }\n      }\n    }\n    // process lines and polygons\n    for (var i=0;i<ways.length;i++) {\n      // todo: refactor such that this loops over wayids instead of ways?\n      if (wayids[ways[i].id] !== ways[i]) {\n        // skip way because it's a deduplication artifact\n        continue;\n      }\n      if (!_.isArray(ways[i].nodes)) {\n        if (options.verbose) console.warn('Way',ways[i].type+'/'+ways[i].id,'ignored because it has no nodes');\n        continue; // ignore ways without nodes (e.g. returned by an ids_only query)\n      }\n      if (ways[i].is_skippablerelationmember)\n        continue; // ignore ways which are already rendered as (part of) a multipolygon\n      if (typeof ways[i].id !== \"number\") {\n        // remove full geometry namespace for output\n        ways[i].id = +ways[i].id.replace(\"_fullGeom\", \"\");\n      }\n      ways[i].tainted = false;\n      ways[i].hidden = false;\n      var coords = new Array();\n      for (j=0;j<ways[i].nodes.length;j++) {\n        if (typeof ways[i].nodes[j] == \"object\")\n          coords.push([+ways[i].nodes[j].lon, +ways[i].nodes[j].lat]);\n        else {\n          if (options.verbose) console.warn('Way',ways[i].type+'/'+ways[i].id,'is tainted by an invalid node');\n          ways[i].tainted = true;\n        }\n      }\n      if (coords.length <= 1) { // invalid way geometry\n        if (options.verbose) console.warn('Way',ways[i].type+'/'+ways[i].id,'ignored because it contains too few nodes');\n        continue;\n      }\n      var way_type = \"LineString\"; // default\n      if (typeof ways[i].nodes[0] != \"undefined\" && typeof ways[i].nodes[ways[i].nodes.length-1] != \"undefined\" && // way has its start/end nodes loaded\n        ways[i].nodes[0].id === ways[i].nodes[ways[i].nodes.length-1].id && // ... and forms a closed ring\n        (\n          typeof ways[i].tags != \"undefined\" && // ... and has tags\n          _isPolygonFeature(ways[i].tags) // ... and tags say it is a polygon\n          || // or is a placeholder for a bounds geometry\n          ways[i].__is_bounds_placeholder\n        )\n      ) {\n        way_type = \"Polygon\";\n        coords = [coords];\n      }\n      var feature = {\n        \"type\"       : \"Feature\",\n        \"id\"         : ways[i].type+\"/\"+ways[i].id,\n        \"properties\" : {\n          \"type\" : ways[i].type,\n          \"id\"   : ways[i].id,\n          \"tags\" : ways[i].tags || {},\n          \"relations\" : relsmap[\"way\"][ways[i].id] || [],\n          \"meta\": build_meta_information(ways[i])\n        },\n        \"geometry\"   : {\n          \"type\" : way_type,\n          \"coordinates\" : coords,\n        }\n      }\n      if (ways[i].tainted) {\n        if (options.verbose) console.warn('Way',ways[i].type+'/'+ways[i].id,'is tainted');\n        feature.properties[\"tainted\"] = true;\n      }\n      if (ways[i].__is_bounds_placeholder)\n        feature.properties[\"geometry\"] = \"bounds\";\n      if (!featureCallback) {\n        if (way_type == \"LineString\")\n          geojsonlines.push(feature);\n        else\n          geojsonpolygons.push(feature);\n      } else {\n        featureCallback(rewind(feature));\n      }\n    }\n\n    if (featureCallback)\n      return true;\n\n    geojson = {\n      \"type\": \"FeatureCollection\",\n      \"features\": []\n    };\n    geojson.features = geojson.features.concat(geojsonpolygons);\n    geojson.features = geojson.features.concat(geojsonlines);\n    geojson.features = geojson.features.concat(geojsonnodes);\n    // optionally, flatten properties\n    if (options.flatProperties) {\n      geojson.features.forEach(function(f) {\n        f.properties = _.merge(\n          f.properties.meta,\n          f.properties.tags,\n          {id: f.properties.type+\"/\"+f.properties.id}\n        );\n      });\n    }\n    // fix polygon winding\n    geojson = rewind(geojson);\n    return geojson;\n  }\n  function _isPolygonFeature( tags ) {\n    var polygonFeatures = options.polygonFeatures;\n    if (typeof polygonFeatures === \"function\")\n      return polygonFeatures(tags);\n    // explicitely tagged non-areas\n    if ( tags['area'] === 'no' )\n      return false;\n    // assuming that a typical OSM way has in average less tags than\n    // the polygonFeatures list, this way around should be faster\n    for ( var key in tags ) {\n      var val = tags[key];\n      var pfk = polygonFeatures[key];\n      // continue with next if tag is unknown or not \"categorizing\"\n      if ( typeof pfk === 'undefined' )\n        continue;\n      // continue with next if tag is explicitely un-set (\"building=no\")\n      if ( val === 'no' )\n        continue;\n      // check polygon features for: general acceptance, included or excluded values\n      if ( pfk === true )\n        return true;\n      if ( pfk.included_values && pfk.included_values[val] === true )\n        return true;\n      if ( pfk.excluded_values && pfk.excluded_values[val] !== true )\n        return true;\n    }\n    // if no tags matched, this ain't no area.\n    return false;\n  }\n};\n\n// helper that joins adjacent osm ways into linestrings or linear rings\nfunction join(ways) {\n  var _first = function(arr) {return arr[0]};\n  var _last  = function(arr) {return arr[arr.length-1]};\n  var _fitTogether = function(n1, n2) {\n    return n1 !== undefined && n2 !== undefined && n1.id === n2.id;\n  }\n  // stolen from iD/relation.js\n  var joined = [], current, first, last, i, how, what;\n  while (ways.length) {\n    current = ways.pop().nodes.slice();\n    joined.push(current);\n    while (ways.length && !_fitTogether(_first(current), _last(current))) {\n      first = _first(current);\n      last  = _last(current);\n      for (i = 0; i < ways.length; i++) {\n        what = ways[i].nodes;\n        if (_fitTogether(last, _first(what))) {\n          how  = current.push;\n          what = what.slice(1);\n          break;\n        } else if (_fitTogether(last, _last(what))) {\n          how  = current.push;\n          what = what.slice(0, -1).reverse();\n          break;\n        } else if (_fitTogether(first, _last(what))) {\n          how  = current.unshift;\n          what = what.slice(0, -1);\n          break;\n        } else if (_fitTogether(first, _first(what))) {\n          how  = current.unshift;\n          what = what.slice(1).reverse();\n          break;\n        } else {\n          what = how = null;\n        }\n      }\n      if (!what)\n        break; // Invalid geometry (dangling way, unclosed ring)\n      ways.splice(i, 1);\n      how.apply(current, what);\n    }\n  }\n  return joined;\n}\n\n// for backwards compatibility\nosmtogeojson.toGeojson = osmtogeojson;\n\nmodule.exports = osmtogeojson;\n", "import osmtogeojson from \"osmtogeojson\";\nimport * as turf from \"./turf\";\n\nself.onmessage = async (event) => {\n  const it = handleMessage(event)[Symbol.asyncIterator]();\n  try {\n    while (true) {\n      const { done, value } = await it.next();\n      if (done) {\n        self.postMessage({ type: \"success\", value });\n        break;\n      } else {\n        self.postMessage({ type: \"progress\", value });\n      }\n    }\n  } catch (value) {\n    console.error(value);\n    self.postMessage({ type: \"failure\", value });\n  }\n};\n\nasync function* handleMessage({ data }) {\n  const { txt } = data;\n\n  const req = await fetch(`https://overpass-api.de/api/interpreter`, {\n    method: \"POST\",\n    body: new URLSearchParams({\n      data: txt,\n    }),\n  });\n\n  yield \"Reading response\u2026\";\n\n  const osm_data = await req.json();\n\n  yield `Received ${JSON.stringify(osm_data).length} bytes`;\n  yield \"Converting to GeoJSON\u2026\";\n  const geojson = osmtogeojson(osm_data);\n\n  yield \"Finding centroids\u2026\";\n  const centroids = replaceGeometryWithPoints(geojson);\n\n  const bbox = turf.bbox(geojson);\n\n  return { geojson, centroids, bbox };\n}\n\nconst replaceGeometryWithPoints = (geojson) => {\n  return turf.featureCollection(\n    turf.featureReduce(\n      geojson,\n      (previousValue, currentFeature) => {\n        const { id, properties } = currentFeature;\n        const { geometry } = turf.pointOnFeature(currentFeature);\n        const feature = turf.feature(geometry, properties, { id });\n        previousValue.push(feature);\n        return previousValue;\n      },\n      []\n    )\n  );\n};\n", "/**\n * @module helpers\n */\n/**\n * Earth Radius used with the Harvesine formula and approximates using a spherical (non-ellipsoid) Earth.\n *\n * @memberof helpers\n * @type {number}\n */\nexport var earthRadius = 6371008.8;\n/**\n * Unit of measurement factors using a spherical (non-ellipsoid) earth radius.\n *\n * @memberof helpers\n * @type {Object}\n */\nexport var factors = {\n    centimeters: earthRadius * 100,\n    centimetres: earthRadius * 100,\n    degrees: earthRadius / 111325,\n    feet: earthRadius * 3.28084,\n    inches: earthRadius * 39.37,\n    kilometers: earthRadius / 1000,\n    kilometres: earthRadius / 1000,\n    meters: earthRadius,\n    metres: earthRadius,\n    miles: earthRadius / 1609.344,\n    millimeters: earthRadius * 1000,\n    millimetres: earthRadius * 1000,\n    nauticalmiles: earthRadius / 1852,\n    radians: 1,\n    yards: earthRadius * 1.0936,\n};\n/**\n * Units of measurement factors based on 1 meter.\n *\n * @memberof helpers\n * @type {Object}\n */\nexport var unitsFactors = {\n    centimeters: 100,\n    centimetres: 100,\n    degrees: 1 / 111325,\n    feet: 3.28084,\n    inches: 39.37,\n    kilometers: 1 / 1000,\n    kilometres: 1 / 1000,\n    meters: 1,\n    metres: 1,\n    miles: 1 / 1609.344,\n    millimeters: 1000,\n    millimetres: 1000,\n    nauticalmiles: 1 / 1852,\n    radians: 1 / earthRadius,\n    yards: 1.0936133,\n};\n/**\n * Area of measurement factors based on 1 square meter.\n *\n * @memberof helpers\n * @type {Object}\n */\nexport var areaFactors = {\n    acres: 0.000247105,\n    centimeters: 10000,\n    centimetres: 10000,\n    feet: 10.763910417,\n    hectares: 0.0001,\n    inches: 1550.003100006,\n    kilometers: 0.000001,\n    kilometres: 0.000001,\n    meters: 1,\n    metres: 1,\n    miles: 3.86e-7,\n    millimeters: 1000000,\n    millimetres: 1000000,\n    yards: 1.195990046,\n};\n/**\n * Wraps a GeoJSON {@link Geometry} in a GeoJSON {@link Feature}.\n *\n * @name feature\n * @param {Geometry} geometry input geometry\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature} a GeoJSON Feature\n * @example\n * var geometry = {\n *   \"type\": \"Point\",\n *   \"coordinates\": [110, 50]\n * };\n *\n * var feature = turf.feature(geometry);\n *\n * //=feature\n */\nexport function feature(geom, properties, options) {\n    if (options === void 0) { options = {}; }\n    var 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}\n/**\n * Creates a GeoJSON {@link Geometry} from a Geometry string type & coordinates.\n * For GeometryCollection type use `helpers.geometryCollection`\n *\n * @name geometry\n * @param {string} type Geometry Type\n * @param {Array<any>} coordinates Coordinates\n * @param {Object} [options={}] Optional Parameters\n * @returns {Geometry} a GeoJSON Geometry\n * @example\n * var type = \"Point\";\n * var coordinates = [110, 50];\n * var geometry = turf.geometry(type, coordinates);\n * // => geometry\n */\nexport function geometry(type, coordinates, _options) {\n    if (_options === void 0) { _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}\n/**\n * Creates a {@link Point} {@link Feature} from a Position.\n *\n * @name point\n * @param {Array<number>} coordinates longitude, latitude position (each in decimal degrees)\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<Point>} a Point feature\n * @example\n * var point = turf.point([-75.343, 39.984]);\n *\n * //=point\n */\nexport function point(coordinates, properties, options) {\n    if (options === void 0) { 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    var geom = {\n        type: \"Point\",\n        coordinates: coordinates,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Creates a {@link Point} {@link FeatureCollection} from an Array of Point coordinates.\n *\n * @name points\n * @param {Array<Array<number>>} coordinates an array of Points\n * @param {Object} [properties={}] Translate these properties to each Feature\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north]\n * associated with the FeatureCollection\n * @param {string|number} [options.id] Identifier associated with the FeatureCollection\n * @returns {FeatureCollection<Point>} Point Feature\n * @example\n * var points = turf.points([\n *   [-75, 39],\n *   [-80, 45],\n *   [-78, 50]\n * ]);\n *\n * //=points\n */\nexport function points(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    return featureCollection(coordinates.map(function (coords) {\n        return point(coords, properties);\n    }), options);\n}\n/**\n * Creates a {@link Polygon} {@link Feature} from an Array of LinearRings.\n *\n * @name polygon\n * @param {Array<Array<Array<number>>>} coordinates an array of LinearRings\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<Polygon>} Polygon Feature\n * @example\n * var polygon = turf.polygon([[[-5, 52], [-4, 56], [-2, 51], [-7, 54], [-5, 52]]], { name: 'poly1' });\n *\n * //=polygon\n */\nexport function polygon(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    for (var _i = 0, coordinates_1 = coordinates; _i < coordinates_1.length; _i++) {\n        var ring = coordinates_1[_i];\n        if (ring.length < 4) {\n            throw new Error(\"Each LinearRing of a Polygon must have 4 or more Positions.\");\n        }\n        for (var j = 0; j < ring[ring.length - 1].length; j++) {\n            // Check if first point of Polygon contains two numbers\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    var geom = {\n        type: \"Polygon\",\n        coordinates: coordinates,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Creates a {@link Polygon} {@link FeatureCollection} from an Array of Polygon coordinates.\n *\n * @name polygons\n * @param {Array<Array<Array<Array<number>>>>} coordinates an array of Polygon coordinates\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the FeatureCollection\n * @returns {FeatureCollection<Polygon>} Polygon FeatureCollection\n * @example\n * var polygons = turf.polygons([\n *   [[[-5, 52], [-4, 56], [-2, 51], [-7, 54], [-5, 52]]],\n *   [[[-15, 42], [-14, 46], [-12, 41], [-17, 44], [-15, 42]]],\n * ]);\n *\n * //=polygons\n */\nexport function polygons(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    return featureCollection(coordinates.map(function (coords) {\n        return polygon(coords, properties);\n    }), options);\n}\n/**\n * Creates a {@link LineString} {@link Feature} from an Array of Positions.\n *\n * @name lineString\n * @param {Array<Array<number>>} coordinates an array of Positions\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<LineString>} LineString Feature\n * @example\n * var linestring1 = turf.lineString([[-24, 63], [-23, 60], [-25, 65], [-20, 69]], {name: 'line 1'});\n * var linestring2 = turf.lineString([[-14, 43], [-13, 40], [-15, 45], [-10, 49]], {name: 'line 2'});\n *\n * //=linestring1\n * //=linestring2\n */\nexport function lineString(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    if (coordinates.length < 2) {\n        throw new Error(\"coordinates must be an array of two or more positions\");\n    }\n    var geom = {\n        type: \"LineString\",\n        coordinates: coordinates,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Creates a {@link LineString} {@link FeatureCollection} from an Array of LineString coordinates.\n *\n * @name lineStrings\n * @param {Array<Array<Array<number>>>} coordinates an array of LinearRings\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north]\n * associated with the FeatureCollection\n * @param {string|number} [options.id] Identifier associated with the FeatureCollection\n * @returns {FeatureCollection<LineString>} LineString FeatureCollection\n * @example\n * var linestrings = turf.lineStrings([\n *   [[-24, 63], [-23, 60], [-25, 65], [-20, 69]],\n *   [[-14, 43], [-13, 40], [-15, 45], [-10, 49]]\n * ]);\n *\n * //=linestrings\n */\nexport function lineStrings(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    return featureCollection(coordinates.map(function (coords) {\n        return lineString(coords, properties);\n    }), options);\n}\n/**\n * Takes one or more {@link Feature|Features} and creates a {@link FeatureCollection}.\n *\n * @name featureCollection\n * @param {Feature[]} features input features\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {FeatureCollection} FeatureCollection of Features\n * @example\n * var locationA = turf.point([-75.343, 39.984], {name: 'Location A'});\n * var locationB = turf.point([-75.833, 39.284], {name: 'Location B'});\n * var locationC = turf.point([-75.534, 39.123], {name: 'Location C'});\n *\n * var collection = turf.featureCollection([\n *   locationA,\n *   locationB,\n *   locationC\n * ]);\n *\n * //=collection\n */\nexport function featureCollection(features, options) {\n    if (options === void 0) { options = {}; }\n    var 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}\n/**\n * Creates a {@link Feature<MultiLineString>} based on a\n * coordinate array. Properties can be added optionally.\n *\n * @name multiLineString\n * @param {Array<Array<Array<number>>>} coordinates an array of LineStrings\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<MultiLineString>} a MultiLineString feature\n * @throws {Error} if no coordinates are passed\n * @example\n * var multiLine = turf.multiLineString([[[0,0],[10,10]]]);\n *\n * //=multiLine\n */\nexport function multiLineString(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    var geom = {\n        type: \"MultiLineString\",\n        coordinates: coordinates,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Creates a {@link Feature<MultiPoint>} based on a\n * coordinate array. Properties can be added optionally.\n *\n * @name multiPoint\n * @param {Array<Array<number>>} coordinates an array of Positions\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<MultiPoint>} a MultiPoint feature\n * @throws {Error} if no coordinates are passed\n * @example\n * var multiPt = turf.multiPoint([[0,0],[10,10]]);\n *\n * //=multiPt\n */\nexport function multiPoint(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    var geom = {\n        type: \"MultiPoint\",\n        coordinates: coordinates,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Creates a {@link Feature<MultiPolygon>} based on a\n * coordinate array. Properties can be added optionally.\n *\n * @name multiPolygon\n * @param {Array<Array<Array<Array<number>>>>} coordinates an array of Polygons\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<MultiPolygon>} a multipolygon feature\n * @throws {Error} if no coordinates are passed\n * @example\n * var multiPoly = turf.multiPolygon([[[[0,0],[0,10],[10,10],[10,0],[0,0]]]]);\n *\n * //=multiPoly\n *\n */\nexport function multiPolygon(coordinates, properties, options) {\n    if (options === void 0) { options = {}; }\n    var geom = {\n        type: \"MultiPolygon\",\n        coordinates: coordinates,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Creates a {@link Feature<GeometryCollection>} based on a\n * coordinate array. Properties can be added optionally.\n *\n * @name geometryCollection\n * @param {Array<Geometry>} geometries an array of GeoJSON Geometries\n * @param {Object} [properties={}] an Object of key-value pairs to add as properties\n * @param {Object} [options={}] Optional Parameters\n * @param {Array<number>} [options.bbox] Bounding Box Array [west, south, east, north] associated with the Feature\n * @param {string|number} [options.id] Identifier associated with the Feature\n * @returns {Feature<GeometryCollection>} a GeoJSON GeometryCollection Feature\n * @example\n * var pt = turf.geometry(\"Point\", [100, 0]);\n * var line = turf.geometry(\"LineString\", [[101, 0], [102, 1]]);\n * var collection = turf.geometryCollection([pt, line]);\n *\n * // => collection\n */\nexport function geometryCollection(geometries, properties, options) {\n    if (options === void 0) { options = {}; }\n    var geom = {\n        type: \"GeometryCollection\",\n        geometries: geometries,\n    };\n    return feature(geom, properties, options);\n}\n/**\n * Round number to precision\n *\n * @param {number} num Number\n * @param {number} [precision=0] Precision\n * @returns {number} rounded number\n * @example\n * turf.round(120.4321)\n * //=120\n *\n * turf.round(120.4321, 2)\n * //=120.43\n */\nexport function round(num, precision) {\n    if (precision === void 0) { precision = 0; }\n    if (precision && !(precision >= 0)) {\n        throw new Error(\"precision must be a positive number\");\n    }\n    var multiplier = Math.pow(10, precision || 0);\n    return Math.round(num * multiplier) / multiplier;\n}\n/**\n * Convert a distance measurement (assuming a spherical Earth) from radians to a more friendly unit.\n * Valid units: miles, nauticalmiles, inches, yards, meters, metres, kilometers, centimeters, feet\n *\n * @name radiansToLength\n * @param {number} radians in radians across the sphere\n * @param {string} [units=\"kilometers\"] can be degrees, radians, miles, inches, yards, metres,\n * meters, kilometres, kilometers.\n * @returns {number} distance\n */\nexport function radiansToLength(radians, units) {\n    if (units === void 0) { units = \"kilometers\"; }\n    var factor = factors[units];\n    if (!factor) {\n        throw new Error(units + \" units is invalid\");\n    }\n    return radians * factor;\n}\n/**\n * Convert a distance measurement (assuming a spherical Earth) from a real-world unit into radians\n * Valid units: miles, nauticalmiles, inches, yards, meters, metres, kilometers, centimeters, feet\n *\n * @name lengthToRadians\n * @param {number} distance in real units\n * @param {string} [units=\"kilometers\"] can be degrees, radians, miles, inches, yards, metres,\n * meters, kilometres, kilometers.\n * @returns {number} radians\n */\nexport function lengthToRadians(distance, units) {\n    if (units === void 0) { units = \"kilometers\"; }\n    var factor = factors[units];\n    if (!factor) {\n        throw new Error(units + \" units is invalid\");\n    }\n    return distance / factor;\n}\n/**\n * Convert a distance measurement (assuming a spherical Earth) from a real-world unit into degrees\n * Valid units: miles, nauticalmiles, inches, yards, meters, metres, centimeters, kilometres, feet\n *\n * @name lengthToDegrees\n * @param {number} distance in real units\n * @param {string} [units=\"kilometers\"] can be degrees, radians, miles, inches, yards, metres,\n * meters, kilometres, kilometers.\n * @returns {number} degrees\n */\nexport function lengthToDegrees(distance, units) {\n    return radiansToDegrees(lengthToRadians(distance, units));\n}\n/**\n * Converts any bearing angle from the north line direction (positive clockwise)\n * and returns an angle between 0-360 degrees (positive clockwise), 0 being the north line\n *\n * @name bearingToAzimuth\n * @param {number} bearing angle, between -180 and +180 degrees\n * @returns {number} angle between 0 and 360 degrees\n */\nexport function bearingToAzimuth(bearing) {\n    var angle = bearing % 360;\n    if (angle < 0) {\n        angle += 360;\n    }\n    return angle;\n}\n/**\n * Converts an angle in radians to degrees\n *\n * @name radiansToDegrees\n * @param {number} radians angle in radians\n * @returns {number} degrees between 0 and 360 degrees\n */\nexport function radiansToDegrees(radians) {\n    var degrees = radians % (2 * Math.PI);\n    return (degrees * 180) / Math.PI;\n}\n/**\n * Converts an angle in degrees to radians\n *\n * @name degreesToRadians\n * @param {number} degrees angle between 0 and 360 degrees\n * @returns {number} angle in radians\n */\nexport function degreesToRadians(degrees) {\n    var radians = degrees % 360;\n    return (radians * Math.PI) / 180;\n}\n/**\n * Converts a length to the requested unit.\n * Valid units: miles, nauticalmiles, inches, yards, meters, metres, kilometers, centimeters, feet\n *\n * @param {number} length to be converted\n * @param {Units} [originalUnit=\"kilometers\"] of the length\n * @param {Units} [finalUnit=\"kilometers\"] returned unit\n * @returns {number} the converted length\n */\nexport function convertLength(length, originalUnit, finalUnit) {\n    if (originalUnit === void 0) { originalUnit = \"kilometers\"; }\n    if (finalUnit === void 0) { 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}\n/**\n * Converts a area to the requested unit.\n * Valid units: kilometers, kilometres, meters, metres, centimetres, millimeters, acres, miles, yards, feet, inches, hectares\n * @param {number} area to be converted\n * @param {Units} [originalUnit=\"meters\"] of the distance\n * @param {Units} [finalUnit=\"kilometers\"] returned unit\n * @returns {number} the converted area\n */\nexport function convertArea(area, originalUnit, finalUnit) {\n    if (originalUnit === void 0) { originalUnit = \"meters\"; }\n    if (finalUnit === void 0) { finalUnit = \"kilometers\"; }\n    if (!(area >= 0)) {\n        throw new Error(\"area must be a positive number\");\n    }\n    var startFactor = areaFactors[originalUnit];\n    if (!startFactor) {\n        throw new Error(\"invalid original units\");\n    }\n    var finalFactor = areaFactors[finalUnit];\n    if (!finalFactor) {\n        throw new Error(\"invalid final units\");\n    }\n    return (area / startFactor) * finalFactor;\n}\n/**\n * isNumber\n *\n * @param {*} num Number to validate\n * @returns {boolean} true/false\n * @example\n * turf.isNumber(123)\n * //=true\n * turf.isNumber('foo')\n * //=false\n */\nexport function isNumber(num) {\n    return !isNaN(num) && num !== null && !Array.isArray(num);\n}\n/**\n * isObject\n *\n * @param {*} input variable to validate\n * @returns {boolean} true/false\n * @example\n * turf.isObject({elevation: 10})\n * //=true\n * turf.isObject('foo')\n * //=false\n */\nexport function isObject(input) {\n    return !!input && input.constructor === Object;\n}\n/**\n * Validate BBox\n *\n * @private\n * @param {Array<number>} bbox BBox to validate\n * @returns {void}\n * @throws Error if BBox is not valid\n * @example\n * validateBBox([-180, -40, 110, 50])\n * //=OK\n * validateBBox([-180, -40])\n * //=Error\n * validateBBox('Foo')\n * //=Error\n * validateBBox(5)\n * //=Error\n * validateBBox(null)\n * //=Error\n * validateBBox(undefined)\n * //=Error\n */\nexport function 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(function (num) {\n        if (!isNumber(num)) {\n            throw new Error(\"bbox must only contain numbers\");\n        }\n    });\n}\n/**\n * Validate Id\n *\n * @private\n * @param {string|number} id Id to validate\n * @returns {void}\n * @throws Error if Id is not valid\n * @example\n * validateId([-180, -40, 110, 50])\n * //=Error\n * validateId([-180, -40])\n * //=Error\n * validateId('Foo')\n * //=OK\n * validateId(5)\n * //=OK\n * validateId(null)\n * //=Error\n * validateId(undefined)\n * //=Error\n */\nexport function 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}\n", "import { feature, lineString, isObject, point } from '@turf/helpers';\n\n/**\n * Callback for coordEach\n *\n * @callback coordEachCallback\n * @param {Array<number>} currentCoord The current coordinate being processed.\n * @param {number} coordIndex The current index of the coordinate being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed.\n * @param {number} geometryIndex The current index of the Geometry being processed.\n */\n\n/**\n * Iterate over coordinates in any GeoJSON object, similar to Array.forEach()\n *\n * @name coordEach\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (currentCoord, coordIndex, featureIndex, multiFeatureIndex)\n * @param {boolean} [excludeWrapCoord=false] whether or not to include the final coordinate of LinearRings that wraps the ring in its iteration.\n * @returns {void}\n * @example\n * var features = turf.featureCollection([\n *   turf.point([26, 37], {\"foo\": \"bar\"}),\n *   turf.point([36, 53], {\"hello\": \"world\"})\n * ]);\n *\n * turf.coordEach(features, function (currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {\n *   //=currentCoord\n *   //=coordIndex\n *   //=featureIndex\n *   //=multiFeatureIndex\n *   //=geometryIndex\n * });\n */\nfunction coordEach(geojson, callback, excludeWrapCoord) {\n  // Handles null Geometry -- Skips this GeoJSON\n  if (geojson === null) return;\n  var j,\n    k,\n    l,\n    geometry,\n    stopG,\n    coords,\n    geometryMaybeCollection,\n    wrapShrink = 0,\n    coordIndex = 0,\n    isGeometryCollection,\n    type = geojson.type,\n    isFeatureCollection = type === \"FeatureCollection\",\n    isFeature = type === \"Feature\",\n    stop = isFeatureCollection ? geojson.features.length : 1;\n\n  // This logic may look a little weird. The reason why it is that way\n  // is because it's trying to be fast. GeoJSON supports multiple kinds\n  // of objects at its root: FeatureCollection, Features, Geometries.\n  // This function has the responsibility of handling all of them, and that\n  // means that some of the `for` loops you see below actually just don't apply\n  // to certain inputs. For instance, if you give this just a\n  // Point geometry, then both loops are short-circuited and all we do\n  // is gradually rename the input until it's called 'geometry'.\n  //\n  // This also aims to allocate as few resources as possible: just a\n  // few numbers and booleans, rather than any temporary arrays as would\n  // be required with the normalization approach.\n  for (var featureIndex = 0; featureIndex < stop; featureIndex++) {\n    geometryMaybeCollection = isFeatureCollection\n      ? geojson.features[featureIndex].geometry\n      : isFeature\n      ? geojson.geometry\n      : geojson;\n    isGeometryCollection = geometryMaybeCollection\n      ? geometryMaybeCollection.type === \"GeometryCollection\"\n      : false;\n    stopG = isGeometryCollection\n      ? geometryMaybeCollection.geometries.length\n      : 1;\n\n    for (var geomIndex = 0; geomIndex < stopG; geomIndex++) {\n      var multiFeatureIndex = 0;\n      var geometryIndex = 0;\n      geometry = isGeometryCollection\n        ? geometryMaybeCollection.geometries[geomIndex]\n        : geometryMaybeCollection;\n\n      // Handles null Geometry -- Skips this geometry\n      if (geometry === null) continue;\n      coords = geometry.coordinates;\n      var geomType = geometry.type;\n\n      wrapShrink =\n        excludeWrapCoord &&\n        (geomType === \"Polygon\" || geomType === \"MultiPolygon\")\n          ? 1\n          : 0;\n\n      switch (geomType) {\n        case null:\n          break;\n        case \"Point\":\n          if (\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              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                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                  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              coordEach(geometry.geometries[j], callback, excludeWrapCoord) ===\n              false\n            )\n              return false;\n          break;\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n  }\n}\n\n/**\n * Callback for coordReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback coordReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {Array<number>} currentCoord The current coordinate being processed.\n * @param {number} coordIndex The current index of the coordinate being processed.\n * Starts at index 0, if an initialValue is provided, and at index 1 otherwise.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed.\n * @param {number} geometryIndex The current index of the Geometry being processed.\n */\n\n/**\n * Reduce coordinates in any GeoJSON object, similar to Array.reduce()\n *\n * @name coordReduce\n * @param {FeatureCollection|Geometry|Feature} geojson any GeoJSON object\n * @param {Function} callback a method that takes (previousValue, currentCoord, coordIndex)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @param {boolean} [excludeWrapCoord=false] whether or not to include the final coordinate of LinearRings that wraps the ring in its iteration.\n * @returns {*} The value that results from the reduction.\n * @example\n * var features = turf.featureCollection([\n *   turf.point([26, 37], {\"foo\": \"bar\"}),\n *   turf.point([36, 53], {\"hello\": \"world\"})\n * ]);\n *\n * turf.coordReduce(features, function (previousValue, currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {\n *   //=previousValue\n *   //=currentCoord\n *   //=coordIndex\n *   //=featureIndex\n *   //=multiFeatureIndex\n *   //=geometryIndex\n *   return currentCoord;\n * });\n */\nfunction coordReduce(geojson, callback, initialValue, excludeWrapCoord) {\n  var previousValue = initialValue;\n  coordEach(\n    geojson,\n    function (\n      currentCoord,\n      coordIndex,\n      featureIndex,\n      multiFeatureIndex,\n      geometryIndex\n    ) {\n      if (coordIndex === 0 && initialValue === undefined)\n        previousValue = currentCoord;\n      else\n        previousValue = callback(\n          previousValue,\n          currentCoord,\n          coordIndex,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    },\n    excludeWrapCoord\n  );\n  return previousValue;\n}\n\n/**\n * Callback for propEach\n *\n * @callback propEachCallback\n * @param {Object} currentProperties The current Properties being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n */\n\n/**\n * Iterate over properties in any GeoJSON object, similar to Array.forEach()\n *\n * @name propEach\n * @param {FeatureCollection|Feature} geojson any GeoJSON object\n * @param {Function} callback a method that takes (currentProperties, featureIndex)\n * @returns {void}\n * @example\n * var features = turf.featureCollection([\n *     turf.point([26, 37], {foo: 'bar'}),\n *     turf.point([36, 53], {hello: 'world'})\n * ]);\n *\n * turf.propEach(features, function (currentProperties, featureIndex) {\n *   //=currentProperties\n *   //=featureIndex\n * });\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}\n\n/**\n * Callback for propReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback propReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {*} currentProperties The current Properties being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n */\n\n/**\n * Reduce properties in any GeoJSON object into a single value,\n * similar to how Array.reduce works. However, in this case we lazily run\n * the reduction, so an array of all properties is unnecessary.\n *\n * @name propReduce\n * @param {FeatureCollection|Feature} geojson any GeoJSON object\n * @param {Function} callback a method that takes (previousValue, currentProperties, featureIndex)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @returns {*} The value that results from the reduction.\n * @example\n * var features = turf.featureCollection([\n *     turf.point([26, 37], {foo: 'bar'}),\n *     turf.point([36, 53], {hello: 'world'})\n * ]);\n *\n * turf.propReduce(features, function (previousValue, currentProperties, featureIndex) {\n *   //=previousValue\n *   //=currentProperties\n *   //=featureIndex\n *   return currentProperties\n * });\n */\nfunction propReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  propEach(geojson, function (currentProperties, featureIndex) {\n    if (featureIndex === 0 && initialValue === undefined)\n      previousValue = currentProperties;\n    else\n      previousValue = callback(previousValue, currentProperties, featureIndex);\n  });\n  return previousValue;\n}\n\n/**\n * Callback for featureEach\n *\n * @callback featureEachCallback\n * @param {Feature<any>} currentFeature The current Feature being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n */\n\n/**\n * Iterate over features in any GeoJSON object, similar to\n * Array.forEach.\n *\n * @name featureEach\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (currentFeature, featureIndex)\n * @returns {void}\n * @example\n * var features = turf.featureCollection([\n *   turf.point([26, 37], {foo: 'bar'}),\n *   turf.point([36, 53], {hello: 'world'})\n * ]);\n *\n * turf.featureEach(features, function (currentFeature, featureIndex) {\n *   //=currentFeature\n *   //=featureIndex\n * });\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}\n\n/**\n * Callback for featureReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback featureReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {Feature} currentFeature The current Feature being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n */\n\n/**\n * Reduce features in any GeoJSON object, similar to Array.reduce().\n *\n * @name featureReduce\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (previousValue, currentFeature, featureIndex)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @returns {*} The value that results from the reduction.\n * @example\n * var features = turf.featureCollection([\n *   turf.point([26, 37], {\"foo\": \"bar\"}),\n *   turf.point([36, 53], {\"hello\": \"world\"})\n * ]);\n *\n * turf.featureReduce(features, function (previousValue, currentFeature, featureIndex) {\n *   //=previousValue\n *   //=currentFeature\n *   //=featureIndex\n *   return currentFeature\n * });\n */\nfunction featureReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  featureEach(geojson, function (currentFeature, featureIndex) {\n    if (featureIndex === 0 && initialValue === undefined)\n      previousValue = currentFeature;\n    else previousValue = callback(previousValue, currentFeature, featureIndex);\n  });\n  return previousValue;\n}\n\n/**\n * Get all coordinates from any GeoJSON object.\n *\n * @name coordAll\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @returns {Array<Array<number>>} coordinate position array\n * @example\n * var features = turf.featureCollection([\n *   turf.point([26, 37], {foo: 'bar'}),\n *   turf.point([36, 53], {hello: 'world'})\n * ]);\n *\n * var coords = turf.coordAll(features);\n * //= [[26, 37], [36, 53]]\n */\nfunction coordAll(geojson) {\n  var coords = [];\n  coordEach(geojson, function (coord) {\n    coords.push(coord);\n  });\n  return coords;\n}\n\n/**\n * Callback for geomEach\n *\n * @callback geomEachCallback\n * @param {Geometry} currentGeometry The current Geometry being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {Object} featureProperties The current Feature Properties being processed.\n * @param {Array<number>} featureBBox The current Feature BBox being processed.\n * @param {number|string} featureId The current Feature Id being processed.\n */\n\n/**\n * Iterate over each geometry in any GeoJSON object, similar to Array.forEach()\n *\n * @name geomEach\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (currentGeometry, featureIndex, featureProperties, featureBBox, featureId)\n * @returns {void}\n * @example\n * var features = turf.featureCollection([\n *     turf.point([26, 37], {foo: 'bar'}),\n *     turf.point([36, 53], {hello: 'world'})\n * ]);\n *\n * turf.geomEach(features, function (currentGeometry, featureIndex, featureProperties, featureBBox, featureId) {\n *   //=currentGeometry\n *   //=featureIndex\n *   //=featureProperties\n *   //=featureBBox\n *   //=featureId\n * });\n */\nfunction geomEach(geojson, callback) {\n  var i,\n    j,\n    g,\n    geometry,\n    stopG,\n    geometryMaybeCollection,\n    isGeometryCollection,\n    featureProperties,\n    featureBBox,\n    featureId,\n    featureIndex = 0,\n    isFeatureCollection = geojson.type === \"FeatureCollection\",\n    isFeature = geojson.type === \"Feature\",\n    stop = isFeatureCollection ? geojson.features.length : 1;\n\n  // This logic may look a little weird. The reason why it is that way\n  // is because it's trying to be fast. GeoJSON supports multiple kinds\n  // of objects at its root: FeatureCollection, Features, Geometries.\n  // This function has the responsibility of handling all of them, and that\n  // means that some of the `for` loops you see below actually just don't apply\n  // to certain inputs. For instance, if you give this just a\n  // Point geometry, then both loops are short-circuited and all we do\n  // is gradually rename the input until it's called 'geometry'.\n  //\n  // This also aims to allocate as few resources as possible: just a\n  // few numbers and booleans, rather than any temporary arrays as would\n  // be required with the normalization approach.\n  for (i = 0; i < stop; i++) {\n    geometryMaybeCollection = isFeatureCollection\n      ? geojson.features[i].geometry\n      : isFeature\n      ? geojson.geometry\n      : geojson;\n    featureProperties = isFeatureCollection\n      ? geojson.features[i].properties\n      : isFeature\n      ? geojson.properties\n      : {};\n    featureBBox = isFeatureCollection\n      ? geojson.features[i].bbox\n      : isFeature\n      ? geojson.bbox\n      : undefined;\n    featureId = isFeatureCollection\n      ? geojson.features[i].id\n      : isFeature\n      ? geojson.id\n      : undefined;\n    isGeometryCollection = geometryMaybeCollection\n      ? geometryMaybeCollection.type === \"GeometryCollection\"\n      : false;\n    stopG = isGeometryCollection\n      ? geometryMaybeCollection.geometries.length\n      : 1;\n\n    for (g = 0; g < stopG; g++) {\n      geometry = isGeometryCollection\n        ? geometryMaybeCollection.geometries[g]\n        : geometryMaybeCollection;\n\n      // Handle null Geometry\n      if (geometry === null) {\n        if (\n          callback(\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            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              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    // Only increase `featureIndex` per each feature\n    featureIndex++;\n  }\n}\n\n/**\n * Callback for geomReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback geomReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {Geometry} currentGeometry The current Geometry being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {Object} featureProperties The current Feature Properties being processed.\n * @param {Array<number>} featureBBox The current Feature BBox being processed.\n * @param {number|string} featureId The current Feature Id being processed.\n */\n\n/**\n * Reduce geometry in any GeoJSON object, similar to Array.reduce().\n *\n * @name geomReduce\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (previousValue, currentGeometry, featureIndex, featureProperties, featureBBox, featureId)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @returns {*} The value that results from the reduction.\n * @example\n * var features = turf.featureCollection([\n *     turf.point([26, 37], {foo: 'bar'}),\n *     turf.point([36, 53], {hello: 'world'})\n * ]);\n *\n * turf.geomReduce(features, function (previousValue, currentGeometry, featureIndex, featureProperties, featureBBox, featureId) {\n *   //=previousValue\n *   //=currentGeometry\n *   //=featureIndex\n *   //=featureProperties\n *   //=featureBBox\n *   //=featureId\n *   return currentGeometry\n * });\n */\nfunction geomReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  geomEach(\n    geojson,\n    function (\n      currentGeometry,\n      featureIndex,\n      featureProperties,\n      featureBBox,\n      featureId\n    ) {\n      if (featureIndex === 0 && initialValue === undefined)\n        previousValue = currentGeometry;\n      else\n        previousValue = callback(\n          previousValue,\n          currentGeometry,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        );\n    }\n  );\n  return previousValue;\n}\n\n/**\n * Callback for flattenEach\n *\n * @callback flattenEachCallback\n * @param {Feature} currentFeature The current flattened feature being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed.\n */\n\n/**\n * Iterate over flattened features in any GeoJSON object, similar to\n * Array.forEach.\n *\n * @name flattenEach\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (currentFeature, featureIndex, multiFeatureIndex)\n * @example\n * var features = turf.featureCollection([\n *     turf.point([26, 37], {foo: 'bar'}),\n *     turf.multiPoint([[40, 30], [36, 53]], {hello: 'world'})\n * ]);\n *\n * turf.flattenEach(features, function (currentFeature, featureIndex, multiFeatureIndex) {\n *   //=currentFeature\n *   //=featureIndex\n *   //=multiFeatureIndex\n * });\n */\nfunction flattenEach(geojson, callback) {\n  geomEach(geojson, function (geometry, featureIndex, properties, bbox, id) {\n    // Callback for single geometry\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          callback(\n            feature(geometry, properties, { bbox: bbox, id: id }),\n            featureIndex,\n            0\n          ) === false\n        )\n          return false;\n        return;\n    }\n\n    var geomType;\n\n    // Callback for multi-geometry\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\n    for (\n      var multiFeatureIndex = 0;\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        callback(feature(geom, properties), featureIndex, multiFeatureIndex) ===\n        false\n      )\n        return false;\n    }\n  });\n}\n\n/**\n * Callback for flattenReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback flattenReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {Feature} currentFeature The current Feature being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed.\n */\n\n/**\n * Reduce flattened features in any GeoJSON object, similar to Array.reduce().\n *\n * @name flattenReduce\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON object\n * @param {Function} callback a method that takes (previousValue, currentFeature, featureIndex, multiFeatureIndex)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @returns {*} The value that results from the reduction.\n * @example\n * var features = turf.featureCollection([\n *     turf.point([26, 37], {foo: 'bar'}),\n *     turf.multiPoint([[40, 30], [36, 53]], {hello: 'world'})\n * ]);\n *\n * turf.flattenReduce(features, function (previousValue, currentFeature, featureIndex, multiFeatureIndex) {\n *   //=previousValue\n *   //=currentFeature\n *   //=featureIndex\n *   //=multiFeatureIndex\n *   return currentFeature\n * });\n */\nfunction flattenReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  flattenEach(\n    geojson,\n    function (currentFeature, featureIndex, multiFeatureIndex) {\n      if (\n        featureIndex === 0 &&\n        multiFeatureIndex === 0 &&\n        initialValue === undefined\n      )\n        previousValue = currentFeature;\n      else\n        previousValue = callback(\n          previousValue,\n          currentFeature,\n          featureIndex,\n          multiFeatureIndex\n        );\n    }\n  );\n  return previousValue;\n}\n\n/**\n * Callback for segmentEach\n *\n * @callback segmentEachCallback\n * @param {Feature<LineString>} currentSegment The current Segment being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed.\n * @param {number} geometryIndex The current index of the Geometry being processed.\n * @param {number} segmentIndex The current index of the Segment being processed.\n * @returns {void}\n */\n\n/**\n * Iterate over 2-vertex line segment in any GeoJSON object, similar to Array.forEach()\n * (Multi)Point geometries do not contain segments therefore they are ignored during this operation.\n *\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON\n * @param {Function} callback a method that takes (currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex)\n * @returns {void}\n * @example\n * var polygon = turf.polygon([[[-50, 5], [-40, -10], [-50, -10], [-40, 5], [-50, 5]]]);\n *\n * // Iterate over GeoJSON by 2-vertex segments\n * turf.segmentEach(polygon, function (currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex) {\n *   //=currentSegment\n *   //=featureIndex\n *   //=multiFeatureIndex\n *   //=geometryIndex\n *   //=segmentIndex\n * });\n *\n * // Calculate the total number of segments\n * var total = 0;\n * turf.segmentEach(polygon, function () {\n *     total++;\n * });\n */\nfunction segmentEach(geojson, callback) {\n  flattenEach(geojson, function (feature, featureIndex, multiFeatureIndex) {\n    var segmentIndex = 0;\n\n    // Exclude null Geometries\n    if (!feature.geometry) return;\n    // (Multi)Point geometries do not contain segments therefore they are ignored during this operation.\n    var type = feature.geometry.type;\n    if (type === \"Point\" || type === \"MultiPoint\") return;\n\n    // Generate 2-vertex line segments\n    var previousCoords;\n    var previousFeatureIndex = 0;\n    var previousMultiIndex = 0;\n    var prevGeomIndex = 0;\n    if (\n      coordEach(\n        feature,\n        function (\n          currentCoord,\n          coordIndex,\n          featureIndexCoord,\n          multiPartIndexCoord,\n          geometryIndex\n        ) {\n          // Simulating a meta.coordReduce() since `reduce` operations cannot be stopped by returning `false`\n          if (\n            previousCoords === undefined ||\n            featureIndex > previousFeatureIndex ||\n            multiPartIndexCoord > previousMultiIndex ||\n            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            [previousCoords, currentCoord],\n            feature.properties\n          );\n          if (\n            callback(\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}\n\n/**\n * Callback for segmentReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback segmentReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {Feature<LineString>} currentSegment The current Segment being processed.\n * @param {number} featureIndex The current index of the Feature being processed.\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed.\n * @param {number} geometryIndex The current index of the Geometry being processed.\n * @param {number} segmentIndex The current index of the Segment being processed.\n */\n\n/**\n * Reduce 2-vertex line segment in any GeoJSON object, similar to Array.reduce()\n * (Multi)Point geometries do not contain segments therefore they are ignored during this operation.\n *\n * @param {FeatureCollection|Feature|Geometry} geojson any GeoJSON\n * @param {Function} callback a method that takes (previousValue, currentSegment, currentIndex)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @returns {void}\n * @example\n * var polygon = turf.polygon([[[-50, 5], [-40, -10], [-50, -10], [-40, 5], [-50, 5]]]);\n *\n * // Iterate over GeoJSON by 2-vertex segments\n * turf.segmentReduce(polygon, function (previousSegment, currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex) {\n *   //= previousSegment\n *   //= currentSegment\n *   //= featureIndex\n *   //= multiFeatureIndex\n *   //= geometryIndex\n *   //= segmentIndex\n *   return currentSegment\n * });\n *\n * // Calculate the total number of segments\n * var initialValue = 0\n * var total = turf.segmentReduce(polygon, function (previousValue) {\n *     previousValue++;\n *     return previousValue;\n * }, initialValue);\n */\nfunction segmentReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  var started = false;\n  segmentEach(\n    geojson,\n    function (\n      currentSegment,\n      featureIndex,\n      multiFeatureIndex,\n      geometryIndex,\n      segmentIndex\n    ) {\n      if (started === false && initialValue === undefined)\n        previousValue = currentSegment;\n      else\n        previousValue = callback(\n          previousValue,\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        );\n      started = true;\n    }\n  );\n  return previousValue;\n}\n\n/**\n * Callback for lineEach\n *\n * @callback lineEachCallback\n * @param {Feature<LineString>} currentLine The current LineString|LinearRing being processed\n * @param {number} featureIndex The current index of the Feature being processed\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed\n * @param {number} geometryIndex The current index of the Geometry being processed\n */\n\n/**\n * Iterate over line or ring coordinates in LineString, Polygon, MultiLineString, MultiPolygon Features or Geometries,\n * similar to Array.forEach.\n *\n * @name lineEach\n * @param {Geometry|Feature<LineString|Polygon|MultiLineString|MultiPolygon>} geojson object\n * @param {Function} callback a method that takes (currentLine, featureIndex, multiFeatureIndex, geometryIndex)\n * @example\n * var multiLine = turf.multiLineString([\n *   [[26, 37], [35, 45]],\n *   [[36, 53], [38, 50], [41, 55]]\n * ]);\n *\n * turf.lineEach(multiLine, function (currentLine, featureIndex, multiFeatureIndex, geometryIndex) {\n *   //=currentLine\n *   //=featureIndex\n *   //=multiFeatureIndex\n *   //=geometryIndex\n * });\n */\nfunction lineEach(geojson, callback) {\n  // validation\n  if (!geojson) throw new Error(\"geojson is required\");\n\n  flattenEach(geojson, function (feature, featureIndex, multiFeatureIndex) {\n    if (feature.geometry === null) return;\n    var type = feature.geometry.type;\n    var coords = feature.geometry.coordinates;\n    switch (type) {\n      case \"LineString\":\n        if (callback(feature, featureIndex, multiFeatureIndex, 0, 0) === false)\n          return false;\n        break;\n      case \"Polygon\":\n        for (\n          var geometryIndex = 0;\n          geometryIndex < coords.length;\n          geometryIndex++\n        ) {\n          if (\n            callback(\n              lineString(coords[geometryIndex], feature.properties),\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false\n          )\n            return false;\n        }\n        break;\n    }\n  });\n}\n\n/**\n * Callback for lineReduce\n *\n * The first time the callback function is called, the values provided as arguments depend\n * on whether the reduce method has an initialValue argument.\n *\n * If an initialValue is provided to the reduce method:\n *  - The previousValue argument is initialValue.\n *  - The currentValue argument is the value of the first element present in the array.\n *\n * If an initialValue is not provided:\n *  - The previousValue argument is the value of the first element present in the array.\n *  - The currentValue argument is the value of the second element present in the array.\n *\n * @callback lineReduceCallback\n * @param {*} previousValue The accumulated value previously returned in the last invocation\n * of the callback, or initialValue, if supplied.\n * @param {Feature<LineString>} currentLine The current LineString|LinearRing being processed.\n * @param {number} featureIndex The current index of the Feature being processed\n * @param {number} multiFeatureIndex The current index of the Multi-Feature being processed\n * @param {number} geometryIndex The current index of the Geometry being processed\n */\n\n/**\n * Reduce features in any GeoJSON object, similar to Array.reduce().\n *\n * @name lineReduce\n * @param {Geometry|Feature<LineString|Polygon|MultiLineString|MultiPolygon>} geojson object\n * @param {Function} callback a method that takes (previousValue, currentLine, featureIndex, multiFeatureIndex, geometryIndex)\n * @param {*} [initialValue] Value to use as the first argument to the first call of the callback.\n * @returns {*} The value that results from the reduction.\n * @example\n * var multiPoly = turf.multiPolygon([\n *   turf.polygon([[[12,48],[2,41],[24,38],[12,48]], [[9,44],[13,41],[13,45],[9,44]]]),\n *   turf.polygon([[[5, 5], [0, 0], [2, 2], [4, 4], [5, 5]]])\n * ]);\n *\n * turf.lineReduce(multiPoly, function (previousValue, currentLine, featureIndex, multiFeatureIndex, geometryIndex) {\n *   //=previousValue\n *   //=currentLine\n *   //=featureIndex\n *   //=multiFeatureIndex\n *   //=geometryIndex\n *   return currentLine\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 === undefined)\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}\n\n/**\n * Finds a particular 2-vertex LineString Segment from a GeoJSON using `@turf/meta` indexes.\n *\n * Negative indexes are permitted.\n * Point & MultiPoint will always return null.\n *\n * @param {FeatureCollection|Feature|Geometry} geojson Any GeoJSON Feature or Geometry\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.featureIndex=0] Feature Index\n * @param {number} [options.multiFeatureIndex=0] Multi-Feature Index\n * @param {number} [options.geometryIndex=0] Geometry Index\n * @param {number} [options.segmentIndex=0] Segment Index\n * @param {Object} [options.properties={}] Translate Properties to output LineString\n * @param {BBox} [options.bbox={}] Translate BBox to output LineString\n * @param {number|string} [options.id={}] Translate Id to output LineString\n * @returns {Feature<LineString>} 2-vertex GeoJSON Feature LineString\n * @example\n * var multiLine = turf.multiLineString([\n *     [[10, 10], [50, 30], [30, 40]],\n *     [[-10, -10], [-50, -30], [-30, -40]]\n * ]);\n *\n * // First Segment (defaults are 0)\n * turf.findSegment(multiLine);\n * // => Feature<LineString<[[10, 10], [50, 30]]>>\n *\n * // First Segment of 2nd Multi Feature\n * turf.findSegment(multiLine, {multiFeatureIndex: 1});\n * // => Feature<LineString<[[-10, -10], [-50, -30]]>>\n *\n * // Last Segment of Last Multi Feature\n * turf.findSegment(multiLine, {multiFeatureIndex: -1, segmentIndex: -1});\n * // => Feature<LineString<[[-50, -30], [-30, -40]]>>\n */\nfunction findSegment(geojson, options) {\n  // Optional Parameters\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\n  // Find FeatureIndex\n  var properties = options.properties;\n  var geometry;\n\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\n  // Find SegmentIndex\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        [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          coords[geometryIndex][segmentIndex],\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          coords[multiFeatureIndex][segmentIndex],\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 =\n          coords[multiFeatureIndex][geometryIndex].length - segmentIndex - 1;\n      return lineString(\n        [\n          coords[multiFeatureIndex][geometryIndex][segmentIndex],\n          coords[multiFeatureIndex][geometryIndex][segmentIndex + 1],\n        ],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\n\n/**\n * Finds a particular Point from a GeoJSON using `@turf/meta` indexes.\n *\n * Negative indexes are permitted.\n *\n * @param {FeatureCollection|Feature|Geometry} geojson Any GeoJSON Feature or Geometry\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.featureIndex=0] Feature Index\n * @param {number} [options.multiFeatureIndex=0] Multi-Feature Index\n * @param {number} [options.geometryIndex=0] Geometry Index\n * @param {number} [options.coordIndex=0] Coord Index\n * @param {Object} [options.properties={}] Translate Properties to output Point\n * @param {BBox} [options.bbox={}] Translate BBox to output Point\n * @param {number|string} [options.id={}] Translate Id to output Point\n * @returns {Feature<Point>} 2-vertex GeoJSON Feature Point\n * @example\n * var multiLine = turf.multiLineString([\n *     [[10, 10], [50, 30], [30, 40]],\n *     [[-10, -10], [-50, -30], [-30, -40]]\n * ]);\n *\n * // First Segment (defaults are 0)\n * turf.findPoint(multiLine);\n * // => Feature<Point<[10, 10]>>\n *\n * // First Segment of the 2nd Multi-Feature\n * turf.findPoint(multiLine, {multiFeatureIndex: 1});\n * // => Feature<Point<[-10, -10]>>\n *\n * // Last Segment of last Multi-Feature\n * turf.findPoint(multiLine, {multiFeatureIndex: -1, coordIndex: -1});\n * // => Feature<Point<[-30, -40]>>\n */\nfunction findPoint(geojson, options) {\n  // Optional Parameters\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\n  // Find FeatureIndex\n  var properties = options.properties;\n  var geometry;\n\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\n  // Find Coord Index\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 =\n          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}\n\nexport { coordAll, coordEach, coordReduce, featureEach, featureReduce, findPoint, findSegment, flattenEach, flattenReduce, geomEach, geomReduce, lineEach, lineReduce, propEach, propReduce, segmentEach, segmentReduce };\n", "import { featureEach, coordEach } from '@turf/meta';\nimport { point, featureCollection } from '@turf/helpers';\n\n/**\n * Takes a feature or set of features and returns all positions as {@link Point|points}.\n *\n * @name explode\n * @param {GeoJSON} geojson input features\n * @returns {FeatureCollection<point>} points representing the exploded input features\n * @throws {Error} if it encounters an unknown geometry type\n * @example\n * var polygon = turf.polygon([[[-81, 41], [-88, 36], [-84, 31], [-80, 33], [-77, 39], [-81, 41]]]);\n *\n * var explode = turf.explode(polygon);\n *\n * //addToMap\n * var addToMap = [polygon, explode]\n */\nfunction explode(geojson) {\n  var points = [];\n  if (geojson.type === \"FeatureCollection\") {\n    featureEach(geojson, function (feature) {\n      coordEach(feature, function (coord) {\n        points.push(point(coord, feature.properties));\n      });\n    });\n  } else {\n    coordEach(geojson, function (coord) {\n      points.push(point(coord, geojson.properties));\n    });\n  }\n  return featureCollection(points);\n}\n\nexport default explode;\n", "import { coordEach } from \"@turf/meta\";\n/**\n * Takes a set of features, calculates the bbox of all input features, and returns a bounding box.\n *\n * @name bbox\n * @param {GeoJSON} geojson any GeoJSON object\n * @returns {BBox} bbox extent in [minX, minY, maxX, maxY] order\n * @example\n * var line = turf.lineString([[-74, 40], [-78, 42], [-82, 35]]);\n * var bbox = turf.bbox(line);\n * var bboxPolygon = turf.bboxPolygon(bbox);\n *\n * //addToMap\n * var addToMap = [line, bboxPolygon]\n */\nfunction bbox(geojson) {\n    var result = [Infinity, Infinity, -Infinity, -Infinity];\n    coordEach(geojson, function (coord) {\n        if (result[0] > coord[0]) {\n            result[0] = coord[0];\n        }\n        if (result[1] > coord[1]) {\n            result[1] = coord[1];\n        }\n        if (result[2] < coord[0]) {\n            result[2] = coord[0];\n        }\n        if (result[3] < coord[1]) {\n            result[3] = coord[1];\n        }\n    });\n    return result;\n}\nbbox[\"default\"] = bbox;\nexport default bbox;\n", "import bbox from \"@turf/bbox\";\nimport { point, } from \"@turf/helpers\";\n/**\n * Takes a {@link Feature} or {@link FeatureCollection} and returns the absolute center point of all features.\n *\n * @name center\n * @param {GeoJSON} geojson GeoJSON to be centered\n * @param {Object} [options={}] Optional parameters\n * @param {Object} [options.properties={}] Translate GeoJSON Properties to Point\n * @param {Object} [options.bbox={}] Translate GeoJSON BBox to Point\n * @param {Object} [options.id={}] Translate GeoJSON Id to Point\n * @returns {Feature<Point>} a Point feature at the absolute center point of all input features\n * @example\n * var features = turf.points([\n *   [-97.522259, 35.4691],\n *   [-97.502754, 35.463455],\n *   [-97.508269, 35.463245]\n * ]);\n *\n * var center = turf.center(features);\n *\n * //addToMap\n * var addToMap = [features, center]\n * center.properties['marker-size'] = 'large';\n * center.properties['marker-color'] = '#000';\n */\nfunction center(geojson, options) {\n    if (options === void 0) { options = {}; }\n    var ext = bbox(geojson);\n    var x = (ext[0] + ext[2]) / 2;\n    var y = (ext[1] + ext[3]) / 2;\n    return point([x, y], options.properties, options);\n}\nexport default center;\n", "/**\n * Returns a cloned copy of the passed GeoJSON Object, including possible 'Foreign Members'.\n * ~3-5x faster than the common JSON.parse + JSON.stringify combo method.\n *\n * @name clone\n * @param {GeoJSON} geojson GeoJSON Object\n * @returns {GeoJSON} cloned GeoJSON Object\n * @example\n * var line = turf.lineString([[-74, 40], [-78, 42], [-82, 35]], {color: 'red'});\n *\n * var lineCloned = turf.clone(line);\n */\nfunction clone(geojson) {\n    if (!geojson) {\n        throw new Error(\"geojson is required\");\n    }\n    switch (geojson.type) {\n        case \"Feature\":\n            return cloneFeature(geojson);\n        case \"FeatureCollection\":\n            return cloneFeatureCollection(geojson);\n        case \"Point\":\n        case \"LineString\":\n        case \"Polygon\":\n        case \"MultiPoint\":\n        case \"MultiLineString\":\n        case \"MultiPolygon\":\n        case \"GeometryCollection\":\n            return cloneGeometry(geojson);\n        default:\n            throw new Error(\"unknown GeoJSON type\");\n    }\n}\n/**\n * Clone Feature\n *\n * @private\n * @param {Feature<any>} geojson GeoJSON Feature\n * @returns {Feature<any>} cloned Feature\n */\nfunction cloneFeature(geojson) {\n    var cloned = { type: \"Feature\" };\n    // Preserve Foreign Members\n    Object.keys(geojson).forEach(function (key) {\n        switch (key) {\n            case \"type\":\n            case \"properties\":\n            case \"geometry\":\n                return;\n            default:\n                cloned[key] = geojson[key];\n        }\n    });\n    // Add properties & geometry last\n    cloned.properties = cloneProperties(geojson.properties);\n    cloned.geometry = cloneGeometry(geojson.geometry);\n    return cloned;\n}\n/**\n * Clone Properties\n *\n * @private\n * @param {Object} properties GeoJSON Properties\n * @returns {Object} cloned Properties\n */\nfunction cloneProperties(properties) {\n    var cloned = {};\n    if (!properties) {\n        return cloned;\n    }\n    Object.keys(properties).forEach(function (key) {\n        var value = properties[key];\n        if (typeof value === \"object\") {\n            if (value === null) {\n                // handle null\n                cloned[key] = null;\n            }\n            else if (Array.isArray(value)) {\n                // handle Array\n                cloned[key] = value.map(function (item) {\n                    return item;\n                });\n            }\n            else {\n                // handle generic Object\n                cloned[key] = cloneProperties(value);\n            }\n        }\n        else {\n            cloned[key] = value;\n        }\n    });\n    return cloned;\n}\n/**\n * Clone Feature Collection\n *\n * @private\n * @param {FeatureCollection<any>} geojson GeoJSON Feature Collection\n * @returns {FeatureCollection<any>} cloned Feature Collection\n */\nfunction cloneFeatureCollection(geojson) {\n    var cloned = { type: \"FeatureCollection\" };\n    // Preserve Foreign Members\n    Object.keys(geojson).forEach(function (key) {\n        switch (key) {\n            case \"type\":\n            case \"features\":\n                return;\n            default:\n                cloned[key] = geojson[key];\n        }\n    });\n    // Add features\n    cloned.features = geojson.features.map(function (feature) {\n        return cloneFeature(feature);\n    });\n    return cloned;\n}\n/**\n * Clone Geometry\n *\n * @private\n * @param {Geometry<any>} geometry GeoJSON Geometry\n * @returns {Geometry<any>} cloned Geometry\n */\nfunction cloneGeometry(geometry) {\n    var geom = { type: geometry.type };\n    if (geometry.bbox) {\n        geom.bbox = geometry.bbox;\n    }\n    if (geometry.type === \"GeometryCollection\") {\n        geom.geometries = geometry.geometries.map(function (g) {\n            return cloneGeometry(g);\n        });\n        return geom;\n    }\n    geom.coordinates = deepSlice(geometry.coordinates);\n    return geom;\n}\n/**\n * Deep Slice coordinates\n *\n * @private\n * @param {Coordinates} coords Coordinates\n * @returns {Coordinates} all coordinates sliced\n */\nfunction deepSlice(coords) {\n    var cloned = coords;\n    if (typeof cloned[0] !== \"object\") {\n        return cloned.slice();\n    }\n    return cloned.map(function (coord) {\n        return deepSlice(coord);\n    });\n}\nexport default clone;\n", "import { isNumber, } from \"@turf/helpers\";\n/**\n * Unwrap a coordinate from a Point Feature, Geometry or a single coordinate.\n *\n * @name getCoord\n * @param {Array<number>|Geometry<Point>|Feature<Point>} coord GeoJSON Point or an Array of numbers\n * @returns {Array<number>} coordinates\n * @example\n * var pt = turf.point([10, 10]);\n *\n * var coord = turf.getCoord(pt);\n * //= [10, 10]\n */\nexport function getCoord(coord) {\n    if (!coord) {\n        throw new Error(\"coord is required\");\n    }\n    if (!Array.isArray(coord)) {\n        if (coord.type === \"Feature\" &&\n            coord.geometry !== null &&\n            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) &&\n        coord.length >= 2 &&\n        !Array.isArray(coord[0]) &&\n        !Array.isArray(coord[1])) {\n        return coord;\n    }\n    throw new Error(\"coord must be GeoJSON Point or an Array of numbers\");\n}\n/**\n * Unwrap coordinates from a Feature, Geometry Object or an Array\n *\n * @name getCoords\n * @param {Array<any>|Geometry|Feature} coords Feature, Geometry Object or an Array\n * @returns {Array<any>} coordinates\n * @example\n * var poly = turf.polygon([[[119.32, -8.7], [119.55, -8.69], [119.51, -8.54], [119.32, -8.7]]]);\n *\n * var coords = turf.getCoords(poly);\n * //= [[[119.32, -8.7], [119.55, -8.69], [119.51, -8.54], [119.32, -8.7]]]\n */\nexport function getCoords(coords) {\n    if (Array.isArray(coords)) {\n        return coords;\n    }\n    // Feature\n    if (coords.type === \"Feature\") {\n        if (coords.geometry !== null) {\n            return coords.geometry.coordinates;\n        }\n    }\n    else {\n        // Geometry\n        if (coords.coordinates) {\n            return coords.coordinates;\n        }\n    }\n    throw new Error(\"coords must be GeoJSON Feature, Geometry Object or an Array\");\n}\n/**\n * Checks if coordinates contains a number\n *\n * @name containsNumber\n * @param {Array<any>} coordinates GeoJSON Coordinates\n * @returns {boolean} true if Array contains a number\n */\nexport function containsNumber(coordinates) {\n    if (coordinates.length > 1 &&\n        isNumber(coordinates[0]) &&\n        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}\n/**\n * Enforce expectations about types of GeoJSON objects for Turf.\n *\n * @name geojsonType\n * @param {GeoJSON} value any GeoJSON object\n * @param {string} type expected GeoJSON type\n * @param {string} name name of calling function\n * @throws {Error} if value is not the expected type.\n */\nexport function 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(\"Invalid input to \" +\n            name +\n            \": must be a \" +\n            type +\n            \", given \" +\n            value.type);\n    }\n}\n/**\n * Enforce expectations about types of {@link Feature} inputs for Turf.\n * Internally this uses {@link geojsonType} to judge geometry types.\n *\n * @name featureOf\n * @param {Feature} feature a feature with an expected geometry type\n * @param {string} type expected GeoJSON type\n * @param {string} name name of calling function\n * @throws {Error} error if value is not the expected type.\n */\nexport function 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(\"Invalid input to \" + name + \", Feature with geometry required\");\n    }\n    if (!feature.geometry || feature.geometry.type !== type) {\n        throw new Error(\"Invalid input to \" +\n            name +\n            \": must be a \" +\n            type +\n            \", given \" +\n            feature.geometry.type);\n    }\n}\n/**\n * Enforce expectations about types of {@link FeatureCollection} inputs for Turf.\n * Internally this uses {@link geojsonType} to judge geometry types.\n *\n * @name collectionOf\n * @param {FeatureCollection} featureCollection a FeatureCollection for which features will be judged\n * @param {string} type expected GeoJSON type\n * @param {string} name name of calling function\n * @throws {Error} if value is not the expected type.\n */\nexport function 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(\"Invalid input to \" + name + \", FeatureCollection required\");\n    }\n    for (var _i = 0, _a = featureCollection.features; _i < _a.length; _i++) {\n        var feature = _a[_i];\n        if (!feature || feature.type !== \"Feature\" || !feature.geometry) {\n            throw new Error(\"Invalid input to \" + name + \", Feature with geometry required\");\n        }\n        if (!feature.geometry || feature.geometry.type !== type) {\n            throw new Error(\"Invalid input to \" +\n                name +\n                \": must be a \" +\n                type +\n                \", given \" +\n                feature.geometry.type);\n        }\n    }\n}\n/**\n * Get Geometry from Feature or Geometry Object\n *\n * @param {Feature|Geometry} geojson GeoJSON Feature or Geometry Object\n * @returns {Geometry|null} GeoJSON Geometry Object\n * @throws {Error} if geojson is not a Feature or Geometry Object\n * @example\n * var point = {\n *   \"type\": \"Feature\",\n *   \"properties\": {},\n *   \"geometry\": {\n *     \"type\": \"Point\",\n *     \"coordinates\": [110, 40]\n *   }\n * }\n * var geom = turf.getGeom(point)\n * //={\"type\": \"Point\", \"coordinates\": [110, 40]}\n */\nexport function getGeom(geojson) {\n    if (geojson.type === \"Feature\") {\n        return geojson.geometry;\n    }\n    return geojson;\n}\n/**\n * Get GeoJSON object's type, Geometry type is prioritize.\n *\n * @param {GeoJSON} geojson GeoJSON object\n * @param {string} [name=\"geojson\"] name of the variable to display in error message (unused)\n * @returns {string} GeoJSON type\n * @example\n * var point = {\n *   \"type\": \"Feature\",\n *   \"properties\": {},\n *   \"geometry\": {\n *     \"type\": \"Point\",\n *     \"coordinates\": [110, 40]\n *   }\n * }\n * var geom = turf.getType(point)\n * //=\"Point\"\n */\nexport function 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}\n", "import { getCoord } from \"@turf/invariant\";\nimport { radiansToLength, degreesToRadians, } from \"@turf/helpers\";\n//http://en.wikipedia.org/wiki/Haversine_formula\n//http://www.movable-type.co.uk/scripts/latlong.html\n/**\n * Calculates the distance between two {@link Point|points} in degrees, radians, miles, or kilometers.\n * This uses the [Haversine formula](http://en.wikipedia.org/wiki/Haversine_formula) to account for global curvature.\n *\n * @name distance\n * @param {Coord | Point} from origin point or coordinate\n * @param {Coord | Point} to destination point or coordinate\n * @param {Object} [options={}] Optional parameters\n * @param {string} [options.units='kilometers'] can be degrees, radians, miles, or kilometers\n * @returns {number} distance between the two points\n * @example\n * var from = turf.point([-75.343, 39.984]);\n * var to = turf.point([-75.534, 39.123]);\n * var options = {units: 'miles'};\n *\n * var distance = turf.distance(from, to, options);\n *\n * //addToMap\n * var addToMap = [from, to];\n * from.properties.distance = distance;\n * to.properties.distance = distance;\n */\nfunction distance(from, to, options) {\n    if (options === void 0) { options = {}; }\n    var coordinates1 = getCoord(from);\n    var coordinates2 = getCoord(to);\n    var dLat = degreesToRadians(coordinates2[1] - coordinates1[1]);\n    var dLon = degreesToRadians(coordinates2[0] - coordinates1[0]);\n    var lat1 = degreesToRadians(coordinates1[1]);\n    var lat2 = degreesToRadians(coordinates2[1]);\n    var a = Math.pow(Math.sin(dLat / 2), 2) +\n        Math.pow(Math.sin(dLon / 2), 2) * Math.cos(lat1) * Math.cos(lat2);\n    return radiansToLength(2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)), options.units);\n}\nexport default distance;\n", "import clone from \"@turf/clone\";\nimport distance from \"@turf/distance\";\nimport { featureEach } from \"@turf/meta\";\n/**\n * Takes a reference {@link Point|point} and a FeatureCollection of Features\n * with Point geometries and returns the\n * point from the FeatureCollection closest to the reference. This calculation\n * is geodesic.\n *\n * @name nearestPoint\n * @param {Coord} targetPoint the reference point\n * @param {FeatureCollection<Point>} points against input point set\n * @returns {Feature<Point>} the closest point in the set to the reference point\n * @example\n * var targetPoint = turf.point([28.965797, 41.010086], {\"marker-color\": \"#0F0\"});\n * var points = turf.featureCollection([\n *     turf.point([28.973865, 41.011122]),\n *     turf.point([28.948459, 41.024204]),\n *     turf.point([28.938674, 41.013324])\n * ]);\n *\n * var nearest = turf.nearestPoint(targetPoint, points);\n *\n * //addToMap\n * var addToMap = [targetPoint, points, nearest];\n * nearest.properties['marker-color'] = '#F00';\n */\nfunction nearestPoint(targetPoint, points) {\n    // Input validation\n    if (!targetPoint)\n        throw new Error(\"targetPoint is required\");\n    if (!points)\n        throw new Error(\"points is required\");\n    var nearest;\n    var minDist = Infinity;\n    var bestFeatureIndex = 0;\n    featureEach(points, function (pt, featureIndex) {\n        var distanceToPoint = distance(targetPoint, pt);\n        if (distanceToPoint < minDist) {\n            bestFeatureIndex = featureIndex;\n            minDist = distanceToPoint;\n        }\n    });\n    nearest = clone(points.features[bestFeatureIndex]);\n    nearest.properties.featureIndex = bestFeatureIndex;\n    nearest.properties.distanceToPoint = minDist;\n    return nearest;\n}\nexport default nearestPoint;\n", "import { getCoord, getGeom } from \"@turf/invariant\";\n// http://en.wikipedia.org/wiki/Even%E2%80%93odd_rule\n// modified from: https://github.com/substack/point-in-polygon/blob/master/index.js\n// which was modified from http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html\n/**\n * Takes a {@link Point} and a {@link Polygon} or {@link MultiPolygon} and determines if the point\n * resides inside the polygon. The polygon can be convex or concave. The function accounts for holes.\n *\n * @name booleanPointInPolygon\n * @param {Coord} point input point\n * @param {Feature<Polygon|MultiPolygon>} polygon input polygon or multipolygon\n * @param {Object} [options={}] Optional parameters\n * @param {boolean} [options.ignoreBoundary=false] True if polygon boundary should be ignored when determining if\n * the point is inside the polygon otherwise false.\n * @returns {boolean} `true` if the Point is inside the Polygon; `false` if the Point is not inside the Polygon\n * @example\n * var pt = turf.point([-77, 44]);\n * var poly = turf.polygon([[\n *   [-81, 41],\n *   [-81, 47],\n *   [-72, 47],\n *   [-72, 41],\n *   [-81, 41]\n * ]]);\n *\n * turf.booleanPointInPolygon(pt, poly);\n * //= true\n */\nexport default function booleanPointInPolygon(point, polygon, options) {\n    if (options === void 0) { options = {}; }\n    // validation\n    if (!point) {\n        throw new Error(\"point is required\");\n    }\n    if (!polygon) {\n        throw new Error(\"polygon is required\");\n    }\n    var pt = getCoord(point);\n    var geom = getGeom(polygon);\n    var type = geom.type;\n    var bbox = polygon.bbox;\n    var polys = geom.coordinates;\n    // Quick elimination if point is not inside bbox\n    if (bbox && inBBox(pt, bbox) === false) {\n        return false;\n    }\n    // normalize to multipolygon\n    if (type === \"Polygon\") {\n        polys = [polys];\n    }\n    var insidePoly = false;\n    for (var i = 0; i < polys.length && !insidePoly; i++) {\n        // check if it is in the outer ring first\n        if (inRing(pt, polys[i][0], options.ignoreBoundary)) {\n            var inHole = false;\n            var k = 1;\n            // check for the point in any of the holes\n            while (k < polys[i].length && !inHole) {\n                if (inRing(pt, polys[i][k], !options.ignoreBoundary)) {\n                    inHole = true;\n                }\n                k++;\n            }\n            if (!inHole) {\n                insidePoly = true;\n            }\n        }\n    }\n    return insidePoly;\n}\n/**\n * inRing\n *\n * @private\n * @param {Array<number>} pt [x,y]\n * @param {Array<Array<number>>} ring [[x,y], [x,y],..]\n * @param {boolean} ignoreBoundary ignoreBoundary\n * @returns {boolean} inRing\n */\nfunction inRing(pt, ring, ignoreBoundary) {\n    var isInside = false;\n    if (ring[0][0] === ring[ring.length - 1][0] &&\n        ring[0][1] === ring[ring.length - 1][1]) {\n        ring = ring.slice(0, ring.length - 1);\n    }\n    for (var i = 0, j = ring.length - 1; i < ring.length; j = i++) {\n        var xi = ring[i][0];\n        var yi = ring[i][1];\n        var xj = ring[j][0];\n        var yj = ring[j][1];\n        var onBoundary = pt[1] * (xi - xj) + yi * (xj - pt[0]) + yj * (pt[0] - xi) === 0 &&\n            (xi - pt[0]) * (xj - pt[0]) <= 0 &&\n            (yi - pt[1]) * (yj - pt[1]) <= 0;\n        if (onBoundary) {\n            return !ignoreBoundary;\n        }\n        var intersect = yi > pt[1] !== yj > pt[1] &&\n            pt[0] < ((xj - xi) * (pt[1] - yi)) / (yj - yi) + xi;\n        if (intersect) {\n            isInside = !isInside;\n        }\n    }\n    return isInside;\n}\n/**\n * inBBox\n *\n * @private\n * @param {Position} pt point [x,y]\n * @param {BBox} bbox BBox [west, south, east, north]\n * @returns {boolean} true/false if point is inside BBox\n */\nfunction inBBox(pt, bbox) {\n    return (bbox[0] <= pt[0] && bbox[1] <= pt[1] && bbox[2] >= pt[0] && bbox[3] >= pt[1]);\n}\n", "import explode from '@turf/explode';\nimport centroid from '@turf/center';\nimport nearestPoint from '@turf/nearest-point';\nimport booleanPointInPolygon from '@turf/boolean-point-in-polygon';\nimport { featureCollection, point, feature } from '@turf/helpers';\n\n/**\n * Takes a Feature or FeatureCollection and returns a {@link Point} guaranteed to be on the surface of the feature.\n *\n * * Given a {@link Polygon}, the point will be in the area of the polygon\n * * Given a {@link LineString}, the point will be along the string\n * * Given a {@link Point}, the point will the same as the input\n *\n * @name pointOnFeature\n * @param {GeoJSON} geojson any Feature or FeatureCollection\n * @returns {Feature<Point>} a point on the surface of `input`\n * @example\n * var polygon = turf.polygon([[\n *   [116, -36],\n *   [131, -32],\n *   [146, -43],\n *   [155, -25],\n *   [133, -9],\n *   [111, -22],\n *   [116, -36]\n * ]]);\n *\n * var pointOnPolygon = turf.pointOnFeature(polygon);\n *\n * //addToMap\n * var addToMap = [polygon, pointOnPolygon];\n */\nfunction pointOnFeature(geojson) {\n  // normalize\n  var fc = normalize(geojson);\n\n  // get centroid\n  var cent = centroid(fc);\n\n  // check to see if centroid is on surface\n  var onSurface = false;\n  var i = 0;\n  while (!onSurface && i < fc.features.length) {\n    var geom = fc.features[i].geometry;\n    var x, y, x1, y1, x2, y2, k;\n    var onLine = false;\n    if (geom.type === \"Point\") {\n      if (\n        cent.geometry.coordinates[0] === geom.coordinates[0] &&\n        cent.geometry.coordinates[1] === geom.coordinates[1]\n      ) {\n        onSurface = true;\n      }\n    } else if (geom.type === \"MultiPoint\") {\n      var onMultiPoint = false;\n      k = 0;\n      while (!onMultiPoint && k < geom.coordinates.length) {\n        if (\n          cent.geometry.coordinates[0] === geom.coordinates[k][0] &&\n          cent.geometry.coordinates[1] === geom.coordinates[k][1]\n        ) {\n          onSurface = true;\n          onMultiPoint = true;\n        }\n        k++;\n      }\n    } else if (geom.type === \"LineString\") {\n      k = 0;\n      while (!onLine && k < geom.coordinates.length - 1) {\n        x = cent.geometry.coordinates[0];\n        y = cent.geometry.coordinates[1];\n        x1 = geom.coordinates[k][0];\n        y1 = geom.coordinates[k][1];\n        x2 = geom.coordinates[k + 1][0];\n        y2 = geom.coordinates[k + 1][1];\n        if (pointOnSegment(x, y, x1, y1, x2, y2)) {\n          onLine = true;\n          onSurface = true;\n        }\n        k++;\n      }\n    } else if (geom.type === \"MultiLineString\") {\n      var j = 0;\n      while (j < geom.coordinates.length) {\n        onLine = false;\n        k = 0;\n        var line = geom.coordinates[j];\n        while (!onLine && k < line.length - 1) {\n          x = cent.geometry.coordinates[0];\n          y = cent.geometry.coordinates[1];\n          x1 = line[k][0];\n          y1 = line[k][1];\n          x2 = line[k + 1][0];\n          y2 = line[k + 1][1];\n          if (pointOnSegment(x, y, x1, y1, x2, y2)) {\n            onLine = true;\n            onSurface = true;\n          }\n          k++;\n        }\n        j++;\n      }\n    } else if (geom.type === \"Polygon\" || geom.type === \"MultiPolygon\") {\n      if (booleanPointInPolygon(cent, geom)) {\n        onSurface = true;\n      }\n    }\n    i++;\n  }\n  if (onSurface) {\n    return cent;\n  } else {\n    var vertices = featureCollection([]);\n    for (i = 0; i < fc.features.length; i++) {\n      vertices.features = vertices.features.concat(\n        explode(fc.features[i]).features\n      );\n    }\n    // Remove distanceToPoint properties from nearestPoint()\n    return point(nearestPoint(cent, vertices).geometry.coordinates);\n  }\n}\n\n/**\n * Normalizes any GeoJSON to a FeatureCollection\n *\n * @private\n * @name normalize\n * @param {GeoJSON} geojson Any GeoJSON\n * @returns {FeatureCollection} FeatureCollection\n */\nfunction normalize(geojson) {\n  if (geojson.type !== \"FeatureCollection\") {\n    if (geojson.type !== \"Feature\") {\n      return featureCollection([feature(geojson)]);\n    }\n    return featureCollection([geojson]);\n  }\n  return geojson;\n}\n\nfunction pointOnSegment(x, y, x1, y1, x2, y2) {\n  var ab = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));\n  var ap = Math.sqrt((x - x1) * (x - x1) + (y - y1) * (y - y1));\n  var pb = Math.sqrt((x2 - x) * (x2 - x) + (y2 - y) * (y2 - y));\n  return ab === ap + pb;\n}\n\nexport default pointOnFeature;\n"],
  "mappings": "0hBAAA,IAAAA,GAAAC,GAAA,CAAAC,GAAAC,KAAA,EASE,UAAW,CAGX,IAAIC,EAGAC,EAAU,SAGVC,EAAmB,IAGnBC,EAAkB,sBAGlBC,EAAiB,4BAGjBC,EAAyB,EACzBC,EAAuB,EAGvBC,EAAW,EAAI,EACfC,EAAmB,iBAGnBC,EAAU,qBACVC,EAAW,iBACXC,EAAU,mBACVC,EAAU,gBACVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBACbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBAEbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,GAAU,qBACVC,EAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAe,mDACfC,GAAgB,QAChBC,GAAe,MACfC,GAAa,mGAMbC,EAAe,sBAGfC,GAAe,WAGfC,EAAU,OAGVC,EAAe,8BAGfC,GAAW,mBAGXC,EAAiB,CAAC,EACtBA,EAAelB,GAAckB,EAAejB,GAC5CiB,EAAehB,IAAWgB,EAAef,GACzCe,EAAed,IAAYc,EAAeb,IAC1Ca,EAAeZ,IAAmBY,EAAeX,IACjDW,EAAeV,IAAa,GAC5BU,EAAepC,GAAWoC,EAAenC,GACzCmC,EAAepB,GAAkBoB,EAAelC,GAChDkC,EAAenB,GAAemB,EAAejC,GAC7CiC,EAAehC,GAAYgC,EAAe/B,GAC1C+B,EAAe7B,GAAU6B,EAAe5B,GACxC4B,EAAe3B,GAAa2B,EAAezB,GAC3CyB,EAAexB,GAAUwB,EAAevB,GACxCuB,EAAerB,GAAc,GAG7B,IAAIsB,EAAgB,CAAC,EACrBA,EAAcrC,GAAWqC,EAAcpC,GACvCoC,EAAcrB,GAAkBqB,EAAcpB,GAC9CoB,EAAcnC,GAAWmC,EAAclC,GACvCkC,EAAcnB,GAAcmB,EAAclB,GAC1CkB,EAAcjB,IAAWiB,EAAchB,GACvCgB,EAAcf,IAAYe,EAAc9B,GACxC8B,EAAc7B,GAAa6B,EAAc5B,GACzC4B,EAAc1B,GAAa0B,EAAczB,GACzCyB,EAAcxB,GAAawB,EAAcvB,GACzCuB,EAAcd,IAAYc,EAAcb,IACxCa,EAAcZ,IAAaY,EAAcX,IAAa,GACtDW,EAAcjC,GAAYiC,EAAchC,GACxCgC,EAActB,GAAc,GAG5B,IAAIuB,GAAa,OAAO,QAAU,UAAY,QAAU,OAAO,SAAW,QAAU,OAGhFC,EAAW,OAAO,MAAQ,UAAY,MAAQ,KAAK,SAAW,QAAU,KAGxEC,EAAOF,IAAcC,GAAY,SAAS,aAAa,EAAE,EAGzDE,GAAc,OAAOpD,IAAW,UAAYA,IAAW,CAACA,GAAQ,UAAYA,GAG5EqD,GAAaD,IAAe,OAAOnD,IAAU,UAAYA,IAAU,CAACA,GAAO,UAAYA,GAGvFqD,GAAgBD,IAAcA,GAAW,UAAYD,GAGrDG,GAAcD,IAAiBL,GAAW,QAG1CO,GAAY,UAAW,CACzB,GAAI,CACF,OAAOD,IAAeA,GAAY,QAAQ,MAAM,CAClD,MAAE,CAAW,CACf,EAAE,EAGEE,GAAmBD,IAAYA,GAAS,aAY5C,SAASE,GAAYC,EAAKC,EAAM,CAE9B,OAAAD,EAAI,IAAIC,EAAK,GAAIA,EAAK,EAAE,EACjBD,CACT,CAUA,SAASE,GAAYC,EAAKC,EAAO,CAE/B,OAAAD,EAAI,IAAIC,CAAK,EACND,CACT,CAYA,SAASE,EAAMC,EAAMC,EAASC,EAAM,CAClC,OAAQA,EAAK,OAAQ,CACnB,IAAK,GAAG,OAAOF,EAAK,KAAKC,CAAO,EAChC,IAAK,GAAG,OAAOD,EAAK,KAAKC,EAASC,EAAK,EAAE,EACzC,IAAK,GAAG,OAAOF,EAAK,KAAKC,EAASC,EAAK,GAAIA,EAAK,EAAE,EAClD,IAAK,GAAG,OAAOF,EAAK,KAAKC,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,EAAE,CAC7D,CACA,OAAOF,EAAK,MAAMC,EAASC,CAAI,CACjC,CAWA,SAASC,GAAUC,EAAOC,EAAU,CAIlC,QAHIC,EAAQ,GACRC,EAASH,EAAQA,EAAM,OAAS,EAE7B,EAAEE,EAAQC,GACXF,EAASD,EAAME,GAAQA,EAAOF,CAAK,IAAM,IAA7C,CAIF,OAAOA,CACT,CAUA,SAASI,GAAUJ,EAAOK,EAAQ,CAKhC,QAJIH,EAAQ,GACRC,EAASE,EAAO,OAChBC,EAASN,EAAM,OAEZ,EAAEE,EAAQC,GACfH,EAAMM,EAASJ,GAASG,EAAOH,GAEjC,OAAOF,CACT,CAcA,SAASO,GAAYP,EAAOC,EAAUO,EAAaC,EAAW,CAC5D,IAAIP,EAAQ,GACRC,EAASH,EAAQA,EAAM,OAAS,EAKpC,IAHIS,GAAaN,IACfK,EAAcR,EAAM,EAAEE,IAEjB,EAAEA,EAAQC,GACfK,EAAcP,EAASO,EAAaR,EAAME,GAAQA,EAAOF,CAAK,EAEhE,OAAOQ,CACT,CAYA,SAASE,GAAUV,EAAOW,EAAW,CAInC,QAHIT,EAAQ,GACRC,EAASH,EAAQA,EAAM,OAAS,EAE7B,EAAEE,EAAQC,GACf,GAAIQ,EAAUX,EAAME,GAAQA,EAAOF,CAAK,EACtC,MAAO,GAGX,MAAO,EACT,CASA,SAASY,GAAaC,EAAK,CACzB,OAAO,SAASC,EAAQ,CACtB,OAAOA,GAAU,KAAOjF,EAAYiF,EAAOD,EAC7C,CACF,CAWA,SAASE,GAAUC,EAAGf,EAAU,CAI9B,QAHIC,EAAQ,GACRe,EAAS,MAAMD,CAAC,EAEb,EAAEd,EAAQc,GACfC,EAAOf,GAASD,EAASC,CAAK,EAEhC,OAAOe,CACT,CASA,SAASC,GAAUtB,EAAM,CACvB,OAAO,SAASF,EAAO,CACrB,OAAOE,EAAKF,CAAK,CACnB,CACF,CAUA,SAASyB,GAASL,EAAQD,EAAK,CAC7B,OAAOC,GAAU,KAAOjF,EAAYiF,EAAOD,EAC7C,CASA,SAASO,GAAa1B,EAAO,CAG3B,IAAIuB,EAAS,GACb,GAAIvB,GAAS,MAAQ,OAAOA,EAAM,UAAY,WAC5C,GAAI,CACFuB,EAAS,CAAC,EAAEvB,EAAQ,GACtB,MAAE,CAAW,CAEf,OAAOuB,CACT,CASA,SAASI,GAAW/B,EAAK,CACvB,IAAIY,EAAQ,GACRe,EAAS,MAAM3B,EAAI,IAAI,EAE3B,OAAAA,EAAI,QAAQ,SAASI,EAAOmB,EAAK,CAC/BI,EAAO,EAAEf,GAAS,CAACW,EAAKnB,CAAK,CAC/B,CAAC,EACMuB,CACT,CAUA,SAASK,GAAQ1B,EAAM2B,EAAW,CAChC,OAAO,SAASC,EAAK,CACnB,OAAO5B,EAAK2B,EAAUC,CAAG,CAAC,CAC5B,CACF,CASA,SAASC,GAAWhC,EAAK,CACvB,IAAIS,EAAQ,GACRe,EAAS,MAAMxB,EAAI,IAAI,EAE3B,OAAAA,EAAI,QAAQ,SAASC,EAAO,CAC1BuB,EAAO,EAAEf,GAASR,CACpB,CAAC,EACMuB,CACT,CAKA,IAAIS,GAAa,MAAM,UACnBC,GAAY,SAAS,UACrBC,GAAc,OAAO,UAGrBC,GAAa/C,EAAK,sBAGlBgD,GAAc,UAAW,CAC3B,IAAIC,EAAM,SAAS,KAAKF,IAAcA,GAAW,MAAQA,GAAW,KAAK,UAAY,EAAE,EACvF,OAAOE,EAAO,iBAAmBA,EAAO,EAC1C,EAAE,EAGEC,GAAeL,GAAU,SAGzBM,GAAiBL,GAAY,eAG7BM,GAAmBF,GAAa,KAAK,MAAM,EAO3CG,GAAiBP,GAAY,SAG7BQ,GAAa,OAAO,IACtBJ,GAAa,KAAKC,EAAc,EAAE,QAAQ5D,EAAc,MAAM,EAC7D,QAAQ,yDAA0D,OAAO,EAAI,GAChF,EAGIgE,GAASpD,GAAgBH,EAAK,OAASjD,EACvCyG,GAASxD,EAAK,OACdyD,GAAazD,EAAK,WAClB0D,GAAelB,GAAQ,OAAO,eAAgB,MAAM,EACpDmB,GAAe,OAAO,OACtBC,GAAuBd,GAAY,qBACnCe,GAASjB,GAAW,OAGpBkB,GAAmB,OAAO,sBAC1BC,GAAiBR,GAASA,GAAO,SAAWxG,EAC5CiH,GAAaxB,GAAQ,OAAO,KAAM,MAAM,EACxCyB,GAAY,KAAK,IAGjBC,GAAWC,GAAUnE,EAAM,UAAU,EACrCoE,GAAMD,GAAUnE,EAAM,KAAK,EAC3BqE,GAAUF,GAAUnE,EAAM,SAAS,EACnCsE,GAAMH,GAAUnE,EAAM,KAAK,EAC3BuE,GAAUJ,GAAUnE,EAAM,SAAS,EACnCwE,GAAeL,GAAU,OAAQ,QAAQ,EAGzCM,GAAiB,CAACb,GAAqB,KAAK,CAAE,QAAW,CAAE,EAAG,SAAS,EAGvEc,GAAY,CAAC,EAGbC,GAAqBC,GAASV,EAAQ,EACtCW,GAAgBD,GAASR,EAAG,EAC5BU,GAAoBF,GAASP,EAAO,EACpCU,GAAgBH,GAASN,EAAG,EAC5BU,GAAoBJ,GAASL,EAAO,EAGpCU,GAAczB,GAASA,GAAO,UAAYzG,EAC1CmI,GAAgBD,GAAcA,GAAY,QAAUlI,EACpDoI,GAAiBF,GAAcA,GAAY,SAAWlI,EAyH1D,SAASqI,GAAS,CAElB,CAWA,SAASC,GAAKC,EAAS,CACrB,IAAIlE,EAAQ,GACRC,EAASiE,EAAUA,EAAQ,OAAS,EAGxC,IADA,KAAK,MAAM,EACJ,EAAElE,EAAQC,GAAQ,CACvB,IAAIkE,EAAQD,EAAQlE,GACpB,KAAK,IAAImE,EAAM,GAAIA,EAAM,EAAE,CAC7B,CACF,CASA,SAASC,IAAY,CACnB,KAAK,SAAWhB,GAAeA,GAAa,IAAI,EAAI,CAAC,CACvD,CAYA,SAASiB,GAAW1D,EAAK,CACvB,OAAO,KAAK,IAAIA,CAAG,GAAK,OAAO,KAAK,SAASA,EAC/C,CAWA,SAAS2D,GAAQ3D,EAAK,CACpB,IAAI4D,EAAO,KAAK,SAChB,GAAInB,GAAc,CAChB,IAAIrC,EAASwD,EAAK5D,GAClB,OAAOI,IAAWhF,EAAiBJ,EAAYoF,CACjD,CACA,OAAOgB,GAAe,KAAKwC,EAAM5D,CAAG,EAAI4D,EAAK5D,GAAOhF,CACtD,CAWA,SAAS6I,GAAQ7D,EAAK,CACpB,IAAI4D,EAAO,KAAK,SAChB,OAAOnB,GAAemB,EAAK5D,KAAShF,EAAYoG,GAAe,KAAKwC,EAAM5D,CAAG,CAC/E,CAYA,SAAS8D,GAAQ9D,EAAKnB,EAAO,CAC3B,IAAI+E,EAAO,KAAK,SAChB,OAAAA,EAAK5D,GAAQyC,IAAgB5D,IAAU7D,EAAaI,EAAiByD,EAC9D,IACT,CAGAyE,GAAK,UAAU,MAAQG,GACvBH,GAAK,UAAU,OAAYI,GAC3BJ,GAAK,UAAU,IAAMK,GACrBL,GAAK,UAAU,IAAMO,GACrBP,GAAK,UAAU,IAAMQ,GAWrB,SAASC,GAAUR,EAAS,CAC1B,IAAIlE,EAAQ,GACRC,EAASiE,EAAUA,EAAQ,OAAS,EAGxC,IADA,KAAK,MAAM,EACJ,EAAElE,EAAQC,GAAQ,CACvB,IAAIkE,EAAQD,EAAQlE,GACpB,KAAK,IAAImE,EAAM,GAAIA,EAAM,EAAE,CAC7B,CACF,CASA,SAASQ,IAAiB,CACxB,KAAK,SAAW,CAAC,CACnB,CAWA,SAASC,GAAgBjE,EAAK,CAC5B,IAAI4D,EAAO,KAAK,SACZvE,EAAQ6E,GAAaN,EAAM5D,CAAG,EAElC,GAAIX,EAAQ,EACV,MAAO,GAET,IAAI8E,EAAYP,EAAK,OAAS,EAC9B,OAAIvE,GAAS8E,EACXP,EAAK,IAAI,EAET9B,GAAO,KAAK8B,EAAMvE,EAAO,CAAC,EAErB,EACT,CAWA,SAAS+E,GAAapE,EAAK,CACzB,IAAI4D,EAAO,KAAK,SACZvE,EAAQ6E,GAAaN,EAAM5D,CAAG,EAElC,OAAOX,EAAQ,EAAIrE,EAAY4I,EAAKvE,GAAO,EAC7C,CAWA,SAASgF,GAAarE,EAAK,CACzB,OAAOkE,GAAa,KAAK,SAAUlE,CAAG,EAAI,EAC5C,CAYA,SAASsE,GAAatE,EAAKnB,EAAO,CAChC,IAAI+E,EAAO,KAAK,SACZvE,EAAQ6E,GAAaN,EAAM5D,CAAG,EAElC,OAAIX,EAAQ,EACVuE,EAAK,KAAK,CAAC5D,EAAKnB,CAAK,CAAC,EAEtB+E,EAAKvE,GAAO,GAAKR,EAEZ,IACT,CAGAkF,GAAU,UAAU,MAAQC,GAC5BD,GAAU,UAAU,OAAYE,GAChCF,GAAU,UAAU,IAAMK,GAC1BL,GAAU,UAAU,IAAMM,GAC1BN,GAAU,UAAU,IAAMO,GAW1B,SAASC,GAAShB,EAAS,CACzB,IAAIlE,EAAQ,GACRC,EAASiE,EAAUA,EAAQ,OAAS,EAGxC,IADA,KAAK,MAAM,EACJ,EAAElE,EAAQC,GAAQ,CACvB,IAAIkE,EAAQD,EAAQlE,GACpB,KAAK,IAAImE,EAAM,GAAIA,EAAM,EAAE,CAC7B,CACF,CASA,SAASgB,IAAgB,CACvB,KAAK,SAAW,CACd,KAAQ,IAAIlB,GACZ,IAAO,IAAKjB,IAAO0B,IACnB,OAAU,IAAIT,EAChB,CACF,CAWA,SAASmB,GAAezE,EAAK,CAC3B,OAAO0E,GAAW,KAAM1E,CAAG,EAAE,OAAUA,CAAG,CAC5C,CAWA,SAAS2E,GAAY3E,EAAK,CACxB,OAAO0E,GAAW,KAAM1E,CAAG,EAAE,IAAIA,CAAG,CACtC,CAWA,SAAS4E,GAAY5E,EAAK,CACxB,OAAO0E,GAAW,KAAM1E,CAAG,EAAE,IAAIA,CAAG,CACtC,CAYA,SAAS6E,GAAY7E,EAAKnB,EAAO,CAC/B,OAAA6F,GAAW,KAAM1E,CAAG,EAAE,IAAIA,EAAKnB,CAAK,EAC7B,IACT,CAGA0F,GAAS,UAAU,MAAQC,GAC3BD,GAAS,UAAU,OAAYE,GAC/BF,GAAS,UAAU,IAAMI,GACzBJ,GAAS,UAAU,IAAMK,GACzBL,GAAS,UAAU,IAAMM,GAYzB,SAASC,GAAStF,EAAQ,CACxB,IAAIH,EAAQ,GACRC,EAASE,EAASA,EAAO,OAAS,EAGtC,IADA,KAAK,SAAW,IAAI+E,GACb,EAAElF,EAAQC,GACf,KAAK,IAAIE,EAAOH,EAAM,CAE1B,CAYA,SAAS0F,GAAYlG,EAAO,CAC1B,YAAK,SAAS,IAAIA,EAAOzD,CAAc,EAChC,IACT,CAWA,SAAS4J,GAAYnG,EAAO,CAC1B,OAAO,KAAK,SAAS,IAAIA,CAAK,CAChC,CAGAiG,GAAS,UAAU,IAAMA,GAAS,UAAU,KAAOC,GACnDD,GAAS,UAAU,IAAME,GAWzB,SAASC,GAAM1B,EAAS,CACtB,KAAK,SAAW,IAAIQ,GAAUR,CAAO,CACvC,CASA,SAAS2B,IAAa,CACpB,KAAK,SAAW,IAAInB,EACtB,CAWA,SAASoB,GAAYnF,EAAK,CACxB,OAAO,KAAK,SAAS,OAAUA,CAAG,CACpC,CAWA,SAASoF,GAASpF,EAAK,CACrB,OAAO,KAAK,SAAS,IAAIA,CAAG,CAC9B,CAWA,SAASqF,GAASrF,EAAK,CACrB,OAAO,KAAK,SAAS,IAAIA,CAAG,CAC9B,CAYA,SAASsF,GAAStF,EAAKnB,EAAO,CAC5B,IAAI0G,EAAQ,KAAK,SACjB,GAAIA,aAAiBxB,GAAW,CAC9B,IAAIyB,EAAQD,EAAM,SAClB,GAAI,CAAClD,IAAQmD,EAAM,OAAStK,EAAmB,EAC7C,OAAAsK,EAAM,KAAK,CAACxF,EAAKnB,CAAK,CAAC,EAChB,KAET0G,EAAQ,KAAK,SAAW,IAAIhB,GAASiB,CAAK,CAC5C,CACA,OAAAD,EAAM,IAAIvF,EAAKnB,CAAK,EACb,IACT,CAGAoG,GAAM,UAAU,MAAQC,GACxBD,GAAM,UAAU,OAAYE,GAC5BF,GAAM,UAAU,IAAMG,GACtBH,GAAM,UAAU,IAAMI,GACtBJ,GAAM,UAAU,IAAMK,GAYtB,SAASG,GAAc5G,EAAO6G,EAAW,CAGvC,IAAItF,EAAUuF,GAAQ9G,CAAK,GAAK+G,GAAY/G,CAAK,EAC7CqB,GAAUrB,EAAM,OAAQ,MAAM,EAC9B,CAAC,EAEDS,EAASc,EAAO,OAChByF,EAAc,CAAC,CAACvG,EAEpB,QAASU,KAAOnB,GACT6G,GAAatE,GAAe,KAAKvC,EAAOmB,CAAG,IAC5C,EAAE6F,IAAgB7F,GAAO,UAAY8F,GAAQ9F,EAAKV,CAAM,KAC1Dc,EAAO,KAAKJ,CAAG,EAGnB,OAAOI,CACT,CAWA,SAAS2F,GAAiB9F,EAAQD,EAAKnB,EAAO,EACvCA,IAAU7D,GAAa,CAACgL,GAAG/F,EAAOD,GAAMnB,CAAK,GAC7C,OAAOmB,GAAO,UAAYnB,IAAU7D,GAAa,EAAEgF,KAAOC,MAC7DA,EAAOD,GAAOnB,EAElB,CAYA,SAASoH,GAAYhG,EAAQD,EAAKnB,EAAO,CACvC,IAAIqH,EAAWjG,EAAOD,IAClB,EAAEoB,GAAe,KAAKnB,EAAQD,CAAG,GAAKgG,GAAGE,EAAUrH,CAAK,IACvDA,IAAU7D,GAAa,EAAEgF,KAAOC,MACnCA,EAAOD,GAAOnB,EAElB,CAUA,SAASqF,GAAa/E,EAAOa,EAAK,CAEhC,QADIV,EAASH,EAAM,OACZG,KACL,GAAI0G,GAAG7G,EAAMG,GAAQ,GAAIU,CAAG,EAC1B,OAAOV,EAGX,MAAO,EACT,CAWA,SAAS6G,GAAWlG,EAAQmG,EAAQ,CAClC,OAAOnG,GAAUoG,GAAWD,EAAQE,GAAKF,CAAM,EAAGnG,CAAM,CAC1D,CAgBA,SAASsG,GAAU1H,EAAO2H,EAAQC,EAAQC,EAAY1G,EAAKC,EAAQ0G,EAAO,CACxE,IAAIvG,EAIJ,GAHIsG,IACFtG,EAASH,EAASyG,EAAW7H,EAAOmB,EAAKC,EAAQ0G,CAAK,EAAID,EAAW7H,CAAK,GAExEuB,IAAWpF,EACb,OAAOoF,EAET,GAAI,CAACwG,GAAS/H,CAAK,EACjB,OAAOA,EAET,IAAIgI,EAAQlB,GAAQ9G,CAAK,EACzB,GAAIgI,GAEF,GADAzG,EAAS0G,GAAejI,CAAK,EACzB,CAAC2H,EACH,OAAOO,GAAUlI,EAAOuB,CAAM,MAE3B,CACL,IAAI4G,EAAMC,GAAOpI,CAAK,EAClBqI,EAASF,GAAOlL,GAAWkL,GAAOjL,EAEtC,GAAIoL,GAAStI,CAAK,EAChB,OAAOuI,GAAYvI,EAAO2H,CAAM,EAElC,GAAIQ,GAAO9K,GAAa8K,GAAOvL,GAAYyL,GAAU,CAACjH,EAAS,CAC7D,GAAIM,GAAa1B,CAAK,EACpB,OAAOoB,EAASpB,EAAQ,CAAC,EAG3B,GADAuB,EAASiH,GAAgBH,EAAS,CAAC,EAAIrI,CAAK,EACxC,CAAC2H,EACH,OAAOc,GAAYzI,EAAOsH,GAAW/F,EAAQvB,CAAK,CAAC,CAEvD,KAAO,CACL,GAAI,CAACf,EAAckJ,GACjB,OAAO/G,EAASpB,EAAQ,CAAC,EAE3BuB,EAASmH,GAAe1I,EAAOmI,EAAKT,GAAWC,CAAM,CACvD,CACF,CAEAG,IAAUA,EAAQ,IAAI1B,IACtB,IAAIuC,EAAUb,EAAM,IAAI9H,CAAK,EAC7B,GAAI2I,EACF,OAAOA,EAIT,GAFAb,EAAM,IAAI9H,EAAOuB,CAAM,EAEnB,CAACyG,EACH,IAAIY,EAAQhB,EAASiB,GAAW7I,CAAK,EAAIyH,GAAKzH,CAAK,EAErD,OAAAK,GAAUuI,GAAS5I,EAAO,SAAS8I,GAAU3H,EAAK,CAC5CyH,IACFzH,EAAM2H,GACNA,GAAW9I,EAAMmB,IAGnBiG,GAAY7F,EAAQJ,EAAKuG,GAAUoB,GAAUnB,EAAQC,EAAQC,EAAY1G,EAAKnB,EAAO8H,CAAK,CAAC,CAC7F,CAAC,EACMvG,CACT,CAUA,SAASwH,GAAWC,EAAO,CACzB,OAAOjB,GAASiB,CAAK,EAAIjG,GAAaiG,CAAK,EAAI,CAAC,CAClD,CAUA,IAAIC,GAAWC,GAAeC,EAAU,EAapCC,GAAUC,GAAc,EAU5B,SAASF,GAAW/H,EAAQb,EAAU,CACpC,OAAOa,GAAUgI,GAAQhI,EAAQb,EAAUkH,EAAI,CACjD,CAUA,SAAS6B,GAAQlI,EAAQmI,EAAM,CAC7BA,EAAOC,GAAMD,EAAMnI,CAAM,EAAI,CAACmI,CAAI,EAAIE,GAASF,CAAI,EAKnD,QAHI/I,EAAQ,EACRC,EAAS8I,EAAK,OAEXnI,GAAU,MAAQZ,EAAQC,GAC/BW,EAASA,EAAOsI,GAAMH,EAAK/I,IAAQ,GAErC,OAAQA,GAASA,GAASC,EAAUW,EAASjF,CAC/C,CAaA,SAASwN,GAAevI,EAAQwI,EAAUC,EAAa,CACrD,IAAItI,EAASqI,EAASxI,CAAM,EAC5B,OAAO0F,GAAQ1F,CAAM,EAAIG,EAASb,GAAUa,EAAQsI,EAAYzI,CAAM,CAAC,CACzE,CASA,SAAS0I,GAAW9J,EAAO,CACzB,OAAOyC,GAAe,KAAKzC,CAAK,CAClC,CAUA,SAAS+J,GAAU3I,EAAQD,EAAK,CAC9B,OAAOC,GAAU,MAAQD,KAAO,OAAOC,CAAM,CAC/C,CAiBA,SAAS4I,GAAYhK,EAAOiK,EAAOpC,EAAYqC,EAASpC,EAAO,CAC7D,OAAI9H,IAAUiK,EACL,GAELjK,GAAS,MAAQiK,GAAS,MAAS,CAAClC,GAAS/H,CAAK,GAAK,CAACmK,GAAaF,CAAK,EACrEjK,IAAUA,GAASiK,IAAUA,EAE/BG,GAAgBpK,EAAOiK,EAAOD,GAAanC,EAAYqC,EAASpC,CAAK,CAC9E,CAiBA,SAASsC,GAAgBhJ,EAAQ6I,EAAOI,EAAWxC,EAAYqC,EAASpC,EAAO,CAC7E,IAAIwC,EAAWxD,GAAQ1F,CAAM,EACzBmJ,EAAWzD,GAAQmD,CAAK,EACxBO,EAAS3N,EACT4N,EAAS5N,EAERyN,IACHE,EAASpC,GAAOhH,CAAM,EACtBoJ,EAASA,GAAU5N,EAAUS,EAAYmN,GAEtCD,IACHE,EAASrC,GAAO6B,CAAK,EACrBQ,EAASA,GAAU7N,EAAUS,EAAYoN,GAE3C,IAAIC,EAAWF,GAAUnN,GAAa,CAACqE,GAAaN,CAAM,EACtDuJ,EAAWF,GAAUpN,GAAa,CAACqE,GAAauI,CAAK,EACrDW,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa,CAACF,EAChB,OAAA5C,IAAUA,EAAQ,IAAI1B,IACdkE,GAAYO,GAAazJ,CAAM,EACnC0J,GAAY1J,EAAQ6I,EAAOI,EAAWxC,EAAYqC,EAASpC,CAAK,EAChEiD,GAAW3J,EAAQ6I,EAAOO,EAAQH,EAAWxC,EAAYqC,EAASpC,CAAK,EAE7E,GAAI,EAAEoC,EAAUzN,GAAuB,CACrC,IAAIuO,GAAeN,GAAYnI,GAAe,KAAKnB,EAAQ,aAAa,EACpE6J,EAAeN,GAAYpI,GAAe,KAAK0H,EAAO,aAAa,EAEvE,GAAIe,IAAgBC,EAAc,CAChC,IAAIC,GAAeF,GAAe5J,EAAO,MAAM,EAAIA,EAC/C+J,GAAeF,EAAehB,EAAM,MAAM,EAAIA,EAElD,OAAAnC,IAAUA,EAAQ,IAAI1B,IACfiE,EAAUa,GAAcC,GAActD,EAAYqC,EAASpC,CAAK,CACzE,CACF,CACA,OAAK8C,GAGL9C,IAAUA,EAAQ,IAAI1B,IACfgF,GAAahK,EAAQ6I,EAAOI,EAAWxC,EAAYqC,EAASpC,CAAK,GAH/D,EAIX,CAYA,SAASuD,GAAYjK,EAAQmG,EAAQ+D,EAAWzD,EAAY,CAC1D,IAAIrH,EAAQ8K,EAAU,OAClB7K,EAASD,EACT+K,EAAe,CAAC1D,EAEpB,GAAIzG,GAAU,KACZ,MAAO,CAACX,EAGV,IADAW,EAAS,OAAOA,CAAM,EACfZ,KAAS,CACd,IAAIuE,EAAOuG,EAAU9K,GACrB,GAAK+K,GAAgBxG,EAAK,GAClBA,EAAK,KAAO3D,EAAO2D,EAAK,IACxB,EAAEA,EAAK,KAAM3D,GAEnB,MAAO,EAEX,CACA,KAAO,EAAEZ,EAAQC,GAAQ,CACvBsE,EAAOuG,EAAU9K,GACjB,IAAIW,EAAM4D,EAAK,GACXsC,EAAWjG,EAAOD,GAClBqK,EAAWzG,EAAK,GAEpB,GAAIwG,GAAgBxG,EAAK,IACvB,GAAIsC,IAAalL,GAAa,EAAEgF,KAAOC,GACrC,MAAO,OAEJ,CACL,IAAI0G,EAAQ,IAAI1B,GAChB,GAAIyB,EACF,IAAItG,EAASsG,EAAWR,EAAUmE,EAAUrK,EAAKC,EAAQmG,EAAQO,CAAK,EAExE,GAAI,EAAEvG,IAAWpF,EACT6N,GAAYwB,EAAUnE,EAAUQ,EAAYrL,EAAyBC,EAAsBqL,CAAK,EAChGvG,GAEN,MAAO,EAEX,CACF,CACA,MAAO,EACT,CAUA,SAASkK,GAAazL,EAAO,CAC3B,GAAI,CAAC+H,GAAS/H,CAAK,GAAK0L,GAAS1L,CAAK,EACpC,MAAO,GAET,IAAI2L,EAAWC,GAAW5L,CAAK,GAAK0B,GAAa1B,CAAK,EAAK0C,GAAa5D,EACxE,OAAO6M,EAAQ,KAAK3H,GAAShE,CAAK,CAAC,CACrC,CASA,SAAS6L,GAAiB7L,EAAO,CAC/B,OAAOmK,GAAanK,CAAK,GACvB8L,GAAS9L,EAAM,MAAM,GAAK,CAAC,CAAChB,EAAeyD,GAAe,KAAKzC,CAAK,EACxE,CASA,SAAS+L,GAAa/L,EAAO,CAG3B,OAAI,OAAOA,GAAS,WACXA,EAELA,GAAS,KACJgM,GAEL,OAAOhM,GAAS,SACX8G,GAAQ9G,CAAK,EAChBiM,GAAoBjM,EAAM,GAAIA,EAAM,EAAE,EACtCkM,GAAYlM,CAAK,EAEhBmM,GAASnM,CAAK,CACvB,CASA,SAASoM,GAAShL,EAAQ,CACxB,GAAI,CAACiL,GAAYjL,CAAM,EACrB,OAAOgC,GAAWhC,CAAM,EAE1B,IAAIG,EAAS,CAAC,EACd,QAASJ,KAAO,OAAOC,CAAM,EACvBmB,GAAe,KAAKnB,EAAQD,CAAG,GAAKA,GAAO,eAC7CI,EAAO,KAAKJ,CAAG,EAGnB,OAAOI,CACT,CASA,SAAS+K,GAAWlL,EAAQ,CAC1B,GAAI,CAAC2G,GAAS3G,CAAM,EAClB,OAAOmL,GAAanL,CAAM,EAE5B,IAAIoL,EAAUH,GAAYjL,CAAM,EAC5BG,EAAS,CAAC,EAEd,QAASJ,KAAOC,EACRD,GAAO,gBAAkBqL,GAAW,CAACjK,GAAe,KAAKnB,EAAQD,CAAG,IACxEI,EAAO,KAAKJ,CAAG,EAGnB,OAAOI,CACT,CASA,SAAS2K,GAAY3E,EAAQ,CAC3B,IAAI+D,EAAYmB,GAAalF,CAAM,EACnC,OAAI+D,EAAU,QAAU,GAAKA,EAAU,GAAG,GACjCoB,GAAwBpB,EAAU,GAAG,GAAIA,EAAU,GAAG,EAAE,EAE1D,SAASlK,EAAQ,CACtB,OAAOA,IAAWmG,GAAU8D,GAAYjK,EAAQmG,EAAQ+D,CAAS,CACnE,CACF,CAUA,SAASW,GAAoB1C,EAAMiC,EAAU,CAC3C,OAAIhC,GAAMD,CAAI,GAAKoD,GAAmBnB,CAAQ,EACrCkB,GAAwBhD,GAAMH,CAAI,EAAGiC,CAAQ,EAE/C,SAASpK,EAAQ,CACtB,IAAIiG,EAAWuF,GAAIxL,EAAQmI,CAAI,EAC/B,OAAQlC,IAAalL,GAAakL,IAAamE,EAC3CqB,GAAMzL,EAAQmI,CAAI,EAClBS,GAAYwB,EAAUnE,EAAUlL,EAAWK,EAAyBC,CAAoB,CAC9F,CACF,CAaA,SAASqQ,GAAU1L,EAAQmG,EAAQwF,EAAUlF,EAAYC,EAAO,CAC9D,GAAI1G,IAAWmG,EAGf,IAAI,EAAET,GAAQS,CAAM,GAAKsD,GAAatD,CAAM,GAC1C,IAAIqB,EAAQ0D,GAAW/E,CAAM,EAE/BlH,GAAUuI,GAASrB,EAAQ,SAASiE,EAAUrK,EAAK,CAKjD,GAJIyH,IACFzH,EAAMqK,EACNA,EAAWjE,EAAOpG,IAEhB4G,GAASyD,CAAQ,EACnB1D,IAAUA,EAAQ,IAAI1B,IACtB4G,GAAc5L,EAAQmG,EAAQpG,EAAK4L,EAAUD,GAAWjF,EAAYC,CAAK,MAEtE,CACH,IAAImF,EAAWpF,EACXA,EAAWzG,EAAOD,GAAMqK,EAAWrK,EAAM,GAAKC,EAAQmG,EAAQO,CAAK,EACnE3L,EAEA8Q,IAAa9Q,IACf8Q,EAAWzB,GAEbtE,GAAiB9F,EAAQD,EAAK8L,CAAQ,CACxC,CACF,CAAC,EACH,CAiBA,SAASD,GAAc5L,EAAQmG,EAAQpG,EAAK4L,EAAUG,EAAWrF,EAAYC,EAAO,CAClF,IAAIT,EAAWjG,EAAOD,GAClBqK,EAAWjE,EAAOpG,GAClBwH,EAAUb,EAAM,IAAI0D,CAAQ,EAEhC,GAAI7C,EAAS,CACXzB,GAAiB9F,EAAQD,EAAKwH,CAAO,EACrC,MACF,CACA,IAAIsE,EAAWpF,EACXA,EAAWR,EAAUmE,EAAWrK,EAAM,GAAKC,EAAQmG,EAAQO,CAAK,EAChE3L,EAEAgR,EAAWF,IAAa9Q,EAExBgR,IACFF,EAAWzB,EACP1E,GAAQ0E,CAAQ,GAAKX,GAAaW,CAAQ,EACxC1E,GAAQO,CAAQ,EAClB4F,EAAW5F,EAEJ+F,GAAkB/F,CAAQ,EACjC4F,EAAW/E,GAAUb,CAAQ,GAG7B8F,EAAW,GACXF,EAAWvF,GAAU8D,EAAU,EAAI,GAG9B6B,GAAc7B,CAAQ,GAAKzE,GAAYyE,CAAQ,EAClDzE,GAAYM,CAAQ,EACtB4F,EAAWK,GAAcjG,CAAQ,EAE1B,CAACU,GAASV,CAAQ,GAAM0F,GAAYnB,GAAWvE,CAAQ,GAC9D8F,EAAW,GACXF,EAAWvF,GAAU8D,EAAU,EAAI,GAGnCyB,EAAW5F,EAIb8F,EAAW,IAGXA,IAEFrF,EAAM,IAAI0D,EAAUyB,CAAQ,EAC5BC,EAAUD,EAAUzB,EAAUuB,EAAUlF,EAAYC,CAAK,EACzDA,EAAM,OAAU0D,CAAQ,GAE1BtE,GAAiB9F,EAAQD,EAAK8L,CAAQ,CACxC,CASA,SAASM,GAAiBhE,EAAM,CAC9B,OAAO,SAASnI,EAAQ,CACtB,OAAOkI,GAAQlI,EAAQmI,CAAI,CAC7B,CACF,CAUA,SAASiE,GAAStN,EAAMuN,EAAO,CAC7B,OAAAA,EAAQpK,GAAUoK,IAAUtR,EAAa+D,EAAK,OAAS,EAAKuN,EAAO,CAAC,EAC7D,UAAW,CAMhB,QALIrN,EAAO,UACPI,EAAQ,GACRC,EAAS4C,GAAUjD,EAAK,OAASqN,EAAO,CAAC,EACzCnN,EAAQ,MAAMG,CAAM,EAEjB,EAAED,EAAQC,GACfH,EAAME,GAASJ,EAAKqN,EAAQjN,GAE9BA,EAAQ,GAER,QADIkN,EAAY,MAAMD,EAAQ,CAAC,EACxB,EAAEjN,EAAQiN,GACfC,EAAUlN,GAASJ,EAAKI,GAE1B,OAAAkN,EAAUD,GAASnN,EACZL,EAAMC,EAAM,KAAMwN,CAAS,CACpC,CACF,CAUA,SAASC,GAAa3N,EAAO,CAE3B,GAAI,OAAOA,GAAS,SAClB,OAAOA,EAET,GAAI4N,GAAS5N,CAAK,EAChB,OAAOuE,GAAiBA,GAAe,KAAKvE,CAAK,EAAI,GAEvD,IAAIuB,EAAUvB,EAAQ,GACtB,OAAQuB,GAAU,KAAQ,EAAIvB,GAAU,CAACtD,EAAY,KAAO6E,CAC9D,CASA,SAASkI,GAASzJ,EAAO,CACvB,OAAO8G,GAAQ9G,CAAK,EAAIA,EAAQ6N,GAAa7N,CAAK,CACpD,CAUA,SAASuI,GAAYuF,EAAQnG,EAAQ,CACnC,GAAIA,EACF,OAAOmG,EAAO,MAAM,EAEtB,IAAIvM,EAAS,IAAIuM,EAAO,YAAYA,EAAO,MAAM,EACjD,OAAAA,EAAO,KAAKvM,CAAM,EACXA,CACT,CASA,SAASwM,GAAiBC,EAAa,CACrC,IAAIzM,EAAS,IAAIyM,EAAY,YAAYA,EAAY,UAAU,EAC/D,WAAInL,GAAWtB,CAAM,EAAE,IAAI,IAAIsB,GAAWmL,CAAW,CAAC,EAC/CzM,CACT,CAUA,SAAS0M,GAAcC,EAAUvG,EAAQ,CACvC,IAAImG,EAASnG,EAASoG,GAAiBG,EAAS,MAAM,EAAIA,EAAS,OACnE,OAAO,IAAIA,EAAS,YAAYJ,EAAQI,EAAS,WAAYA,EAAS,UAAU,CAClF,CAWA,SAASC,GAASvO,EAAK+H,EAAQyG,EAAW,CACxC,IAAI9N,EAAQqH,EAASyG,EAAUzM,GAAW/B,CAAG,EAAG,EAAI,EAAI+B,GAAW/B,CAAG,EACtE,OAAOiB,GAAYP,EAAOX,GAAa,IAAIC,EAAI,WAAW,CAC5D,CASA,SAASyO,GAAYC,EAAQ,CAC3B,IAAI/M,EAAS,IAAI+M,EAAO,YAAYA,EAAO,OAAQzP,EAAQ,KAAKyP,CAAM,CAAC,EACvE,OAAA/M,EAAO,UAAY+M,EAAO,UACnB/M,CACT,CAWA,SAASgN,GAASxO,EAAK4H,EAAQyG,EAAW,CACxC,IAAI9N,EAAQqH,EAASyG,EAAUrM,GAAWhC,CAAG,EAAG,EAAI,EAAIgC,GAAWhC,CAAG,EACtE,OAAOc,GAAYP,EAAOR,GAAa,IAAIC,EAAI,WAAW,CAC5D,CASA,SAASyO,GAAYC,EAAQ,CAC3B,OAAOnK,GAAgB,OAAOA,GAAc,KAAKmK,CAAM,CAAC,EAAI,CAAC,CAC/D,CAUA,SAASC,GAAgBC,EAAYhH,EAAQ,CAC3C,IAAImG,EAASnG,EAASoG,GAAiBY,EAAW,MAAM,EAAIA,EAAW,OACvE,OAAO,IAAIA,EAAW,YAAYb,EAAQa,EAAW,WAAYA,EAAW,MAAM,CACpF,CAUA,SAASzG,GAAUX,EAAQjH,EAAO,CAChC,IAAIE,EAAQ,GACRC,EAAS8G,EAAO,OAGpB,IADAjH,IAAUA,EAAQ,MAAMG,CAAM,GACvB,EAAED,EAAQC,GACfH,EAAME,GAAS+G,EAAO/G,GAExB,OAAOF,CACT,CAYA,SAASkH,GAAWD,EAAQqB,EAAOxH,EAAQyG,EAAY,CACrDzG,IAAWA,EAAS,CAAC,GAKrB,QAHIZ,EAAQ,GACRC,EAASmI,EAAM,OAEZ,EAAEpI,EAAQC,GAAQ,CACvB,IAAIU,EAAMyH,EAAMpI,GAEZyM,EAAWpF,EACXA,EAAWzG,EAAOD,GAAMoG,EAAOpG,GAAMA,EAAKC,EAAQmG,CAAM,EACxDpL,EAEJiL,GAAYhG,EAAQD,EAAK8L,IAAa9Q,EAAYoL,EAAOpG,GAAO8L,CAAQ,CAC1E,CACA,OAAO7L,CACT,CAUA,SAASqH,GAAYlB,EAAQnG,EAAQ,CACnC,OAAOoG,GAAWD,EAAQqH,GAAWrH,CAAM,EAAGnG,CAAM,CACtD,CASA,SAASyN,GAAeC,EAAU,CAChC,OAAOtB,GAAS,SAASpM,EAAQ2N,EAAS,CACxC,IAAIvO,EAAQ,GACRC,EAASsO,EAAQ,OACjBlH,EAAapH,EAAS,EAAIsO,EAAQtO,EAAS,GAAKtE,EAChD6S,EAAQvO,EAAS,EAAIsO,EAAQ,GAAK5S,EAWtC,IATA0L,EAAciH,EAAS,OAAS,GAAK,OAAOjH,GAAc,YACrDpH,IAAUoH,GACX1L,EAEA6S,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,CAAK,IACvDnH,EAAapH,EAAS,EAAItE,EAAY0L,EACtCpH,EAAS,GAEXW,EAAS,OAAOA,CAAM,EACf,EAAEZ,EAAQC,GAAQ,CACvB,IAAI8G,EAASwH,EAAQvO,GACjB+G,GACFuH,EAAS1N,EAAQmG,EAAQ/G,EAAOqH,CAAU,CAE9C,CACA,OAAOzG,CACT,CAAC,CACH,CAUA,SAAS8H,GAAegG,EAAUC,EAAW,CAC3C,OAAO,SAASC,EAAY7O,EAAU,CACpC,GAAI6O,GAAc,KAChB,OAAOA,EAET,GAAI,CAACC,GAAYD,CAAU,EACzB,OAAOF,EAASE,EAAY7O,CAAQ,EAMtC,QAJIE,EAAS2O,EAAW,OACpB5O,EAAQ2O,EAAY1O,EAAS,GAC7B6O,EAAW,OAAOF,CAAU,GAExBD,EAAY3O,IAAU,EAAEA,EAAQC,IAClCF,EAAS+O,EAAS9O,GAAQA,EAAO8O,CAAQ,IAAM,IAAnD,CAIF,OAAOF,CACT,CACF,CASA,SAAS/F,GAAc8F,EAAW,CAChC,OAAO,SAAS/N,EAAQb,EAAUqJ,EAAU,CAM1C,QALIpJ,EAAQ,GACR8O,EAAW,OAAOlO,CAAM,EACxBwH,EAAQgB,EAASxI,CAAM,EACvBX,EAASmI,EAAM,OAEZnI,KAAU,CACf,IAAIU,EAAMyH,EAAMuG,EAAY1O,EAAS,EAAED,GACvC,GAAID,EAAS+O,EAASnO,GAAMA,EAAKmO,CAAQ,IAAM,GAC7C,KAEJ,CACA,OAAOlO,CACT,CACF,CAgBA,SAAS0J,GAAYxK,EAAO2J,EAAOI,EAAWxC,EAAYqC,EAASpC,EAAO,CACxE,IAAIyH,EAAYrF,EAAUzN,EACtB+S,EAAYlP,EAAM,OAClBmP,EAAYxF,EAAM,OAEtB,GAAIuF,GAAaC,GAAa,EAAEF,GAAaE,EAAYD,GACvD,MAAO,GAGT,IAAI7G,EAAUb,EAAM,IAAIxH,CAAK,EAC7B,GAAIqI,GAAWb,EAAM,IAAImC,CAAK,EAC5B,OAAOtB,GAAWsB,EAEpB,IAAIzJ,EAAQ,GACRe,EAAS,GACTmO,EAAQxF,EAAU1N,EAA0B,IAAIyJ,GAAW9J,EAM/D,IAJA2L,EAAM,IAAIxH,EAAO2J,CAAK,EACtBnC,EAAM,IAAImC,EAAO3J,CAAK,EAGf,EAAEE,EAAQgP,GAAW,CAC1B,IAAIG,GAAWrP,EAAME,GACjBoP,EAAW3F,EAAMzJ,GAErB,GAAIqH,EACF,IAAIgI,GAAWN,EACX1H,EAAW+H,EAAUD,GAAUnP,EAAOyJ,EAAO3J,EAAOwH,CAAK,EACzDD,EAAW8H,GAAUC,EAAUpP,EAAOF,EAAO2J,EAAOnC,CAAK,EAE/D,GAAI+H,KAAa1T,EAAW,CAC1B,GAAI0T,GACF,SAEFtO,EAAS,GACT,KACF,CAEA,GAAImO,GACF,GAAI,CAAC1O,GAAUiJ,EAAO,SAAS2F,GAAUE,GAAU,CAC7C,GAAI,CAACJ,EAAK,IAAII,EAAQ,IACjBH,KAAaC,IAAYvF,EAAUsF,GAAUC,GAAU/H,EAAYqC,EAASpC,CAAK,GACpF,OAAO4H,EAAK,IAAII,EAAQ,CAE5B,CAAC,EAAG,CACNvO,EAAS,GACT,KACF,UACS,EACLoO,KAAaC,GACXvF,EAAUsF,GAAUC,EAAU/H,EAAYqC,EAASpC,CAAK,GACzD,CACLvG,EAAS,GACT,KACF,CACF,CACA,OAAAuG,EAAM,OAAUxH,CAAK,EACrBwH,EAAM,OAAUmC,CAAK,EACd1I,CACT,CAoBA,SAASwJ,GAAW3J,EAAQ6I,EAAO9B,EAAKkC,EAAWxC,EAAYqC,EAASpC,EAAO,CAC7E,OAAQK,EAAK,CACX,KAAKtK,EACH,GAAKuD,EAAO,YAAc6I,EAAM,YAC3B7I,EAAO,YAAc6I,EAAM,WAC9B,MAAO,GAET7I,EAASA,EAAO,OAChB6I,EAAQA,EAAM,OAEhB,KAAKrM,EACH,MAAK,EAAAwD,EAAO,YAAc6I,EAAM,YAC5B,CAACI,EAAU,IAAIxH,GAAWzB,CAAM,EAAG,IAAIyB,GAAWoH,CAAK,CAAC,GAK9D,KAAKnN,EACL,KAAKC,EACL,KAAKK,EAGH,OAAO+J,GAAG,CAAC/F,EAAQ,CAAC6I,CAAK,EAE3B,KAAKjN,EACH,OAAOoE,EAAO,MAAQ6I,EAAM,MAAQ7I,EAAO,SAAW6I,EAAM,QAE9D,KAAK1M,EACL,KAAKE,EAIH,OAAO2D,GAAW6I,EAAQ,GAE5B,KAAK9M,EACH,IAAI4S,EAAUpO,GAEhB,KAAKnE,EACH,IAAI+R,EAAYrF,EAAUzN,EAG1B,GAFAsT,IAAYA,EAAUhO,IAElBX,EAAO,MAAQ6I,EAAM,MAAQ,CAACsF,EAChC,MAAO,GAGT,IAAI5G,EAAUb,EAAM,IAAI1G,CAAM,EAC9B,GAAIuH,EACF,OAAOA,GAAWsB,EAEpBC,GAAW1N,EAGXsL,EAAM,IAAI1G,EAAQ6I,CAAK,EACvB,IAAI1I,EAASuJ,GAAYiF,EAAQ3O,CAAM,EAAG2O,EAAQ9F,CAAK,EAAGI,EAAWxC,EAAYqC,EAASpC,CAAK,EAC/F,OAAAA,EAAM,OAAU1G,CAAM,EACfG,EAET,KAAK7D,EACH,GAAI4G,GACF,OAAOA,GAAc,KAAKlD,CAAM,GAAKkD,GAAc,KAAK2F,CAAK,CAEnE,CACA,MAAO,EACT,CAgBA,SAASmB,GAAahK,EAAQ6I,EAAOI,EAAWxC,EAAYqC,EAASpC,EAAO,CAC1E,IAAIyH,EAAYrF,EAAUzN,EACtBuT,EAAWvI,GAAKrG,CAAM,EACtB6O,EAAYD,EAAS,OACrBE,EAAWzI,GAAKwC,CAAK,EACrBwF,EAAYS,EAAS,OAEzB,GAAID,GAAaR,GAAa,CAACF,EAC7B,MAAO,GAGT,QADI/O,EAAQyP,EACLzP,KAAS,CACd,IAAIW,EAAM6O,EAASxP,GACnB,GAAI,EAAE+O,EAAYpO,KAAO8I,EAAQ1H,GAAe,KAAK0H,EAAO9I,CAAG,GAC7D,MAAO,EAEX,CAEA,IAAIwH,GAAUb,EAAM,IAAI1G,CAAM,EAC9B,GAAIuH,IAAWb,EAAM,IAAImC,CAAK,EAC5B,OAAOtB,IAAWsB,EAEpB,IAAI1I,EAAS,GACbuG,EAAM,IAAI1G,EAAQ6I,CAAK,EACvBnC,EAAM,IAAImC,EAAO7I,CAAM,EAGvB,QADI+O,GAAWZ,EACR,EAAE/O,EAAQyP,GAAW,CAC1B9O,EAAM6O,EAASxP,GACf,IAAI6G,GAAWjG,EAAOD,GAClByO,GAAW3F,EAAM9I,GAErB,GAAI0G,EACF,IAAIgI,GAAWN,EACX1H,EAAW+H,GAAUvI,GAAUlG,EAAK8I,EAAO7I,EAAQ0G,CAAK,EACxDD,EAAWR,GAAUuI,GAAUzO,EAAKC,EAAQ6I,EAAOnC,CAAK,EAG9D,GAAI,EAAE+H,KAAa1T,EACVkL,KAAauI,IAAYvF,EAAUhD,GAAUuI,GAAU/H,EAAYqC,EAASpC,CAAK,EAClF+H,IACD,CACLtO,EAAS,GACT,KACF,CACA4O,KAAaA,GAAWhP,GAAO,cACjC,CACA,GAAII,GAAU,CAAC4O,GAAU,CACvB,IAAIC,GAAUhP,EAAO,YACjBiP,GAAUpG,EAAM,YAGhBmG,IAAWC,IACV,gBAAiBjP,GAAU,gBAAiB6I,GAC7C,EAAE,OAAOmG,IAAW,YAAcA,cAAmBA,IACnD,OAAOC,IAAW,YAAcA,cAAmBA,MACvD9O,EAAS,GAEb,CACA,OAAAuG,EAAM,OAAU1G,CAAM,EACtB0G,EAAM,OAAUmC,CAAK,EACd1I,CACT,CASA,SAASsH,GAAWzH,EAAQ,CAC1B,OAAOuI,GAAevI,EAAQqG,GAAMmH,EAAU,CAChD,CAaA,SAAS0B,IAAc,CACrB,IAAI/O,EAASiD,EAAO,UAAYjE,GAChC,OAAAgB,EAASA,IAAWhB,GAAWwL,GAAexK,EACvC,UAAU,OAASA,EAAO,UAAU,GAAI,UAAU,EAAE,EAAIA,CACjE,CAUA,SAASsE,GAAWjG,EAAKuB,EAAK,CAC5B,IAAI4D,EAAOnF,EAAI,SACf,OAAO2Q,GAAUpP,CAAG,EAChB4D,EAAK,OAAO5D,GAAO,SAAW,SAAW,QACzC4D,EAAK,GACX,CASA,SAAS0H,GAAarL,EAAQ,CAI5B,QAHIG,EAASkG,GAAKrG,CAAM,EACpBX,EAASc,EAAO,OAEbd,KAAU,CACf,IAAIU,EAAMI,EAAOd,GACbT,EAAQoB,EAAOD,GAEnBI,EAAOd,GAAU,CAACU,EAAKnB,EAAO2M,GAAmB3M,CAAK,CAAC,CACzD,CACA,OAAOuB,CACT,CAUA,SAASgC,GAAUnC,EAAQD,EAAK,CAC9B,IAAInB,EAAQyB,GAASL,EAAQD,CAAG,EAChC,OAAOsK,GAAazL,CAAK,EAAIA,EAAQ7D,CACvC,CASA,IAAIyS,GAAa1L,GAAmBtB,GAAQsB,GAAkB,MAAM,EAAIsN,GASpEpI,GAAS0B,IAIRxG,IAAY8E,GAAO,IAAI9E,GAAS,IAAI,YAAY,CAAC,CAAC,CAAC,GAAKzF,GACxD2F,IAAO4E,GAAO,IAAI5E,EAAG,GAAKrG,GAC1BsG,IAAW2E,GAAO3E,GAAQ,QAAQ,CAAC,GAAKnG,GACxCoG,IAAO0E,GAAO,IAAI1E,EAAG,GAAKlG,GAC1BmG,IAAWyE,GAAO,IAAIzE,EAAO,GAAKhG,KACrCyK,GAAS,SAASpI,EAAO,CACvB,IAAIuB,EAASkB,GAAe,KAAKzC,CAAK,EAClCyQ,EAAOlP,GAAUlE,EAAY2C,EAAM,YAAc7D,EACjDuU,EAAaD,EAAOzM,GAASyM,CAAI,EAAItU,EAEzC,GAAIuU,EACF,OAAQA,EAAY,CAClB,KAAK3M,GAAoB,OAAOlG,EAChC,KAAKoG,GAAe,OAAO9G,EAC3B,KAAK+G,GAAmB,OAAO5G,EAC/B,KAAK6G,GAAe,OAAO3G,EAC3B,KAAK4G,GAAmB,OAAOzG,CACjC,CAEF,OAAO4D,CACT,GAYF,SAASoP,GAAQvP,EAAQmI,EAAMqH,EAAS,CACtCrH,EAAOC,GAAMD,EAAMnI,CAAM,EAAI,CAACmI,CAAI,EAAIE,GAASF,CAAI,EAMnD,QAJIhI,EACAf,EAAQ,GACRC,EAAS8I,EAAK,OAEX,EAAE/I,EAAQC,GAAQ,CACvB,IAAIU,EAAMuI,GAAMH,EAAK/I,EAAM,EAC3B,GAAI,EAAEe,EAASH,GAAU,MAAQwP,EAAQxP,EAAQD,CAAG,GAClD,MAEFC,EAASA,EAAOD,EAClB,CACA,GAAII,EACF,OAAOA,EAET,IAAId,EAASW,EAASA,EAAO,OAAS,EACtC,MAAO,CAAC,CAACX,GAAUqL,GAASrL,CAAM,GAAKwG,GAAQ9F,EAAKV,CAAM,IACvDqG,GAAQ1F,CAAM,GAAK2F,GAAY3F,CAAM,EAC1C,CASA,SAAS6G,GAAe3H,EAAO,CAC7B,IAAIG,EAASH,EAAM,OACfiB,EAASjB,EAAM,YAAYG,CAAM,EAGrC,OAAIA,GAAU,OAAOH,EAAM,IAAM,UAAYiC,GAAe,KAAKjC,EAAO,OAAO,IAC7EiB,EAAO,MAAQjB,EAAM,MACrBiB,EAAO,MAAQjB,EAAM,OAEhBiB,CACT,CASA,SAASiH,GAAgBpH,EAAQ,CAC/B,OAAQ,OAAOA,EAAO,aAAe,YAAc,CAACiL,GAAYjL,CAAM,EAClE2H,GAAWjG,GAAa1B,CAAM,CAAC,EAC/B,CAAC,CACP,CAeA,SAASsH,GAAetH,EAAQ+G,EAAKiG,EAAWzG,EAAQ,CACtD,IAAI8I,EAAOrP,EAAO,YAClB,OAAQ+G,EAAK,CACX,KAAKvK,EACH,OAAOmQ,GAAiB3M,CAAM,EAEhC,KAAKtE,EACL,KAAKC,EACH,OAAO,IAAI0T,EAAK,CAACrP,CAAM,EAEzB,KAAKvD,EACH,OAAOoQ,GAAc7M,EAAQuG,CAAM,EAErC,KAAK7J,EAAY,KAAKC,EACtB,KAAKC,GAAS,KAAKC,EAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAOoQ,GAAgBtN,EAAQuG,CAAM,EAEvC,KAAKxK,EACH,OAAOgR,GAAS/M,EAAQuG,EAAQyG,CAAS,EAE3C,KAAKhR,EACL,KAAKK,EACH,OAAO,IAAIgT,EAAKrP,CAAM,EAExB,KAAK7D,EACH,OAAO8Q,GAAYjN,CAAM,EAE3B,KAAK5D,EACH,OAAO+Q,GAASnN,EAAQuG,EAAQyG,CAAS,EAE3C,KAAK1Q,EACH,OAAO8Q,GAAYpN,CAAM,CAC7B,CACF,CAUA,SAAS6F,GAAQjH,EAAOS,EAAQ,CAC9B,OAAAA,EAASA,GAAiB9D,EACnB,CAAC,CAAC8D,IACN,OAAOT,GAAS,UAAYjB,GAAS,KAAKiB,CAAK,IAC/CA,EAAQ,IAAMA,EAAQ,GAAK,GAAKA,EAAQS,CAC7C,CAYA,SAASwO,GAAejP,EAAOQ,EAAOY,EAAQ,CAC5C,GAAI,CAAC2G,GAAS3G,CAAM,EAClB,MAAO,GAET,IAAIyP,EAAO,OAAOrQ,EAClB,OAAIqQ,GAAQ,SACHxB,GAAYjO,CAAM,GAAK6F,GAAQzG,EAAOY,EAAO,MAAM,EACnDyP,GAAQ,UAAYrQ,KAASY,GAE7B+F,GAAG/F,EAAOZ,GAAQR,CAAK,EAEzB,EACT,CAUA,SAASwJ,GAAMxJ,EAAOoB,EAAQ,CAC5B,GAAI0F,GAAQ9G,CAAK,EACf,MAAO,GAET,IAAI6Q,EAAO,OAAO7Q,EAClB,OAAI6Q,GAAQ,UAAYA,GAAQ,UAAYA,GAAQ,WAChD7Q,GAAS,MAAQ4N,GAAS5N,CAAK,EAC1B,GAEFxB,GAAc,KAAKwB,CAAK,GAAK,CAACzB,GAAa,KAAKyB,CAAK,GACzDoB,GAAU,MAAQpB,KAAS,OAAOoB,CAAM,CAC7C,CASA,SAASmP,GAAUvQ,EAAO,CACxB,IAAI6Q,EAAO,OAAO7Q,EAClB,OAAQ6Q,GAAQ,UAAYA,GAAQ,UAAYA,GAAQ,UAAYA,GAAQ,UACvE7Q,IAAU,YACVA,IAAU,IACjB,CASA,SAAS0L,GAASxL,EAAM,CACtB,MAAO,CAAC,CAACkC,IAAeA,MAAclC,CACxC,CASA,SAASmM,GAAYrM,EAAO,CAC1B,IAAIyQ,EAAOzQ,GAASA,EAAM,YACtBgJ,EAAS,OAAOyH,GAAQ,YAAcA,EAAK,WAAcvO,GAE7D,OAAOlC,IAAUgJ,CACnB,CAUA,SAAS2D,GAAmB3M,EAAO,CACjC,OAAOA,IAAUA,GAAS,CAAC+H,GAAS/H,CAAK,CAC3C,CAWA,SAAS0M,GAAwBvL,EAAKqK,EAAU,CAC9C,OAAO,SAASpK,EAAQ,CACtB,OAAIA,GAAU,KACL,GAEFA,EAAOD,KAASqK,IACpBA,IAAarP,GAAcgF,KAAO,OAAOC,CAAM,EACpD,CACF,CAWA,SAASmL,GAAanL,EAAQ,CAC5B,IAAIG,EAAS,CAAC,EACd,GAAIH,GAAU,KACZ,QAASD,KAAO,OAAOC,CAAM,EAC3BG,EAAO,KAAKJ,CAAG,EAGnB,OAAOI,CACT,CASA,IAAIsM,GAAeiD,GAAQ,SAASC,EAAQ,CAC1CA,EAASC,GAASD,CAAM,EAExB,IAAIxP,EAAS,CAAC,EACd,OAAI9C,GAAa,KAAKsS,CAAM,GAC1BxP,EAAO,KAAK,EAAE,EAEhBwP,EAAO,QAAQrS,GAAY,SAASuS,EAAOC,EAAQC,EAAOJ,EAAQ,CAChExP,EAAO,KAAK4P,EAAQJ,EAAO,QAAQnS,GAAc,IAAI,EAAKsS,GAAUD,CAAM,CAC5E,CAAC,EACM1P,CACT,CAAC,EASD,SAASmI,GAAM1J,EAAO,CACpB,GAAI,OAAOA,GAAS,UAAY4N,GAAS5N,CAAK,EAC5C,OAAOA,EAET,IAAIuB,EAAUvB,EAAQ,GACtB,OAAQuB,GAAU,KAAQ,EAAIvB,GAAU,CAACtD,EAAY,KAAO6E,CAC9D,CASA,SAASyC,GAAS9D,EAAM,CACtB,GAAIA,GAAQ,KAAM,CAChB,GAAI,CACF,OAAOoC,GAAa,KAAKpC,CAAI,CAC/B,MAAE,CAAW,CACb,GAAI,CACF,OAAQA,EAAO,EACjB,MAAE,CAAW,CACf,CACA,MAAO,EACT,CAmBA,SAASkR,GAAQ9Q,EAAO,CAMtB,QALIE,EAAQ,GACRC,EAASH,EAAQA,EAAM,OAAS,EAChC+Q,EAAW,EACX9P,EAAS,CAAC,EAEP,EAAEf,EAAQC,GAAQ,CACvB,IAAIT,EAAQM,EAAME,GACdR,IACFuB,EAAO8P,KAAcrR,EAEzB,CACA,OAAOuB,CACT,CAkCA,SAAS+P,GAAQlC,EAAY7O,EAAU,CACrC,IAAIL,EAAO4G,GAAQsI,CAAU,EAAI/O,GAAY4I,GAC7C,OAAO/I,EAAKkP,EAAYkB,GAAY/P,EAAU,CAAC,CAAC,CAClD,CAgDA,SAASuQ,GAAQ5Q,EAAMqR,EAAU,CAC/B,GAAI,OAAOrR,GAAQ,YAAeqR,GAAY,OAAOA,GAAY,WAC/D,MAAM,IAAI,UAAUjV,CAAe,EAErC,IAAIkV,EAAW,UAAW,CACxB,IAAIpR,EAAO,UACPe,EAAMoQ,EAAWA,EAAS,MAAM,KAAMnR,CAAI,EAAIA,EAAK,GACnDsG,EAAQ8K,EAAS,MAErB,GAAI9K,EAAM,IAAIvF,CAAG,EACf,OAAOuF,EAAM,IAAIvF,CAAG,EAEtB,IAAII,EAASrB,EAAK,MAAM,KAAME,CAAI,EAClC,OAAAoR,EAAS,MAAQ9K,EAAM,IAAIvF,EAAKI,CAAM,EAC/BA,CACT,EACA,OAAAiQ,EAAS,MAAQ,IAAKV,GAAQ,OAASpL,IAChC8L,CACT,CAGAV,GAAQ,MAAQpL,GA8BhB,SAAS+L,GAAMzR,EAAO,CACpB,OAAO0H,GAAU1H,EAAO,GAAO,EAAI,CACrC,CAkCA,SAASmH,GAAGnH,EAAOiK,EAAO,CACxB,OAAOjK,IAAUiK,GAAUjK,IAAUA,GAASiK,IAAUA,CAC1D,CAoBA,SAASlD,GAAY/G,EAAO,CAE1B,OAAOoN,GAAkBpN,CAAK,GAAKuC,GAAe,KAAKvC,EAAO,QAAQ,IACnE,CAACgD,GAAqB,KAAKhD,EAAO,QAAQ,GAAKyC,GAAe,KAAKzC,CAAK,GAAKpD,EAClF,CAyBA,IAAIkK,GAAU,MAAM,QA2BpB,SAASuI,GAAYrP,EAAO,CAC1B,OAAOA,GAAS,MAAQ8L,GAAS9L,EAAM,MAAM,GAAK,CAAC4L,GAAW5L,CAAK,CACrE,CA2BA,SAASoN,GAAkBpN,EAAO,CAChC,OAAOmK,GAAanK,CAAK,GAAKqP,GAAYrP,CAAK,CACjD,CAmBA,IAAIsI,GAAWnF,IAAkBuO,GAmCjC,SAASC,GAAQ3R,EAAO,CACtB,GAAIqP,GAAYrP,CAAK,IAChB8G,GAAQ9G,CAAK,GAAK,OAAOA,GAAS,UACjC,OAAOA,EAAM,QAAU,YAAcsI,GAAStI,CAAK,GAAK+G,GAAY/G,CAAK,GAC7E,MAAO,CAACA,EAAM,OAEhB,IAAImI,EAAMC,GAAOpI,CAAK,EACtB,GAAImI,GAAOhL,GAAUgL,GAAO3K,EAC1B,MAAO,CAACwC,EAAM,KAEhB,GAAI6D,IAAkBwI,GAAYrM,CAAK,EACrC,MAAO,CAACoD,GAAWpD,CAAK,EAAE,OAE5B,QAASmB,KAAOnB,EACd,GAAIuC,GAAe,KAAKvC,EAAOmB,CAAG,EAChC,MAAO,GAGX,MAAO,EACT,CAmBA,SAASyK,GAAW5L,EAAO,CAGzB,IAAImI,EAAMJ,GAAS/H,CAAK,EAAIyC,GAAe,KAAKzC,CAAK,EAAI,GACzD,OAAOmI,GAAOlL,GAAWkL,GAAOjL,CAClC,CA4BA,SAAS4O,GAAS9L,EAAO,CACvB,OAAO,OAAOA,GAAS,UACrBA,EAAQ,IAAMA,EAAQ,GAAK,GAAKA,GAASrD,CAC7C,CA2BA,SAASoL,GAAS/H,EAAO,CACvB,IAAI6Q,EAAO,OAAO7Q,EAClB,MAAO,CAAC,CAACA,IAAU6Q,GAAQ,UAAYA,GAAQ,WACjD,CA0BA,SAAS1G,GAAanK,EAAO,CAC3B,MAAO,CAAC,CAACA,GAAS,OAAOA,GAAS,QACpC,CA8BA,SAASqN,GAAcrN,EAAO,CAC5B,GAAI,CAACmK,GAAanK,CAAK,GACnByC,GAAe,KAAKzC,CAAK,GAAK3C,GAAaqE,GAAa1B,CAAK,EAC/D,MAAO,GAET,IAAIgJ,EAAQlG,GAAa9C,CAAK,EAC9B,GAAIgJ,IAAU,KACZ,MAAO,GAET,IAAIyH,EAAOlO,GAAe,KAAKyG,EAAO,aAAa,GAAKA,EAAM,YAC9D,OAAQ,OAAOyH,GAAQ,YACrBA,aAAgBA,GAAQnO,GAAa,KAAKmO,CAAI,GAAKjO,EACvD,CAmBA,SAASoL,GAAS5N,EAAO,CACvB,OAAO,OAAOA,GAAS,UACpBmK,GAAanK,CAAK,GAAKyC,GAAe,KAAKzC,CAAK,GAAKtC,CAC1D,CAmBA,IAAImN,GAAenL,GAAmB8B,GAAU9B,EAAgB,EAAImM,GA0BpE,SAASyB,GAActN,EAAO,CAC5B,OAAOwH,GAAWxH,EAAO4R,GAAO5R,CAAK,CAAC,CACxC,CAuBA,SAASgR,GAAShR,EAAO,CACvB,OAAOA,GAAS,KAAO,GAAK2N,GAAa3N,CAAK,CAChD,CA6BA,SAAS4M,GAAIxL,EAAQmI,EAAMsI,EAAc,CACvC,IAAItQ,EAASH,GAAU,KAAOjF,EAAYmN,GAAQlI,EAAQmI,CAAI,EAC9D,OAAOhI,IAAWpF,EAAY0V,EAAetQ,CAC/C,CA4BA,SAASsL,GAAMzL,EAAQmI,EAAM,CAC3B,OAAOnI,GAAU,MAAQuP,GAAQvP,EAAQmI,EAAMQ,EAAS,CAC1D,CA8BA,SAAStC,GAAKrG,EAAQ,CACpB,OAAOiO,GAAYjO,CAAM,EAAIwF,GAAcxF,CAAM,EAAIgL,GAAShL,CAAM,CACtE,CAyBA,SAASwQ,GAAOxQ,EAAQ,CACtB,OAAOiO,GAAYjO,CAAM,EAAIwF,GAAcxF,EAAQ,EAAI,EAAIkL,GAAWlL,CAAM,CAC9E,CAiCA,IAAI0Q,GAAQjD,GAAe,SAASzN,EAAQmG,EAAQwF,EAAU,CAC5DD,GAAU1L,EAAQmG,EAAQwF,CAAQ,CACpC,CAAC,EAoBD,SAASf,GAAShM,EAAO,CACvB,OAAOA,CACT,CA4CA,SAASO,GAASL,EAAM,CACtB,OAAO6L,GAAa,OAAO7L,GAAQ,WAAaA,EAAOwH,GAAUxH,EAAM,EAAI,CAAC,CAC9E,CAwBA,SAASiM,GAAS5C,EAAM,CACtB,OAAOC,GAAMD,CAAI,EAAIrI,GAAawI,GAAMH,CAAI,CAAC,EAAIgE,GAAiBhE,CAAI,CACxE,CAoBA,SAASiH,IAAY,CACnB,MAAO,CAAC,CACV,CAeA,SAASkB,IAAY,CACnB,MAAO,EACT,CAKAlN,EAAO,QAAU4M,GACjB5M,EAAO,SAAWjE,GAClBiE,EAAO,KAAOiD,GACdjD,EAAO,OAASoN,GAChBpN,EAAO,QAAUsM,GACjBtM,EAAO,MAAQsN,GACftN,EAAO,SAAW2H,GAClB3H,EAAO,cAAgB8I,GAKvB9I,EAAO,MAAQiN,GACfjN,EAAO,GAAK2C,GACZ3C,EAAO,QAAU8M,GACjB9M,EAAO,IAAMoI,GACbpI,EAAO,MAAQqI,GACfrI,EAAO,SAAWwH,GAClBxH,EAAO,YAAcuC,GACrBvC,EAAO,QAAUsC,GACjBtC,EAAO,YAAc6K,GACrB7K,EAAO,kBAAoB4I,GAC3B5I,EAAO,SAAW8D,GAClB9D,EAAO,QAAUmN,GACjBnN,EAAO,WAAaoH,GACpBpH,EAAO,SAAWsH,GAClBtH,EAAO,SAAWuD,GAClBvD,EAAO,aAAe2F,GACtB3F,EAAO,cAAgB6I,GACvB7I,EAAO,SAAWoJ,GAClBpJ,EAAO,aAAeqG,GACtBrG,EAAO,UAAYgM,GACnBhM,EAAO,UAAYkN,GACnBlN,EAAO,SAAWwM,GAGlBxM,EAAO,KAAO8M,GAWd9M,EAAO,QAAUpI,EAIbkD,MAEDA,GAAW,QAAUkF,GAAQ,EAAIA,EAElCnF,GAAY,EAAImF,EAEpB,GAAE,KAAKvI,EAAI,ICtnHX,IAAA8V,GAAAC,GAAA,CAAAC,GAAAC,KAAA,CACAA,GAAO,QAAUC,GAEjB,SAASA,GAAOC,EAAIC,EAAO,CACvB,IAAIC,EAAOF,GAAMA,EAAG,KAAMG,EAE1B,GAAID,IAAS,oBACT,IAAKC,EAAI,EAAGA,EAAIH,EAAG,SAAS,OAAQG,IAAKJ,GAAOC,EAAG,SAASG,GAAIF,CAAK,UAE9DC,IAAS,qBAChB,IAAKC,EAAI,EAAGA,EAAIH,EAAG,WAAW,OAAQG,IAAKJ,GAAOC,EAAG,WAAWG,GAAIF,CAAK,UAElEC,IAAS,UAChBH,GAAOC,EAAG,SAAUC,CAAK,UAElBC,IAAS,UAChBE,GAAYJ,EAAG,YAAaC,CAAK,UAE1BC,IAAS,eAChB,IAAKC,EAAI,EAAGA,EAAIH,EAAG,YAAY,OAAQG,IAAKC,GAAYJ,EAAG,YAAYG,GAAIF,CAAK,EAGpF,OAAOD,CACX,CAEA,SAASI,GAAYC,EAAOJ,EAAO,CAC/B,GAAII,EAAM,SAAW,EAErB,CAAAC,GAAWD,EAAM,GAAIJ,CAAK,EAC1B,QAASE,EAAI,EAAGA,EAAIE,EAAM,OAAQF,IAC9BG,GAAWD,EAAMF,GAAI,CAACF,CAAK,EAEnC,CAEA,SAASK,GAAWC,EAAMC,EAAK,CAE3B,QADIC,EAAO,EAAGC,EAAM,EACXP,EAAI,EAAGQ,EAAMJ,EAAK,OAAQK,EAAID,EAAM,EAAGR,EAAIQ,EAAKC,EAAIT,IAAK,CAC9D,IAAIU,GAAKN,EAAKJ,GAAG,GAAKI,EAAKK,GAAG,KAAOL,EAAKK,GAAG,GAAKL,EAAKJ,GAAG,IACtDW,EAAIL,EAAOI,EACfH,GAAO,KAAK,IAAID,CAAI,GAAK,KAAK,IAAII,CAAC,EAAIJ,EAAOK,EAAID,EAAIA,EAAIC,EAAIL,EAC9DA,EAAOK,CACX,CACIL,EAAOC,GAAO,GAAM,CAAC,CAACF,GAAKD,EAAK,QAAQ,CAChD,oxCC3CA,IAAAQ,GAAAC,GAAA,CAAAC,GAAAC,KAAA,CAAAA,GAAO,QAAU,OCAjB,IAAAC,GAAAC,GAAA,CAAAC,GAAAC,KAAA,KAAIC,EAAI,KACJC,GAAS,KAGTC,GAAkB,CAAC,EACvB,KAAgC,QAAQ,SAASC,EAAM,CACrD,GAAIA,EAAK,UAAY,MACnBD,GAAgBC,EAAK,KAAO,OACzB,CACH,IAAIC,EAAQD,EAAK,UAAY,YAAe,kBAAoB,kBAC5DE,EAAe,CAAC,EACpBF,EAAK,OAAO,QAAQ,SAASG,EAAO,CAAED,EAAaC,GAAS,EAAM,CAAC,EACnEJ,GAAgBC,EAAK,KAAO,CAAC,EAC7BD,GAAgBC,EAAK,KAAKC,GAAQC,CACpC,CACF,CAAC,EAGD,SAASE,GAAqBC,EAASC,EAAS,CAG9C,OAAKD,EAAQ,SAAWC,EAAQ,UAC3BD,EAAQ,UAAYC,EAAQ,SACvB,CAACD,EAAQ,SAAW,IAAM,CAACC,EAAQ,SAAW,GAClDD,EACAC,EAGCT,EAAE,MAAMQ,EAASC,CAAO,CACjC,CAEA,IAAIC,GAAe,CAAC,EAEpBA,GAAe,SAAUC,EAAMC,EAASC,EAAkB,CAExDD,EAAUZ,EAAE,MACV,CACE,QAAS,GACT,eAAgB,GAChB,kBAAmB,CACjB,OAAU,GACV,WAAc,GACd,aAAc,GACd,QAAW,GACX,YAAe,GACf,WAAc,GACd,eAAgB,GAChB,aAAc,GACd,oBAAqB,EACvB,EACA,gBAAiBE,GACjB,aAAcK,EAChB,EACAK,CACF,EAEA,IAAIE,EACJ,OAAO,OAAO,YAAgB,KAAgBH,aAAgB,aACvD,OAAO,YAAgB,KAAgBA,EAAK,WACjDG,EAASC,EAAgBJ,CAAI,EAE7BG,EAASE,EAAsBL,CAAI,EAC9BG,EAEP,SAASE,EAAsBC,EAAM,CAEnC,IAAIC,EAAQ,IAAI,MACZC,EAAQ,IAAI,MACZC,EAAQ,IAAI,MAEhB,SAASC,EAAeC,EAAQ,CAC9B,IAAIC,EAAavB,EAAE,MAAMsB,CAAM,EAC/BC,EAAW,IAAMD,EAAO,OAAO,IAC/BC,EAAW,IAAMD,EAAO,OAAO,IAC/BC,EAAW,wBAA0B,GACrCL,EAAM,KAAKK,CAAU,CACvB,CACA,SAASC,EAAeF,EAAQ,CAC9B,IAAIG,EAAYzB,EAAE,MAAMsB,CAAM,EAC9BG,EAAU,MAAQ,CAAC,EACnB,SAASC,EAAcC,EAAIC,EAAIC,EAAG,CAChC,IAAIN,EAAa,CACf,KAAK,OACL,GAAK,IAAIE,EAAU,KAAK,IAAIA,EAAU,GAAG,SAASI,EAClD,IAAKF,EACL,IAAKC,CACP,EACAH,EAAU,MAAM,KAAKF,EAAW,EAAE,EAClCL,EAAM,KAAKK,CAAU,CACvB,CACAG,EAAcD,EAAU,OAAO,OAAOA,EAAU,OAAO,OAAO,CAAC,EAC/DC,EAAcD,EAAU,OAAO,OAAOA,EAAU,OAAO,OAAO,CAAC,EAC/DC,EAAcD,EAAU,OAAO,OAAOA,EAAU,OAAO,OAAO,CAAC,EAC/DC,EAAcD,EAAU,OAAO,OAAOA,EAAU,OAAO,OAAO,CAAC,EAC/DA,EAAU,MAAM,KAAKA,EAAU,MAAM,EAAE,EACvCA,EAAU,wBAA0B,GACpCN,EAAK,KAAKM,CAAS,CACrB,CACA,SAASK,EAAgBC,EAAK,CAC5B,SAASC,EAAoBL,EAAIC,EAAIK,EAAI,CACvC,IAAIC,EAAe,CACjB,KAAK,OACL,GAAKD,EACL,IAAKN,EACL,IAAKC,CACP,EACAV,EAAM,KAAKgB,CAAY,CACzB,CACKlC,EAAE,QAAQ+B,EAAI,KAAK,IACtBA,EAAI,MAAQA,EAAI,SAAS,IAAI,SAASI,EAAI,CACxC,OAAIA,IAAO,KACF,cAAcA,EAAG,IAAI,IAAIA,EAAG,IAE5B,6BACX,CAAC,GAEHJ,EAAI,SAAS,QAAQ,SAASI,EAAIN,EAAG,CAC/BM,GACFH,EACEG,EAAG,IACHA,EAAG,IACHJ,EAAI,MAAMF,EACZ,CAEJ,CAAC,CACH,CACA,SAASO,EAAqBC,EAAK,CACjC,SAASL,EAAoBL,EAAIC,EAAIK,EAAI,CACvC,IAAIC,EAAe,CACjB,KAAK,OACL,GAAKD,EACL,IAAKN,EACL,IAAKC,CACP,EACAV,EAAM,KAAKgB,CAAY,CACzB,CACA,SAASI,EAAmBC,EAASN,EAAI,CAEvC,GAAId,EAAK,KAAK,SAAUY,EAAK,CAC3B,OAAOA,EAAI,MAAQ,OAASA,EAAI,IAAME,CACxC,CAAC,EAAG,OACJ,IAAIO,EAAc,CAChB,KAAM,MACN,GAAMP,EACN,MAAM,CAAC,CACT,EACA,SAASQ,EAA6Bd,EAAIC,GAAK,CAE7C,IAAIc,EAAqB,CACvB,KAAK,OACL,GAAK,cAAcf,EAAI,IAAIC,GAC3B,IAAKD,EACL,IAAKC,EACP,EACAY,EAAY,MAAM,KAAKE,EAAmB,EAAE,EAC5CxB,EAAM,KAAKwB,CAAkB,CAC/B,CACAH,EAAS,QAAQ,SAASJ,EAAI,CACxBA,EACFM,EACEN,EAAG,IACHA,EAAG,GACL,EAEAK,EAAY,MAAM,KAAK,MAAS,CAEpC,CAAC,EACDrB,EAAK,KAAKqB,CAAW,CACvB,CACAH,EAAI,QAAQ,QAAQ,SAASM,EAAQd,EAAG,CAClCc,EAAO,MAAQ,OACbA,EAAO,KACTX,EACEW,EAAO,IACPA,EAAO,IACPA,EAAO,GACT,EAEOA,EAAO,MAAQ,OACpBA,EAAO,WACTA,EAAO,IAAM,YAAYA,EAAO,IAChCL,EACEK,EAAO,SACPA,EAAO,GACT,EAGN,CAAC,CACH,CAGA,QAASd,EAAE,EAAEA,EAAEZ,EAAK,SAAS,OAAOY,IAClC,OAAQZ,EAAK,SAASY,GAAG,KAAM,CAC/B,IAAK,OACH,IAAIe,EAAO3B,EAAK,SAASY,GACzBX,EAAM,KAAK0B,CAAI,EACjB,MACA,IAAK,MACH,IAAIb,EAAM/B,EAAE,MAAMiB,EAAK,SAASY,EAAE,EAClCE,EAAI,MAAQ/B,EAAE,MAAM+B,EAAI,KAAK,EAC7BZ,EAAK,KAAKY,CAAG,EACTA,EAAI,QACNV,EAAeU,CAAG,EAChBA,EAAI,SACND,EAAgBC,CAAG,EACZA,EAAI,QACXP,EAAeO,CAAG,EACtB,MACA,IAAK,WACH,IAAIM,EAAMrC,EAAE,MAAMiB,EAAK,SAASY,EAAE,EAClCQ,EAAI,QAAUrC,EAAE,MAAMqC,EAAI,OAAO,EACjCjB,EAAK,KAAKiB,CAAG,EACb,IAAIQ,EAAoBR,EAAI,SAAWA,EAAI,QAAQ,KAAK,SAAUM,EAAQ,CACxE,OAAOA,EAAO,MAAQ,QAAUA,EAAO,KAChCA,EAAO,MAAQ,OAAUA,EAAO,UAAYA,EAAO,SAAS,OAAS,CAC9E,CAAC,EACGN,EAAI,QACNhB,EAAegB,CAAG,EAChBQ,EACFT,EAAqBC,CAAG,EACjBA,EAAI,QACXb,EAAea,CAAG,EACtB,MACA,QAEA,CAEF,OAAOS,EAAiB5B,EAAMC,EAAKC,CAAI,CACzC,CACA,SAASL,EAAgBgC,EAAK,CAE5B,IAAI7B,EAAQ,IAAI,MACZC,EAAQ,IAAI,MACZC,EAAQ,IAAI,MAEhB,SAAS4B,EAAgBC,EAAGC,EAAGC,EAAO,CAChCF,EAAE,aAAaE,CAAI,IACrBD,EAAEC,GAAQF,EAAE,aAAaE,CAAI,EACjC,CACA,SAAS9B,EAAeC,EAAQ8B,EAAU,CACxC,IAAI7B,EAAavB,EAAE,MAAMsB,CAAM,EAC/B0B,EAAeI,EAAU7B,EAAY,KAAK,EAC1CyB,EAAeI,EAAU7B,EAAY,KAAK,EAC1CA,EAAW,wBAA0B,GACrCL,EAAM,KAAKK,CAAU,CACvB,CACA,SAASC,EAAeF,EAAQ+B,EAAQ,CACtC,IAAI5B,EAAYzB,EAAE,MAAMsB,CAAM,EAC9BG,EAAU,MAAQ,CAAC,EACnB,SAASC,EAAcC,EAAIC,EAAIC,EAAG,CAChC,IAAIN,EAAa,CACf,KAAK,OACL,GAAK,IAAIE,EAAU,KAAK,IAAIA,EAAU,GAAG,SAASI,EAClD,IAAKF,EACL,IAAKC,CACP,EACAH,EAAU,MAAM,KAAKF,EAAW,EAAE,EAClCL,EAAM,KAAKK,CAAU,CACvB,CACAG,EAAc2B,EAAO,aAAa,QAAQ,EAAEA,EAAO,aAAa,QAAQ,EAAE,CAAC,EAC3E3B,EAAc2B,EAAO,aAAa,QAAQ,EAAEA,EAAO,aAAa,QAAQ,EAAE,CAAC,EAC3E3B,EAAc2B,EAAO,aAAa,QAAQ,EAAEA,EAAO,aAAa,QAAQ,EAAE,CAAC,EAC3E3B,EAAc2B,EAAO,aAAa,QAAQ,EAAEA,EAAO,aAAa,QAAQ,EAAE,CAAC,EAC3E5B,EAAU,MAAM,KAAKA,EAAU,MAAM,EAAE,EACvCA,EAAU,wBAA0B,GACpCN,EAAK,KAAKM,CAAS,CACrB,CACA,SAASK,EAAgBC,EAAKuB,EAAK,CACjC,SAAStB,EAAoBL,EAAIC,EAAIK,EAAI,CACvC,IAAIC,EAAe,CACjB,KAAK,OACL,GAAKD,EACL,IAAKN,EACL,IAAKC,CACP,EACA,OAAAV,EAAM,KAAKgB,CAAY,EAChBA,EAAa,EACtB,CACKlC,EAAE,QAAQ+B,EAAI,KAAK,IACtBA,EAAI,MAAQ,CAAC,EACb/B,EAAE,KAAMsD,EAAK,SAAUnB,EAAIN,EAAI,CAC7BE,EAAI,MAAM,KAAK,cAAcI,EAAG,aAAa,KAAK,EAAE,IAAIA,EAAG,aAAa,KAAK,CAAC,CAChF,CAAC,GAEHnC,EAAE,KAAMsD,EAAK,SAAUnB,EAAIN,EAAI,CACzBM,EAAG,aAAa,KAAK,GACvBH,EACEG,EAAG,aAAa,KAAK,EACrBA,EAAG,aAAa,KAAK,EACrBJ,EAAI,MAAMF,EACZ,CAEJ,CAAC,CACH,CACA,SAASO,EAAqBC,EAAKkB,EAAS,CAC1C,SAASvB,EAAoBL,EAAIC,EAAIK,EAAI,CACvC,IAAIC,EAAe,CACjB,KAAK,OACL,GAAKD,EACL,IAAKN,EACL,IAAKC,CACP,EACAV,EAAM,KAAKgB,CAAY,CACzB,CACA,SAASI,EAAmBgB,EAAIrB,EAAI,CAElC,GAAId,EAAK,KAAK,SAAUY,EAAK,CAC3B,OAAOA,EAAI,MAAQ,OAASA,EAAI,IAAME,CACxC,CAAC,EAAG,OACJ,IAAIO,EAAc,CAChB,KAAM,MACN,GAAMP,EACN,MAAM,CAAC,CACT,EACA,SAASQ,EAA6Bd,EAAIC,EAAK,CAE7C,IAAIc,GAAqB,CACvB,KAAK,OACL,GAAK,cAAcf,EAAI,IAAIC,EAC3B,IAAKD,EACL,IAAKC,CACP,EACAY,EAAY,MAAM,KAAKE,GAAmB,EAAE,EAC5CxB,EAAM,KAAKwB,EAAkB,CAC/B,CACA1C,EAAE,KAAKsD,EAAK,SAASnB,EAAI,CACnBA,EAAG,aAAa,KAAK,EACvBM,EACEN,EAAG,aAAa,KAAK,EACrBA,EAAG,aAAa,KAAK,CACvB,EAEAK,EAAY,MAAM,KAAK,MAAS,CAEpC,CAAC,EACDrB,EAAK,KAAKqB,CAAW,CACvB,CACAxC,EAAE,KAAMuD,EAAS,SAAUZ,EAAQd,EAAI,CACjCQ,EAAI,QAAQR,GAAG,MAAQ,OACrBc,EAAO,aAAa,KAAK,GAC3BX,EACEW,EAAO,aAAa,KAAK,EACzBA,EAAO,aAAa,KAAK,EACzBN,EAAI,QAAQR,GAAG,GACjB,EAEOQ,EAAI,QAAQR,GAAG,MAAQ,OAC5Bc,EAAO,qBAAqB,IAAI,EAAE,OAAS,IAC7CN,EAAI,QAAQR,GAAG,IAAM,YAAYQ,EAAI,QAAQR,GAAG,IAChDS,EACEK,EAAO,qBAAqB,IAAI,EAChCN,EAAI,QAAQR,GAAG,GACjB,EAGN,CAAC,CACH,CAEA7B,EAAE,KAAM+C,EAAI,qBAAqB,MAAM,EAAG,SAAUH,EAAMf,EAAI,CAC5D,IAAI1B,EAAO,CAAC,EACZH,EAAE,KAAM4C,EAAK,qBAAqB,KAAK,EAAG,SAAUY,EAAM,CACxDrD,EAAKqD,EAAI,aAAa,GAAG,GAAKA,EAAI,aAAa,GAAG,CACpD,CAAC,EACD,IAAIC,EAAa,CACf,KAAQ,MACV,EACAT,EAAgBJ,EAAMa,EAAY,IAAK,EACvCT,EAAgBJ,EAAMa,EAAY,KAAM,EACxCT,EAAgBJ,EAAMa,EAAY,KAAM,EACxCT,EAAgBJ,EAAMa,EAAY,SAAU,EAC5CT,EAAgBJ,EAAMa,EAAY,WAAY,EAC9CT,EAAgBJ,EAAMa,EAAY,WAAY,EAC9CT,EAAgBJ,EAAMa,EAAY,KAAM,EACxCT,EAAgBJ,EAAMa,EAAY,MAAO,EACpCzD,EAAE,QAAQG,CAAI,IACjBsD,EAAW,KAAOtD,GACpBe,EAAM,KAAKuC,CAAU,CACvB,CAAC,EAED,IAAIL,EAASC,EACb,OAAArD,EAAE,KAAM+C,EAAI,qBAAqB,KAAK,EAAG,SAAUhB,EAAKF,EAAI,CAC1D,IAAI1B,EAAO,CAAC,EACRuD,EAAS,CAAC,EACd1D,EAAE,KAAM+B,EAAI,qBAAqB,KAAK,EAAG,SAAUyB,EAAM,CACvDrD,EAAKqD,EAAI,aAAa,GAAG,GAAKA,EAAI,aAAa,GAAG,CACpD,CAAC,EACD,IAAIX,EAAoB,GACxB7C,EAAE,KAAM+B,EAAI,qBAAqB,IAAI,EAAG,SAAUI,EAAIN,EAAI,CACxD,IAAII,GACAA,EAAKE,EAAG,aAAa,KAAK,KAC5BuB,EAAO7B,GAAKI,GACV,CAACY,GAAqBV,EAAG,aAAa,KAAK,IAC7CU,EAAoB,GACxB,CAAC,EACD,IAAIc,EAAY,CACd,KAAQ,KACV,EACAX,EAAgBjB,EAAK4B,EAAW,IAAK,EACrCX,EAAgBjB,EAAK4B,EAAW,SAAU,EAC1CX,EAAgBjB,EAAK4B,EAAW,WAAY,EAC5CX,EAAgBjB,EAAK4B,EAAW,WAAY,EAC5CX,EAAgBjB,EAAK4B,EAAW,KAAM,EACtCX,EAAgBjB,EAAK4B,EAAW,MAAO,EACnCD,EAAO,OAAS,IAClBC,EAAU,MAAQD,GACf1D,EAAE,QAAQG,CAAI,IACjBwD,EAAU,KAAOxD,IACfiD,EAAWrB,EAAI,qBAAqB,QAAQ,EAAE,KAChDV,EAAesC,EAAUP,CAAQ,EAC/BP,EACFf,EAAgB6B,EAAW5B,EAAI,qBAAqB,IAAI,CAAC,GAClDsB,EAAStB,EAAI,qBAAqB,QAAQ,EAAE,KACnDP,EAAemC,EAAUN,CAAM,EACjClC,EAAK,KAAKwC,CAAS,CACrB,CAAC,EAED3D,EAAE,KAAM+C,EAAI,qBAAqB,UAAU,EAAG,SAAUa,EAAU/B,EAAI,CACpE,IAAI1B,EAAO,CAAC,EACRoD,EAAU,CAAC,EACfvD,EAAE,KAAM4D,EAAS,qBAAqB,KAAK,EAAG,SAAUJ,EAAM,CAC5DrD,EAAKqD,EAAI,aAAa,GAAG,GAAKA,EAAI,aAAa,GAAG,CACpD,CAAC,EACD,IAAIX,EAAoB,GACxB7C,EAAE,KAAM4D,EAAS,qBAAqB,QAAQ,EAAG,SAAUjB,EAAQd,EAAI,CACrE0B,EAAQ1B,GAAK,CAAC,EACdmB,EAAgBL,EAAQY,EAAQ1B,GAAI,KAAM,EAC1CmB,EAAgBL,EAAQY,EAAQ1B,GAAI,MAAO,EAC3CmB,EAAgBL,EAAQY,EAAQ1B,GAAI,MAAO,GACvC,CAACgB,GACCU,EAAQ1B,GAAG,MAAQ,QAAUc,EAAO,aAAa,KAAK,GACtDY,EAAQ1B,GAAG,MAAQ,OAAUc,EAAO,qBAAqB,IAAI,EAAE,OAAO,KAC1EE,EAAoB,GACxB,CAAC,EACD,IAAIgB,EAAY,CACd,KAAQ,UACV,EACAb,EAAgBY,EAAUC,EAAW,IAAK,EAC1Cb,EAAgBY,EAAUC,EAAW,SAAU,EAC/Cb,EAAgBY,EAAUC,EAAW,WAAY,EACjDb,EAAgBY,EAAUC,EAAW,WAAY,EACjDb,EAAgBY,EAAUC,EAAW,KAAM,EAC3Cb,EAAgBY,EAAUC,EAAW,MAAO,EACxCN,EAAQ,OAAS,IACnBM,EAAU,QAAUN,GACjBvD,EAAE,QAAQG,CAAI,IACjB0D,EAAU,KAAO1D,IACfiD,EAAWQ,EAAS,qBAAqB,QAAQ,EAAE,KACrDvC,EAAewC,EAAUT,CAAQ,EAC/BP,EACFT,EAAqByB,EAAWD,EAAS,qBAAqB,QAAQ,CAAC,GAChEP,EAASO,EAAS,qBAAqB,QAAQ,EAAE,KACxDpC,EAAeqC,EAAUR,CAAM,EACjCjC,EAAK,KAAKyC,CAAS,CACrB,CAAC,EACMf,EAAiB5B,EAAMC,EAAKC,CAAI,CACzC,CACA,SAAS0B,EAAiB5B,EAAMC,EAAKC,EAAM,CAGzC,SAAS0C,EAAqBC,EAAGC,GAAa,CAG5C,GAFI,OAAOA,IAAgB,WACzBA,GAAY,CAAC,GACX,OAAOpD,EAAQ,mBAAsB,WACvC,MAAO,CAACA,EAAQ,kBAAkBmD,EAAGC,EAAW,EAClD,QAASC,KAAKF,EACZ,GAAMnD,EAAQ,kBAAkBqD,KAAK,IACjC,EAAED,GAAYC,KAAK,IAAQD,GAAYC,KAAKF,EAAEE,IAChD,MAAO,GACX,MAAO,EACT,CAEA,SAASC,EAAuB5C,EAAQ,CACtC,IAAI6C,GAAM,CACR,UAAa7C,EAAO,UACpB,QAAWA,EAAO,QAClB,UAAaA,EAAO,UACpB,KAAQA,EAAO,KACf,IAAOA,EAAO,GAChB,EACA,QAAS2C,KAAKE,GACRA,GAAIF,KAAO,QACb,OAAOE,GAAIF,GACf,OAAOE,EACT,CAKA,QAFIC,EAAU,IAAI,OACdC,EAAU,IAAI,OACTxC,EAAE,EAAEA,EAAEX,EAAM,OAAOW,IAAK,CAC/B,IAAIe,EAAO1B,EAAMW,GACbuC,EAAQxB,EAAK,MAAQ,SAEvBA,EAAOhC,EAAQ,aAAagC,EAAMwB,EAAQxB,EAAK,GAAG,GAEpDwB,EAAQxB,EAAK,IAAMA,EACf,OAAOA,EAAK,KAAQ,KACpBkB,EAAqBlB,EAAK,IAAI,IAChCyB,EAAQzB,EAAK,IAAM,GACvB,CAEA,QAASf,EAAE,EAAEA,EAAET,EAAK,OAAOS,IACzB,GAAI7B,EAAE,QAAQoB,EAAKS,GAAG,OAAO,EAC3B,QAASyC,EAAE,EAAEA,EAAElD,EAAKS,GAAG,QAAQ,OAAOyC,IAChClD,EAAKS,GAAG,QAAQyC,GAAG,MAAQ,SAC7BD,EAAQjD,EAAKS,GAAG,QAAQyC,GAAG,KAAO,IAM1C,QAFIC,EAAS,IAAI,OACbC,EAAU,IAAI,OACT3C,EAAE,EAAEA,EAAEV,EAAK,OAAOU,IAAK,CAC9B,IAAIE,EAAMZ,EAAKU,GAMf,GALI0C,EAAOxC,EAAI,MAEbA,EAAMnB,EAAQ,aAAamB,EAAKwC,EAAOxC,EAAI,GAAG,GAEhDwC,EAAOxC,EAAI,IAAMA,EACb/B,EAAE,QAAQ+B,EAAI,KAAK,EACrB,QAASuC,EAAE,EAAEA,EAAEvC,EAAI,MAAM,OAAOuC,IAC1B,OAAOvC,EAAI,MAAMuC,IAAO,WAC5BE,EAAQzC,EAAI,MAAMuC,IAAM,GACxBvC,EAAI,MAAMuC,GAAKF,EAAQrC,EAAI,MAAMuC,IAGvC,CACA,IAAIG,EAAO,IAAI,MACf,QAASxC,KAAMmC,EAAS,CACtB,IAAIxB,EAAOwB,EAAQnC,IACf,CAACuC,EAAQvC,IAAOoC,EAAQpC,KAC1BwC,EAAK,KAAK7B,CAAI,CAClB,CAEA,QADI8B,EAAS,IAAI,MACR7C,EAAE,EAAEA,EAAET,EAAK,OAAOS,IAAK,CAC9B,IAAIQ,EAAMjB,EAAKS,GACX6C,EAAOrC,EAAI,MAEbA,EAAMzB,EAAQ,aAAayB,EAAKqC,EAAOrC,EAAI,GAAG,GAEhDqC,EAAOrC,EAAI,IAAMA,CACnB,CACA,IAAIsC,EAAU,CAAC,KAAM,CAAC,EAAG,IAAK,CAAC,EAAG,SAAU,CAAC,CAAC,EAC9C,QAAS1C,KAAMyC,EAAQ,CACrB,IAAIrC,EAAMqC,EAAOzC,GACjB,GAAI,CAACjC,EAAE,QAAQqC,EAAI,OAAO,EAAG,CACvBzB,EAAQ,SAAS,QAAQ,KAAK,WAAWyB,EAAI,KAAK,IAAIA,EAAI,GAAG,mCAAmC,EACpG,QACF,CACA,QAASiC,EAAE,EAAEA,EAAEjC,EAAI,QAAQ,OAAOiC,IAAK,CACrC,IAAIM,EAASvC,EAAI,QAAQiC,GAAG,KACxBO,EAAQxC,EAAI,QAAQiC,GAAG,IAK3B,GAJI,OAAOO,GAAU,WAEnBA,EAAQA,EAAM,QAAQ,YAAa,EAAE,GAEnC,CAACF,EAAQC,GAAS,CAChBhE,EAAQ,SAAS,QAAQ,KAAK,WAAWyB,EAAI,KAAK,IAAIA,EAAI,GAAG,SAASuC,EAAO,IAAIC,EAAM,wCAAwC,EACnI,QACF,CACI,OAAOF,EAAQC,GAAQC,GAAW,MACpCF,EAAQC,GAAQC,GAAS,CAAC,GAC5BF,EAAQC,GAAQC,GAAO,KAAK,CAC1B,KAASxC,EAAI,QAAQiC,GAAG,KACxB,IAAQjC,EAAI,GACZ,QAAYA,EAAI,IAClB,CAAC,CACH,CACF,CAEA,IAAIyC,EACAC,GAAe,CAAC,EACpB,IAAKlD,EAAE,EAAEA,EAAE4C,EAAK,OAAO5C,IAAK,CAC1B,GAAI,OAAO4C,EAAK5C,GAAG,IAAO,KAAe,OAAO4C,EAAK5C,GAAG,IAAO,IAAa,CACtEjB,EAAQ,SAAS,QAAQ,KAAK,MAAM6D,EAAK5C,GAAG,KAAK,IAAI4C,EAAK5C,GAAG,GAAG,sCAAsC,EAC1G,QACF,CACA,IAAImD,EAAU,CACZ,KAAe,UACf,GAAeP,EAAK5C,GAAG,KAAK,IAAI4C,EAAK5C,GAAG,GACxC,WAAe,CACb,KAAS4C,EAAK5C,GAAG,KACjB,GAAS4C,EAAK5C,GAAG,GACjB,KAAS4C,EAAK5C,GAAG,MAAQ,CAAC,EAC1B,UAAc8C,EAAQ,KAAQF,EAAK5C,GAAG,KAAO,CAAC,EAC9C,KAAQqC,EAAuBO,EAAK5C,EAAE,CACxC,EACA,SAAe,CACb,KAAS,QACT,YAAgB,CAAC,CAAC4C,EAAK5C,GAAG,IAAK,CAAC4C,EAAK5C,GAAG,GAAG,CAC7C,CACF,EACI4C,EAAK5C,GAAG,0BACVmD,EAAQ,WAAW,SAAc,UAC9BnE,EAGHA,EAAgBmE,CAAO,EAFvBD,GAAa,KAAKC,CAAO,CAG7B,CAIA,QAHIC,GAAe,CAAC,EAChBC,GAAkB,CAAC,EAEdrD,EAAE,EAAEA,EAAET,EAAK,OAAOS,IAEzB,GAAI6C,EAAOtD,EAAKS,GAAG,MAAQT,EAAKS,GAIhC,IAAK,OAAOT,EAAKS,GAAG,KAAQ,MACvBT,EAAKS,GAAG,KAAK,MAAW,SAAWT,EAAKS,GAAG,KAAK,MAAW,YAAa,CAmB3E,IAASsD,GAAT,SAAmC9C,EAAK,CACtC,IAAI+C,EAAa,GAEb7B,GACJA,GAAUlB,EAAI,QAAQ,OAAO,SAASgD,EAAG,CAAC,OAAOA,EAAE,OAAS,KAAM,CAAC,EACnE9B,GAAUA,GAAQ,IAAI,SAAS8B,EAAG,CAChC,IAAItD,EAAMwC,EAAOc,EAAE,KACnB,GAAItD,IAAQ,QAAaA,EAAI,QAAU,OAAW,CAC5CnB,EAAQ,SAAS,QAAQ,KAAK,SAASyB,EAAI,KAAK,IAAIA,EAAI,GAAI,0CAA2CgD,EAAE,KAAK,IAAIA,EAAE,GAAG,EAC3HD,EAAa,GACb,MACF,CACA,MAAO,CACL,GAAIC,EAAE,IACN,KAAMA,EAAE,KACR,IAAKtD,EACL,MAAOA,EAAI,MAAM,OAAO,SAASuD,GAAG,CAClC,OAAIA,KAAM,OACD,IACTF,EAAa,GACTxE,EAAQ,SAAS,QAAQ,KAAK,QAASyB,EAAI,KAAK,IAAIA,EAAI,GAAK,mBAAoBgD,EAAE,KAAK,IAAIA,EAAE,IAAK,qBAAqB,EACrH,GACT,CAAC,CACH,CACF,CAAC,EACD9B,GAAUvD,EAAE,QAAQuD,EAAO,EAE3B,IAAIgC,EACJA,EAAcC,GAAKjC,EAAO,EAG1B,IAAIkC,EAAS,CAAC,EAOd,GANAA,EAASzF,EAAE,QAAQuF,EAAY,IAAI,SAASG,EAAY,CACtD,OAAO1F,EAAE,QAAQ0F,EAAW,IAAI,SAAS9C,EAAM,CAC7C,MAAO,CAAC,CAACA,EAAK,IAAI,CAACA,EAAK,GAAG,CAC7B,CAAC,CAAC,CACJ,CAAC,CAAC,EAEE6C,EAAO,QAAU,EACnB,OAAI7E,EAAQ,SAAS,QAAQ,KAAK,QAASyB,EAAI,KAAK,IAAIA,EAAI,GAAI,yBAAyB,EAClF,GAIT,IAAI2C,GAAU,CACZ,KAAe,UACf,GAAe3C,EAAI,KAAK,IAAIA,EAAI,GAChC,WAAe,CACb,KAASA,EAAI,KACb,GAASA,EAAI,GACb,KAASA,EAAI,MAAQ,CAAC,EACtB,UAAesC,EAAQtC,EAAI,MAAMA,EAAI,KAAO,CAAC,EAC7C,KAAQ6B,EAAuB7B,CAAG,CACpC,EACA,SAAe,CACb,KAASoD,EAAO,SAAW,EAAI,aAAe,kBAC9C,YAAgBA,EAAO,SAAW,EAAIA,EAAO,GAAKA,CACpD,CACF,EACA,OAAIL,IACExE,EAAQ,SAAS,QAAQ,KAAK,QAASyB,EAAI,KAAK,IAAIA,EAAI,GAAI,YAAY,EAC5E2C,GAAQ,WAAW,QAAa,IAE3BA,EACT,EAhES,IAAAG,MAlBT,GAAI,CAACnF,EAAE,QAAQoB,EAAKS,GAAG,OAAO,EAAG,CAC3BjB,EAAQ,SAAS,QAAQ,KAAK,QAAQQ,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,mCAAmC,EACzG,QACF,CAMA,GALAT,EAAKS,GAAG,QAAQ,QAAQ,SAASwD,EAAG,CAC9Bd,EAAOc,EAAE,MAAQ,CAACvB,EAAqBS,EAAOc,EAAE,KAAK,IAAI,IACzDd,EAAOc,EAAE,KAAK,2BAA6B,GACjD,CAAC,EACDL,EAAUG,GAA0B/D,EAAKS,EAAE,EACvCmD,IAAY,GAAO,CACjBpE,EAAQ,SAAS,QAAQ,KAAK,iBAAiBQ,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,yCAAyC,EACxH,QACF,CACKhB,EAGHA,EAAgBZ,GAAO+E,CAAO,CAAC,EAF/BE,GAAgB,KAAKF,CAAO,CAqEhC,CACA,GAAK,OAAO5D,EAAKS,GAAG,KAAQ,MACvBT,EAAKS,GAAG,KAAK,MAAW,gBAAkBT,EAAKS,GAAG,KAAK,MAAW,YAAa,CAoDlF,IAAS8D,EAAT,SAAgCC,EAAYvD,GAAK,CAC/C,IAAI+C,EAAa,GACbS,EAAcC,GAAY,MAAQ,WAClCC,GAAQ,OAAOH,EAAW,IAAO,SAAWA,EAAW,GAAK,CAAEA,EAAW,GAAG,QAAQ,YAAa,EAAE,EAEnGrC,EACJA,EAAUlB,GAAI,QAAQ,OAAO,SAASgD,EAAG,CAAC,OAAOA,EAAE,OAAS,KAAM,CAAC,EACnE9B,EAAUA,EAAQ,IAAI,SAAS8B,EAAG,CAChC,IAAItD,GAAMwC,EAAOc,EAAE,KACnB,GAAItD,KAAQ,QAAaA,GAAI,QAAU,OAAW,CAC5CnB,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAO,yCAA0CV,EAAE,KAAK,IAAIA,EAAE,GAAG,EACnID,EAAa,GACb,MACF,CACA,MAAO,CACL,GAAIC,EAAE,IACN,KAAMA,EAAE,MAAQ,QAChB,IAAKtD,GACL,MAAOA,GAAI,MAAM,OAAO,SAASuD,GAAG,CAClC,OAAIA,KAAM,OACD,IACTF,EAAa,GACTxE,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAQ,mBAAoBV,EAAE,KAAK,IAAIA,EAAE,IAAK,qBAAqB,EAC9H,GACT,CAAC,CACH,CACF,CAAC,EACD9B,EAAUvD,EAAE,QAAQuD,CAAO,EAE3B,IAAIyC,EAAQC,GACZD,EAASR,GAAKjC,EAAQ,OAAO,SAAS8B,EAAG,CAAC,OAAOA,EAAE,OAAO,OAAQ,CAAC,CAAC,EACpEY,GAAST,GAAKjC,EAAQ,OAAO,SAAS8B,EAAG,CAAC,OAAOA,EAAE,OAAO,OAAQ,CAAC,CAAC,EAEpE,IAAIa,GACJ,SAASC,GAAUC,EAAO,CACxB,IAAIC,GAA2B,SAASC,GAAOF,GAAO,CACpD,QAASvE,GAAE,EAAGA,GAAEuE,GAAM,OAAQvE,KAC5B,GAAI0E,GAAeH,GAAMvE,IAAIyE,EAAK,EAChC,MAAO,GACX,MAAO,EACT,EACIE,GAAiB,SAASC,GAAM,CAClC,OAAOA,GAAK,IAAI,SAASnB,GAAG,CAC1B,MAAO,CAAC,CAACA,GAAE,IAAI,CAACA,GAAE,GAAG,CACvB,CAAC,CACH,EAIIiB,GAAiB,SAASG,GAAOC,GAAS,CAE5C,QADI1D,GAAIyD,GAAM,GAAIE,GAAIF,GAAM,GAAIG,GAAS,GAChChF,GAAI,EAAGyC,GAAIqC,GAAQ,OAAS,EAAG9E,GAAI8E,GAAQ,OAAQrC,GAAIzC,KAAK,CACnE,IAAIiF,GAAKH,GAAQ9E,IAAG,GAAIkF,GAAKJ,GAAQ9E,IAAG,GACpCmF,GAAKL,GAAQrC,IAAG,GAAI2C,GAAKN,GAAQrC,IAAG,GACpC4C,GAAcH,GAAKH,IAAOK,GAAKL,IAChC3D,IAAK+D,GAAKF,KAAOF,GAAIG,KAAOE,GAAKF,IAAMD,GACtCI,KAAWL,GAAS,CAACA,GAC3B,CACA,OAAOA,EACT,EAEI3D,GAAGoD,GASP,IANAF,EAAQI,GAAeJ,CAAK,EAMvBlD,GAAI,EAAGA,GAAI8C,EAAO,OAAQ9C,KAE7B,GADAoD,GAAQE,GAAeR,EAAO9C,GAAE,EAC5BmD,GAAyBC,GAAOF,CAAK,EACvC,OAAOlD,EAEb,CACAgD,GAAKF,EAAO,IAAI,SAAS9C,EAAG,CAAC,MAAO,CAACA,CAAC,CAAE,CAAC,EACzC,QAASoB,GAAE,EAAGA,GAAE2B,GAAO,OAAQ3B,KAAK,CAClC,IAAIpB,GAAIiD,GAAUF,GAAO3B,GAAE,EACvBpB,KAAM,OACRgD,GAAGhD,IAAG,KAAK+C,GAAO3B,GAAE,EAEhB1D,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAO,iDAAiD,CAI9H,CAEA,IAAIoB,GAAY,CAAC,EAkBjB,GAjBAA,GAAYnH,EAAE,QAAQkG,GAAG,IAAI,SAASkB,EAAS,CAC7C,IAAIC,GAAKrH,EAAE,QAAQoH,EAAQ,IAAI,SAASE,GAAM,CAC5C,GAAIA,GAAK,OAAS,EAAG,CACf1G,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAO,2CAA2C,EACpH,MACF,CACA,OAAO/F,EAAE,QAAQsH,GAAK,IAAI,SAAS1E,GAAM,CACvC,MAAO,CAAC,CAACA,GAAK,IAAI,CAACA,GAAK,GAAG,CAC7B,CAAC,CAAC,CACJ,CAAC,CAAC,EACF,GAAIyE,GAAG,QAAU,EAAG,CACdzG,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAO,gCAAgC,EACzG,MACF,CACA,OAAOsB,EACT,CAAC,CAAC,EAEEF,GAAU,QAAU,EACtB,OAAIvG,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAO,yBAAyB,EAC3F,GAET,IAAIwB,GAAU,eACVJ,GAAU,SAAW,IACvBI,GAAU,UACVJ,GAAYA,GAAU,IAGxB,IAAInC,GAAU,CACZ,KAAe,UACf,GAAeY,EAAW,KAAK,IAAIG,GACnC,WAAe,CACb,KAASH,EAAW,KACpB,GAASG,GACT,KAASH,EAAW,MAAQ,CAAC,EAC7B,UAAejB,EAAQiB,EAAW,MAAMA,EAAW,KAAO,CAAC,EAC3D,KAAQ1B,EAAuB0B,CAAU,CAC3C,EACA,SAAe,CACb,KAAS2B,GACT,YAAgBJ,EAClB,CACF,EACA,OAAI/B,IACExE,EAAQ,SAAS,QAAQ,KAAK,eAAgBiF,EAAY,IAAIE,GAAO,YAAY,EACrFf,GAAQ,WAAW,QAAa,IAE3BA,EACT,EAxIS,IAAAW,KAnDT,GAAI,CAAC3F,EAAE,QAAQoB,EAAKS,GAAG,OAAO,EAAG,CAC3BjB,EAAQ,SAAS,QAAQ,KAAK,eAAeQ,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,mCAAmC,EAChH,QACF,CAEA,QADI2F,GAAc,EACTlD,EAAE,EAAEA,EAAElD,EAAKS,GAAG,QAAQ,OAAOyC,IAChClD,EAAKS,GAAG,QAAQyC,GAAG,MAAQ,QAC7BkD,KACO5G,EAAQ,SAAWQ,EAAKS,GAAG,QAAQyC,GAAG,MAAQ,SACrD,QAAQ,KAAK,eAAelD,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,SAAST,EAAKS,GAAG,QAAQyC,GAAG,KAAK,IAAIlD,EAAKS,GAAG,QAAQyC,GAAG,IAAI,4CAA8ClD,EAAKS,GAAG,QAAQyC,GAAG,KAAO,GAAG,EAYnM,GAXAlD,EAAKS,GAAG,QAAQ,QAAQ,SAASwD,EAAG,CAC9Bd,EAAOc,EAAE,OAIPA,EAAE,OAAO,SAAW,CAACvB,EAAqBS,EAAOc,EAAE,KAAK,KAAKjE,EAAKS,GAAG,IAAI,IAC3E0C,EAAOc,EAAE,KAAK,2BAA6B,IACzCA,EAAE,OAAO,SAAW,CAACvB,EAAqBS,EAAOc,EAAE,KAAK,IAAI,IAC9Dd,EAAOc,EAAE,KAAK,2BAA6B,IAEjD,CAAC,EACGmC,IAAe,EAAG,CAChB5G,EAAQ,SAAS,QAAQ,KAAK,wBAAwBQ,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,sCAAsC,EAC5H,QACF,CACA,IAAIiE,GAAY,GACZ0B,IAAe,GAAK,CAAC1D,EAAqB1C,EAAKS,GAAG,KAAM,CAAC,KAAO,EAAI,CAAC,IACvEiE,GAAY,IACd,IAAId,EAAU,KACd,GAAI,CAACc,GACHd,EAAUW,EAAuBvE,EAAKS,GAAIT,EAAKS,EAAE,MAC5C,CAEL,IAAI4F,GAAYrG,EAAKS,GAAG,QAAQ,OAAO,SAASwD,EAAG,CAAC,OAAOA,EAAE,OAAS,OAAQ,CAAC,EAAE,GAEjF,GADAoC,GAAYlD,EAAOkD,GAAU,KACzBA,KAAc,OAAW,CACvB7G,EAAQ,SAAS,QAAQ,KAAK,wBAAwBQ,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,4BAA6B4F,GAAU,KAAK,IAAIA,GAAU,IAAI,YAAY,EAChK,QACF,CACAA,GAAU,2BAA6B,GACvCzC,EAAUW,EAAuB8B,GAAWrG,EAAKS,EAAE,CACrD,CACA,GAAImD,IAAY,GAAO,CACjBpE,EAAQ,SAAS,QAAQ,KAAK,wBAAwBQ,EAAKS,GAAG,KAAK,IAAIT,EAAKS,GAAG,GAAG,yCAAyC,EAC/H,QACF,CACKhB,EAGHA,EAAgBZ,GAAO+E,CAAO,CAAC,EAF/BE,GAAgB,KAAKF,CAAO,CA6IhC,EAGF,QAASnD,EAAE,EAAEA,EAAEV,EAAK,OAAOU,IAEzB,GAAI0C,EAAOpD,EAAKU,GAAG,MAAQV,EAAKU,GAIhC,IAAI,CAAC7B,EAAE,QAAQmB,EAAKU,GAAG,KAAK,EAAG,CACzBjB,EAAQ,SAAS,QAAQ,KAAK,MAAMO,EAAKU,GAAG,KAAK,IAAIV,EAAKU,GAAG,GAAG,iCAAiC,EACrG,QACF,CACA,GAAI,CAAAV,EAAKU,GAAG,2BAEZ,CAAI,OAAOV,EAAKU,GAAG,IAAO,WAExBV,EAAKU,GAAG,GAAK,CAACV,EAAKU,GAAG,GAAG,QAAQ,YAAa,EAAE,GAElDV,EAAKU,GAAG,QAAU,GAClBV,EAAKU,GAAG,OAAS,GACjB,IAAI4D,GAAS,IAAI,MACjB,IAAKnB,EAAE,EAAEA,EAAEnD,EAAKU,GAAG,MAAM,OAAOyC,IAC1B,OAAOnD,EAAKU,GAAG,MAAMyC,IAAM,SAC7BmB,GAAO,KAAK,CAAC,CAACtE,EAAKU,GAAG,MAAMyC,GAAG,IAAK,CAACnD,EAAKU,GAAG,MAAMyC,GAAG,GAAG,CAAC,GAEtD1D,EAAQ,SAAS,QAAQ,KAAK,MAAMO,EAAKU,GAAG,KAAK,IAAIV,EAAKU,GAAG,GAAG,+BAA+B,EACnGV,EAAKU,GAAG,QAAU,IAGtB,GAAI4D,GAAO,QAAU,EAAG,CAClB7E,EAAQ,SAAS,QAAQ,KAAK,MAAMO,EAAKU,GAAG,KAAK,IAAIV,EAAKU,GAAG,GAAG,2CAA2C,EAC/G,QACF,CACA,IAAI6F,GAAW,aACX,OAAOvG,EAAKU,GAAG,MAAM,GAAM,KAAe,OAAOV,EAAKU,GAAG,MAAMV,EAAKU,GAAG,MAAM,OAAO,GAAM,KAC5FV,EAAKU,GAAG,MAAM,GAAG,KAAOV,EAAKU,GAAG,MAAMV,EAAKU,GAAG,MAAM,OAAO,GAAG,KAE5D,OAAOV,EAAKU,GAAG,KAAQ,KACvB8F,EAAkBxG,EAAKU,GAAG,IAAI,GAE9BV,EAAKU,GAAG,2BAGV6F,GAAW,UACXjC,GAAS,CAACA,EAAM,GAElB,IAAIT,EAAU,CACZ,KAAe,UACf,GAAe7D,EAAKU,GAAG,KAAK,IAAIV,EAAKU,GAAG,GACxC,WAAe,CACb,KAASV,EAAKU,GAAG,KACjB,GAASV,EAAKU,GAAG,GACjB,KAASV,EAAKU,GAAG,MAAQ,CAAC,EAC1B,UAAc8C,EAAQ,IAAOxD,EAAKU,GAAG,KAAO,CAAC,EAC7C,KAAQqC,EAAuB/C,EAAKU,EAAE,CACxC,EACA,SAAe,CACb,KAAS6F,GACT,YAAgBjC,EAClB,CACF,EACItE,EAAKU,GAAG,UACNjB,EAAQ,SAAS,QAAQ,KAAK,MAAMO,EAAKU,GAAG,KAAK,IAAIV,EAAKU,GAAG,GAAG,YAAY,EAChFmD,EAAQ,WAAW,QAAa,IAE9B7D,EAAKU,GAAG,0BACVmD,EAAQ,WAAW,SAAc,UAC9BnE,EAMHA,EAAgBZ,GAAO+E,CAAO,CAAC,EAL3B0C,IAAY,aACdzC,GAAa,KAAKD,CAAO,EAEzBE,GAAgB,KAAKF,CAAO,GAMlC,OAAInE,EACK,IAETiE,EAAU,CACR,KAAQ,oBACR,SAAY,CAAC,CACf,EACAA,EAAQ,SAAWA,EAAQ,SAAS,OAAOI,EAAe,EAC1DJ,EAAQ,SAAWA,EAAQ,SAAS,OAAOG,EAAY,EACvDH,EAAQ,SAAWA,EAAQ,SAAS,OAAOC,EAAY,EAEnDnE,EAAQ,gBACVkE,EAAQ,SAAS,QAAQ,SAAS8C,EAAG,CACnCA,EAAE,WAAa5H,EAAE,MACf4H,EAAE,WAAW,KACbA,EAAE,WAAW,KACb,CAAC,GAAIA,EAAE,WAAW,KAAK,IAAIA,EAAE,WAAW,EAAE,CAC5C,CACF,CAAC,EAGH9C,EAAU7E,GAAO6E,CAAO,EACjBA,EACT,CACA,SAAS6C,EAAmBxH,EAAO,CACjC,IAAID,EAAkBU,EAAQ,gBAC9B,GAAI,OAAOV,GAAoB,WAC7B,OAAOA,EAAgBC,CAAI,EAE7B,GAAKA,EAAK,OAAY,KACpB,MAAO,GAGT,QAAU0H,KAAO1H,EAAO,CACtB,IAAI2H,EAAM3H,EAAK0H,GACXE,EAAM7H,EAAgB2H,GAE1B,GAAK,SAAOE,EAAQ,MAGfD,IAAQ,OAGRC,IAAQ,IAERA,EAAI,iBAAmBA,EAAI,gBAAgBD,KAAS,IAEpDC,EAAI,iBAAmBA,EAAI,gBAAgBD,KAAS,IACvD,MAAO,EACX,CAEA,MAAO,EACT,CACF,EAGA,SAAStC,GAAKrE,EAAM,CAQlB,QAPI6G,EAAS,SAASC,EAAK,CAAC,OAAOA,EAAI,EAAE,EACrCC,EAAS,SAASD,EAAK,CAAC,OAAOA,EAAIA,EAAI,OAAO,EAAE,EAChDE,EAAe,SAASC,EAAIC,EAAI,CAClC,OAAOD,IAAO,QAAaC,IAAO,QAAaD,EAAG,KAAOC,EAAG,EAC9D,EAEIC,EAAS,CAAC,EAAGC,EAASC,EAAOC,EAAM5G,EAAG6G,EAAKC,EACxCxH,EAAK,QAGV,IAFAoH,EAAUpH,EAAK,IAAI,EAAE,MAAM,MAAM,EACjCmH,EAAO,KAAKC,CAAO,EACZpH,EAAK,QAAU,CAACgH,EAAaH,EAAOO,CAAO,EAAGL,EAAMK,CAAO,CAAC,GAAG,CAGpE,IAFAC,EAAQR,EAAOO,CAAO,EACtBE,EAAQP,EAAMK,CAAO,EAChB1G,EAAI,EAAGA,EAAIV,EAAK,OAAQU,IAE3B,GADA8G,EAAOxH,EAAKU,GAAG,MACXsG,EAAaM,EAAMT,EAAOW,CAAI,CAAC,EAAG,CACpCD,EAAOH,EAAQ,KACfI,EAAOA,EAAK,MAAM,CAAC,EACnB,KACF,SAAWR,EAAaM,EAAMP,EAAMS,CAAI,CAAC,EAAG,CAC1CD,EAAOH,EAAQ,KACfI,EAAOA,EAAK,MAAM,EAAG,EAAE,EAAE,QAAQ,EACjC,KACF,SAAWR,EAAaK,EAAON,EAAMS,CAAI,CAAC,EAAG,CAC3CD,EAAOH,EAAQ,QACfI,EAAOA,EAAK,MAAM,EAAG,EAAE,EACvB,KACF,SAAWR,EAAaK,EAAOR,EAAOW,CAAI,CAAC,EAAG,CAC5CD,EAAOH,EAAQ,QACfI,EAAOA,EAAK,MAAM,CAAC,EAAE,QAAQ,EAC7B,KACF,MACEA,EAAOD,EAAM,KAGjB,GAAI,CAACC,EACH,MACFxH,EAAK,OAAOU,EAAG,CAAC,EAChB6G,EAAI,MAAMH,EAASI,CAAI,CACzB,CAEF,OAAOL,CACT,CAGA5H,GAAa,UAAYA,GAEzBX,GAAO,QAAUW,KCxiCjB,IAAAkI,GAAyB,WCSlB,IAAIC,GAAc,YAOdC,GAAU,CACjB,YAAaD,GAAc,IAC3B,YAAaA,GAAc,IAC3B,QAASA,GAAc,OACvB,KAAMA,GAAc,QACpB,OAAQA,GAAc,MACtB,WAAYA,GAAc,IAC1B,WAAYA,GAAc,IAC1B,OAAQA,GACR,OAAQA,GACR,MAAOA,GAAc,SACrB,YAAaA,GAAc,IAC3B,YAAaA,GAAc,IAC3B,cAAeA,GAAc,KAC7B,QAAS,EACT,MAAOA,GAAc,MACzB,EAOWE,GAAe,CACtB,YAAa,IACb,YAAa,IACb,QAAS,EAAI,OACb,KAAM,QACN,OAAQ,MACR,WAAY,EAAI,IAChB,WAAY,EAAI,IAChB,OAAQ,EACR,OAAQ,EACR,MAAO,EAAI,SACX,YAAa,IACb,YAAa,IACb,cAAe,EAAI,KACnB,QAAS,EAAIF,GACb,MAAO,SACX,EA2CO,SAASG,GAAQC,EAAMC,EAAYC,EAAS,CAC3CA,IAAY,SAAUA,EAAU,CAAC,GACrC,IAAIC,EAAO,CAAE,KAAM,SAAU,EAC7B,OAAID,EAAQ,KAAO,GAAKA,EAAQ,MAC5BC,EAAK,GAAKD,EAAQ,IAElBA,EAAQ,OACRC,EAAK,KAAOD,EAAQ,MAExBC,EAAK,WAAaF,GAAc,CAAC,EACjCE,EAAK,SAAWH,EACTG,CACX,CAkDO,SAASC,GAAMC,EAAaC,EAAYC,EAAS,CAEpD,GADIA,IAAY,SAAUA,EAAU,CAAC,GACjC,CAACF,EACD,MAAM,IAAI,MAAM,yBAAyB,EAE7C,GAAI,CAAC,MAAM,QAAQA,CAAW,EAC1B,MAAM,IAAI,MAAM,8BAA8B,EAElD,GAAIA,EAAY,OAAS,EACrB,MAAM,IAAI,MAAM,6CAA6C,EAEjE,GAAI,CAACG,GAASH,EAAY,EAAE,GAAK,CAACG,GAASH,EAAY,EAAE,EACrD,MAAM,IAAI,MAAM,kCAAkC,EAEtD,IAAII,EAAO,CACP,KAAM,QACN,YAAaJ,CACjB,EACA,OAAOK,GAAQD,EAAMH,EAAYC,CAAO,CAC5C,CAiKO,SAASI,GAAkBC,EAAUC,EAAS,CAC7CA,IAAY,SAAUA,EAAU,CAAC,GACrC,IAAIC,EAAK,CAAE,KAAM,mBAAoB,EACrC,OAAID,EAAQ,KACRC,EAAG,GAAKD,EAAQ,IAEhBA,EAAQ,OACRC,EAAG,KAAOD,EAAQ,MAEtBC,EAAG,SAAWF,EACPE,CACX,CAsIO,SAASC,GAAgBC,EAASC,EAAO,CACxCA,IAAU,SAAUA,EAAQ,cAChC,IAAIC,EAASC,GAAQF,GACrB,GAAI,CAACC,EACD,MAAM,IAAI,MAAMD,EAAQ,mBAAmB,EAE/C,OAAOD,EAAUE,CACrB,CAiEO,SAASE,GAAiBC,EAAS,CACtC,IAAIC,EAAUD,EAAU,IACxB,OAAQC,EAAU,KAAK,GAAM,GACjC,CAqDO,SAASC,GAASC,EAAK,CAC1B,MAAO,CAAC,MAAMA,CAAG,GAAKA,IAAQ,MAAQ,CAAC,MAAM,QAAQA,CAAG,CAC5D,CCpkBA,SAASC,GAAUC,EAASC,EAAUC,EAAkB,CAEtD,GAAIF,IAAY,KA4BhB,QA3BIG,EACFC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAa,EACbC,EAAa,EACbC,EACAC,EAAOb,EAAQ,KACfc,EAAsBD,IAAS,oBAC/BE,EAAYF,IAAS,UACrBG,EAAOF,EAAsBd,EAAQ,SAAS,OAAS,EAchDiB,EAAe,EAAGA,EAAeD,EAAMC,IAAgB,CAC9DR,EAA0BK,EACtBd,EAAQ,SAASiB,GAAc,SAC/BF,EACAf,EAAQ,SACRA,EACJY,EAAuBH,EACnBA,EAAwB,OAAS,qBACjC,GACJF,EAAQK,EACJH,EAAwB,WAAW,OACnC,EAEJ,QAASS,EAAY,EAAGA,EAAYX,EAAOW,IAAa,CACtD,IAAIC,EAAoB,EACpBC,EAAgB,EAMpB,GALAd,EAAWM,EACPH,EAAwB,WAAWS,GACnCT,EAGAH,IAAa,KACjB,CAAAE,EAASF,EAAS,YAClB,IAAIe,EAAWf,EAAS,KAQxB,OANAI,EACER,IACCmB,IAAa,WAAaA,IAAa,gBACpC,EACA,EAEEA,EAAU,CAChB,KAAK,KACH,MACF,IAAK,QACH,GACEpB,EACEO,EACAG,EACAM,EACAE,EACAC,CACF,IAAM,GAEN,MAAO,GACTT,IACAQ,IACA,MACF,IAAK,aACL,IAAK,aACH,IAAKhB,EAAI,EAAGA,EAAIK,EAAO,OAAQL,IAAK,CAClC,GACEF,EACEO,EAAOL,GACPQ,EACAM,EACAE,EACAC,CACF,IAAM,GAEN,MAAO,GACTT,IACIU,IAAa,cAAcF,GACjC,CACIE,IAAa,cAAcF,IAC/B,MACF,IAAK,UACL,IAAK,kBACH,IAAKhB,EAAI,EAAGA,EAAIK,EAAO,OAAQL,IAAK,CAClC,IAAKC,EAAI,EAAGA,EAAII,EAAOL,GAAG,OAASO,EAAYN,IAAK,CAClD,GACEH,EACEO,EAAOL,GAAGC,GACVO,EACAM,EACAE,EACAC,CACF,IAAM,GAEN,MAAO,GACTT,GACF,CACIU,IAAa,mBAAmBF,IAChCE,IAAa,WAAWD,GAC9B,CACIC,IAAa,WAAWF,IAC5B,MACF,IAAK,eACH,IAAKhB,EAAI,EAAGA,EAAIK,EAAO,OAAQL,IAAK,CAElC,IADAiB,EAAgB,EACXhB,EAAI,EAAGA,EAAII,EAAOL,GAAG,OAAQC,IAAK,CACrC,IAAKC,EAAI,EAAGA,EAAIG,EAAOL,GAAGC,GAAG,OAASM,EAAYL,IAAK,CACrD,GACEJ,EACEO,EAAOL,GAAGC,GAAGC,GACbM,EACAM,EACAE,EACAC,CACF,IAAM,GAEN,MAAO,GACTT,GACF,CACAS,GACF,CACAD,GACF,CACA,MACF,IAAK,qBACH,IAAKhB,EAAI,EAAGA,EAAIG,EAAS,WAAW,OAAQH,IAC1C,GACEJ,GAAUO,EAAS,WAAWH,GAAIF,EAAUC,CAAgB,IAC5D,GAEA,MAAO,GACX,MACF,QACE,MAAM,IAAI,MAAM,uBAAuB,CAC3C,EACF,CACF,CACF,CA0MA,SAASoB,GAAYC,EAASC,EAAU,CACtC,GAAID,EAAQ,OAAS,UACnBC,EAASD,EAAS,CAAC,UACVA,EAAQ,OAAS,oBAC1B,QAASE,EAAI,EAAGA,EAAIF,EAAQ,SAAS,QAC/BC,EAASD,EAAQ,SAASE,GAAIA,CAAC,IAAM,GADEA,IAC3C,CAGN,CA4CA,SAASC,GAAcH,EAASC,EAAUG,EAAc,CACtD,IAAIC,EAAgBD,EACpB,OAAAL,GAAYC,EAAS,SAAUM,EAAgBC,EAAc,CACvDA,IAAiB,GAAKH,IAAiB,OACzCC,EAAgBC,EACbD,EAAgBJ,EAASI,EAAeC,EAAgBC,CAAY,CAC3E,CAAC,EACMF,CACT,CC/aA,SAASG,GAAQC,EAAS,CACxB,IAAIC,EAAS,CAAC,EACd,OAAID,EAAQ,OAAS,oBACnBE,GAAYF,EAAS,SAAUG,EAAS,CACtCC,GAAUD,EAAS,SAAUE,EAAO,CAClCJ,EAAO,KAAKK,GAAMD,EAAOF,EAAQ,UAAU,CAAC,CAC9C,CAAC,CACH,CAAC,EAEDC,GAAUJ,EAAS,SAAUK,EAAO,CAClCJ,EAAO,KAAKK,GAAMD,EAAOL,EAAQ,UAAU,CAAC,CAC9C,CAAC,EAEIO,GAAkBN,CAAM,CACjC,CAEA,IAAOO,GAAQT,GCnBf,SAASU,GAAKC,EAAS,CACnB,IAAIC,EAAS,CAAC,IAAU,IAAU,KAAW,IAAS,EACtD,OAAAC,GAAUF,EAAS,SAAUG,EAAO,CAC5BF,EAAO,GAAKE,EAAM,KAClBF,EAAO,GAAKE,EAAM,IAElBF,EAAO,GAAKE,EAAM,KAClBF,EAAO,GAAKE,EAAM,IAElBF,EAAO,GAAKE,EAAM,KAClBF,EAAO,GAAKE,EAAM,IAElBF,EAAO,GAAKE,EAAM,KAClBF,EAAO,GAAKE,EAAM,GAE1B,CAAC,EACMF,CACX,CACAF,GAAK,QAAaA,GAClB,IAAOK,GAAQL,GCRf,SAASM,GAAOC,EAASC,EAAS,CAC1BA,IAAY,SAAUA,EAAU,CAAC,GACrC,IAAIC,EAAMC,GAAKH,CAAO,EAClBI,GAAKF,EAAI,GAAKA,EAAI,IAAM,EACxBG,GAAKH,EAAI,GAAKA,EAAI,IAAM,EAC5B,OAAOI,GAAM,CAACF,EAAGC,CAAC,EAAGJ,EAAQ,WAAYA,CAAO,CACpD,CACA,IAAOE,GAAQJ,GCrBf,SAASQ,GAAMC,EAAS,CACpB,GAAI,CAACA,EACD,MAAM,IAAI,MAAM,qBAAqB,EAEzC,OAAQA,EAAQ,KAAM,CAClB,IAAK,UACD,OAAOC,GAAaD,CAAO,EAC/B,IAAK,oBACD,OAAOE,GAAuBF,CAAO,EACzC,IAAK,QACL,IAAK,aACL,IAAK,UACL,IAAK,aACL,IAAK,kBACL,IAAK,eACL,IAAK,qBACD,OAAOG,GAAcH,CAAO,EAChC,QACI,MAAM,IAAI,MAAM,sBAAsB,CAC9C,CACJ,CAQA,SAASC,GAAaD,EAAS,CAC3B,IAAII,EAAS,CAAE,KAAM,SAAU,EAE/B,cAAO,KAAKJ,CAAO,EAAE,QAAQ,SAAUK,EAAK,CACxC,OAAQA,EAAK,CACT,IAAK,OACL,IAAK,aACL,IAAK,WACD,OACJ,QACID,EAAOC,GAAOL,EAAQK,EAC9B,CACJ,CAAC,EAEDD,EAAO,WAAaE,GAAgBN,EAAQ,UAAU,EACtDI,EAAO,SAAWD,GAAcH,EAAQ,QAAQ,EACzCI,CACX,CAQA,SAASE,GAAgBC,EAAY,CACjC,IAAIH,EAAS,CAAC,EACd,OAAKG,GAGL,OAAO,KAAKA,CAAU,EAAE,QAAQ,SAAUF,EAAK,CAC3C,IAAIG,EAAQD,EAAWF,GACnB,OAAOG,GAAU,SACbA,IAAU,KAEVJ,EAAOC,GAAO,KAET,MAAM,QAAQG,CAAK,EAExBJ,EAAOC,GAAOG,EAAM,IAAI,SAAUC,EAAM,CACpC,OAAOA,CACX,CAAC,EAIDL,EAAOC,GAAOC,GAAgBE,CAAK,EAIvCJ,EAAOC,GAAOG,CAEtB,CAAC,EACMJ,CACX,CAQA,SAASF,GAAuBF,EAAS,CACrC,IAAII,EAAS,CAAE,KAAM,mBAAoB,EAEzC,cAAO,KAAKJ,CAAO,EAAE,QAAQ,SAAUK,EAAK,CACxC,OAAQA,EAAK,CACT,IAAK,OACL,IAAK,WACD,OACJ,QACID,EAAOC,GAAOL,EAAQK,EAC9B,CACJ,CAAC,EAEDD,EAAO,SAAWJ,EAAQ,SAAS,IAAI,SAAUU,EAAS,CACtD,OAAOT,GAAaS,CAAO,CAC/B,CAAC,EACMN,CACX,CAQA,SAASD,GAAcQ,EAAU,CAC7B,IAAIC,EAAO,CAAE,KAAMD,EAAS,IAAK,EAIjC,OAHIA,EAAS,OACTC,EAAK,KAAOD,EAAS,MAErBA,EAAS,OAAS,sBAClBC,EAAK,WAAaD,EAAS,WAAW,IAAI,SAAUE,EAAG,CACnD,OAAOV,GAAcU,CAAC,CAC1B,CAAC,EACMD,IAEXA,EAAK,YAAcE,GAAUH,EAAS,WAAW,EAC1CC,EACX,CAQA,SAASE,GAAUC,EAAQ,CACvB,IAAIX,EAASW,EACb,OAAI,OAAOX,EAAO,IAAO,SACdA,EAAO,MAAM,EAEjBA,EAAO,IAAI,SAAUY,EAAO,CAC/B,OAAOF,GAAUE,CAAK,CAC1B,CAAC,CACL,CACA,IAAOC,GAAQlB,GC/IR,SAASmB,GAASC,EAAO,CAC5B,GAAI,CAACA,EACD,MAAM,IAAI,MAAM,mBAAmB,EAEvC,GAAI,CAAC,MAAM,QAAQA,CAAK,EAAG,CACvB,GAAIA,EAAM,OAAS,WACfA,EAAM,WAAa,MACnBA,EAAM,SAAS,OAAS,QACxB,OAAOA,EAAM,SAAS,YAE1B,GAAIA,EAAM,OAAS,QACf,OAAOA,EAAM,WAErB,CACA,GAAI,MAAM,QAAQA,CAAK,GACnBA,EAAM,QAAU,GAChB,CAAC,MAAM,QAAQA,EAAM,EAAE,GACvB,CAAC,MAAM,QAAQA,EAAM,EAAE,EACvB,OAAOA,EAEX,MAAM,IAAI,MAAM,oDAAoD,CACxE,CAyJO,SAASC,GAAQC,EAAS,CAC7B,OAAIA,EAAQ,OAAS,UACVA,EAAQ,SAEZA,CACX,CCtKA,SAASC,GAASC,EAAMC,EAAIC,EAAS,CAC7BA,IAAY,SAAUA,EAAU,CAAC,GACrC,IAAIC,EAAeC,GAASJ,CAAI,EAC5BK,EAAeD,GAASH,CAAE,EAC1BK,EAAOC,GAAiBF,EAAa,GAAKF,EAAa,EAAE,EACzDK,EAAOD,GAAiBF,EAAa,GAAKF,EAAa,EAAE,EACzDM,EAAOF,GAAiBJ,EAAa,EAAE,EACvCO,EAAOH,GAAiBF,EAAa,EAAE,EACvCM,EAAI,KAAK,IAAI,KAAK,IAAIL,EAAO,CAAC,EAAG,CAAC,EAClC,KAAK,IAAI,KAAK,IAAIE,EAAO,CAAC,EAAG,CAAC,EAAI,KAAK,IAAIC,CAAI,EAAI,KAAK,IAAIC,CAAI,EACpE,OAAOE,GAAgB,EAAI,KAAK,MAAM,KAAK,KAAKD,CAAC,EAAG,KAAK,KAAK,EAAIA,CAAC,CAAC,EAAGT,EAAQ,KAAK,CACxF,CACA,IAAOW,GAAQd,GCXf,SAASe,GAAaC,EAAaC,EAAQ,CAEvC,GAAI,CAACD,EACD,MAAM,IAAI,MAAM,yBAAyB,EAC7C,GAAI,CAACC,EACD,MAAM,IAAI,MAAM,oBAAoB,EACxC,IAAIC,EACAC,EAAU,IACVC,EAAmB,EACvB,OAAAC,GAAYJ,EAAQ,SAAUK,EAAIC,EAAc,CAC5C,IAAIC,EAAkBC,GAAST,EAAaM,CAAE,EAC1CE,EAAkBL,IAClBC,EAAmBG,EACnBJ,EAAUK,EAElB,CAAC,EACDN,EAAUO,GAAMR,EAAO,SAASG,EAAiB,EACjDF,EAAQ,WAAW,aAAeE,EAClCF,EAAQ,WAAW,gBAAkBC,EAC9BD,CACX,CACA,IAAOO,GAAQV,GCpBA,SAARW,GAAuCC,EAAOC,EAASC,EAAS,CAGnE,GAFIA,IAAY,SAAUA,EAAU,CAAC,GAEjC,CAACF,EACD,MAAM,IAAI,MAAM,mBAAmB,EAEvC,GAAI,CAACC,EACD,MAAM,IAAI,MAAM,qBAAqB,EAEzC,IAAIE,EAAKC,GAASJ,CAAK,EACnBK,EAAOC,GAAQL,CAAO,EACtBM,EAAOF,EAAK,KACZG,EAAOP,EAAQ,KACfQ,EAAQJ,EAAK,YAEjB,GAAIG,GAAQE,GAAOP,EAAIK,CAAI,IAAM,GAC7B,MAAO,GAGPD,IAAS,YACTE,EAAQ,CAACA,CAAK,GAGlB,QADIE,EAAa,GACRC,EAAI,EAAGA,EAAIH,EAAM,QAAU,CAACE,EAAYC,IAE7C,GAAIC,GAAOV,EAAIM,EAAMG,GAAG,GAAIV,EAAQ,cAAc,EAAG,CAIjD,QAHIY,EAAS,GACTC,EAAI,EAEDA,EAAIN,EAAMG,GAAG,QAAU,CAACE,GACvBD,GAAOV,EAAIM,EAAMG,GAAGG,GAAI,CAACb,EAAQ,cAAc,IAC/CY,EAAS,IAEbC,IAECD,IACDH,EAAa,GAErB,CAEJ,OAAOA,CACX,CAUA,SAASE,GAAOV,EAAIa,EAAMC,EAAgB,CACtC,IAAIC,EAAW,GACXF,EAAK,GAAG,KAAOA,EAAKA,EAAK,OAAS,GAAG,IACrCA,EAAK,GAAG,KAAOA,EAAKA,EAAK,OAAS,GAAG,KACrCA,EAAOA,EAAK,MAAM,EAAGA,EAAK,OAAS,CAAC,GAExC,QAASJ,EAAI,EAAGO,EAAIH,EAAK,OAAS,EAAGJ,EAAII,EAAK,OAAQG,EAAIP,IAAK,CAC3D,IAAIQ,EAAKJ,EAAKJ,GAAG,GACbS,EAAKL,EAAKJ,GAAG,GACbU,EAAKN,EAAKG,GAAG,GACbI,EAAKP,EAAKG,GAAG,GACbK,EAAarB,EAAG,IAAMiB,EAAKE,GAAMD,GAAMC,EAAKnB,EAAG,IAAMoB,GAAMpB,EAAG,GAAKiB,KAAQ,IAC1EA,EAAKjB,EAAG,KAAOmB,EAAKnB,EAAG,KAAO,IAC9BkB,EAAKlB,EAAG,KAAOoB,EAAKpB,EAAG,KAAO,EACnC,GAAIqB,EACA,MAAO,CAACP,EAEZ,IAAIQ,EAAYJ,EAAKlB,EAAG,IAAOoB,EAAKpB,EAAG,IACnCA,EAAG,IAAOmB,EAAKF,IAAOjB,EAAG,GAAKkB,IAAQE,EAAKF,GAAMD,EACjDK,IACAP,EAAW,CAACA,EAEpB,CACA,OAAOA,CACX,CASA,SAASR,GAAOP,EAAIK,EAAM,CACtB,OAAQA,EAAK,IAAML,EAAG,IAAMK,EAAK,IAAML,EAAG,IAAMK,EAAK,IAAML,EAAG,IAAMK,EAAK,IAAML,EAAG,EACtF,CClFA,SAASuB,GAAeC,EAAS,CAU/B,QARIC,EAAKC,GAAUF,CAAO,EAGtBG,EAAOC,GAASH,CAAE,EAGlBI,EAAY,GACZC,EAAI,EACD,CAACD,GAAaC,EAAIL,EAAG,SAAS,QAAQ,CAC3C,IAAIM,EAAON,EAAG,SAASK,GAAG,SACtBE,EAAGC,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EACtBC,EAAS,GACb,GAAIR,EAAK,OAAS,QAEdJ,EAAK,SAAS,YAAY,KAAOI,EAAK,YAAY,IAClDJ,EAAK,SAAS,YAAY,KAAOI,EAAK,YAAY,KAElDF,EAAY,YAELE,EAAK,OAAS,aAAc,CACrC,IAAIS,EAAe,GAEnB,IADAF,EAAI,EACG,CAACE,GAAgBF,EAAIP,EAAK,YAAY,QAEzCJ,EAAK,SAAS,YAAY,KAAOI,EAAK,YAAYO,GAAG,IACrDX,EAAK,SAAS,YAAY,KAAOI,EAAK,YAAYO,GAAG,KAErDT,EAAY,GACZW,EAAe,IAEjBF,GAEJ,SAAWP,EAAK,OAAS,aAEvB,IADAO,EAAI,EACG,CAACC,GAAUD,EAAIP,EAAK,YAAY,OAAS,GAC9CC,EAAIL,EAAK,SAAS,YAAY,GAC9BM,EAAIN,EAAK,SAAS,YAAY,GAC9BO,EAAKH,EAAK,YAAYO,GAAG,GACzBH,EAAKJ,EAAK,YAAYO,GAAG,GACzBF,EAAKL,EAAK,YAAYO,EAAI,GAAG,GAC7BD,EAAKN,EAAK,YAAYO,EAAI,GAAG,GACzBG,GAAeT,EAAGC,EAAGC,EAAIC,EAAIC,EAAIC,CAAE,IACrCE,EAAS,GACTV,EAAY,IAEdS,YAEOP,EAAK,OAAS,kBAEvB,QADIW,EAAI,EACDA,EAAIX,EAAK,YAAY,QAAQ,CAClCQ,EAAS,GACTD,EAAI,EAEJ,QADIK,EAAOZ,EAAK,YAAYW,GACrB,CAACH,GAAUD,EAAIK,EAAK,OAAS,GAClCX,EAAIL,EAAK,SAAS,YAAY,GAC9BM,EAAIN,EAAK,SAAS,YAAY,GAC9BO,EAAKS,EAAKL,GAAG,GACbH,EAAKQ,EAAKL,GAAG,GACbF,EAAKO,EAAKL,EAAI,GAAG,GACjBD,EAAKM,EAAKL,EAAI,GAAG,GACbG,GAAeT,EAAGC,EAAGC,EAAIC,EAAIC,EAAIC,CAAE,IACrCE,EAAS,GACTV,EAAY,IAEdS,IAEFI,GACF,MACSX,EAAK,OAAS,WAAaA,EAAK,OAAS,iBAC9Ca,GAAsBjB,EAAMI,CAAI,IAClCF,EAAY,IAGhBC,GACF,CACA,GAAID,EACF,OAAOF,EAEP,IAAIkB,EAAWC,GAAkB,CAAC,CAAC,EACnC,IAAKhB,EAAI,EAAGA,EAAIL,EAAG,SAAS,OAAQK,IAClCe,EAAS,SAAWA,EAAS,SAAS,OACpCjB,GAAQH,EAAG,SAASK,EAAE,EAAE,QAC1B,EAGF,OAAOiB,GAAMnB,GAAaD,EAAMkB,CAAQ,EAAE,SAAS,WAAW,CAElE,CAUA,SAASnB,GAAUF,EAAS,CAC1B,OAAIA,EAAQ,OAAS,oBACfA,EAAQ,OAAS,UACZsB,GAAkB,CAACE,GAAQxB,CAAO,CAAC,CAAC,EAEtCsB,GAAkB,CAACtB,CAAO,CAAC,EAE7BA,CACT,CAEA,SAASiB,GAAeT,EAAGC,EAAGC,EAAIC,EAAIC,EAAIC,EAAI,CAC5C,IAAIY,EAAK,KAAK,MAAMb,EAAKF,IAAOE,EAAKF,IAAOG,EAAKF,IAAOE,EAAKF,EAAG,EAC5De,EAAK,KAAK,MAAMlB,EAAIE,IAAOF,EAAIE,IAAOD,EAAIE,IAAOF,EAAIE,EAAG,EACxDgB,EAAK,KAAK,MAAMf,EAAKJ,IAAMI,EAAKJ,IAAMK,EAAKJ,IAAMI,EAAKJ,EAAE,EAC5D,OAAOgB,IAAOC,EAAKC,CACrB,CAEA,IAAOvB,GAAQL,GXjJf,KAAK,UAAY,MAAO6B,GAAU,CAChC,IAAMC,EAAKC,GAAcF,CAAK,EAAE,OAAO,eAAe,EACtD,GAAI,CACF,OAAa,CACX,GAAM,CAAE,KAAAG,EAAM,MAAAC,CAAM,EAAI,MAAMH,EAAG,KAAK,EACtC,GAAIE,EAAM,CACR,KAAK,YAAY,CAAE,KAAM,UAAW,MAAAC,CAAM,CAAC,EAC3C,KACF,MACE,KAAK,YAAY,CAAE,KAAM,WAAY,MAAAA,CAAM,CAAC,CAEhD,CACF,OAASA,EAAP,CACA,QAAQ,MAAMA,CAAK,EACnB,KAAK,YAAY,CAAE,KAAM,UAAW,MAAAA,CAAM,CAAC,CAC7C,CACF,EAEA,eAAgBF,GAAc,CAAE,KAAAG,CAAK,EAAG,CACtC,GAAM,CAAE,IAAAC,CAAI,EAAID,EAEVE,EAAM,MAAM,MAAM,0CAA2C,CACjE,OAAQ,OACR,KAAM,IAAI,gBAAgB,CACxB,KAAMD,CACR,CAAC,CACH,CAAC,EAED,KAAM,yBAEN,IAAME,EAAW,MAAMD,EAAI,KAAK,EAEhC,KAAM,YAAY,KAAK,UAAUC,CAAQ,EAAE,eAC3C,KAAM,8BACN,IAAMC,KAAU,GAAAC,SAAaF,CAAQ,EAErC,KAAM,0BACN,IAAMG,EAAYC,GAA0BH,CAAO,EAE7CI,EAAYC,GAAKL,CAAO,EAE9B,MAAO,CAAE,QAAAA,EAAS,UAAAE,EAAW,KAAAE,CAAK,CACpC,CAEA,IAAMD,GAA6BH,GACrBM,GACLC,GACHP,EACA,CAACQ,EAAeC,IAAmB,CACjC,GAAM,CAAE,GAAAC,EAAI,WAAAC,CAAW,EAAIF,EACrB,CAAE,SAAAG,CAAS,EAASP,GAAeI,CAAc,EACjDI,EAAeA,GAAQD,EAAUD,EAAY,CAAE,GAAAD,CAAG,CAAC,EACzD,OAAAF,EAAc,KAAKK,CAAO,EACnBL,CACT,EACA,CAAC,CACH,CACF",
  "names": ["require_lodash_custom", "__commonJSMin", "exports", "module", "undefined", "VERSION", "LARGE_ARRAY_SIZE", "FUNC_ERROR_TEXT", "HASH_UNDEFINED", "UNORDERED_COMPARE_FLAG", "PARTIAL_COMPARE_FLAG", "INFINITY", "MAX_SAFE_INTEGER", "argsTag", "arrayTag", "boolTag", "dateTag", "errorTag", "funcTag", "genTag", "mapTag", "numberTag", "objectTag", "promiseTag", "regexpTag", "setTag", "stringTag", "symbolTag", "weakMapTag", "arrayBufferTag", "dataViewTag", "float32Tag", "float64Tag", "int8Tag", "int16Tag", "int32Tag", "uint8Tag", "uint8ClampedTag", "uint16Tag", "uint32Tag", "reIsDeepProp", "reIsPlainProp", "reLeadingDot", "rePropName", "reRegExpChar", "reEscapeChar", "reFlags", "reIsHostCtor", "reIsUint", "typedArrayTags", "cloneableTags", "freeGlobal", "freeSelf", "root", "freeExports", "freeModule", "moduleExports", "freeProcess", "nodeUtil", "nodeIsTypedArray", "addMapEntry", "map", "pair", "addSetEntry", "set", "value", "apply", "func", "thisArg", "args", "arrayEach", "array", "iteratee", "index", "length", "arrayPush", "values", "offset", "arrayReduce", "accumulator", "initAccum", "arraySome", "predicate", "baseProperty", "key", "object", "baseTimes", "n", "result", "baseUnary", "getValue", "isHostObject", "mapToArray", "overArg", "transform", "arg", "setToArray", "arrayProto", "funcProto", "objectProto", "coreJsData", "maskSrcKey", "uid", "funcToString", "hasOwnProperty", "objectCtorString", "objectToString", "reIsNative", "Buffer", "Symbol", "Uint8Array", "getPrototype", "objectCreate", "propertyIsEnumerable", "splice", "nativeGetSymbols", "nativeIsBuffer", "nativeKeys", "nativeMax", "DataView", "getNative", "Map", "Promise", "Set", "WeakMap", "nativeCreate", "nonEnumShadows", "realNames", "dataViewCtorString", "toSource", "mapCtorString", "promiseCtorString", "setCtorString", "weakMapCtorString", "symbolProto", "symbolValueOf", "symbolToString", "lodash", "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", "setCacheAdd", "setCacheHas", "Stack", "stackClear", "stackDelete", "stackGet", "stackHas", "stackSet", "cache", "pairs", "arrayLikeKeys", "inherited", "isArray", "isArguments", "skipIndexes", "isIndex", "assignMergeValue", "eq", "assignValue", "objValue", "baseAssign", "source", "copyObject", "keys", "baseClone", "isDeep", "isFull", "customizer", "stack", "isObject", "isArr", "initCloneArray", "copyArray", "tag", "getTag", "isFunc", "isBuffer", "cloneBuffer", "initCloneObject", "copySymbols", "initCloneByTag", "stacked", "props", "getAllKeys", "subValue", "baseCreate", "proto", "baseEach", "createBaseEach", "baseForOwn", "baseFor", "createBaseFor", "baseGet", "path", "isKey", "castPath", "toKey", "baseGetAllKeys", "keysFunc", "symbolsFunc", "baseGetTag", "baseHasIn", "baseIsEqual", "other", "bitmask", "isObjectLike", "baseIsEqualDeep", "equalFunc", "objIsArr", "othIsArr", "objTag", "othTag", "objIsObj", "othIsObj", "isSameTag", "isTypedArray", "equalArrays", "equalByTag", "objIsWrapped", "othIsWrapped", "objUnwrapped", "othUnwrapped", "equalObjects", "baseIsMatch", "matchData", "noCustomizer", "srcValue", "baseIsNative", "isMasked", "pattern", "isFunction", "baseIsTypedArray", "isLength", "baseIteratee", "identity", "baseMatchesProperty", "baseMatches", "property", "baseKeys", "isPrototype", "baseKeysIn", "nativeKeysIn", "isProto", "getMatchData", "matchesStrictComparable", "isStrictComparable", "get", "hasIn", "baseMerge", "srcIndex", "baseMergeDeep", "newValue", "mergeFunc", "isCommon", "isArrayLikeObject", "isPlainObject", "toPlainObject", "basePropertyDeep", "baseRest", "start", "otherArgs", "baseToString", "isSymbol", "stringToPath", "buffer", "cloneArrayBuffer", "arrayBuffer", "cloneDataView", "dataView", "cloneMap", "cloneFunc", "cloneRegExp", "regexp", "cloneSet", "cloneSymbol", "symbol", "cloneTypedArray", "typedArray", "getSymbols", "createAssigner", "assigner", "sources", "guard", "isIterateeCall", "eachFunc", "fromRight", "collection", "isArrayLike", "iterable", "isPartial", "arrLength", "othLength", "seen", "arrValue", "othValue", "compared", "othIndex", "convert", "objProps", "objLength", "othProps", "skipCtor", "objCtor", "othCtor", "getIteratee", "isKeyable", "stubArray", "Ctor", "ctorString", "hasPath", "hasFunc", "type", "memoize", "string", "toString", "match", "number", "quote", "compact", "resIndex", "forEach", "resolver", "memoized", "clone", "stubFalse", "isEmpty", "keysIn", "defaultValue", "merge", "require_geojson_rewind", "__commonJSMin", "exports", "module", "rewind", "gj", "outer", "type", "i", "rewindRings", "rings", "rewindRing", "ring", "dir", "area", "err", "len", "j", "k", "m", "require_osm_polygon_features", "__commonJSMin", "exports", "module", "require_osmtogeojson", "__commonJSMin", "exports", "module", "_", "rewind", "polygonFeatures", "tags", "list", "tagValuesObj", "value", "default_deduplicator", "objectA", "objectB", "osmtogeojson", "data", "options", "featureCallback", "result", "_osmXML2geoJSON", "_overpassJSON2geoJSON", "json", "nodes", "ways", "rels", "centerGeometry", "object", "pseudoNode", "boundsGeometry", "pseudoWay", "addPseudoNode", "lat", "lon", "i", "fullGeometryWay", "way", "addFullGeometryNode", "id", "geometryNode", "nd", "fullGeometryRelation", "rel", "addFullGeometryWay", "geometry", "geometryWay", "addFullGeometryWayPseudoNode", "geometryPseudoNode", "member", "node", "has_full_geometry", "_convert2geoJSON", "xml", "copy_attribute", "x", "o", "attr", "centroid", "bounds", "nds", "members", "tag", "nodeObject", "wnodes", "wayObject", "relation", "relObject", "has_interesting_tags", "t", "ignore_tags", "k", "build_meta_information", "res", "nodeids", "poinids", "j", "wayids", "waynids", "pois", "relids", "relsmap", "m_type", "m_ref", "geojson", "geojsonnodes", "feature", "geojsonlines", "geojsonpolygons", "construct_multilinestring", "is_tainted", "m", "n", "linestrings", "join", "coords", "linestring", "construct_multipolygon", "tag_object", "mp_geometry", "simple_mp", "mp_id", "outers", "inners", "mp", "findOuter", "inner", "polygonIntersectsPolygon", "outer", "pointInPolygon", "mapCoordinates", "from", "point", "polygon", "y", "inside", "xi", "yi", "xj", "yj", "intersect", "mp_coords", "cluster", "cl", "ring", "mp_type", "outer_count", "outer_way", "way_type", "_isPolygonFeature", "f", "key", "val", "pfk", "_first", "arr", "_last", "_fitTogether", "n1", "n2", "joined", "current", "first", "last", "how", "what", "import_osmtogeojson", "earthRadius", "factors", "unitsFactors", "feature", "geom", "properties", "options", "feat", "point", "coordinates", "properties", "options", "isNumber", "geom", "feature", "featureCollection", "features", "options", "fc", "radiansToLength", "radians", "units", "factor", "factors", "degreesToRadians", "degrees", "radians", "isNumber", "num", "coordEach", "geojson", "callback", "excludeWrapCoord", "j", "k", "l", "geometry", "stopG", "coords", "geometryMaybeCollection", "wrapShrink", "coordIndex", "isGeometryCollection", "type", "isFeatureCollection", "isFeature", "stop", "featureIndex", "geomIndex", "multiFeatureIndex", "geometryIndex", "geomType", "featureEach", "geojson", "callback", "i", "featureReduce", "initialValue", "previousValue", "currentFeature", "featureIndex", "explode", "geojson", "points", "featureEach", "feature", "coordEach", "coord", "point", "featureCollection", "es_default", "bbox", "geojson", "result", "coordEach", "coord", "es_default", "center", "geojson", "options", "ext", "es_default", "x", "y", "point", "clone", "geojson", "cloneFeature", "cloneFeatureCollection", "cloneGeometry", "cloned", "key", "cloneProperties", "properties", "value", "item", "feature", "geometry", "geom", "g", "deepSlice", "coords", "coord", "es_default", "getCoord", "coord", "getGeom", "geojson", "distance", "from", "to", "options", "coordinates1", "getCoord", "coordinates2", "dLat", "degreesToRadians", "dLon", "lat1", "lat2", "a", "radiansToLength", "es_default", "nearestPoint", "targetPoint", "points", "nearest", "minDist", "bestFeatureIndex", "featureEach", "pt", "featureIndex", "distanceToPoint", "es_default", "booleanPointInPolygon", "point", "polygon", "options", "pt", "getCoord", "geom", "getGeom", "type", "bbox", "polys", "inBBox", "insidePoly", "i", "inRing", "inHole", "k", "ring", "ignoreBoundary", "isInside", "j", "xi", "yi", "xj", "yj", "onBoundary", "intersect", "pointOnFeature", "geojson", "fc", "normalize", "cent", "es_default", "onSurface", "i", "geom", "x", "y", "x1", "y1", "x2", "y2", "k", "onLine", "onMultiPoint", "pointOnSegment", "j", "line", "booleanPointInPolygon", "vertices", "featureCollection", "point", "feature", "ab", "ap", "pb", "event", "it", "handleMessage", "done", "value", "data", "txt", "req", "osm_data", "geojson", "osmtogeojson", "centroids", "replaceGeometryWithPoints", "bbox", "es_default", "featureCollection", "featureReduce", "previousValue", "currentFeature", "id", "properties", "geometry", "feature"]
}