{"version":3,"file":"index.min.js","sources":["../node_modules/core-js/internals/global.js","../node_modules/core-js/internals/fails.js","../node_modules/core-js/internals/descriptors.js","../node_modules/core-js/internals/function-call.js","../node_modules/core-js/internals/object-property-is-enumerable.js","../node_modules/core-js/internals/engine-v8-version.js","../node_modules/core-js/internals/create-property-descriptor.js","../node_modules/core-js/internals/function-uncurry-this.js","../node_modules/core-js/internals/classof-raw.js","../node_modules/core-js/internals/indexed-object.js","../node_modules/core-js/internals/require-object-coercible.js","../node_modules/core-js/internals/to-indexed-object.js","../node_modules/core-js/internals/is-callable.js","../node_modules/core-js/internals/is-object.js","../node_modules/core-js/internals/get-built-in.js","../node_modules/core-js/internals/object-is-prototype-of.js","../node_modules/core-js/internals/engine-user-agent.js","../node_modules/core-js/internals/native-symbol.js","../node_modules/core-js/internals/use-symbol-as-uid.js","../node_modules/core-js/internals/is-symbol.js","../node_modules/core-js/internals/try-to-string.js","../node_modules/core-js/internals/a-callable.js","../node_modules/core-js/internals/get-method.js","../node_modules/core-js/internals/ordinary-to-primitive.js","../node_modules/core-js/internals/set-global.js","../node_modules/core-js/internals/shared-store.js","../node_modules/core-js/internals/shared.js","../node_modules/core-js/internals/to-object.js","../node_modules/core-js/internals/has-own-property.js","../node_modules/core-js/internals/uid.js","../node_modules/core-js/internals/well-known-symbol.js","../node_modules/core-js/internals/to-primitive.js","../node_modules/core-js/internals/to-property-key.js","../node_modules/core-js/internals/document-create-element.js","../node_modules/core-js/internals/ie8-dom-define.js","../node_modules/core-js/internals/object-get-own-property-descriptor.js","../node_modules/core-js/internals/an-object.js","../node_modules/core-js/internals/object-define-property.js","../node_modules/core-js/internals/create-non-enumerable-property.js","../node_modules/core-js/internals/inspect-source.js","../node_modules/core-js/internals/internal-state.js","../node_modules/core-js/internals/native-weak-map.js","../node_modules/core-js/internals/shared-key.js","../node_modules/core-js/internals/hidden-keys.js","../node_modules/core-js/internals/function-name.js","../node_modules/core-js/internals/redefine.js","../node_modules/core-js/internals/to-integer-or-infinity.js","../node_modules/core-js/internals/to-absolute-index.js","../node_modules/core-js/internals/to-length.js","../node_modules/core-js/internals/length-of-array-like.js","../node_modules/core-js/internals/array-includes.js","../node_modules/core-js/internals/object-keys-internal.js","../node_modules/core-js/internals/enum-bug-keys.js","../node_modules/core-js/internals/object-get-own-property-names.js","../node_modules/core-js/internals/object-get-own-property-symbols.js","../node_modules/core-js/internals/own-keys.js","../node_modules/core-js/internals/copy-constructor-properties.js","../node_modules/core-js/internals/is-forced.js","../node_modules/core-js/internals/export.js","../node_modules/core-js/internals/function-bind-context.js","../node_modules/core-js/internals/is-array.js","../node_modules/core-js/internals/to-string-tag-support.js","../node_modules/core-js/internals/classof.js","../node_modules/core-js/internals/is-constructor.js","../node_modules/core-js/internals/array-species-constructor.js","../node_modules/core-js/internals/array-species-create.js","../node_modules/core-js/internals/array-iteration.js","../node_modules/core-js/internals/array-method-has-species-support.js","../node_modules/core-js/modules/es.array.map.js","../node_modules/tslib/tslib.es6.js","../node_modules/core-js/internals/object-to-string.js","../node_modules/core-js/modules/es.object.to-string.js","../node_modules/core-js/modules/es.array.filter.js","../src/cluster.ts","../src/algorithms/utils.ts","../src/algorithms/core.ts","../node_modules/core-js/internals/dom-token-list-prototype.js","../node_modules/core-js/internals/array-method-is-strict.js","../node_modules/core-js/internals/array-for-each.js","../node_modules/core-js/modules/web.dom-collections.for-each.js","../node_modules/core-js/internals/dom-iterables.js","../node_modules/core-js/modules/web.url.to-json.js","../src/algorithms/grid.ts","../src/algorithms/noop.ts","../node_modules/@turf/helpers/dist/es/index.js","../node_modules/@turf/clone/dist/es/index.js","../node_modules/@turf/meta/dist/es/index.js","../node_modules/skmeans/dist/node/distance.js","../node_modules/skmeans/dist/node/kinit.js","../node_modules/skmeans/dist/node/main.js","../src/algorithms/kmeans.ts","../node_modules/@turf/clusters-kmeans/dist/es/index.js","../node_modules/core-js/internals/object-keys.js","../node_modules/core-js/internals/object-assign.js","../node_modules/core-js/modules/es.object.assign.js","../node_modules/@turf/invariant/dist/es/index.js","../node_modules/@turf/distance/dist/es/index.js","../node_modules/density-clustering/lib/DBSCAN.js","../node_modules/density-clustering/lib/KMEANS.js","../node_modules/density-clustering/lib/PriorityQueue.js","../node_modules/density-clustering/lib/OPTICS.js","../node_modules/density-clustering/lib/index.js","../src/algorithms/dbscan.ts","../node_modules/@turf/clusters-dbscan/dist/es/index.js","../node_modules/kdbush/kdbush.js","../node_modules/supercluster/index.js","../node_modules/core-js/internals/object-create.js","../node_modules/fast-deep-equal/es6/index.js","../src/algorithms/supercluster.ts","../node_modules/core-js/internals/object-define-properties.js","../node_modules/core-js/internals/html.js","../node_modules/core-js/internals/add-to-unscopables.js","../node_modules/core-js/modules/es.array.includes.js","../node_modules/core-js/internals/is-regexp.js","../node_modules/core-js/internals/not-a-regexp.js","../node_modules/core-js/internals/to-string.js","../node_modules/core-js/internals/correct-is-regexp-logic.js","../node_modules/core-js/modules/es.string.includes.js","../node_modules/core-js/internals/create-property.js","../node_modules/core-js/modules/es.array.splice.js","../node_modules/core-js/internals/a-possible-prototype.js","../node_modules/core-js/internals/object-set-prototype-of.js","../node_modules/core-js/internals/inherit-if-required.js","../node_modules/core-js/internals/this-number-value.js","../node_modules/core-js/internals/string-trim.js","../node_modules/core-js/modules/es.number.constructor.js","../src/renderer.ts","../src/markerclusterer.ts","../src/overlay-view-safe.ts"],"sourcesContent":["var check = function (it) {\n  return it && it.Math == Math && it;\n};\n\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nmodule.exports =\n  // eslint-disable-next-line es/no-global-this -- safe\n  check(typeof globalThis == 'object' && globalThis) ||\n  check(typeof window == 'object' && window) ||\n  // eslint-disable-next-line no-restricted-globals -- safe\n  check(typeof self == 'object' && self) ||\n  check(typeof global == 'object' && global) ||\n  // eslint-disable-next-line no-new-func -- fallback\n  (function () { return this; })() || Function('return this')();\n","module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (error) {\n    return true;\n  }\n};\n","var fails = require('../internals/fails');\n\n// Detect IE8's incomplete defineProperty implementation\nmodule.exports = !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty({}, 1, { get: function () { return 7; } })[1] != 7;\n});\n","var call = Function.prototype.call;\n\nmodule.exports = call.bind ? call.bind(call) : function () {\n  return call.apply(call, arguments);\n};\n","'use strict';\nvar $propertyIsEnumerable = {}.propertyIsEnumerable;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Nashorn ~ JDK8 bug\nvar NASHORN_BUG = getOwnPropertyDescriptor && !$propertyIsEnumerable.call({ 1: 2 }, 1);\n\n// `Object.prototype.propertyIsEnumerable` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.propertyisenumerable\nexports.f = NASHORN_BUG ? function propertyIsEnumerable(V) {\n  var descriptor = getOwnPropertyDescriptor(this, V);\n  return !!descriptor && descriptor.enumerable;\n} : $propertyIsEnumerable;\n","var global = require('../internals/global');\nvar userAgent = require('../internals/engine-user-agent');\n\nvar process = global.process;\nvar Deno = global.Deno;\nvar versions = process && process.versions || Deno && Deno.version;\nvar v8 = versions && versions.v8;\nvar match, version;\n\nif (v8) {\n  match = v8.split('.');\n  // in old Chrome, versions of V8 isn't V8 = Chrome / 10\n  // but their correct versions are not interesting for us\n  version = match[0] > 0 && match[0] < 4 ? 1 : +(match[0] + match[1]);\n}\n\n// BrowserFS NodeJS `process` polyfill incorrectly set `.v8` to `0.0`\n// so check `userAgent` even if `.v8` exists, but 0\nif (!version && userAgent) {\n  match = userAgent.match(/Edge\\/(\\d+)/);\n  if (!match || match[1] >= 74) {\n    match = userAgent.match(/Chrome\\/(\\d+)/);\n    if (match) version = +match[1];\n  }\n}\n\nmodule.exports = version;\n","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","var FunctionPrototype = Function.prototype;\nvar bind = FunctionPrototype.bind;\nvar call = FunctionPrototype.call;\nvar callBind = bind && bind.bind(call);\n\nmodule.exports = bind ? function (fn) {\n  return fn && callBind(call, fn);\n} : function (fn) {\n  return fn && function () {\n    return call.apply(fn, arguments);\n  };\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nvar toString = uncurryThis({}.toString);\nvar stringSlice = uncurryThis(''.slice);\n\nmodule.exports = function (it) {\n  return stringSlice(toString(it), 8, -1);\n};\n","var global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\nvar classof = require('../internals/classof-raw');\n\nvar Object = global.Object;\nvar split = uncurryThis(''.split);\n\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nmodule.exports = fails(function () {\n  // throws an error in rhino, see https://github.com/mozilla/rhino/issues/346\n  // eslint-disable-next-line no-prototype-builtins -- safe\n  return !Object('z').propertyIsEnumerable(0);\n}) ? function (it) {\n  return classof(it) == 'String' ? split(it, '') : Object(it);\n} : Object;\n","var global = require('../internals/global');\n\nvar TypeError = global.TypeError;\n\n// `RequireObjectCoercible` abstract operation\n// https://tc39.es/ecma262/#sec-requireobjectcoercible\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n  return it;\n};\n","// toObject with fallback for non-array-like ES3 strings\nvar IndexedObject = require('../internals/indexed-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nmodule.exports = function (it) {\n  return IndexedObject(requireObjectCoercible(it));\n};\n","// `IsCallable` abstract operation\n// https://tc39.es/ecma262/#sec-iscallable\nmodule.exports = function (argument) {\n  return typeof argument == 'function';\n};\n","var isCallable = require('../internals/is-callable');\n\nmodule.exports = function (it) {\n  return typeof it == 'object' ? it !== null : isCallable(it);\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\n\nvar aFunction = function (argument) {\n  return isCallable(argument) ? argument : undefined;\n};\n\nmodule.exports = function (namespace, method) {\n  return arguments.length < 2 ? aFunction(global[namespace]) : global[namespace] && global[namespace][method];\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nmodule.exports = uncurryThis({}.isPrototypeOf);\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('navigator', 'userAgent') || '';\n","/* eslint-disable es/no-symbol -- required for testing */\nvar V8_VERSION = require('../internals/engine-v8-version');\nvar fails = require('../internals/fails');\n\n// eslint-disable-next-line es/no-object-getownpropertysymbols -- required for testing\nmodule.exports = !!Object.getOwnPropertySymbols && !fails(function () {\n  var symbol = Symbol();\n  // Chrome 38 Symbol has incorrect toString conversion\n  // `get-own-property-symbols` polyfill symbols converted to object are not Symbol instances\n  return !String(symbol) || !(Object(symbol) instanceof Symbol) ||\n    // Chrome 38-40 symbols are not inherited from DOM collections prototypes to instances\n    !Symbol.sham && V8_VERSION && V8_VERSION < 41;\n});\n","/* eslint-disable es/no-symbol -- required for testing */\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\n\nmodule.exports = NATIVE_SYMBOL\n  && !Symbol.sham\n  && typeof Symbol.iterator == 'symbol';\n","var global = require('../internals/global');\nvar getBuiltIn = require('../internals/get-built-in');\nvar isCallable = require('../internals/is-callable');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar Object = global.Object;\n\nmodule.exports = USE_SYMBOL_AS_UID ? function (it) {\n  return typeof it == 'symbol';\n} : function (it) {\n  var $Symbol = getBuiltIn('Symbol');\n  return isCallable($Symbol) && isPrototypeOf($Symbol.prototype, Object(it));\n};\n","var global = require('../internals/global');\n\nvar String = global.String;\n\nmodule.exports = function (argument) {\n  try {\n    return String(argument);\n  } catch (error) {\n    return 'Object';\n  }\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\nvar tryToString = require('../internals/try-to-string');\n\nvar TypeError = global.TypeError;\n\n// `Assert: IsCallable(argument) is true`\nmodule.exports = function (argument) {\n  if (isCallable(argument)) return argument;\n  throw TypeError(tryToString(argument) + ' is not a function');\n};\n","var aCallable = require('../internals/a-callable');\n\n// `GetMethod` abstract operation\n// https://tc39.es/ecma262/#sec-getmethod\nmodule.exports = function (V, P) {\n  var func = V[P];\n  return func == null ? undefined : aCallable(func);\n};\n","var global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\n\nvar TypeError = global.TypeError;\n\n// `OrdinaryToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-ordinarytoprimitive\nmodule.exports = function (input, pref) {\n  var fn, val;\n  if (pref === 'string' && isCallable(fn = input.toString) && !isObject(val = call(fn, input))) return val;\n  if (isCallable(fn = input.valueOf) && !isObject(val = call(fn, input))) return val;\n  if (pref !== 'string' && isCallable(fn = input.toString) && !isObject(val = call(fn, input))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","var global = require('../internals/global');\n\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar defineProperty = Object.defineProperty;\n\nmodule.exports = function (key, value) {\n  try {\n    defineProperty(global, key, { value: value, configurable: true, writable: true });\n  } catch (error) {\n    global[key] = value;\n  } return value;\n};\n","var global = require('../internals/global');\nvar setGlobal = require('../internals/set-global');\n\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || setGlobal(SHARED, {});\n\nmodule.exports = store;\n","var IS_PURE = require('../internals/is-pure');\nvar store = require('../internals/shared-store');\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: '3.20.1',\n  mode: IS_PURE ? 'pure' : 'global',\n  copyright: '© 2021 Denis Pushkarev (zloirock.ru)'\n});\n","var global = require('../internals/global');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nvar Object = global.Object;\n\n// `ToObject` abstract operation\n// https://tc39.es/ecma262/#sec-toobject\nmodule.exports = function (argument) {\n  return Object(requireObjectCoercible(argument));\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar toObject = require('../internals/to-object');\n\nvar hasOwnProperty = uncurryThis({}.hasOwnProperty);\n\n// `HasOwnProperty` abstract operation\n// https://tc39.es/ecma262/#sec-hasownproperty\nmodule.exports = Object.hasOwn || function hasOwn(it, key) {\n  return hasOwnProperty(toObject(it), key);\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\n\nvar id = 0;\nvar postfix = Math.random();\nvar toString = uncurryThis(1.0.toString);\n\nmodule.exports = function (key) {\n  return 'Symbol(' + (key === undefined ? '' : key) + ')_' + toString(++id + postfix, 36);\n};\n","var global = require('../internals/global');\nvar shared = require('../internals/shared');\nvar hasOwn = require('../internals/has-own-property');\nvar uid = require('../internals/uid');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar WellKnownSymbolsStore = shared('wks');\nvar Symbol = global.Symbol;\nvar symbolFor = Symbol && Symbol['for'];\nvar createWellKnownSymbol = USE_SYMBOL_AS_UID ? Symbol : Symbol && Symbol.withoutSetter || uid;\n\nmodule.exports = function (name) {\n  if (!hasOwn(WellKnownSymbolsStore, name) || !(NATIVE_SYMBOL || typeof WellKnownSymbolsStore[name] == 'string')) {\n    var description = 'Symbol.' + name;\n    if (NATIVE_SYMBOL && hasOwn(Symbol, name)) {\n      WellKnownSymbolsStore[name] = Symbol[name];\n    } else if (USE_SYMBOL_AS_UID && symbolFor) {\n      WellKnownSymbolsStore[name] = symbolFor(description);\n    } else {\n      WellKnownSymbolsStore[name] = createWellKnownSymbol(description);\n    }\n  } return WellKnownSymbolsStore[name];\n};\n","var global = require('../internals/global');\nvar call = require('../internals/function-call');\nvar isObject = require('../internals/is-object');\nvar isSymbol = require('../internals/is-symbol');\nvar getMethod = require('../internals/get-method');\nvar ordinaryToPrimitive = require('../internals/ordinary-to-primitive');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TypeError = global.TypeError;\nvar TO_PRIMITIVE = wellKnownSymbol('toPrimitive');\n\n// `ToPrimitive` abstract operation\n// https://tc39.es/ecma262/#sec-toprimitive\nmodule.exports = function (input, pref) {\n  if (!isObject(input) || isSymbol(input)) return input;\n  var exoticToPrim = getMethod(input, TO_PRIMITIVE);\n  var result;\n  if (exoticToPrim) {\n    if (pref === undefined) pref = 'default';\n    result = call(exoticToPrim, input, pref);\n    if (!isObject(result) || isSymbol(result)) return result;\n    throw TypeError(\"Can't convert object to primitive value\");\n  }\n  if (pref === undefined) pref = 'number';\n  return ordinaryToPrimitive(input, pref);\n};\n","var toPrimitive = require('../internals/to-primitive');\nvar isSymbol = require('../internals/is-symbol');\n\n// `ToPropertyKey` abstract operation\n// https://tc39.es/ecma262/#sec-topropertykey\nmodule.exports = function (argument) {\n  var key = toPrimitive(argument, 'string');\n  return isSymbol(key) ? key : key + '';\n};\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar document = global.document;\n// typeof document.createElement is 'object' in old IE\nvar EXISTS = isObject(document) && isObject(document.createElement);\n\nmodule.exports = function (it) {\n  return EXISTS ? document.createElement(it) : {};\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar createElement = require('../internals/document-create-element');\n\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !DESCRIPTORS && !fails(function () {\n  // eslint-disable-next-line es/no-object-defineproperty -- required for testing\n  return Object.defineProperty(createElement('div'), 'a', {\n    get: function () { return 7; }\n  }).a != 7;\n});\n","var DESCRIPTORS = require('../internals/descriptors');\nvar call = require('../internals/function-call');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPropertyKey = require('../internals/to-property-key');\nvar hasOwn = require('../internals/has-own-property');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\n\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar $getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.es/ecma262/#sec-object.getownpropertydescriptor\nexports.f = DESCRIPTORS ? $getOwnPropertyDescriptor : function getOwnPropertyDescriptor(O, P) {\n  O = toIndexedObject(O);\n  P = toPropertyKey(P);\n  if (IE8_DOM_DEFINE) try {\n    return $getOwnPropertyDescriptor(O, P);\n  } catch (error) { /* empty */ }\n  if (hasOwn(O, P)) return createPropertyDescriptor(!call(propertyIsEnumerableModule.f, O, P), O[P]);\n};\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar String = global.String;\nvar TypeError = global.TypeError;\n\n// `Assert: Type(argument) is Object`\nmodule.exports = function (argument) {\n  if (isObject(argument)) return argument;\n  throw TypeError(String(argument) + ' is not an object');\n};\n","var global = require('../internals/global');\nvar DESCRIPTORS = require('../internals/descriptors');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\nvar anObject = require('../internals/an-object');\nvar toPropertyKey = require('../internals/to-property-key');\n\nvar TypeError = global.TypeError;\n// eslint-disable-next-line es/no-object-defineproperty -- safe\nvar $defineProperty = Object.defineProperty;\n\n// `Object.defineProperty` method\n// https://tc39.es/ecma262/#sec-object.defineproperty\nexports.f = DESCRIPTORS ? $defineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPropertyKey(P);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return $defineProperty(O, P, Attributes);\n  } catch (error) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = DESCRIPTORS ? function (object, key, value) {\n  return definePropertyModule.f(object, key, createPropertyDescriptor(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar isCallable = require('../internals/is-callable');\nvar store = require('../internals/shared-store');\n\nvar functionToString = uncurryThis(Function.toString);\n\n// this helper broken in `core-js@3.4.1-3.4.4`, so we can't use `shared` helper\nif (!isCallable(store.inspectSource)) {\n  store.inspectSource = function (it) {\n    return functionToString(it);\n  };\n}\n\nmodule.exports = store.inspectSource;\n","var NATIVE_WEAK_MAP = require('../internals/native-weak-map');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isObject = require('../internals/is-object');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar hasOwn = require('../internals/has-own-property');\nvar shared = require('../internals/shared-store');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar OBJECT_ALREADY_INITIALIZED = 'Object already initialized';\nvar TypeError = global.TypeError;\nvar WeakMap = global.WeakMap;\nvar set, get, has;\n\nvar enforce = function (it) {\n  return has(it) ? get(it) : set(it, {});\n};\n\nvar getterFor = function (TYPE) {\n  return function (it) {\n    var state;\n    if (!isObject(it) || (state = get(it)).type !== TYPE) {\n      throw TypeError('Incompatible receiver, ' + TYPE + ' required');\n    } return state;\n  };\n};\n\nif (NATIVE_WEAK_MAP || shared.state) {\n  var store = shared.state || (shared.state = new WeakMap());\n  var wmget = uncurryThis(store.get);\n  var wmhas = uncurryThis(store.has);\n  var wmset = uncurryThis(store.set);\n  set = function (it, metadata) {\n    if (wmhas(store, it)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    wmset(store, it, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return wmget(store, it) || {};\n  };\n  has = function (it) {\n    return wmhas(store, it);\n  };\n} else {\n  var STATE = sharedKey('state');\n  hiddenKeys[STATE] = true;\n  set = function (it, metadata) {\n    if (hasOwn(it, STATE)) throw new TypeError(OBJECT_ALREADY_INITIALIZED);\n    metadata.facade = it;\n    createNonEnumerableProperty(it, STATE, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return hasOwn(it, STATE) ? it[STATE] : {};\n  };\n  has = function (it) {\n    return hasOwn(it, STATE);\n  };\n}\n\nmodule.exports = {\n  set: set,\n  get: get,\n  has: has,\n  enforce: enforce,\n  getterFor: getterFor\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\nvar inspectSource = require('../internals/inspect-source');\n\nvar WeakMap = global.WeakMap;\n\nmodule.exports = isCallable(WeakMap) && /native code/.test(inspectSource(WeakMap));\n","var shared = require('../internals/shared');\nvar uid = require('../internals/uid');\n\nvar keys = shared('keys');\n\nmodule.exports = function (key) {\n  return keys[key] || (keys[key] = uid(key));\n};\n","module.exports = {};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar hasOwn = require('../internals/has-own-property');\n\nvar FunctionPrototype = Function.prototype;\n// eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\nvar getDescriptor = DESCRIPTORS && Object.getOwnPropertyDescriptor;\n\nvar EXISTS = hasOwn(FunctionPrototype, 'name');\n// additional protection from minified / mangled / dropped function names\nvar PROPER = EXISTS && (function something() { /* empty */ }).name === 'something';\nvar CONFIGURABLE = EXISTS && (!DESCRIPTORS || (DESCRIPTORS && getDescriptor(FunctionPrototype, 'name').configurable));\n\nmodule.exports = {\n  EXISTS: EXISTS,\n  PROPER: PROPER,\n  CONFIGURABLE: CONFIGURABLE\n};\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\nvar hasOwn = require('../internals/has-own-property');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar setGlobal = require('../internals/set-global');\nvar inspectSource = require('../internals/inspect-source');\nvar InternalStateModule = require('../internals/internal-state');\nvar CONFIGURABLE_FUNCTION_NAME = require('../internals/function-name').CONFIGURABLE;\n\nvar getInternalState = InternalStateModule.get;\nvar enforceInternalState = InternalStateModule.enforce;\nvar TEMPLATE = String(String).split('String');\n\n(module.exports = function (O, key, value, options) {\n  var unsafe = options ? !!options.unsafe : false;\n  var simple = options ? !!options.enumerable : false;\n  var noTargetGet = options ? !!options.noTargetGet : false;\n  var name = options && options.name !== undefined ? options.name : key;\n  var state;\n  if (isCallable(value)) {\n    if (String(name).slice(0, 7) === 'Symbol(') {\n      name = '[' + String(name).replace(/^Symbol\\(([^)]*)\\)/, '$1') + ']';\n    }\n    if (!hasOwn(value, 'name') || (CONFIGURABLE_FUNCTION_NAME && value.name !== name)) {\n      createNonEnumerableProperty(value, 'name', name);\n    }\n    state = enforceInternalState(value);\n    if (!state.source) {\n      state.source = TEMPLATE.join(typeof name == 'string' ? name : '');\n    }\n  }\n  if (O === global) {\n    if (simple) O[key] = value;\n    else setGlobal(key, value);\n    return;\n  } else if (!unsafe) {\n    delete O[key];\n  } else if (!noTargetGet && O[key]) {\n    simple = true;\n  }\n  if (simple) O[key] = value;\n  else createNonEnumerableProperty(O, key, value);\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, 'toString', function toString() {\n  return isCallable(this) && getInternalState(this).source || inspectSource(this);\n});\n","var ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `ToIntegerOrInfinity` abstract operation\n// https://tc39.es/ecma262/#sec-tointegerorinfinity\nmodule.exports = function (argument) {\n  var number = +argument;\n  // eslint-disable-next-line no-self-compare -- safe\n  return number !== number || number === 0 ? 0 : (number > 0 ? floor : ceil)(number);\n};\n","var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\n\nvar max = Math.max;\nvar min = Math.min;\n\n// Helper for a popular repeating case of the spec:\n// Let integer be ? ToInteger(index).\n// If integer < 0, let result be max((length + integer), 0); else let result be min(integer, length).\nmodule.exports = function (index, length) {\n  var integer = toIntegerOrInfinity(index);\n  return integer < 0 ? max(integer + length, 0) : min(integer, length);\n};\n","var toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\n\nvar min = Math.min;\n\n// `ToLength` abstract operation\n// https://tc39.es/ecma262/#sec-tolength\nmodule.exports = function (argument) {\n  return argument > 0 ? min(toIntegerOrInfinity(argument), 0x1FFFFFFFFFFFFF) : 0; // 2 ** 53 - 1 == 9007199254740991\n};\n","var toLength = require('../internals/to-length');\n\n// `LengthOfArrayLike` abstract operation\n// https://tc39.es/ecma262/#sec-lengthofarraylike\nmodule.exports = function (obj) {\n  return toLength(obj.length);\n};\n","var toIndexedObject = require('../internals/to-indexed-object');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\n\n// `Array.prototype.{ indexOf, includes }` methods implementation\nvar createMethod = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIndexedObject($this);\n    var length = lengthOfArrayLike(O);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare -- NaN check\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare -- NaN check\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) {\n      if ((IS_INCLUDES || index in O) && O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.includes` method\n  // https://tc39.es/ecma262/#sec-array.prototype.includes\n  includes: createMethod(true),\n  // `Array.prototype.indexOf` method\n  // https://tc39.es/ecma262/#sec-array.prototype.indexof\n  indexOf: createMethod(false)\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar hasOwn = require('../internals/has-own-property');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar indexOf = require('../internals/array-includes').indexOf;\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar push = uncurryThis([].push);\n\nmodule.exports = function (object, names) {\n  var O = toIndexedObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) !hasOwn(hiddenKeys, key) && hasOwn(O, key) && push(result, key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (hasOwn(O, key = names[i++])) {\n    ~indexOf(result, key) || push(result, key);\n  }\n  return result;\n};\n","// IE8- don't enum bug keys\nmodule.exports = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf'\n];\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\nvar hiddenKeys = enumBugKeys.concat('length', 'prototype');\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.es/ecma262/#sec-object.getownpropertynames\n// eslint-disable-next-line es/no-object-getownpropertynames -- safe\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return internalObjectKeys(O, hiddenKeys);\n};\n","// eslint-disable-next-line es/no-object-getownpropertysymbols -- safe\nexports.f = Object.getOwnPropertySymbols;\n","var getBuiltIn = require('../internals/get-built-in');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar anObject = require('../internals/an-object');\n\nvar concat = uncurryThis([].concat);\n\n// all object keys, includes non-enumerable and symbols\nmodule.exports = getBuiltIn('Reflect', 'ownKeys') || function ownKeys(it) {\n  var keys = getOwnPropertyNamesModule.f(anObject(it));\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  return getOwnPropertySymbols ? concat(keys, getOwnPropertySymbols(it)) : keys;\n};\n","var hasOwn = require('../internals/has-own-property');\nvar ownKeys = require('../internals/own-keys');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\n\nmodule.exports = function (target, source, exceptions) {\n  var keys = ownKeys(source);\n  var defineProperty = definePropertyModule.f;\n  var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    if (!hasOwn(target, key) && !(exceptions && hasOwn(exceptions, key))) {\n      defineProperty(target, key, getOwnPropertyDescriptor(source, key));\n    }\n  }\n};\n","var fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\n\nvar replacement = /#|\\.prototype\\./;\n\nvar isForced = function (feature, detection) {\n  var value = data[normalize(feature)];\n  return value == POLYFILL ? true\n    : value == NATIVE ? false\n    : isCallable(detection) ? fails(detection)\n    : !!detection;\n};\n\nvar normalize = isForced.normalize = function (string) {\n  return String(string).replace(replacement, '.').toLowerCase();\n};\n\nvar data = isForced.data = {};\nvar NATIVE = isForced.NATIVE = 'N';\nvar POLYFILL = isForced.POLYFILL = 'P';\n\nmodule.exports = isForced;\n","var global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar setGlobal = require('../internals/set-global');\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\nvar isForced = require('../internals/is-forced');\n\n/*\n  options.target      - name of the target object\n  options.global      - target is the global object\n  options.stat        - export as static methods of target\n  options.proto       - export as prototype methods of target\n  options.real        - real prototype method for the `pure` version\n  options.forced      - export even if the native feature is available\n  options.bind        - bind methods to the target, required for the `pure` version\n  options.wrap        - wrap constructors to preventing global pollution, required for the `pure` version\n  options.unsafe      - use the simple assignment of property instead of delete + defineProperty\n  options.sham        - add a flag to not completely full polyfills\n  options.enumerable  - export as enumerable property\n  options.noTargetGet - prevent calling a getter on target\n  options.name        - the .name of the function if it does not match the key\n*/\nmodule.exports = function (options, source) {\n  var TARGET = options.target;\n  var GLOBAL = options.global;\n  var STATIC = options.stat;\n  var FORCED, target, key, targetProperty, sourceProperty, descriptor;\n  if (GLOBAL) {\n    target = global;\n  } else if (STATIC) {\n    target = global[TARGET] || setGlobal(TARGET, {});\n  } else {\n    target = (global[TARGET] || {}).prototype;\n  }\n  if (target) for (key in source) {\n    sourceProperty = source[key];\n    if (options.noTargetGet) {\n      descriptor = getOwnPropertyDescriptor(target, key);\n      targetProperty = descriptor && descriptor.value;\n    } else targetProperty = target[key];\n    FORCED = isForced(GLOBAL ? key : TARGET + (STATIC ? '.' : '#') + key, options.forced);\n    // contained in target\n    if (!FORCED && targetProperty !== undefined) {\n      if (typeof sourceProperty == typeof targetProperty) continue;\n      copyConstructorProperties(sourceProperty, targetProperty);\n    }\n    // add a flag to not completely full polyfills\n    if (options.sham || (targetProperty && targetProperty.sham)) {\n      createNonEnumerableProperty(sourceProperty, 'sham', true);\n    }\n    // extend global\n    redefine(target, key, sourceProperty, options);\n  }\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar aCallable = require('../internals/a-callable');\n\nvar bind = uncurryThis(uncurryThis.bind);\n\n// optional / simple context binding\nmodule.exports = function (fn, that) {\n  aCallable(fn);\n  return that === undefined ? fn : bind ? bind(fn, that) : function (/* ...args */) {\n    return fn.apply(that, arguments);\n  };\n};\n","var classof = require('../internals/classof-raw');\n\n// `IsArray` abstract operation\n// https://tc39.es/ecma262/#sec-isarray\n// eslint-disable-next-line es/no-array-isarray -- safe\nmodule.exports = Array.isArray || function isArray(argument) {\n  return classof(argument) == 'Array';\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar test = {};\n\ntest[TO_STRING_TAG] = 'z';\n\nmodule.exports = String(test) === '[object z]';\n","var global = require('../internals/global');\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar isCallable = require('../internals/is-callable');\nvar classofRaw = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\nvar Object = global.Object;\n\n// ES3 wrong here\nvar CORRECT_ARGUMENTS = classofRaw(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n  try {\n    return it[key];\n  } catch (error) { /* empty */ }\n};\n\n// getting tag from ES6+ `Object.prototype.toString`\nmodule.exports = TO_STRING_TAG_SUPPORT ? classofRaw : function (it) {\n  var O, tag, result;\n  return it === undefined ? 'Undefined' : it === null ? 'Null'\n    // @@toStringTag case\n    : typeof (tag = tryGet(O = Object(it), TO_STRING_TAG)) == 'string' ? tag\n    // builtinTag case\n    : CORRECT_ARGUMENTS ? classofRaw(O)\n    // ES3 arguments fallback\n    : (result = classofRaw(O)) == 'Object' && isCallable(O.callee) ? 'Arguments' : result;\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar fails = require('../internals/fails');\nvar isCallable = require('../internals/is-callable');\nvar classof = require('../internals/classof');\nvar getBuiltIn = require('../internals/get-built-in');\nvar inspectSource = require('../internals/inspect-source');\n\nvar noop = function () { /* empty */ };\nvar empty = [];\nvar construct = getBuiltIn('Reflect', 'construct');\nvar constructorRegExp = /^\\s*(?:class|function)\\b/;\nvar exec = uncurryThis(constructorRegExp.exec);\nvar INCORRECT_TO_STRING = !constructorRegExp.exec(noop);\n\nvar isConstructorModern = function isConstructor(argument) {\n  if (!isCallable(argument)) return false;\n  try {\n    construct(noop, empty, argument);\n    return true;\n  } catch (error) {\n    return false;\n  }\n};\n\nvar isConstructorLegacy = function isConstructor(argument) {\n  if (!isCallable(argument)) return false;\n  switch (classof(argument)) {\n    case 'AsyncFunction':\n    case 'GeneratorFunction':\n    case 'AsyncGeneratorFunction': return false;\n  }\n  try {\n    // we can't check .prototype since constructors produced by .bind haven't it\n    // `Function#toString` throws on some built-it function in some legacy engines\n    // (for example, `DOMQuad` and similar in FF41-)\n    return INCORRECT_TO_STRING || !!exec(constructorRegExp, inspectSource(argument));\n  } catch (error) {\n    return true;\n  }\n};\n\nisConstructorLegacy.sham = true;\n\n// `IsConstructor` abstract operation\n// https://tc39.es/ecma262/#sec-isconstructor\nmodule.exports = !construct || fails(function () {\n  var called;\n  return isConstructorModern(isConstructorModern.call)\n    || !isConstructorModern(Object)\n    || !isConstructorModern(function () { called = true; })\n    || called;\n}) ? isConstructorLegacy : isConstructorModern;\n","var global = require('../internals/global');\nvar isArray = require('../internals/is-array');\nvar isConstructor = require('../internals/is-constructor');\nvar isObject = require('../internals/is-object');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar SPECIES = wellKnownSymbol('species');\nvar Array = global.Array;\n\n// a part of `ArraySpeciesCreate` abstract operation\n// https://tc39.es/ecma262/#sec-arrayspeciescreate\nmodule.exports = function (originalArray) {\n  var C;\n  if (isArray(originalArray)) {\n    C = originalArray.constructor;\n    // cross-realm fallback\n    if (isConstructor(C) && (C === Array || isArray(C.prototype))) C = undefined;\n    else if (isObject(C)) {\n      C = C[SPECIES];\n      if (C === null) C = undefined;\n    }\n  } return C === undefined ? Array : C;\n};\n","var arraySpeciesConstructor = require('../internals/array-species-constructor');\n\n// `ArraySpeciesCreate` abstract operation\n// https://tc39.es/ecma262/#sec-arrayspeciescreate\nmodule.exports = function (originalArray, length) {\n  return new (arraySpeciesConstructor(originalArray))(length === 0 ? 0 : length);\n};\n","var bind = require('../internals/function-bind-context');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar IndexedObject = require('../internals/indexed-object');\nvar toObject = require('../internals/to-object');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar arraySpeciesCreate = require('../internals/array-species-create');\n\nvar push = uncurryThis([].push);\n\n// `Array.prototype.{ forEach, map, filter, some, every, find, findIndex, filterReject }` methods implementation\nvar createMethod = function (TYPE) {\n  var IS_MAP = TYPE == 1;\n  var IS_FILTER = TYPE == 2;\n  var IS_SOME = TYPE == 3;\n  var IS_EVERY = TYPE == 4;\n  var IS_FIND_INDEX = TYPE == 6;\n  var IS_FILTER_REJECT = TYPE == 7;\n  var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\n  return function ($this, callbackfn, that, specificCreate) {\n    var O = toObject($this);\n    var self = IndexedObject(O);\n    var boundFunction = bind(callbackfn, that);\n    var length = lengthOfArrayLike(self);\n    var index = 0;\n    var create = specificCreate || arraySpeciesCreate;\n    var target = IS_MAP ? create($this, length) : IS_FILTER || IS_FILTER_REJECT ? create($this, 0) : undefined;\n    var value, result;\n    for (;length > index; index++) if (NO_HOLES || index in self) {\n      value = self[index];\n      result = boundFunction(value, index, O);\n      if (TYPE) {\n        if (IS_MAP) target[index] = result; // map\n        else if (result) switch (TYPE) {\n          case 3: return true;              // some\n          case 5: return value;             // find\n          case 6: return index;             // findIndex\n          case 2: push(target, value);      // filter\n        } else switch (TYPE) {\n          case 4: return false;             // every\n          case 7: push(target, value);      // filterReject\n        }\n      }\n    }\n    return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : target;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.forEach` method\n  // https://tc39.es/ecma262/#sec-array.prototype.foreach\n  forEach: createMethod(0),\n  // `Array.prototype.map` method\n  // https://tc39.es/ecma262/#sec-array.prototype.map\n  map: createMethod(1),\n  // `Array.prototype.filter` method\n  // https://tc39.es/ecma262/#sec-array.prototype.filter\n  filter: createMethod(2),\n  // `Array.prototype.some` method\n  // https://tc39.es/ecma262/#sec-array.prototype.some\n  some: createMethod(3),\n  // `Array.prototype.every` method\n  // https://tc39.es/ecma262/#sec-array.prototype.every\n  every: createMethod(4),\n  // `Array.prototype.find` method\n  // https://tc39.es/ecma262/#sec-array.prototype.find\n  find: createMethod(5),\n  // `Array.prototype.findIndex` method\n  // https://tc39.es/ecma262/#sec-array.prototype.findIndex\n  findIndex: createMethod(6),\n  // `Array.prototype.filterReject` method\n  // https://github.com/tc39/proposal-array-filtering\n  filterReject: createMethod(7)\n};\n","var fails = require('../internals/fails');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\nvar V8_VERSION = require('../internals/engine-v8-version');\n\nvar SPECIES = wellKnownSymbol('species');\n\nmodule.exports = function (METHOD_NAME) {\n  // We can't use this feature detection in V8 since it causes\n  // deoptimization and serious performance degradation\n  // https://github.com/zloirock/core-js/issues/677\n  return V8_VERSION >= 51 || !fails(function () {\n    var array = [];\n    var constructor = array.constructor = {};\n    constructor[SPECIES] = function () {\n      return { foo: 1 };\n    };\n    return array[METHOD_NAME](Boolean).foo !== 1;\n  });\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar $map = require('../internals/array-iteration').map;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('map');\n\n// `Array.prototype.map` method\n// https://tc39.es/ecma262/#sec-array.prototype.map\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  map: function map(callbackfn /* , thisArg */) {\n    return $map(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport function __createBinding(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n    for (var p in m) if (p !== \"default\" && !exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n};\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n    result.default = mod;\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, privateMap) {\r\n    if (!privateMap.has(receiver)) {\r\n        throw new TypeError(\"attempted to get private field on non-instance\");\r\n    }\r\n    return privateMap.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, privateMap, value) {\r\n    if (!privateMap.has(receiver)) {\r\n        throw new TypeError(\"attempted to set private field on non-instance\");\r\n    }\r\n    privateMap.set(receiver, value);\r\n    return value;\r\n}\r\n","'use strict';\nvar TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar classof = require('../internals/classof');\n\n// `Object.prototype.toString` method implementation\n// https://tc39.es/ecma262/#sec-object.prototype.tostring\nmodule.exports = TO_STRING_TAG_SUPPORT ? {}.toString : function toString() {\n  return '[object ' + classof(this) + ']';\n};\n","var TO_STRING_TAG_SUPPORT = require('../internals/to-string-tag-support');\nvar redefine = require('../internals/redefine');\nvar toString = require('../internals/object-to-string');\n\n// `Object.prototype.toString` method\n// https://tc39.es/ecma262/#sec-object.prototype.tostring\nif (!TO_STRING_TAG_SUPPORT) {\n  redefine(Object.prototype, 'toString', toString, { unsafe: true });\n}\n","'use strict';\nvar $ = require('../internals/export');\nvar $filter = require('../internals/array-iteration').filter;\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('filter');\n\n// `Array.prototype.filter` method\n// https://tc39.es/ecma262/#sec-array.prototype.filter\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  filter: function filter(callbackfn /* , thisArg */) {\n    return $filter(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n",null,null,null,"// in old WebKit versions, `element.classList` is not an instance of global `DOMTokenList`\nvar documentCreateElement = require('../internals/document-create-element');\n\nvar classList = documentCreateElement('span').classList;\nvar DOMTokenListPrototype = classList && classList.constructor && classList.constructor.prototype;\n\nmodule.exports = DOMTokenListPrototype === Object.prototype ? undefined : DOMTokenListPrototype;\n","'use strict';\nvar fails = require('../internals/fails');\n\nmodule.exports = function (METHOD_NAME, argument) {\n  var method = [][METHOD_NAME];\n  return !!method && fails(function () {\n    // eslint-disable-next-line no-useless-call,no-throw-literal -- required for testing\n    method.call(null, argument || function () { throw 1; }, 1);\n  });\n};\n","'use strict';\nvar $forEach = require('../internals/array-iteration').forEach;\nvar arrayMethodIsStrict = require('../internals/array-method-is-strict');\n\nvar STRICT_METHOD = arrayMethodIsStrict('forEach');\n\n// `Array.prototype.forEach` method implementation\n// https://tc39.es/ecma262/#sec-array.prototype.foreach\nmodule.exports = !STRICT_METHOD ? function forEach(callbackfn /* , thisArg */) {\n  return $forEach(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n// eslint-disable-next-line es/no-array-prototype-foreach -- safe\n} : [].forEach;\n","var global = require('../internals/global');\nvar DOMIterables = require('../internals/dom-iterables');\nvar DOMTokenListPrototype = require('../internals/dom-token-list-prototype');\nvar forEach = require('../internals/array-for-each');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nvar handlePrototype = function (CollectionPrototype) {\n  // some Chrome versions have non-configurable methods on DOMTokenList\n  if (CollectionPrototype && CollectionPrototype.forEach !== forEach) try {\n    createNonEnumerableProperty(CollectionPrototype, 'forEach', forEach);\n  } catch (error) {\n    CollectionPrototype.forEach = forEach;\n  }\n};\n\nfor (var COLLECTION_NAME in DOMIterables) {\n  if (DOMIterables[COLLECTION_NAME]) {\n    handlePrototype(global[COLLECTION_NAME] && global[COLLECTION_NAME].prototype);\n  }\n}\n\nhandlePrototype(DOMTokenListPrototype);\n","// iterable DOM collections\n// flag - `iterable` interface - 'entries', 'keys', 'values', 'forEach' methods\nmodule.exports = {\n  CSSRuleList: 0,\n  CSSStyleDeclaration: 0,\n  CSSValueList: 0,\n  ClientRectList: 0,\n  DOMRectList: 0,\n  DOMStringList: 0,\n  DOMTokenList: 1,\n  DataTransferItemList: 0,\n  FileList: 0,\n  HTMLAllCollection: 0,\n  HTMLCollection: 0,\n  HTMLFormElement: 0,\n  HTMLSelectElement: 0,\n  MediaList: 0,\n  MimeTypeArray: 0,\n  NamedNodeMap: 0,\n  NodeList: 1,\n  PaintRequestList: 0,\n  Plugin: 0,\n  PluginArray: 0,\n  SVGLengthList: 0,\n  SVGNumberList: 0,\n  SVGPathSegList: 0,\n  SVGPointList: 0,\n  SVGStringList: 0,\n  SVGTransformList: 0,\n  SourceBufferList: 0,\n  StyleSheetList: 0,\n  TextTrackCueList: 0,\n  TextTrackList: 0,\n  TouchList: 0\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar call = require('../internals/function-call');\n\n// `URL.prototype.toJSON` method\n// https://url.spec.whatwg.org/#dom-url-tojson\n$({ target: 'URL', proto: true, enumerable: true }, {\n  toJSON: function toJSON() {\n    return call(URL.prototype.toString, this);\n  }\n});\n",null,null,"/**\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","/**\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 { 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","\"use strict\";\n\nmodule.exports = {\n\t/**\n  * Euclidean distance\n  */\n\teudist: function eudist(v1, v2, sqrt) {\n\t\tvar len = v1.length;\n\t\tvar sum = 0;\n\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tvar d = (v1[i] || 0) - (v2[i] || 0);\n\t\t\tsum += d * d;\n\t\t}\n\t\t// Square root not really needed\n\t\treturn sqrt ? Math.sqrt(sum) : sum;\n\t},\n\tmandist: function mandist(v1, v2, sqrt) {\n\t\tvar len = v1.length;\n\t\tvar sum = 0;\n\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tsum += Math.abs((v1[i] || 0) - (v2[i] || 0));\n\t\t}\n\n\t\t// Square root not really needed\n\t\treturn sqrt ? Math.sqrt(sum) : sum;\n\t},\n\n\n\t/**\n  * Unidimensional distance\n  */\n\tdist: function dist(v1, v2, sqrt) {\n\t\tvar d = Math.abs(v1 - v2);\n\t\treturn sqrt ? d : d * d;\n\t}\n};\n//# sourceMappingURL=distance.js.map\n","\"use strict\";\n\nvar Distance = require(\"./distance.js\"),\n    eudist = Distance.eudist,\n    dist = Distance.dist;\n\nmodule.exports = {\n\tkmrand: function kmrand(data, k) {\n\t\tvar map = {},\n\t\t    ks = [],\n\t\t    t = k << 2;\n\t\tvar len = data.length;\n\t\tvar multi = data[0].length > 0;\n\n\t\twhile (ks.length < k && t-- > 0) {\n\t\t\tvar d = data[Math.floor(Math.random() * len)];\n\t\t\tvar key = multi ? d.join(\"_\") : \"\" + d;\n\t\t\tif (!map[key]) {\n\t\t\t\tmap[key] = true;\n\t\t\t\tks.push(d);\n\t\t\t}\n\t\t}\n\n\t\tif (ks.length < k) throw new Error(\"Error initializating clusters\");else return ks;\n\t},\n\n\n\t/**\n  * K-means++ initial centroid selection\n  */\n\tkmpp: function kmpp(data, k) {\n\t\tvar distance = data[0].length ? eudist : dist;\n\t\tvar ks = [],\n\t\t    len = data.length;\n\t\tvar multi = data[0].length > 0;\n\t\tvar map = {};\n\n\t\t// First random centroid\n\t\tvar c = data[Math.floor(Math.random() * len)];\n\t\tvar key = multi ? c.join(\"_\") : \"\" + c;\n\t\tks.push(c);\n\t\tmap[key] = true;\n\n\t\t// Retrieve next centroids\n\t\twhile (ks.length < k) {\n\t\t\t// Min Distances between current centroids and data points\n\t\t\tvar dists = [],\n\t\t\t    lk = ks.length;\n\t\t\tvar dsum = 0,\n\t\t\t    prs = [];\n\n\t\t\tfor (var i = 0; i < len; i++) {\n\t\t\t\tvar min = Infinity;\n\t\t\t\tfor (var j = 0; j < lk; j++) {\n\t\t\t\t\tvar _dist = distance(data[i], ks[j]);\n\t\t\t\t\tif (_dist <= min) min = _dist;\n\t\t\t\t}\n\t\t\t\tdists[i] = min;\n\t\t\t}\n\n\t\t\t// Sum all min distances\n\t\t\tfor (var _i = 0; _i < len; _i++) {\n\t\t\t\tdsum += dists[_i];\n\t\t\t}\n\n\t\t\t// Probabilities and cummulative prob (cumsum)\n\t\t\tfor (var _i2 = 0; _i2 < len; _i2++) {\n\t\t\t\tprs[_i2] = { i: _i2, v: data[_i2], pr: dists[_i2] / dsum, cs: 0 };\n\t\t\t}\n\n\t\t\t// Sort Probabilities\n\t\t\tprs.sort(function (a, b) {\n\t\t\t\treturn a.pr - b.pr;\n\t\t\t});\n\n\t\t\t// Cummulative Probabilities\n\t\t\tprs[0].cs = prs[0].pr;\n\t\t\tfor (var _i3 = 1; _i3 < len; _i3++) {\n\t\t\t\tprs[_i3].cs = prs[_i3 - 1].cs + prs[_i3].pr;\n\t\t\t}\n\n\t\t\t// Randomize\n\t\t\tvar rnd = Math.random();\n\n\t\t\t// Gets only the items whose cumsum >= rnd\n\t\t\tvar idx = 0;\n\t\t\twhile (idx < len - 1 && prs[idx++].cs < rnd) {}\n\t\t\tks.push(prs[idx - 1].v);\n\t\t\t/*\n   let done = false;\n   while(!done) {\n   \t// this is our new centroid\n   \tc = prs[idx-1].v\n   \tkey = multi? c.join(\"_\") : `${c}`;\n   \tif(!map[key]) {\n   \t\tmap[key] = true;\n   \t\tks.push(c);\n   \t\tdone = true;\n   \t}\n   \telse {\n   \t\tidx++;\n   \t}\n   }\n   */\n\t\t}\n\n\t\treturn ks;\n\t}\n};\n//# sourceMappingURL=kinit.js.map\n","\"use strict\";\n\n/*jshint esversion: 6 */\n\nvar Distance = require(\"./distance.js\"),\n    ClusterInit = require(\"./kinit.js\"),\n    eudist = Distance.eudist,\n    mandist = Distance.mandist,\n    dist = Distance.dist,\n    kmrand = ClusterInit.kmrand,\n    kmpp = ClusterInit.kmpp;\n\nvar MAX = 10000;\n\n/**\n * Inits an array with values\n */\nfunction init(len, val, v) {\n\tv = v || [];\n\tfor (var i = 0; i < len; i++) {\n\t\tv[i] = val;\n\t}return v;\n}\n\nfunction skmeans(data, k, initial, maxit) {\n\tvar ks = [],\n\t    old = [],\n\t    idxs = [],\n\t    dist = [];\n\tvar conv = false,\n\t    it = maxit || MAX;\n\tvar len = data.length,\n\t    vlen = data[0].length,\n\t    multi = vlen > 0;\n\tvar count = [];\n\n\tif (!initial) {\n\t\tvar _idxs = {};\n\t\twhile (ks.length < k) {\n\t\t\tvar idx = Math.floor(Math.random() * len);\n\t\t\tif (!_idxs[idx]) {\n\t\t\t\t_idxs[idx] = true;\n\t\t\t\tks.push(data[idx]);\n\t\t\t}\n\t\t}\n\t} else if (initial == \"kmrand\") {\n\t\tks = kmrand(data, k);\n\t} else if (initial == \"kmpp\") {\n\t\tks = kmpp(data, k);\n\t} else {\n\t\tks = initial;\n\t}\n\n\tdo {\n\t\t// Reset k count\n\t\tinit(k, 0, count);\n\n\t\t// For each value in data, find the nearest centroid\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tvar min = Infinity,\n\t\t\t    _idx = 0;\n\t\t\tfor (var j = 0; j < k; j++) {\n\t\t\t\t// Multidimensional or unidimensional\n\t\t\t\tvar dist = multi ? eudist(data[i], ks[j]) : Math.abs(data[i] - ks[j]);\n\t\t\t\tif (dist <= min) {\n\t\t\t\t\tmin = dist;\n\t\t\t\t\t_idx = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tidxs[i] = _idx; // Index of the selected centroid for that value\n\t\t\tcount[_idx]++; // Number of values for this centroid\n\t\t}\n\n\t\t// Recalculate centroids\n\t\tvar sum = [],\n\t\t    old = [],\n\t\t    dif = 0;\n\t\tfor (var _j = 0; _j < k; _j++) {\n\t\t\t// Multidimensional or unidimensional\n\t\t\tsum[_j] = multi ? init(vlen, 0, sum[_j]) : 0;\n\t\t\told[_j] = ks[_j];\n\t\t}\n\n\t\t// If multidimensional\n\t\tif (multi) {\n\t\t\tfor (var _j2 = 0; _j2 < k; _j2++) {\n\t\t\t\tks[_j2] = [];\n\t\t\t} // Sum values and count for each centroid\n\t\t\tfor (var _i = 0; _i < len; _i++) {\n\t\t\t\tvar _idx2 = idxs[_i],\n\t\t\t\t    // Centroid for that item\n\t\t\t\tvsum = sum[_idx2],\n\t\t\t\t    // Sum values for this centroid\n\t\t\t\tvect = data[_i]; // Current vector\n\n\t\t\t\t// Accumulate value on the centroid for current vector\n\t\t\t\tfor (var h = 0; h < vlen; h++) {\n\t\t\t\t\tvsum[h] += vect[h];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Calculate the average for each centroid\n\t\t\tconv = true;\n\t\t\tfor (var _j3 = 0; _j3 < k; _j3++) {\n\t\t\t\tvar ksj = ks[_j3],\n\t\t\t\t    // Current centroid\n\t\t\t\tsumj = sum[_j3],\n\t\t\t\t    // Accumulated centroid values\n\t\t\t\toldj = old[_j3],\n\t\t\t\t    // Old centroid value\n\t\t\t\tcj = count[_j3]; // Number of elements for this centroid\n\n\t\t\t\t// New average\n\t\t\t\tfor (var _h = 0; _h < vlen; _h++) {\n\t\t\t\t\tksj[_h] = sumj[_h] / cj || 0; // New centroid\n\t\t\t\t}\n\n\t\t\t\t// Find if centroids have moved\n\t\t\t\tif (conv) {\n\t\t\t\t\tfor (var _h2 = 0; _h2 < vlen; _h2++) {\n\t\t\t\t\t\tif (oldj[_h2] != ksj[_h2]) {\n\t\t\t\t\t\t\tconv = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// If unidimensional\n\t\telse {\n\t\t\t\t// Sum values and count for each centroid\n\t\t\t\tfor (var _i2 = 0; _i2 < len; _i2++) {\n\t\t\t\t\tvar _idx3 = idxs[_i2];\n\t\t\t\t\tsum[_idx3] += data[_i2];\n\t\t\t\t}\n\t\t\t\t// Calculate the average for each centroid\n\t\t\t\tfor (var _j4 = 0; _j4 < k; _j4++) {\n\t\t\t\t\tks[_j4] = sum[_j4] / count[_j4] || 0; // New centroid\n\t\t\t\t}\n\t\t\t\t// Find if centroids have moved\n\t\t\t\tconv = true;\n\t\t\t\tfor (var _j5 = 0; _j5 < k; _j5++) {\n\t\t\t\t\tif (old[_j5] != ks[_j5]) {\n\t\t\t\t\t\tconv = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\tconv = conv || --it <= 0;\n\t} while (!conv);\n\n\treturn {\n\t\tit: MAX - it,\n\t\tk: k,\n\t\tidxs: idxs,\n\t\tcentroids: ks\n\t};\n}\n\nmodule.exports = skmeans;\n//# sourceMappingURL=main.js.map\n",null,"import clone from \"@turf/clone\";\nimport { coordAll, featureEach } from \"@turf/meta\";\nimport skmeans from \"skmeans\";\n/**\n * Takes a set of {@link Point|points} and partition them into clusters using the k-mean .\n * It uses the [k-means algorithm](https://en.wikipedia.org/wiki/K-means_clustering)\n *\n * @name clustersKmeans\n * @param {FeatureCollection<Point>} points to be clustered\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.numberOfClusters=Math.sqrt(numberOfPoints/2)] numberOfClusters that will be generated\n * @param {boolean} [options.mutate=false] allows GeoJSON input to be mutated (significant performance increase if true)\n * @returns {FeatureCollection<Point>} Clustered Points with an additional two properties associated to each Feature:\n * - {number} cluster - the associated clusterId\n * - {[number, number]} centroid - Centroid of the cluster [Longitude, Latitude]\n * @example\n * // create random points with random z-values in their properties\n * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});\n * var options = {numberOfClusters: 7};\n * var clustered = turf.clustersKmeans(points, options);\n *\n * //addToMap\n * var addToMap = [clustered];\n */\nfunction clustersKmeans(points, options) {\n    if (options === void 0) { options = {}; }\n    // Default Params\n    var count = points.features.length;\n    options.numberOfClusters =\n        options.numberOfClusters || Math.round(Math.sqrt(count / 2));\n    // numberOfClusters can't be greater than the number of points\n    // fallbacks to count\n    if (options.numberOfClusters > count)\n        options.numberOfClusters = count;\n    // Clone points to prevent any mutations (enabled by default)\n    if (options.mutate !== true)\n        points = clone(points);\n    // collect points coordinates\n    var data = coordAll(points);\n    // create seed to avoid skmeans to drift\n    var initialCentroids = data.slice(0, options.numberOfClusters);\n    // create skmeans clusters\n    var skmeansResult = skmeans(data, options.numberOfClusters, initialCentroids);\n    // store centroids {clusterId: [number, number]}\n    var centroids = {};\n    skmeansResult.centroids.forEach(function (coord, idx) {\n        centroids[idx] = coord;\n    });\n    // add associated cluster number\n    featureEach(points, function (point, index) {\n        var clusterId = skmeansResult.idxs[index];\n        point.properties.cluster = clusterId;\n        point.properties.centroid = centroids[clusterId];\n    });\n    return points;\n}\nexport default clustersKmeans;\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\n// `Object.keys` method\n// https://tc39.es/ecma262/#sec-object.keys\n// eslint-disable-next-line es/no-object-keys -- safe\nmodule.exports = Object.keys || function keys(O) {\n  return internalObjectKeys(O, enumBugKeys);\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar call = require('../internals/function-call');\nvar fails = require('../internals/fails');\nvar objectKeys = require('../internals/object-keys');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar toObject = require('../internals/to-object');\nvar IndexedObject = require('../internals/indexed-object');\n\n// eslint-disable-next-line es/no-object-assign -- safe\nvar $assign = Object.assign;\n// eslint-disable-next-line es/no-object-defineproperty -- required for testing\nvar defineProperty = Object.defineProperty;\nvar concat = uncurryThis([].concat);\n\n// `Object.assign` method\n// https://tc39.es/ecma262/#sec-object.assign\nmodule.exports = !$assign || fails(function () {\n  // should have correct order of operations (Edge bug)\n  if (DESCRIPTORS && $assign({ b: 1 }, $assign(defineProperty({}, 'a', {\n    enumerable: true,\n    get: function () {\n      defineProperty(this, 'b', {\n        value: 3,\n        enumerable: false\n      });\n    }\n  }), { b: 2 })).b !== 1) return true;\n  // should work with symbols and should have deterministic property order (V8 bug)\n  var A = {};\n  var B = {};\n  // eslint-disable-next-line es/no-symbol -- safe\n  var symbol = Symbol();\n  var alphabet = 'abcdefghijklmnopqrst';\n  A[symbol] = 7;\n  alphabet.split('').forEach(function (chr) { B[chr] = chr; });\n  return $assign({}, A)[symbol] != 7 || objectKeys($assign({}, B)).join('') != alphabet;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars -- required for `.length`\n  var T = toObject(target);\n  var argumentsLength = arguments.length;\n  var index = 1;\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  var propertyIsEnumerable = propertyIsEnumerableModule.f;\n  while (argumentsLength > index) {\n    var S = IndexedObject(arguments[index++]);\n    var keys = getOwnPropertySymbols ? concat(objectKeys(S), getOwnPropertySymbols(S)) : objectKeys(S);\n    var length = keys.length;\n    var j = 0;\n    var key;\n    while (length > j) {\n      key = keys[j++];\n      if (!DESCRIPTORS || call(propertyIsEnumerable, S, key)) T[key] = S[key];\n    }\n  } return T;\n} : $assign;\n","var $ = require('../internals/export');\nvar assign = require('../internals/object-assign');\n\n// `Object.assign` method\n// https://tc39.es/ecma262/#sec-object.assign\n// eslint-disable-next-line es/no-object-assign -- required for testing\n$({ target: 'Object', stat: true, forced: Object.assign !== assign }, {\n  assign: assign\n});\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","/**\r\n * DBSCAN - Density based clustering\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * DBSCAN class construcotr\r\n * @constructor\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distanceFunction\r\n * @returns {DBSCAN}\r\n */\r\nfunction DBSCAN(dataset, epsilon, minPts, distanceFunction) {\r\n  /** @type {Array} */\r\n  this.dataset = [];\r\n  /** @type {number} */\r\n  this.epsilon = 1;\r\n  /** @type {number} */\r\n  this.minPts = 2;\r\n  /** @type {function} */\r\n  this.distance = this._euclideanDistance;\r\n  /** @type {Array} */\r\n  this.clusters = [];\r\n  /** @type {Array} */\r\n  this.noise = [];\r\n\r\n  // temporary variables used during computation\r\n\r\n  /** @type {Array} */\r\n  this._visited = [];\r\n  /** @type {Array} */\r\n  this._assigned = [];\r\n  /** @type {number} */\r\n  this._datasetLength = 0;\r\n\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n};\r\n\r\n/******************************************************************************/\r\n// public functions\r\n\r\n/**\r\n * Start clustering\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distanceFunction\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nDBSCAN.prototype.run = function(dataset, epsilon, minPts, distanceFunction) {\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n\r\n  for (var pointId = 0; pointId < this._datasetLength; pointId++) {\r\n    // if point is not visited, check if it forms a cluster\r\n    if (this._visited[pointId] !== 1) {\r\n      this._visited[pointId] = 1;\r\n\r\n      // if closest neighborhood is too small to form a cluster, mark as noise\r\n      var neighbors = this._regionQuery(pointId);\r\n\r\n      if (neighbors.length < this.minPts) {\r\n        this.noise.push(pointId);\r\n      } else {\r\n        // create new cluster and add point\r\n        var clusterId = this.clusters.length;\r\n        this.clusters.push([]);\r\n        this._addToCluster(pointId, clusterId);\r\n\r\n        this._expandCluster(clusterId, neighbors);\r\n      }\r\n    }\r\n  }\r\n\r\n  return this.clusters;\r\n};\r\n\r\n/******************************************************************************/\r\n// protected functions\r\n\r\n/**\r\n * Set object properties\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distance\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._init = function(dataset, epsilon, minPts, distance) {\r\n\r\n  if (dataset) {\r\n\r\n    if (!(dataset instanceof Array)) {\r\n      throw Error('Dataset must be of type array, ' +\r\n        typeof dataset + ' given');\r\n    }\r\n\r\n    this.dataset = dataset;\r\n    this.clusters = [];\r\n    this.noise = [];\r\n\r\n    this._datasetLength = dataset.length;\r\n    this._visited = new Array(this._datasetLength);\r\n    this._assigned = new Array(this._datasetLength);\r\n  }\r\n\r\n  if (epsilon) {\r\n    this.epsilon = epsilon;\r\n  }\r\n\r\n  if (minPts) {\r\n    this.minPts = minPts;\r\n  }\r\n\r\n  if (distance) {\r\n    this.distance = distance;\r\n  }\r\n};\r\n\r\n/**\r\n * Expand cluster to closest points of given neighborhood\r\n *\r\n * @param {number} clusterId\r\n * @param {Array} neighbors\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._expandCluster = function(clusterId, neighbors) {\r\n\r\n  /**\r\n   * It's very important to calculate length of neighbors array each time,\r\n   * as the number of elements changes over time\r\n   */\r\n  for (var i = 0; i < neighbors.length; i++) {\r\n    var pointId2 = neighbors[i];\r\n\r\n    if (this._visited[pointId2] !== 1) {\r\n      this._visited[pointId2] = 1;\r\n      var neighbors2 = this._regionQuery(pointId2);\r\n\r\n      if (neighbors2.length >= this.minPts) {\r\n        neighbors = this._mergeArrays(neighbors, neighbors2);\r\n      }\r\n    }\r\n\r\n    // add to cluster\r\n    if (this._assigned[pointId2] !== 1) {\r\n      this._addToCluster(pointId2, clusterId);\r\n    }\r\n  }\r\n};\r\n\r\n/**\r\n * Add new point to cluster\r\n *\r\n * @param {number} pointId\r\n * @param {number} clusterId\r\n */\r\nDBSCAN.prototype._addToCluster = function(pointId, clusterId) {\r\n  this.clusters[clusterId].push(pointId);\r\n  this._assigned[pointId] = 1;\r\n};\r\n\r\n/**\r\n * Find all neighbors around given point\r\n *\r\n * @param {number} pointId,\r\n * @param {number} epsilon\r\n * @returns {Array}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._regionQuery = function(pointId) {\r\n  var neighbors = [];\r\n\r\n  for (var id = 0; id < this._datasetLength; id++) {\r\n    var dist = this.distance(this.dataset[pointId], this.dataset[id]);\r\n    if (dist < this.epsilon) {\r\n      neighbors.push(id);\r\n    }\r\n  }\r\n\r\n  return neighbors;\r\n};\r\n\r\n/******************************************************************************/\r\n// helpers\r\n\r\n/**\r\n * @param {Array} a\r\n * @param {Array} b\r\n * @returns {Array}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._mergeArrays = function(a, b) {\r\n  var len = b.length;\r\n\r\n  for (var i = 0; i < len; i++) {\r\n    var P = b[i];\r\n    if (a.indexOf(P) < 0) {\r\n      a.push(P);\r\n    }\r\n  }\r\n\r\n  return a;\r\n};\r\n\r\n/**\r\n * Calculate euclidean distance in multidimensional space\r\n *\r\n * @param {Array} p\r\n * @param {Array} q\r\n * @returns {number}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._euclideanDistance = function(p, q) {\r\n  var sum = 0;\r\n  var i = Math.min(p.length, q.length);\r\n\r\n  while (i--) {\r\n    sum += (p[i] - q[i]) * (p[i] - q[i]);\r\n  }\r\n\r\n  return Math.sqrt(sum);\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = DBSCAN;\r\n}\r\n","/**\r\n * KMEANS clustering\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * KMEANS class constructor\r\n * @constructor\r\n *\r\n * @param {Array} dataset\r\n * @param {number} k - number of clusters\r\n * @param {function} distance - distance function\r\n * @returns {KMEANS}\r\n */\r\n function KMEANS(dataset, k, distance) {\r\n  this.k = 3; // number of clusters\r\n  this.dataset = []; // set of feature vectors\r\n  this.assignments = []; // set of associated clusters for each feature vector\r\n  this.centroids = []; // vectors for our clusters\r\n\r\n  this.init(dataset, k, distance);\r\n}\r\n\r\n/**\r\n * @returns {undefined}\r\n */\r\nKMEANS.prototype.init = function(dataset, k, distance) {\r\n  this.assignments = [];\r\n  this.centroids = [];\r\n\r\n  if (typeof dataset !== 'undefined') {\r\n    this.dataset = dataset;\r\n  }\r\n\r\n  if (typeof k !== 'undefined') {\r\n    this.k = k;\r\n  }\r\n\r\n  if (typeof distance !== 'undefined') {\r\n    this.distance = distance;\r\n  }\r\n};\r\n\r\n/**\r\n * @returns {undefined}\r\n */\r\nKMEANS.prototype.run = function(dataset, k) {\r\n  this.init(dataset, k);\r\n\r\n  var len = this.dataset.length;\r\n\r\n  // initialize centroids\r\n  for (var i = 0; i < this.k; i++) {\r\n    this.centroids[i] = this.randomCentroid();\r\n\t}\r\n\r\n  var change = true;\r\n  while(change) {\r\n\r\n    // assign feature vectors to clusters\r\n    change = this.assign();\r\n\r\n    // adjust location of centroids\r\n    for (var centroidId = 0; centroidId < this.k; centroidId++) {\r\n      var mean = new Array(maxDim);\r\n      var count = 0;\r\n\r\n      // init mean vector\r\n      for (var dim = 0; dim < maxDim; dim++) {\r\n        mean[dim] = 0;\r\n      }\r\n\r\n      for (var j = 0; j < len; j++) {\r\n        var maxDim = this.dataset[j].length;\r\n\r\n        // if current cluster id is assigned to point\r\n        if (centroidId === this.assignments[j]) {\r\n          for (var dim = 0; dim < maxDim; dim++) {\r\n            mean[dim] += this.dataset[j][dim];\r\n          }\r\n          count++;\r\n        }\r\n      }\r\n\r\n      if (count > 0) {\r\n        // if cluster contain points, adjust centroid position\r\n        for (var dim = 0; dim < maxDim; dim++) {\r\n          mean[dim] /= count;\r\n        }\r\n        this.centroids[centroidId] = mean;\r\n      } else {\r\n        // if cluster is empty, generate new random centroid\r\n        this.centroids[centroidId] = this.randomCentroid();\r\n        change = true;\r\n      }\r\n    }\r\n  }\r\n\r\n  return this.getClusters();\r\n};\r\n\r\n/**\r\n * Generate random centroid\r\n *\r\n * @returns {Array}\r\n */\r\nKMEANS.prototype.randomCentroid = function() {\r\n  var maxId = this.dataset.length -1;\r\n  var centroid;\r\n  var id;\r\n\r\n  do {\r\n    id = Math.round(Math.random() * maxId);\r\n    centroid = this.dataset[id];\r\n  } while (this.centroids.indexOf(centroid) >= 0);\r\n\r\n  return centroid;\r\n}\r\n\r\n/**\r\n * Assign points to clusters\r\n *\r\n * @returns {boolean}\r\n */\r\nKMEANS.prototype.assign = function() {\r\n  var change = false;\r\n  var len = this.dataset.length;\r\n  var closestCentroid;\r\n\r\n  for (var i = 0; i < len; i++) {\r\n    closestCentroid = this.argmin(this.dataset[i], this.centroids, this.distance);\r\n\r\n    if (closestCentroid != this.assignments[i]) {\r\n      this.assignments[i] = closestCentroid;\r\n      change = true;\r\n    }\r\n  }\r\n\r\n  return change;\r\n}\r\n\r\n/**\r\n * Extract information about clusters\r\n *\r\n * @returns {undefined}\r\n */\r\nKMEANS.prototype.getClusters = function() {\r\n  var clusters = new Array(this.k);\r\n  var centroidId;\r\n\r\n  for (var pointId = 0; pointId < this.assignments.length; pointId++) {\r\n    centroidId = this.assignments[pointId];\r\n\r\n    // init empty cluster\r\n    if (typeof clusters[centroidId] === 'undefined') {\r\n      clusters[centroidId] = [];\r\n    }\r\n\r\n    clusters[centroidId].push(pointId);\r\n  }\r\n\r\n  return clusters;\r\n};\r\n\r\n// utils\r\n\r\n/**\r\n * @params {Array} point\r\n * @params {Array.<Array>} set\r\n * @params {Function} f\r\n * @returns {number}\r\n */\r\nKMEANS.prototype.argmin = function(point, set, f) {\r\n  var min = Number.MAX_VALUE;\r\n  var arg = 0;\r\n  var len = set.length;\r\n  var d;\r\n\r\n  for (var i = 0; i < len; i++) {\r\n    d = f(point, set[i]);\r\n    if (d < min) {\r\n      min = d;\r\n      arg = i;\r\n    }\r\n  }\r\n\r\n  return arg;\r\n};\r\n\r\n/**\r\n * Euclidean distance\r\n *\r\n * @params {number} p\r\n * @params {number} q\r\n * @returns {number}\r\n */\r\nKMEANS.prototype.distance = function(p, q) {\r\n  var sum = 0;\r\n  var i = Math.min(p.length, q.length);\r\n\r\n  while (i--) {\r\n    var diff = p[i] - q[i];\r\n    sum += diff * diff;\r\n  }\r\n\r\n  return Math.sqrt(sum);\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = KMEANS;\r\n}\r\n","/**\r\n * PriorityQueue\r\n * Elements in this queue are sorted according to their value\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * PriorityQueue class construcotr\r\n * @constructor\r\n *\r\n * @example\r\n * queue: [1,2,3,4]\r\n * priorities: [4,1,2,3]\r\n * > result = [1,4,2,3]\r\n *\r\n * @param {Array} elements\r\n * @param {Array} priorities\r\n * @param {string} sorting - asc / desc\r\n * @returns {PriorityQueue}\r\n */\r\nfunction PriorityQueue(elements, priorities, sorting) {\r\n  /** @type {Array} */\r\n  this._queue = [];\r\n  /** @type {Array} */\r\n  this._priorities = [];\r\n  /** @type {string} */\r\n  this._sorting = 'desc';\r\n\r\n  this._init(elements, priorities, sorting);\r\n};\r\n\r\n/**\r\n * Insert element\r\n *\r\n * @param {Object} ele\r\n * @param {Object} priority\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.insert = function(ele, priority) {\r\n  var indexToInsert = this._queue.length;\r\n  var index = indexToInsert;\r\n\r\n  while (index--) {\r\n    var priority2 = this._priorities[index];\r\n    if (this._sorting === 'desc') {\r\n      if (priority > priority2) {\r\n        indexToInsert = index;\r\n      }\r\n    } else {\r\n      if (priority < priority2) {\r\n        indexToInsert = index;\r\n      }\r\n    }\r\n  }\r\n\r\n  this._insertAt(ele, priority, indexToInsert);\r\n};\r\n\r\n/**\r\n * Remove element\r\n *\r\n * @param {Object} ele\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.remove = function(ele) {\r\n  var index = this._queue.length;\r\n\r\n  while (index--) {\r\n    var ele2 = this._queue[index];\r\n    if (ele === ele2) {\r\n      this._queue.splice(index, 1);\r\n      this._priorities.splice(index, 1);\r\n      break;\r\n    }\r\n  }\r\n};\r\n\r\n/**\r\n * For each loop wrapper\r\n *\r\n * @param {function} func\r\n * @returs {undefined}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.forEach = function(func) {\r\n  this._queue.forEach(func);\r\n};\r\n\r\n/**\r\n * @returns {Array}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getElements = function() {\r\n  return this._queue;\r\n};\r\n\r\n/**\r\n * @param {number} index\r\n * @returns {Object}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getElementPriority = function(index) {\r\n  return this._priorities[index];\r\n};\r\n\r\n/**\r\n * @returns {Array}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getPriorities = function() {\r\n  return this._priorities;\r\n};\r\n\r\n/**\r\n * @returns {Array}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getElementsWithPriorities = function() {\r\n  var result = [];\r\n\r\n  for (var i = 0, l = this._queue.length; i < l; i++) {\r\n    result.push([this._queue[i], this._priorities[i]]);\r\n  }\r\n\r\n  return result;\r\n};\r\n\r\n/**\r\n * Set object properties\r\n *\r\n * @param {Array} elements\r\n * @param {Array} priorities\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nPriorityQueue.prototype._init = function(elements, priorities, sorting) {\r\n\r\n  if (elements && priorities) {\r\n    this._queue = [];\r\n    this._priorities = [];\r\n\r\n    if (elements.length !== priorities.length) {\r\n      throw new Error('Arrays must have the same length');\r\n    }\r\n\r\n    for (var i = 0; i < elements.length; i++) {\r\n      this.insert(elements[i], priorities[i]);\r\n    }\r\n  }\r\n\r\n  if (sorting) {\r\n    this._sorting = sorting;\r\n  }\r\n};\r\n\r\n/**\r\n * Insert element at given position\r\n *\r\n * @param {Object} ele\r\n * @param {number} index\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nPriorityQueue.prototype._insertAt = function(ele, priority, index) {\r\n  if (this._queue.length === index) {\r\n    this._queue.push(ele);\r\n    this._priorities.push(priority);\r\n  } else {\r\n    this._queue.splice(index, 0, ele);\r\n    this._priorities.splice(index, 0, priority);\r\n  }\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = PriorityQueue;\r\n}\r\n","\r\n/**\r\n * @requires ./PriorityQueue.js\r\n */\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n      var PriorityQueue = require('./PriorityQueue.js');\r\n}\r\n\r\n/**\r\n * OPTICS - Ordering points to identify the clustering structure\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * OPTICS class constructor\r\n * @constructor\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distanceFunction\r\n * @returns {OPTICS}\r\n */\r\nfunction OPTICS(dataset, epsilon, minPts, distanceFunction) {\r\n  /** @type {number} */\r\n  this.epsilon = 1;\r\n  /** @type {number} */\r\n  this.minPts = 1;\r\n  /** @type {function} */\r\n  this.distance = this._euclideanDistance;\r\n\r\n  // temporary variables used during computation\r\n\r\n  /** @type {Array} */\r\n  this._reachability = [];\r\n  /** @type {Array} */\r\n  this._processed = [];\r\n  /** @type {number} */\r\n  this._coreDistance = 0;\r\n  /** @type {Array} */\r\n  this._orderedList = [];\r\n\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n}\r\n\r\n/******************************************************************************/\r\n// pulic functions\r\n\r\n/**\r\n * Start clustering\r\n *\r\n * @param {Array} dataset\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nOPTICS.prototype.run = function(dataset, epsilon, minPts, distanceFunction) {\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n\r\n  for (var pointId = 0, l = this.dataset.length; pointId < l; pointId++) {\r\n    if (this._processed[pointId] !== 1) {\r\n      this._processed[pointId] = 1;\r\n      this.clusters.push([pointId]);\r\n      var clusterId = this.clusters.length - 1;\r\n\r\n      this._orderedList.push(pointId);\r\n      var priorityQueue = new PriorityQueue(null, null, 'asc');\r\n      var neighbors = this._regionQuery(pointId);\r\n\r\n      // using priority queue assign elements to new cluster\r\n      if (this._distanceToCore(pointId) !== undefined) {\r\n        this._updateQueue(pointId, neighbors, priorityQueue);\r\n        this._expandCluster(clusterId, priorityQueue);\r\n      }\r\n    }\r\n  }\r\n\r\n  return this.clusters;\r\n};\r\n\r\n/**\r\n * Generate reachability plot for all points\r\n *\r\n * @returns {array}\r\n * @access public\r\n */\r\nOPTICS.prototype.getReachabilityPlot = function() {\r\n  var reachabilityPlot = [];\r\n\r\n  for (var i = 0, l = this._orderedList.length; i < l; i++) {\r\n    var pointId = this._orderedList[i];\r\n    var distance = this._reachability[pointId];\r\n\r\n    reachabilityPlot.push([pointId, distance]);\r\n  }\r\n\r\n  return reachabilityPlot;\r\n};\r\n\r\n/******************************************************************************/\r\n// protected functions\r\n\r\n/**\r\n * Set object properties\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distance\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nOPTICS.prototype._init = function(dataset, epsilon, minPts, distance) {\r\n\r\n  if (dataset) {\r\n\r\n    if (!(dataset instanceof Array)) {\r\n      throw Error('Dataset must be of type array, ' +\r\n        typeof dataset + ' given');\r\n    }\r\n\r\n    this.dataset = dataset;\r\n    this.clusters = [];\r\n    this._reachability = new Array(this.dataset.length);\r\n    this._processed = new Array(this.dataset.length);\r\n    this._coreDistance = 0;\r\n    this._orderedList = [];\r\n  }\r\n\r\n  if (epsilon) {\r\n    this.epsilon = epsilon;\r\n  }\r\n\r\n  if (minPts) {\r\n    this.minPts = minPts;\r\n  }\r\n\r\n  if (distance) {\r\n    this.distance = distance;\r\n  }\r\n};\r\n\r\n/**\r\n * Update information in queue\r\n *\r\n * @param {number} pointId\r\n * @param {Array} neighbors\r\n * @param {PriorityQueue} queue\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nOPTICS.prototype._updateQueue = function(pointId, neighbors, queue) {\r\n  var self = this;\r\n\r\n  this._coreDistance = this._distanceToCore(pointId);\r\n  neighbors.forEach(function(pointId2) {\r\n    if (self._processed[pointId2] === undefined) {\r\n      var dist = self.distance(self.dataset[pointId], self.dataset[pointId2]);\r\n      var newReachableDistance = Math.max(self._coreDistance, dist);\r\n\r\n      if (self._reachability[pointId2] === undefined) {\r\n        self._reachability[pointId2] = newReachableDistance;\r\n        queue.insert(pointId2, newReachableDistance);\r\n      } else {\r\n        if (newReachableDistance < self._reachability[pointId2]) {\r\n          self._reachability[pointId2] = newReachableDistance;\r\n          queue.remove(pointId2);\r\n          queue.insert(pointId2, newReachableDistance);\r\n        }\r\n      }\r\n    }\r\n  });\r\n};\r\n\r\n/**\r\n * Expand cluster\r\n *\r\n * @param {number} clusterId\r\n * @param {PriorityQueue} queue\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nOPTICS.prototype._expandCluster = function(clusterId, queue) {\r\n  var queueElements = queue.getElements();\r\n\r\n  for (var p = 0, l = queueElements.length; p < l; p++) {\r\n    var pointId = queueElements[p];\r\n    if (this._processed[pointId] === undefined) {\r\n      var neighbors = this._regionQuery(pointId);\r\n      this._processed[pointId] = 1;\r\n\r\n      this.clusters[clusterId].push(pointId);\r\n      this._orderedList.push(pointId);\r\n\r\n      if (this._distanceToCore(pointId) !== undefined) {\r\n        this._updateQueue(pointId, neighbors, queue);\r\n        this._expandCluster(clusterId, queue);\r\n      }\r\n    }\r\n  }\r\n};\r\n\r\n/**\r\n * Calculating distance to cluster core\r\n *\r\n * @param {number} pointId\r\n * @returns {number}\r\n * @access protected\r\n */\r\nOPTICS.prototype._distanceToCore = function(pointId) {\r\n  var l = this.epsilon;\r\n  for (var coreDistCand = 0; coreDistCand < l; coreDistCand++) {\r\n    var neighbors = this._regionQuery(pointId, coreDistCand);\r\n    if (neighbors.length >= this.minPts) {\r\n      return coreDistCand;\r\n    }\r\n  }\r\n\r\n  return;\r\n};\r\n\r\n/**\r\n * Find all neighbors around given point\r\n *\r\n * @param {number} pointId\r\n * @param {number} epsilon\r\n * @returns {Array}\r\n * @access protected\r\n */\r\nOPTICS.prototype._regionQuery = function(pointId, epsilon) {\r\n  epsilon = epsilon || this.epsilon;\r\n  var neighbors = [];\r\n\r\n  for (var id = 0, l = this.dataset.length; id < l; id++) {\r\n    if (this.distance(this.dataset[pointId], this.dataset[id]) < epsilon) {\r\n      neighbors.push(id);\r\n    }\r\n  }\r\n\r\n  return neighbors;\r\n};\r\n\r\n/******************************************************************************/\r\n// helpers\r\n\r\n/**\r\n * Calculate euclidean distance in multidimensional space\r\n *\r\n * @param {Array} p\r\n * @param {Array} q\r\n * @returns {number}\r\n * @access protected\r\n */\r\nOPTICS.prototype._euclideanDistance = function(p, q) {\r\n  var sum = 0;\r\n  var i = Math.min(p.length, q.length);\r\n\r\n  while (i--) {\r\n    sum += (p[i] - q[i]) * (p[i] - q[i]);\r\n  }\r\n\r\n  return Math.sqrt(sum);\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = OPTICS;\r\n}\r\n","\r\nif (typeof module !== 'undefined' && module.exports) {\r\n    module.exports = {\r\n      DBSCAN: require('./DBSCAN.js'),\r\n      KMEANS: require('./KMEANS.js'),\r\n      OPTICS: require('./OPTICS.js'),\r\n      PriorityQueue: require('./PriorityQueue.js')\r\n    };\r\n}\r\n",null,"import clone from \"@turf/clone\";\nimport distance from \"@turf/distance\";\nimport { coordAll } from \"@turf/meta\";\nimport { convertLength, } from \"@turf/helpers\";\nimport clustering from \"density-clustering\";\n/**\n * Takes a set of {@link Point|points} and partition them into clusters according to {@link DBSCAN's|https://en.wikipedia.org/wiki/DBSCAN} data clustering algorithm.\n *\n * @name clustersDbscan\n * @param {FeatureCollection<Point>} points to be clustered\n * @param {number} maxDistance Maximum Distance between any point of the cluster to generate the clusters (kilometers only)\n * @param {Object} [options={}] Optional parameters\n * @param {string} [options.units=\"kilometers\"] in which `maxDistance` is expressed, can be degrees, radians, miles, or kilometers\n * @param {boolean} [options.mutate=false] Allows GeoJSON input to be mutated\n * @param {number} [options.minPoints=3] Minimum number of points to generate a single cluster,\n * points which do not meet this requirement will be classified as an 'edge' or 'noise'.\n * @returns {FeatureCollection<Point>} Clustered Points with an additional two properties associated to each Feature:\n * - {number} cluster - the associated clusterId\n * - {string} dbscan - type of point it has been classified as ('core'|'edge'|'noise')\n * @example\n * // create random points with random z-values in their properties\n * var points = turf.randomPoint(100, {bbox: [0, 30, 20, 50]});\n * var maxDistance = 100;\n * var clustered = turf.clustersDbscan(points, maxDistance);\n *\n * //addToMap\n * var addToMap = [clustered];\n */\nfunction clustersDbscan(points, maxDistance, options) {\n    // Input validation being handled by Typescript\n    // collectionOf(points, 'Point', 'points must consist of a FeatureCollection of only Points');\n    // if (maxDistance === null || maxDistance === undefined) throw new Error('maxDistance is required');\n    // if (!(Math.sign(maxDistance) > 0)) throw new Error('maxDistance is invalid');\n    // if (!(minPoints === undefined || minPoints === null || Math.sign(minPoints) > 0)) throw new Error('options.minPoints is invalid');\n    if (options === void 0) { options = {}; }\n    // Clone points to prevent any mutations\n    if (options.mutate !== true)\n        points = clone(points);\n    // Defaults\n    options.minPoints = options.minPoints || 3;\n    // create clustered ids\n    var dbscan = new clustering.DBSCAN();\n    var clusteredIds = dbscan.run(coordAll(points), convertLength(maxDistance, options.units), options.minPoints, distance);\n    // Tag points to Clusters ID\n    var clusterId = -1;\n    clusteredIds.forEach(function (clusterIds) {\n        clusterId++;\n        // assign cluster ids to input points\n        clusterIds.forEach(function (idx) {\n            var clusterPoint = points.features[idx];\n            if (!clusterPoint.properties)\n                clusterPoint.properties = {};\n            clusterPoint.properties.cluster = clusterId;\n            clusterPoint.properties.dbscan = \"core\";\n        });\n    });\n    // handle noise points, if any\n    // edges points are tagged by DBSCAN as both 'noise' and 'cluster' as they can \"reach\" less than 'minPoints' number of points\n    dbscan.noise.forEach(function (noiseId) {\n        var noisePoint = points.features[noiseId];\n        if (!noisePoint.properties)\n            noisePoint.properties = {};\n        if (noisePoint.properties.cluster)\n            noisePoint.properties.dbscan = \"edge\";\n        else\n            noisePoint.properties.dbscan = \"noise\";\n    });\n    return points;\n}\nexport default clustersDbscan;\n","(function (global, factory) {\ntypeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\ntypeof define === 'function' && define.amd ? define(factory) :\n(global.KDBush = factory());\n}(this, (function () { 'use strict';\n\nfunction sortKD(ids, coords, nodeSize, left, right, depth) {\n    if (right - left <= nodeSize) { return; }\n\n    var m = (left + right) >> 1;\n\n    select(ids, coords, m, left, right, depth % 2);\n\n    sortKD(ids, coords, nodeSize, left, m - 1, depth + 1);\n    sortKD(ids, coords, nodeSize, m + 1, right, depth + 1);\n}\n\nfunction select(ids, coords, k, left, right, inc) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            var n = right - left + 1;\n            var m = k - left + 1;\n            var z = Math.log(n);\n            var s = 0.5 * Math.exp(2 * z / 3);\n            var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            select(ids, coords, k, newLeft, newRight, inc);\n        }\n\n        var t = coords[2 * k + inc];\n        var i = left;\n        var j = right;\n\n        swapItem(ids, coords, left, k);\n        if (coords[2 * right + inc] > t) { swapItem(ids, coords, left, right); }\n\n        while (i < j) {\n            swapItem(ids, coords, i, j);\n            i++;\n            j--;\n            while (coords[2 * i + inc] < t) { i++; }\n            while (coords[2 * j + inc] > t) { j--; }\n        }\n\n        if (coords[2 * left + inc] === t) { swapItem(ids, coords, left, j); }\n        else {\n            j++;\n            swapItem(ids, coords, j, right);\n        }\n\n        if (j <= k) { left = j + 1; }\n        if (k <= j) { right = j - 1; }\n    }\n}\n\nfunction swapItem(ids, coords, i, j) {\n    swap(ids, i, j);\n    swap(coords, 2 * i, 2 * j);\n    swap(coords, 2 * i + 1, 2 * j + 1);\n}\n\nfunction swap(arr, i, j) {\n    var tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\nfunction range(ids, coords, minX, minY, maxX, maxY, nodeSize) {\n    var stack = [0, ids.length - 1, 0];\n    var result = [];\n    var x, y;\n\n    while (stack.length) {\n        var axis = stack.pop();\n        var right = stack.pop();\n        var left = stack.pop();\n\n        if (right - left <= nodeSize) {\n            for (var i = left; i <= right; i++) {\n                x = coords[2 * i];\n                y = coords[2 * i + 1];\n                if (x >= minX && x <= maxX && y >= minY && y <= maxY) { result.push(ids[i]); }\n            }\n            continue;\n        }\n\n        var m = Math.floor((left + right) / 2);\n\n        x = coords[2 * m];\n        y = coords[2 * m + 1];\n\n        if (x >= minX && x <= maxX && y >= minY && y <= maxY) { result.push(ids[m]); }\n\n        var nextAxis = (axis + 1) % 2;\n\n        if (axis === 0 ? minX <= x : minY <= y) {\n            stack.push(left);\n            stack.push(m - 1);\n            stack.push(nextAxis);\n        }\n        if (axis === 0 ? maxX >= x : maxY >= y) {\n            stack.push(m + 1);\n            stack.push(right);\n            stack.push(nextAxis);\n        }\n    }\n\n    return result;\n}\n\nfunction within(ids, coords, qx, qy, r, nodeSize) {\n    var stack = [0, ids.length - 1, 0];\n    var result = [];\n    var r2 = r * r;\n\n    while (stack.length) {\n        var axis = stack.pop();\n        var right = stack.pop();\n        var left = stack.pop();\n\n        if (right - left <= nodeSize) {\n            for (var i = left; i <= right; i++) {\n                if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) { result.push(ids[i]); }\n            }\n            continue;\n        }\n\n        var m = Math.floor((left + right) / 2);\n\n        var x = coords[2 * m];\n        var y = coords[2 * m + 1];\n\n        if (sqDist(x, y, qx, qy) <= r2) { result.push(ids[m]); }\n\n        var nextAxis = (axis + 1) % 2;\n\n        if (axis === 0 ? qx - r <= x : qy - r <= y) {\n            stack.push(left);\n            stack.push(m - 1);\n            stack.push(nextAxis);\n        }\n        if (axis === 0 ? qx + r >= x : qy + r >= y) {\n            stack.push(m + 1);\n            stack.push(right);\n            stack.push(nextAxis);\n        }\n    }\n\n    return result;\n}\n\nfunction sqDist(ax, ay, bx, by) {\n    var dx = ax - bx;\n    var dy = ay - by;\n    return dx * dx + dy * dy;\n}\n\nvar defaultGetX = function (p) { return p[0]; };\nvar defaultGetY = function (p) { return p[1]; };\n\nvar KDBush = function KDBush(points, getX, getY, nodeSize, ArrayType) {\n    if ( getX === void 0 ) getX = defaultGetX;\n    if ( getY === void 0 ) getY = defaultGetY;\n    if ( nodeSize === void 0 ) nodeSize = 64;\n    if ( ArrayType === void 0 ) ArrayType = Float64Array;\n\n    this.nodeSize = nodeSize;\n    this.points = points;\n\n    var IndexArrayType = points.length < 65536 ? Uint16Array : Uint32Array;\n\n    var ids = this.ids = new IndexArrayType(points.length);\n    var coords = this.coords = new ArrayType(points.length * 2);\n\n    for (var i = 0; i < points.length; i++) {\n        ids[i] = i;\n        coords[2 * i] = getX(points[i]);\n        coords[2 * i + 1] = getY(points[i]);\n    }\n\n    sortKD(ids, coords, nodeSize, 0, ids.length - 1, 0);\n};\n\nKDBush.prototype.range = function range$1 (minX, minY, maxX, maxY) {\n    return range(this.ids, this.coords, minX, minY, maxX, maxY, this.nodeSize);\n};\n\nKDBush.prototype.within = function within$1 (x, y, r) {\n    return within(this.ids, this.coords, x, y, r, this.nodeSize);\n};\n\nreturn KDBush;\n\n})));\n","\nimport KDBush from 'kdbush';\n\nconst defaultOptions = {\n    minZoom: 0,   // min zoom to generate clusters on\n    maxZoom: 16,  // max zoom level to cluster the points on\n    minPoints: 2, // minimum points to form a cluster\n    radius: 40,   // cluster radius in pixels\n    extent: 512,  // tile extent (radius is calculated relative to it)\n    nodeSize: 64, // size of the KD-tree leaf node, affects performance\n    log: false,   // whether to log timing info\n\n    // whether to generate numeric ids for input features (in vector tiles)\n    generateId: false,\n\n    // a reduce function for calculating custom cluster properties\n    reduce: null, // (accumulated, props) => { accumulated.sum += props.sum; }\n\n    // properties to use for individual points when running the reducer\n    map: props => props // props => ({sum: props.my_value})\n};\n\nconst fround = Math.fround || (tmp => ((x) => { tmp[0] = +x; return tmp[0]; }))(new Float32Array(1));\n\nexport default class Supercluster {\n    constructor(options) {\n        this.options = extend(Object.create(defaultOptions), options);\n        this.trees = new Array(this.options.maxZoom + 1);\n    }\n\n    load(points) {\n        const {log, minZoom, maxZoom, nodeSize} = this.options;\n\n        if (log) console.time('total time');\n\n        const timerId = `prepare ${  points.length  } points`;\n        if (log) console.time(timerId);\n\n        this.points = points;\n\n        // generate a cluster object for each point and index input points into a KD-tree\n        let clusters = [];\n        for (let i = 0; i < points.length; i++) {\n            if (!points[i].geometry) continue;\n            clusters.push(createPointCluster(points[i], i));\n        }\n        this.trees[maxZoom + 1] = new KDBush(clusters, getX, getY, nodeSize, Float32Array);\n\n        if (log) console.timeEnd(timerId);\n\n        // cluster points on max zoom, then cluster the results on previous zoom, etc.;\n        // results in a cluster hierarchy across zoom levels\n        for (let z = maxZoom; z >= minZoom; z--) {\n            const now = +Date.now();\n\n            // create a new set of clusters for the zoom and index them with a KD-tree\n            clusters = this._cluster(clusters, z);\n            this.trees[z] = new KDBush(clusters, getX, getY, nodeSize, Float32Array);\n\n            if (log) console.log('z%d: %d clusters in %dms', z, clusters.length, +Date.now() - now);\n        }\n\n        if (log) console.timeEnd('total time');\n\n        return this;\n    }\n\n    getClusters(bbox, zoom) {\n        let minLng = ((bbox[0] + 180) % 360 + 360) % 360 - 180;\n        const minLat = Math.max(-90, Math.min(90, bbox[1]));\n        let maxLng = bbox[2] === 180 ? 180 : ((bbox[2] + 180) % 360 + 360) % 360 - 180;\n        const maxLat = Math.max(-90, Math.min(90, bbox[3]));\n\n        if (bbox[2] - bbox[0] >= 360) {\n            minLng = -180;\n            maxLng = 180;\n        } else if (minLng > maxLng) {\n            const easternHem = this.getClusters([minLng, minLat, 180, maxLat], zoom);\n            const westernHem = this.getClusters([-180, minLat, maxLng, maxLat], zoom);\n            return easternHem.concat(westernHem);\n        }\n\n        const tree = this.trees[this._limitZoom(zoom)];\n        const ids = tree.range(lngX(minLng), latY(maxLat), lngX(maxLng), latY(minLat));\n        const clusters = [];\n        for (const id of ids) {\n            const c = tree.points[id];\n            clusters.push(c.numPoints ? getClusterJSON(c) : this.points[c.index]);\n        }\n        return clusters;\n    }\n\n    getChildren(clusterId) {\n        const originId = this._getOriginId(clusterId);\n        const originZoom = this._getOriginZoom(clusterId);\n        const errorMsg = 'No cluster with the specified id.';\n\n        const index = this.trees[originZoom];\n        if (!index) throw new Error(errorMsg);\n\n        const origin = index.points[originId];\n        if (!origin) throw new Error(errorMsg);\n\n        const r = this.options.radius / (this.options.extent * Math.pow(2, originZoom - 1));\n        const ids = index.within(origin.x, origin.y, r);\n        const children = [];\n        for (const id of ids) {\n            const c = index.points[id];\n            if (c.parentId === clusterId) {\n                children.push(c.numPoints ? getClusterJSON(c) : this.points[c.index]);\n            }\n        }\n\n        if (children.length === 0) throw new Error(errorMsg);\n\n        return children;\n    }\n\n    getLeaves(clusterId, limit, offset) {\n        limit = limit || 10;\n        offset = offset || 0;\n\n        const leaves = [];\n        this._appendLeaves(leaves, clusterId, limit, offset, 0);\n\n        return leaves;\n    }\n\n    getTile(z, x, y) {\n        const tree = this.trees[this._limitZoom(z)];\n        const z2 = Math.pow(2, z);\n        const {extent, radius} = this.options;\n        const p = radius / extent;\n        const top = (y - p) / z2;\n        const bottom = (y + 1 + p) / z2;\n\n        const tile = {\n            features: []\n        };\n\n        this._addTileFeatures(\n            tree.range((x - p) / z2, top, (x + 1 + p) / z2, bottom),\n            tree.points, x, y, z2, tile);\n\n        if (x === 0) {\n            this._addTileFeatures(\n                tree.range(1 - p / z2, top, 1, bottom),\n                tree.points, z2, y, z2, tile);\n        }\n        if (x === z2 - 1) {\n            this._addTileFeatures(\n                tree.range(0, top, p / z2, bottom),\n                tree.points, -1, y, z2, tile);\n        }\n\n        return tile.features.length ? tile : null;\n    }\n\n    getClusterExpansionZoom(clusterId) {\n        let expansionZoom = this._getOriginZoom(clusterId) - 1;\n        while (expansionZoom <= this.options.maxZoom) {\n            const children = this.getChildren(clusterId);\n            expansionZoom++;\n            if (children.length !== 1) break;\n            clusterId = children[0].properties.cluster_id;\n        }\n        return expansionZoom;\n    }\n\n    _appendLeaves(result, clusterId, limit, offset, skipped) {\n        const children = this.getChildren(clusterId);\n\n        for (const child of children) {\n            const props = child.properties;\n\n            if (props && props.cluster) {\n                if (skipped + props.point_count <= offset) {\n                    // skip the whole cluster\n                    skipped += props.point_count;\n                } else {\n                    // enter the cluster\n                    skipped = this._appendLeaves(result, props.cluster_id, limit, offset, skipped);\n                    // exit the cluster\n                }\n            } else if (skipped < offset) {\n                // skip a single point\n                skipped++;\n            } else {\n                // add a single point\n                result.push(child);\n            }\n            if (result.length === limit) break;\n        }\n\n        return skipped;\n    }\n\n    _addTileFeatures(ids, points, x, y, z2, tile) {\n        for (const i of ids) {\n            const c = points[i];\n            const isCluster = c.numPoints;\n\n            let tags, px, py;\n            if (isCluster) {\n                tags = getClusterProperties(c);\n                px = c.x;\n                py = c.y;\n            } else {\n                const p = this.points[c.index];\n                tags = p.properties;\n                px = lngX(p.geometry.coordinates[0]);\n                py = latY(p.geometry.coordinates[1]);\n            }\n\n            const f = {\n                type: 1,\n                geometry: [[\n                    Math.round(this.options.extent * (px * z2 - x)),\n                    Math.round(this.options.extent * (py * z2 - y))\n                ]],\n                tags\n            };\n\n            // assign id\n            let id;\n            if (isCluster) {\n                id = c.id;\n            } else if (this.options.generateId) {\n                // optionally generate id\n                id = c.index;\n            } else if (this.points[c.index].id) {\n                // keep id if already assigned\n                id = this.points[c.index].id;\n            }\n\n            if (id !== undefined) f.id = id;\n\n            tile.features.push(f);\n        }\n    }\n\n    _limitZoom(z) {\n        return Math.max(this.options.minZoom, Math.min(+z, this.options.maxZoom + 1));\n    }\n\n    _cluster(points, zoom) {\n        const clusters = [];\n        const {radius, extent, reduce, minPoints} = this.options;\n        const r = radius / (extent * Math.pow(2, zoom));\n\n        // loop through each point\n        for (let i = 0; i < points.length; i++) {\n            const p = points[i];\n            // if we've already visited the point at this zoom level, skip it\n            if (p.zoom <= zoom) continue;\n            p.zoom = zoom;\n\n            // find all nearby points\n            const tree = this.trees[zoom + 1];\n            const neighborIds = tree.within(p.x, p.y, r);\n\n            const numPointsOrigin = p.numPoints || 1;\n            let numPoints = numPointsOrigin;\n\n            // count the number of points in a potential cluster\n            for (const neighborId of neighborIds) {\n                const b = tree.points[neighborId];\n                // filter out neighbors that are already processed\n                if (b.zoom > zoom) numPoints += b.numPoints || 1;\n            }\n\n            // if there were neighbors to merge, and there are enough points to form a cluster\n            if (numPoints > numPointsOrigin && numPoints >= minPoints) {\n                let wx = p.x * numPointsOrigin;\n                let wy = p.y * numPointsOrigin;\n\n                let clusterProperties = reduce && numPointsOrigin > 1 ? this._map(p, true) : null;\n\n                // encode both zoom and point index on which the cluster originated -- offset by total length of features\n                const id = (i << 5) + (zoom + 1) + this.points.length;\n\n                for (const neighborId of neighborIds) {\n                    const b = tree.points[neighborId];\n\n                    if (b.zoom <= zoom) continue;\n                    b.zoom = zoom; // save the zoom (so it doesn't get processed twice)\n\n                    const numPoints2 = b.numPoints || 1;\n                    wx += b.x * numPoints2; // accumulate coordinates for calculating weighted center\n                    wy += b.y * numPoints2;\n\n                    b.parentId = id;\n\n                    if (reduce) {\n                        if (!clusterProperties) clusterProperties = this._map(p, true);\n                        reduce(clusterProperties, this._map(b));\n                    }\n                }\n\n                p.parentId = id;\n                clusters.push(createCluster(wx / numPoints, wy / numPoints, id, numPoints, clusterProperties));\n\n            } else { // left points as unclustered\n                clusters.push(p);\n\n                if (numPoints > 1) {\n                    for (const neighborId of neighborIds) {\n                        const b = tree.points[neighborId];\n                        if (b.zoom <= zoom) continue;\n                        b.zoom = zoom;\n                        clusters.push(b);\n                    }\n                }\n            }\n        }\n\n        return clusters;\n    }\n\n    // get index of the point from which the cluster originated\n    _getOriginId(clusterId) {\n        return (clusterId - this.points.length) >> 5;\n    }\n\n    // get zoom of the point from which the cluster originated\n    _getOriginZoom(clusterId) {\n        return (clusterId - this.points.length) % 32;\n    }\n\n    _map(point, clone) {\n        if (point.numPoints) {\n            return clone ? extend({}, point.properties) : point.properties;\n        }\n        const original = this.points[point.index].properties;\n        const result = this.options.map(original);\n        return clone && result === original ? extend({}, result) : result;\n    }\n}\n\nfunction createCluster(x, y, id, numPoints, properties) {\n    return {\n        x: fround(x), // weighted cluster center; round for consistency with Float32Array index\n        y: fround(y),\n        zoom: Infinity, // the last zoom the cluster was processed at\n        id, // encodes index of the first child of the cluster and its zoom level\n        parentId: -1, // parent cluster id\n        numPoints,\n        properties\n    };\n}\n\nfunction createPointCluster(p, id) {\n    const [x, y] = p.geometry.coordinates;\n    return {\n        x: fround(lngX(x)), // projected point coordinates\n        y: fround(latY(y)),\n        zoom: Infinity, // the last zoom the point was processed at\n        index: id, // index of the source feature in the original input array,\n        parentId: -1 // parent cluster id\n    };\n}\n\nfunction getClusterJSON(cluster) {\n    return {\n        type: 'Feature',\n        id: cluster.id,\n        properties: getClusterProperties(cluster),\n        geometry: {\n            type: 'Point',\n            coordinates: [xLng(cluster.x), yLat(cluster.y)]\n        }\n    };\n}\n\nfunction getClusterProperties(cluster) {\n    const count = cluster.numPoints;\n    const abbrev =\n        count >= 10000 ? `${Math.round(count / 1000)  }k` :\n        count >= 1000 ? `${Math.round(count / 100) / 10  }k` : count;\n    return extend(extend({}, cluster.properties), {\n        cluster: true,\n        cluster_id: cluster.id,\n        point_count: count,\n        point_count_abbreviated: abbrev\n    });\n}\n\n// longitude/latitude to spherical mercator in [0..1] range\nfunction lngX(lng) {\n    return lng / 360 + 0.5;\n}\nfunction latY(lat) {\n    const sin = Math.sin(lat * Math.PI / 180);\n    const y = (0.5 - 0.25 * Math.log((1 + sin) / (1 - sin)) / Math.PI);\n    return y < 0 ? 0 : y > 1 ? 1 : y;\n}\n\n// spherical mercator to longitude/latitude\nfunction xLng(x) {\n    return (x - 0.5) * 360;\n}\nfunction yLat(y) {\n    const y2 = (180 - y * 360) * Math.PI / 180;\n    return 360 * Math.atan(Math.exp(y2)) / Math.PI - 90;\n}\n\nfunction extend(dest, src) {\n    for (const id in src) dest[id] = src[id];\n    return dest;\n}\n\nfunction getX(p) {\n    return p.x;\n}\nfunction getY(p) {\n    return p.y;\n}\n","/* global ActiveXObject -- old IE, WSH */\nvar anObject = require('../internals/an-object');\nvar defineProperties = require('../internals/object-define-properties');\nvar enumBugKeys = require('../internals/enum-bug-keys');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar html = require('../internals/html');\nvar documentCreateElement = require('../internals/document-create-element');\nvar sharedKey = require('../internals/shared-key');\n\nvar GT = '>';\nvar LT = '<';\nvar PROTOTYPE = 'prototype';\nvar SCRIPT = 'script';\nvar IE_PROTO = sharedKey('IE_PROTO');\n\nvar EmptyConstructor = function () { /* empty */ };\n\nvar scriptTag = function (content) {\n  return LT + SCRIPT + GT + content + LT + '/' + SCRIPT + GT;\n};\n\n// Create object with fake `null` prototype: use ActiveX Object with cleared prototype\nvar NullProtoObjectViaActiveX = function (activeXDocument) {\n  activeXDocument.write(scriptTag(''));\n  activeXDocument.close();\n  var temp = activeXDocument.parentWindow.Object;\n  activeXDocument = null; // avoid memory leak\n  return temp;\n};\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar NullProtoObjectViaIFrame = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = documentCreateElement('iframe');\n  var JS = 'java' + SCRIPT + ':';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  html.appendChild(iframe);\n  // https://github.com/zloirock/core-js/issues/475\n  iframe.src = String(JS);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(scriptTag('document.F=Object'));\n  iframeDocument.close();\n  return iframeDocument.F;\n};\n\n// Check for document.domain and active x support\n// No need to use active x approach when document.domain is not set\n// see https://github.com/es-shims/es5-shim/issues/150\n// variation of https://github.com/kitcambridge/es5-shim/commit/4f738ac066346\n// avoid IE GC bug\nvar activeXDocument;\nvar NullProtoObject = function () {\n  try {\n    activeXDocument = new ActiveXObject('htmlfile');\n  } catch (error) { /* ignore */ }\n  NullProtoObject = typeof document != 'undefined'\n    ? document.domain && activeXDocument\n      ? NullProtoObjectViaActiveX(activeXDocument) // old IE\n      : NullProtoObjectViaIFrame()\n    : NullProtoObjectViaActiveX(activeXDocument); // WSH\n  var length = enumBugKeys.length;\n  while (length--) delete NullProtoObject[PROTOTYPE][enumBugKeys[length]];\n  return NullProtoObject();\n};\n\nhiddenKeys[IE_PROTO] = true;\n\n// `Object.create` method\n// https://tc39.es/ecma262/#sec-object.create\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    EmptyConstructor[PROTOTYPE] = anObject(O);\n    result = new EmptyConstructor();\n    EmptyConstructor[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = NullProtoObject();\n  return Properties === undefined ? result : defineProperties(result, Properties);\n};\n","'use strict';\n\n// do not edit .js files directly - edit src/index.jst\n\n\n  var envHasBigInt64Array = typeof BigInt64Array !== 'undefined';\n\n\nmodule.exports = function equal(a, b) {\n  if (a === b) return true;\n\n  if (a && b && typeof a == 'object' && typeof b == 'object') {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n\n    if ((a instanceof Map) && (b instanceof Map)) {\n      if (a.size !== b.size) return false;\n      for (i of a.entries())\n        if (!b.has(i[0])) return false;\n      for (i of a.entries())\n        if (!equal(i[1], b.get(i[0]))) return false;\n      return true;\n    }\n\n    if ((a instanceof Set) && (b instanceof Set)) {\n      if (a.size !== b.size) return false;\n      for (i of a.entries())\n        if (!b.has(i[0])) return false;\n      return true;\n    }\n\n    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (a[i] !== b[i]) return false;\n      return true;\n    }\n\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0;)\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0;) {\n      var key = keys[i];\n\n      if (!equal(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a!==a && b!==b;\n};\n",null,"var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar anObject = require('../internals/an-object');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar objectKeys = require('../internals/object-keys');\n\n// `Object.defineProperties` method\n// https://tc39.es/ecma262/#sec-object.defineproperties\n// eslint-disable-next-line es/no-object-defineproperties -- safe\nmodule.exports = DESCRIPTORS ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var props = toIndexedObject(Properties);\n  var keys = objectKeys(Properties);\n  var length = keys.length;\n  var index = 0;\n  var key;\n  while (length > index) definePropertyModule.f(O, key = keys[index++], props[key]);\n  return O;\n};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('document', 'documentElement');\n","var wellKnownSymbol = require('../internals/well-known-symbol');\nvar create = require('../internals/object-create');\nvar definePropertyModule = require('../internals/object-define-property');\n\nvar UNSCOPABLES = wellKnownSymbol('unscopables');\nvar ArrayPrototype = Array.prototype;\n\n// Array.prototype[@@unscopables]\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\nif (ArrayPrototype[UNSCOPABLES] == undefined) {\n  definePropertyModule.f(ArrayPrototype, UNSCOPABLES, {\n    configurable: true,\n    value: create(null)\n  });\n}\n\n// add a key to Array.prototype[@@unscopables]\nmodule.exports = function (key) {\n  ArrayPrototype[UNSCOPABLES][key] = true;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar $includes = require('../internals/array-includes').includes;\nvar addToUnscopables = require('../internals/add-to-unscopables');\n\n// `Array.prototype.includes` method\n// https://tc39.es/ecma262/#sec-array.prototype.includes\n$({ target: 'Array', proto: true }, {\n  includes: function includes(el /* , fromIndex = 0 */) {\n    return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined);\n  }\n});\n\n// https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\naddToUnscopables('includes');\n","var isObject = require('../internals/is-object');\nvar classof = require('../internals/classof-raw');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar MATCH = wellKnownSymbol('match');\n\n// `IsRegExp` abstract operation\n// https://tc39.es/ecma262/#sec-isregexp\nmodule.exports = function (it) {\n  var isRegExp;\n  return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : classof(it) == 'RegExp');\n};\n","var global = require('../internals/global');\nvar isRegExp = require('../internals/is-regexp');\n\nvar TypeError = global.TypeError;\n\nmodule.exports = function (it) {\n  if (isRegExp(it)) {\n    throw TypeError(\"The method doesn't accept regular expressions\");\n  } return it;\n};\n","var global = require('../internals/global');\nvar classof = require('../internals/classof');\n\nvar String = global.String;\n\nmodule.exports = function (argument) {\n  if (classof(argument) === 'Symbol') throw TypeError('Cannot convert a Symbol value to a string');\n  return String(argument);\n};\n","var wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar MATCH = wellKnownSymbol('match');\n\nmodule.exports = function (METHOD_NAME) {\n  var regexp = /./;\n  try {\n    '/./'[METHOD_NAME](regexp);\n  } catch (error1) {\n    try {\n      regexp[MATCH] = false;\n      return '/./'[METHOD_NAME](regexp);\n    } catch (error2) { /* empty */ }\n  } return false;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar notARegExp = require('../internals/not-a-regexp');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar toString = require('../internals/to-string');\nvar correctIsRegExpLogic = require('../internals/correct-is-regexp-logic');\n\nvar stringIndexOf = uncurryThis(''.indexOf);\n\n// `String.prototype.includes` method\n// https://tc39.es/ecma262/#sec-string.prototype.includes\n$({ target: 'String', proto: true, forced: !correctIsRegExpLogic('includes') }, {\n  includes: function includes(searchString /* , position = 0 */) {\n    return !!~stringIndexOf(\n      toString(requireObjectCoercible(this)),\n      toString(notARegExp(searchString)),\n      arguments.length > 1 ? arguments[1] : undefined\n    );\n  }\n});\n","'use strict';\nvar toPropertyKey = require('../internals/to-property-key');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = function (object, key, value) {\n  var propertyKey = toPropertyKey(key);\n  if (propertyKey in object) definePropertyModule.f(object, propertyKey, createPropertyDescriptor(0, value));\n  else object[propertyKey] = value;\n};\n","'use strict';\nvar $ = require('../internals/export');\nvar global = require('../internals/global');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\nvar toIntegerOrInfinity = require('../internals/to-integer-or-infinity');\nvar lengthOfArrayLike = require('../internals/length-of-array-like');\nvar toObject = require('../internals/to-object');\nvar arraySpeciesCreate = require('../internals/array-species-create');\nvar createProperty = require('../internals/create-property');\nvar arrayMethodHasSpeciesSupport = require('../internals/array-method-has-species-support');\n\nvar HAS_SPECIES_SUPPORT = arrayMethodHasSpeciesSupport('splice');\n\nvar TypeError = global.TypeError;\nvar max = Math.max;\nvar min = Math.min;\nvar MAX_SAFE_INTEGER = 0x1FFFFFFFFFFFFF;\nvar MAXIMUM_ALLOWED_LENGTH_EXCEEDED = 'Maximum allowed length exceeded';\n\n// `Array.prototype.splice` method\n// https://tc39.es/ecma262/#sec-array.prototype.splice\n// with adding support of @@species\n$({ target: 'Array', proto: true, forced: !HAS_SPECIES_SUPPORT }, {\n  splice: function splice(start, deleteCount /* , ...items */) {\n    var O = toObject(this);\n    var len = lengthOfArrayLike(O);\n    var actualStart = toAbsoluteIndex(start, len);\n    var argumentsLength = arguments.length;\n    var insertCount, actualDeleteCount, A, k, from, to;\n    if (argumentsLength === 0) {\n      insertCount = actualDeleteCount = 0;\n    } else if (argumentsLength === 1) {\n      insertCount = 0;\n      actualDeleteCount = len - actualStart;\n    } else {\n      insertCount = argumentsLength - 2;\n      actualDeleteCount = min(max(toIntegerOrInfinity(deleteCount), 0), len - actualStart);\n    }\n    if (len + insertCount - actualDeleteCount > MAX_SAFE_INTEGER) {\n      throw TypeError(MAXIMUM_ALLOWED_LENGTH_EXCEEDED);\n    }\n    A = arraySpeciesCreate(O, actualDeleteCount);\n    for (k = 0; k < actualDeleteCount; k++) {\n      from = actualStart + k;\n      if (from in O) createProperty(A, k, O[from]);\n    }\n    A.length = actualDeleteCount;\n    if (insertCount < actualDeleteCount) {\n      for (k = actualStart; k < len - actualDeleteCount; k++) {\n        from = k + actualDeleteCount;\n        to = k + insertCount;\n        if (from in O) O[to] = O[from];\n        else delete O[to];\n      }\n      for (k = len; k > len - actualDeleteCount + insertCount; k--) delete O[k - 1];\n    } else if (insertCount > actualDeleteCount) {\n      for (k = len - actualDeleteCount; k > actualStart; k--) {\n        from = k + actualDeleteCount - 1;\n        to = k + insertCount - 1;\n        if (from in O) O[to] = O[from];\n        else delete O[to];\n      }\n    }\n    for (k = 0; k < insertCount; k++) {\n      O[k + actualStart] = arguments[k + 2];\n    }\n    O.length = len - actualDeleteCount + insertCount;\n    return A;\n  }\n});\n","var global = require('../internals/global');\nvar isCallable = require('../internals/is-callable');\n\nvar String = global.String;\nvar TypeError = global.TypeError;\n\nmodule.exports = function (argument) {\n  if (typeof argument == 'object' || isCallable(argument)) return argument;\n  throw TypeError(\"Can't set \" + String(argument) + ' as a prototype');\n};\n","/* eslint-disable no-proto -- safe */\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar anObject = require('../internals/an-object');\nvar aPossiblePrototype = require('../internals/a-possible-prototype');\n\n// `Object.setPrototypeOf` method\n// https://tc39.es/ecma262/#sec-object.setprototypeof\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n// eslint-disable-next-line es/no-object-setprototypeof -- safe\nmodule.exports = Object.setPrototypeOf || ('__proto__' in {} ? function () {\n  var CORRECT_SETTER = false;\n  var test = {};\n  var setter;\n  try {\n    // eslint-disable-next-line es/no-object-getownpropertydescriptor -- safe\n    setter = uncurryThis(Object.getOwnPropertyDescriptor(Object.prototype, '__proto__').set);\n    setter(test, []);\n    CORRECT_SETTER = test instanceof Array;\n  } catch (error) { /* empty */ }\n  return function setPrototypeOf(O, proto) {\n    anObject(O);\n    aPossiblePrototype(proto);\n    if (CORRECT_SETTER) setter(O, proto);\n    else O.__proto__ = proto;\n    return O;\n  };\n}() : undefined);\n","var isCallable = require('../internals/is-callable');\nvar isObject = require('../internals/is-object');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\n\n// makes subclassing work correct for wrapped built-ins\nmodule.exports = function ($this, dummy, Wrapper) {\n  var NewTarget, NewTargetPrototype;\n  if (\n    // it can work only with native `setPrototypeOf`\n    setPrototypeOf &&\n    // we haven't completely correct pre-ES6 way for getting `new.target`, so use this\n    isCallable(NewTarget = dummy.constructor) &&\n    NewTarget !== Wrapper &&\n    isObject(NewTargetPrototype = NewTarget.prototype) &&\n    NewTargetPrototype !== Wrapper.prototype\n  ) setPrototypeOf($this, NewTargetPrototype);\n  return $this;\n};\n","var uncurryThis = require('../internals/function-uncurry-this');\n\n// `thisNumberValue` abstract operation\n// https://tc39.es/ecma262/#sec-thisnumbervalue\nmodule.exports = uncurryThis(1.0.valueOf);\n","var uncurryThis = require('../internals/function-uncurry-this');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\nvar toString = require('../internals/to-string');\nvar whitespaces = require('../internals/whitespaces');\n\nvar replace = uncurryThis(''.replace);\nvar whitespace = '[' + whitespaces + ']';\nvar ltrim = RegExp('^' + whitespace + whitespace + '*');\nvar rtrim = RegExp(whitespace + whitespace + '*$');\n\n// `String.prototype.{ trim, trimStart, trimEnd, trimLeft, trimRight }` methods implementation\nvar createMethod = function (TYPE) {\n  return function ($this) {\n    var string = toString(requireObjectCoercible($this));\n    if (TYPE & 1) string = replace(string, ltrim, '');\n    if (TYPE & 2) string = replace(string, rtrim, '');\n    return string;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.{ trimLeft, trimStart }` methods\n  // https://tc39.es/ecma262/#sec-string.prototype.trimstart\n  start: createMethod(1),\n  // `String.prototype.{ trimRight, trimEnd }` methods\n  // https://tc39.es/ecma262/#sec-string.prototype.trimend\n  end: createMethod(2),\n  // `String.prototype.trim` method\n  // https://tc39.es/ecma262/#sec-string.prototype.trim\n  trim: createMethod(3)\n};\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar uncurryThis = require('../internals/function-uncurry-this');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar hasOwn = require('../internals/has-own-property');\nvar inheritIfRequired = require('../internals/inherit-if-required');\nvar isPrototypeOf = require('../internals/object-is-prototype-of');\nvar isSymbol = require('../internals/is-symbol');\nvar toPrimitive = require('../internals/to-primitive');\nvar fails = require('../internals/fails');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar defineProperty = require('../internals/object-define-property').f;\nvar thisNumberValue = require('../internals/this-number-value');\nvar trim = require('../internals/string-trim').trim;\n\nvar NUMBER = 'Number';\nvar NativeNumber = global[NUMBER];\nvar NumberPrototype = NativeNumber.prototype;\nvar TypeError = global.TypeError;\nvar arraySlice = uncurryThis(''.slice);\nvar charCodeAt = uncurryThis(''.charCodeAt);\n\n// `ToNumeric` abstract operation\n// https://tc39.es/ecma262/#sec-tonumeric\nvar toNumeric = function (value) {\n  var primValue = toPrimitive(value, 'number');\n  return typeof primValue == 'bigint' ? primValue : toNumber(primValue);\n};\n\n// `ToNumber` abstract operation\n// https://tc39.es/ecma262/#sec-tonumber\nvar toNumber = function (argument) {\n  var it = toPrimitive(argument, 'number');\n  var first, third, radix, maxCode, digits, length, index, code;\n  if (isSymbol(it)) throw TypeError('Cannot convert a Symbol value to a number');\n  if (typeof it == 'string' && it.length > 2) {\n    it = trim(it);\n    first = charCodeAt(it, 0);\n    if (first === 43 || first === 45) {\n      third = charCodeAt(it, 2);\n      if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\n    } else if (first === 48) {\n      switch (charCodeAt(it, 1)) {\n        case 66: case 98: radix = 2; maxCode = 49; break; // fast equal of /^0b[01]+$/i\n        case 79: case 111: radix = 8; maxCode = 55; break; // fast equal of /^0o[0-7]+$/i\n        default: return +it;\n      }\n      digits = arraySlice(it, 2);\n      length = digits.length;\n      for (index = 0; index < length; index++) {\n        code = charCodeAt(digits, index);\n        // parseInt parses a string to a first unavailable symbol\n        // but ToNumber should return NaN if a string contains unavailable symbols\n        if (code < 48 || code > maxCode) return NaN;\n      } return parseInt(digits, radix);\n    }\n  } return +it;\n};\n\n// `Number` constructor\n// https://tc39.es/ecma262/#sec-number-constructor\nif (isForced(NUMBER, !NativeNumber(' 0o1') || !NativeNumber('0b1') || NativeNumber('+0x1'))) {\n  var NumberWrapper = function Number(value) {\n    var n = arguments.length < 1 ? 0 : NativeNumber(toNumeric(value));\n    var dummy = this;\n    // check on 1..constructor(foo) case\n    return isPrototypeOf(NumberPrototype, dummy) && fails(function () { thisNumberValue(dummy); })\n      ? inheritIfRequired(Object(n), dummy, NumberWrapper) : n;\n  };\n  for (var keys = DESCRIPTORS ? getOwnPropertyNames(NativeNumber) : (\n    // ES3:\n    'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\n    // ES2015 (in case, if modules with ES2015 Number statics required before):\n    'EPSILON,MAX_SAFE_INTEGER,MIN_SAFE_INTEGER,isFinite,isInteger,isNaN,isSafeInteger,parseFloat,parseInt,' +\n    // ESNext\n    'fromString,range'\n  ).split(','), j = 0, key; keys.length > j; j++) {\n    if (hasOwn(NativeNumber, key = keys[j]) && !hasOwn(NumberWrapper, key)) {\n      defineProperty(NumberWrapper, key, getOwnPropertyDescriptor(NativeNumber, key));\n    }\n  }\n  NumberWrapper.prototype = NumberPrototype;\n  NumberPrototype.constructor = NumberWrapper;\n  redefine(global, NUMBER, NumberWrapper);\n}\n",null,null,null],"names":["check","it","Math","global","globalThis","window","self","this","Function","fails","exec","error","descriptors","require$$0","Object","defineProperty","get","call","prototype","functionCall","bind","apply","arguments","$propertyIsEnumerable","propertyIsEnumerable","getOwnPropertyDescriptor","NASHORN_BUG","V","descriptor","enumerable","match","version","createPropertyDescriptor","bitmap","value","configurable","writable","FunctionPrototype","callBind","functionUncurryThis","fn","uncurryThis","toString","stringSlice","slice","classofRaw","require$$1","require$$2","classof","require$$3","split","indexedObject","TypeError","requireObjectCoercible","undefined","IndexedObject","toIndexedObject","isCallable","argument","isObject","aFunction","getBuiltIn","namespace","method","length","objectIsPrototypeOf","isPrototypeOf","userAgent","process","Deno","versions","v8","engineV8Version","V8_VERSION","nativeSymbol","getOwnPropertySymbols","symbol","Symbol","String","sham","useSymbolAsUid","iterator","USE_SYMBOL_AS_UID","require$$4","isSymbol","$Symbol","tryToString","aCallable","setGlobal","key","SHARED","sharedStore","store","sharedModule","push","mode","copyright","toObject","hasOwnProperty","hasOwnProperty_1","hasOwn","id","postfix","random","uid","shared","NATIVE_SYMBOL","require$$5","WellKnownSymbolsStore","symbolFor","createWellKnownSymbol","withoutSetter","wellKnownSymbol","name","description","getMethod","P","func","ordinaryToPrimitive","input","pref","val","valueOf","require$$6","TO_PRIMITIVE","toPrimitive","result","exoticToPrim","toPropertyKey","document","EXISTS","createElement","documentCreateElement","ie8DomDefine","a","DESCRIPTORS","propertyIsEnumerableModule","IE8_DOM_DEFINE","require$$7","$getOwnPropertyDescriptor","O","f","anObject","$defineProperty","Attributes","definePropertyModule","createNonEnumerableProperty","object","functionToString","inspectSource","set","has","WeakMap","nativeWeakMap","test","keys","sharedKey","hiddenKeys","NATIVE_WEAK_MAP","require$$8","OBJECT_ALREADY_INITIALIZED","state","wmget","wmhas","wmset","metadata","facade","STATE","internalState","enforce","getterFor","TYPE","type","getDescriptor","PROPER","CONFIGURABLE","CONFIGURABLE_FUNCTION_NAME","getInternalState","enforceInternalState","TEMPLATE","redefineModule","options","unsafe","simple","noTargetGet","replace","source","join","ceil","floor","toIntegerOrInfinity","number","max","min","toAbsoluteIndex","index","integer","toLength","lengthOfArrayLike","obj","createMethod","IS_INCLUDES","$this","el","fromIndex","arrayIncludes","includes","indexOf","objectKeysInternal","names","i","enumBugKeys","internalObjectKeys","concat","getOwnPropertyNames","getOwnPropertyNamesModule","getOwnPropertySymbolsModule","ownKeys","getOwnPropertyDescriptorModule","replacement","isForced","feature","detection","data","normalize","POLYFILL","NATIVE","string","toLowerCase","isForced_1","redefine","copyConstructorProperties","target","exceptions","_export","targetProperty","sourceProperty","TARGET","GLOBAL","STATIC","stat","forced","isArray","Array","toStringTagSupport","TO_STRING_TAG_SUPPORT","TO_STRING_TAG","CORRECT_ARGUMENTS","tag","tryGet","callee","noop","empty","construct","constructorRegExp","INCORRECT_TO_STRING","isConstructorModern","isConstructorLegacy","isConstructor","called","SPECIES","arraySpeciesConstructor","originalArray","C","constructor","arraySpeciesCreate","that","IS_MAP","IS_FILTER","IS_SOME","IS_EVERY","IS_FIND_INDEX","IS_FILTER_REJECT","NO_HOLES","callbackfn","specificCreate","boundFunction","create","arrayIteration","forEach","map","filter","some","every","find","findIndex","filterReject","arrayMethodHasSpeciesSupport","METHOD_NAME","array","foo","Boolean","$map","__rest","s","e","t","p","proto","objectToString","$filter","Cluster","markers","position","google","maps","LatLng","_position","reduce","bounds","marker","extend","getPosition","LatLngBounds","getCenter","m","getVisible","setMap","filterMarkersToPaddedViewport","mapCanvasProjection","viewportPadding","extendedMapBounds","extendBoundsToPaddedViewport","getBounds","contains","projection","pixels","latLngBoundsToPixelBounds","northEast","southWest","extendedPixelBounds","extendPixelBounds","pixelBoundsToLatLngBounds","distanceBetweenPoints","p1","p2","dLat","lat","PI","dLon","lng","sin","cos","atan2","sqrt","fromLatLngToDivPixel","getNorthEast","getSouthWest","x","y","fromDivPixelToLatLng","AbstractAlgorithm","maxZoom","AbstractViewportAlgorithm","_a","getZoom","clusters","changed","cluster","classList","DOMTokenListPrototype","domTokenListPrototype","$forEach","DOMIterables","CSSRuleList","CSSStyleDeclaration","CSSValueList","ClientRectList","DOMRectList","DOMStringList","DOMTokenList","DataTransferItemList","FileList","HTMLAllCollection","HTMLCollection","HTMLFormElement","HTMLSelectElement","MediaList","MimeTypeArray","NamedNodeMap","NodeList","PaintRequestList","Plugin","PluginArray","SVGLengthList","SVGNumberList","SVGPathSegList","SVGPointList","SVGStringList","SVGTransformList","SourceBufferList","StyleSheetList","TextTrackCueList","TextTrackList","TouchList","arrayMethodIsStrict","handlePrototype","CollectionPrototype","COLLECTION_NAME","toJSON","URL","GridAlgorithm","maxDistance","gridSize","_this2","addToClosestCluster","candidate","distance","NoopAlgorithm","earthRadius","factors","centimeters","centimetres","degrees","feet","inches","kilometers","kilometres","meters","metres","miles","millimeters","millimetres","nauticalmiles","radians","yards","point","coordinates","properties","Error","isNumber","geom","feat","bbox","geometry","featureCollection","features","fc","radiansToLength","units","factor","degreesToRadians","convertLength","originalUnit","finalUnit","lengthToRadians","num","isNaN","clone","geojson","cloneFeature","cloned","cloneFeatureCollection","cloneGeometry","cloneProperties","item","geometries","g","deepSlice","coords","coord","coordEach","callback","excludeWrapCoord","j","k","l","stopG","geometryMaybeCollection","isGeometryCollection","wrapShrink","coordIndex","isFeatureCollection","isFeature","stop","featureIndex","geomIndex","multiFeatureIndex","geometryIndex","geomType","coordAll","sum","d","mandist","v1","v2","module","multi","c","dists","prs","_i2","pr","dsum","cs","eudist","v","initial","maxit","vlen","count","idx","dist","_j","vsum","h","ks","old","conv","KmeansAlgorithm","numberOfClusters","points","round","mutate","initialCentroids","skmeansResult","skmeans","centroids","featureEach","clusterId","idxs","centroid","clustersKmeans","objectKeys","$assign","assign","b","A","B","alphabet","chr","T","argumentsLength","S","getCoord","from","to","coordinates1","coordinates2","lat1","lat2","pow","DBSCAN","dataset","epsilon","minPts","distanceFunction","_euclideanDistance","noise","_visited","_assigned","_datasetLength","_init","run","pointId","neighbors","_regionQuery","_addToCluster","_expandCluster","pointId2","neighbors2","_mergeArrays","len","q","exports","KMEANS","assignments","init","randomCentroid","change","centroidId","mean","maxDim","dim","getClusters","maxId","closestCentroid","argmin","Number","MAX_VALUE","arg","diff","PriorityQueue","elements","priorities","sorting","_queue","_priorities","_sorting","insert","ele","priority","indexToInsert","priority2","_insertAt","remove","splice","getElements","getElementPriority","getPriorities","getElementsWithPriorities","OPTICS","_reachability","_processed","_coreDistance","_orderedList","priorityQueue","_distanceToCore","_updateQueue","getReachabilityPlot","reachabilityPlot","queue","newReachableDistance","queueElements","coreDistCand","DEFAULT_INTERNAL_DBSCAN_OPTION","minPoints","DBScanAlgorithm","projectedPoint","fromLatLngToContainerPixel","grouped","dbscan","clustering","clusteredIds","clusterIds","clusterPoint","noiseId","noisePoint","clustersDbscan","sortKD","ids","nodeSize","left","right","depth","select","inc","n","z","log","exp","sd","swapItem","swap","arr","tmp","range","minX","minY","maxX","maxY","stack","axis","pop","nextAxis","within","qx","qy","r","r2","sqDist","ax","ay","bx","by","dx","dy","defaultGetX","defaultGetY","KDBush","getX","getY","ArrayType","Float64Array","IndexArrayType","Uint16Array","Uint32Array","factory","defaultOptions","minZoom","radius","extent","generateId","props","fround","Float32Array","Supercluster","trees","load","console","time","timerId","createPointCluster","timeEnd","now","Date","_cluster","zoom","minLng","minLat","maxLng","maxLat","easternHem","westernHem","tree","_limitZoom","lngX","latY","numPoints","getClusterJSON","getChildren","originId","_getOriginId","originZoom","_getOriginZoom","errorMsg","origin","children","parentId","getLeaves","limit","offset","leaves","_appendLeaves","getTile","z2","top","bottom","tile","_addTileFeatures","getClusterExpansionZoom","expansionZoom","cluster_id","skipped","child","point_count","isCluster","tags","px","py","getClusterProperties","neighborIds","numPointsOrigin","neighborId","wx","wy","clusterProperties","_map","numPoints2","createCluster","original","Infinity","yLat","abbrev","point_count_abbreviated","y2","atan","dest","src","activeXDocument","es6","equal","Map","size","entries","Set","ArrayBuffer","isView","RegExp","flags","SuperClusterAlgorithm","superCluster","SuperCluster","_this","transformCluster","leaf","objectDefineProperties","defineProperties","Properties","html","IE_PROTO","EmptyConstructor","scriptTag","content","LT","NullProtoObjectViaActiveX","write","close","temp","parentWindow","NullProtoObject","ActiveXObject","iframeDocument","iframe","domain","style","display","appendChild","contentWindow","open","F","UNSCOPABLES","ArrayPrototype","$includes","addToUnscopables","MATCH","isRegExp","$","notARegExp","correctIsRegExpLogic","regexp","error1","error2","stringIndexOf","searchString","createProperty","propertyKey","HAS_SPECIES_SUPPORT","MAX_SAFE_INTEGER","MAXIMUM_ALLOWED_LENGTH_EXCEEDED","start","deleteCount","insertCount","actualDeleteCount","actualStart","aPossiblePrototype","objectSetPrototypeOf","setPrototypeOf","setter","CORRECT_SETTER","__proto__","thisNumberValue","whitespace","ltrim","rtrim","stringTrim","end","trim","inheritIfRequired","dummy","Wrapper","NewTarget","NewTargetPrototype","require$$9","require$$10","require$$11","require$$12","require$$13","require$$14","require$$15","NUMBER","NativeNumber","NumberPrototype","arraySlice","charCodeAt","toNumeric","primValue","toNumber","first","third","radix","maxCode","digits","code","NaN","parseInt","NumberWrapper","ClusterStats","clusterMarkerCounts","clusterMarkerSum","DefaultRenderer","stats","color","svg","btoa","Marker","icon","url","scaledSize","Size","label","text","fontSize","title","zIndex","MAX_ZINDEX","MarkerClustererEvents","OverlayViewSafe","type1","type2","property","OverlayView","defaultOnClusterClickHandler","_","fitBounds","MarkerClusterer","algorithm","renderer","onClusterClick","noDraw","render","addMarker","removed","_this3","removeMarker","getMap","getProjection","event","trigger","CLUSTERING_BEGIN","calculate","reset","renderClusters","CLUSTERING_END","idleListener","addListener","removeListener","delete","_this4","CLUSTER_CLICK"],"mappings":"yzFAAIA,EAAQ,SAAUC,UACbA,GAAMA,EAAGC,MAAQA,MAAQD,GAIlCE,EAEEH,EAA2B,iBAAdI,YAA0BA,aACvCJ,EAAuB,iBAAVK,QAAsBA,SAEnCL,EAAqB,iBAARM,MAAoBA,OACjCN,EAAuB,iBAAVG,GAAsBA,IAElC,kBAAqBI,KAArB,IAAmCC,SAAS,cAATA,QCbtCC,EAAiB,SAAUC,eAEdA,IACT,MAAOC,UACA,ICDXC,GAHYC,GAGY,kBAEwD,GAAvEC,OAAOC,eAAe,GAAI,EAAG,CAAEC,IAAK,kBAAqB,KAAQ,MCLtEC,EAAOT,SAASU,UAAUD,KAE9BE,EAAiBF,EAAKG,KAAOH,EAAKG,KAAKH,GAAQ,kBACtCA,EAAKI,MAAMJ,EAAMK,iBCFtBC,EAAwB,GAAGC,qBAE3BC,EAA2BX,OAAOW,yBAGlCC,EAAcD,IAA6BF,EAAsBN,KAAK,GAAK,GAAK,OAIxES,EAAc,SAA8BC,OAClDC,EAAaH,EAAyBlB,KAAMoB,WACvCC,GAAcA,EAAWC,YAChCN,MCNAO,EAAOC,ECPXC,EAAiB,SAAUC,EAAQC,SAC1B,CACLL,aAAuB,EAATI,GACdE,eAAyB,EAATF,GAChBG,WAAqB,EAATH,GACZC,MAAOA,ICLPG,EAAoB7B,SAASU,UAC7BE,EAAOiB,EAAkBjB,KACzBH,EAAOoB,EAAkBpB,KACzBqB,EAAWlB,GAAQA,EAAKA,KAAKH,GAEjCsB,EAAiBnB,EAAO,SAAUoB,UACzBA,GAAMF,EAASrB,EAAMuB,IAC1B,SAAUA,UACLA,GAAM,kBACJvB,EAAKI,MAAMmB,EAAIlB,aCTtBmB,EAAc5B,EAEd6B,EAAWD,EAAY,GAAGC,UAC1BC,EAAcF,EAAY,GAAGG,OAEjCC,EAAiB,SAAU5C,UAClB0C,EAAYD,EAASzC,GAAK,GAAI,ICLnCwC,EAAcK,EACdrC,EAAQsC,EACRC,EAAUC,EAEVnC,EALSD,EAKOC,OAChBoC,EAAQT,EAAY,GAAGS,OAG3BC,EAAiB1C,GAAM,kBAGbK,EAAO,KAAKU,qBAAqB,MACtC,SAAUvB,SACS,UAAf+C,EAAQ/C,GAAkBiD,EAAMjD,EAAI,IAAMa,EAAOb,IACtDa,ECbAsC,EAFSvC,EAEUuC,UAIvBC,EAAiB,SAAUpD,MACfqD,MAANrD,EAAiB,MAAMmD,EAAU,wBAA0BnD,UACxDA,GCPLsD,EAAgB1C,EAChBwC,EAAyBP,EAE7BU,EAAiB,SAAUvD,UAClBsD,EAAcF,EAAuBpD,KCH9CwD,EAAiB,SAAUC,SACC,mBAAZA,GCHZD,EAAa5C,EAEjB8C,EAAiB,SAAU1D,SACL,iBAANA,EAAwB,OAAPA,EAAcwD,EAAWxD,ICHtDE,EAASU,EACT4C,EAAaX,EAEbc,EAAY,SAAUF,UACjBD,EAAWC,GAAYA,OAAWJ,GAG3CO,GAAiB,SAAUC,EAAWC,UAC7BzC,UAAU0C,OAAS,EAAIJ,EAAUzD,EAAO2D,IAAc3D,EAAO2D,IAAc3D,EAAO2D,GAAWC,ICNtGE,GAFkBpD,EAEW,GAAGqD,eVF5B/D,GAASU,EACTsD,GWDatD,GAEW,YAAa,cAAgB,GXCrDuD,GAAUjE,GAAOiE,QACjBC,GAAOlE,GAAOkE,KACdC,GAAWF,IAAWA,GAAQE,UAAYD,IAAQA,GAAKtC,QACvDwC,GAAKD,IAAYA,GAASC,GAG1BA,KAIFxC,GAHAD,EAAQyC,GAAGrB,MAAM,MAGD,GAAK,GAAKpB,EAAM,GAAK,EAAI,IAAMA,EAAM,GAAKA,EAAM,MAK7DC,GAAWoC,OACdrC,EAAQqC,GAAUrC,MAAM,iBACVA,EAAM,IAAM,MACxBA,EAAQqC,GAAUrC,MAAM,oBACbC,GAAWD,EAAM,QAIhC0C,GAAiBzC,EYzBb0C,GAAa5D,GACbJ,GAAQqC,EAGZ4B,KAAmB5D,OAAO6D,wBAA0BlE,IAAM,eACpDmE,EAASC,gBAGLC,OAAOF,MAAa9D,OAAO8D,aAAmBC,UAEnDA,OAAOE,MAAQN,IAAcA,GAAa,MCR/CO,GAFoBnE,KAGdgE,OAAOE,MACkB,iBAAnBF,OAAOI,SCJfpB,GAAaf,GACbW,GAAaV,EACbmB,GAAgBjB,GAChBiC,GAAoBC,GAEpBrE,GANSD,EAMOC,OAEpBsE,GAAiBF,GAAoB,SAAUjF,SACzB,iBAANA,GACZ,SAAUA,OACRoF,EAAUxB,GAAW,iBAClBJ,GAAW4B,IAAYnB,GAAcmB,EAAQnE,UAAWJ,GAAOb,KCVpE6E,GAFSjE,EAEOiE,OCDhBrB,GAAaX,EACbwC,GDEa,SAAU5B,cAEhBoB,GAAOpB,GACd,MAAO/C,SACA,WCJPyC,GAJSvC,EAIUuC,UAGvBmC,GAAiB,SAAU7B,MACrBD,GAAWC,GAAW,OAAOA,QAC3BN,GAAUkC,GAAY5B,GAAY,uBCTtC6B,GAAY1E,GCCZI,GAAO6B,EACPW,GAAaV,EACbY,GAAWV,EAEXG,GALSvC,EAKUuC,0BCLnBjD,GAASU,EAGTE,GAAiBD,OAAOC,eAE5ByE,GAAiB,SAAUC,EAAKvD,OAE5BnB,GAAeZ,GAAQsF,EAAK,CAAEvD,MAAOA,EAAOC,cAAc,EAAMC,UAAU,IAC1E,MAAOzB,GACPR,GAAOsF,GAAOvD,SACPA,GCTPsD,GAAY1C,GAEZ4C,GAAS,qBAGbC,GANa9E,EAIM6E,KAAWF,GAAUE,GAAQ,ICH5CE,GAAQ9C,IAEX+C,WAAiB,SAAUJ,EAAKvD,UACxB0D,GAAMH,KAASG,GAAMH,QAAiBnC,IAAVpB,EAAsBA,EAAQ,MAChE,WAAY,IAAI4D,KAAK,CACtB/D,QAAS,SACTgE,KAAyB,SACzBC,UAAW,yCCRb,IACI3C,GAAyBP,EAEzBhC,GAHSD,EAGOC,OAIpBmF,GAAiB,SAAUvC,UAClB5C,GAAOuC,GAAuBK,KCPnCuC,GAAWnD,GAEXoD,GAHcrF,EAGe,GAAGqF,gBAIpCC,GAAiBrF,OAAOsF,QAAU,SAAgBnG,EAAIwF,UAC7CS,GAAeD,GAAShG,GAAKwF,ICRlChD,GAAc5B,EAEdwF,GAAK,EACLC,GAAUpG,KAAKqG,SACf7D,GAAWD,GAAY,GAAIC,UAE/B8D,GAAiB,SAAUf,SAClB,gBAAqBnC,IAARmC,EAAoB,GAAKA,GAAO,KAAO/C,KAAW2D,GAAKC,GAAS,KCPlFnG,GAASU,EACT4F,GAAS3D,WACTsD,GAASrD,GACTyD,GAAMvD,GACNyD,GAAgBvB,GAChBD,GAAoByB,GAEpBC,GAAwBH,GAAO,OAC/B5B,GAAS1E,GAAO0E,OAChBgC,GAAYhC,IAAUA,GAAM,IAC5BiC,GAAwB5B,GAAoBL,GAASA,IAAUA,GAAOkC,eAAiBP,GAE3FQ,GAAiB,SAAUC,OACpBb,GAAOQ,GAAuBK,KAAWP,IAAuD,iBAA/BE,GAAsBK,GAAoB,KAC1GC,EAAc,UAAYD,EAC1BP,IAAiBN,GAAOvB,GAAQoC,GAClCL,GAAsBK,GAAQpC,GAAOoC,GAErCL,GAAsBK,GADb/B,IAAqB2B,GACAA,GAAUK,GAEVJ,GAAsBI,UAE/CN,GAAsBK,ICrB7BhG,GAAO6B,EACPa,GAAWZ,EACXqC,GAAWnC,GACXkE,GTAa,SAAUxF,EAAGyF,OACxBC,EAAO1F,EAAEyF,UACE,MAARC,OAAe/D,EAAYiC,GAAU8B,ISD1CC,GRIa,SAAUC,EAAOC,OAC5BhF,EAAIiF,KACK,WAATD,GAAqB/D,GAAWjB,EAAK+E,EAAM7E,YAAciB,GAAS8D,EAAMxG,GAAKuB,EAAI+E,IAAS,OAAOE,KACjGhE,GAAWjB,EAAK+E,EAAMG,WAAa/D,GAAS8D,EAAMxG,GAAKuB,EAAI+E,IAAS,OAAOE,KAClE,WAATD,GAAqB/D,GAAWjB,EAAK+E,EAAM7E,YAAciB,GAAS8D,EAAMxG,GAAKuB,EAAI+E,IAAS,OAAOE,QAC/FrE,GAAU,4CQRd4D,GAAkBW,GAElBvE,GARSvC,EAQUuC,UACnBwE,GAAeZ,GAAgB,eAInCa,GAAiB,SAAUN,EAAOC,OAC3B7D,GAAS4D,IAAUnC,GAASmC,GAAQ,OAAOA,MAE5CO,EADAC,EAAeZ,GAAUI,EAAOK,OAEhCG,EAAc,SACHzE,IAATkE,IAAoBA,EAAO,WAC/BM,EAAS7G,GAAK8G,EAAcR,EAAOC,IAC9B7D,GAASmE,IAAW1C,GAAS0C,GAAS,OAAOA,QAC5C1E,GAAU,uDAELE,IAATkE,IAAoBA,EAAO,UACxBF,GAAoBC,EAAOC,ICxBhCK,GAAchH,GACduE,GAAWtC,GAIfkF,GAAiB,SAAUtE,OACrB+B,EAAMoC,GAAYnE,EAAU,iBACzB0B,GAASK,GAAOA,EAAMA,EAAM,ICNjC9B,GAAWb,EAEXmF,GAHSpH,EAGSoH,SAElBC,GAASvE,GAASsE,KAAatE,GAASsE,GAASE,eAErDC,GAAiB,SAAUnI,UAClBiI,GAASD,GAASE,cAAclI,GAAM,ICN3CkI,GAAgBpF,GAGpBsF,IALkBxH,IACNiC,GAI4B,kBAI9B,GAFDhC,OAAOC,eAAeoH,GAAc,OAAQ,IAAK,CACtDnH,IAAK,kBAAqB,KACzBsH,KCTDC,GAAc1H,EACdI,GAAO6B,EACP0F,GAA6BzF,EAC7Bf,GAA2BiB,EAC3BO,GAAkB2B,EAClB6C,GAAgBrB,GAChBP,GAASuB,GACTc,GAAiBC,GAGjBC,GAA4B7H,OAAOW,6BAI3B8G,GAAcI,GAA4B,SAAkCC,EAAGxB,MACzFwB,EAAIpF,GAAgBoF,GACpBxB,EAAIY,GAAcZ,GACdqB,GAAgB,WACXE,GAA0BC,EAAGxB,GACpC,MAAOzG,OACLyF,GAAOwC,EAAGxB,GAAI,OAAOpF,IAA0Bf,GAAKuH,GAA2BK,EAAGD,EAAGxB,GAAIwB,EAAExB,eCpB7FjH,GAASU,EACT8C,GAAWb,EAEXgC,GAAS3E,GAAO2E,OAChB1B,GAAYjD,GAAOiD,UAGvB0F,GAAiB,SAAUpF,MACrBC,GAASD,GAAW,OAAOA,QACzBN,GAAU0B,GAAOpB,GAAY,sBCRjC6E,GAAczF,EACd2F,GAAiB1F,GACjB+F,GAAW7F,GACX+E,GAAgB7C,GAEhB/B,GANSvC,EAMUuC,UAEnB2F,GAAkBjI,OAAOC,oBAIjBwH,GAAcQ,GAAkB,SAAwBH,EAAGxB,EAAG4B,MACxEF,GAASF,GACTxB,EAAIY,GAAcZ,GAClB0B,GAASE,GACLP,GAAgB,WACXM,GAAgBH,EAAGxB,EAAG4B,GAC7B,MAAOrI,OACL,QAASqI,GAAc,QAASA,EAAY,MAAM5F,GAAU,iCAC5D,UAAW4F,IAAYJ,EAAExB,GAAK4B,EAAW9G,OACtC0G,GCrBT,IACIK,GAAuBnG,GACvBd,GAA2Be,EAE/BmG,GAJkBrI,EAIa,SAAUsI,EAAQ1D,EAAKvD,UAC7C+G,GAAqBJ,EAAEM,EAAQ1D,EAAKzD,GAAyB,EAAGE,KACrE,SAAUiH,EAAQ1D,EAAKvD,UACzBiH,EAAO1D,GAAOvD,EACPiH,mBCPL1F,GAAaX,EACb8C,GAAQ7C,GAERqG,GAJcvI,EAIiBL,SAASkC,UAGvCe,GAAWmC,GAAMyD,iBACpBzD,GAAMyD,cAAgB,SAAUpJ,UACvBmJ,GAAiBnJ,SCIxBqJ,GAAKtI,GAAKuI,GDAdF,GAAiBzD,GAAMyD,cEZnB5F,GAAaX,EACbuG,GAAgBtG,GAEhByG,GAJS3I,EAIQ2I,QAErBC,GAAiBhG,GAAW+F,KAAY,cAAcE,KAAKL,GAAcG,KCNrE/C,GAAS5F,WACT2F,GAAM1D,GAEN6G,GAAOlD,GAAO,QAElBmD,GAAiB,SAAUnE,UAClBkE,GAAKlE,KAASkE,GAAKlE,GAAOe,GAAIf,KCNvCoE,GAAiB,GHAbC,GAAkBjJ,GAClBV,GAAS2C,EACTL,GAAcM,EACdY,GAAWV,EACXiG,GAA8B/D,GAC9BiB,GAASO,GACTF,GAASkB,GACTiC,GAAYlB,GACZmB,GAAaE,GAEbC,GAA6B,6BAC7B5G,GAAYjD,GAAOiD,UACnBoG,GAAUrJ,GAAOqJ,QAgBrB,GAAIM,IAAmBrD,GAAOwD,MAAO,KAC/BrE,GAAQa,GAAOwD,QAAUxD,GAAOwD,MAAQ,IAAIT,IAC5CU,GAAQzH,GAAYmD,GAAM5E,KAC1BmJ,GAAQ1H,GAAYmD,GAAM2D,KAC1Ba,GAAQ3H,GAAYmD,GAAM0D,KAC9BA,GAAM,SAAUrJ,EAAIoK,MACdF,GAAMvE,GAAO3F,GAAK,MAAM,IAAImD,GAAU4G,WAC1CK,EAASC,OAASrK,EAClBmK,GAAMxE,GAAO3F,EAAIoK,GACVA,GAETrJ,GAAM,SAAUf,UACPiK,GAAMtE,GAAO3F,IAAO,IAE7BsJ,GAAM,SAAUtJ,UACPkK,GAAMvE,GAAO3F,QAEjB,KACDsK,GAAQX,GAAU,SACtBC,GAAWU,KAAS,EACpBjB,GAAM,SAAUrJ,EAAIoK,MACdjE,GAAOnG,EAAIsK,IAAQ,MAAM,IAAInH,GAAU4G,WAC3CK,EAASC,OAASrK,EAClBiJ,GAA4BjJ,EAAIsK,GAAOF,GAChCA,GAETrJ,GAAM,SAAUf,UACPmG,GAAOnG,EAAIsK,IAAStK,EAAGsK,IAAS,IAEzChB,GAAM,SAAUtJ,UACPmG,GAAOnG,EAAIsK,SAItBC,GAAiB,CACflB,IAAKA,GACLtI,IAAKA,GACLuI,IAAKA,GACLkB,QAnDY,SAAUxK,UACfsJ,GAAItJ,GAAMe,GAAIf,GAAMqJ,GAAIrJ,EAAI,KAmDnCyK,UAhDc,SAAUC,UACjB,SAAU1K,OACXgK,MACCtG,GAAS1D,KAAQgK,EAAQjJ,GAAIf,IAAK2K,OAASD,QACxCvH,GAAU,0BAA4BuH,EAAO,oBAC5CV,KIxBT1B,GAAc1H,EACduF,GAAStD,GAETT,GAAoB7B,SAASU,UAE7B2J,GAAgBtC,IAAezH,OAAOW,yBAEtCyG,GAAS9B,GAAO/D,GAAmB,QAEnCyI,GAAS5C,IAA0D,cAA/C,aAAsCjB,KAC1D8D,GAAe7C,MAAYK,IAAgBA,IAAesC,GAAcxI,GAAmB,QAAQF,cCVnGhC,GAASU,EACT4C,GAAaX,EACbsD,GAASrD,GACTmG,GAA8BjG,GAC9BuC,GAAYL,GACZkE,GAAgB1C,GAEhBqE,GDKa,CACf9C,OAAQA,GACR4C,OAAQA,GACRC,aAAcA,ICRuDA,aAEnEE,GAHsBtD,GAGiB3G,IACvCkK,GAJsBvD,GAIqB8C,QAC3CU,GAAWrG,OAAOA,QAAQ5B,MAAM,WAEnCkI,WAAiB,SAAUxC,EAAGnD,EAAKvD,EAAOmJ,OAKrCpB,EAJAqB,IAASD,KAAYA,EAAQC,OAC7BC,IAASF,KAAYA,EAAQxJ,WAC7B2J,IAAcH,KAAYA,EAAQG,YAClCvE,EAAOoE,QAA4B/H,IAAjB+H,EAAQpE,KAAqBoE,EAAQpE,KAAOxB,EAE9DhC,GAAWvB,KACoB,YAA7B4C,OAAOmC,GAAMrE,MAAM,EAAG,KACxBqE,EAAO,IAAMnC,OAAOmC,GAAMwE,QAAQ,qBAAsB,MAAQ,OAE7DrF,GAAOlE,EAAO,SAAY8I,IAA8B9I,EAAM+E,OAASA,IAC1EiC,GAA4BhH,EAAO,OAAQ+E,IAE7CgD,EAAQiB,GAAqBhJ,IAClBwJ,SACTzB,EAAMyB,OAASP,GAASQ,KAAoB,iBAAR1E,EAAmBA,EAAO,MAG9D2B,IAAMzI,IAIEmL,GAEAE,GAAe5C,EAAEnD,KAC3B8F,GAAS,UAFF3C,EAAEnD,GAIP8F,EAAQ3C,EAAEnD,GAAOvD,EAChBgH,GAA4BN,EAAGnD,EAAKvD,IATnCqJ,EAAQ3C,EAAEnD,GAAOvD,EAChBsD,GAAUC,EAAKvD,KAUrB1B,SAASU,UAAW,YAAY,kBAC1BuC,GAAWlD,OAAS0K,GAAiB1K,MAAMmL,QAAUrC,GAAc9I,mBC5CxEqL,GAAO1L,KAAK0L,KACZC,GAAQ3L,KAAK2L,MAIjBC,GAAiB,SAAUpI,OACrBqI,GAAUrI,SAEPqI,GAAWA,GAAqB,IAAXA,EAAe,GAAKA,EAAS,EAAIF,GAAQD,IAAMG,ICRzED,GAAsBjL,GAEtBmL,GAAM9L,KAAK8L,IACXC,GAAM/L,KAAK+L,IAKfC,GAAiB,SAAUC,EAAOnI,OAC5BoI,EAAUN,GAAoBK,UAC3BC,EAAU,EAAIJ,GAAII,EAAUpI,EAAQ,GAAKiI,GAAIG,EAASpI,ICV3D8H,GAAsBjL,GAEtBoL,GAAM/L,KAAK+L,ICFXI,GDMa,SAAU3I,UAClBA,EAAW,EAAIuI,GAAIH,GAAoBpI,GAAW,kBAAoB,GCH/E4I,GAAiB,SAAUC,UAClBF,GAASE,EAAIvI,SCLlBR,GAAkB3C,EAClBqL,GAAkBpJ,GAClBwJ,GAAoBvJ,GAGpByJ,GAAe,SAAUC,UACpB,SAAUC,EAAOC,EAAIC,OAItB1K,EAHA0G,EAAIpF,GAAgBkJ,GACpB1I,EAASsI,GAAkB1D,GAC3BuD,EAAQD,GAAgBU,EAAW5I,MAInCyI,GAAeE,GAAMA,GAAI,KAAO3I,EAASmI,OAC3CjK,EAAQ0G,EAAEuD,OAEGjK,EAAO,OAAO,OAEtB,KAAM8B,EAASmI,EAAOA,QACtBM,GAAeN,KAASvD,IAAMA,EAAEuD,KAAWQ,EAAI,OAAOF,GAAeN,GAAS,SAC3EM,IAAgB,IAI9BI,GAAiB,CAGfC,SAAUN,IAAa,GAGvBO,QAASP,IAAa,IC7BpBpG,GAAStD,GACTU,GAAkBT,EAClBgK,GAAU9J,GAAuC8J,QACjDlD,GAAa1E,GAEbW,GANcjF,EAMK,GAAGiF,MAE1BkH,GAAiB,SAAU7D,EAAQ8D,OAI7BxH,EAHAmD,EAAIpF,GAAgB2F,GACpB+D,EAAI,EACJpF,EAAS,OAERrC,KAAOmD,GAAIxC,GAAOyD,GAAYpE,IAAQW,GAAOwC,EAAGnD,IAAQK,GAAKgC,EAAQrC,QAEnEwH,EAAMjJ,OAASkJ,GAAO9G,GAAOwC,EAAGnD,EAAMwH,EAAMC,SAChDH,GAAQjF,EAAQrC,IAAQK,GAAKgC,EAAQrC,WAEjCqC,GCjBTqF,GAAiB,CACf,cACA,iBACA,gBACA,uBACA,iBACA,WACA,WCREC,GAAqBvM,GAGrBgJ,GAFc/G,GAEWuK,OAAO,SAAU,kBAKlCvM,OAAOwM,qBAAuB,SAA6B1E,UAC9DwE,GAAmBxE,EAAGiB,oBCRnB/I,OAAO6D,sBCDnB,IAAId,GAAahD,GAEb0M,GAA4BxK,GAC5ByK,GAA8BvK,GAC9B6F,GAAW3D,GAEXkI,GALcvK,EAKO,GAAGuK,QAG5BI,GAAiB5J,GAAW,UAAW,YAAc,SAAiB5D,OAChE0J,EAAO4D,GAA0B1E,EAAEC,GAAS7I,IAC5C0E,EAAwB6I,GAA4B3E,SACjDlE,EAAwB0I,GAAO1D,EAAMhF,EAAsB1E,IAAO0J,GCZvEvD,GAASvF,GACT4M,GAAU3K,GACV4K,GAAiC3K,EACjCkG,GAAuBhG,GCHvBxC,GAAQI,EACR4C,GAAaX,EAEb6K,GAAc,kBAEdC,GAAW,SAAUC,EAASC,OAC5B5L,EAAQ6L,GAAKC,GAAUH,WACpB3L,GAAS+L,IACZ/L,GAASgM,KACTzK,GAAWqK,GAAarN,GAAMqN,KAC5BA,IAGJE,GAAYJ,GAASI,UAAY,SAAUG,UACtCrJ,OAAOqJ,GAAQ1C,QAAQkC,GAAa,KAAKS,eAG9CL,GAAOH,GAASG,KAAO,GACvBG,GAASN,GAASM,OAAS,IAC3BD,GAAWL,GAASK,SAAW,IAEnCI,GAAiBT,GCrBbzN,GAASU,EACTY,GAA2BqB,EAA2D+F,EACtFK,GAA8BnG,GAC9BuL,GAAWrL,WACXuC,GAAYL,GACZoJ,GFAa,SAAUC,EAAQ9C,EAAQ+C,WACrC9E,EAAO8D,GAAQ/B,GACf3K,EAAiBkI,GAAqBJ,EACtCpH,EAA2BiM,GAA+B7E,EACrDqE,EAAI,EAAGA,EAAIvD,EAAK3F,OAAQkJ,IAAK,KAChCzH,EAAMkE,EAAKuD,GACV9G,GAAOoI,EAAQ/I,IAAUgJ,GAAcrI,GAAOqI,EAAYhJ,IAC7D1E,EAAeyN,EAAQ/I,EAAKhE,EAAyBiK,EAAQjG,MEN/DmI,GAAWjG,GAiBf+G,GAAiB,SAAUrD,EAASK,OAItB8C,EAAQ/I,EAAKkJ,EAAgBC,EAAgBhN,EAHrDiN,EAASxD,EAAQmD,OACjBM,EAASzD,EAAQlL,OACjB4O,EAAS1D,EAAQ2D,QAGnBR,EADEM,EACO3O,GACA4O,EACA5O,GAAO0O,IAAWrJ,GAAUqJ,EAAQ,KAEnC1O,GAAO0O,IAAW,IAAI3N,UAEtB,IAAKuE,KAAOiG,EAAQ,IAC9BkD,EAAiBlD,EAAOjG,GAGtBkJ,EAFEtD,EAAQG,aACV5J,EAAaH,GAAyB+M,EAAQ/I,KACf7D,EAAWM,MACpBsM,EAAO/I,IACtBmI,GAASkB,EAASrJ,EAAMoJ,GAAUE,EAAS,IAAM,KAAOtJ,EAAK4F,EAAQ4D,cAE5C3L,IAAnBqL,EAA8B,WAChCC,UAAyBD,EAAgB,SACpDJ,GAA0BK,EAAgBD,IAGxCtD,EAAQtG,MAAS4J,GAAkBA,EAAe5J,OACpDmE,GAA4B0F,EAAgB,QAAQ,GAGtDN,GAASE,EAAQ/I,EAAKmJ,EAAgBvD,KCnDtC9F,GAAYzC,GAEZ1B,GAHcP,EAAAA,EAGiBO,MCH/B4B,GAAUnC,EAKdqO,GAAiBC,MAAMD,SAAW,SAAiBxL,SACrB,SAArBV,GAAQU,ICHbgG,GAAO,GAEXA,GALsB7I,GAEc,gBAGd,QAEtBuO,GAAkC,eAAjBtK,OAAO4E,ICPpBvJ,GAASU,EACTwO,GAAwBvM,GACxBW,GAAaV,EACbF,GAAaI,EAGbqM,GAFkBnK,GAEc,eAChCrE,GAASX,GAAOW,OAGhByO,GAAuE,aAAnD1M,GAAW,kBAAqBvB,UAArB,IAUnC0B,GAAiBqM,GAAwBxM,GAAa,SAAU5C,OAC1D2I,EAAG4G,EAAK1H,cACExE,IAAPrD,EAAmB,YAAqB,OAAPA,EAAc,OAEM,iBAAhDuP,EAXD,SAAUvP,EAAIwF,cAEhBxF,EAAGwF,GACV,MAAO9E,KAQS8O,CAAO7G,EAAI9H,GAAOb,GAAKqP,KAA8BE,EAEnED,GAAoB1M,GAAW+F,GAEH,WAA3Bd,EAASjF,GAAW+F,KAAmBnF,GAAWmF,EAAE8G,QAAU,YAAc5H,GC5B/ErF,GAAc5B,EACdJ,GAAQqC,EACRW,GAAaV,EACbC,GAAUC,GAEVoG,GAAgB1C,GAEhBgJ,GAAO,aACPC,GAAQ,GACRC,GALa1K,GAKU,UAAW,aAClC2K,GAAoB,2BACpBpP,GAAO+B,GAAYqN,GAAkBpP,MACrCqP,IAAuBD,GAAkBpP,KAAKiP,IAE9CK,GAAsB,SAAuBtM,OAC1CD,GAAWC,GAAW,OAAO,aAEhCmM,GAAUF,GAAMC,GAAOlM,IAChB,EACP,MAAO/C,UACA,IAIPsP,GAAsB,SAAuBvM,OAC1CD,GAAWC,GAAW,OAAO,SAC1BV,GAAQU,QACT,oBACA,wBACA,gCAAiC,aAM/BqM,MAAyBrP,GAAKoP,GAAmBzG,GAAc3F,IACtE,MAAO/C,UACA,IAIXsP,GAAoBlL,MAAO,MAI3BmL,IAAkBL,IAAapP,IAAM,eAC/B0P,SACGH,GAAoBA,GAAoB/O,QACzC+O,GAAoBlP,UACpBkP,IAAoB,WAAcG,GAAS,MAC5CA,KACFF,GAAsBD,GCnDvB7P,GAASU,EACTqO,GAAUpM,GACVoN,GAAgBnN,GAChBY,GAAWV,EAGXmN,GAFkBjL,GAEQ,WAC1BgK,GAAQhP,GAAOgP,MCPfkB,GDWa,SAAUC,OACrBC,SACArB,GAAQoB,KACVC,EAAID,EAAcE,aAEdN,GAAcK,KAAOA,IAAMpB,IAASD,GAAQqB,EAAErP,aACzCyC,GAAS4M,IAEN,QADVA,EAAIA,EAAEH,QAFuDG,OAAIjN,SAKtDA,IAANiN,EAAkBpB,GAAQoB,GCjBrCE,GAAiB,SAAUH,EAAetM,UACjC,IAAKqM,GAAwBC,GAA7B,CAAwD,IAAXtM,EAAe,EAAIA,ICLrE5C,GPMa,SAAUoB,EAAIkO,UAC7BnL,GAAU/C,QACMc,IAAToN,EAAqBlO,EAAKpB,GAAOA,GAAKoB,EAAIkO,GAAQ,kBAChDlO,EAAGnB,MAAMqP,EAAMpP,aOPtBiC,GAAgBR,EAChBkD,GAAWhD,GACXqJ,GAAoBnH,GACpBsL,GAAqB9J,GAErBb,GANchD,EAMK,GAAGgD,MAGtB0G,GAAe,SAAU7B,OACvBgG,EAAiB,GAARhG,EACTiG,EAAoB,GAARjG,EACZkG,EAAkB,GAARlG,EACVmG,EAAmB,GAARnG,EACXoG,EAAwB,GAARpG,EAChBqG,EAA2B,GAARrG,EACnBsG,EAAmB,GAARtG,GAAaoG,SACrB,SAAUrE,EAAOwE,EAAYR,EAAMS,WAQpCjP,EAAO4F,EAPPc,EAAI3C,GAASyG,GACbpM,EAAOiD,GAAcqF,GACrBwI,EAAgBhQ,GAAK8P,EAAYR,GACjC1M,EAASsI,GAAkBhM,GAC3B6L,EAAQ,EACRkF,EAASF,GAAkBV,GAC3BjC,EAASmC,EAASU,EAAO3E,EAAO1I,GAAU4M,GAAaI,EAAmBK,EAAO3E,EAAO,QAAKpJ,EAE3FU,EAASmI,EAAOA,IAAS,IAAI8E,GAAY9E,KAAS7L,KAEtDwH,EAASsJ,EADTlP,EAAQ5B,EAAK6L,GACiBA,EAAOvD,GACjC+B,MACEgG,EAAQnC,EAAOrC,GAASrE,OACvB,GAAIA,EAAQ,OAAQ6C,QAClB,SAAU,OACV,SAAUzI,OACV,SAAUiK,OACV,EAAGrG,GAAK0I,EAAQtM,QAChB,OAAQyI,QACR,SAAU,OACV,EAAG7E,GAAK0I,EAAQtM,UAIpB6O,GAAiB,EAAIF,GAAWC,EAAWA,EAAWtC,IAIjE8C,GAAiB,CAGfC,QAAS/E,GAAa,GAGtBgF,IAAKhF,GAAa,GAGlBiF,OAAQjF,GAAa,GAGrBkF,KAAMlF,GAAa,GAGnBmF,MAAOnF,GAAa,GAGpBoF,KAAMpF,GAAa,GAGnBqF,UAAWrF,GAAa,GAGxBsF,aAActF,GAAa,ICvEzB/L,GAAQI,EAER4D,GAAa1B,GAEbqN,GAHkBtN,GAGQ,WAE9BiP,GAAiB,SAAUC,UAIlBvN,IAAc,KAAOhE,IAAM,eAC5BwR,EAAQ,UACMA,EAAMzB,YAAc,IAC1BJ,IAAW,iBACd,CAAE8B,IAAK,IAE2B,IAApCD,EAAMD,GAAaG,SAASD,QCdnCE,GAAOtP,GAAwC0O,ICsC5C,SAASa,GAAOC,EAAGC,OAClBC,EAAI,OACH,IAAIC,KAAKH,EAAOxR,OAAOI,UAAUgF,eAAejF,KAAKqR,EAAGG,IAAMF,EAAExF,QAAQ0F,GAAK,IAC9ED,EAAEC,GAAKH,EAAEG,OACJ,MAALH,GAAqD,mBAAjCxR,OAAO6D,sBACtB,CAAA,IAAIuI,EAAI,EAAb,IAAgBuF,EAAI3R,OAAO6D,sBAAsB2N,GAAIpF,EAAIuF,EAAEzO,OAAQkJ,IAC3DqF,EAAExF,QAAQ0F,EAAEvF,IAAM,GAAKpM,OAAOI,UAAUM,qBAAqBP,KAAKqR,EAAGG,EAAEvF,MACvEsF,EAAEC,EAAEvF,IAAMoF,EAAEG,EAAEvF,YAEnBsF,EDhDH3R,GASN,CAAE2N,OAAQ,QAASkE,OAAO,EAAMzD,QAPClM,GAEoB,QAKW,CAChEyO,IAAK,SAAaN,UACTkB,GAAK7R,KAAM2Q,EAAY5P,UAAU0C,OAAS,EAAI1C,UAAU,QAAKgC,MEXxE,IACIN,GAAUF,GAId6P,GAL4B9R,GAKa,GAAG6B,SAAW,iBAC9C,WAAaM,GAAQzC,MAAQ,KCPlC8O,GAAwBxO,GACxByN,GAAWxL,WACXJ,GAAWK,GAIVsM,IACHf,GAASxN,OAAOI,UAAW,WAAYwB,GAAU,CAAE4I,QAAQ,ICN7D,IACIsH,GAAU9P,GAAwC2O,OAD9C5Q,GASN,CAAE2N,OAAQ,QAASkE,OAAO,EAAMzD,QAPClM,GAEoB,WAKW,CAChE0O,OAAQ,SAAgBP,UACf0B,GAAQrS,KAAM2Q,EAAY5P,UAAU0C,OAAS,EAAI1C,UAAU,QAAKgC,UCS9DuP,gCAKGC,IAAAA,QAASC,IAAAA,wBAChBD,QAAUA,EAEXC,IACEA,aAAoBC,OAAOC,KAAKC,YAC7BC,UAAYJ,OAEZI,UAAY,IAAIH,OAAOC,KAAKC,OAAOH,kCAK9C,cAC8B,IAAxBxS,KAAKuS,QAAQ9O,QAAiBzD,KAAK4S,iBAIhC5S,KAAKuS,QAAQM,QAAO,SAACC,EAAQC,UAC3BD,EAAOE,OAAOD,EAAOE,iBAC3B,IAAIR,OAAOC,KAAKQ,aAAalT,KAAK4S,UAAW5S,KAAK4S,kCAGvD,kBACS5S,KAAK4S,WAAa5S,KAAK8S,OAAOK,+BAMvC,kBACSnT,KAAKuS,QAAQrB,QAAO,SAACkC,UAA0BA,EAAEC,gBACrD5P,2BAME,SAAKsP,QACLR,QAAQhN,KAAKwN,yBAMb,WACD/S,KAAK+S,cACFA,OAAOO,OAAO,aACZtT,KAAK+S,aAETR,QAAQ9O,OAAS,WC3Db8P,GAAgC,SAC3CtC,EACAuC,EACAjB,EACAkB,OAEMC,EAAoBC,GACxB1C,EAAI2C,YACJJ,EACAC,UAEKlB,EAAQrB,QAAO,SAAC6B,UACrBW,EAAkBG,SAASd,EAAOE,mBAOzBU,GAA+B,SAC1Cb,EACAgB,EACAC,SAEiCC,GAC/BlB,EACAgB,GAFMG,IAAAA,UAAWC,IAAAA,UAIbC,EAAsBC,GAC1B,CAAEH,UAAAA,EAAWC,UAAAA,GACbH,UAEKM,GAA0BF,EAAqBL,IAM3CQ,GAAwB,SACnCC,EACAC,OAGMC,GAASD,EAAGE,IAAMH,EAAGG,KAAO/U,KAAKgV,GAAM,IACvCC,GAASJ,EAAGK,IAAMN,EAAGM,KAAOlV,KAAKgV,GAAM,IACvC5M,EACJpI,KAAKmV,IAAIL,EAAO,GAAK9U,KAAKmV,IAAIL,EAAO,GACrC9U,KAAKoV,IAAKR,EAAGG,IAAM/U,KAAKgV,GAAM,KAC5BhV,KAAKoV,IAAKP,EAAGE,IAAM/U,KAAKgV,GAAM,KAC9BhV,KAAKmV,IAAIF,EAAO,GAChBjV,KAAKmV,IAAIF,EAAO,UARV,MASA,EAAIjV,KAAKqV,MAAMrV,KAAKsV,KAAKlN,GAAIpI,KAAKsV,KAAK,EAAIlN,MAYjDiM,GAA4B,SAChClB,EACAgB,SAEO,CACLG,UAAWH,EAAWoB,qBAAqBpC,EAAOqC,gBAClDjB,UAAWJ,EAAWoB,qBAAqBpC,EAAOsC,kBAOzChB,GAAoB,WAE/BL,OADEE,IAAAA,UAAWC,IAAAA,iBAGbD,EAAUoB,GAAKtB,EACfE,EAAUqB,GAAKvB,EAEfG,EAAUmB,GAAKtB,EACfG,EAAUoB,GAAKvB,EAER,CAAEE,UAAAA,EAAWC,UAAAA,IAMTG,GAA4B,WAEvCP,OADEG,IAAAA,UAAWC,IAAAA,UAGPpB,EAAS,IAAIL,OAAOC,KAAKQ,oBAC/BJ,EAAOE,OAAOc,EAAWyB,qBAAqBtB,IAC9CnB,EAAOE,OAAOc,EAAWyB,qBAAqBrB,IACvCpB,GCpDa0C,oCAGNC,QAAAA,aAAU,oBACjBA,QAAUA,gCAcP,gBAAOlD,IAAAA,eACRnD,GAAKmD,YAiCMmD,4CAGRC,2BAAElC,gBAAAA,aAAkB,KAAO3I,OAA3B,0CACJA,oBAHoB,KAIrB2I,gBAAkBA,uCAElB,gBACLlB,IAAAA,QACAtB,IAAAA,IACAuC,IAAAA,2BAEIvC,EAAI2E,WAAa5V,KAAKyV,QACjB,CACLI,SAAU7V,KAAKoP,KAAK,CAClBmD,QAAAA,EACAtB,IAAAA,EACAuC,oBAAAA,IAEFsC,SAAS,GAIN,CACLD,SAAU7V,KAAK+V,QAAQ,CACrBxD,QAASgB,GACPtC,EACAuC,EACAjB,EACAvS,KAAKyT,iBAEPxC,IAAAA,EACAuC,oBAAAA,YAhCgDgC,IA0C3CpG,GAAO,SAACmD,UACFA,EAAQtB,KACvB,SAAC8B,UACC,IAAIT,GAAQ,CACVE,SAAUO,EAAOE,cACjBV,QAAS,CAACQ,SC/JdiD,GAFwB1V,GAEU,QAAQ0V,UAC1CC,GAAwBD,IAAaA,GAAU/F,aAAe+F,GAAU/F,YAAYtP,UAExFuV,GAAiBD,KAA0B1V,OAAOI,eAAYoC,EAAYkT,GCLtE/V,GAAQI,ECAR6V,GAAW7V,GAAwC0Q,QCDnDpR,GAASU,EACT8V,GCCa,CACfC,YAAa,EACbC,oBAAqB,EACrBC,aAAc,EACdC,eAAgB,EAChBC,YAAa,EACbC,cAAe,EACfC,aAAc,EACdC,qBAAsB,EACtBC,SAAU,EACVC,kBAAmB,EACnBC,eAAgB,EAChBC,gBAAiB,EACjBC,kBAAmB,EACnBC,UAAW,EACXC,cAAe,EACfC,aAAc,EACdC,SAAU,EACVC,iBAAkB,EAClBC,OAAQ,EACRC,YAAa,EACbC,cAAe,EACfC,cAAe,EACfC,eAAgB,EAChBC,aAAc,EACdC,cAAe,EACfC,iBAAkB,EAClBC,iBAAkB,EAClBC,eAAgB,EAChBC,iBAAkB,EAClBC,cAAe,EACfC,UAAW,GD/BTlC,GAAwBzT,GACxBwO,GFAa,SAAUS,EAAatO,OAClCK,EAAS,GAAGiO,WACPjO,GAAUtD,IAAM,WAEvBsD,EAAO9C,KAAK,KAAMyC,GAAY,iBAAoB,GAAM,MCHxCiV,CAAoB,WAOpC,GAAGpH,QAH2B,SAAiBL,UAC1CwF,GAASnW,KAAM2Q,EAAY5P,UAAU0C,OAAS,EAAI1C,UAAU,QAAKgC,ICLtE4F,GAA8B/D,GAE9ByT,GAAkB,SAAUC,MAE1BA,GAAuBA,EAAoBtH,UAAYA,GAAS,IAClErI,GAA4B2P,EAAqB,UAAWtH,IAC5D,MAAO5Q,GACPkY,EAAoBtH,QAAUA,KAIlC,IAAK,IAAIuH,MAAmBnC,GACtBA,GAAamC,KACfF,GAAgBzY,GAAO2Y,KAAoB3Y,GAAO2Y,IAAiB5X,WAIvE0X,GAAgBpC,IEpBhB,IACIvV,GAAO6B,EADHjC,GAKN,CAAE2N,OAAQ,MAAOkE,OAAO,EAAM7Q,YAAY,GAAQ,CAClDkX,OAAQ,kBACC9X,GAAK+X,IAAI9X,UAAUwB,SAAUnC,aCiC3B0Y,4CAKC/C,2BAAEgD,YAAAA,aAAc,UAAOC,SAAAA,aAAW,KAAO9N,OAAzC,iDACJA,aAHwB,KAKzB6N,YAAcA,IACdC,SAAWA,qCAGR,uBACRrG,IAAAA,QACAtB,IAAAA,IACAuC,IAAAA,gCAEKqC,SAAW,GAChBtD,EAAQvB,SAAQ,SAAC+B,GACf8F,EAAKC,oBAAoB/F,EAAQ9B,EAAKuC,MAGjCxT,KAAK6V,4CAGJ,SACR9C,EACA9B,EACA6C,WAEI6E,EAAc3Y,KAAK2Y,YACnB5C,EAAmB,KAEdpJ,EAAI,EAAGA,EAAI3M,KAAK6V,SAASpS,OAAQkJ,IAAK,KACvCoM,EAAY/Y,KAAK6V,SAASlJ,GAC1BqM,EAAW1E,GACfyE,EAAUjG,OAAOK,YAAYqF,SAC7BzF,EAAOE,cAAcuF,UAGnBQ,EAAWL,IACbA,EAAcK,EACdjD,EAAUgD,MAKZhD,GACApC,GACEoC,EAAQjD,OACRgB,EACA9T,KAAK4Y,UACL/E,SAASd,EAAOE,eAElB8C,EAAQxQ,KAAKwN,OACR,KACCgD,EAAU,IAAIzD,GAAQ,CAAEC,QAAS,CAACQ,UACnC8C,SAAStQ,KAAKwQ,WAzDUL,ICbtBuD,4CACCtD,iBAAK7K,OAAL,uBACJA,sCAED,gBACLyH,IAAAA,QACAtB,IAAAA,IACAuC,IAAAA,0BAEO,CACLqC,SAAU7V,KAAK+V,QAAQ,CAAExD,QAAAA,EAAStB,IAAAA,EAAKuC,oBAAAA,IACvCsC,SAAS,0BAIH,SAAQ9O,UACThH,KAAKoP,KAAKpI,UAhBcwO,ICnBxB0D,GAAc,UAOdC,GAAU,CACjBC,YAAaF,UACbG,YAAaH,UACbI,QAASJ,kBACTK,KAAML,gBACNM,OAAsB,MAAdN,GACRO,WAAYP,UACZQ,WAAYR,UACZS,OAAQT,GACRU,OAAQV,GACRW,MAAOX,kBACPY,YAAaZ,WACba,YAAab,WACbc,cAAed,GAAc,KAC7Be,QAAS,EACTC,MAAOhB,mBAiIJ,SAASiB,GAAMC,EAAaC,EAAYvP,WAC3B,IAAZA,IAAsBA,EAAU,KAC/BsP,QACK,IAAIE,MAAM,+BAEf1L,MAAMD,QAAQyL,SACT,IAAIE,MAAM,mCAEhBF,EAAY3W,OAAS,QACf,IAAI6W,MAAM,mDAEfC,GAASH,EAAY,MAAQG,GAASH,EAAY,UAC7C,IAAIE,MAAM,2CA1EjB,SAAiBE,EAAMH,EAAYvP,QACtB,IAAZA,IAAsBA,EAAU,QAChC2P,EAAO,CAAEpQ,KAAM,kBACA,IAAfS,EAAQhF,IAAYgF,EAAQhF,MAC5B2U,EAAK3U,GAAKgF,EAAQhF,IAElBgF,EAAQ4P,OACRD,EAAKC,KAAO5P,EAAQ4P,MAExBD,EAAKJ,WAAaA,GAAc,GAChCI,EAAKE,SAAWH,EACTC,EAqEAnN,CAJI,CACPjD,KAAM,QACN+P,YAAaA,GAEIC,EAAYvP,GAkK9B,SAAS8P,GAAkBC,EAAU/P,QACxB,IAAZA,IAAsBA,EAAU,QAChCgQ,EAAK,CAAEzQ,KAAM,4BACbS,EAAQhF,KACRgV,EAAGhV,GAAKgF,EAAQhF,IAEhBgF,EAAQ4P,OACRI,EAAGJ,KAAO5P,EAAQ4P,MAEtBI,EAAGD,SAAWA,EACPC,EAuIJ,SAASC,GAAgBd,EAASe,QACvB,IAAVA,IAAoBA,EAAQ,kBAC5BC,EAAS9B,GAAQ6B,OAChBC,QACK,IAAIX,MAAMU,EAAQ,4BAErBf,EAAUgB,EAkEd,SAASC,GAAiB5B,UACfA,EAAU,IACN3Z,KAAKgV,GAAM,IAW1B,SAASwG,GAAc1X,EAAQ2X,EAAcC,WAC3B,IAAjBD,IAA2BA,EAAe,mBAC5B,IAAdC,IAAwBA,EAAY,gBAClC5X,GAAU,SACN,IAAI6W,MAAM,2CAEbS,GAzEJ,SAAyB/B,EAAUgC,QACxB,IAAVA,IAAoBA,EAAQ,kBAC5BC,EAAS9B,GAAQ6B,OAChBC,QACK,IAAIX,MAAMU,EAAQ,4BAErBhC,EAAWiC,EAmEKK,CAAgB7X,EAAQ2X,GAAeC,GAqC3D,SAASd,GAASgB,UACbC,MAAMD,IAAgB,OAARA,IAAiB3M,MAAMD,QAAQ4M,GC1lBzD,SAASE,GAAMC,OACNA,QACK,IAAIpB,MAAM,8BAEZoB,EAAQrR,UACP,iBACMsR,GAAaD,OACnB,2BAkFb,SAAgCA,OACxBE,EAAS,CAAEvR,KAAM,4BAErB9J,OAAO6I,KAAKsS,GAAS1K,SAAQ,SAAU9L,UAC3BA,OACC,WACA,0BAGD0W,EAAO1W,GAAOwW,EAAQxW,OAIlC0W,EAAOf,SAAWa,EAAQb,SAAS5J,KAAI,SAAU3D,UACtCqO,GAAarO,MAEjBsO,EAjGQC,CAAuBH,OAC7B,YACA,iBACA,cACA,iBACA,sBACA,mBACA,4BACMI,GAAcJ,iBAEf,IAAIpB,MAAM,yBAU5B,SAASqB,GAAaD,OACdE,EAAS,CAAEvR,KAAM,kBAErB9J,OAAO6I,KAAKsS,GAAS1K,SAAQ,SAAU9L,UAC3BA,OACC,WACA,iBACA,0BAGD0W,EAAO1W,GAAOwW,EAAQxW,OAIlC0W,EAAOvB,WAAa0B,GAAgBL,EAAQrB,YAC5CuB,EAAOjB,SAAWmB,GAAcJ,EAAQf,UACjCiB,EASX,SAASG,GAAgB1B,OACjBuB,EAAS,UACRvB,GAGL9Z,OAAO6I,KAAKiR,GAAYrJ,SAAQ,SAAU9L,OAClCvD,EAAQ0Y,EAAWnV,GACF,iBAAVvD,EACO,OAAVA,EAEAia,EAAO1W,GAAO,KAET0J,MAAMD,QAAQhN,GAEnBia,EAAO1W,GAAOvD,EAAMsP,KAAI,SAAU+K,UACvBA,KAKXJ,EAAO1W,GAAO6W,GAAgBpa,GAIlCia,EAAO1W,GAAOvD,KAGfia,GAxBIA,EA0Df,SAASE,GAAcnB,OACfH,EAAO,CAAEnQ,KAAMsQ,EAAStQ,aACxBsQ,EAASD,OACTF,EAAKE,KAAOC,EAASD,MAEH,uBAAlBC,EAAStQ,MACTmQ,EAAKyB,WAAatB,EAASsB,WAAWhL,KAAI,SAAUiL,UACzCJ,GAAcI,MAElB1B,IAEXA,EAAKJ,YAAc+B,GAAUxB,EAASP,aAC/BI,GASX,SAAS2B,GAAUC,OACXR,EAASQ,QACY,iBAAdR,EAAO,GACPA,EAAOvZ,QAEXuZ,EAAO3K,KAAI,SAAUoL,UACjBF,GAAUE,MCtHzB,SAASC,GAAUZ,EAASa,EAAUC,MAEpB,OAAZd,UACAe,EACFC,EACAC,EACAhC,EACAiC,EACAR,EACAS,EAGAC,EAFAC,EAAa,EACbC,EAAa,EAEb3S,EAAOqR,EAAQrR,KACf4S,EAA+B,sBAAT5S,EACtB6S,EAAqB,YAAT7S,EACZ8S,EAAOF,EAAsBvB,EAAQb,SAASpX,OAAS,EAchD2Z,EAAe,EAAGA,EAAeD,EAAMC,IAAgB,CAS9DR,GAHAE,KALAD,EAA0BI,EACtBvB,EAAQb,SAASuC,GAAczC,SAC/BuC,EACAxB,EAAQf,SACRe,IAEiC,uBAAjCmB,EAAwBxS,MAGxBwS,EAAwBZ,WAAWxY,OACnC,MAEC,IAAI4Z,EAAY,EAAGA,EAAYT,EAAOS,IAAa,KAClDC,EAAoB,EACpBC,EAAgB,KAMH,QALjB5C,EAAWmC,EACPD,EAAwBZ,WAAWoB,GACnCR,IAIJT,EAASzB,EAASP,gBACdoD,EAAW7C,EAAStQ,YAExB0S,GACEP,GACc,YAAbgB,GAAuC,iBAAbA,EAEvB,EADA,EAGEA,QACD,eAEA,YAQK,IANNjB,EACEH,EACAY,EACAI,EACAE,EACAC,GAGF,OAAO,EACTP,IACAM,cAEG,iBACA,iBACEb,EAAI,EAAGA,EAAIL,EAAO3Y,OAAQgZ,IAAK,KAQ1B,IANNF,EACEH,EAAOK,GACPO,EACAI,EACAE,EACAC,GAGF,OAAO,EACTP,IACiB,eAAbQ,GAA2BF,IAEhB,eAAbE,GAA2BF,cAE5B,cACA,sBACEb,EAAI,EAAGA,EAAIL,EAAO3Y,OAAQgZ,IAAK,KAC7BC,EAAI,EAAGA,EAAIN,EAAOK,GAAGhZ,OAASsZ,EAAYL,IAAK,KAQ1C,IANNH,EACEH,EAAOK,GAAGC,GACVM,EACAI,EACAE,EACAC,GAGF,OAAO,EACTP,IAEe,oBAAbQ,GAAgCF,IACnB,YAAbE,GAAwBD,IAEb,YAAbC,GAAwBF,cAEzB,mBACEb,EAAI,EAAGA,EAAIL,EAAO3Y,OAAQgZ,IAAK,KAClCc,EAAgB,EACXb,EAAI,EAAGA,EAAIN,EAAOK,GAAGhZ,OAAQiZ,IAAK,KAChCC,EAAI,EAAGA,EAAIP,EAAOK,GAAGC,GAAGjZ,OAASsZ,EAAYJ,IAAK,KAQ7C,IANNJ,EACEH,EAAOK,GAAGC,GAAGC,GACbK,EACAI,EACAE,EACAC,GAGF,OAAO,EACTP,IAEFO,IAEFD,cAGC,yBACEb,EAAI,EAAGA,EAAI9B,EAASsB,WAAWxY,OAAQgZ,IAC1C,IAEE,IADAH,GAAU3B,EAASsB,WAAWQ,GAAIF,EAAUC,GAG5C,OAAO,sBAGL,IAAIlC,MAAM,6BA2R1B,SAASmD,GAAS/B,OACZU,EAAS,UACbE,GAAUZ,GAAS,SAAUW,GAC3BD,EAAO7W,KAAK8W,MAEPD,+FC7cPsB,GAAAC,EAAAA,2BAMAC,QAAA,SAAAC,EAAAC,EAAA7I,sBAEAyI,EAAA,qICjBFK,aAAAA,uEAQaC,EAAAA,0SA0BXA,GAAAC,EAAA7S,KAAA,wIAgBC8S,KAAAxS,kDAUAyS,EAAAA,GAAS,CAAAxR,EAAAyR,IAAA5Q,EAAA4Q,GAAAC,GAAAH,EAAAE,GAAAE,EAAAC,GAAA,8LCxDZC,kDAWAC,EAAAA,GAAA,8CAEC,SAAAjR,EAAAkP,EAAAgC,EAAAC,SACA,GAAuBC,EAAvB,KAAA,GACIC,YAEJF,sEAoBG,QAAAD,+CApBHI,EAUQJ,KAAAA,MAAS/e,4JA2Bf+L,EAAAqT,qDAYArB,EAAAsB,QAAAJ,IAAAlB,EAAAsB,IAAA,sBAKGC,IAAOvB,EAAAA,+DAUFjB,YACPwC,QAAAC,MAAA,oJA8BAC,IAAAA,IAAQzB,2BAKL0B,MAAAA,kFAUCC,KAAA3f,GAAA,4BAQRqe,EAAAA,2BCtGauB,4CAKC3J,uBAAE4J,IAAAA,iBAAqBzU,OAAvB,2CACJA,IACDyU,iBAAmBA,qCAGhB,gBAAUhN,IAAAA,QAAStB,IAAAA,IACrB4E,EAAsB,UAEL,IAAnBtD,EAAQ9O,QC3BhB,SAAwB+b,EAAQ1U,QACZ,IAAZA,IAAsBA,EAAU,QAEhC+T,EAAQW,EAAO3E,SAASpX,OAC5BqH,EAAQyU,iBACJzU,EAAQyU,kBAAoB5f,KAAK8f,MAAM9f,KAAKsV,KAAK4J,EAAQ,IAGzD/T,EAAQyU,iBAAmBV,IAC3B/T,EAAQyU,iBAAmBV,IAER,IAAnB/T,EAAQ4U,SACRF,EAAS/D,GAAM+D,QAEfhS,EAAOiQ,GAAS+B,GAEhBG,EAAmBnS,EAAKnL,MAAM,EAAGyI,EAAQyU,kBAEzCK,EAAgBC,GAAQrS,EAAM1C,EAAQyU,iBAAkBI,GAExDG,EAAY,UAChBF,EAAcE,UAAU9O,SAAQ,SAAUqL,EAAOyC,GAC7CgB,EAAUhB,GAAOzC,KLuVzB,SAAqBX,EAASa,MACP,YAAjBb,EAAQrR,KACVkS,EAASb,EAAS,QACb,GAAqB,sBAAjBA,EAAQrR,SACZ,IAAIsC,EAAI,EAAGA,EAAI+O,EAAQb,SAASpX,SACM,IAArC8Y,EAASb,EAAQb,SAASlO,GAAIA,GADSA,MKxV7CoT,CAAYP,GAAQ,SAAUrF,EAAOvO,OAC7BoU,EAAYJ,EAAcK,KAAKrU,GACnCuO,EAAME,WAAWtE,QAAUiK,EAC3B7F,EAAME,WAAW6F,SAAWJ,EAAUE,MAEnCR,EDaPW,CAbevF,GACbrI,EAAQtB,KAAI,SAAC8B,UACJoH,GAAM,CAACpH,EAAOE,cAAc4B,MAAO9B,EAAOE,cAAcyB,YAW5C,CAAE6K,iBALrBvf,KAAKuf,4BAA4Btf,SAChBD,KAAKuf,iBAAiBhN,EAAQ9O,OAAQwN,EAAI2E,WAE1C5V,KAAKuf,mBAEmB1E,SAAS7J,SACpD,SAACmJ,EAAOxN,GACDkJ,EAASsE,EAAME,WAAWtE,WAC7BF,EAASsE,EAAME,WAAWtE,SAAW,IAAIzD,GAAQ,CAC/CE,SAAU,CACRqC,IAAKsF,EAAME,WAAW6F,SAAS,GAC/BxL,IAAKyF,EAAME,WAAW6F,SAAS,IAEjC3N,QAAS,MAIbsD,EAASsE,EAAME,WAAWtE,SAASxQ,KAAKgN,EAAQ5F,OA3B3CkJ,SAdwBH,IEtCjC7I,GAAqBvM,GACrBsM,GAAcrK,GAKlB6d,GAAiB7f,OAAO6I,MAAQ,SAAcf,UACrCwE,GAAmBxE,EAAGuE,KCN3B5E,GAAc1H,EACd4B,GAAcK,EACd7B,GAAO8B,EACPtC,GAAQwC,EACR0d,GAAaxb,GACbqI,GAA8B7G,GAC9B6B,GAA6Bb,EAC7B1B,GAAWyC,GACXnF,GAAgBwG,EAGhB6W,GAAU9f,OAAO+f,OAEjB9f,GAAiBD,OAAOC,eACxBsM,GAAS5K,GAAY,GAAG4K,QCdxBwT,IDkBcD,IAAWngB,IAAM,cAE7B8H,IAQiB,IARFqY,GAAQ,CAAEE,EAAG,GAAKF,GAAQ7f,GAAe,GAAI,IAAK,CACnEc,YAAY,EACZb,IAAK,WACHD,GAAeR,KAAM,IAAK,CACxB2B,MAAO,EACPL,YAAY,OAGd,CAAEif,EAAG,KAAMA,EAAS,OAAO,MAE3BC,EAAI,GACJC,EAAI,GAEJpc,EAASC,SACToc,EAAW,8BACfF,EAAEnc,GAAU,EACZqc,EAAS/d,MAAM,IAAIqO,SAAQ,SAAU2P,GAAOF,EAAEE,GAAOA,KACpB,GAA1BN,GAAQ,GAAIG,GAAGnc,IAAgB+b,GAAWC,GAAQ,GAAII,IAAIrV,KAAK,KAAOsV,KAC1E,SAAgBzS,EAAQ9C,WACvByV,EAAIlb,GAASuI,GACb4S,EAAkB9f,UAAU0C,OAC5BmI,EAAQ,EACRxH,EAAwB6I,GAA4B3E,EACpDrH,EAAuBgH,GAA2BK,EAC/CuY,EAAkBjV,WAKnB1G,EAJA4b,EAAI9d,GAAcjC,UAAU6K,MAC5BxC,EAAOhF,EAAwB0I,GAAOsT,GAAWU,GAAI1c,EAAsB0c,IAAMV,GAAWU,GAC5Frd,EAAS2F,EAAK3F,OACdgZ,EAAI,EAEDhZ,EAASgZ,GACdvX,EAAMkE,EAAKqT,KACNzU,KAAetH,GAAKO,EAAsB6f,EAAG5b,KAAM0b,EAAE1b,GAAO4b,EAAE5b,WAE9D0b,GACPP,GE3CG,SAASU,GAAS1E,OAChBA,QACK,IAAI/B,MAAM,yBAEf1L,MAAMD,QAAQ0N,GAAQ,IACJ,YAAfA,EAAMhS,MACa,OAAnBgS,EAAM1B,UACkB,UAAxB0B,EAAM1B,SAAStQ,YACRgS,EAAM1B,SAASP,eAEP,UAAfiC,EAAMhS,YACCgS,EAAMjC,eAGjBxL,MAAMD,QAAQ0N,IACdA,EAAM5Y,QAAU,IACfmL,MAAMD,QAAQ0N,EAAM,MACpBzN,MAAMD,QAAQ0N,EAAM,WACdA,QAEL,IAAI/B,MAAM,sDCPpB,SAAStB,GAASgI,EAAMC,EAAInW,QACR,IAAZA,IAAsBA,EAAU,QAChCoW,EAAeH,GAASC,GACxBG,EAAeJ,GAASE,GACxBxM,EAAOyG,GAAiBiG,EAAa,GAAKD,EAAa,IACvDtM,EAAOsG,GAAiBiG,EAAa,GAAKD,EAAa,IACvDE,EAAOlG,GAAiBgG,EAAa,IACrCG,EAAOnG,GAAiBiG,EAAa,IACrCpZ,EAAIpI,KAAK2hB,IAAI3hB,KAAKmV,IAAIL,EAAO,GAAI,GACjC9U,KAAK2hB,IAAI3hB,KAAKmV,IAAIF,EAAO,GAAI,GAAKjV,KAAKoV,IAAIqM,GAAQzhB,KAAKoV,IAAIsM,UACzDtG,GAAgB,EAAIpb,KAAKqV,MAAMrV,KAAKsV,KAAKlN,GAAIpI,KAAKsV,KAAK,EAAIlN,IAAK+C,EAAQkQ,OFpC3E1a,GAMN,CAAE2N,OAAQ,SAAUQ,MAAM,EAAMC,OAAQnO,OAAO+f,SAAWA,IAAU,CACpEA,OAAQA,+DGUDiB,EAAOC,EAASC,EAASC,EAAQC,QAEnCH,QAAU,QAEVC,QAAU,OAEVC,OAAS,OAET1I,SAAWhZ,KAAK4hB,wBAEhB/L,SAAW,QAEXgM,MAAQ,QAKRC,SAAW,QAEXC,UAAY,QAEZC,eAAiB,OAEjBC,MAAMT,EAASC,EAASC,EAAQC,GAgBvCJ,EAAO5gB,UAAUuhB,IAAM,SAASV,EAASC,EAASC,EAAQC,QACnDM,MAAMT,EAASC,EAASC,EAAQC,OAEhC,IAAIQ,EAAU,EAAGA,EAAUniB,KAAKgiB,eAAgBG,OAEpB,IAA3BniB,KAAK8hB,SAASK,GAAgB,MAC3BL,SAASK,GAAW,MAGrBC,EAAYpiB,KAAKqiB,aAAaF,MAE9BC,EAAU3e,OAASzD,KAAK0hB,YACrBG,MAAMtc,KAAK4c,OACX,KAEDnC,EAAYhgB,KAAK6V,SAASpS,YACzBoS,SAAStQ,KAAK,SACd+c,cAAcH,EAASnC,QAEvBuC,eAAevC,EAAWoC,WAK9BpiB,KAAK6V,UAgBd0L,EAAO5gB,UAAUshB,MAAQ,SAAST,EAASC,EAASC,EAAQ1I,MAEtDwI,EAAS,MAELA,aAAmB5S,aACjB0L,MAAM,yCACHkH,EAAU,eAGhBA,QAAUA,OACV3L,SAAW,QACXgM,MAAQ,QAERG,eAAiBR,EAAQ/d,YACzBqe,SAAW,IAAIlT,MAAM5O,KAAKgiB,qBAC1BD,UAAY,IAAInT,MAAM5O,KAAKgiB,gBAG9BP,SACGA,QAAUA,GAGbC,SACGA,OAASA,GAGZ1I,SACGA,SAAWA,IAYpBuI,EAAO5gB,UAAU4hB,eAAiB,SAASvC,EAAWoC,OAM/C,IAAIzV,EAAI,EAAGA,EAAIyV,EAAU3e,OAAQkJ,IAAK,KACrC6V,EAAWJ,EAAUzV,MAEO,IAA5B3M,KAAK8hB,SAASU,GAAiB,MAC5BV,SAASU,GAAY,MACtBC,EAAaziB,KAAKqiB,aAAaG,GAE/BC,EAAWhf,QAAUzD,KAAK0hB,SAC5BU,EAAYpiB,KAAK0iB,aAAaN,EAAWK,IAKZ,IAA7BziB,KAAK+hB,UAAUS,SACZF,cAAcE,EAAUxC,KAWnCuB,EAAO5gB,UAAU2hB,cAAgB,SAASH,EAASnC,QAC5CnK,SAASmK,GAAWza,KAAK4c,QACzBJ,UAAUI,GAAW,GAW5BZ,EAAO5gB,UAAU0hB,aAAe,SAASF,WACnCC,EAAY,GAEPtc,EAAK,EAAGA,EAAK9F,KAAKgiB,eAAgBlc,IAAM,CACpC9F,KAAKgZ,SAAShZ,KAAKwhB,QAAQW,GAAUniB,KAAKwhB,QAAQ1b,IAClD9F,KAAKyhB,SACdW,EAAU7c,KAAKO,UAIZsc,GAYTb,EAAO5gB,UAAU+hB,aAAe,SAAS3a,EAAGwY,WACtCoC,EAAMpC,EAAE9c,OAEHkJ,EAAI,EAAGA,EAAIgW,EAAKhW,IAAK,KACxB9F,EAAI0Z,EAAE5T,GACN5E,EAAEyE,QAAQ3F,GAAK,GACjBkB,EAAExC,KAAKsB,UAIJkB,GAWTwZ,EAAO5gB,UAAUihB,mBAAqB,SAAS1P,EAAG0Q,WAC5ClF,EAAM,EACN/Q,EAAIhN,KAAK+L,IAAIwG,EAAEzO,OAAQmf,EAAEnf,QAEtBkJ,KACL+Q,IAAQxL,EAAEvF,GAAKiW,EAAEjW,KAAOuF,EAAEvF,GAAKiW,EAAEjW,WAG5BhN,KAAKsV,KAAKyI,IAGkBK,EAAO8E,UAC1C9E,UAAiBwD,kDC1NTuB,EAAOtB,EAAS9E,EAAG1D,QACtB0D,EAAI,OACJ8E,QAAU,QACVuB,YAAc,QACdjD,UAAY,QAEZkD,KAAKxB,EAAS9E,EAAG1D,GAMxB8J,EAAOniB,UAAUqiB,KAAO,SAASxB,EAAS9E,EAAG1D,QACtC+J,YAAc,QACdjD,UAAY,QAEM,IAAZ0B,SACJA,QAAUA,QAGA,IAAN9E,SACJA,EAAIA,QAGa,IAAb1D,SACJA,SAAWA,IAOpB8J,EAAOniB,UAAUuhB,IAAM,SAASV,EAAS9E,QAClCsG,KAAKxB,EAAS9E,WAEfiG,EAAM3iB,KAAKwhB,QAAQ/d,OAGdkJ,EAAI,EAAGA,EAAI3M,KAAK0c,EAAG/P,SACrBmT,UAAUnT,GAAK3M,KAAKijB,yBAGvBC,GAAS,EACPA,GAAQ,CAGZA,EAASljB,KAAKsgB,aAGT,IAAI6C,EAAa,EAAGA,EAAanjB,KAAK0c,EAAGyG,IAAc,SACtDC,EAAO,IAAIxU,MAAMyU,GACjBxE,EAAQ,EAGHyE,EAAM,EAAGA,EAAMD,EAAQC,IAC9BF,EAAKE,GAAO,MAGT,IAAI7G,EAAI,EAAGA,EAAIkG,EAAKlG,IAAK,KACxB4G,EAASrjB,KAAKwhB,QAAQ/E,GAAGhZ,UAGzB0f,IAAenjB,KAAK+iB,YAAYtG,GAAI,KAC7B6G,EAAM,EAAGA,EAAMD,EAAQC,IAC9BF,EAAKE,IAAQtjB,KAAKwhB,QAAQ/E,GAAG6G,GAE/BzE,QAIAA,EAAQ,EAAG,KAEJyE,EAAM,EAAGA,EAAMD,EAAQC,IAC9BF,EAAKE,IAAQzE,OAEViB,UAAUqD,GAAcC,YAGxBtD,UAAUqD,GAAcnjB,KAAKijB,iBAClCC,GAAS,UAKRljB,KAAKujB,eAQdT,EAAOniB,UAAUsiB,eAAiB,eAE5B/C,EACApa,EAFA0d,EAAQxjB,KAAKwhB,QAAQ/d,OAAQ,KAK/BqC,EAAKnG,KAAK8f,MAAM9f,KAAKqG,SAAWwd,GAChCtD,EAAWlgB,KAAKwhB,QAAQ1b,SACjB9F,KAAK8f,UAAUtT,QAAQ0T,IAAa,UAEtCA,GAQT4C,EAAOniB,UAAU2f,OAAS,mBAGpBmD,EAFAP,GAAS,EACTP,EAAM3iB,KAAKwhB,QAAQ/d,OAGdkJ,EAAI,EAAGA,EAAIgW,EAAKhW,KACvB8W,EAAkBzjB,KAAK0jB,OAAO1jB,KAAKwhB,QAAQ7U,GAAI3M,KAAK8f,UAAW9f,KAAKgZ,YAE7ChZ,KAAK+iB,YAAYpW,UACjCoW,YAAYpW,GAAK8W,EACtBP,GAAS,UAINA,GAQTJ,EAAOniB,UAAU4iB,YAAc,mBAEzBJ,EADAtN,EAAW,IAAIjH,MAAM5O,KAAK0c,GAGrByF,EAAU,EAAGA,EAAUniB,KAAK+iB,YAAYtf,OAAQ0e,SAInB,IAAzBtM,EAHXsN,EAAanjB,KAAK+iB,YAAYZ,MAI5BtM,EAASsN,GAAc,IAGzBtN,EAASsN,GAAY5d,KAAK4c,UAGrBtM,GAWTiN,EAAOniB,UAAU+iB,OAAS,SAASvJ,EAAOpR,EAAKT,WAIzCqV,EAHAjS,EAAMiY,OAAOC,UACbC,EAAM,EACNlB,EAAM5Z,EAAItF,OAGLkJ,EAAI,EAAGA,EAAIgW,EAAKhW,KACvBgR,EAAIrV,EAAE6R,EAAOpR,EAAI4D,KACTjB,IACNA,EAAMiS,EACNkG,EAAMlX,UAIHkX,GAUTf,EAAOniB,UAAUqY,SAAW,SAAS9G,EAAG0Q,WAClClF,EAAM,EACN/Q,EAAIhN,KAAK+L,IAAIwG,EAAEzO,OAAQmf,EAAEnf,QAEtBkJ,KAAK,KACNmX,EAAO5R,EAAEvF,GAAKiW,EAAEjW,GACpB+Q,GAAOoG,EAAOA,SAGTnkB,KAAKsV,KAAKyI,IAGkBK,EAAO8E,UAC1C9E,UAAiB+E,qEC7LViB,EAAcC,EAAUC,EAAYC,QAEtCC,OAAS,QAETC,YAAc,QAEdC,SAAW,YAEXpC,MAAM+B,EAAUC,EAAYC,GAWnCH,EAAcpjB,UAAU2jB,OAAS,SAASC,EAAKC,WACzCC,EAAgBzkB,KAAKmkB,OAAO1gB,OAC5BmI,EAAQ6Y,EAEL7Y,KAAS,KACV8Y,EAAY1kB,KAAKokB,YAAYxY,GACX,SAAlB5L,KAAKqkB,SACHG,EAAWE,IACbD,EAAgB7Y,GAGd4Y,EAAWE,IACbD,EAAgB7Y,QAKjB+Y,UAAUJ,EAAKC,EAAUC,IAUhCV,EAAcpjB,UAAUikB,OAAS,SAASL,WACpC3Y,EAAQ5L,KAAKmkB,OAAO1gB,OAEjBmI,KAAS,IAEV2Y,IADOvkB,KAAKmkB,OAAOvY,GACL,MACXuY,OAAOU,OAAOjZ,EAAO,QACrBwY,YAAYS,OAAOjZ,EAAO,YAarCmY,EAAcpjB,UAAUqQ,QAAU,SAASlK,QACpCqd,OAAOnT,QAAQlK,IAOtBid,EAAcpjB,UAAUmkB,YAAc,kBAC7B9kB,KAAKmkB,QAQdJ,EAAcpjB,UAAUokB,mBAAqB,SAASnZ,UAC7C5L,KAAKokB,YAAYxY,IAO1BmY,EAAcpjB,UAAUqkB,cAAgB,kBAC/BhlB,KAAKokB,aAOdL,EAAcpjB,UAAUskB,0BAA4B,mBAC9C1d,EAAS,GAEJoF,EAAI,EAAGgQ,EAAI3c,KAAKmkB,OAAO1gB,OAAQkJ,EAAIgQ,EAAGhQ,IAC7CpF,EAAOhC,KAAK,CAACvF,KAAKmkB,OAAOxX,GAAI3M,KAAKokB,YAAYzX,YAGzCpF,GAWTwc,EAAcpjB,UAAUshB,MAAQ,SAAS+B,EAAUC,EAAYC,MAEzDF,GAAYC,EAAY,SACrBE,OAAS,QACTC,YAAc,GAEfJ,EAASvgB,SAAWwgB,EAAWxgB,aAC3B,IAAI6W,MAAM,wCAGb,IAAI3N,EAAI,EAAGA,EAAIqX,EAASvgB,OAAQkJ,SAC9B2X,OAAON,EAASrX,GAAIsX,EAAWtX,IAIpCuX,SACGG,SAAWH,IAYpBH,EAAcpjB,UAAUgkB,UAAY,SAASJ,EAAKC,EAAU5Y,GACtD5L,KAAKmkB,OAAO1gB,SAAWmI,QACpBuY,OAAO5e,KAAKgf,QACZH,YAAY7e,KAAKif,UAEjBL,OAAOU,OAAOjZ,EAAO,EAAG2Y,QACxBH,YAAYS,OAAOjZ,EAAO,EAAG4Y,KAIDzG,EAAO8E,UAC1C9E,UAAiBgG,uBC7KkBhG,EAAO8E,YAClCkB,EAAgBzjB,oBAoBjB4kB,EAAO1D,EAASC,EAASC,EAAQC,QAEnCF,QAAU,OAEVC,OAAS,OAET1I,SAAWhZ,KAAK4hB,wBAKhBuD,cAAgB,QAEhBC,WAAa,QAEbC,cAAgB,OAEhBC,aAAe,QAEfrD,MAAMT,EAASC,EAASC,EAAQC,GAavCuD,EAAOvkB,UAAUuhB,IAAM,SAASV,EAASC,EAASC,EAAQC,QACnDM,MAAMT,EAASC,EAASC,EAAQC,OAEhC,IAAIQ,EAAU,EAAGxF,EAAI3c,KAAKwhB,QAAQ/d,OAAQ0e,EAAUxF,EAAGwF,OACzB,IAA7BniB,KAAKolB,WAAWjD,GAAgB,MAC7BiD,WAAWjD,GAAW,OACtBtM,SAAStQ,KAAK,CAAC4c,QAChBnC,EAAYhgB,KAAK6V,SAASpS,OAAS,OAElC6hB,aAAa/f,KAAK4c,OACnBoD,EAAgB,IAAIxB,EAAc,KAAM,KAAM,OAC9C3B,EAAYpiB,KAAKqiB,aAAaF,QAGIpf,IAAlC/C,KAAKwlB,gBAAgBrD,UAClBsD,aAAatD,EAASC,EAAWmD,QACjChD,eAAevC,EAAWuF,WAK9BvlB,KAAK6V,UASdqP,EAAOvkB,UAAU+kB,oBAAsB,mBACjCC,EAAmB,GAEdhZ,EAAI,EAAGgQ,EAAI3c,KAAKslB,aAAa7hB,OAAQkJ,EAAIgQ,EAAGhQ,IAAK,KACpDwV,EAAUniB,KAAKslB,aAAa3Y,GAC5BqM,EAAWhZ,KAAKmlB,cAAchD,GAElCwD,EAAiBpgB,KAAK,CAAC4c,EAASnJ,WAG3B2M,GAgBTT,EAAOvkB,UAAUshB,MAAQ,SAAST,EAASC,EAASC,EAAQ1I,MAEtDwI,EAAS,MAELA,aAAmB5S,aACjB0L,MAAM,yCACHkH,EAAU,eAGhBA,QAAUA,OACV3L,SAAW,QACXsP,cAAgB,IAAIvW,MAAM5O,KAAKwhB,QAAQ/d,aACvC2hB,WAAa,IAAIxW,MAAM5O,KAAKwhB,QAAQ/d,aACpC4hB,cAAgB,OAChBC,aAAe,GAGlB7D,SACGA,QAAUA,GAGbC,SACGA,OAASA,GAGZ1I,SACGA,SAAWA,IAapBkM,EAAOvkB,UAAU8kB,aAAe,SAAStD,EAASC,EAAWwD,OACvD7lB,EAAOC,UAENqlB,cAAgBrlB,KAAKwlB,gBAAgBrD,GAC1CC,EAAUpR,SAAQ,SAASwR,WACSzf,IAA9BhD,EAAKqlB,WAAW5C,GAAyB,KACvCzD,EAAOhf,EAAKiZ,SAASjZ,EAAKyhB,QAAQW,GAAUpiB,EAAKyhB,QAAQgB,IACzDqD,EAAuBlmB,KAAK8L,IAAI1L,EAAKslB,cAAetG,QAEnBhc,IAAjChD,EAAKolB,cAAc3C,IACrBziB,EAAKolB,cAAc3C,GAAYqD,EAC/BD,EAAMtB,OAAO9B,EAAUqD,IAEnBA,EAAuB9lB,EAAKolB,cAAc3C,KAC5CziB,EAAKolB,cAAc3C,GAAYqD,EAC/BD,EAAMhB,OAAOpC,GACboD,EAAMtB,OAAO9B,EAAUqD,SAejCX,EAAOvkB,UAAU4hB,eAAiB,SAASvC,EAAW4F,WAChDE,EAAgBF,EAAMd,cAEjB5S,EAAI,EAAGyK,EAAImJ,EAAcriB,OAAQyO,EAAIyK,EAAGzK,IAAK,KAChDiQ,EAAU2D,EAAc5T,WACKnP,IAA7B/C,KAAKolB,WAAWjD,GAAwB,KACtCC,EAAYpiB,KAAKqiB,aAAaF,QAC7BiD,WAAWjD,GAAW,OAEtBtM,SAASmK,GAAWza,KAAK4c,QACzBmD,aAAa/f,KAAK4c,QAEepf,IAAlC/C,KAAKwlB,gBAAgBrD,UAClBsD,aAAatD,EAASC,EAAWwD,QACjCrD,eAAevC,EAAW4F,OAavCV,EAAOvkB,UAAU6kB,gBAAkB,SAASrD,WACtCxF,EAAI3c,KAAKyhB,QACJsE,EAAe,EAAGA,EAAepJ,EAAGoJ,IAAgB,IAC3C/lB,KAAKqiB,aAAaF,EAAS4D,GAC7BtiB,QAAUzD,KAAK0hB,cACpBqE,IAebb,EAAOvkB,UAAU0hB,aAAe,SAASF,EAASV,GAChDA,EAAUA,GAAWzhB,KAAKyhB,gBACtBW,EAAY,GAEPtc,EAAK,EAAG6W,EAAI3c,KAAKwhB,QAAQ/d,OAAQqC,EAAK6W,EAAG7W,IAC5C9F,KAAKgZ,SAAShZ,KAAKwhB,QAAQW,GAAUniB,KAAKwhB,QAAQ1b,IAAO2b,GAC3DW,EAAU7c,KAAKO,UAIZsc,GAcT8C,EAAOvkB,UAAUihB,mBAAqB,SAAS1P,EAAG0Q,WAC5ClF,EAAM,EACN/Q,EAAIhN,KAAK+L,IAAIwG,EAAEzO,OAAQmf,EAAEnf,QAEtBkJ,KACL+Q,IAAQxL,EAAEvF,GAAKiW,EAAEjW,KAAOuF,EAAEvF,GAAKiW,EAAEjW,WAG5BhN,KAAKsV,KAAKyI,IAGkBK,EAAO8E,UAC1C9E,UAAiBmH,gBC1QyBrC,UACxC9E,WAAiB,CACfwD,OAAQjhB,WACRwiB,OAAQvgB,WACR2iB,OAAQ1iB,WACRuhB,cAAerhB,+BC+BrB,IAAMsjB,GAAgD,CACpDhL,MAAO,aACP0E,QAAQ,EACRuG,UAAW,GAcAC,4CAGCvQ,2BACVgD,YAAAA,aAAc,UACdsN,UAAAA,aAAYD,GAA+BC,YACxCnb,OAHO,kDAKJA,IACD6N,YAAcA,IACd7N,uCACAkb,KACHC,UAAAA,uCAIM,gBACR1T,IAAAA,QACAiB,IAAAA,oBAEMgM,EAAS5E,GACbrI,EAAQtB,KAAI,SAAC8B,OACLoT,EAAiB3S,EAAoB4S,2BACzCrT,EAAOE,sBAEFkH,GAAM,CAACgM,EAAe9Q,EAAG8Q,EAAe7Q,QAI7C+Q,EAAkC,UCvD5C,SAAwB7G,EAAQ7G,EAAa7N,QAMzB,IAAZA,IAAsBA,EAAU,KAEb,IAAnBA,EAAQ4U,SACRF,EAAS/D,GAAM+D,IAEnB1U,EAAQmb,UAAYnb,EAAQmb,WAAa,MAErCK,EAAS,IAAIC,GAAWhF,OACxBiF,EAAeF,EAAOpE,IAAIzE,GAAS+B,GAASrE,GAAcxC,EAAa7N,EAAQkQ,OAAQlQ,EAAQmb,UAAWjN,IAE1GgH,GAAa,SACjBwG,EAAaxV,SAAQ,SAAUyV,GAC3BzG,IAEAyG,EAAWzV,SAAQ,SAAU8N,OACrB4H,EAAelH,EAAO3E,SAASiE,GAC9B4H,EAAarM,aACdqM,EAAarM,WAAa,IAC9BqM,EAAarM,WAAWtE,QAAUiK,EAClC0G,EAAarM,WAAWiM,OAAS,aAKzCA,EAAOzE,MAAM7Q,SAAQ,SAAU2V,OACvBC,EAAapH,EAAO3E,SAAS8L,GAC5BC,EAAWvM,aACZuM,EAAWvM,WAAa,IACxBuM,EAAWvM,WAAWtE,QACtB6Q,EAAWvM,WAAWiM,OAAS,OAE/BM,EAAWvM,WAAWiM,OAAS,WAEhC9G,EDkBPqH,CAAerH,EAAQxf,KAAK2Y,YAAa3Y,KAAK8K,SAAS+P,SAAS7J,SAC9D,SAACmJ,EAAOxN,GACD0Z,EAAQlM,EAAME,WAAWtE,WAC5BsQ,EAAQlM,EAAME,WAAWtE,SAAW,IAGtCsQ,EAAQlM,EAAME,WAAWtE,SAASxQ,KAAKgN,EAAQ5F,OAI5C0Z,EAAQpV,KAAI,SAACsB,UAAY,IAAID,GAAQ,CAAEC,QAAAA,cAzCbmD,mCErD0BqI,UAGtD,oBAEA+I,EAAOC,EAAK3K,EAAQ4K,EAAUC,EAAMC,EAAOC,QAC5CD,EAAQD,GAAQD,QAEhB5T,EAAK6T,EAAOC,GAAU,EAE1BE,EAAOL,EAAK3K,EAAQhJ,EAAG6T,EAAMC,EAAOC,EAAQ,GAE5CL,EAAOC,EAAK3K,EAAQ4K,EAAUC,EAAM7T,EAAI,EAAG+T,EAAQ,GACnDL,EAAOC,EAAK3K,EAAQ4K,EAAU5T,EAAI,EAAG8T,EAAOC,EAAQ,aAG/CC,EAAOL,EAAK3K,EAAQM,EAAGuK,EAAMC,EAAOG,QAElCH,EAAQD,GAAM,IACbC,EAAQD,EAAO,IAAK,KAChBK,EAAIJ,EAAQD,EAAO,EACnB7T,EAAIsJ,EAAIuK,EAAO,EACfM,EAAI5nB,KAAK6nB,IAAIF,GACbvV,EAAI,GAAMpS,KAAK8nB,IAAI,EAAIF,EAAI,GAC3BG,EAAK,GAAM/nB,KAAKsV,KAAKsS,EAAIxV,GAAKuV,EAAIvV,GAAKuV,IAAMlU,EAAIkU,EAAI,EAAI,GAAK,EAAI,GAGtEF,EAAOL,EAAK3K,EAAQM,EAFN/c,KAAK8L,IAAIwb,EAAMtnB,KAAK2L,MAAMoR,EAAItJ,EAAIrB,EAAIuV,EAAII,IACzC/nB,KAAK+L,IAAIwb,EAAOvnB,KAAK2L,MAAMoR,GAAK4K,EAAIlU,GAAKrB,EAAIuV,EAAII,IACtBL,OAG1CpV,EAAImK,EAAO,EAAIM,EAAI2K,GACnB1a,EAAIsa,EACJxK,EAAIyK,MAERS,EAASZ,EAAK3K,EAAQ6K,EAAMvK,GACxBN,EAAO,EAAI8K,EAAQG,GAAOpV,GAAK0V,EAASZ,EAAK3K,EAAQ6K,EAAMC,GAExDva,EAAI8P,GAAG,KACVkL,EAASZ,EAAK3K,EAAQzP,EAAG8P,GACzB9P,IACA8P,IACOL,EAAO,EAAIzP,EAAI0a,GAAOpV,GAAKtF,SAC3ByP,EAAO,EAAIK,EAAI4K,GAAOpV,GAAKwK,IAGlCL,EAAO,EAAI6K,EAAOI,KAASpV,EAAK0V,EAASZ,EAAK3K,EAAQ6K,EAAMxK,GAG5DkL,EAASZ,EAAK3K,IADdK,EACyByK,GAGzBzK,GAAKC,IAAKuK,EAAOxK,EAAI,GACrBC,GAAKD,IAAKyK,EAAQzK,EAAI,aAIzBkL,EAASZ,EAAK3K,EAAQzP,EAAG8P,GAC9BmL,EAAKb,EAAKpa,EAAG8P,GACbmL,EAAKxL,EAAQ,EAAIzP,EAAG,EAAI8P,GACxBmL,EAAKxL,EAAQ,EAAIzP,EAAI,EAAG,EAAI8P,EAAI,YAG3BmL,EAAKC,EAAKlb,EAAG8P,OACdqL,EAAMD,EAAIlb,GACdkb,EAAIlb,GAAKkb,EAAIpL,GACboL,EAAIpL,GAAKqL,WAGJC,EAAMhB,EAAK3K,EAAQ4L,EAAMC,EAAMC,EAAMC,EAAMnB,WAG5C3R,EAAGC,EAFH8S,EAAQ,CAAC,EAAGrB,EAAItjB,OAAS,EAAG,GAC5B8D,EAAS,GAGN6gB,EAAM3kB,QAAQ,KACb4kB,EAAOD,EAAME,MACbpB,EAAQkB,EAAME,MACdrB,EAAOmB,EAAME,SAEbpB,EAAQD,GAAQD,MACX,IAAIra,EAAIsa,EAAMta,GAAKua,EAAOva,IAC3B0I,EAAI+G,EAAO,EAAIzP,GACf2I,EAAI8G,EAAO,EAAIzP,EAAI,GACf0I,GAAK2S,GAAQ3S,GAAK6S,GAAQ5S,GAAK2S,GAAQ3S,GAAK6S,GAAQ5gB,EAAOhC,KAAKwhB,EAAIpa,aAK5EyG,EAAIzT,KAAK2L,OAAO2b,EAAOC,GAAS,GAEpC7R,EAAI+G,EAAO,EAAIhJ,GACfkC,EAAI8G,EAAO,EAAIhJ,EAAI,GAEfiC,GAAK2S,GAAQ3S,GAAK6S,GAAQ5S,GAAK2S,GAAQ3S,GAAK6S,GAAQ5gB,EAAOhC,KAAKwhB,EAAI3T,QAEpEmV,GAAYF,EAAO,GAAK,GAEf,IAATA,EAAaL,GAAQ3S,EAAI4S,GAAQ3S,KACjC8S,EAAM7iB,KAAK0hB,GACXmB,EAAM7iB,KAAK6N,EAAI,GACfgV,EAAM7iB,KAAKgjB,KAEF,IAATF,EAAaH,GAAQ7S,EAAI8S,GAAQ7S,KACjC8S,EAAM7iB,KAAK6N,EAAI,GACfgV,EAAM7iB,KAAK2hB,GACXkB,EAAM7iB,KAAKgjB,YAIZhhB,WAGFihB,EAAOzB,EAAK3K,EAAQqM,EAAIC,EAAIC,EAAG3B,WAChCoB,EAAQ,CAAC,EAAGrB,EAAItjB,OAAS,EAAG,GAC5B8D,EAAS,GACTqhB,EAAKD,EAAIA,EAENP,EAAM3kB,QAAQ,KACb4kB,EAAOD,EAAME,MACbpB,EAAQkB,EAAME,MACdrB,EAAOmB,EAAME,SAEbpB,EAAQD,GAAQD,MACX,IAAIra,EAAIsa,EAAMta,GAAKua,EAAOva,IACvBkc,EAAOzM,EAAO,EAAIzP,GAAIyP,EAAO,EAAIzP,EAAI,GAAI8b,EAAIC,IAAOE,GAAMrhB,EAAOhC,KAAKwhB,EAAIpa,aAKlFyG,EAAIzT,KAAK2L,OAAO2b,EAAOC,GAAS,GAEhC7R,EAAI+G,EAAO,EAAIhJ,GACfkC,EAAI8G,EAAO,EAAIhJ,EAAI,GAEnByV,EAAOxT,EAAGC,EAAGmT,EAAIC,IAAOE,GAAMrhB,EAAOhC,KAAKwhB,EAAI3T,QAE9CmV,GAAYF,EAAO,GAAK,GAEf,IAATA,EAAaI,EAAKE,GAAKtT,EAAIqT,EAAKC,GAAKrT,KACrC8S,EAAM7iB,KAAK0hB,GACXmB,EAAM7iB,KAAK6N,EAAI,GACfgV,EAAM7iB,KAAKgjB,KAEF,IAATF,EAAaI,EAAKE,GAAKtT,EAAIqT,EAAKC,GAAKrT,KACrC8S,EAAM7iB,KAAK6N,EAAI,GACfgV,EAAM7iB,KAAK2hB,GACXkB,EAAM7iB,KAAKgjB,YAIZhhB,WAGFshB,EAAOC,EAAIC,EAAIC,EAAIC,OACpBC,EAAKJ,EAAKE,EACVG,EAAKJ,EAAKE,SACPC,EAAKA,EAAKC,EAAKA,MAGtBC,EAAc,SAAUlX,UAAYA,EAAE,IACtCmX,EAAc,SAAUnX,UAAYA,EAAE,IAEtCoX,EAAS,SAAgB9J,EAAQ+J,EAAMC,EAAMxC,EAAUyC,QACzC,IAATF,IAAkBA,EAAOH,QAChB,IAATI,IAAkBA,EAAOH,QACZ,IAAbrC,IAAsBA,EAAW,SACnB,IAAdyC,IAAuBA,EAAYC,mBAEnC1C,SAAWA,OACXxH,OAASA,UAEVmK,EAAiBnK,EAAO/b,OAAS,MAAQmmB,YAAcC,YAEvD9C,EAAM/mB,KAAK+mB,IAAM,IAAI4C,EAAenK,EAAO/b,QAC3C2Y,EAASpc,KAAKoc,OAAS,IAAIqN,EAA0B,EAAhBjK,EAAO/b,QAEvCkJ,EAAI,EAAGA,EAAI6S,EAAO/b,OAAQkJ,IAC/Boa,EAAIpa,GAAKA,EACTyP,EAAO,EAAIzP,GAAK4c,EAAK/J,EAAO7S,IAC5ByP,EAAO,EAAIzP,EAAI,GAAK6c,EAAKhK,EAAO7S,IAGpCma,EAAOC,EAAK3K,EAAQ4K,EAAU,EAAGD,EAAItjB,OAAS,EAAG,WAGrD6lB,EAAO3oB,UAAUonB,MAAQ,SAAkBC,EAAMC,EAAMC,EAAMC,UAClDJ,EAAM/nB,KAAK+mB,IAAK/mB,KAAKoc,OAAQ4L,EAAMC,EAAMC,EAAMC,EAAMnoB,KAAKgnB,WAGrEsC,EAAO3oB,UAAU6nB,OAAS,SAAmBnT,EAAGC,EAAGqT,UACxCH,EAAOxoB,KAAK+mB,IAAK/mB,KAAKoc,OAAQ/G,EAAGC,EAAGqT,EAAG3oB,KAAKgnB,WAGhDsC,EAhMyEQ,0BCEhF,MAAMC,GAAiB,CACnBC,QAAS,EACTvU,QAAS,GACTwQ,UAAW,EACXgE,OAAQ,GACRC,OAAQ,IACRlD,SAAU,GACVQ,KAAK,EAGL2C,YAAY,EAGZtX,OAAQ,KAGR5B,IAAKmZ,GAASA,GAGZC,GAAS1qB,KAAK0qB,SAAWvC,GAAiD,IAAIwC,aAAa,GAAzDjV,IAAQyS,GAAI,IAAMzS,EAAUyS,GAAI,KAA1C,IAACA,GAEhB,MAAMyC,GACjBta,YAAYnF,QACHA,QAAUkI,GAAOzS,OAAOuQ,OAAOiZ,IAAiBjf,QAChD0f,MAAQ,IAAI5b,MAAM5O,KAAK8K,QAAQ2K,QAAU,GAGlDgV,KAAKjL,SACKgI,IAACA,EAADwC,QAAMA,EAANvU,QAAeA,EAAfuR,SAAwBA,GAAYhnB,KAAK8K,QAE3C0c,GAAKkD,QAAQC,KAAK,oBAEhBC,EAAW,WAAYpL,EAAO/b,gBAChC+jB,GAAKkD,QAAQC,KAAKC,QAEjBpL,OAASA,MAGV3J,EAAW,OACV,IAAIlJ,EAAI,EAAGA,EAAI6S,EAAO/b,OAAQkJ,IAC1B6S,EAAO7S,GAAGgO,UACf9E,EAAStQ,KAAKslB,GAAmBrL,EAAO7S,GAAIA,SAE3C6d,MAAM/U,EAAU,GAAK,IAAI6T,GAAOzT,EAAU0T,GAAMC,GAAMxC,EAAUsD,cAEjE9C,GAAKkD,QAAQI,QAAQF,OAIpB,IAAIrD,EAAI9R,EAAS8R,GAAKyC,EAASzC,IAAK,OAC/BwD,GAAOC,KAAKD,MAGlBlV,EAAW7V,KAAKirB,SAASpV,EAAU0R,QAC9BiD,MAAMjD,GAAK,IAAI+B,GAAOzT,EAAU0T,GAAMC,GAAMxC,EAAUsD,cAEvD9C,GAAKkD,QAAQlD,IAAI,2BAA4BD,EAAG1R,EAASpS,QAASunB,KAAKD,MAAQA,UAGnFvD,GAAKkD,QAAQI,QAAQ,cAElB9qB,KAGXujB,YAAY7I,EAAMwQ,OACVC,IAAWzQ,EAAK,GAAK,KAAO,IAAM,KAAO,IAAM,UAC7C0Q,EAASzrB,KAAK8L,KAAK,GAAI9L,KAAK+L,IAAI,GAAIgP,EAAK,SAC3C2Q,EAAqB,MAAZ3Q,EAAK,GAAa,MAAQA,EAAK,GAAK,KAAO,IAAM,KAAO,IAAM,UACrE4Q,EAAS3rB,KAAK8L,KAAK,GAAI9L,KAAK+L,IAAI,GAAIgP,EAAK,QAE3CA,EAAK,GAAKA,EAAK,IAAM,IACrByQ,GAAU,IACVE,EAAS,SACN,GAAIF,EAASE,EAAQ,OAClBE,EAAavrB,KAAKujB,YAAY,CAAC4H,EAAQC,EAAQ,IAAKE,GAASJ,GAC7DM,EAAaxrB,KAAKujB,YAAY,EAAE,IAAK6H,EAAQC,EAAQC,GAASJ,UAC7DK,EAAWze,OAAO0e,SAGvBC,EAAOzrB,KAAKwqB,MAAMxqB,KAAK0rB,WAAWR,IAClCnE,EAAM0E,EAAK1D,MAAM4D,GAAKR,GAASS,GAAKN,GAASK,GAAKN,GAASO,GAAKR,IAChEvV,EAAW,OACZ,MAAM/P,KAAMihB,EAAK,OACZ9I,EAAIwN,EAAKjM,OAAO1Z,GACtB+P,EAAStQ,KAAK0Y,EAAE4N,UAAYC,GAAe7N,GAAKje,KAAKwf,OAAOvB,EAAErS,eAE3DiK,EAGXkW,YAAY/L,SACFgM,EAAWhsB,KAAKisB,aAAajM,GAC7BkM,EAAalsB,KAAKmsB,eAAenM,GACjCoM,EAAW,oCAEXxgB,EAAQ5L,KAAKwqB,MAAM0B,OACpBtgB,EAAO,MAAM,IAAI0O,MAAM8R,SAEtBC,EAASzgB,EAAM4T,OAAOwM,OACvBK,EAAQ,MAAM,IAAI/R,MAAM8R,SAEvBzD,EAAI3oB,KAAK8K,QAAQmf,QAAUjqB,KAAK8K,QAAQof,OAASvqB,KAAK2hB,IAAI,EAAG4K,EAAa,IAC1EnF,EAAMnb,EAAM4c,OAAO6D,EAAOhX,EAAGgX,EAAO/W,EAAGqT,GACvC2D,EAAW,OACZ,MAAMxmB,KAAMihB,EAAK,OACZ9I,EAAIrS,EAAM4T,OAAO1Z,GACnBmY,EAAEsO,WAAavM,GACfsM,EAAS/mB,KAAK0Y,EAAE4N,UAAYC,GAAe7N,GAAKje,KAAKwf,OAAOvB,EAAErS,WAI9C,IAApB0gB,EAAS7oB,OAAc,MAAM,IAAI6W,MAAM8R,UAEpCE,EAGXE,UAAUxM,EAAWyM,EAAOC,GACxBD,EAAQA,GAAS,GACjBC,EAASA,GAAU,QAEbC,EAAS,eACVC,cAAcD,EAAQ3M,EAAWyM,EAAOC,EAAQ,GAE9CC,EAGXE,QAAQtF,EAAGlS,EAAGC,SACJmW,EAAOzrB,KAAKwqB,MAAMxqB,KAAK0rB,WAAWnE,IAClCuF,EAAKntB,KAAK2hB,IAAI,EAAGiG,IACjB2C,OAACA,EAADD,OAASA,GAAUjqB,KAAK8K,QACxBoH,EAAI+X,EAASC,EACb6C,GAAOzX,EAAIpD,GAAK4a,EAChBE,GAAU1X,EAAI,EAAIpD,GAAK4a,EAEvBG,EAAO,CACTpS,SAAU,gBAGTqS,iBACDzB,EAAK1D,OAAO1S,EAAInD,GAAK4a,EAAIC,GAAM1X,EAAI,EAAInD,GAAK4a,EAAIE,GAChDvB,EAAKjM,OAAQnK,EAAGC,EAAGwX,EAAIG,GAEjB,IAAN5X,QACK6X,iBACDzB,EAAK1D,MAAM,EAAI7V,EAAI4a,EAAIC,EAAK,EAAGC,GAC/BvB,EAAKjM,OAAQsN,EAAIxX,EAAGwX,EAAIG,GAE5B5X,IAAMyX,EAAK,QACNI,iBACDzB,EAAK1D,MAAM,EAAGgF,EAAK7a,EAAI4a,EAAIE,GAC3BvB,EAAKjM,QAAS,EAAGlK,EAAGwX,EAAIG,GAGzBA,EAAKpS,SAASpX,OAASwpB,EAAO,KAGzCE,wBAAwBnN,OAChBoN,EAAgBptB,KAAKmsB,eAAenM,GAAa,OAC9CoN,GAAiBptB,KAAK8K,QAAQ2K,SAAS,OACpC6W,EAAWtsB,KAAK+rB,YAAY/L,MAClCoN,IACwB,IAApBd,EAAS7oB,OAAc,MAC3Buc,EAAYsM,EAAS,GAAGjS,WAAWgT,kBAEhCD,EAGXR,cAAcrlB,EAAQyY,EAAWyM,EAAOC,EAAQY,SACtChB,EAAWtsB,KAAK+rB,YAAY/L,OAE7B,MAAMuN,KAASjB,EAAU,OACpBlC,EAAQmD,EAAMlT,cAEhB+P,GAASA,EAAMrU,QACXuX,EAAUlD,EAAMoD,aAAed,EAE/BY,GAAWlD,EAAMoD,YAGjBF,EAAUttB,KAAK4sB,cAAcrlB,EAAQ6iB,EAAMiD,WAAYZ,EAAOC,EAAQY,GAGnEA,EAAUZ,EAEjBY,IAGA/lB,EAAOhC,KAAKgoB,GAEZhmB,EAAO9D,SAAWgpB,EAAO,aAG1Ba,EAGXJ,iBAAiBnG,EAAKvH,EAAQnK,EAAGC,EAAGwX,EAAIG,OAC/B,MAAMtgB,KAAKoa,EAAK,OACX9I,EAAIuB,EAAO7S,GACX8gB,EAAYxP,EAAE4N,cAEhB6B,EAAMC,EAAIC,KACVH,EACAC,EAAOG,GAAqB5P,GAC5B0P,EAAK1P,EAAE5I,EACPuY,EAAK3P,EAAE3I,MACJ,OACGpD,EAAIlS,KAAKwf,OAAOvB,EAAErS,OACxB8hB,EAAOxb,EAAEmI,WACTsT,EAAKhC,GAAKzZ,EAAEyI,SAASP,YAAY,IACjCwT,EAAKhC,GAAK1Z,EAAEyI,SAASP,YAAY,UAG/B9R,EAAI,CACN+B,KAAM,EACNsQ,SAAU,CAAC,CACPhb,KAAK8f,MAAMzf,KAAK8K,QAAQof,QAAUyD,EAAKb,EAAKzX,IAC5C1V,KAAK8f,MAAMzf,KAAK8K,QAAQof,QAAU0D,EAAKd,EAAKxX,MAEhDoY,KAAAA,OAIA5nB,EACA2nB,EACA3nB,EAAKmY,EAAEnY,GACA9F,KAAK8K,QAAQqf,WAEpBrkB,EAAKmY,EAAErS,MACA5L,KAAKwf,OAAOvB,EAAErS,OAAO9F,KAE5BA,EAAK9F,KAAKwf,OAAOvB,EAAErS,OAAO9F,SAGnB/C,IAAP+C,IAAkBwC,EAAExC,GAAKA,GAE7BmnB,EAAKpS,SAAStV,KAAK+C,IAI3BojB,WAAWnE,UACA5nB,KAAK8L,IAAIzL,KAAK8K,QAAQkf,QAASrqB,KAAK+L,KAAK6b,EAAGvnB,KAAK8K,QAAQ2K,QAAU,IAG9EwV,SAASzL,EAAQ0L,SACPrV,EAAW,IACXoU,OAACA,EAADC,OAASA,EAATrX,OAAiBA,EAAjBoT,UAAyBA,GAAajmB,KAAK8K,QAC3C6d,EAAIsB,GAAUC,EAASvqB,KAAK2hB,IAAI,EAAG4J,QAGpC,IAAIve,EAAI,EAAGA,EAAI6S,EAAO/b,OAAQkJ,IAAK,OAC9BuF,EAAIsN,EAAO7S,MAEbuF,EAAEgZ,MAAQA,EAAM,SACpBhZ,EAAEgZ,KAAOA,QAGHO,EAAOzrB,KAAKwqB,MAAMU,EAAO,GACzB4C,EAAcrC,EAAKjD,OAAOtW,EAAEmD,EAAGnD,EAAEoD,EAAGqT,GAEpCoF,EAAkB7b,EAAE2Z,WAAa,MACnCA,EAAYkC,MAGX,MAAMC,KAAcF,EAAa,OAC5BvN,EAAIkL,EAAKjM,OAAOwO,GAElBzN,EAAE2K,KAAOA,IAAMW,GAAatL,EAAEsL,WAAa,MAI/CA,EAAYkC,GAAmBlC,GAAa5F,EAAW,KACnDgI,EAAK/b,EAAEmD,EAAI0Y,EACXG,EAAKhc,EAAEoD,EAAIyY,EAEXI,EAAoBtb,GAAUkb,EAAkB,EAAI/tB,KAAKouB,KAAKlc,GAAG,GAAQ,WAGvEpM,GAAM6G,GAAK,IAAMue,EAAO,GAAKlrB,KAAKwf,OAAO/b,WAE1C,MAAMuqB,KAAcF,EAAa,OAC5BvN,EAAIkL,EAAKjM,OAAOwO,MAElBzN,EAAE2K,MAAQA,EAAM,SACpB3K,EAAE2K,KAAOA,QAEHmD,EAAa9N,EAAEsL,WAAa,EAClCoC,GAAM1N,EAAElL,EAAIgZ,EACZH,GAAM3N,EAAEjL,EAAI+Y,EAEZ9N,EAAEgM,SAAWzmB,EAET+M,IACKsb,IAAmBA,EAAoBnuB,KAAKouB,KAAKlc,GAAG,IACzDW,EAAOsb,EAAmBnuB,KAAKouB,KAAK7N,KAI5CrO,EAAEqa,SAAWzmB,EACb+P,EAAStQ,KAAK+oB,GAAcL,EAAKpC,EAAWqC,EAAKrC,EAAW/lB,EAAI+lB,EAAWsC,YAG3EtY,EAAStQ,KAAK2M,GAEV2Z,EAAY,MACP,MAAMmC,KAAcF,EAAa,OAC5BvN,EAAIkL,EAAKjM,OAAOwO,GAClBzN,EAAE2K,MAAQA,IACd3K,EAAE2K,KAAOA,EACTrV,EAAStQ,KAAKgb,YAMvB1K,EAIXoW,aAAajM,UACDA,EAAYhgB,KAAKwf,OAAO/b,QAAW,EAI/C0oB,eAAenM,UACHA,EAAYhgB,KAAKwf,OAAO/b,QAAU,GAG9C2qB,KAAKjU,EAAOsB,MACJtB,EAAM0R,iBACCpQ,EAAQzI,GAAO,GAAImH,EAAME,YAAcF,EAAME,iBAElDkU,EAAWvuB,KAAKwf,OAAOrF,EAAMvO,OAAOyO,WACpC9S,EAASvH,KAAK8K,QAAQmG,IAAIsd,UACzB9S,GAASlU,IAAWgnB,EAAWvb,GAAO,GAAIzL,GAAUA,GAInE,SAAS+mB,GAAcjZ,EAAGC,EAAGxP,EAAI+lB,EAAWxR,SACjC,CACHhF,EAAGgV,GAAOhV,GACVC,EAAG+U,GAAO/U,GACV4V,KAAMsD,EAAAA,EACN1oB,GAAAA,EACAymB,UAAW,EACXV,UAAAA,EACAxR,WAAAA,GAIR,SAASwQ,GAAmB3Y,EAAGpM,SACpBuP,EAAGC,GAAKpD,EAAEyI,SAASP,kBACnB,CACH/E,EAAGgV,GAAOsB,GAAKtW,IACfC,EAAG+U,GAAOuB,GAAKtW,IACf4V,KAAMsD,EAAAA,EACN5iB,MAAO9F,EACPymB,UAAW,GAInB,SAAST,GAAe/V,SACb,CACH1L,KAAM,UACNvE,GAAIiQ,EAAQjQ,GACZuU,WAAYwT,GAAqB9X,GACjC4E,SAAU,CACNtQ,KAAM,QACN+P,YAAa,EA6BX/E,EA7BiBU,EAAQV,EA8BhB,KAAXA,EAAI,KA9B2BoZ,GAAK1Y,EAAQT,MA6BxD,IAAcD,EAxBd,SAASwY,GAAqB9X,SACpB8I,EAAQ9I,EAAQ8V,UAChB6C,EACF7P,GAAS,IAAWlf,KAAK8f,MAAMZ,EAAQ,KAArB,IAClBA,GAAS,IAAUlf,KAAK8f,MAAMZ,EAAQ,KAAO,GAA5B,IAAsCA,SACpD7L,GAAOA,GAAO,GAAI+C,EAAQsE,YAAa,CAC1CtE,SAAS,EACTsX,WAAYtX,EAAQjQ,GACpB0nB,YAAa3O,EACb8P,wBAAyBD,IAKjC,SAAS/C,GAAK9W,UACHA,EAAM,IAAM,GAEvB,SAAS+W,GAAKlX,SACJI,EAAMnV,KAAKmV,IAAIJ,EAAM/U,KAAKgV,GAAK,KAC/BW,EAAK,GAAM,IAAO3V,KAAK6nB,KAAK,EAAI1S,IAAQ,EAAIA,IAAQnV,KAAKgV,UACxDW,EAAI,EAAI,EAAIA,EAAI,EAAI,EAAIA,EAOnC,SAASmZ,GAAKnZ,SACJsZ,GAAM,IAAU,IAAJtZ,GAAW3V,KAAKgV,GAAK,WAChC,IAAMhV,KAAKkvB,KAAKlvB,KAAK8nB,IAAImH,IAAOjvB,KAAKgV,GAAK,GAGrD,SAAS3B,GAAO8b,EAAMC,OACb,MAAMjpB,KAAMipB,EAAKD,EAAKhpB,GAAMipB,EAAIjpB,UAC9BgpB,EAGX,SAASvF,GAAKrX,UACHA,EAAEmD,EAEb,SAASmU,GAAKtX,UACHA,EAAEoD,MC3WT0Z,GC5CJC,GAAiB,SAASC,EAAMnnB,EAAGwY,MAC7BxY,IAAMwY,EAAG,OAAO,KAEhBxY,GAAKwY,GAAiB,iBAALxY,GAA6B,iBAALwY,EAAe,IACtDxY,EAAEkI,cAAgBsQ,EAAEtQ,YAAa,OAAO,MAExCxM,EAAQkJ,EAAGvD,KACXwF,MAAMD,QAAQ5G,GAAI,KACpBtE,EAASsE,EAAEtE,SACG8c,EAAE9c,OAAQ,OAAO,MAC1BkJ,EAAIlJ,EAAgB,GAARkJ,KACf,IAAKuiB,EAAMnnB,EAAE4E,GAAI4T,EAAE5T,IAAK,OAAO,SAC1B,KAIJ5E,aAAaonB,KAAS5O,aAAa4O,IAAM,IACxCpnB,EAAEqnB,OAAS7O,EAAE6O,KAAM,OAAO,MACzBziB,KAAK5E,EAAEsnB,UACV,IAAK9O,EAAEvX,IAAI2D,EAAE,IAAK,OAAO,MACtBA,KAAK5E,EAAEsnB,UACV,IAAKH,EAAMviB,EAAE,GAAI4T,EAAE9f,IAAIkM,EAAE,KAAM,OAAO,SACjC,KAGJ5E,aAAaunB,KAAS/O,aAAa+O,IAAM,IACxCvnB,EAAEqnB,OAAS7O,EAAE6O,KAAM,OAAO,MACzBziB,KAAK5E,EAAEsnB,UACV,IAAK9O,EAAEvX,IAAI2D,EAAE,IAAK,OAAO,SACpB,KAGL4iB,YAAYC,OAAOznB,IAAMwnB,YAAYC,OAAOjP,GAAI,KAClD9c,EAASsE,EAAEtE,SACG8c,EAAE9c,OAAQ,OAAO,MAC1BkJ,EAAIlJ,EAAgB,GAARkJ,KACf,GAAI5E,EAAE4E,KAAO4T,EAAE5T,GAAI,OAAO,SACrB,KAIL5E,EAAEkI,cAAgBwf,OAAQ,OAAO1nB,EAAEoD,SAAWoV,EAAEpV,QAAUpD,EAAE2nB,QAAUnP,EAAEmP,SACxE3nB,EAAEZ,UAAY5G,OAAOI,UAAUwG,QAAS,OAAOY,EAAEZ,YAAcoZ,EAAEpZ,aACjEY,EAAE5F,WAAa5B,OAAOI,UAAUwB,SAAU,OAAO4F,EAAE5F,aAAeoe,EAAEpe,eAGxEsB,GADA2F,EAAO7I,OAAO6I,KAAKrB,IACLtE,UACClD,OAAO6I,KAAKmX,GAAG9c,OAAQ,OAAO,MAExCkJ,EAAIlJ,EAAgB,GAARkJ,KACf,IAAKpM,OAAOI,UAAUgF,eAAejF,KAAK6f,EAAGnX,EAAKuD,IAAK,OAAO,MAE3DA,EAAIlJ,EAAgB,GAARkJ,KAAY,KACvBzH,EAAMkE,EAAKuD,OAEVuiB,EAAMnnB,EAAE7C,GAAMqb,EAAErb,IAAO,OAAO,SAG9B,SAIF6C,GAAIA,GAAKwY,GAAIA,GCtCToP,4CAMCha,uBAAEF,IAAAA,YAASwU,OAAAA,aAAS,KAAOnf,OAA3B,2CACJ,CAAE2K,QAAAA,KAEHma,aAAe,IAAIC,kBACtBpa,QAASqa,EAAKra,QACdwU,OAAAA,GACGnf,MAGApB,MAAQ,CAAEwhB,KAAM,2CAEhB,SAAUlkB,OACX8O,GAAU,MAEToZ,GAAMloB,EAAMuL,QAASvS,KAAKuS,SAAU,CACvCuD,GAAU,OAELvD,UAAcvL,EAAMuL,aAEnBiN,EAASxf,KAAKuS,QAAQtB,KAAI,SAAC8B,SACxB,CACL1I,KAAM,UACNsQ,SAAU,CACRtQ,KAAM,QACN+P,YAAa,CACXrH,EAAOE,cAAc4B,MACrB9B,EAAOE,cAAcyB,QAGzB2F,WAAY,CAAEtH,OAAAA,YAIb6c,aAAanF,KAAKjL,OAGnB9V,EAAQ,CAAEwhB,KAAMlkB,EAAMiK,IAAI2E,kBAE3BE,GACC9V,KAAK0J,MAAMwhB,KAAOlrB,KAAKyV,SAAW/L,EAAMwhB,KAAOlrB,KAAKyV,UAGtDK,EAAUA,IAAYoZ,GAAMlvB,KAAK0J,MAAOA,SAIvCA,MAAQA,EAEToM,SACGD,SAAW7V,KAAK+V,QAAQ/O,IAGxB,CAAE6O,SAAU7V,KAAK6V,SAAUC,QAAAA,0BAG7B,gBAAU7E,IAAAA,WACRjR,KAAK4vB,aACTrM,YAAY,EAAE,KAAM,GAAI,IAAK,IAAK5jB,KAAK8f,MAAMxO,EAAI2E,YACjD3E,IAAIjR,KAAK+vB,iBAAiBlvB,KAAKb,uCAG1B,sBACR2a,SACEP,eAAcvF,OAAKH,OAErB2F,IAAAA,cAEIA,EAAWtE,eACN,IAAIzD,GAAQ,CACjBC,QAASvS,KAAK4vB,aACXpD,UAAUnS,EAAWgT,WAAYmB,EAAAA,GACjCvd,KAAI,SAAC+e,UAASA,EAAK3V,WAAWtH,UACjCP,SAAU,IAAIC,OAAOC,KAAKC,OAAO,CAAE+B,IAAAA,EAAKG,IAAAA,UAGpC9B,EAASsH,EAAWtH,cAEnB,IAAIT,GAAQ,CACjBC,QAAS,CAACQ,GACVP,SAAUO,EAAOE,uBArFkBuC,IC/BvC9M,GAAuBnG,GACvBgG,GAAW/F,GACXS,GAAkBP,EAClB0d,GAAaxb,GAKjBqrB,GATkB3vB,EASaC,OAAO2vB,iBAAmB,SAA0B7nB,EAAG8nB,GACpF5nB,GAASF,WAKLnD,EAJAklB,EAAQnnB,GAAgBktB,GACxB/mB,EAAOgX,GAAW+P,GAClB1sB,EAAS2F,EAAK3F,OACdmI,EAAQ,EAELnI,EAASmI,GAAOlD,GAAqBJ,EAAED,EAAGnD,EAAMkE,EAAKwC,KAAUwe,EAAMllB,WACrEmD,GCfT+nB,GAFiB9vB,GAEW,WAAY,mBJDpCiI,GAAWjI,GACX4vB,GAAmB3tB,GACnBqK,GAAcpK,GACd8G,GAAa5G,GACb0tB,GAAOxrB,GACPiD,GAAwBzB,GAOxBiqB,GANYjpB,GAMS,YAErBkpB,GAAmB,aAEnBC,GAAY,SAAUC,SACjBC,WAAmBD,EAAnBC,KAAAA,WAILC,GAA4B,SAAU1B,GACxCA,EAAgB2B,MAAMJ,GAAU,KAChCvB,EAAgB4B,YACZC,EAAO7B,EAAgB8B,aAAavwB,cACxCyuB,EAAkB,KACX6B,GA0BLE,GAAkB,eAElB/B,GAAkB,IAAIgC,cAAc,YACpC,MAAO5wB,IAzBoB,IAIzB6wB,EAFAC,EAwBJH,GAAqC,oBAAZrpB,SACrBA,SAASypB,QAAUnC,GACjB0B,GAA0B1B,MA1B5BkC,EAASrpB,GAAsB,WAG5BupB,MAAMC,QAAU,OACvBjB,GAAKkB,YAAYJ,GAEjBA,EAAOnC,IAAMxqB,OALJ,gBAMT0sB,EAAiBC,EAAOK,cAAc7pB,UACvB8pB,OACfP,EAAeN,MAAMJ,GAAU,sBAC/BU,EAAeL,QACRK,EAAeQ,GAiBlBf,GAA0B1B,YAC1BvrB,EAASmJ,GAAYnJ,OAClBA,YAAiBstB,GAAe,UAAYnkB,GAAYnJ,WACxDstB,MAGTznB,GAAW+mB,KAAY,MKlEnBvf,GLsEavQ,OAAOuQ,QAAU,SAAgBzI,EAAG8nB,OAC/C5oB,SACM,OAANc,GACFioB,GAAgB,UAAc/nB,GAASF,GACvCd,EAAS,IAAI+oB,GACbA,GAAgB,UAAc,KAE9B/oB,EAAO8oB,IAAYhoB,GACdd,EAASwpB,UACMhuB,IAAfotB,EAA2B5oB,EAAS2oB,GAAiB3oB,EAAQ4oB,IK9ElEznB,GAAuBlG,GAEvBkvB,GAJkBpxB,GAIY,eAC9BqxB,GAAiB/iB,MAAMjO,UAIQoC,MAA/B4uB,GAAeD,KACjBhpB,GAAqBJ,EAAEqpB,GAAgBD,GAAa,CAClD9vB,cAAc,EACdD,MAAOmP,GAAO,YCVd8gB,GAAYrvB,GAAuCgK,SACnDslB,GDca,SAAU3sB,GACzBysB,GAAeD,IAAaxsB,IAAO,GCjB7B5E,GAMN,CAAE2N,OAAQ,QAASkE,OAAO,GAAQ,CAClC5F,SAAU,SAAkBH,UACnBwlB,GAAU5xB,KAAMoM,EAAIrL,UAAU0C,OAAS,EAAI1C,UAAU,QAAKgC,MAKrE8uB,GAAiB,YCdjB,IAAIzuB,GAAW9C,EACXmC,GAAUF,EAGVuvB,GAFkBtvB,GAEM,SCHxBuvB,GDOa,SAAUryB,OACrBqyB,SACG3uB,GAAS1D,UAAmCqD,KAA1BgvB,EAAWryB,EAAGoyB,OAA0BC,EAA0B,UAAftvB,GAAQ/C,KCPlFmD,GAHSvC,EAGUuC,UCFnBJ,GAAUF,GAEVgC,GAHSjE,EAGOiE,OAEpBpC,GAAiB,SAAUgB,MACC,WAAtBV,GAAQU,GAAwB,MAAMN,UAAU,oDAC7C0B,GAAOpB,ICLZ2uB,GAFkBxxB,GAEM,SCDxB0xB,GAAI1xB,GAEJ2xB,GHEa,SAAUvyB,MACrBqyB,GAASryB,SACLmD,GAAU,wDACTnD,GGJPoD,GAAyBJ,EACzBP,GAAWyC,GACXstB,GDFa,SAAUzgB,OACrB0gB,EAAS,cAEL1gB,GAAa0gB,GACnB,MAAOC,cAELD,EAAOL,KAAS,EACT,MAAMrgB,GAAa0gB,GAC1B,MAAOE,YACF,GCLPC,GANc/vB,EAMc,GAAGiK,YAIjC,CAAEyB,OAAQ,SAAUkE,OAAO,EAAMzD,QAASwjB,GAAqB,aAAe,CAC9E3lB,SAAU,SAAkBgmB,YAChBD,GACRnwB,GAASW,GAAuB9C,OAChCmC,GAAS8vB,GAAWM,IACpBxxB,UAAU0C,OAAS,EAAI1C,UAAU,QAAKgC,MChB5C,IAAI0E,GAAgBnH,GAChBoI,GAAuBnG,GACvBd,GAA2Be,ECF3BwvB,GAAI1xB,GACJV,GAAS2C,EACToJ,GAAkBnJ,GAClB+I,GAAsB7I,GACtBqJ,GAAoBnH,GACpBc,GAAWU,GACX8J,GAAqB9I,GACrBorB,GDHa,SAAU5pB,EAAQ1D,EAAKvD,OAClC8wB,EAAchrB,GAAcvC,GAC5ButB,KAAe7pB,EAAQF,GAAqBJ,EAAEM,EAAQ6pB,EAAahxB,GAAyB,EAAGE,IAC9FiH,EAAO6pB,GAAe9wB,GCGzB+wB,GAF+BlpB,GAEoB,UAEnD3G,GAAYjD,GAAOiD,UACnB4I,GAAM9L,KAAK8L,IACXC,GAAM/L,KAAK+L,IACXinB,GAAmB,iBACnBC,GAAkC,kCAKtCZ,GAAE,CAAE/jB,OAAQ,QAASkE,OAAO,EAAMzD,QAASgkB,IAAuB,CAChE7N,OAAQ,SAAgBgO,EAAOC,OAKzBC,EAAaC,EAAmBxS,EAAG9D,EAAGsE,EAAMC,EAJ5C5Y,EAAI3C,GAAS1F,MACb2iB,EAAM5W,GAAkB1D,GACxB4qB,EAActnB,GAAgBknB,EAAOlQ,GACrC9B,EAAkB9f,UAAU0C,UAER,IAApBod,EACFkS,EAAcC,EAAoB,EACL,IAApBnS,GACTkS,EAAc,EACdC,EAAoBrQ,EAAMsQ,IAE1BF,EAAclS,EAAkB,EAChCmS,EAAoBtnB,GAAID,GAAIF,GAAoBunB,GAAc,GAAInQ,EAAMsQ,IAEtEtQ,EAAMoQ,EAAcC,EAAoBL,SACpC9vB,GAAU+vB,QAElBpS,EAAItQ,GAAmB7H,EAAG2qB,GACrBtW,EAAI,EAAGA,EAAIsW,EAAmBtW,KACjCsE,EAAOiS,EAAcvW,KACTrU,GAAGmqB,GAAehS,EAAG9D,EAAGrU,EAAE2Y,OAExCR,EAAE/c,OAASuvB,EACPD,EAAcC,EAAmB,KAC9BtW,EAAIuW,EAAavW,EAAIiG,EAAMqQ,EAAmBtW,IAEjDuE,EAAKvE,EAAIqW,GADT/R,EAAOtE,EAAIsW,KAEC3qB,EAAGA,EAAE4Y,GAAM5Y,EAAE2Y,UACb3Y,EAAE4Y,OAEXvE,EAAIiG,EAAKjG,EAAIiG,EAAMqQ,EAAoBD,EAAarW,WAAYrU,EAAEqU,EAAI,QACtE,GAAIqW,EAAcC,MAClBtW,EAAIiG,EAAMqQ,EAAmBtW,EAAIuW,EAAavW,IAEjDuE,EAAKvE,EAAIqW,EAAc,GADvB/R,EAAOtE,EAAIsW,EAAoB,KAEnB3qB,EAAGA,EAAE4Y,GAAM5Y,EAAE2Y,UACb3Y,EAAE4Y,OAGbvE,EAAI,EAAGA,EAAIqW,EAAarW,IAC3BrU,EAAEqU,EAAIuW,GAAelyB,UAAU2b,EAAI,UAErCrU,EAAE5E,OAASkf,EAAMqQ,EAAoBD,EAC9BvS,KCnEX,IAAI5gB,GAASU,EACT4C,GAAaX,EAEbgC,GAAS3E,GAAO2E,OAChB1B,GAAYjD,GAAOiD,UCHnBX,GAAc5B,EACdiI,GAAWhG,GACX2wB,GDGa,SAAU/vB,MACF,iBAAZA,GAAwBD,GAAWC,GAAW,OAAOA,QAC1DN,GAAU,aAAe0B,GAAOpB,GAAY,oBCCpDgwB,GAAiB5yB,OAAO6yB,iBAAmB,aAAe,GAAK,eAGzDC,EAFAC,GAAiB,EACjBnqB,EAAO,QAITkqB,EAASnxB,GAAY3B,OAAOW,yBAAyBX,OAAOI,UAAW,aAAaoI,MAC7EI,EAAM,IACbmqB,EAAiBnqB,aAAgByF,MACjC,MAAOxO,WACF,SAAwBiI,EAAG8J,UAChC5J,GAASF,GACT6qB,GAAmB/gB,GACfmhB,EAAgBD,EAAOhrB,EAAG8J,GACzB9J,EAAEkrB,UAAYphB,EACZ9J,GAfoD,QAiBzDtF,GC1BFG,GAAa5C,EACb8C,GAAWb,EACX6wB,GAAiB5wB,GCErBgxB,GAJkBlzB,EAIW,GAAI6G,SCH7BrE,GAAyBP,EACzBJ,GAAWK,GAGX0I,GALc5K,EAKQ,GAAG4K,SACzBuoB,GAAa,kDACbC,GAAQjE,OAAO,IAAMgE,GAAaA,GAAa,KAC/CE,GAAQlE,OAAOgE,GAAaA,GAAa,MAGzCxnB,GAAe,SAAU7B,UACpB,SAAU+B,OACXyB,EAASzL,GAASW,GAAuBqJ,WAClC,EAAP/B,IAAUwD,EAAS1C,GAAQ0C,EAAQ8lB,GAAO,KACnC,EAAPtpB,IAAUwD,EAAS1C,GAAQ0C,EAAQ+lB,GAAO,KACvC/lB,IAIXgmB,GAAiB,CAGff,MAAO5mB,GAAa,GAGpB4nB,IAAK5nB,GAAa,GAGlB6nB,KAAM7nB,GAAa,IC5BjBjE,GAAc1H,EACdV,GAAS2C,EACTL,GAAcM,EACd6K,GAAW3K,GACXqL,GAAWnJ,WACXiB,GAASO,GACT2tB,GHFa,SAAU5nB,EAAO6nB,EAAOC,OACnCC,EAAWC,SAGbf,IAEAlwB,GAAWgxB,EAAYF,EAAM/jB,cAC7BikB,IAAcD,GACd7wB,GAAS+wB,EAAqBD,EAAUvzB,YACxCwzB,IAAuBF,EAAQtzB,WAC/ByyB,GAAejnB,EAAOgoB,GACjBhoB,GGRLxI,GAAgBwE,GAChBtD,GAAW2E,GACXlC,GAAc8sB,GACdl0B,GAAQm0B,EACRtnB,GAAsBunB,GAAsDhsB,EAC5EpH,GAA2BqzB,EAA2DjsB,EACtF9H,GAAiBg0B,GAA+ClsB,EAChEkrB,GAAkBiB,GAClBX,GAAOY,GAAoCZ,KAE3Ca,GAAS,SACTC,GAAeh1B,GAAM,OACrBi1B,GAAkBD,GAAaj0B,UAC/BkC,GAAYjD,GAAOiD,UACnBiyB,GAAa5yB,GAAY,GAAGG,OAC5B0yB,GAAa7yB,GAAY,GAAG6yB,YAI5BC,GAAY,SAAUrzB,OACpBszB,EAAY3tB,GAAY3F,EAAO,gBACR,iBAAbszB,EAAwBA,EAAYC,GAASD,IAKzDC,GAAW,SAAU/xB,OAEnBgyB,EAAOC,EAAOC,EAAOC,EAASC,EAAQ9xB,EAAQmI,EAAO4pB,EADrD91B,EAAK4H,GAAYnE,EAAU,aAE3B0B,GAASnF,GAAK,MAAMmD,GAAU,gDACjB,iBAANnD,GAAkBA,EAAG+D,OAAS,KACvC/D,EAAKo0B,GAAKp0B,GAEI,MADdy1B,EAAQJ,GAAWr1B,EAAI,KACO,KAAVy1B,MAEJ,MADdC,EAAQL,GAAWr1B,EAAI,KACO,MAAV01B,EAAe,OAAOK,SACrC,GAAc,KAAVN,EAAc,QACfJ,GAAWr1B,EAAI,SAChB,QAAS,GAAI21B,EAAQ,EAAGC,EAAU,cAClC,QAAS,IAAKD,EAAQ,EAAGC,EAAU,wBACvB51B,MAGnB+D,GADA8xB,EAAST,GAAWp1B,EAAI,IACR+D,OACXmI,EAAQ,EAAGA,EAAQnI,EAAQmI,QAC9B4pB,EAAOT,GAAWQ,EAAQ3pB,IAGf,IAAM4pB,EAAOF,EAAS,OAAOG,WACjCC,SAASH,EAAQF,UAEpB31B,GAKZ,GAAI2N,GAASsnB,IAASC,GAAa,UAAYA,GAAa,QAAUA,GAAa,SAAU,SAetE1vB,GAdjBywB,GAAgB,SAAgBh0B,OAC9B2lB,EAAIvmB,UAAU0C,OAAS,EAAI,EAAImxB,GAAaI,GAAUrzB,IACtDqyB,EAAQh0B,YAEL2D,GAAckxB,GAAiBb,IAAU9zB,IAAM,WAAcszB,GAAgBQ,MAChFD,GAAkBxzB,OAAO+mB,GAAI0M,EAAO2B,IAAiBrO,GAElDle,GAAOpB,GAAc+E,GAAoB6nB,IAAgB,oLAOhEjyB,MAAM,KAAM8Z,GAAI,EAAQrT,GAAK3F,OAASgZ,GAAGA,KACrC5W,GAAO+uB,GAAc1vB,GAAMkE,GAAKqT,OAAQ5W,GAAO8vB,GAAezwB,KAChE1E,GAAem1B,GAAezwB,GAAKhE,GAAyB0zB,GAAc1vB,KAG9EywB,GAAch1B,UAAYk0B,GAC1BA,GAAgB5kB,YAAc0lB,GAC9B5nB,GAASnO,GAAQ+0B,GAAQgB,QCjEdC,GAYX,WAAYrjB,EAA+BsD,kBACpCtD,QAAU,CAAEmL,IAAKnL,EAAQ9O,YAExBoyB,EAAsBhgB,EAAS5E,KAAI,SAAClJ,UAAMA,EAAE8W,SAC5CiX,EAAmBD,EAAoBhjB,QAAO,SAAC9K,EAAGwY,UAAMxY,EAAIwY,IAAG,QAEhE1K,SAAW,CACdgJ,MAAOhJ,EAASpS,OAChB8O,QAAS,CACP6Q,KAAM0S,EAAmBjgB,EAASpS,OAClCia,IAAKoY,EACLpqB,IAAK/L,KAAK+L,UAAL/L,OAAYk2B,IACjBpqB,IAAK9L,KAAK8L,UAAL9L,OAAYk2B,OAsBZE,gFAyCTC,OADEnX,IAAAA,MAAOrM,IAAAA,SAIHyjB,EACJpX,EAAQlf,KAAK8L,IAAI,GAAIuqB,EAAMngB,SAAStD,QAAQ6Q,MAAQ,UAAY,UAG5D8S,EAAMp2B,OAAOq2B,8BACRF,sPAOJ,IAAIxjB,OAAOC,KAAK0jB,OAAO,CAC5B5jB,SAAAA,EACA6jB,KAAM,CACJC,wCAAkCJ,GAClCK,WAAY,IAAI9jB,OAAOC,KAAK8jB,KAAK,GAAI,KAEvCC,MAAO,CACLC,KAAMnyB,OAAOsa,GACboX,MAAO,wBACPU,SAAU,QAEZC,2BAAqB/X,cAErBgY,OAAQlT,OAAOlR,OAAOC,KAAK0jB,OAAOU,YAAcjY,iBC5F1CkY,GCNCC,GACX,uBAZF,SAAgBC,EAAYC,OAGrB,IAAIC,KAAYD,EAAMv2B,UACzBs2B,EAAMt2B,UAAUw2B,GAAYD,EAAMv2B,UAAUw2B,GAc5CnkB,CAAOgkB,EAAiBvkB,OAAOC,KAAK0kB,8CDD5BL,GAAAA,0BAAAA,gEAEVA,kCACAA,6BAGWM,GAAsD,SACjEC,EACAvhB,EACA9E,GAEAA,EAAIsmB,UAAUxhB,EAAQjD,SAOX0kB,qDAeTvmB,IAAAA,QACAsB,QAAAA,aAAU,SACVklB,UAAAA,aAAY,IAAI9H,GAAsB,UACtC+H,SAAAA,aAAW,IAAI3B,SACf4B,eAAAA,aAAiBN,uCAGZ9kB,UAAcA,KACdsD,SAAW,KAEX4hB,UAAYA,IACZC,SAAWA,IAEXC,eAAiBA,EAElB1mB,KACGqC,OAAOrC,wCAIT,SAAU8B,EAA4B6kB,GACvC53B,KAAKuS,QAAQhG,SAASwG,UAIrBR,QAAQhN,KAAKwN,GACb6kB,QACEC,oCAIF,SAAWtlB,EAA+BqlB,cAC/CrlB,EAAQvB,SAAQ,SAAC+B,GACf8F,EAAKif,UAAU/kB,GAAQ,MAGpB6kB,QACEC,qCAIF,SAAa9kB,EAA4B6kB,OACxChsB,EAAQ5L,KAAKuS,QAAQ/F,QAAQuG,UAEpB,IAAXnH,IAKJmH,EAAOO,OAAO,WACTf,QAAQsS,OAAOjZ,EAAO,GAEtBgsB,QACEC,UAGA,gCAGF,SACLtlB,EACAqlB,cAEIG,GAAU,SAEdxlB,EAAQvB,SAAQ,SAAC+B,GACfglB,EAAUC,EAAKC,aAAallB,GAAQ,IAASglB,KAG3CA,IAAYH,QACTC,SAGAE,8BAGF,SAAaH,QACbrlB,QAAQ9O,OAAS,EAEjBm0B,QACEC,+BAOF,eACC5mB,EAAMjR,KAAKk4B,YACbjnB,aAAewB,OAAOC,KAAKyc,KAAOnvB,KAAKm4B,gBAAiB,CAC1D1lB,OAAOC,KAAK0lB,MAAMC,QAChBr4B,KACA+2B,wBAAsBuB,iBACtBt4B,YAE4BA,KAAKy3B,UAAUc,UAAU,CACrDhmB,QAASvS,KAAKuS,QACdtB,IAAAA,EACAuC,oBAAqBxT,KAAKm4B,kBAHpBtiB,IAAAA,SAAUC,IAAAA,SAOdA,GAAsB/S,MAAX+S,UAER0iB,aAGA3iB,SAAWA,OAEX4iB,kBAEPhmB,OAAOC,KAAK0lB,MAAMC,QAChBr4B,KACA+2B,wBAAsB2B,eACtB14B,4BAKC,gBACA24B,aAAe34B,KAAKk4B,SAASU,YAChC,OACA54B,KAAK63B,OAAOh3B,KAAKb,YAEd63B,iCAGA,WACLplB,OAAOC,KAAK0lB,MAAMS,eAAe74B,KAAK24B,mBACjCH,6BAGG,gBACHjmB,QAAQvB,SAAQ,SAAC+B,UAAWA,EAAOO,OAAO,cAC1CuC,SAAS7E,SAAQ,SAAC+E,UAAYA,EAAQ+iB,iBACtCjjB,SAAW,iCAGR,sBAEFmgB,EAAQ,IAAIJ,GAAa51B,KAAKuS,QAASvS,KAAK6V,UAC5C5E,EAAMjR,KAAKk4B,cAEZriB,SAAS7E,SAAQ,SAAC+E,GACU,IAA3BA,EAAQxD,QAAQ9O,OAClBsS,EAAQhD,OAASgD,EAAQxD,QAAQ,IAEjCwD,EAAQhD,OAASgmB,EAAKrB,SAASG,OAAO9hB,EAASigB,GAE3C+C,EAAKpB,gBACP5hB,EAAQhD,OAAO6lB,YACb,kBAECR,GACC3lB,OAAOC,KAAK0lB,MAAMC,QAChBU,EACAhC,wBAAsBiC,cACtBjjB,GAEFgjB,EAAKpB,eAAeS,EAAOriB,EAAS9E,OAM5C8E,EAAQhD,OAAOO,OAAOrC,aApLS+lB"}