{"version":3,"file":"googlemaps.880e3c41.js","sources":["../../../node_modules/vue-google-maps-community-fork/src/utils/lazyValue.js","../../../node_modules/vue-google-maps-community-fork/src/utils/env.js","../../../node_modules/vue-google-maps-community-fork/src/utils/create-map-script.js","../../../node_modules/vue-google-maps-community-fork/src/load-google-maps.js","../../../node_modules/vue-google-maps-community-fork/src/utils/bindEvents.js","../../../node_modules/vue-google-maps-community-fork/src/utils/WatchPrimitiveProperties.js","../../../node_modules/vue-google-maps-community-fork/src/utils/string.js","../../../node_modules/vue-google-maps-community-fork/src/utils/bindProps.js","../../../node_modules/vue-google-maps-community-fork/src/components/mapElementMixin.js","../../../node_modules/vue-google-maps-community-fork/src/components/build-component.js","../../../node_modules/vue-google-maps-community-fork/src/components/polyline.js","../../../node_modules/vue-google-maps-community-fork/src/components/polygon.js","../../../node_modules/vue-google-maps-community-fork/src/components/circle.js","../../../node_modules/vue-google-maps-community-fork/src/components/rectangle.js","../../../node_modules/vue-google-maps-community-fork/src/components/marker.vue","../../../node_modules/fast-deep-equal/index.js","../../../node_modules/kdbush/index.js","../../../node_modules/supercluster/index.js","../../../node_modules/@googlemaps/markerclusterer/dist/index.esm.js","../../../node_modules/vue-google-maps-community-fork/src/components/cluster.vue","../../../node_modules/vue-google-maps-community-fork/src/components/infoWindow.vue","../../../node_modules/vue-google-maps-community-fork/src/utils/mountableMixin.js","../../../node_modules/vue-google-maps-community-fork/src/utils/TwoWayBindingWrapper.js","../../../node_modules/vue-google-maps-community-fork/src/components/map.vue","../../../node_modules/vue-google-maps-community-fork/src/components/heatmap.js","../../../node_modules/vue-google-maps-community-fork/src/utils/simulateArrowDown.js","../../../node_modules/vue-google-maps-community-fork/src/components/autocomplete.vue","../../../node_modules/vue-google-maps-community-fork/src/main.js","../../../src/boot/googlemaps.js"],"sourcesContent":["// lazy-value by sindresorhus\n\nexport default (fn) => {\n  let called = false\n  let result\n\n  return () => {\n    if (!called) {\n      called = true\n      result = fn()\n    }\n\n    return result\n  }\n}\n","export class Env {\n  static isServer() {\n    return typeof document === 'undefined'\n  }\n}\n","export function createMapScript(options) {\n  const googleMapScript = document.createElement('SCRIPT')\n  if (typeof options !== 'object') {\n    throw new Error('options should  be an object')\n  }\n\n  // libraries\n  /* eslint-disable no-prototype-builtins */\n  if (Array.prototype.isPrototypeOf(options.libraries)) {\n    options.libraries = options.libraries.join(',')\n  }\n  options['callback'] = 'vueGoogleMapsInit'\n  let baseUrl = 'https://maps.googleapis.com/maps/api/js?'\n\n  let url =\n    baseUrl +\n    Object.keys(options)\n      .map((key) => encodeURIComponent(key) + '=' + encodeURIComponent(options[key]))\n      .join('&')\n\n  googleMapScript.setAttribute('src', url)\n  googleMapScript.setAttribute('async', '')\n  googleMapScript.setAttribute('defer', '')\n\n  return googleMapScript\n}\n","import { Env } from './utils/env'\nimport { createMapScript } from './utils/create-map-script'\n\nlet isApiSetUp = false\nexport function loadGMapApi(options) {\n  if (Env.isServer()) {\n    return\n  }\n\n  if (!isApiSetUp) {\n    isApiSetUp = true\n    const googleMapScript = createMapScript(options)\n    document.head.appendChild(googleMapScript)\n  } else {\n    throw new Error('You already started the loading of google maps')\n  }\n}\n","export default (vueInst, googleMapsInst, events) => {\n  for (let eventName of events) {\n    const propName = `on${eventName.charAt(0).toUpperCase()}${eventName.slice(1)}`.replace(\n      /[-_]+(.)?/g,\n      (_, c) => (c ? c.toUpperCase() : '')\n    )\n\n    if (vueInst.$props[propName] || vueInst.$attrs[propName]) {\n      googleMapsInst.addListener(eventName, (ev) => {\n        vueInst.$emit(eventName, ev)\n      })\n    } else if (vueInst.$gmapOptions.autobindAllEvents || vueInst.$attrs[eventName]) {\n      googleMapsInst.addListener(eventName, (ev) => {\n        vueInst.$emit(eventName, ev)\n      })\n    }\n  }\n}\n","/**\n * Watch the individual properties of a PoD object, instead of the object\n * per se. This is different from a deep watch where both the reference\n * and the individual values are watched.\n *\n * In effect, it throttles the multiple $watch to execute at most once per tick.\n */\nexport default function WatchPrimitiveProperties(\n  vueInst,\n  propertiesToTrack,\n  handler,\n  immediate = false\n) {\n  let isHandled = false\n\n  function requestHandle() {\n    if (!isHandled) {\n      isHandled = true\n      vueInst.$nextTick(() => {\n        isHandled = false\n        handler()\n      })\n    }\n  }\n\n  for (let prop of propertiesToTrack) {\n    vueInst.$watch(prop, requestHandle, { immediate })\n  }\n}\n","export class Str {\n  static capitalizeFirstLetter(string) {\n    return string.charAt(0).toUpperCase() + string.slice(1)\n  }\n}\n","import WatchPrimitiveProperties from '../utils/WatchPrimitiveProperties'\nimport { Str } from './string'\n\nexport function getPropsValues(vueInst, props) {\n  return Object.keys(props).reduce((acc, prop) => {\n    if (vueInst[prop] !== undefined) {\n      acc[prop] = vueInst[prop]\n    }\n    return acc\n  }, {})\n}\n\n/**\n * Binds the properties defined in props to the google maps instance.\n * If the prop is an Object type, and we wish to track the properties\n * of the object (e.g. the lat and lng of a LatLng), then we do a deep\n * watch. For deep watch, we also prevent the _changed event from being\n * $emitted if the data source was external.\n */\nexport function bindProps(vueInst, googleMapsInst, props) {\n  for (let attribute in props) {\n    let { twoWay, type, trackProperties, noBind } = props[attribute]\n\n    if (noBind) continue\n\n    const setMethodName = 'set' + Str.capitalizeFirstLetter(attribute)\n    const getMethodName = 'get' + Str.capitalizeFirstLetter(attribute)\n    const eventName = attribute.toLowerCase() + '_changed'\n    const initialValue = vueInst[attribute]\n\n    if (typeof googleMapsInst[setMethodName] === 'undefined') {\n      throw new Error(\n        `${setMethodName} is not a method of (the Maps object corresponding to) ${vueInst.$options._componentTag}`\n      )\n    }\n\n    // We need to avoid an endless\n    // propChanged -> event $emitted -> propChanged -> event $emitted loop\n    // although this may really be the user's responsibility\n    if (type !== Object || !trackProperties) {\n      // Track the object deeply\n      vueInst.$watch(\n        attribute,\n        () => {\n          const attributeValue = vueInst[attribute]\n\n          googleMapsInst[setMethodName](attributeValue)\n        },\n        {\n          immediate: typeof initialValue !== 'undefined',\n          deep: type === Object,\n        }\n      )\n    } else {\n      WatchPrimitiveProperties(\n        vueInst,\n        trackProperties.map((prop) => `${attribute}.${prop}`),\n        () => {\n          googleMapsInst[setMethodName](vueInst[attribute])\n        },\n        vueInst[attribute] !== undefined\n      )\n    }\n\n    if (twoWay && (vueInst.$gmapOptions.autobindAllEvents || vueInst.$attrs[eventName])) {\n      googleMapsInst.addListener(eventName, () => {\n        // eslint-disable-line no-unused-vars\n        vueInst.$emit(eventName, googleMapsInst[getMethodName]())\n      })\n    }\n  }\n}\n","/**\n * @class MapElementMixin\n *\n * Extends components to include the following fields:\n *\n * @property $map        The Google map (valid only after the promise returns)\n *\n *\n * */\nexport default {\n  inject: {\n    $mapPromise: { default: 'abcdef' },\n  },\n\n  provide() {\n    // Note: although this mixin is not \"providing\" anything,\n    // components' expect the `$map` property to be present on the component.\n    // In order for that to happen, this mixin must intercept the $mapPromise\n    // .then(() =>) first before its component does so.\n    //\n    // Since a provide() on a mixin is executed before a provide() on the\n    // component, putting this code in provide() ensures that the $map is\n    // already set by the time the\n    // component's provide() is called.\n    this.$mapPromise.then((map) => {\n      this.$map = map\n    })\n\n    return {}\n  },\n}\n","import bindEvents from '../utils/bindEvents.js'\nimport { bindProps, getPropsValues } from '../utils/bindProps.js'\nimport MapElementMixin from './mapElementMixin'\n\n/**\n *\n * @param {Object} options\n * @param {Object} options.mappedProps - Definitions of props\n * @param {Object} options.mappedProps.PROP.type - Value type\n * @param {Boolean} options.mappedProps.PROP.twoWay\n *  - Whether the prop has a corresponding PROP_changed\n *   event\n * @param {Boolean} options.mappedProps.PROP.noBind\n *  - If true, do not apply the default bindProps / bindEvents.\n * However it will still be added to the list of component props\n * @param {Object} options.props - Regular Vue-style props.\n *  Note: must be in the Object form because it will be\n *  merged with the `mappedProps`\n *\n * @param {Object} options.events - Google Maps API events\n *  that are not bound to a corresponding prop\n * @param {String} options.name - e.g. `polyline`\n * @param {=> String} options.ctr - constructor, e.g.\n *  `google.maps.Polyline`. However, since this is not\n *  generally available during library load, this becomes\n *  a function instead, e.g. () => google.maps.Polyline\n *  which will be called only after the API has been loaded\n * @param {(MappedProps, OtherVueProps) => Array} options.ctrArgs -\n *   If the constructor in `ctr` needs to be called with\n *   arguments other than a single `options` object, e.g. for\n *   GroundOverlay, we call `new GroundOverlay(url, bounds, options)`\n *   then pass in a function that returns the argument list as an array\n *\n * Otherwise, the constructor will be called with an `options` object,\n *   with property and values merged from:\n *\n *   1. the `options` property, if any\n *   2. a `map` property with the Google Maps\n *   3. all the properties passed to the component in `mappedProps`\n * @param {Object => Any} options.beforeCreate -\n *  Hook to modify the options passed to the initializer\n * @param {(options.ctr, Object) => Any} options.afterCreate -\n *  Hook called when\n *\n */\nexport default function (options) {\n  const { mappedProps, name, ctr, ctrArgs, events, beforeCreate, afterCreate, props, ...rest } =\n    options\n\n  const promiseName = `$${name}Promise`\n  const instanceName = `$${name}Object`\n\n  assert(!(rest.props instanceof Array), '`props` should be an object, not Array')\n\n  return {\n    ...(typeof GENERATE_DOC !== 'undefined' ? { $vgmOptions: options } : {}),\n    mixins: [MapElementMixin],\n    props: {\n      ...props,\n      ...mappedPropsToVueProps(mappedProps),\n    },\n    render() {\n      return ''\n    },\n    provide() {\n      const promise = this.$mapPromise\n        .then((map) => {\n          // Infowindow needs this to be immediately available\n          this.$map = map\n\n          // Initialize the maps with the given options\n          const options = {\n            ...this.options,\n            map,\n            ...getPropsValues(this, mappedProps),\n          }\n          delete options.options // delete the extra options\n\n          if (beforeCreate) {\n            const result = beforeCreate.bind(this)(options)\n\n            if (result instanceof Promise) {\n              return result.then(() => ({ options }))\n            }\n          }\n          return { options }\n        })\n        .then(({ options }) => {\n          const ConstructorObject = ctr()\n          // https://stackoverflow.com/questions/1606797/use-of-apply-with-new-operator-is-this-possible\n          this[instanceName] = ctrArgs\n            ? new (Function.prototype.bind.call(\n                ConstructorObject,\n                null,\n                ...ctrArgs(options, getPropsValues(this, props || {}))\n              ))()\n            : new ConstructorObject(options)\n\n          bindProps(this, this[instanceName], mappedProps)\n          bindEvents(this, this[instanceName], events)\n\n          if (afterCreate) {\n            afterCreate.bind(this)(this[instanceName])\n          }\n          return this[instanceName]\n        })\n      this[promiseName] = promise\n      return { [promiseName]: promise }\n    },\n    unmounted() {\n      // Note: not all Google Maps components support maps\n      if (this[instanceName] && this[instanceName].setMap) {\n        this[instanceName].setMap(null)\n      }\n    },\n    ...rest,\n  }\n}\n\nfunction assert(v, message) {\n  if (!v) throw new Error(message)\n}\n\n/**\n * Strips out the extraneous properties we have in our\n * props definitions\n * @param {Object} props\n */\nexport function mappedPropsToVueProps(mappedProps) {\n  return Object.entries(mappedProps)\n    .map(([key, prop]) => {\n      const value = {}\n\n      if ('type' in prop) value.type = prop.type\n      if ('default' in prop) value.default = prop.default\n      if ('required' in prop) value.required = prop.required\n\n      return [key, value]\n    })\n    .reduce((acc, [key, val]) => {\n      acc[key] = val\n      return acc\n    }, {})\n}\n","import buildComponent from './build-component.js'\n\nconst props = {\n  draggable: {\n    type: Boolean,\n  },\n  editable: {\n    type: Boolean,\n  },\n  options: {\n    twoWay: false,\n    type: Object,\n  },\n  path: {\n    type: Array,\n    twoWay: true,\n  },\n}\n\nconst events = [\n  'click',\n  'dblclick',\n  'drag',\n  'dragend',\n  'dragstart',\n  'mousedown',\n  'mousemove',\n  'mouseout',\n  'mouseover',\n  'mouseup',\n  'rightclick',\n]\n\nexport default buildComponent({\n  mappedProps: props,\n  props: {\n    deepWatch: {\n      type: Boolean,\n      default: false,\n    },\n  },\n  events,\n\n  name: 'polyline',\n  ctr: () => google.maps.Polyline,\n  emits: events,\n  afterCreate(inst) {\n    let clearEvents = () => {}\n\n    events.forEach((event) => {\n      inst.addListener(event, (payload) => {\n        this.$emit(event, payload)\n      })\n    })\n\n    this.$watch(\n      'path',\n      (path) => {\n        if (path) {\n          clearEvents()\n\n          this.$polylineObject.setPath(path)\n\n          const mvcPath = this.$polylineObject.getPath()\n          const eventListeners = []\n\n          const updatePaths = () => {\n            this.$emit('path_changed', this.$polylineObject.getPath())\n          }\n\n          eventListeners.push([mvcPath, mvcPath.addListener('insert_at', updatePaths)])\n          eventListeners.push([mvcPath, mvcPath.addListener('remove_at', updatePaths)])\n          eventListeners.push([mvcPath, mvcPath.addListener('set_at', updatePaths)])\n\n          clearEvents = () => {\n            eventListeners.map(\n              (\n                [obj, listenerHandle] // eslint-disable-line no-unused-vars\n              ) => google.maps.event.removeListener(listenerHandle)\n            )\n          }\n        }\n      },\n      {\n        deep: this.deepWatch,\n        immediate: true,\n      }\n    )\n  },\n})\n","import buildComponent from './build-component.js'\n\nconst props = {\n  draggable: {\n    type: Boolean,\n  },\n  editable: {\n    type: Boolean,\n  },\n  options: {\n    type: Object,\n  },\n  path: {\n    type: Array,\n    twoWay: true,\n    noBind: true,\n  },\n  paths: {\n    type: Array,\n    twoWay: true,\n    noBind: true,\n  },\n}\n\nconst events = [\n  'click',\n  'dblclick',\n  'drag',\n  'dragend',\n  'dragstart',\n  'mousedown',\n  'mousemove',\n  'mouseout',\n  'mouseover',\n  'mouseup',\n  'rightclick',\n  'paths_changed',\n]\n\nexport default buildComponent({\n  props: {\n    deepWatch: {\n      type: Boolean,\n      default: false,\n    },\n  },\n  events,\n  mappedProps: props,\n  name: 'polygon',\n  ctr: () => google.maps.Polygon,\n  emits: events,\n  beforeCreate(options) {\n    if (!options.path) delete options.path\n    if (!options.paths) delete options.paths\n  },\n\n  afterCreate(inst) {\n    let clearEvents = () => {}\n    events.forEach((event) => {\n      inst.addListener(event, (payload) => {\n        this.$emit(event, payload)\n      })\n    })\n\n    // Watch paths, on our own, because we do not want to set either when it is\n    // empty\n    this.$watch(\n      'paths',\n      (paths) => {\n        if (paths) {\n          clearEvents()\n\n          inst.setPaths(paths)\n\n          const updatePaths = () => {\n            this.$emit('paths_changed', inst.getPaths())\n          }\n          const eventListeners = []\n\n          const mvcArray = inst.getPaths()\n          for (let i = 0; i < mvcArray.getLength(); i++) {\n            let mvcPath = mvcArray.getAt(i)\n            eventListeners.push([mvcPath, mvcPath.addListener('insert_at', updatePaths)])\n            eventListeners.push([mvcPath, mvcPath.addListener('remove_at', updatePaths)])\n            eventListeners.push([mvcPath, mvcPath.addListener('set_at', updatePaths)])\n          }\n          eventListeners.push([mvcArray, mvcArray.addListener('insert_at', updatePaths)])\n          eventListeners.push([mvcArray, mvcArray.addListener('remove_at', updatePaths)])\n          eventListeners.push([mvcArray, mvcArray.addListener('set_at', updatePaths)])\n\n          clearEvents = () => {\n            eventListeners.map(\n              (\n                [obj, listenerHandle] // eslint-disable-line no-unused-vars\n              ) => google.maps.event.removeListener(listenerHandle)\n            )\n          }\n        }\n      },\n      {\n        deep: this.deepWatch,\n        immediate: true,\n      }\n    )\n\n    this.$watch(\n      'path',\n      (path) => {\n        if (path) {\n          clearEvents()\n\n          inst.setPaths(path)\n\n          const mvcPath = inst.getPath()\n          const eventListeners = []\n\n          const updatePaths = () => {\n            this.$emit('path_changed', inst.getPath())\n          }\n\n          eventListeners.push([mvcPath, mvcPath.addListener('insert_at', updatePaths)])\n          eventListeners.push([mvcPath, mvcPath.addListener('remove_at', updatePaths)])\n          eventListeners.push([mvcPath, mvcPath.addListener('set_at', updatePaths)])\n\n          clearEvents = () => {\n            eventListeners.map(\n              (\n                [obj, listenerHandle] // eslint-disable-line no-unused-vars\n              ) => google.maps.event.removeListener(listenerHandle)\n            )\n          }\n        }\n      },\n      {\n        deep: this.deepWatch,\n        immediate: true,\n      }\n    )\n  },\n})\n","import buildComponent from './build-component'\n\nconst props = {\n  center: {\n    type: Object,\n    twoWay: true,\n    required: true,\n  },\n  radius: {\n    type: Number,\n    twoWay: true,\n  },\n  draggable: {\n    type: Boolean,\n    default: false,\n  },\n  editable: {\n    type: Boolean,\n    default: false,\n  },\n  options: {\n    type: Object,\n    twoWay: false,\n  },\n}\n\nconst events = [\n  'click',\n  'dblclick',\n  'drag',\n  'dragend',\n  'dragstart',\n  'mousedown',\n  'mousemove',\n  'mouseout',\n  'mouseover',\n  'mouseup',\n  'rightclick',\n]\n\nexport default buildComponent({\n  mappedProps: props,\n  name: 'circle',\n  ctr: () => google.maps.Circle,\n  events,\n  emits: events,\n  afterCreate(inst) {\n    events.forEach((event) => {\n      inst.addListener(event, (payload) => {\n        this.$emit(event, payload)\n      })\n    })\n  },\n})\n","import buildComponent from './build-component.js'\n\nconst props = {\n  bounds: {\n    type: Object,\n    twoWay: true,\n  },\n  draggable: {\n    type: Boolean,\n    default: false,\n  },\n  editable: {\n    type: Boolean,\n    default: false,\n  },\n  options: {\n    type: Object,\n    twoWay: false,\n  },\n}\n\nconst events = [\n  'click',\n  'dblclick',\n  'drag',\n  'dragend',\n  'dragstart',\n  'mousedown',\n  'mousemove',\n  'mouseout',\n  'mouseover',\n  'mouseup',\n  'rightclick',\n]\n\nexport default buildComponent({\n  mappedProps: props,\n  name: 'rectangle',\n  ctr: () => google.maps.Rectangle,\n  events,\n  emits: events,\n  afterCreate(inst) {\n    events.forEach((event) => {\n      inst.addListener(event, (payload) => {\n        this.$emit(event, payload)\n      })\n    })\n  },\n})\n","<template>\n  <div\n    @click=\"\n      () => {\n        console.log('sdfsd')\n      }\n    \"\n  >\n    <slot></slot>\n  </div>\n</template>\n<script>\nimport buildComponent from './build-component.js'\n\nconst props = {\n  animation: {\n    twoWay: true,\n    type: Number,\n  },\n  attribution: {\n    type: Object,\n  },\n  clickable: {\n    type: Boolean,\n    twoWay: true,\n    default: true,\n  },\n  cursor: {\n    type: String,\n    twoWay: true,\n  },\n  draggable: {\n    type: Boolean,\n    twoWay: true,\n    default: false,\n  },\n  icon: {\n    twoWay: true,\n  },\n  label: {},\n  opacity: {\n    type: Number,\n    default: 1,\n  },\n  options: {\n    type: Object,\n  },\n  place: {\n    type: Object,\n  },\n  position: {\n    type: Object,\n    twoWay: true,\n  },\n  shape: {\n    type: Object,\n    twoWay: true,\n  },\n  title: {\n    type: String,\n    twoWay: true,\n  },\n  zIndex: {\n    type: Number,\n    twoWay: true,\n  },\n  visible: {\n    twoWay: true,\n    default: true,\n  },\n}\n\nconst events = [\n  'click',\n  'rightclick',\n  'dblclick',\n  'drag',\n  'dragstart',\n  'dragend',\n  'mouseup',\n  'mousedown',\n  'mouseover',\n  'mouseout',\n]\n\nexport default buildComponent({\n  mappedProps: props,\n  events,\n  name: 'marker',\n  ctr: () => google.maps.Marker,\n\n  inject: {\n    $clusterPromise: {\n      default: null,\n    },\n  },\n  emits: events,\n  unmounted() {\n    if (!this.$markerObject) {\n      return\n    }\n\n    if (this.$clusterObject) {\n      // Repaint will be performed in `updated()` of cluster\n      this.$clusterObject.removeMarker(this.$markerObject, true)\n    } else {\n      this.$markerObject.setMap(null)\n    }\n  },\n\n  beforeCreate(options) {\n    if (this.$clusterPromise) {\n      options.map = null\n    }\n\n    return this.$clusterPromise\n  },\n\n  afterCreate(inst) {\n    events.forEach((event) => {\n      inst.addListener(event, (payload) => {\n        this.$emit(event, payload)\n      })\n    })\n    if (this.$clusterPromise) {\n      this.$clusterPromise.then((co) => {\n        this.$clusterObject = co\n        co.addMarker(inst)\n      })\n    }\n  },\n})\n</script>\n","'use strict';\n\n// do not edit .js files directly - edit src/index.jst\n\n\n\nmodule.exports = function equal(a, b) {\n  if (a === b) return true;\n\n  if (a && b && typeof a == 'object' && typeof b == 'object') {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0;)\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n\n    for (i = length; i-- !== 0;) {\n      var key = keys[i];\n\n      if (!equal(a[key], b[key])) return false;\n    }\n\n    return true;\n  }\n\n  // true if both NaN, false otherwise\n  return a!==a && b!==b;\n};\n","\nconst ARRAY_TYPES = [\n    Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array,\n    Int32Array, Uint32Array, Float32Array, Float64Array\n];\n\n/** @typedef {Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor} TypedArrayConstructor */\n\nconst VERSION = 1; // serialized format version\nconst HEADER_SIZE = 8;\n\nexport default class KDBush {\n\n    /**\n     * Creates an index from raw `ArrayBuffer` data.\n     * @param {ArrayBuffer} data\n     */\n    static from(data) {\n        if (!(data instanceof ArrayBuffer)) {\n            throw new Error('Data must be an instance of ArrayBuffer.');\n        }\n        const [magic, versionAndType] = new Uint8Array(data, 0, 2);\n        if (magic !== 0xdb) {\n            throw new Error('Data does not appear to be in a KDBush format.');\n        }\n        const version = versionAndType >> 4;\n        if (version !== VERSION) {\n            throw new Error(`Got v${version} data when expected v${VERSION}.`);\n        }\n        const ArrayType = ARRAY_TYPES[versionAndType & 0x0f];\n        if (!ArrayType) {\n            throw new Error('Unrecognized array type.');\n        }\n        const [nodeSize] = new Uint16Array(data, 2, 1);\n        const [numItems] = new Uint32Array(data, 4, 1);\n\n        return new KDBush(numItems, nodeSize, ArrayType, data);\n    }\n\n    /**\n     * Creates an index that will hold a given number of items.\n     * @param {number} numItems\n     * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).\n     * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).\n     * @param {ArrayBuffer} [data] (For internal use only)\n     */\n    constructor(numItems, nodeSize = 64, ArrayType = Float64Array, data) {\n        if (isNaN(numItems) || numItems < 0) throw new Error(`Unpexpected numItems value: ${numItems}.`);\n\n        this.numItems = +numItems;\n        this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);\n        this.ArrayType = ArrayType;\n        this.IndexArrayType = numItems < 65536 ? Uint16Array : Uint32Array;\n\n        const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);\n        const coordsByteSize = numItems * 2 * this.ArrayType.BYTES_PER_ELEMENT;\n        const idsByteSize = numItems * this.IndexArrayType.BYTES_PER_ELEMENT;\n        const padCoords = (8 - idsByteSize % 8) % 8;\n\n        if (arrayTypeIndex < 0) {\n            throw new Error(`Unexpected typed array class: ${ArrayType}.`);\n        }\n\n        if (data && (data instanceof ArrayBuffer)) { // reconstruct an index from a buffer\n            this.data = data;\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = numItems * 2;\n            this._finished = true;\n        } else { // initialize a new index\n            this.data = new ArrayBuffer(HEADER_SIZE + coordsByteSize + idsByteSize + padCoords);\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = 0;\n            this._finished = false;\n\n            // set header\n            new Uint8Array(this.data, 0, 2).set([0xdb, (VERSION << 4) + arrayTypeIndex]);\n            new Uint16Array(this.data, 2, 1)[0] = nodeSize;\n            new Uint32Array(this.data, 4, 1)[0] = numItems;\n        }\n    }\n\n    /**\n     * Add a point to the index.\n     * @param {number} x\n     * @param {number} y\n     * @returns {number} An incremental index associated with the added item (starting from `0`).\n     */\n    add(x, y) {\n        const index = this._pos >> 1;\n        this.ids[index] = index;\n        this.coords[this._pos++] = x;\n        this.coords[this._pos++] = y;\n        return index;\n    }\n\n    /**\n     * Perform indexing of the added points.\n     */\n    finish() {\n        const numAdded = this._pos >> 1;\n        if (numAdded !== this.numItems) {\n            throw new Error(`Added ${numAdded} items when expected ${this.numItems}.`);\n        }\n        // kd-sort both arrays for efficient search\n        sort(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0);\n\n        this._finished = true;\n        return this;\n    }\n\n    /**\n     * Search the index for items within a given bounding box.\n     * @param {number} minX\n     * @param {number} minY\n     * @param {number} maxX\n     * @param {number} maxY\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    range(minX, minY, maxX, maxY) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n\n        // recursively search for items in range in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    const x = coords[2 * i];\n                    const 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            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? minX <= x : minY <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? maxX >= x : maxY >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Search the index for items within a given radius.\n     * @param {number} qx\n     * @param {number} qy\n     * @param {number} r Query radius.\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    within(qx, qy, r) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n        const r2 = r * r;\n\n        // recursively search for items within radius in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let 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            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (sqDist(x, y, qx, qy) <= r2) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? qx - r <= x : qy - r <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? qx + r >= x : qy + r >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} nodeSize\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction sort(ids, coords, nodeSize, left, right, axis) {\n    if (right - left <= nodeSize) return;\n\n    const m = (left + right) >> 1; // middle index\n\n    // sort ids and coords around the middle index so that the halves lie\n    // either left/right or top/bottom correspondingly (taking turns)\n    select(ids, coords, m, left, right, axis);\n\n    // recursively kd-sort first half and second half on the opposite axis\n    sort(ids, coords, nodeSize, left, m - 1, 1 - axis);\n    sort(ids, coords, nodeSize, m + 1, right, 1 - axis);\n}\n\n/**\n * Custom Floyd-Rivest selection algorithm: sort ids and coords so that\n * [left..k-1] items are smaller than k-th item (on either x or y axis)\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} k\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction select(ids, coords, k, left, right, axis) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            const n = right - left + 1;\n            const m = k - left + 1;\n            const z = Math.log(n);\n            const s = 0.5 * Math.exp(2 * z / 3);\n            const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            select(ids, coords, k, newLeft, newRight, axis);\n        }\n\n        const t = coords[2 * k + axis];\n        let i = left;\n        let j = right;\n\n        swapItem(ids, coords, left, k);\n        if (coords[2 * right + axis] > 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 + axis] < t) i++;\n            while (coords[2 * j + axis] > t) j--;\n        }\n\n        if (coords[2 * left + axis] === 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\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} i\n * @param {number} j\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\n/**\n * @param {InstanceType<TypedArrayConstructor>} arr\n * @param {number} i\n * @param {number} j\n */\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\n/**\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n */\nfunction sqDist(ax, ay, bx, by) {\n    const dx = ax - bx;\n    const dy = ay - by;\n    return dx * dx + dy * dy;\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\nconst OFFSET_ZOOM = 2;\nconst OFFSET_ID = 3;\nconst OFFSET_PARENT = 4;\nconst OFFSET_NUM = 5;\nconst OFFSET_PROP = 6;\n\nexport default class Supercluster {\n    constructor(options) {\n        this.options = Object.assign(Object.create(defaultOptions), options);\n        this.trees = new Array(this.options.maxZoom + 1);\n        this.stride = this.options.reduce ? 7 : 6;\n        this.clusterProps = [];\n    }\n\n    load(points) {\n        const {log, minZoom, maxZoom} = 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        const data = [];\n\n        for (let i = 0; i < points.length; i++) {\n            const p = points[i];\n            if (!p.geometry) continue;\n\n            const [lng, lat] = p.geometry.coordinates;\n            const x = fround(lngX(lng));\n            const y = fround(latY(lat));\n            // store internal point/cluster data in flat numeric arrays for performance\n            data.push(\n                x, y, // projected point coordinates\n                Infinity, // the last zoom the point was processed at\n                i, // index of the source feature in the original input array\n                -1, // parent cluster id\n                1 // number of points in a cluster\n            );\n            if (this.options.reduce) data.push(0); // noop\n        }\n        let tree = this.trees[maxZoom + 1] = this._createTree(data);\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            tree = this.trees[z] = this._createTree(this._cluster(tree, z));\n\n            if (log) console.log('z%d: %d clusters in %dms', z, tree.numItems, +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 data = tree.data;\n        const clusters = [];\n        for (const id of ids) {\n            const k = this.stride * id;\n            clusters.push(data[k + OFFSET_NUM] > 1 ? getClusterJSON(data, k, this.clusterProps) : this.points[data[k + OFFSET_ID]]);\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 tree = this.trees[originZoom];\n        if (!tree) throw new Error(errorMsg);\n\n        const data = tree.data;\n        if (originId * this.stride >= data.length) throw new Error(errorMsg);\n\n        const r = this.options.radius / (this.options.extent * Math.pow(2, originZoom - 1));\n        const x = data[originId * this.stride];\n        const y = data[originId * this.stride + 1];\n        const ids = tree.within(x, y, r);\n        const children = [];\n        for (const id of ids) {\n            const k = id * this.stride;\n            if (data[k + OFFSET_PARENT] === clusterId) {\n                children.push(data[k + OFFSET_NUM] > 1 ? getClusterJSON(data, k, this.clusterProps) : this.points[data[k + OFFSET_ID]]);\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.data, x, y, z2, tile);\n\n        if (x === 0) {\n            this._addTileFeatures(\n                tree.range(1 - p / z2, top, 1, bottom),\n                tree.data, z2, y, z2, tile);\n        }\n        if (x === z2 - 1) {\n            this._addTileFeatures(\n                tree.range(0, top, p / z2, bottom),\n                tree.data, -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    _createTree(data) {\n        const tree = new KDBush(data.length / this.stride | 0, this.options.nodeSize, Float32Array);\n        for (let i = 0; i < data.length; i += this.stride) tree.add(data[i], data[i + 1]);\n        tree.finish();\n        tree.data = data;\n        return tree;\n    }\n\n    _addTileFeatures(ids, data, x, y, z2, tile) {\n        for (const i of ids) {\n            const k = i * this.stride;\n            const isCluster = data[k + OFFSET_NUM] > 1;\n\n            let tags, px, py;\n            if (isCluster) {\n                tags = getClusterProperties(data, k, this.clusterProps);\n                px = data[k];\n                py = data[k + 1];\n            } else {\n                const p = this.points[data[k + OFFSET_ID]];\n                tags = p.properties;\n                const [lng, lat] = p.geometry.coordinates;\n                px = lngX(lng);\n                py = latY(lat);\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 || this.options.generateId) {\n                // optionally generate id for points\n                id = data[k + OFFSET_ID];\n            } else {\n                // keep id if already assigned\n                id = this.points[data[k + OFFSET_ID]].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(Math.floor(+z), this.options.maxZoom + 1));\n    }\n\n    _cluster(tree, zoom) {\n        const {radius, extent, reduce, minPoints} = this.options;\n        const r = radius / (extent * Math.pow(2, zoom));\n        const data = tree.data;\n        const nextData = [];\n        const stride = this.stride;\n\n        // loop through each point\n        for (let i = 0; i < data.length; i += stride) {\n            // if we've already visited the point at this zoom level, skip it\n            if (data[i + OFFSET_ZOOM] <= zoom) continue;\n            data[i + OFFSET_ZOOM] = zoom;\n\n            // find all nearby points\n            const x = data[i];\n            const y = data[i + 1];\n            const neighborIds = tree.within(data[i], data[i + 1], r);\n\n            const numPointsOrigin = data[i + OFFSET_NUM];\n            let numPoints = numPointsOrigin;\n\n            // count the number of points in a potential cluster\n            for (const neighborId of neighborIds) {\n                const k = neighborId * stride;\n                // filter out neighbors that are already processed\n                if (data[k + OFFSET_ZOOM] > zoom) numPoints += data[k + OFFSET_NUM];\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 = x * numPointsOrigin;\n                let wy = y * numPointsOrigin;\n\n                let clusterProperties;\n                let clusterPropIndex = -1;\n\n                // encode both zoom and point index on which the cluster originated -- offset by total length of features\n                const id = ((i / stride | 0) << 5) + (zoom + 1) + this.points.length;\n\n                for (const neighborId of neighborIds) {\n                    const k = neighborId * stride;\n\n                    if (data[k + OFFSET_ZOOM] <= zoom) continue;\n                    data[k + OFFSET_ZOOM] = zoom; // save the zoom (so it doesn't get processed twice)\n\n                    const numPoints2 = data[k + OFFSET_NUM];\n                    wx += data[k] * numPoints2; // accumulate coordinates for calculating weighted center\n                    wy += data[k + 1] * numPoints2;\n\n                    data[k + OFFSET_PARENT] = id;\n\n                    if (reduce) {\n                        if (!clusterProperties) {\n                            clusterProperties = this._map(data, i, true);\n                            clusterPropIndex = this.clusterProps.length;\n                            this.clusterProps.push(clusterProperties);\n                        }\n                        reduce(clusterProperties, this._map(data, k));\n                    }\n                }\n\n                data[i + OFFSET_PARENT] = id;\n                nextData.push(wx / numPoints, wy / numPoints, Infinity, id, -1, numPoints);\n                if (reduce) nextData.push(clusterPropIndex);\n\n            } else { // left points as unclustered\n                for (let j = 0; j < stride; j++) nextData.push(data[i + j]);\n\n                if (numPoints > 1) {\n                    for (const neighborId of neighborIds) {\n                        const k = neighborId * stride;\n                        if (data[k + OFFSET_ZOOM] <= zoom) continue;\n                        data[k + OFFSET_ZOOM] = zoom;\n                        for (let j = 0; j < stride; j++) nextData.push(data[k + j]);\n                    }\n                }\n            }\n        }\n\n        return nextData;\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(data, i, clone) {\n        if (data[i + OFFSET_NUM] > 1) {\n            const props = this.clusterProps[data[i + OFFSET_PROP]];\n            return clone ? Object.assign({}, props) : props;\n        }\n        const original = this.points[data[i + OFFSET_ID]].properties;\n        const result = this.options.map(original);\n        return clone && result === original ? Object.assign({}, result) : result;\n    }\n}\n\nfunction getClusterJSON(data, i, clusterProps) {\n    return {\n        type: 'Feature',\n        id: data[i + OFFSET_ID],\n        properties: getClusterProperties(data, i, clusterProps),\n        geometry: {\n            type: 'Point',\n            coordinates: [xLng(data[i]), yLat(data[i + 1])]\n        }\n    };\n}\n\nfunction getClusterProperties(data, i, clusterProps) {\n    const count = data[i + OFFSET_NUM];\n    const abbrev =\n        count >= 10000 ? `${Math.round(count / 1000)  }k` :\n        count >= 1000 ? `${Math.round(count / 100) / 10  }k` : count;\n    const propIndex = data[i + OFFSET_PROP];\n    const properties = propIndex === -1 ? {} : Object.assign({}, clusterProps[propIndex]);\n    return Object.assign(properties, {\n        cluster: true,\n        cluster_id: data[i + OFFSET_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","import equal from 'fast-deep-equal';\nimport SuperCluster from 'supercluster';\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\r\nfunction __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}\n\n/**\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * util class that creates a common set of convenience functions to wrap\n * shared behavior of Advanced Markers and Markers.\n */\nclass MarkerUtils {\n    static isAdvancedMarkerAvailable(map) {\n        return (google.maps.marker &&\n            map.getMapCapabilities().isAdvancedMarkersAvailable === true);\n    }\n    static isAdvancedMarker(marker) {\n        return (google.maps.marker &&\n            marker instanceof google.maps.marker.AdvancedMarkerElement);\n    }\n    static setMap(marker, map) {\n        if (this.isAdvancedMarker(marker)) {\n            marker.map = map;\n        }\n        else {\n            marker.setMap(map);\n        }\n    }\n    static getPosition(marker) {\n        // SuperClusterAlgorithm.calculate expects a LatLng instance so we fake it for Adv Markers\n        if (this.isAdvancedMarker(marker)) {\n            if (marker.position) {\n                if (marker.position instanceof google.maps.LatLng) {\n                    return marker.position;\n                }\n                // since we can't cast to LatLngLiteral for reasons =(\n                if (marker.position.lat && marker.position.lng) {\n                    return new google.maps.LatLng(marker.position.lat, marker.position.lng);\n                }\n            }\n            return new google.maps.LatLng(null);\n        }\n        return marker.getPosition();\n    }\n    static getVisible(marker) {\n        if (this.isAdvancedMarker(marker)) {\n            /**\n             * Always return true for Advanced Markers because the clusterer\n             * uses getVisible as a way to count legacy markers not as an actual\n             * indicator of visibility for some reason. Even when markers are hidden\n             * Marker.getVisible returns `true` and this is used to set the marker count\n             * on the cluster. See the behavior of Cluster.count\n             */\n            return true;\n        }\n        return marker.getVisible();\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass Cluster {\n    constructor({ markers, position }) {\n        this.markers = markers;\n        if (position) {\n            if (position instanceof google.maps.LatLng) {\n                this._position = position;\n            }\n            else {\n                this._position = new google.maps.LatLng(position);\n            }\n        }\n    }\n    get bounds() {\n        if (this.markers.length === 0 && !this._position) {\n            return;\n        }\n        const bounds = new google.maps.LatLngBounds(this._position, this._position);\n        for (const marker of this.markers) {\n            bounds.extend(MarkerUtils.getPosition(marker));\n        }\n        return bounds;\n    }\n    get position() {\n        return this._position || this.bounds.getCenter();\n    }\n    /**\n     * Get the count of **visible** markers.\n     */\n    get count() {\n        return this.markers.filter((m) => MarkerUtils.getVisible(m)).length;\n    }\n    /**\n     * Add a marker to the cluster.\n     */\n    push(marker) {\n        this.markers.push(marker);\n    }\n    /**\n     * Cleanup references and remove marker from map.\n     */\n    delete() {\n        if (this.marker) {\n            MarkerUtils.setMap(this.marker, null);\n            this.marker = undefined;\n        }\n        this.markers.length = 0;\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Returns the markers visible in a padded map viewport\n *\n * @param map\n * @param mapCanvasProjection\n * @param markers The list of marker to filter\n * @param viewportPaddingPixels The padding in pixel\n * @returns The list of markers in the padded viewport\n */\nconst filterMarkersToPaddedViewport = (map, mapCanvasProjection, markers, viewportPaddingPixels) => {\n    const extendedMapBounds = extendBoundsToPaddedViewport(map.getBounds(), mapCanvasProjection, viewportPaddingPixels);\n    return markers.filter((marker) => extendedMapBounds.contains(MarkerUtils.getPosition(marker)));\n};\n/**\n * Extends a bounds by a number of pixels in each direction\n */\nconst extendBoundsToPaddedViewport = (bounds, projection, numPixels) => {\n    const { northEast, southWest } = latLngBoundsToPixelBounds(bounds, projection);\n    const extendedPixelBounds = extendPixelBounds({ northEast, southWest }, numPixels);\n    return pixelBoundsToLatLngBounds(extendedPixelBounds, projection);\n};\n/**\n * Gets the extended bounds as a bbox [westLng, southLat, eastLng, northLat]\n */\nconst getPaddedViewport = (bounds, projection, pixels) => {\n    const extended = extendBoundsToPaddedViewport(bounds, projection, pixels);\n    const ne = extended.getNorthEast();\n    const sw = extended.getSouthWest();\n    return [sw.lng(), sw.lat(), ne.lng(), ne.lat()];\n};\n/**\n * Returns the distance between 2 positions.\n *\n * @hidden\n */\nconst distanceBetweenPoints = (p1, p2) => {\n    const R = 6371; // Radius of the Earth in km\n    const dLat = ((p2.lat - p1.lat) * Math.PI) / 180;\n    const dLon = ((p2.lng - p1.lng) * Math.PI) / 180;\n    const sinDLat = Math.sin(dLat / 2);\n    const sinDLon = Math.sin(dLon / 2);\n    const a = sinDLat * sinDLat +\n        Math.cos((p1.lat * Math.PI) / 180) *\n            Math.cos((p2.lat * Math.PI) / 180) *\n            sinDLon *\n            sinDLon;\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n    return R * c;\n};\n/**\n * Converts a LatLng bound to pixels.\n *\n * @hidden\n */\nconst latLngBoundsToPixelBounds = (bounds, projection) => {\n    return {\n        northEast: projection.fromLatLngToDivPixel(bounds.getNorthEast()),\n        southWest: projection.fromLatLngToDivPixel(bounds.getSouthWest()),\n    };\n};\n/**\n * Extends a pixel bounds by numPixels in all directions.\n *\n * @hidden\n */\nconst extendPixelBounds = ({ northEast, southWest }, numPixels) => {\n    northEast.x += numPixels;\n    northEast.y -= numPixels;\n    southWest.x -= numPixels;\n    southWest.y += numPixels;\n    return { northEast, southWest };\n};\n/**\n * @hidden\n */\nconst pixelBoundsToLatLngBounds = ({ northEast, southWest }, projection) => {\n    const sw = projection.fromDivPixelToLatLng(southWest);\n    const ne = projection.fromDivPixelToLatLng(northEast);\n    return new google.maps.LatLngBounds(sw, ne);\n};\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @hidden\n */\nclass AbstractAlgorithm {\n    constructor({ maxZoom = 16 }) {\n        this.maxZoom = maxZoom;\n    }\n    /**\n     * Helper function to bypass clustering based upon some map state such as\n     * zoom, number of markers, etc.\n     *\n     * ```typescript\n     *  cluster({markers, map}: AlgorithmInput): Cluster[] {\n     *    if (shouldBypassClustering(map)) {\n     *      return this.noop({markers})\n     *    }\n     * }\n     * ```\n     */\n    noop({ markers, }) {\n        return noop(markers);\n    }\n}\n/**\n * Abstract viewport algorithm proves a class to filter markers by a padded\n * viewport. This is a common optimization.\n *\n * @hidden\n */\nclass AbstractViewportAlgorithm extends AbstractAlgorithm {\n    constructor(_a) {\n        var { viewportPadding = 60 } = _a, options = __rest(_a, [\"viewportPadding\"]);\n        super(options);\n        this.viewportPadding = 60;\n        this.viewportPadding = viewportPadding;\n    }\n    calculate({ markers, map, mapCanvasProjection, }) {\n        if (map.getZoom() >= this.maxZoom) {\n            return {\n                clusters: this.noop({\n                    markers,\n                }),\n                changed: false,\n            };\n        }\n        return {\n            clusters: this.cluster({\n                markers: filterMarkersToPaddedViewport(map, mapCanvasProjection, markers, this.viewportPadding),\n                map,\n                mapCanvasProjection,\n            }),\n        };\n    }\n}\n/**\n * @hidden\n */\nconst noop = (markers) => {\n    const clusters = markers.map((marker) => new Cluster({\n        position: MarkerUtils.getPosition(marker),\n        markers: [marker],\n    }));\n    return clusters;\n};\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * The default Grid algorithm historically used in Google Maps marker\n * clustering.\n *\n * The Grid algorithm does not implement caching and markers may flash as the\n * viewport changes. Instead use {@link SuperClusterAlgorithm}.\n */\nclass GridAlgorithm extends AbstractViewportAlgorithm {\n    constructor(_a) {\n        var { maxDistance = 40000, gridSize = 40 } = _a, options = __rest(_a, [\"maxDistance\", \"gridSize\"]);\n        super(options);\n        this.clusters = [];\n        this.state = { zoom: -1 };\n        this.maxDistance = maxDistance;\n        this.gridSize = gridSize;\n    }\n    calculate({ markers, map, mapCanvasProjection, }) {\n        const state = { zoom: map.getZoom() };\n        let changed = false;\n        if (this.state.zoom >= this.maxZoom && state.zoom >= this.maxZoom) ;\n        else {\n            changed = !equal(this.state, state);\n        }\n        this.state = state;\n        if (map.getZoom() >= this.maxZoom) {\n            return {\n                clusters: this.noop({\n                    markers,\n                }),\n                changed,\n            };\n        }\n        return {\n            clusters: this.cluster({\n                markers: filterMarkersToPaddedViewport(map, mapCanvasProjection, markers, this.viewportPadding),\n                map,\n                mapCanvasProjection,\n            }),\n        };\n    }\n    cluster({ markers, map, mapCanvasProjection, }) {\n        this.clusters = [];\n        markers.forEach((marker) => {\n            this.addToClosestCluster(marker, map, mapCanvasProjection);\n        });\n        return this.clusters;\n    }\n    addToClosestCluster(marker, map, projection) {\n        let maxDistance = this.maxDistance; // Some large number\n        let cluster = null;\n        for (let i = 0; i < this.clusters.length; i++) {\n            const candidate = this.clusters[i];\n            const distance = distanceBetweenPoints(candidate.bounds.getCenter().toJSON(), MarkerUtils.getPosition(marker).toJSON());\n            if (distance < maxDistance) {\n                maxDistance = distance;\n                cluster = candidate;\n            }\n        }\n        if (cluster &&\n            extendBoundsToPaddedViewport(cluster.bounds, projection, this.gridSize).contains(MarkerUtils.getPosition(marker))) {\n            cluster.push(marker);\n        }\n        else {\n            const cluster = new Cluster({ markers: [marker] });\n            this.clusters.push(cluster);\n        }\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Noop algorithm does not generate any clusters or filter markers by the an extended viewport.\n */\nclass NoopAlgorithm extends AbstractAlgorithm {\n    constructor(_a) {\n        var options = __rest(_a, []);\n        super(options);\n    }\n    calculate({ markers, map, mapCanvasProjection, }) {\n        return {\n            clusters: this.cluster({ markers, map, mapCanvasProjection }),\n            changed: false,\n        };\n    }\n    cluster(input) {\n        return this.noop(input);\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A very fast JavaScript algorithm for geospatial point clustering using KD trees.\n *\n * @see https://www.npmjs.com/package/supercluster for more information on options.\n */\nclass SuperClusterAlgorithm extends AbstractAlgorithm {\n    constructor(_a) {\n        var { maxZoom, radius = 60 } = _a, options = __rest(_a, [\"maxZoom\", \"radius\"]);\n        super({ maxZoom });\n        this.state = { zoom: -1 };\n        this.superCluster = new SuperCluster(Object.assign({ maxZoom: this.maxZoom, radius }, options));\n    }\n    calculate(input) {\n        let changed = false;\n        const state = { zoom: input.map.getZoom() };\n        if (!equal(input.markers, this.markers)) {\n            changed = true;\n            // TODO use proxy to avoid copy?\n            this.markers = [...input.markers];\n            const points = this.markers.map((marker) => {\n                const position = MarkerUtils.getPosition(marker);\n                const coordinates = [position.lng(), position.lat()];\n                return {\n                    type: \"Feature\",\n                    geometry: {\n                        type: \"Point\",\n                        coordinates,\n                    },\n                    properties: { marker },\n                };\n            });\n            this.superCluster.load(points);\n        }\n        if (!changed) {\n            if (this.state.zoom <= this.maxZoom || state.zoom <= this.maxZoom) {\n                changed = !equal(this.state, state);\n            }\n        }\n        this.state = state;\n        if (changed) {\n            this.clusters = this.cluster(input);\n        }\n        return { clusters: this.clusters, changed };\n    }\n    cluster({ map }) {\n        return this.superCluster\n            .getClusters([-180, -90, 180, 90], Math.round(map.getZoom()))\n            .map((feature) => this.transformCluster(feature));\n    }\n    transformCluster({ geometry: { coordinates: [lng, lat], }, properties, }) {\n        if (properties.cluster) {\n            return new Cluster({\n                markers: this.superCluster\n                    .getLeaves(properties.cluster_id, Infinity)\n                    .map((leaf) => leaf.properties.marker),\n                position: { lat, lng },\n            });\n        }\n        const marker = properties.marker;\n        return new Cluster({\n            markers: [marker],\n            position: MarkerUtils.getPosition(marker),\n        });\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A very fast JavaScript algorithm for geospatial point clustering using KD trees.\n *\n * @see https://www.npmjs.com/package/supercluster for more information on options.\n */\nclass SuperClusterViewportAlgorithm extends AbstractViewportAlgorithm {\n    constructor(_a) {\n        var { maxZoom, radius = 60, viewportPadding = 60 } = _a, options = __rest(_a, [\"maxZoom\", \"radius\", \"viewportPadding\"]);\n        super({ maxZoom, viewportPadding });\n        this.superCluster = new SuperCluster(Object.assign({ maxZoom: this.maxZoom, radius }, options));\n        this.state = { zoom: -1, view: [0, 0, 0, 0] };\n    }\n    calculate(input) {\n        const state = {\n            zoom: Math.round(input.map.getZoom()),\n            view: getPaddedViewport(input.map.getBounds(), input.mapCanvasProjection, this.viewportPadding),\n        };\n        let changed = !equal(this.state, state);\n        if (!equal(input.markers, this.markers)) {\n            changed = true;\n            // TODO use proxy to avoid copy?\n            this.markers = [...input.markers];\n            const points = this.markers.map((marker) => {\n                const position = MarkerUtils.getPosition(marker);\n                const coordinates = [position.lng(), position.lat()];\n                return {\n                    type: \"Feature\",\n                    geometry: {\n                        type: \"Point\",\n                        coordinates,\n                    },\n                    properties: { marker },\n                };\n            });\n            this.superCluster.load(points);\n        }\n        if (changed) {\n            this.clusters = this.cluster(input);\n            this.state = state;\n        }\n        return { clusters: this.clusters, changed };\n    }\n    cluster({ map, mapCanvasProjection }) {\n        /* recalculate new state because we can't use the cached version. */\n        const state = {\n            zoom: Math.round(map.getZoom()),\n            view: getPaddedViewport(map.getBounds(), mapCanvasProjection, this.viewportPadding),\n        };\n        return this.superCluster\n            .getClusters(state.view, state.zoom)\n            .map((feature) => this.transformCluster(feature));\n    }\n    transformCluster({ geometry: { coordinates: [lng, lat], }, properties, }) {\n        if (properties.cluster) {\n            return new Cluster({\n                markers: this.superCluster\n                    .getLeaves(properties.cluster_id, Infinity)\n                    .map((leaf) => leaf.properties.marker),\n                position: { lat, lng },\n            });\n        }\n        const marker = properties.marker;\n        return new Cluster({\n            markers: [marker],\n            position: MarkerUtils.getPosition(marker),\n        });\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Provides statistics on all clusters in the current render cycle for use in {@link Renderer.render}.\n */\nclass ClusterStats {\n    constructor(markers, clusters) {\n        this.markers = { sum: markers.length };\n        const clusterMarkerCounts = clusters.map((a) => a.count);\n        const clusterMarkerSum = clusterMarkerCounts.reduce((a, b) => a + b, 0);\n        this.clusters = {\n            count: clusters.length,\n            markers: {\n                mean: clusterMarkerSum / clusters.length,\n                sum: clusterMarkerSum,\n                min: Math.min(...clusterMarkerCounts),\n                max: Math.max(...clusterMarkerCounts),\n            },\n        };\n    }\n}\nclass DefaultRenderer {\n    /**\n     * The default render function for the library used by {@link MarkerClusterer}.\n     *\n     * Currently set to use the following:\n     *\n     * ```typescript\n     * // change color if this cluster has more markers than the mean cluster\n     * const color =\n     *   count > Math.max(10, stats.clusters.markers.mean)\n     *     ? \"#ff0000\"\n     *     : \"#0000ff\";\n     *\n     * // create svg url with fill color\n     * const svg = window.btoa(`\n     * <svg fill=\"${color}\" xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 240 240\">\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".6\" r=\"70\" />\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".3\" r=\"90\" />\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".2\" r=\"110\" />\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".1\" r=\"130\" />\n     * </svg>`);\n     *\n     * // create marker using svg icon\n     * return new google.maps.Marker({\n     *   position,\n     *   icon: {\n     *     url: `data:image/svg+xml;base64,${svg}`,\n     *     scaledSize: new google.maps.Size(45, 45),\n     *   },\n     *   label: {\n     *     text: String(count),\n     *     color: \"rgba(255,255,255,0.9)\",\n     *     fontSize: \"12px\",\n     *   },\n     *   // adjust zIndex to be above other markers\n     *   zIndex: 1000 + count,\n     * });\n     * ```\n     */\n    render({ count, position }, stats, map) {\n        // change color if this cluster has more markers than the mean cluster\n        const color = count > Math.max(10, stats.clusters.markers.mean) ? \"#ff0000\" : \"#0000ff\";\n        // create svg literal with fill color\n        const svg = `<svg fill=\"${color}\" xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 240 240\" width=\"50\" height=\"50\">\n<circle cx=\"120\" cy=\"120\" opacity=\".6\" r=\"70\" />\n<circle cx=\"120\" cy=\"120\" opacity=\".3\" r=\"90\" />\n<circle cx=\"120\" cy=\"120\" opacity=\".2\" r=\"110\" />\n<text x=\"50%\" y=\"50%\" style=\"fill:#fff\" text-anchor=\"middle\" font-size=\"50\" dominant-baseline=\"middle\" font-family=\"roboto,arial,sans-serif\">${count}</text>\n</svg>`;\n        const title = `Cluster of ${count} markers`, \n        // adjust zIndex to be above other markers\n        zIndex = Number(google.maps.Marker.MAX_ZINDEX) + count;\n        if (MarkerUtils.isAdvancedMarkerAvailable(map)) {\n            // create cluster SVG element\n            const parser = new DOMParser();\n            const svgEl = parser.parseFromString(svg, \"image/svg+xml\").documentElement;\n            svgEl.setAttribute(\"transform\", \"translate(0 25)\");\n            const clusterOptions = {\n                map,\n                position,\n                zIndex,\n                title,\n                content: svgEl,\n            };\n            return new google.maps.marker.AdvancedMarkerElement(clusterOptions);\n        }\n        const clusterOptions = {\n            position,\n            zIndex,\n            title,\n            icon: {\n                url: `data:image/svg+xml;base64,${btoa(svg)}`,\n                anchor: new google.maps.Point(25, 25),\n            },\n        };\n        return new google.maps.Marker(clusterOptions);\n    }\n}\n\n/**\n * Copyright 2019 Google LLC. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Extends an object's prototype by another's.\n *\n * @param type1 The Type to be extended.\n * @param type2 The Type to extend with.\n * @ignore\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction extend(type1, type2) {\n    /* istanbul ignore next */\n    // eslint-disable-next-line prefer-const\n    for (let property in type2.prototype) {\n        type1.prototype[property] = type2.prototype[property];\n    }\n}\n/**\n * @ignore\n */\nclass OverlayViewSafe {\n    constructor() {\n        // MarkerClusterer implements google.maps.OverlayView interface. We use the\n        // extend function to extend MarkerClusterer with google.maps.OverlayView\n        // because it might not always be available when the code is defined so we\n        // look for it at the last possible moment. If it doesn't exist now then\n        // there is no point going ahead :)\n        extend(OverlayViewSafe, google.maps.OverlayView);\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar MarkerClustererEvents;\n(function (MarkerClustererEvents) {\n    MarkerClustererEvents[\"CLUSTERING_BEGIN\"] = \"clusteringbegin\";\n    MarkerClustererEvents[\"CLUSTERING_END\"] = \"clusteringend\";\n    MarkerClustererEvents[\"CLUSTER_CLICK\"] = \"click\";\n})(MarkerClustererEvents || (MarkerClustererEvents = {}));\nconst defaultOnClusterClickHandler = (_, cluster, map) => {\n    map.fitBounds(cluster.bounds);\n};\n/**\n * MarkerClusterer creates and manages per-zoom-level clusters for large amounts\n * of markers. See {@link MarkerClustererOptions} for more details.\n *\n */\nclass MarkerClusterer extends OverlayViewSafe {\n    constructor({ map, markers = [], algorithmOptions = {}, algorithm = new SuperClusterAlgorithm(algorithmOptions), renderer = new DefaultRenderer(), onClusterClick = defaultOnClusterClickHandler, }) {\n        super();\n        this.markers = [...markers];\n        this.clusters = [];\n        this.algorithm = algorithm;\n        this.renderer = renderer;\n        this.onClusterClick = onClusterClick;\n        if (map) {\n            this.setMap(map);\n        }\n    }\n    addMarker(marker, noDraw) {\n        if (this.markers.includes(marker)) {\n            return;\n        }\n        this.markers.push(marker);\n        if (!noDraw) {\n            this.render();\n        }\n    }\n    addMarkers(markers, noDraw) {\n        markers.forEach((marker) => {\n            this.addMarker(marker, true);\n        });\n        if (!noDraw) {\n            this.render();\n        }\n    }\n    removeMarker(marker, noDraw) {\n        const index = this.markers.indexOf(marker);\n        if (index === -1) {\n            // Marker is not in our list of markers, so do nothing:\n            return false;\n        }\n        MarkerUtils.setMap(marker, null);\n        this.markers.splice(index, 1); // Remove the marker from the list of managed markers\n        if (!noDraw) {\n            this.render();\n        }\n        return true;\n    }\n    removeMarkers(markers, noDraw) {\n        let removed = false;\n        markers.forEach((marker) => {\n            removed = this.removeMarker(marker, true) || removed;\n        });\n        if (removed && !noDraw) {\n            this.render();\n        }\n        return removed;\n    }\n    clearMarkers(noDraw) {\n        this.markers.length = 0;\n        if (!noDraw) {\n            this.render();\n        }\n    }\n    /**\n     * Recalculates and draws all the marker clusters.\n     */\n    render() {\n        const map = this.getMap();\n        if (map instanceof google.maps.Map && map.getProjection()) {\n            google.maps.event.trigger(this, MarkerClustererEvents.CLUSTERING_BEGIN, this);\n            const { clusters, changed } = this.algorithm.calculate({\n                markers: this.markers,\n                map,\n                mapCanvasProjection: this.getProjection(),\n            });\n            // Allow algorithms to return flag on whether the clusters/markers have changed.\n            if (changed || changed == undefined) {\n                // Accumulate the markers of the clusters composed of a single marker.\n                // Those clusters directly use the marker.\n                // Clusters with more than one markers use a group marker generated by a renderer.\n                const singleMarker = new Set();\n                for (const cluster of clusters) {\n                    if (cluster.markers.length == 1) {\n                        singleMarker.add(cluster.markers[0]);\n                    }\n                }\n                const groupMarkers = [];\n                // Iterate the clusters that are currently rendered.\n                for (const cluster of this.clusters) {\n                    if (cluster.marker == null) {\n                        continue;\n                    }\n                    if (cluster.markers.length == 1) {\n                        if (!singleMarker.has(cluster.marker)) {\n                            // The marker:\n                            // - was previously rendered because it is from a cluster with 1 marker,\n                            // - should no more be rendered as it is not in singleMarker.\n                            MarkerUtils.setMap(cluster.marker, null);\n                        }\n                    }\n                    else {\n                        // Delay the removal of old group markers to avoid flickering.\n                        groupMarkers.push(cluster.marker);\n                    }\n                }\n                this.clusters = clusters;\n                this.renderClusters();\n                // Delayed removal of the markers of the former groups.\n                requestAnimationFrame(() => groupMarkers.forEach((marker) => MarkerUtils.setMap(marker, null)));\n            }\n            google.maps.event.trigger(this, MarkerClustererEvents.CLUSTERING_END, this);\n        }\n    }\n    onAdd() {\n        this.idleListener = this.getMap().addListener(\"idle\", this.render.bind(this));\n        this.render();\n    }\n    onRemove() {\n        google.maps.event.removeListener(this.idleListener);\n        this.reset();\n    }\n    reset() {\n        this.markers.forEach((marker) => MarkerUtils.setMap(marker, null));\n        this.clusters.forEach((cluster) => cluster.delete());\n        this.clusters = [];\n    }\n    renderClusters() {\n        // Generate stats to pass to renderers.\n        const stats = new ClusterStats(this.markers, this.clusters);\n        const map = this.getMap();\n        this.clusters.forEach((cluster) => {\n            if (cluster.markers.length === 1) {\n                cluster.marker = cluster.markers[0];\n            }\n            else {\n                // Generate the marker to represent the group.\n                cluster.marker = this.renderer.render(cluster, stats, map);\n                // Make sure all individual markers are removed from the map.\n                cluster.markers.forEach((marker) => MarkerUtils.setMap(marker, null));\n                if (this.onClusterClick) {\n                    cluster.marker.addListener(\"click\", \n                    /* istanbul ignore next */\n                    (event) => {\n                        google.maps.event.trigger(this, MarkerClustererEvents.CLUSTER_CLICK, cluster);\n                        this.onClusterClick(event, cluster, map);\n                    });\n                }\n            }\n            MarkerUtils.setMap(cluster.marker, map);\n        });\n    }\n}\n\nexport { AbstractAlgorithm, AbstractViewportAlgorithm, Cluster, ClusterStats, DefaultRenderer, GridAlgorithm, MarkerClusterer, MarkerClustererEvents, MarkerUtils, NoopAlgorithm, SuperClusterAlgorithm, SuperClusterViewportAlgorithm, defaultOnClusterClickHandler, distanceBetweenPoints, extendBoundsToPaddedViewport, extendPixelBounds, filterMarkersToPaddedViewport, getPaddedViewport, noop, pixelBoundsToLatLngBounds };\n//# sourceMappingURL=index.esm.js.map\n","<template>\n  <div>\n    <slot></slot>\n  </div>\n</template>\n<script>\nimport {\n  DefaultRenderer,\n  MarkerClusterer,\n  SuperClusterAlgorithm,\n} from '@googlemaps/markerclusterer'\nimport buildComponent from './build-component.js'\n\nconst props = {\n  algorithm: {\n    type: Object,\n    default: new SuperClusterAlgorithm({}),\n    noBind: true,\n  },\n  renderer: {\n    type: Object,\n    default: new DefaultRenderer(),\n    noBind: true,\n  },\n}\n\nconst events = ['clusteringbegin', 'clusteringend']\n\nexport default buildComponent({\n  mappedProps: props,\n  events,\n  name: 'cluster',\n  ctr: () => {\n    if (typeof MarkerClusterer === 'undefined') {\n      const errorMessage = 'MarkerClusterer is not installed!'\n      console.error(errorMessage)\n      throw new Error(errorMessage)\n    }\n    return MarkerClusterer\n  },\n  ctrArgs: ({ map, ...otherOptions }) => [{ map, ...otherOptions }],\n  afterCreate(inst) {\n    const reinsertMarkers = () => {\n      const oldMarkers = inst.getMarkers()\n      inst.clearMarkers()\n      inst.addMarkers(oldMarkers)\n    }\n    for (let prop in props) {\n      if (props[prop].twoWay) {\n        this.$on(prop.toLowerCase() + '_changed', reinsertMarkers)\n      }\n    }\n  },\n  updated() {\n    if (this.$clusterObject) {\n      this.$clusterObject.render()\n    }\n  },\n  beforeUnmount() {\n    /* Performance optimization when destroying a large number of markers */\n    if (this.$children && this.$children.length) {\n      this.$children.forEach((marker) => {\n        if (marker.$clusterObject === this.$clusterObject) {\n          marker.$clusterObject = null\n        }\n      })\n    }\n\n    if (this.$clusterObject) {\n      this.$clusterObject.clearMarkers()\n    }\n  },\n})\n</script>\n","<template>\n  <div ref=\"infoWindow\">\n    <slot></slot>\n  </div>\n</template>\n\n<script>\nimport buildComponent from './build-component.js'\n\nconst props = {\n  options: {\n    type: Object,\n    required: false,\n    default() {\n      return {}\n    },\n  },\n  position: {\n    type: Object,\n    twoWay: true,\n  },\n  zIndex: {\n    type: Number,\n    twoWay: true,\n  },\n}\n\nconst events = ['domready', 'click', 'closeclick', 'content_changed']\n\nexport default buildComponent({\n  mappedProps: props,\n  events,\n  name: 'infoWindow',\n  ctr: () => google.maps.InfoWindow,\n  props: {\n    opened: {\n      type: Boolean,\n      default: true,\n    },\n  },\n\n  inject: {\n    $markerPromise: {\n      default: null,\n    },\n  },\n\n  mounted() {\n    const el = this.$refs.infoWindow\n    el.parentNode.removeChild(el)\n  },\n\n  beforeCreate(options) {\n    options.content = this.$refs.infoWindow\n\n    if (this.$markerPromise) {\n      delete options.position\n      return this.$markerPromise.then((mo) => {\n        this.$markerObject = mo\n        return mo\n      })\n    }\n  },\n  emits: ['closeclick'],\n  methods: {\n    _openInfoWindow() {\n      this.$infoWindowObject.close()\n      if (this.opened) {\n        this.$infoWindowObject.open(this.$map, this.$markerObject)\n      }\n    },\n  },\n\n  afterCreate() {\n    this._openInfoWindow()\n    this.$infoWindowObject.addListener('closeclick', () => {\n      this.$emit('closeclick')\n      this.$infoWindowObject.open(this.$map, this.$markerObject)\n    })\n    this.$watch('opened', () => {\n      this._openInfoWindow()\n    })\n  },\n})\n</script>\n","/*\nMixin for objects that are mounted by Google Maps\nJavascript API.\n\nThese are objects that are sensitive to element resize\noperations so it exposes a property which accepts a bus\n\n*/\n\nexport default {\n  props: ['resizeBus'],\n\n  data() {\n    return {\n      _actualResizeBus: null,\n    }\n  },\n\n  created() {\n    if (typeof this.resizeBus === 'undefined') {\n      this.$data._actualResizeBus = this.$gmapDefaultResizeBus\n    } else {\n      this.$data._actualResizeBus = this.resizeBus\n    }\n  },\n\n  methods: {\n    _resizeCallback() {\n      this.resize()\n    },\n    isFunction(functionToCheck) {\n      return functionToCheck && {}.toString.call(functionToCheck) === '[object Function]'\n    },\n    _delayedResizeCallback() {\n      this.$nextTick(() => this._resizeCallback())\n    },\n  },\n\n  watch: {\n    resizeBus(newVal) {\n      // eslint-disable-line no-unused-vars\n      this.$data._actualResizeBus = newVal\n    },\n    '$data._actualResizeBus'(newVal, oldVal) {\n      if (oldVal) {\n        oldVal.$off('resize', this._delayedResizeCallback)\n      }\n      if (newVal) {\n        //  newVal.$on('resize', this._delayedResizeCallback)\n      }\n    },\n  },\n\n  unmounted() {\n    if (this.$data._actualResizeBus && this.isFunction(this.$data._actualResizeBus.$off)) {\n      this.$data._actualResizeBus.$off('resize', this._delayedResizeCallback)\n    }\n  },\n}\n","/**\n * When you have two-way bindings, but the actual bound value will not equal\n * the value you initially passed in, then to avoid an infinite loop you\n * need to increment a counter every time you pass in a value, decrement the\n * same counter every time the bound value changed, but only bubble up\n * the event when the counter is zero.\n *\nExample:\n\nLet's say DrawingRecognitionCanvas is a deep-learning backed canvas\nthat, when given the name of an object (e.g. 'dog'), draws a dog.\nBut whenever the drawing on it changes, it also sends back its interpretation\nof the image by way of the @newObjectRecognized event.\n\n<input\n  type=\"text\"\n  placeholder=\"an object, e.g. Dog, Cat, Frog\"\n  v-model=\"identifiedObject\" />\n<DrawingRecognitionCanvas\n  :object=\"identifiedObject\"\n  @newObjectRecognized=\"identifiedObject = $event\"\n  />\n\nnew TwoWayBindingWrapper((increment, decrement, shouldUpdate) => {\n  this.$watch('identifiedObject', () => {\n    // new object passed in\n    increment()\n  })\n  this.$deepLearningBackend.on('drawingChanged', () => {\n    recognizeObject(this.$deepLearningBackend)\n      .then((object) => {\n        decrement()\n        if (shouldUpdate()) {\n          this.$emit('newObjectRecognized', object.name)\n        }\n      })\n  })\n})\n */\nexport default function TwoWayBindingWrapper(fn) {\n  let counter = 0\n\n  fn(\n    () => {\n      counter += 1\n    },\n    () => {\n      counter = Math.max(0, counter - 1)\n    },\n    () => counter === 0\n  )\n}\n","<template>\n  <div class=\"vue-map-container\" :class=\"$attrs.class\">\n    <div ref=\"vue-map\" class=\"vue-map\" :style=\"$attrs.style ? $attrs.style : ''\"></div>\n    <div class=\"vue-map-hidden\">\n      <slot></slot>\n    </div>\n    <slot name=\"visible\"></slot>\n  </div>\n</template>\n\n<script>\nimport bindEvents from '../utils/bindEvents.js'\nimport { bindProps, getPropsValues } from '../utils/bindProps.js'\nimport mountableMixin from '../utils/mountableMixin.js'\n\nimport TwoWayBindingWrapper from '../utils/TwoWayBindingWrapper.js'\nimport WatchPrimitiveProperties from '../utils/WatchPrimitiveProperties.js'\nimport { mappedPropsToVueProps } from './build-component.js'\n\nconst props = {\n  center: {\n    default: { lat: 0, lng: 0 },\n    twoWay: true,\n    type: Object,\n    noBind: true,\n  },\n  zoom: {\n    required: false,\n    twoWay: true,\n    type: Number,\n    noBind: true,\n  },\n  maxZoom: {\n    required: false,\n    twoWay: true,\n    type: Number,\n    noBind: true,\n  },\n  minZoom: {\n    required: false,\n    twoWay: true,\n    type: Number,\n    noBind: true,\n  },\n  heading: {\n    type: Number,\n    twoWay: true,\n  },\n  mapTypeId: {\n    twoWay: true,\n    type: String,\n  },\n  tilt: {\n    twoWay: true,\n    type: Number,\n  },\n  options: {\n    type: Object,\n    default() {\n      return {}\n    },\n  },\n}\n\nconst events = [\n  'bounds_changed',\n  'click',\n  'dblclick',\n  'drag',\n  'dragend',\n  'dragstart',\n  'idle',\n  'mousemove',\n  'mouseout',\n  'mouseover',\n  'resize',\n  'rightclick',\n  'tilesloaded',\n]\n\n// Plain Google Maps methods exposed here for convenience\nconst linkedMethods = ['panBy', 'panTo', 'panToBounds', 'fitBounds'].reduce((all, methodName) => {\n  all[methodName] = function () {\n    if (this.$mapObject) {\n      this.$mapObject[methodName].apply(this.$mapObject, arguments)\n    }\n  }\n  return all\n}, {})\n\n// Other convenience methods exposed by Vue Google Maps\nconst customMethods = {\n  resize() {\n    if (this.$mapObject) {\n      google.maps.event.trigger(this.$mapObject, 'resize')\n    }\n  },\n  resizePreserveCenter() {\n    if (!this.$mapObject) {\n      return\n    }\n\n    const oldCenter = this.$mapObject.getCenter()\n    google.maps.event.trigger(this.$mapObject, 'resize')\n    this.$mapObject.setCenter(oldCenter)\n  },\n\n  /// Override mountableMixin::_resizeCallback\n  /// because resizePreserveCenter is usually the\n  /// expected behaviour\n  _resizeCallback() {\n    this.resizePreserveCenter()\n  },\n}\n\nexport default {\n  mixins: [mountableMixin],\n  props: mappedPropsToVueProps({\n    ...props,\n    ...events.reduce(\n      (obj, eventName) => ({\n        ...obj,\n        [`on${eventName.charAt(0).toUpperCase()}${eventName.slice(1)}`.replace(\n          /[-_]+(.)?/g,\n          (_, c) => (c ? c.toUpperCase() : '')\n        )]: Function,\n      }),\n      {}\n    ),\n  }),\n  inheritAttrs: false,\n\n  provide() {\n    this.$mapPromise = new Promise((resolve, reject) => {\n      this.$mapPromiseDeferred = { resolve, reject }\n    })\n    return {\n      $mapPromise: this.$mapPromise,\n    }\n  },\n  emits: ['center_changed', 'zoom_changed', 'bounds_changed'],\n  computed: {\n    finalLat() {\n      return this.center && typeof this.center.lat === 'function'\n        ? this.center.lat()\n        : this.center.lat\n    },\n    finalLng() {\n      return this.center && typeof this.center.lng === 'function'\n        ? this.center.lng()\n        : this.center.lng\n    },\n    finalLatLng() {\n      return { lat: this.finalLat, lng: this.finalLng }\n    },\n  },\n\n  watch: {\n    zoom(zoom) {\n      if (this.$mapObject) {\n        this.$mapObject.setZoom(zoom)\n      }\n    },\n  },\n\n  mounted() {\n    return this.$gmapApiPromiseLazy()\n      .then(() => {\n        // getting the DOM element where to create the map\n        const element = this.$refs['vue-map']\n\n        // creating the map\n        const options = {\n          ...this.options,\n          ...getPropsValues(this, props),\n        }\n        delete options.options\n        this.$mapObject = new google.maps.Map(element, options)\n\n        // binding properties (two and one way)\n        bindProps(this, this.$mapObject, props)\n        // binding events\n        bindEvents(this, this.$mapObject, events)\n\n        // manually trigger center and zoom\n        TwoWayBindingWrapper((increment, decrement, shouldUpdate) => {\n          this.$mapObject.addListener('center_changed', () => {\n            if (shouldUpdate()) {\n              this.$emit('center_changed', this.$mapObject.getCenter())\n            }\n            decrement()\n          })\n\n          const updateCenter = () => {\n            increment()\n            this.$mapObject.setCenter(this.finalLatLng)\n          }\n\n          WatchPrimitiveProperties(this, ['finalLat', 'finalLng'], updateCenter)\n        })\n        this.$mapObject.addListener('zoom_changed', () => {\n          this.$emit('zoom_changed', this.$mapObject.getZoom())\n        })\n        this.$mapObject.addListener('bounds_changed', () => {\n          this.$emit('bounds_changed', this.$mapObject.getBounds())\n        })\n\n        this.$mapPromiseDeferred.resolve(this.$mapObject)\n\n        return this.$mapObject\n      })\n      .catch((error) => {\n        throw error\n      })\n  },\n  methods: {\n    ...customMethods,\n    ...linkedMethods,\n  },\n}\n</script>\n<style>\n.vue-map {\n  width: 100%;\n  height: 100%;\n  min-height: 2rem;\n}\n</style>\n","import buildComponent from './build-component.js'\n\nconst props = {\n  options: {\n    type: Object,\n    twoWay: false,\n    default: () => {},\n  },\n  data: {\n    type: Array,\n    twoWay: true,\n  },\n}\n\nconst events = []\n\nexport default buildComponent({\n  mappedProps: props,\n  name: 'heatmap',\n  ctr: () => google.maps.visualization.HeatmapLayer,\n  events,\n})\n","// This piece of code was orignally written by amirnissim and can be seen here\n// http://stackoverflow.com/a/11703018/2694653\n// This has been ported to Vanilla.js by GuillaumeLeclerc\nexport default (input) => {\n  const _addEventListener = input.addEventListener ? input.addEventListener : input.attachEvent\n\n  function addEventListenerWrapper(type, listener) {\n    // Simulate a 'down arrow' keypress on hitting 'return' when no pac suggestion is selected,\n    // and then trigger the original listener.\n    if (type === 'keydown') {\n      const origListener = listener\n      listener = function (event) {\n        const suggestionSelected = document.getElementsByClassName('pac-item-selected').length > 0\n        if (event.which === 13 && !suggestionSelected) {\n          const simulatedEvent = document.createEvent('Event')\n          simulatedEvent.keyCode = 40\n          simulatedEvent.which = 40\n          origListener.apply(input, [simulatedEvent])\n        }\n        origListener.apply(input, [event])\n      }\n    }\n    _addEventListener.apply(input, [type, listener])\n  }\n\n  input.addEventListener = addEventListenerWrapper\n  input.attachEvent = addEventListenerWrapper\n}\n","<template>\n  <template v-if=\"$slots['input']\">\n    <slot name=\"input\" v-bind=\"$attrs\"></slot>\n  </template>\n  <input v-else-if=\"!$slots['input']\" ref=\"input\" v-bind=\"$attrs\" v-on=\"$attrs\" />\n</template>\n\n<script>\nimport { bindProps, getPropsValues } from '../utils/bindProps.js'\nimport downArrowSimulator from '../utils/simulateArrowDown.js'\nimport { mappedPropsToVueProps } from './build-component'\n\nconst mappedProps = {\n  bounds: {\n    type: Object,\n  },\n  componentRestrictions: {\n    type: Object,\n    // Do not bind -- must check for undefined\n    // in the property\n    noBind: true,\n  },\n  types: {\n    type: Array,\n    default: function () {\n      return []\n    },\n  },\n}\n\nconst props = {\n  selectFirstOnEnter: {\n    required: false,\n    type: Boolean,\n    default: false,\n  },\n  options: {\n    type: Object,\n  },\n}\n\nexport default {\n  mounted() {\n    const _this = this\n    this.$gmapApiPromiseLazy().then(() => {\n      // get correct input from fallback or slot\n      let refInput = _this.$refs.input\n      if (_this.$slots.input) {\n        const refName = _this.$slots.input()[0].props.ref\n        const scopedInput = _this.$slots.input()[0].ref.i.ctx.$refs[refName]\n        if (scopedInput) {\n          refInput = scopedInput.$el.getElementsByTagName('input')[0]\n        }\n      }\n      if (this.selectFirstOnEnter) {\n        downArrowSimulator(refInput)\n      }\n\n      if (typeof google.maps.places.Autocomplete !== 'function') {\n        throw new Error(\n          \"google.maps.places.Autocomplete is undefined. Did you add 'places' to libraries when loading Google Maps?\"\n        )\n      }\n\n      /* eslint-disable no-unused-vars */\n      const finalOptions = {\n        ...getPropsValues(this, mappedProps),\n        ...this.options,\n      }\n\n      this.$autocomplete = new google.maps.places.Autocomplete(refInput, finalOptions)\n      bindProps(this, this.$autocomplete, mappedProps)\n\n      this.$watch('componentRestrictions', (v) => {\n        if (v !== undefined) {\n          this.$autocomplete.setComponentRestrictions(v)\n        }\n      })\n\n      // Not using `bindEvents` because we also want\n      // to return the result of `getPlace()`\n      this.$autocomplete.addListener('place_changed', () => {\n        this.$emit('place_changed', this.$autocomplete.getPlace())\n      })\n    })\n  },\n  props: {\n    ...mappedPropsToVueProps(mappedProps),\n    ...props,\n  },\n}\n</script>\n","import lazy from './utils/lazyValue'\nimport { loadGMapApi } from './load-google-maps'\nimport { createApp } from 'vue'\nimport Polyline from './components/polyline'\nimport Polygon from './components/polygon'\nimport Circle from './components/circle'\nimport Rectangle from './components/rectangle'\nimport Marker from './components/marker.vue'\nimport GMapCluster from './components/cluster.vue'\nimport InfoWindow from './components/infoWindow.vue'\nimport Map from './components/map.vue'\nimport Heatmap from './components/heatmap'\nimport Autocomplete from './components/autocomplete.vue'\n\nimport MapElementMixin from './components/mapElementMixin'\nimport buildComponent from './components/build-component'\nimport MountableMixin from './utils/mountableMixin'\nimport { Env } from './utils/env'\nlet GMapApi = null\n\nexport {\n  loadGMapApi,\n  Marker,\n  Polyline,\n  Polygon,\n  Circle,\n  GMapCluster,\n  Rectangle,\n  InfoWindow,\n  Map,\n  MapElementMixin,\n  Heatmap,\n  buildComponent,\n  Autocomplete,\n  MountableMixin,\n}\n\nexport default function install(Vue, options) {\n  options = {\n    installComponents: true,\n    autobindAllEvents: false,\n    ...options,\n  }\n\n  GMapApi = createApp({\n    data: function () {\n      return { gmapApi: null }\n    },\n  })\n\n  const defaultResizeBus = createApp()\n\n  // Use a lazy to only load the API when\n  // a VGM component is loaded\n  let gmapApiPromiseLazy = makeGMapApiPromiseLazy(options)\n\n  Vue.mixin({\n    created() {\n      this.$gmapDefaultResizeBus = defaultResizeBus\n      this.$gmapOptions = options\n      this.$gmapApiPromiseLazy = gmapApiPromiseLazy\n    },\n  })\n  Vue.$gmapDefaultResizeBus = defaultResizeBus\n  Vue.$gmapApiPromiseLazy = gmapApiPromiseLazy\n\n  if (options.installComponents) {\n    Vue.component('GMapMap', Map)\n    Vue.component('GMapMarker', Marker)\n    Vue.component('GMapInfoWindow', InfoWindow)\n    Vue.component('GMapCluster', GMapCluster)\n    Vue.component('GMapPolyline', Polyline)\n    Vue.component('GMapPolygon', Polygon)\n    Vue.component('GMapCircle', Circle)\n    Vue.component('GMapRectangle', Rectangle)\n    Vue.component('GMapAutocomplete', Autocomplete)\n    Vue.component('GMapHeatmap', Heatmap)\n  }\n}\n\nfunction makeGMapApiPromiseLazy(options) {\n  // Things to do once the API is loaded\n  function onApiLoaded() {\n    GMapApi.gmapApi = {}\n    return window.google\n  }\n\n  if (options.load) {\n    // If library should load the API\n    return lazy(() => {\n      // Load the\n      // This will only be evaluated once\n      if (Env.isServer()) {\n        return new Promise(() => {}).then(onApiLoaded)\n      } else {\n        return new Promise((resolve, reject) => {\n          try {\n            window['vueGoogleMapsInit'] = resolve\n            loadGMapApi(options.load)\n          } catch (err) {\n            reject(err)\n          }\n        }).then(onApiLoaded)\n      }\n    })\n  } else {\n    // If library should not handle API, provide\n    // end-users with the global `vueGoogleMapsInit: () => undefined`\n    // when the Google Maps API has been loaded\n    const promise = new Promise((resolve) => {\n      if (Env.isServer()) {\n        return\n      }\n      window['vueGoogleMapsInit'] = resolve\n    }).then(onApiLoaded)\n\n    return lazy(() => promise)\n  }\n}\n","import { boot } from \"quasar/wrappers\";\nimport VueGoogleMaps from \"vue-google-maps-community-fork\";\n\nexport default boot(({ app }) => {\n  app.use(VueGoogleMaps, {\n    load: {\n      key: \"AIzaSyB57sditn7bJjlVRCRz4okS88WUmSkRVCg\",\n      libraries: \"drawing\",\n    },\n  });\n});\n"],"names":["lazy","fn","called","result","Env","createMapScript","options","googleMapScript","url","key","isApiSetUp","loadGMapApi","bindEvents","vueInst","googleMapsInst","events","eventName","propName","_","c","ev","WatchPrimitiveProperties","propertiesToTrack","handler","immediate","isHandled","requestHandle","prop","Str","string","getPropsValues","props","acc","bindProps","attribute","twoWay","type","trackProperties","noBind","setMethodName","getMethodName","initialValue","attributeValue","MapElementMixin","map","buildComponent","mappedProps","name","ctr","ctrArgs","beforeCreate","afterCreate","rest","promiseName","instanceName","assert","mappedPropsToVueProps","promise","ConstructorObject","v","message","value","val","Polyline","inst","clearEvents","event","payload","path","mvcPath","eventListeners","updatePaths","obj","listenerHandle","Polygon","paths","mvcArray","i","Circle","Rectangle","_sfc_main","co","_createElementBlock","_cache","_renderSlot","_ctx","fastDeepEqual","equal","a","b","length","keys","ARRAY_TYPES","VERSION","HEADER_SIZE","KDBush","data","magic","versionAndType","version","ArrayType","nodeSize","numItems","arrayTypeIndex","coordsByteSize","idsByteSize","padCoords","x","y","index","numAdded","sort","minX","minY","maxX","maxY","ids","coords","stack","axis","right","left","m","qx","qy","r","r2","sqDist","select","k","n","z","s","sd","newLeft","newRight","t","j","swapItem","swap","arr","tmp","ax","ay","bx","by","dx","dy","defaultOptions","fround","OFFSET_ZOOM","OFFSET_ID","OFFSET_PARENT","OFFSET_NUM","OFFSET_PROP","Supercluster","points","log","minZoom","maxZoom","timerId","lng","lat","lngX","latY","tree","now","bbox","zoom","minLng","minLat","maxLng","maxLat","easternHem","westernHem","clusters","id","getClusterJSON","clusterId","originId","originZoom","errorMsg","children","limit","offset","leaves","z2","extent","radius","p","top","bottom","tile","expansionZoom","skipped","child","isCluster","tags","px","py","getClusterProperties","f","reduce","minPoints","nextData","stride","neighborIds","numPointsOrigin","numPoints","neighborId","wx","wy","clusterProperties","clusterPropIndex","numPoints2","clone","original","clusterProps","xLng","yLat","count","abbrev","propIndex","properties","sin","y2","__rest","MarkerUtils","marker","Cluster","markers","position","bounds","AbstractAlgorithm","noop","SuperClusterAlgorithm","_a","SuperCluster","input","changed","state","coordinates","feature","leaf","ClusterStats","clusterMarkerCounts","clusterMarkerSum","DefaultRenderer","stats","svg","title","zIndex","svgEl","clusterOptions","extend","type1","type2","property","OverlayViewSafe","MarkerClustererEvents","defaultOnClusterClickHandler","cluster","MarkerClusterer","algorithmOptions","algorithm","renderer","onClusterClick","noDraw","removed","singleMarker","groupMarkers","errorMessage","otherOptions","reinsertMarkers","oldMarkers","el","mo","_hoisted_1","_openBlock","mountableMixin","functionToCheck","newVal","oldVal","TwoWayBindingWrapper","counter","linkedMethods","all","methodName","customMethods","oldCenter","resolve","reject","element","increment","decrement","shouldUpdate","error","_normalizeClass","_createElementVNode","Heatmap","downArrowSimulator","_addEventListener","addEventListenerWrapper","listener","origListener","suggestionSelected","simulatedEvent","_this","refInput","refName","scopedInput","finalOptions","_mergeProps","_toHandlers","GMapApi","install","Vue","createApp","defaultResizeBus","gmapApiPromiseLazy","makeGMapApiPromiseLazy","Map","Marker","InfoWindow","GMapCluster","Autocomplete","onApiLoaded","err","googlemaps","boot","app","VueGoogleMaps"],"mappings":";;qIAEA,IAAeA,GAACC,GAAO,CACrB,IAAIC,EAAS,GACTC,EAEJ,MAAO,KACAD,IACHA,EAAS,GACTC,EAASF,EAAI,GAGRE,EAEX,ECdO,MAAMC,CAAI,CACf,OAAO,UAAW,CAChB,OAAO,OAAO,UAAa,WAC5B,CACH,CCJO,SAASC,GAAgBC,EAAS,CACvC,MAAMC,EAAkB,SAAS,cAAc,QAAQ,EACvD,GAAI,OAAOD,GAAY,SACrB,MAAM,IAAI,MAAM,8BAA8B,EAK5C,MAAM,UAAU,cAAcA,EAAQ,SAAS,IACjDA,EAAQ,UAAYA,EAAQ,UAAU,KAAK,GAAG,GAEhDA,EAAQ,SAAc,oBAGtB,IAAIE,EAFU,2CAIZ,OAAO,KAAKF,CAAO,EAChB,IAAKG,GAAQ,mBAAmBA,CAAG,EAAI,IAAM,mBAAmBH,EAAQG,EAAI,CAAC,EAC7E,KAAK,GAAG,EAEb,OAAAF,EAAgB,aAAa,MAAOC,CAAG,EACvCD,EAAgB,aAAa,QAAS,EAAE,EACxCA,EAAgB,aAAa,QAAS,EAAE,EAEjCA,CACT,CCtBA,IAAIG,GAAa,GACV,SAASC,GAAYL,EAAS,CACnC,GAAI,CAAAF,EAAI,WAIR,IAAKM,GAKH,MAAM,IAAI,MAAM,gDAAgD,EALjD,CACfA,GAAa,GACb,MAAMH,EAAkBF,GAAgBC,CAAO,EAC/C,SAAS,KAAK,YAAYC,CAAe,CAC7C,EAGA,CChBA,IAAAK,GAAe,CAACC,EAASC,EAAgBC,IAAW,CAClD,QAASC,KAAaD,EAAQ,CAC5B,MAAME,EAAW,KAAKD,EAAU,OAAO,CAAC,EAAE,YAAa,IAAGA,EAAU,MAAM,CAAC,IAAI,QAC7E,aACA,CAACE,EAAGC,IAAOA,EAAIA,EAAE,YAAa,EAAG,EAClC,EAEGN,EAAQ,OAAOI,IAAaJ,EAAQ,OAAOI,GAC7CH,EAAe,YAAYE,EAAYI,GAAO,CAC5CP,EAAQ,MAAMG,EAAWI,CAAE,CACnC,CAAO,GACQP,EAAQ,aAAa,mBAAqBA,EAAQ,OAAOG,KAClEF,EAAe,YAAYE,EAAYI,GAAO,CAC5CP,EAAQ,MAAMG,EAAWI,CAAE,CACnC,CAAO,CAEJ,CACH,ECVe,SAASC,GACtBR,EACAS,EACAC,EACAC,EAAY,GACZ,CACA,IAAIC,EAAY,GAEhB,SAASC,GAAgB,CAClBD,IACHA,EAAY,GACZZ,EAAQ,UAAU,IAAM,CACtBY,EAAY,GACZF,EAAS,CACjB,CAAO,EAEJ,CAED,QAASI,KAAQL,EACfT,EAAQ,OAAOc,EAAMD,EAAe,CAAE,UAAAF,CAAS,CAAE,CAErD,CC5BO,MAAMI,EAAI,CACf,OAAO,sBAAsBC,EAAQ,CACnC,OAAOA,EAAO,OAAO,CAAC,EAAE,YAAW,EAAKA,EAAO,MAAM,CAAC,CACvD,CACH,CCDO,SAASC,EAAejB,EAASkB,EAAO,CAC7C,OAAO,OAAO,KAAKA,CAAK,EAAE,OAAO,CAACC,EAAKL,KACjCd,EAAQc,KAAU,SACpBK,EAAIL,GAAQd,EAAQc,IAEfK,GACN,EAAE,CACP,CASO,SAASC,EAAUpB,EAASC,EAAgBiB,EAAO,CACxD,QAASG,KAAaH,EAAO,CAC3B,GAAI,CAAE,OAAAI,EAAQ,KAAAC,EAAM,gBAAAC,EAAiB,OAAAC,CAAQ,EAAGP,EAAMG,GAEtD,GAAII,EAAQ,SAEZ,MAAMC,EAAgB,MAAQX,GAAI,sBAAsBM,CAAS,EAC3DM,EAAgB,MAAQZ,GAAI,sBAAsBM,CAAS,EAC3DlB,EAAYkB,EAAU,YAAW,EAAK,WACtCO,EAAe5B,EAAQqB,GAE7B,GAAI,OAAOpB,EAAeyB,IAAmB,YAC3C,MAAM,IAAI,MACR,GAAGA,2DAAuE1B,EAAQ,SAAS,eAC5F,EAMCuB,IAAS,QAAU,CAACC,EAEtBxB,EAAQ,OACNqB,EACA,IAAM,CACJ,MAAMQ,EAAiB7B,EAAQqB,GAE/BpB,EAAeyB,GAAeG,CAAc,CAC7C,EACD,CACE,UAAW,OAAOD,GAAiB,YACnC,KAAML,IAAS,MAChB,CACF,EAEDf,GACER,EACAwB,EAAgB,IAAKV,GAAS,GAAGO,KAAaP,GAAM,EACpD,IAAM,CACJb,EAAeyB,GAAe1B,EAAQqB,EAAU,CACjD,EACDrB,EAAQqB,KAAe,MACxB,EAGCC,IAAWtB,EAAQ,aAAa,mBAAqBA,EAAQ,OAAOG,KACtEF,EAAe,YAAYE,EAAW,IAAM,CAE1CH,EAAQ,MAAMG,EAAWF,EAAe0B,GAAc,CAAE,CAChE,CAAO,CAEJ,CACH,CC9DA,IAAeG,GAAA,CACb,OAAQ,CACN,YAAa,CAAE,QAAS,QAAU,CACnC,EAED,SAAU,CAUR,YAAK,YAAY,KAAMC,GAAQ,CAC7B,KAAK,KAAOA,CAClB,CAAK,EAEM,CAAE,CACV,CACH,ECee,SAAQC,EAAEvC,EAAS,CAChC,KAAM,CAAE,YAAAwC,EAAa,KAAAC,EAAM,IAAAC,EAAK,QAAAC,EAAS,OAAAlC,EAAQ,aAAAmC,EAAc,YAAAC,EAAa,MAAApB,KAAUqB,CAAM,EAC1F9C,EAEI+C,EAAc,IAAIN,WAClBO,EAAe,IAAIP,UAEzB,OAAAQ,GAAO,EAAEH,EAAK,iBAAiB,OAAQ,wCAAwC,EAExE,CACL,GAAI,OAAO,cAAiB,YAAc,CAAE,YAAa9C,CAAS,EAAG,GACrE,OAAQ,CAACqC,EAAe,EACxB,MAAO,CACL,GAAGZ,EACH,GAAGyB,EAAsBV,CAAW,CACrC,EACD,QAAS,CACP,MAAO,EACR,EACD,SAAU,CACR,MAAMW,EAAU,KAAK,YAClB,KAAMb,GAAQ,CAEb,KAAK,KAAOA,EAGZ,MAAMtC,EAAU,CACd,GAAG,KAAK,QACR,IAAAsC,EACA,GAAGd,EAAe,KAAMgB,CAAW,CACpC,EAGD,GAFA,OAAOxC,EAAQ,QAEX4C,EAAc,CAChB,MAAM/C,EAAS+C,EAAa,KAAK,IAAI,EAAE5C,CAAO,EAE9C,GAAIH,aAAkB,QACpB,OAAOA,EAAO,KAAK,KAAO,CAAE,QAAAG,CAAS,EAAC,CAEzC,CACD,MAAO,CAAE,QAAAA,CAAS,CAC5B,CAAS,EACA,KAAK,CAAC,CAAE,QAAAA,KAAc,CACrB,MAAMoD,EAAoBV,EAAK,EAE/B,YAAKM,GAAgBL,EACjB,IAAK,SAAS,UAAU,KAAK,KAC3BS,EACA,KACA,GAAGT,EAAQ3C,EAASwB,EAAe,KAAMC,GAAS,CAAA,CAAE,CAAC,CACrE,GACc,IAAI2B,EAAkBpD,CAAO,EAEjC2B,EAAU,KAAM,KAAKqB,GAAeR,CAAW,EAC/ClC,GAAW,KAAM,KAAK0C,GAAevC,CAAM,EAEvCoC,GACFA,EAAY,KAAK,IAAI,EAAE,KAAKG,EAAa,EAEpC,KAAKA,EACtB,CAAS,EACH,YAAKD,GAAeI,EACb,CAAE,CAACJ,GAAcI,CAAS,CAClC,EACD,WAAY,CAEN,KAAKH,IAAiB,KAAKA,GAAc,QAC3C,KAAKA,GAAc,OAAO,IAAI,CAEjC,EACD,GAAGF,CACJ,CACH,CAEA,SAASG,GAAOI,EAAGC,EAAS,CAC1B,GAAI,CAACD,EAAG,MAAM,IAAI,MAAMC,CAAO,CACjC,CAOO,SAASJ,EAAsBV,EAAa,CACjD,OAAO,OAAO,QAAQA,CAAW,EAC9B,IAAI,CAAC,CAACrC,EAAKkB,CAAI,IAAM,CACpB,MAAMkC,EAAQ,CAAE,EAEhB,MAAI,SAAUlC,IAAMkC,EAAM,KAAOlC,EAAK,MAClC,YAAaA,IAAMkC,EAAM,QAAUlC,EAAK,SACxC,aAAcA,IAAMkC,EAAM,SAAWlC,EAAK,UAEvC,CAAClB,EAAKoD,CAAK,CACxB,CAAK,EACA,OAAO,CAAC7B,EAAK,CAACvB,EAAKqD,CAAG,KACrB9B,EAAIvB,GAAOqD,EACJ9B,GACN,EAAE,CACT,CC7IA,MAAMD,GAAQ,CACZ,UAAW,CACT,KAAM,OACP,EACD,SAAU,CACR,KAAM,OACP,EACD,QAAS,CACP,OAAQ,GACR,KAAM,MACP,EACD,KAAM,CACJ,KAAM,MACN,OAAQ,EACT,CACH,EAEMhB,EAAS,CACb,QACA,WACA,OACA,UACA,YACA,YACA,YACA,WACA,YACA,UACA,YACF,EAEA,IAAAgD,GAAelB,EAAe,CAC5B,YAAad,GACb,MAAO,CACL,UAAW,CACT,KAAM,QACN,QAAS,EACV,CACF,EACH,OAAEhB,EAEA,KAAM,WACN,IAAK,IAAM,OAAO,KAAK,SACvB,MAAOA,EACP,YAAYiD,EAAM,CAChB,IAAIC,EAAc,IAAM,CAAE,EAE1BlD,EAAO,QAASmD,GAAU,CACxBF,EAAK,YAAYE,EAAQC,GAAY,CACnC,KAAK,MAAMD,EAAOC,CAAO,CACjC,CAAO,CACP,CAAK,EAED,KAAK,OACH,OACCC,GAAS,CACR,GAAIA,EAAM,CACRH,EAAa,EAEb,KAAK,gBAAgB,QAAQG,CAAI,EAEjC,MAAMC,EAAU,KAAK,gBAAgB,QAAS,EACxCC,EAAiB,CAAE,EAEnBC,EAAc,IAAM,CACxB,KAAK,MAAM,eAAgB,KAAK,gBAAgB,QAAO,CAAE,CAC1D,EAEDD,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,YAAaE,CAAW,CAAC,CAAC,EAC5ED,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,YAAaE,CAAW,CAAC,CAAC,EAC5ED,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,SAAUE,CAAW,CAAC,CAAC,EAEzEN,EAAc,IAAM,CAClBK,EAAe,IACb,CACE,CAACE,EAAKC,CAAc,IACjB,OAAO,KAAK,MAAM,eAAeA,CAAc,CACrD,CACF,CACF,CACF,EACD,CACE,KAAM,KAAK,UACX,UAAW,EACZ,CACF,CACF,CACH,CAAC,ECvFD,MAAM1C,GAAQ,CACZ,UAAW,CACT,KAAM,OACP,EACD,SAAU,CACR,KAAM,OACP,EACD,QAAS,CACP,KAAM,MACP,EACD,KAAM,CACJ,KAAM,MACN,OAAQ,GACR,OAAQ,EACT,EACD,MAAO,CACL,KAAM,MACN,OAAQ,GACR,OAAQ,EACT,CACH,EAEMhB,EAAS,CACb,QACA,WACA,OACA,UACA,YACA,YACA,YACA,WACA,YACA,UACA,aACA,eACF,EAEA,IAAA2D,GAAe7B,EAAe,CAC5B,MAAO,CACL,UAAW,CACT,KAAM,QACN,QAAS,EACV,CACF,EACH,OAAE9B,EACA,YAAagB,GACb,KAAM,UACN,IAAK,IAAM,OAAO,KAAK,QACvB,MAAOhB,EACP,aAAaT,EAAS,CACfA,EAAQ,MAAM,OAAOA,EAAQ,KAC7BA,EAAQ,OAAO,OAAOA,EAAQ,KACpC,EAED,YAAY0D,EAAM,CAChB,IAAIC,EAAc,IAAM,CAAE,EAC1BlD,EAAO,QAASmD,GAAU,CACxBF,EAAK,YAAYE,EAAQC,GAAY,CACnC,KAAK,MAAMD,EAAOC,CAAO,CACjC,CAAO,CACP,CAAK,EAID,KAAK,OACH,QACCQ,GAAU,CACT,GAAIA,EAAO,CACTV,EAAa,EAEbD,EAAK,SAASW,CAAK,EAEnB,MAAMJ,EAAc,IAAM,CACxB,KAAK,MAAM,gBAAiBP,EAAK,SAAQ,CAAE,CAC5C,EACKM,EAAiB,CAAE,EAEnBM,EAAWZ,EAAK,SAAU,EAChC,QAASa,EAAI,EAAGA,EAAID,EAAS,UAAS,EAAIC,IAAK,CAC7C,IAAIR,EAAUO,EAAS,MAAMC,CAAC,EAC9BP,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,YAAaE,CAAW,CAAC,CAAC,EAC5ED,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,YAAaE,CAAW,CAAC,CAAC,EAC5ED,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,SAAUE,CAAW,CAAC,CAAC,CAC1E,CACDD,EAAe,KAAK,CAACM,EAAUA,EAAS,YAAY,YAAaL,CAAW,CAAC,CAAC,EAC9ED,EAAe,KAAK,CAACM,EAAUA,EAAS,YAAY,YAAaL,CAAW,CAAC,CAAC,EAC9ED,EAAe,KAAK,CAACM,EAAUA,EAAS,YAAY,SAAUL,CAAW,CAAC,CAAC,EAE3EN,EAAc,IAAM,CAClBK,EAAe,IACb,CACE,CAACE,EAAKC,CAAc,IACjB,OAAO,KAAK,MAAM,eAAeA,CAAc,CACrD,CACF,CACF,CACF,EACD,CACE,KAAM,KAAK,UACX,UAAW,EACZ,CACF,EAED,KAAK,OACH,OACCL,GAAS,CACR,GAAIA,EAAM,CACRH,EAAa,EAEbD,EAAK,SAASI,CAAI,EAElB,MAAMC,EAAUL,EAAK,QAAS,EACxBM,EAAiB,CAAE,EAEnBC,EAAc,IAAM,CACxB,KAAK,MAAM,eAAgBP,EAAK,QAAO,CAAE,CAC1C,EAEDM,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,YAAaE,CAAW,CAAC,CAAC,EAC5ED,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,YAAaE,CAAW,CAAC,CAAC,EAC5ED,EAAe,KAAK,CAACD,EAASA,EAAQ,YAAY,SAAUE,CAAW,CAAC,CAAC,EAEzEN,EAAc,IAAM,CAClBK,EAAe,IACb,CACE,CAACE,EAAKC,CAAc,IACjB,OAAO,KAAK,MAAM,eAAeA,CAAc,CACrD,CACF,CACF,CACF,EACD,CACE,KAAM,KAAK,UACX,UAAW,EACZ,CACF,CACF,CACH,CAAC,ECzID,MAAM1C,GAAQ,CACZ,OAAQ,CACN,KAAM,OACN,OAAQ,GACR,SAAU,EACX,EACD,OAAQ,CACN,KAAM,OACN,OAAQ,EACT,EACD,UAAW,CACT,KAAM,QACN,QAAS,EACV,EACD,SAAU,CACR,KAAM,QACN,QAAS,EACV,EACD,QAAS,CACP,KAAM,OACN,OAAQ,EACT,CACH,EAEMhB,EAAS,CACb,QACA,WACA,OACA,UACA,YACA,YACA,YACA,WACA,YACA,UACA,YACF,EAEA,IAAA+D,GAAejC,EAAe,CAC5B,YAAad,GACb,KAAM,SACN,IAAK,IAAM,OAAO,KAAK,OACzB,OAAEhB,EACA,MAAOA,EACP,YAAYiD,EAAM,CAChBjD,EAAO,QAASmD,GAAU,CACxBF,EAAK,YAAYE,EAAQC,GAAY,CACnC,KAAK,MAAMD,EAAOC,CAAO,CACjC,CAAO,CACP,CAAK,CACF,CACH,CAAC,ECnDD,MAAMpC,GAAQ,CACZ,OAAQ,CACN,KAAM,OACN,OAAQ,EACT,EACD,UAAW,CACT,KAAM,QACN,QAAS,EACV,EACD,SAAU,CACR,KAAM,QACN,QAAS,EACV,EACD,QAAS,CACP,KAAM,OACN,OAAQ,EACT,CACH,EAEMhB,EAAS,CACb,QACA,WACA,OACA,UACA,YACA,YACA,YACA,WACA,YACA,UACA,YACF,EAEA,IAAAgE,GAAelC,EAAe,CAC5B,YAAad,GACb,KAAM,YACN,IAAK,IAAM,OAAO,KAAK,UACzB,OAAEhB,EACA,MAAOA,EACP,YAAYiD,EAAM,CAChBjD,EAAO,QAASmD,GAAU,CACxBF,EAAK,YAAYE,EAAQC,GAAY,CACnC,KAAK,MAAMD,EAAOC,CAAO,CACjC,CAAO,CACP,CAAK,CACF,CACH,CAAC,EClCD,MAAMpC,GAAQ,CACZ,UAAW,CACT,OAAQ,GACR,KAAM,MACP,EACD,YAAa,CACX,KAAM,MACP,EACD,UAAW,CACT,KAAM,QACN,OAAQ,GACR,QAAS,EACV,EACD,OAAQ,CACN,KAAM,OACN,OAAQ,EACT,EACD,UAAW,CACT,KAAM,QACN,OAAQ,GACR,QAAS,EACV,EACD,KAAM,CACJ,OAAQ,EACT,EACD,MAAO,CAAE,EACT,QAAS,CACP,KAAM,OACN,QAAS,CACV,EACD,QAAS,CACP,KAAM,MACP,EACD,MAAO,CACL,KAAM,MACP,EACD,SAAU,CACR,KAAM,OACN,OAAQ,EACT,EACD,MAAO,CACL,KAAM,OACN,OAAQ,EACT,EACD,MAAO,CACL,KAAM,OACN,OAAQ,EACT,EACD,OAAQ,CACN,KAAM,OACN,OAAQ,EACT,EACD,QAAS,CACP,OAAQ,GACR,QAAS,EACV,CACH,EAEMhB,EAAS,CACb,QACA,aACA,WACA,OACA,YACA,UACA,UACA,YACA,YACA,UACF,EAEKiE,GAAanC,EAAY,CAC5B,YAAad,GACb,OAAAhB,EACA,KAAM,SACN,IAAK,IAAM,OAAO,KAAK,OAEvB,OAAQ,CACN,gBAAiB,CACf,QAAS,IACV,CACF,EACD,MAAOA,EACP,WAAY,CACN,CAAC,KAAK,gBAIN,KAAK,eAEP,KAAK,eAAe,aAAa,KAAK,cAAe,EAAI,EAEzD,KAAK,cAAc,OAAO,IAAI,EAEjC,EAED,aAAaT,EAAS,CACpB,OAAI,KAAK,kBACPA,EAAQ,IAAM,MAGT,KAAK,eACb,EAED,YAAY0D,EAAM,CAChBjD,EAAO,QAASmD,GAAU,CACxBF,EAAK,YAAYE,EAAQC,GAAY,CACnC,KAAK,MAAMD,EAAOC,CAAO,EAC1B,EACF,EACG,KAAK,iBACP,KAAK,gBAAgB,KAAMc,GAAO,CAChC,KAAK,eAAiBA,EACtBA,EAAG,UAAUjB,CAAI,EAClB,CAEJ,CACH,CAAC,sCAlICkB,EAQM,MAAA,CAPH,QAAKC,EAAA,KAAAA,EAAA,QAAyB,QAAQ,IAAG,OAAA,MAM1CC,EAAaC,EAAA,OAAA,SAAA,iCCFjBC,GAAiB,SAASC,EAAMC,EAAGC,EAAG,CACpC,GAAID,IAAMC,EAAG,MAAO,GAEpB,GAAID,GAAKC,GAAK,OAAOD,GAAK,UAAY,OAAOC,GAAK,SAAU,CAC1D,GAAID,EAAE,cAAgBC,EAAE,YAAa,MAAO,GAE5C,IAAIC,EAAQb,EAAGc,EACf,GAAI,MAAM,QAAQH,CAAC,EAAG,CAEpB,GADAE,EAASF,EAAE,OACPE,GAAUD,EAAE,OAAQ,MAAO,GAC/B,IAAKZ,EAAIa,EAAQb,MAAQ,GACvB,GAAI,CAACU,EAAMC,EAAEX,GAAIY,EAAEZ,EAAE,EAAG,MAAO,GACjC,MAAO,EACR,CAID,GAAIW,EAAE,cAAgB,OAAQ,OAAOA,EAAE,SAAWC,EAAE,QAAUD,EAAE,QAAUC,EAAE,MAC5E,GAAID,EAAE,UAAY,OAAO,UAAU,QAAS,OAAOA,EAAE,QAAO,IAAOC,EAAE,QAAO,EAC5E,GAAID,EAAE,WAAa,OAAO,UAAU,SAAU,OAAOA,EAAE,SAAQ,IAAOC,EAAE,SAAQ,EAIhF,GAFAE,EAAO,OAAO,KAAKH,CAAC,EACpBE,EAASC,EAAK,OACVD,IAAW,OAAO,KAAKD,CAAC,EAAE,OAAQ,MAAO,GAE7C,IAAKZ,EAAIa,EAAQb,MAAQ,GACvB,GAAI,CAAC,OAAO,UAAU,eAAe,KAAKY,EAAGE,EAAKd,EAAE,EAAG,MAAO,GAEhE,IAAKA,EAAIa,EAAQb,MAAQ,GAAI,CAC3B,IAAIpE,EAAMkF,EAAKd,GAEf,GAAI,CAACU,EAAMC,EAAE/E,GAAMgF,EAAEhF,EAAI,EAAG,MAAO,EACpC,CAED,MAAO,EACR,CAGD,OAAO+E,IAAIA,GAAKC,IAAIA,CACtB,EC5CA,MAAMG,GAAc,CAChB,UAAW,WAAY,kBAAmB,WAAY,YACtD,WAAY,YAAa,aAAc,YAC3C,EAIMC,EAAU,EACVC,EAAc,EAEL,MAAMC,CAAO,CAMxB,OAAO,KAAKC,EAAM,CACd,GAAI,EAAEA,aAAgB,aAClB,MAAM,IAAI,MAAM,0CAA0C,EAE9D,KAAM,CAACC,EAAOC,CAAc,EAAI,IAAI,WAAWF,EAAM,EAAG,CAAC,EACzD,GAAIC,IAAU,IACV,MAAM,IAAI,MAAM,gDAAgD,EAEpE,MAAME,EAAUD,GAAkB,EAClC,GAAIC,IAAYN,EACZ,MAAM,IAAI,MAAM,QAAQM,yBAA+BN,IAAU,EAErE,MAAMO,EAAYR,GAAYM,EAAiB,IAC/C,GAAI,CAACE,EACD,MAAM,IAAI,MAAM,0BAA0B,EAE9C,KAAM,CAACC,CAAQ,EAAI,IAAI,YAAYL,EAAM,EAAG,CAAC,EACvC,CAACM,CAAQ,EAAI,IAAI,YAAYN,EAAM,EAAG,CAAC,EAE7C,OAAO,IAAID,EAAOO,EAAUD,EAAUD,EAAWJ,CAAI,CACxD,CASD,YAAYM,EAAUD,EAAW,GAAID,EAAY,aAAcJ,EAAM,CACjE,GAAI,MAAMM,CAAQ,GAAKA,EAAW,EAAG,MAAM,IAAI,MAAM,+BAA+BA,IAAW,EAE/F,KAAK,SAAW,CAACA,EACjB,KAAK,SAAW,KAAK,IAAI,KAAK,IAAI,CAACD,EAAU,CAAC,EAAG,KAAK,EACtD,KAAK,UAAYD,EACjB,KAAK,eAAiBE,EAAW,MAAQ,YAAc,YAEvD,MAAMC,EAAiBX,GAAY,QAAQ,KAAK,SAAS,EACnDY,EAAiBF,EAAW,EAAI,KAAK,UAAU,kBAC/CG,EAAcH,EAAW,KAAK,eAAe,kBAC7CI,GAAa,EAAID,EAAc,GAAK,EAE1C,GAAIF,EAAiB,EACjB,MAAM,IAAI,MAAM,iCAAiCH,IAAY,EAG7DJ,GAASA,aAAgB,aACzB,KAAK,KAAOA,EACZ,KAAK,IAAM,IAAI,KAAK,eAAe,KAAK,KAAMF,EAAaQ,CAAQ,EACnE,KAAK,OAAS,IAAI,KAAK,UAAU,KAAK,KAAMR,EAAcW,EAAcC,EAAWJ,EAAW,CAAC,EAC/F,KAAK,KAAOA,EAAW,EACvB,KAAK,UAAY,KAEjB,KAAK,KAAO,IAAI,YAAYR,EAAcU,EAAiBC,EAAcC,CAAS,EAClF,KAAK,IAAM,IAAI,KAAK,eAAe,KAAK,KAAMZ,EAAaQ,CAAQ,EACnE,KAAK,OAAS,IAAI,KAAK,UAAU,KAAK,KAAMR,EAAcW,EAAcC,EAAWJ,EAAW,CAAC,EAC/F,KAAK,KAAO,EACZ,KAAK,UAAY,GAGjB,IAAI,WAAW,KAAK,KAAM,EAAG,CAAC,EAAE,IAAI,CAAC,KAAOT,GAAW,GAAKU,CAAc,CAAC,EAC3E,IAAI,YAAY,KAAK,KAAM,EAAG,CAAC,EAAE,GAAKF,EACtC,IAAI,YAAY,KAAK,KAAM,EAAG,CAAC,EAAE,GAAKC,EAE7C,CAQD,IAAIK,EAAGC,EAAG,CACN,MAAMC,EAAQ,KAAK,MAAQ,EAC3B,YAAK,IAAIA,GAASA,EAClB,KAAK,OAAO,KAAK,QAAUF,EAC3B,KAAK,OAAO,KAAK,QAAUC,EACpBC,CACV,CAKD,QAAS,CACL,MAAMC,EAAW,KAAK,MAAQ,EAC9B,GAAIA,IAAa,KAAK,SAClB,MAAM,IAAI,MAAM,SAASA,yBAAgC,KAAK,WAAW,EAG7E,OAAAC,EAAK,KAAK,IAAK,KAAK,OAAQ,KAAK,SAAU,EAAG,KAAK,SAAW,EAAG,CAAC,EAElE,KAAK,UAAY,GACV,IACV,CAUD,MAAMC,EAAMC,EAAMC,EAAMC,EAAM,CAC1B,GAAI,CAAC,KAAK,UAAW,MAAM,IAAI,MAAM,6CAA6C,EAElF,KAAM,CAAC,IAAAC,EAAK,OAAAC,EAAQ,SAAAhB,CAAQ,EAAI,KAC1BiB,EAAQ,CAAC,EAAGF,EAAI,OAAS,EAAG,CAAC,EAC7BjH,EAAS,CAAA,EAGf,KAAOmH,EAAM,QAAQ,CACjB,MAAMC,EAAOD,EAAM,IAAG,GAAM,EACtBE,EAAQF,EAAM,IAAG,GAAM,EACvBG,EAAOH,EAAM,IAAG,GAAM,EAG5B,GAAIE,EAAQC,GAAQpB,EAAU,CAC1B,QAASxB,EAAI4C,EAAM5C,GAAK2C,EAAO3C,IAAK,CAChC,MAAM8B,EAAIU,EAAO,EAAIxC,GACf+B,EAAIS,EAAO,EAAIxC,EAAI,GACrB8B,GAAKK,GAAQL,GAAKO,GAAQN,GAAKK,GAAQL,GAAKO,GAAMhH,EAAO,KAAKiH,EAAIvC,EAAE,CAC3E,CACD,QACH,CAGD,MAAM6C,EAAKD,EAAOD,GAAU,EAGtBb,EAAIU,EAAO,EAAIK,GACfd,EAAIS,EAAO,EAAIK,EAAI,GACrBf,GAAKK,GAAQL,GAAKO,GAAQN,GAAKK,GAAQL,GAAKO,GAAMhH,EAAO,KAAKiH,EAAIM,EAAE,GAGpEH,IAAS,EAAIP,GAAQL,EAAIM,GAAQL,KACjCU,EAAM,KAAKG,CAAI,EACfH,EAAM,KAAKI,EAAI,CAAC,EAChBJ,EAAM,KAAK,EAAIC,CAAI,IAEnBA,IAAS,EAAIL,GAAQP,EAAIQ,GAAQP,KACjCU,EAAM,KAAKI,EAAI,CAAC,EAChBJ,EAAM,KAAKE,CAAK,EAChBF,EAAM,KAAK,EAAIC,CAAI,EAE1B,CAED,OAAOpH,CACV,CASD,OAAOwH,EAAIC,EAAIC,EAAG,CACd,GAAI,CAAC,KAAK,UAAW,MAAM,IAAI,MAAM,6CAA6C,EAElF,KAAM,CAAC,IAAAT,EAAK,OAAAC,EAAQ,SAAAhB,CAAQ,EAAI,KAC1BiB,EAAQ,CAAC,EAAGF,EAAI,OAAS,EAAG,CAAC,EAC7BjH,EAAS,CAAA,EACT2H,EAAKD,EAAIA,EAGf,KAAOP,EAAM,QAAQ,CACjB,MAAMC,EAAOD,EAAM,IAAG,GAAM,EACtBE,EAAQF,EAAM,IAAG,GAAM,EACvBG,EAAOH,EAAM,IAAG,GAAM,EAG5B,GAAIE,EAAQC,GAAQpB,EAAU,CAC1B,QAASxB,EAAI4C,EAAM5C,GAAK2C,EAAO3C,IACvBkD,GAAOV,EAAO,EAAIxC,GAAIwC,EAAO,EAAIxC,EAAI,GAAI8C,EAAIC,CAAE,GAAKE,GAAI3H,EAAO,KAAKiH,EAAIvC,EAAE,EAElF,QACH,CAGD,MAAM6C,EAAKD,EAAOD,GAAU,EAGtBb,EAAIU,EAAO,EAAIK,GACfd,EAAIS,EAAO,EAAIK,EAAI,GACrBK,GAAOpB,EAAGC,EAAGe,EAAIC,CAAE,GAAKE,GAAI3H,EAAO,KAAKiH,EAAIM,EAAE,GAG9CH,IAAS,EAAII,EAAKE,GAAKlB,EAAIiB,EAAKC,GAAKjB,KACrCU,EAAM,KAAKG,CAAI,EACfH,EAAM,KAAKI,EAAI,CAAC,EAChBJ,EAAM,KAAK,EAAIC,CAAI,IAEnBA,IAAS,EAAII,EAAKE,GAAKlB,EAAIiB,EAAKC,GAAKjB,KACrCU,EAAM,KAAKI,EAAI,CAAC,EAChBJ,EAAM,KAAKE,CAAK,EAChBF,EAAM,KAAK,EAAIC,CAAI,EAE1B,CAED,OAAOpH,CACV,CACL,CAUA,SAAS4G,EAAKK,EAAKC,EAAQhB,EAAUoB,EAAMD,EAAOD,EAAM,CACpD,GAAIC,EAAQC,GAAQpB,EAAU,OAE9B,MAAMqB,EAAKD,EAAOD,GAAU,EAI5BQ,GAAOZ,EAAKC,EAAQK,EAAGD,EAAMD,EAAOD,CAAI,EAGxCR,EAAKK,EAAKC,EAAQhB,EAAUoB,EAAMC,EAAI,EAAG,EAAIH,CAAI,EACjDR,EAAKK,EAAKC,EAAQhB,EAAUqB,EAAI,EAAGF,EAAO,EAAID,CAAI,CACtD,CAYA,SAASS,GAAOZ,EAAKC,EAAQY,EAAGR,EAAMD,EAAOD,EAAM,CAE/C,KAAOC,EAAQC,GAAM,CACjB,GAAID,EAAQC,EAAO,IAAK,CACpB,MAAMS,EAAIV,EAAQC,EAAO,EACnBC,EAAIO,EAAIR,EAAO,EACfU,EAAI,KAAK,IAAID,CAAC,EACdE,EAAI,GAAM,KAAK,IAAI,EAAID,EAAI,CAAC,EAC5BE,EAAK,GAAM,KAAK,KAAKF,EAAIC,GAAKF,EAAIE,GAAKF,CAAC,GAAKR,EAAIQ,EAAI,EAAI,EAAI,GAAK,GAClEI,EAAU,KAAK,IAAIb,EAAM,KAAK,MAAMQ,EAAIP,EAAIU,EAAIF,EAAIG,CAAE,CAAC,EACvDE,EAAW,KAAK,IAAIf,EAAO,KAAK,MAAMS,GAAKC,EAAIR,GAAKU,EAAIF,EAAIG,CAAE,CAAC,EACrEL,GAAOZ,EAAKC,EAAQY,EAAGK,EAASC,EAAUhB,CAAI,CACjD,CAED,MAAMiB,EAAInB,EAAO,EAAIY,EAAIV,GACzB,IAAI1C,EAAI4C,EACJgB,EAAIjB,EAKR,IAHAkB,EAAStB,EAAKC,EAAQI,EAAMQ,CAAC,EACzBZ,EAAO,EAAIG,EAAQD,GAAQiB,GAAGE,EAAStB,EAAKC,EAAQI,EAAMD,CAAK,EAE5D3C,EAAI4D,GAAG,CAIV,IAHAC,EAAStB,EAAKC,EAAQxC,EAAG4D,CAAC,EAC1B5D,IACA4D,IACOpB,EAAO,EAAIxC,EAAI0C,GAAQiB,GAAG3D,IACjC,KAAOwC,EAAO,EAAIoB,EAAIlB,GAAQiB,GAAGC,GACpC,CAEGpB,EAAO,EAAII,EAAOF,KAAUiB,EAAGE,EAAStB,EAAKC,EAAQI,EAAMgB,CAAC,GAE5DA,IACAC,EAAStB,EAAKC,EAAQoB,EAAGjB,CAAK,GAG9BiB,GAAKR,IAAGR,EAAOgB,EAAI,GACnBR,GAAKQ,IAAGjB,EAAQiB,EAAI,EAC3B,CACL,CAQA,SAASC,EAAStB,EAAKC,EAAQxC,EAAG4D,EAAG,CACjCE,EAAKvB,EAAKvC,EAAG4D,CAAC,EACdE,EAAKtB,EAAQ,EAAIxC,EAAG,EAAI4D,CAAC,EACzBE,EAAKtB,EAAQ,EAAIxC,EAAI,EAAG,EAAI4D,EAAI,CAAC,CACrC,CAOA,SAASE,EAAKC,EAAK/D,EAAG4D,EAAG,CACrB,MAAMI,EAAMD,EAAI/D,GAChB+D,EAAI/D,GAAK+D,EAAIH,GACbG,EAAIH,GAAKI,CACb,CAQA,SAASd,GAAOe,EAAIC,EAAIC,EAAIC,EAAI,CAC5B,MAAMC,EAAKJ,EAAKE,EACVG,EAAKJ,EAAKE,EAChB,OAAOC,EAAKA,EAAKC,EAAKA,CAC1B,CCnUA,MAAMC,GAAiB,CACnB,QAAS,EACT,QAAS,GACT,UAAW,EACX,OAAQ,GACR,OAAQ,IACR,SAAU,GACV,IAAK,GAGL,WAAY,GAGZ,OAAQ,KAGR,IAAKrH,GAASA,CAClB,EAEMsH,GAAS,KAAK,SAAWR,GAASlC,IAAQkC,EAAI,GAAK,CAAClC,EAAUkC,EAAI,KAAQ,IAAI,aAAa,CAAC,CAAC,EAE7FS,EAAc,EACdC,EAAY,EACZC,EAAgB,EAChBC,EAAa,EACbC,GAAc,EAEL,MAAMC,EAAa,CAC9B,YAAYrJ,EAAS,CACjB,KAAK,QAAU,OAAO,OAAO,OAAO,OAAO8I,EAAc,EAAG9I,CAAO,EACnE,KAAK,MAAQ,IAAI,MAAM,KAAK,QAAQ,QAAU,CAAC,EAC/C,KAAK,OAAS,KAAK,QAAQ,OAAS,EAAI,EACxC,KAAK,aAAe,EACvB,CAED,KAAKsJ,EAAQ,CACT,KAAM,CAAC,IAAAC,EAAK,QAAAC,EAAS,QAAAC,CAAO,EAAI,KAAK,QAEjCF,GAAK,QAAQ,KAAK,YAAY,EAElC,MAAMG,EAAU,WAAaJ,EAAO,gBAChCC,GAAK,QAAQ,KAAKG,CAAO,EAE7B,KAAK,OAASJ,EAGd,MAAM5D,EAAO,CAAA,EAEb,QAAS,EAAI,EAAG,EAAI4D,EAAO,OAAQ,IAAK,CACpC,MAAM,EAAIA,EAAO,GACjB,GAAI,CAAC,EAAE,SAAU,SAEjB,KAAM,CAACK,EAAKC,CAAG,EAAI,EAAE,SAAS,YACxBvD,EAAI0C,GAAOc,EAAKF,CAAG,CAAC,EACpBrD,EAAIyC,GAAOe,EAAKF,CAAG,CAAC,EAE1BlE,EAAK,KACDW,EAAGC,EACH,IACA,EACA,GACA,CAChB,EACgB,KAAK,QAAQ,QAAQZ,EAAK,KAAK,CAAC,CACvC,CACD,IAAIqE,EAAO,KAAK,MAAMN,EAAU,GAAK,KAAK,YAAY/D,CAAI,EAEtD6D,GAAK,QAAQ,QAAQG,CAAO,EAIhC,QAAS7B,EAAI4B,EAAS5B,GAAK2B,EAAS3B,IAAK,CACrC,MAAMmC,EAAM,CAAC,KAAK,MAGlBD,EAAO,KAAK,MAAMlC,GAAK,KAAK,YAAY,KAAK,SAASkC,EAAMlC,CAAC,CAAC,EAE1D0B,GAAK,QAAQ,IAAI,2BAA4B1B,EAAGkC,EAAK,SAAU,CAAC,KAAK,IAAK,EAAGC,CAAG,CACvF,CAED,OAAIT,GAAK,QAAQ,QAAQ,YAAY,EAE9B,IACV,CAED,YAAYU,EAAMC,EAAM,CACpB,IAAIC,IAAWF,EAAK,GAAK,KAAO,IAAM,KAAO,IAAM,IACnD,MAAMG,EAAS,KAAK,IAAI,IAAK,KAAK,IAAI,GAAIH,EAAK,EAAE,CAAC,EAClD,IAAII,EAASJ,EAAK,KAAO,IAAM,MAAQA,EAAK,GAAK,KAAO,IAAM,KAAO,IAAM,IAC3E,MAAMK,EAAS,KAAK,IAAI,IAAK,KAAK,IAAI,GAAIL,EAAK,EAAE,CAAC,EAElD,GAAIA,EAAK,GAAKA,EAAK,IAAM,IACrBE,EAAS,KACTE,EAAS,YACFF,EAASE,EAAQ,CACxB,MAAME,EAAa,KAAK,YAAY,CAACJ,EAAQC,EAAQ,IAAKE,CAAM,EAAGJ,CAAI,EACjEM,EAAa,KAAK,YAAY,CAAC,KAAMJ,EAAQC,EAAQC,CAAM,EAAGJ,CAAI,EACxE,OAAOK,EAAW,OAAOC,CAAU,CACtC,CAED,MAAMT,EAAO,KAAK,MAAM,KAAK,WAAWG,CAAI,GACtCpD,EAAMiD,EAAK,MAAMF,EAAKM,CAAM,EAAGL,EAAKQ,CAAM,EAAGT,EAAKQ,CAAM,EAAGP,EAAKM,CAAM,CAAC,EACvE1E,EAAOqE,EAAK,KACZU,EAAW,CAAA,EACjB,UAAWC,KAAM5D,EAAK,CAClB,MAAMa,EAAI,KAAK,OAAS+C,EACxBD,EAAS,KAAK/E,EAAKiC,EAAIwB,GAAc,EAAIwB,GAAejF,EAAMiC,EAAG,KAAK,YAAY,EAAI,KAAK,OAAOjC,EAAKiC,EAAIsB,GAAW,CACzH,CACD,OAAOwB,CACV,CAED,YAAYG,EAAW,CACnB,MAAMC,EAAW,KAAK,aAAaD,CAAS,EACtCE,EAAa,KAAK,eAAeF,CAAS,EAC1CG,EAAW,oCAEXhB,EAAO,KAAK,MAAMe,GACxB,GAAI,CAACf,EAAM,MAAM,IAAI,MAAMgB,CAAQ,EAEnC,MAAMrF,EAAOqE,EAAK,KAClB,GAAIc,EAAW,KAAK,QAAUnF,EAAK,OAAQ,MAAM,IAAI,MAAMqF,CAAQ,EAEnE,MAAMxD,EAAI,KAAK,QAAQ,QAAU,KAAK,QAAQ,OAAS,KAAK,IAAI,EAAGuD,EAAa,CAAC,GAC3EzE,EAAIX,EAAKmF,EAAW,KAAK,QACzBvE,EAAIZ,EAAKmF,EAAW,KAAK,OAAS,GAClC/D,EAAMiD,EAAK,OAAO1D,EAAGC,EAAGiB,CAAC,EACzByD,EAAW,CAAA,EACjB,UAAWN,KAAM5D,EAAK,CAClB,MAAMa,EAAI+C,EAAK,KAAK,OAChBhF,EAAKiC,EAAIuB,KAAmB0B,GAC5BI,EAAS,KAAKtF,EAAKiC,EAAIwB,GAAc,EAAIwB,GAAejF,EAAMiC,EAAG,KAAK,YAAY,EAAI,KAAK,OAAOjC,EAAKiC,EAAIsB,GAAW,CAE7H,CAED,GAAI+B,EAAS,SAAW,EAAG,MAAM,IAAI,MAAMD,CAAQ,EAEnD,OAAOC,CACV,CAED,UAAUJ,EAAWK,EAAOC,EAAQ,CAChCD,EAAQA,GAAS,GACjBC,EAASA,GAAU,EAEnB,MAAMC,EAAS,CAAA,EACf,YAAK,cAAcA,EAAQP,EAAWK,EAAOC,EAAQ,CAAC,EAE/CC,CACV,CAED,QAAQtD,EAAGxB,EAAGC,EAAG,CACb,MAAMyD,EAAO,KAAK,MAAM,KAAK,WAAWlC,CAAC,GACnCuD,EAAK,KAAK,IAAI,EAAGvD,CAAC,EAClB,CAAC,OAAAwD,EAAQ,OAAAC,CAAM,EAAI,KAAK,QACxBC,EAAID,EAASD,EACbG,GAAOlF,EAAIiF,GAAKH,EAChBK,GAAUnF,EAAI,EAAIiF,GAAKH,EAEvBM,EAAO,CACT,SAAU,CAAE,CACxB,EAEQ,YAAK,iBACD3B,EAAK,OAAO1D,EAAIkF,GAAKH,EAAII,GAAMnF,EAAI,EAAIkF,GAAKH,EAAIK,CAAM,EACtD1B,EAAK,KAAM1D,EAAGC,EAAG8E,EAAIM,CAAI,EAEzBrF,IAAM,GACN,KAAK,iBACD0D,EAAK,MAAM,EAAIwB,EAAIH,EAAII,EAAK,EAAGC,CAAM,EACrC1B,EAAK,KAAMqB,EAAI9E,EAAG8E,EAAIM,CAAI,EAE9BrF,IAAM+E,EAAK,GACX,KAAK,iBACDrB,EAAK,MAAM,EAAGyB,EAAKD,EAAIH,EAAIK,CAAM,EACjC1B,EAAK,KAAM,GAAIzD,EAAG8E,EAAIM,CAAI,EAG3BA,EAAK,SAAS,OAASA,EAAO,IACxC,CAED,wBAAwBd,EAAW,CAC/B,IAAIe,EAAgB,KAAK,eAAef,CAAS,EAAI,EACrD,KAAOe,GAAiB,KAAK,QAAQ,SAAS,CAC1C,MAAMX,EAAW,KAAK,YAAYJ,CAAS,EAE3C,GADAe,IACIX,EAAS,SAAW,EAAG,MAC3BJ,EAAYI,EAAS,GAAG,WAAW,UACtC,CACD,OAAOW,CACV,CAED,cAAc9L,EAAQ+K,EAAWK,EAAOC,EAAQU,EAAS,CACrD,MAAMZ,EAAW,KAAK,YAAYJ,CAAS,EAE3C,UAAWiB,KAASb,EAAU,CAC1B,MAAMvJ,EAAQoK,EAAM,WAkBpB,GAhBIpK,GAASA,EAAM,QACXmK,EAAUnK,EAAM,aAAeyJ,EAE/BU,GAAWnK,EAAM,YAGjBmK,EAAU,KAAK,cAAc/L,EAAQ4B,EAAM,WAAYwJ,EAAOC,EAAQU,CAAO,EAG1EA,EAAUV,EAEjBU,IAGA/L,EAAO,KAAKgM,CAAK,EAEjBhM,EAAO,SAAWoL,EAAO,KAChC,CAED,OAAOW,CACV,CAED,YAAYlG,EAAM,CACd,MAAMqE,EAAO,IAAItE,EAAOC,EAAK,OAAS,KAAK,OAAS,EAAG,KAAK,QAAQ,SAAU,YAAY,EAC1F,QAASnB,EAAI,EAAGA,EAAImB,EAAK,OAAQnB,GAAK,KAAK,OAAQwF,EAAK,IAAIrE,EAAKnB,GAAImB,EAAKnB,EAAI,EAAE,EAChF,OAAAwF,EAAK,OAAM,EACXA,EAAK,KAAOrE,EACLqE,CACV,CAED,iBAAiBjD,EAAKpB,EAAMW,EAAGC,EAAG8E,EAAIM,EAAM,CACxC,UAAWnH,KAAKuC,EAAK,CACjB,MAAMa,EAAIpD,EAAI,KAAK,OACbuH,EAAYpG,EAAKiC,EAAIwB,GAAc,EAEzC,IAAI4C,EAAMC,EAAIC,EACd,GAAIH,EACAC,EAAOG,GAAqBxG,EAAMiC,EAAG,KAAK,YAAY,EACtDqE,EAAKtG,EAAKiC,GACVsE,EAAKvG,EAAKiC,EAAI,OACX,CACH,MAAM4D,EAAI,KAAK,OAAO7F,EAAKiC,EAAIsB,IAC/B8C,EAAOR,EAAE,WACT,KAAM,CAAC5B,EAAKC,CAAG,EAAI2B,EAAE,SAAS,YAC9BS,EAAKnC,EAAKF,CAAG,EACbsC,EAAKnC,EAAKF,CAAG,CAChB,CAED,MAAMuC,EAAI,CACN,KAAM,EACN,SAAU,CAAC,CACP,KAAK,MAAM,KAAK,QAAQ,QAAUH,EAAKZ,EAAK/E,EAAE,EAC9C,KAAK,MAAM,KAAK,QAAQ,QAAU4F,EAAKb,EAAK9E,EAAE,CAClE,CAAiB,EACD,KAAAyF,CAChB,EAGY,IAAIrB,EACAoB,GAAa,KAAK,QAAQ,WAE1BpB,EAAKhF,EAAKiC,EAAIsB,GAGdyB,EAAK,KAAK,OAAOhF,EAAKiC,EAAIsB,IAAY,GAGtCyB,IAAO,SAAWyB,EAAE,GAAKzB,GAE7BgB,EAAK,SAAS,KAAKS,CAAC,CACvB,CACJ,CAED,WAAWtE,EAAG,CACV,OAAO,KAAK,IAAI,KAAK,QAAQ,QAAS,KAAK,IAAI,KAAK,MAAM,CAACA,CAAC,EAAG,KAAK,QAAQ,QAAU,CAAC,CAAC,CAC3F,CAED,SAASkC,EAAMG,EAAM,CACjB,KAAM,CAAC,OAAAoB,EAAQ,OAAAD,EAAQ,OAAAe,EAAQ,UAAAC,CAAS,EAAI,KAAK,QAC3C9E,EAAI+D,GAAUD,EAAS,KAAK,IAAI,EAAGnB,CAAI,GACvCxE,EAAOqE,EAAK,KACZuC,EAAW,CAAA,EACXC,EAAS,KAAK,OAGpB,QAAShI,EAAI,EAAGA,EAAImB,EAAK,OAAQnB,GAAKgI,EAAQ,CAE1C,GAAI7G,EAAKnB,EAAIyE,IAAgBkB,EAAM,SACnCxE,EAAKnB,EAAIyE,GAAekB,EAGxB,MAAM7D,EAAIX,EAAKnB,GACT+B,EAAIZ,EAAKnB,EAAI,GACbiI,EAAczC,EAAK,OAAOrE,EAAKnB,GAAImB,EAAKnB,EAAI,GAAIgD,CAAC,EAEjDkF,EAAkB/G,EAAKnB,EAAI4E,GACjC,IAAIuD,EAAYD,EAGhB,UAAWE,KAAcH,EAAa,CAClC,MAAM7E,EAAIgF,EAAaJ,EAEnB7G,EAAKiC,EAAIqB,GAAekB,IAAMwC,GAAahH,EAAKiC,EAAIwB,GAC3D,CAGD,GAAIuD,EAAYD,GAAmBC,GAAaL,EAAW,CACvD,IAAIO,EAAKvG,EAAIoG,EACTI,EAAKvG,EAAImG,EAETK,EACAC,GAAmB,GAGvB,MAAMrC,IAAOnG,EAAIgI,EAAS,IAAM,IAAMrC,EAAO,GAAK,KAAK,OAAO,OAE9D,UAAWyC,MAAcH,EAAa,CAClC,MAAM,EAAIG,GAAaJ,EAEvB,GAAI7G,EAAK,EAAIsD,IAAgBkB,EAAM,SACnCxE,EAAK,EAAIsD,GAAekB,EAExB,MAAM8C,GAAatH,EAAK,EAAIyD,GAC5ByD,GAAMlH,EAAK,GAAKsH,GAChBH,GAAMnH,EAAK,EAAI,GAAKsH,GAEpBtH,EAAK,EAAIwD,GAAiBwB,EAEtB0B,IACKU,IACDA,EAAoB,KAAK,KAAKpH,EAAMnB,EAAG,EAAI,EAC3CwI,GAAmB,KAAK,aAAa,OACrC,KAAK,aAAa,KAAKD,CAAiB,GAE5CV,EAAOU,EAAmB,KAAK,KAAKpH,EAAM,CAAC,CAAC,EAEnD,CAEDA,EAAKnB,EAAI2E,GAAiBwB,EAC1B4B,EAAS,KAAKM,EAAKF,EAAWG,EAAKH,EAAW,IAAUhC,EAAI,GAAIgC,CAAS,EACrEN,GAAQE,EAAS,KAAKS,EAAgB,CAE1D,KAAmB,CACH,QAAS5E,EAAI,EAAGA,EAAIoE,EAAQpE,IAAKmE,EAAS,KAAK5G,EAAKnB,EAAI4D,EAAE,EAE1D,GAAIuE,EAAY,EACZ,UAAWC,KAAcH,EAAa,CAClC,MAAM7E,EAAIgF,EAAaJ,EACvB,GAAI,EAAA7G,EAAKiC,EAAIqB,IAAgBkB,GAC7B,CAAAxE,EAAKiC,EAAIqB,GAAekB,EACxB,QAAS/B,EAAI,EAAGA,EAAIoE,EAAQpE,IAAKmE,EAAS,KAAK5G,EAAKiC,EAAIQ,EAAE,EAC7D,CAER,CACJ,CAED,OAAOmE,CACV,CAGD,aAAa1B,EAAW,CACpB,OAAQA,EAAY,KAAK,OAAO,QAAW,CAC9C,CAGD,eAAeA,EAAW,CACtB,OAAQA,EAAY,KAAK,OAAO,QAAU,EAC7C,CAED,KAAKlF,EAAMnB,EAAG0I,EAAO,CACjB,GAAIvH,EAAKnB,EAAI4E,GAAc,EAAG,CAC1B,MAAM1H,EAAQ,KAAK,aAAaiE,EAAKnB,EAAI6E,KACzC,OAAO6D,EAAQ,OAAO,OAAO,CAAA,EAAIxL,CAAK,EAAIA,CAC7C,CACD,MAAMyL,EAAW,KAAK,OAAOxH,EAAKnB,EAAI0E,IAAY,WAC5CpJ,EAAS,KAAK,QAAQ,IAAIqN,CAAQ,EACxC,OAAOD,GAASpN,IAAWqN,EAAW,OAAO,OAAO,CAAE,EAAErN,CAAM,EAAIA,CACrE,CACL,CAEA,SAAS8K,GAAejF,EAAMnB,EAAG4I,EAAc,CAC3C,MAAO,CACH,KAAM,UACN,GAAIzH,EAAKnB,EAAI0E,GACb,WAAYiD,GAAqBxG,EAAMnB,EAAG4I,CAAY,EACtD,SAAU,CACN,KAAM,QACN,YAAa,CAACC,GAAK1H,EAAKnB,EAAE,EAAG8I,GAAK3H,EAAKnB,EAAI,EAAE,CAAC,CACjD,CACT,CACA,CAEA,SAAS2H,GAAqBxG,EAAMnB,EAAG4I,EAAc,CACjD,MAAMG,EAAQ5H,EAAKnB,EAAI4E,GACjBoE,EACFD,GAAS,IAAQ,GAAG,KAAK,MAAMA,EAAQ,GAAI,KAC3CA,GAAS,IAAO,GAAG,KAAK,MAAMA,EAAQ,GAAG,EAAI,MAAUA,EACrDE,EAAY9H,EAAKnB,EAAI6E,IACrBqE,EAAaD,IAAc,GAAK,CAAE,EAAG,OAAO,OAAO,CAAE,EAAEL,EAAaK,EAAU,EACpF,OAAO,OAAO,OAAOC,EAAY,CAC7B,QAAS,GACT,WAAY/H,EAAKnB,EAAI0E,GACrB,YAAaqE,EACb,wBAAyBC,CACjC,CAAK,CACL,CAGA,SAAS1D,EAAKF,EAAK,CACf,OAAOA,EAAM,IAAM,EACvB,CACA,SAASG,EAAKF,EAAK,CACf,MAAM8D,EAAM,KAAK,IAAI9D,EAAM,KAAK,GAAK,GAAG,EAClCtD,EAAK,GAAM,IAAO,KAAK,KAAK,EAAIoH,IAAQ,EAAIA,EAAI,EAAI,KAAK,GAC/D,OAAOpH,EAAI,EAAI,EAAIA,EAAI,EAAI,EAAIA,CACnC,CAGA,SAAS8G,GAAK/G,EAAG,CACb,OAAQA,EAAI,IAAO,GACvB,CACA,SAASgH,GAAK/G,EAAG,CACb,MAAMqH,GAAM,IAAMrH,EAAI,KAAO,KAAK,GAAK,IACvC,MAAO,KAAM,KAAK,KAAK,KAAK,IAAIqH,CAAE,CAAC,EAAI,KAAK,GAAK,EACrD,CCpaA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gFAeA,SAASC,GAAO9F,EAAG,EAAG,CAClB,IAAI,EAAI,CAAA,EACR,QAASyD,KAAKzD,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGyD,CAAC,GAAK,EAAE,QAAQA,CAAC,EAAI,IAC9E,EAAEA,GAAKzD,EAAEyD,IACb,GAAIzD,GAAK,MAAQ,OAAO,OAAO,uBAA0B,WACrD,QAASvD,EAAI,EAAGgH,EAAI,OAAO,sBAAsBzD,CAAC,EAAGvD,EAAIgH,EAAE,OAAQhH,IAC3D,EAAE,QAAQgH,EAAEhH,EAAE,EAAI,GAAK,OAAO,UAAU,qBAAqB,KAAKuD,EAAGyD,EAAEhH,EAAE,IACzE,EAAEgH,EAAEhH,IAAMuD,EAAEyD,EAAEhH,KAE1B,OAAO,CACX,CAqBA,MAAMsJ,CAAY,CACd,OAAO,0BAA0BvL,EAAK,CAClC,OAAQ,OAAO,KAAK,QAChBA,EAAI,mBAAkB,EAAG,6BAA+B,EAC/D,CACD,OAAO,iBAAiBwL,EAAQ,CAC5B,OAAQ,OAAO,KAAK,QAChBA,aAAkB,OAAO,KAAK,OAAO,qBAC5C,CACD,OAAO,OAAOA,EAAQxL,EAAK,CACnB,KAAK,iBAAiBwL,CAAM,EAC5BA,EAAO,IAAMxL,EAGbwL,EAAO,OAAOxL,CAAG,CAExB,CACD,OAAO,YAAYwL,EAAQ,CAEvB,GAAI,KAAK,iBAAiBA,CAAM,EAAG,CAC/B,GAAIA,EAAO,SAAU,CACjB,GAAIA,EAAO,oBAAoB,OAAO,KAAK,OACvC,OAAOA,EAAO,SAGlB,GAAIA,EAAO,SAAS,KAAOA,EAAO,SAAS,IACvC,OAAO,IAAI,OAAO,KAAK,OAAOA,EAAO,SAAS,IAAKA,EAAO,SAAS,GAAG,CAE7E,CACD,OAAO,IAAI,OAAO,KAAK,OAAO,IAAI,CACrC,CACD,OAAOA,EAAO,aACjB,CACD,OAAO,WAAWA,EAAQ,CACtB,OAAI,KAAK,iBAAiBA,CAAM,EAQrB,GAEJA,EAAO,YACjB,CACL,CAiBA,MAAMC,CAAQ,CACV,YAAY,CAAE,QAAAC,EAAS,SAAAC,GAAY,CAC/B,KAAK,QAAUD,EACXC,IACIA,aAAoB,OAAO,KAAK,OAChC,KAAK,UAAYA,EAGjB,KAAK,UAAY,IAAI,OAAO,KAAK,OAAOA,CAAQ,EAG3D,CACD,IAAI,QAAS,CACT,GAAI,KAAK,QAAQ,SAAW,GAAK,CAAC,KAAK,UACnC,OAEJ,MAAMC,EAAS,IAAI,OAAO,KAAK,aAAa,KAAK,UAAW,KAAK,SAAS,EAC1E,UAAWJ,KAAU,KAAK,QACtBI,EAAO,OAAOL,EAAY,YAAYC,CAAM,CAAC,EAEjD,OAAOI,CACV,CACD,IAAI,UAAW,CACX,OAAO,KAAK,WAAa,KAAK,OAAO,UAAS,CACjD,CAID,IAAI,OAAQ,CACR,OAAO,KAAK,QAAQ,OAAQ9G,GAAMyG,EAAY,WAAWzG,CAAC,CAAC,EAAE,MAChE,CAID,KAAK0G,EAAQ,CACT,KAAK,QAAQ,KAAKA,CAAM,CAC3B,CAID,QAAS,CACD,KAAK,SACLD,EAAY,OAAO,KAAK,OAAQ,IAAI,EACpC,KAAK,OAAS,QAElB,KAAK,QAAQ,OAAS,CACzB,CACL,CAoHA,MAAMM,EAAkB,CACpB,YAAY,CAAE,QAAA1E,EAAU,IAAM,CAC1B,KAAK,QAAUA,CAClB,CAaD,KAAK,CAAE,QAAAuE,GAAY,CACf,OAAOI,GAAKJ,CAAO,CACtB,CACL,CAmCA,MAAMI,GAAQJ,GACOA,EAAQ,IAAKF,GAAW,IAAIC,EAAQ,CACjD,SAAUF,EAAY,YAAYC,CAAM,EACxC,QAAS,CAACA,CAAM,CACnB,CAAA,CAAC,EA8IN,MAAMO,WAA8BF,EAAkB,CAClD,YAAYG,EAAI,CACZ,GAAI,CAAE,QAAA7E,EAAS,OAAA6B,EAAS,EAAI,EAAGgD,EAAItO,EAAU4N,GAAOU,EAAI,CAAC,UAAW,QAAQ,CAAC,EAC7E,MAAM,CAAE,QAAA7E,CAAO,CAAE,EACjB,KAAK,MAAQ,CAAE,KAAM,EAAE,EACvB,KAAK,aAAe,IAAI8E,GAAa,OAAO,OAAO,CAAE,QAAS,KAAK,QAAS,OAAAjD,GAAUtL,CAAO,CAAC,CACjG,CACD,UAAUwO,EAAO,CACb,IAAIC,EAAU,GACd,MAAMC,EAAQ,CAAE,KAAMF,EAAM,IAAI,QAAO,GACvC,GAAI,CAACvJ,GAAMuJ,EAAM,QAAS,KAAK,OAAO,EAAG,CACrCC,EAAU,GAEV,KAAK,QAAU,CAAC,GAAGD,EAAM,OAAO,EAChC,MAAMlF,EAAS,KAAK,QAAQ,IAAKwE,GAAW,CACxC,MAAMG,EAAWJ,EAAY,YAAYC,CAAM,EACzCa,EAAc,CAACV,EAAS,IAAK,EAAEA,EAAS,IAAG,CAAE,EACnD,MAAO,CACH,KAAM,UACN,SAAU,CACN,KAAM,QACN,YAAAU,CACH,EACD,WAAY,CAAE,OAAAb,CAAQ,CAC1C,CACA,CAAa,EACD,KAAK,aAAa,KAAKxE,CAAM,CAChC,CACD,OAAKmF,IACG,KAAK,MAAM,MAAQ,KAAK,SAAWC,EAAM,MAAQ,KAAK,WACtDD,EAAU,CAACxJ,GAAM,KAAK,MAAOyJ,CAAK,GAG1C,KAAK,MAAQA,EACTD,IACA,KAAK,SAAW,KAAK,QAAQD,CAAK,GAE/B,CAAE,SAAU,KAAK,SAAU,QAAAC,CAAO,CAC5C,CACD,QAAQ,CAAE,IAAAnM,GAAO,CACb,OAAO,KAAK,aACP,YAAY,CAAC,KAAM,IAAK,IAAK,EAAE,EAAG,KAAK,MAAMA,EAAI,QAAS,CAAA,CAAC,EAC3D,IAAKsM,GAAY,KAAK,iBAAiBA,CAAO,CAAC,CACvD,CACD,iBAAiB,CAAE,SAAU,CAAE,YAAa,CAACjF,EAAKC,CAAG,GAAM,WAAA6D,GAAe,CACtE,GAAIA,EAAW,QACX,OAAO,IAAIM,EAAQ,CACf,QAAS,KAAK,aACT,UAAUN,EAAW,WAAY,GAAQ,EACzC,IAAKoB,GAASA,EAAK,WAAW,MAAM,EACzC,SAAU,CAAE,IAAAjF,EAAK,IAAAD,CAAK,CACtC,CAAa,EAEL,MAAMmE,EAASL,EAAW,OAC1B,OAAO,IAAIM,EAAQ,CACf,QAAS,CAACD,CAAM,EAChB,SAAUD,EAAY,YAAYC,CAAM,CACpD,CAAS,CACJ,CACL,CAwGA,MAAMgB,EAAa,CACf,YAAYd,EAASvD,EAAU,CAC3B,KAAK,QAAU,CAAE,IAAKuD,EAAQ,MAAM,EACpC,MAAMe,EAAsBtE,EAAS,IAAKvF,GAAMA,EAAE,KAAK,EACjD8J,EAAmBD,EAAoB,OAAO,CAAC7J,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EACtE,KAAK,SAAW,CACZ,MAAOsF,EAAS,OAChB,QAAS,CACL,KAAMuE,EAAmBvE,EAAS,OAClC,IAAKuE,EACL,IAAK,KAAK,IAAI,GAAGD,CAAmB,EACpC,IAAK,KAAK,IAAI,GAAGA,CAAmB,CACvC,CACb,CACK,CACL,CACA,MAAME,EAAgB,CAuClB,OAAO,CAAE,MAAA3B,EAAO,SAAAW,CAAQ,EAAIiB,EAAO5M,EAAK,CAIpC,MAAM6M,EAAM,cAFE7B,EAAQ,KAAK,IAAI,GAAI4B,EAAM,SAAS,QAAQ,IAAI,EAAI,UAAY;AAAA;AAAA;AAAA;AAAA,+IAMyD5B;AAAA,QAEjI8B,EAAQ,cAAc9B,YAE5B+B,EAAS,OAAO,OAAO,KAAK,OAAO,UAAU,EAAI/B,EACjD,GAAIO,EAAY,0BAA0BvL,CAAG,EAAG,CAG5C,MAAMgN,EADS,IAAI,YACE,gBAAgBH,EAAK,eAAe,EAAE,gBAC3DG,EAAM,aAAa,YAAa,iBAAiB,EACjD,MAAMC,EAAiB,CACnB,IAAAjN,EACA,SAAA2L,EACA,OAAAoB,EACA,MAAAD,EACA,QAASE,CACzB,EACY,OAAO,IAAI,OAAO,KAAK,OAAO,sBAAsBC,CAAc,CACrE,CACD,MAAMA,EAAiB,CACnB,SAAAtB,EACA,OAAAoB,EACA,MAAAD,EACA,KAAM,CACF,IAAK,6BAA6B,KAAKD,CAAG,IAC1C,OAAQ,IAAI,OAAO,KAAK,MAAM,GAAI,EAAE,CACvC,CACb,EACQ,OAAO,IAAI,OAAO,KAAK,OAAOI,CAAc,CAC/C,CACL,CAyBA,SAASC,GAAOC,EAAOC,EAAO,CAG1B,QAASC,KAAYD,EAAM,UACvBD,EAAM,UAAUE,GAAYD,EAAM,UAAUC,EAEpD,CAIA,MAAMC,EAAgB,CAClB,aAAc,CAMVJ,GAAOI,GAAiB,OAAO,KAAK,WAAW,CAClD,CACL,CAiBA,IAAIC,GACH,SAAUA,EAAuB,CAC9BA,EAAsB,iBAAsB,kBAC5CA,EAAsB,eAAoB,gBAC1CA,EAAsB,cAAmB,OAC7C,GAAGA,IAA0BA,EAAwB,CAAE,EAAC,EACxD,MAAMC,GAA+B,CAAClP,EAAGmP,EAASzN,IAAQ,CACtDA,EAAI,UAAUyN,EAAQ,MAAM,CAChC,EAMA,MAAMC,WAAwBJ,EAAgB,CAC1C,YAAY,CAAE,IAAAtN,EAAK,QAAA0L,EAAU,CAAA,EAAI,iBAAAiC,EAAmB,CAAA,EAAI,UAAAC,EAAY,IAAI7B,GAAsB4B,CAAgB,EAAG,SAAAE,EAAW,IAAIlB,GAAmB,eAAAmB,EAAiBN,IAAiC,CACjM,QACA,KAAK,QAAU,CAAC,GAAG9B,CAAO,EAC1B,KAAK,SAAW,GAChB,KAAK,UAAYkC,EACjB,KAAK,SAAWC,EAChB,KAAK,eAAiBC,EAClB9N,GACA,KAAK,OAAOA,CAAG,CAEtB,CACD,UAAUwL,EAAQuC,EAAQ,CAClB,KAAK,QAAQ,SAASvC,CAAM,IAGhC,KAAK,QAAQ,KAAKA,CAAM,EACnBuC,GACD,KAAK,OAAM,EAElB,CACD,WAAWrC,EAASqC,EAAQ,CACxBrC,EAAQ,QAASF,GAAW,CACxB,KAAK,UAAUA,EAAQ,EAAI,CACvC,CAAS,EACIuC,GACD,KAAK,OAAM,CAElB,CACD,aAAavC,EAAQuC,EAAQ,CACzB,MAAM9J,EAAQ,KAAK,QAAQ,QAAQuH,CAAM,EACzC,OAAIvH,IAAU,GAEH,IAEXsH,EAAY,OAAOC,EAAQ,IAAI,EAC/B,KAAK,QAAQ,OAAOvH,EAAO,CAAC,EACvB8J,GACD,KAAK,OAAM,EAER,GACV,CACD,cAAcrC,EAASqC,EAAQ,CAC3B,IAAIC,EAAU,GACd,OAAAtC,EAAQ,QAASF,GAAW,CACxBwC,EAAU,KAAK,aAAaxC,EAAQ,EAAI,GAAKwC,CACzD,CAAS,EACGA,GAAW,CAACD,GACZ,KAAK,OAAM,EAERC,CACV,CACD,aAAaD,EAAQ,CACjB,KAAK,QAAQ,OAAS,EACjBA,GACD,KAAK,OAAM,CAElB,CAID,QAAS,CACL,MAAM/N,EAAM,KAAK,SACjB,GAAIA,aAAe,OAAO,KAAK,KAAOA,EAAI,gBAAiB,CACvD,OAAO,KAAK,MAAM,QAAQ,KAAMuN,EAAsB,iBAAkB,IAAI,EAC5E,KAAM,CAAE,SAAApF,EAAU,QAAAgE,CAAO,EAAK,KAAK,UAAU,UAAU,CACnD,QAAS,KAAK,QACd,IAAAnM,EACA,oBAAqB,KAAK,cAAe,CACzD,CAAa,EAED,GAAImM,GAAWA,GAAW,KAAW,CAIjC,MAAM8B,EAAe,IAAI,IACzB,UAAWR,KAAWtF,EACdsF,EAAQ,QAAQ,QAAU,GAC1BQ,EAAa,IAAIR,EAAQ,QAAQ,EAAE,EAG3C,MAAMS,EAAe,CAAA,EAErB,UAAWT,KAAW,KAAK,SACnBA,EAAQ,QAAU,OAGlBA,EAAQ,QAAQ,QAAU,EACrBQ,EAAa,IAAIR,EAAQ,MAAM,GAIhClC,EAAY,OAAOkC,EAAQ,OAAQ,IAAI,EAK3CS,EAAa,KAAKT,EAAQ,MAAM,GAGxC,KAAK,SAAWtF,EAChB,KAAK,eAAc,EAEnB,sBAAsB,IAAM+F,EAAa,QAAS1C,GAAWD,EAAY,OAAOC,EAAQ,IAAI,CAAC,CAAC,CACjG,CACD,OAAO,KAAK,MAAM,QAAQ,KAAM+B,EAAsB,eAAgB,IAAI,CAC7E,CACJ,CACD,OAAQ,CACJ,KAAK,aAAe,KAAK,OAAQ,EAAC,YAAY,OAAQ,KAAK,OAAO,KAAK,IAAI,CAAC,EAC5E,KAAK,OAAM,CACd,CACD,UAAW,CACP,OAAO,KAAK,MAAM,eAAe,KAAK,YAAY,EAClD,KAAK,MAAK,CACb,CACD,OAAQ,CACJ,KAAK,QAAQ,QAAS/B,GAAWD,EAAY,OAAOC,EAAQ,IAAI,CAAC,EACjE,KAAK,SAAS,QAASiC,GAAYA,EAAQ,OAAM,CAAE,EACnD,KAAK,SAAW,EACnB,CACD,gBAAiB,CAEb,MAAMb,EAAQ,IAAIJ,GAAa,KAAK,QAAS,KAAK,QAAQ,EACpDxM,EAAM,KAAK,SACjB,KAAK,SAAS,QAASyN,GAAY,CAC3BA,EAAQ,QAAQ,SAAW,EAC3BA,EAAQ,OAASA,EAAQ,QAAQ,IAIjCA,EAAQ,OAAS,KAAK,SAAS,OAAOA,EAASb,EAAO5M,CAAG,EAEzDyN,EAAQ,QAAQ,QAASjC,GAAWD,EAAY,OAAOC,EAAQ,IAAI,CAAC,EAChE,KAAK,gBACLiC,EAAQ,OAAO,YAAY,QAE1BnM,GAAU,CACP,OAAO,KAAK,MAAM,QAAQ,KAAMiM,EAAsB,cAAeE,CAAO,EAC5E,KAAK,eAAenM,EAAOmM,EAASzN,CAAG,CAC/D,CAAqB,GAGTuL,EAAY,OAAOkC,EAAQ,OAAQzN,CAAG,CAClD,CAAS,CACJ,CACL,CC36BA,MAAMb,EAAQ,CACZ,UAAW,CACT,KAAM,OACN,QAAS,IAAI4M,GAAsB,EAAE,EACrC,OAAQ,EACT,EACD,SAAU,CACR,KAAM,OACN,QAAS,IAAIY,GACb,OAAQ,EACT,CACH,EAEMxO,GAAS,CAAC,kBAAmB,eAAe,EAE7CiE,GAAanC,EAAY,CAC5B,YAAad,EACb,OAAAhB,GACA,KAAM,UACN,IAAK,IAAM,CACT,GAAI,OAAOuP,IAAoB,YAAa,CAC1C,MAAMS,EAAe,oCACrB,cAAQ,MAAMA,CAAY,EACpB,IAAI,MAAMA,CAAY,CAC9B,CACA,OAAOT,EACR,EACD,QAAS,CAAC,CAAE,IAAA1N,KAAQoO,CAAc,IAAK,CAAC,CAAE,IAAApO,EAAK,GAAGoO,EAAc,EAChE,YAAYhN,EAAM,CAChB,MAAMiN,EAAkB,IAAM,CAC5B,MAAMC,EAAalN,EAAK,WAAW,EACnCA,EAAK,aAAa,EAClBA,EAAK,WAAWkN,CAAU,CAC5B,EACA,QAASvP,KAAQI,EACXA,EAAMJ,GAAM,QACd,KAAK,IAAIA,EAAK,YAAW,EAAK,WAAYsP,CAAe,CAG9D,EACD,SAAU,CACJ,KAAK,gBACP,KAAK,eAAe,OAAO,CAE9B,EACD,eAAgB,CAEV,KAAK,WAAa,KAAK,UAAU,QACnC,KAAK,UAAU,QAAS7C,GAAW,CAC7BA,EAAO,iBAAmB,KAAK,iBACjCA,EAAO,eAAiB,MAE3B,EAGC,KAAK,gBACP,KAAK,eAAe,aAAa,CAEpC,CACH,CAAC,sCAvEClJ,EAEM,MAAA,KAAA,CADJE,EAAaC,EAAA,OAAA,SAAA,iCCOjB,MAAMtD,GAAQ,CACZ,QAAS,CACP,KAAM,OACN,SAAU,GACV,SAAU,CACR,MAAO,CAAC,CACT,CACF,EACD,SAAU,CACR,KAAM,OACN,OAAQ,EACT,EACD,OAAQ,CACN,KAAM,OACN,OAAQ,EACT,CACH,EAEMhB,GAAS,CAAC,WAAY,QAAS,aAAc,iBAAiB,EAE/DiE,GAAanC,EAAY,CAC5B,YAAad,GACb,OAAAhB,GACA,KAAM,aACN,IAAK,IAAM,OAAO,KAAK,WACvB,MAAO,CACL,OAAQ,CACN,KAAM,QACN,QAAS,EACV,CACF,EAED,OAAQ,CACN,eAAgB,CACd,QAAS,IACV,CACF,EAED,SAAU,CACR,MAAMoQ,EAAK,KAAK,MAAM,WACtBA,EAAG,WAAW,YAAYA,CAAE,CAC7B,EAED,aAAa7Q,EAAS,CAGpB,GAFAA,EAAQ,QAAU,KAAK,MAAM,WAEzB,KAAK,eACP,cAAOA,EAAQ,SACR,KAAK,eAAe,KAAM8Q,IAC/B,KAAK,cAAgBA,EACdA,EACR,CAEJ,EACD,MAAO,CAAC,YAAY,EACpB,QAAS,CACP,iBAAkB,CAChB,KAAK,kBAAkB,MAAM,EACzB,KAAK,QACP,KAAK,kBAAkB,KAAK,KAAK,KAAM,KAAK,aAAa,CAE5D,CACF,EAED,aAAc,CACZ,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,YAAY,aAAc,IAAM,CACrD,KAAK,MAAM,YAAY,EACvB,KAAK,kBAAkB,KAAK,KAAK,KAAM,KAAK,aAAa,EAC1D,EACD,KAAK,OAAO,SAAU,IAAM,CAC1B,KAAK,gBAAgB,EACtB,CACF,CACH,CAAC,EAlFMC,GAAA,CAAA,IAAI,YAAY,2BAArB,OAAAC,EAAA,EAAApM,EAEM,MAFNmM,GAEM,CADJjM,EAAaC,EAAA,OAAA,SAAA,qCCOFkM,GAAA,CACb,MAAO,CAAC,WAAW,EAEnB,MAAO,CACL,MAAO,CACL,iBAAkB,IACnB,CACF,EAED,SAAU,CACJ,OAAO,KAAK,WAAc,YAC5B,KAAK,MAAM,iBAAmB,KAAK,sBAEnC,KAAK,MAAM,iBAAmB,KAAK,SAEtC,EAED,QAAS,CACP,iBAAkB,CAChB,KAAK,OAAQ,CACd,EACD,WAAWC,EAAiB,CAC1B,OAAOA,GAAmB,CAAA,EAAG,SAAS,KAAKA,CAAe,IAAM,mBACjE,EACD,wBAAyB,CACvB,KAAK,UAAU,IAAM,KAAK,gBAAe,CAAE,CAC5C,CACF,EAED,MAAO,CACL,UAAUC,EAAQ,CAEhB,KAAK,MAAM,iBAAmBA,CAC/B,EACD,yBAAyBA,EAAQC,EAAQ,CACnCA,GACFA,EAAO,KAAK,SAAU,KAAK,sBAAsB,CAKpD,CACF,EAED,WAAY,CACN,KAAK,MAAM,kBAAoB,KAAK,WAAW,KAAK,MAAM,iBAAiB,IAAI,GACjF,KAAK,MAAM,iBAAiB,KAAK,SAAU,KAAK,sBAAsB,CAEzE,CACH,ECnBe,SAASC,GAAqB1R,EAAI,CAC/C,IAAI2R,EAAU,EAEd3R,EACE,IAAM,CACJ2R,GAAW,CACZ,EACD,IAAM,CACJA,EAAU,KAAK,IAAI,EAAGA,EAAU,CAAC,CAClC,EACD,IAAMA,IAAY,CACnB,CACH,CChCA,MAAM7P,EAAQ,CACZ,OAAQ,CACN,QAAS,CAAE,IAAK,EAAG,IAAK,CAAG,EAC3B,OAAQ,GACR,KAAM,OACN,OAAQ,EACT,EACD,KAAM,CACJ,SAAU,GACV,OAAQ,GACR,KAAM,OACN,OAAQ,EACT,EACD,QAAS,CACP,SAAU,GACV,OAAQ,GACR,KAAM,OACN,OAAQ,EACT,EACD,QAAS,CACP,SAAU,GACV,OAAQ,GACR,KAAM,OACN,OAAQ,EACT,EACD,QAAS,CACP,KAAM,OACN,OAAQ,EACT,EACD,UAAW,CACT,OAAQ,GACR,KAAM,MACP,EACD,KAAM,CACJ,OAAQ,GACR,KAAM,MACP,EACD,QAAS,CACP,KAAM,OACN,SAAU,CACR,MAAO,CAAC,CACT,CACF,CACH,EAEMhB,GAAS,CACb,iBACA,QACA,WACA,OACA,UACA,YACA,OACA,YACA,WACA,YACA,SACA,aACA,aACF,EAGM8Q,GAAgB,CAAC,QAAS,QAAS,cAAe,WAAW,EAAE,OAAO,CAACC,EAAKC,KAChFD,EAAIC,GAAc,UAAY,CACxB,KAAK,YACP,KAAK,WAAWA,GAAY,MAAM,KAAK,WAAY,SAAS,CAEhE,EACOD,GACN,EAAE,EAGCE,GAAgB,CACpB,QAAS,CACH,KAAK,YACP,OAAO,KAAK,MAAM,QAAQ,KAAK,WAAY,QAAQ,CAEtD,EACD,sBAAuB,CACrB,GAAI,CAAC,KAAK,WACR,OAGF,MAAMC,EAAY,KAAK,WAAW,UAAU,EAC5C,OAAO,KAAK,MAAM,QAAQ,KAAK,WAAY,QAAQ,EACnD,KAAK,WAAW,UAAUA,CAAS,CACpC,EAKD,iBAAkB,CAChB,KAAK,qBAAqB,CAC3B,CACH,EAEKjN,GAAU,CACb,OAAQ,CAACuM,EAAc,EACvB,MAAO/N,EAAsB,CAC3B,GAAGzB,EACH,GAAGhB,GAAO,OACR,CAACyD,EAAKxD,KAAe,CACnB,GAAGwD,EACH,CAAC,KAAKxD,EAAU,OAAO,CAAC,EAAE,gBAAgBA,EAAU,MAAM,CAAC,IAAI,QAC7D,aACA,CAACE,EAAGC,IAAOA,EAAIA,EAAE,YAAY,EAAI,KAC/B,QACN,GACA,CAAC,CACF,CACH,CAAC,EACD,aAAc,GAEd,SAAU,CACR,YAAK,YAAc,IAAI,QAAQ,CAAC+Q,EAASC,IAAW,CAClD,KAAK,oBAAsB,CAAE,QAAAD,EAAS,OAAAC,CAAO,EAC9C,EACM,CACL,YAAa,KAAK,WACpB,CACD,EACD,MAAO,CAAC,iBAAkB,eAAgB,gBAAgB,EAC1D,SAAU,CACR,UAAW,CACT,OAAO,KAAK,QAAU,OAAO,KAAK,OAAO,KAAQ,WAC7C,KAAK,OAAO,IAAI,EAChB,KAAK,OAAO,GACjB,EACD,UAAW,CACT,OAAO,KAAK,QAAU,OAAO,KAAK,OAAO,KAAQ,WAC7C,KAAK,OAAO,IAAI,EAChB,KAAK,OAAO,GACjB,EACD,aAAc,CACZ,MAAO,CAAE,IAAK,KAAK,SAAU,IAAK,KAAK,QAAS,CACjD,CACF,EAED,MAAO,CACL,KAAK3H,EAAM,CACL,KAAK,YACP,KAAK,WAAW,QAAQA,CAAI,CAE/B,CACF,EAED,SAAU,CACR,OAAO,KAAK,oBAAoB,EAC7B,KAAK,IAAM,CAEV,MAAM4H,EAAU,KAAK,MAAM,WAGrB9R,EAAU,CACd,GAAG,KAAK,QACR,GAAGwB,EAAe,KAAMC,CAAK,CAC/B,EACA,cAAOzB,EAAQ,QACf,KAAK,WAAa,IAAI,OAAO,KAAK,IAAI8R,EAAS9R,CAAO,EAGtD2B,EAAU,KAAM,KAAK,WAAYF,CAAK,EAEtCnB,GAAW,KAAM,KAAK,WAAYG,EAAM,EAGxC4Q,GAAqB,CAACU,EAAWC,EAAWC,IAAiB,CAC3D,KAAK,WAAW,YAAY,iBAAkB,IAAM,CAC9CA,EAAY,GACd,KAAK,MAAM,iBAAkB,KAAK,WAAW,UAAS,CAAE,EAE1DD,EAAU,EACX,EAODjR,GAAyB,KAAM,CAAC,WAAY,UAAU,EALjC,IAAM,CACzBgR,EAAU,EACV,KAAK,WAAW,UAAU,KAAK,WAAW,CAC5C,CAEqE,EACtE,EACD,KAAK,WAAW,YAAY,eAAgB,IAAM,CAChD,KAAK,MAAM,eAAgB,KAAK,WAAW,QAAO,CAAE,EACrD,EACD,KAAK,WAAW,YAAY,iBAAkB,IAAM,CAClD,KAAK,MAAM,iBAAkB,KAAK,WAAW,UAAS,CAAE,EACzD,EAED,KAAK,oBAAoB,QAAQ,KAAK,UAAU,EAEzC,KAAK,WACb,EACA,MAAOG,GAAU,CAChB,MAAMA,EACP,CACJ,EACD,QAAS,CACP,GAAGR,GACH,GAAGH,EACJ,CACH,EAxNSR,GAAA,CAAA,MAAM,gBAAgB,sCAF7BnM,EAMM,MAAA,CAND,MAAMuN,GAAA,CAAA,oBAA4BpN,EAAA,OAAO,KAAK,CAAA,IACjDqN,GAAmF,MAAA,CAA9E,IAAI,UAAU,MAAM,UAAW,SAAOrN,EAAM,OAAC,MAAQA,EAAA,OAAO,MAAK,EAAA,WACtEqN,GAEM,MAFNrB,GAEM,CADJjM,EAAaC,EAAA,OAAA,SAAA,IAEfD,EAA4BC,EAAA,OAAA,SAAA,mCCJhC,MAAMtD,GAAQ,CACZ,QAAS,CACP,KAAM,OACN,OAAQ,GACR,QAAS,IAAM,CAAE,CAClB,EACD,KAAM,CACJ,KAAM,MACN,OAAQ,EACT,CACH,EAEMhB,GAAS,CAAE,EAEjB,IAAA4R,GAAe9P,EAAe,CAC5B,YAAad,GACb,KAAM,UACN,IAAK,IAAM,OAAO,KAAK,cAAc,aACrC,OAAAhB,EACF,CAAC,EClBc6R,GAAC9D,GAAU,CACxB,MAAM+D,EAAoB/D,EAAM,iBAAmBA,EAAM,iBAAmBA,EAAM,YAElF,SAASgE,EAAwB1Q,EAAM2Q,EAAU,CAG/C,GAAI3Q,IAAS,UAAW,CACtB,MAAM4Q,EAAeD,EACrBA,EAAW,SAAU7O,EAAO,CAC1B,MAAM+O,EAAqB,SAAS,uBAAuB,mBAAmB,EAAE,OAAS,EACzF,GAAI/O,EAAM,QAAU,IAAM,CAAC+O,EAAoB,CAC7C,MAAMC,EAAiB,SAAS,YAAY,OAAO,EACnDA,EAAe,QAAU,GACzBA,EAAe,MAAQ,GACvBF,EAAa,MAAMlE,EAAO,CAACoE,CAAc,CAAC,CAC3C,CACDF,EAAa,MAAMlE,EAAO,CAAC5K,CAAK,CAAC,CAClC,CACF,CACD2O,EAAkB,MAAM/D,EAAO,CAAC1M,EAAM2Q,CAAQ,CAAC,CAChD,CAEDjE,EAAM,iBAAmBgE,EACzBhE,EAAM,YAAcgE,CACtB,ECfA,MAAMhQ,EAAc,CAClB,OAAQ,CACN,KAAM,MACP,EACD,sBAAuB,CACrB,KAAM,OAGN,OAAQ,EACT,EACD,MAAO,CACL,KAAM,MACN,QAAS,UAAY,CACnB,MAAO,CAAC,CACT,CACF,CACH,EAEMf,GAAQ,CACZ,mBAAoB,CAClB,SAAU,GACV,KAAM,QACN,QAAS,EACV,EACD,QAAS,CACP,KAAM,MACP,CACH,EAEKiD,GAAU,CACb,SAAU,CACR,MAAMmO,EAAQ,KACd,KAAK,sBAAsB,KAAK,IAAM,CAEpC,IAAIC,EAAWD,EAAM,MAAM,MAC3B,GAAIA,EAAM,OAAO,MAAO,CACtB,MAAME,EAAUF,EAAM,OAAO,MAAK,EAAG,GAAG,MAAM,IACxCG,EAAcH,EAAM,OAAO,MAAK,EAAG,GAAG,IAAI,EAAE,IAAI,MAAME,GACxDC,IACFF,EAAWE,EAAY,IAAI,qBAAqB,OAAO,EAAE,GAE7D,CAKA,GAJI,KAAK,oBACPV,GAAmBQ,CAAQ,EAGzB,OAAO,OAAO,KAAK,OAAO,cAAiB,WAC7C,MAAM,IAAI,MACR,2GACF,EAIF,MAAMG,EAAe,CACnB,GAAGzR,EAAe,KAAMgB,CAAW,EACnC,GAAG,KAAK,OACV,EAEA,KAAK,cAAgB,IAAI,OAAO,KAAK,OAAO,aAAasQ,EAAUG,CAAY,EAC/EtR,EAAU,KAAM,KAAK,cAAea,CAAW,EAE/C,KAAK,OAAO,wBAA0Ba,GAAM,CACtCA,IAAM,QACR,KAAK,cAAc,yBAAyBA,CAAC,EAEhD,EAID,KAAK,cAAc,YAAY,gBAAiB,IAAM,CACpD,KAAK,MAAM,gBAAiB,KAAK,cAAc,SAAQ,CAAE,EAC1D,EACF,CACF,EACD,MAAO,CACL,GAAGH,EAAsBV,CAAW,EACpC,GAAGf,EACJ,CACH,kCAzFkBsD,EAAM,OAAA,MACpBD,EAA0CC,+BAAfA,EAAM,MAAA,CAAA,CAAA,EAEhBA,EAAM,OAAA,iBAAzBiM,IAAApM,EAAgF,QAAhFsO,GAAgF,OAA5C,IAAI,SAAgBnO,EAAM,OAAEoO,GAAapO,EAAD,OAAA,EAAA,CAAA,EAAA,KAAA,EAAA,gCCc9E,IAAIqO,GAAU,KAmBC,SAASC,GAAQC,EAAKtT,EAAS,CAC5CA,EAAU,CACR,kBAAmB,GACnB,kBAAmB,GACnB,GAAGA,CACJ,EAEDoT,GAAUG,GAAU,CAClB,KAAM,UAAY,CAChB,MAAO,CAAE,QAAS,IAAM,CACzB,CACL,CAAG,EAED,MAAMC,EAAmBD,GAAW,EAIpC,IAAIE,EAAqBC,GAAuB1T,CAAO,EAEvDsT,EAAI,MAAM,CACR,SAAU,CACR,KAAK,sBAAwBE,EAC7B,KAAK,aAAexT,EACpB,KAAK,oBAAsByT,CAC5B,CACL,CAAG,EACDH,EAAI,sBAAwBE,EAC5BF,EAAI,oBAAsBG,EAEtBzT,EAAQ,oBACVsT,EAAI,UAAU,UAAWK,EAAG,EAC5BL,EAAI,UAAU,aAAcM,EAAM,EAClCN,EAAI,UAAU,iBAAkBO,EAAU,EAC1CP,EAAI,UAAU,cAAeQ,EAAW,EACxCR,EAAI,UAAU,eAAgB7P,EAAQ,EACtC6P,EAAI,UAAU,cAAelP,EAAO,EACpCkP,EAAI,UAAU,aAAc9O,EAAM,EAClC8O,EAAI,UAAU,gBAAiB7O,EAAS,EACxC6O,EAAI,UAAU,mBAAoBS,EAAY,EAC9CT,EAAI,UAAU,cAAejB,EAAO,EAExC,CAEA,SAASqB,GAAuB1T,EAAS,CAEvC,SAASgU,GAAc,CACrB,OAAAZ,GAAQ,QAAU,CAAE,EACb,OAAO,MACf,CAED,GAAIpT,EAAQ,KAEV,OAAON,GAAK,IAGNI,EAAI,WACC,IAAI,QAAQ,IAAM,CAAE,CAAA,EAAE,KAAKkU,CAAW,EAEtC,IAAI,QAAQ,CAACpC,EAASC,IAAW,CACtC,GAAI,CACF,OAAO,kBAAuBD,EAC9BvR,GAAYL,EAAQ,IAAI,CACzB,OAAQiU,EAAP,CACApC,EAAOoC,CAAG,CACX,CACX,CAAS,EAAE,KAAKD,CAAW,CAEtB,EACI,CAIL,MAAM7Q,EAAU,IAAI,QAASyO,GAAY,CACnC9R,EAAI,aAGR,OAAO,kBAAuB8R,EACpC,CAAK,EAAE,KAAKoC,CAAW,EAEnB,OAAOtU,GAAK,IAAMyD,CAAO,CAC1B,CACH,CCnHA,IAAA+Q,GAAeC,GAAK,CAAC,CAAE,IAAAC,KAAU,CAC/BA,EAAI,IAAIC,GAAe,CACrB,KAAM,CACJ,IAAK,0CACL,UAAW,SACZ,CACL,CAAG,CACH,CAAC","debug_id":"3000d6b5-b857-5bc2-b2d8-91d40dc07736"}