@appbaseio/reactivesearch-vue 3.3.0 → 3.3.1

package/dist/@appbaseio/reactivesearch-vue.umd.js

@@ -26,24 +26,24 @@
 	  }, _typeof(o);
 	}
 
-	function _toPrimitive(input, hint) {
-	  if (_typeof(input) !== "object" || input === null) return input;
-	  var prim = input[Symbol.toPrimitive];
-	  if (prim !== undefined) {
-	    var res = prim.call(input, hint || "default");
-	    if (_typeof(res) !== "object") return res;
+	function toPrimitive(t, r) {
+	  if ("object" != _typeof(t) || !t) return t;
+	  var e = t[Symbol.toPrimitive];
+	  if (void 0 !== e) {
+	    var i = e.call(t, r || "default");
+	    if ("object" != _typeof(i)) return i;
 	    throw new TypeError("@@toPrimitive must return a primitive value.");
 	  }
-	  return (hint === "string" ? String : Number)(input);
+	  return ("string" === r ? String : Number)(t);
 	}
 
-	function _toPropertyKey(arg) {
-	  var key = _toPrimitive(arg, "string");
-	  return _typeof(key) === "symbol" ? key : String(key);
+	function toPropertyKey(t) {
+	  var i = toPrimitive(t, "string");
+	  return "symbol" == _typeof(i) ? i : String(i);
 	}
 
 	function _defineProperty(obj, key, value) {
-	  key = _toPropertyKey(key);
+	  key = toPropertyKey(key);
 	  if (key in obj) {
 	    Object.defineProperty(obj, key, {
 	      value: value,
@@ -462,7 +462,6 @@
 	    throw new Error(message);
 	  } catch (e) {} // eslint-disable-line no-empty
 	}
-
 	function getUnexpectedStateShapeWarningMessage(inputState, reducers, action, unexpectedKeyCache) {
 	  var reducerKeys = Object.keys(reducers);
 	  var argumentName = action && action.type === ActionTypes.INIT ? 'preloadedState argument passed to createStore' : 'previous state received by the reducer';
@@ -9526,6 +9525,20 @@
 	    }
 	  }, e;
 	}
+	function _toPrimitive(t, r) {
+	  if ("object" != typeof t || !t) return t;
+	  var e = t[Symbol.toPrimitive];
+	  if (void 0 !== e) {
+	    var i = e.call(t, r || "default");
+	    if ("object" != typeof i) return i;
+	    throw new TypeError("@@toPrimitive must return a primitive value.");
+	  }
+	  return ("string" === r ? String : Number)(t);
+	}
+	function _toPropertyKey(t) {
+	  var i = _toPrimitive(t, "string");
+	  return "symbol" == typeof i ? i : String(i);
+	}
 	function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
 	  try {
 	    var info = gen[key](arg);
@@ -9562,7 +9575,7 @@
 	    descriptor.enumerable = descriptor.enumerable || false;
 	    descriptor.configurable = true;
 	    if ("value" in descriptor) descriptor.writable = true;
-	    Object.defineProperty(target, _toPropertyKey$1(descriptor.key), descriptor);
+	    Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor);
 	  }
 	}
 	function _createClass(Constructor, protoProps, staticProps) {
@@ -9649,20 +9662,6 @@
 	  }
 	  throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 	}
-	function _toPrimitive$1(input, hint) {
-	  if (typeof input !== "object" || input === null) return input;
-	  var prim = input[Symbol.toPrimitive];
-	  if (prim !== undefined) {
-	    var res = prim.call(input, hint || "default");
-	    if (typeof res !== "object") return res;
-	    throw new TypeError("@@toPrimitive must return a primitive value.");
-	  }
-	  return (hint === "string" ? String : Number)(input);
-	}
-	function _toPropertyKey$1(arg) {
-	  var key = _toPrimitive$1(arg, "string");
-	  return typeof key === "symbol" ? key : String(key);
-	}
 
 	/*!
 	 * is-plain-object <https://github.com/jonschlinkert/is-plain-object>
@@ -12757,7 +12756,6 @@
 	   * @private
 	   */
 	};
-
 	function nameToHex(color) {
 	  if (typeof color !== 'string') return color;
 	  var normalizedColorName = color.toLowerCase();
@@ -15796,7 +15794,6 @@
 	    }
 	    block = block << 8 | charCode; // eslint-disable-line no-bitwise
 	  }
-
 	  return output;
 	}
 	function validateRSQuery(query) {
@@ -15901,7 +15898,6 @@
 	  // mongodb
 	  ELASTICSEARCH: 'elasticsearch' // elasticsearch
 	};
-
 	var dataTypes = {
 	  ARRAY: 'array',
 	  FUNCTION: 'function',
@@ -16187,7 +16183,6 @@
 	          }) : transformedRequest.headers,
 	          signal: signal // Attach the abort signal to the fetch request
 	        }));
-
 	        var timeoutPromise = new Promise(function (_, rejectTP) {
 	          if (httpRequestTimeout > 0) {
 	            setTimeout(function () {
@@ -16683,7 +16678,6 @@
 	    }
 	    block = block << 8 | charCode; // eslint-disable-line no-bitwise
 	  }
-
 	  return output;
 	}
 	function validateIndex(index) {
@@ -17808,11 +17802,14 @@
 	};
 
 	/**! 
-	 * hotkeys-js v3.12.0 
+	 * hotkeys-js v3.13.2 
 	 * A simple micro-library for defining and dispatching keyboard shortcuts. It has no dependencies. 
 	 * 
 	 * Copyright (c) 2023 kenny wong <wowohoo@qq.com> 
-	 * https://jaywcjlove.github.io/hotkeys-js 
+	 * https://github.com/jaywcjlove/hotkeys-js.git 
+	 * 
+	 * @website: https://jaywcjlove.github.io/hotkeys-js
+	 
 	 * Licensed under the MIT license 
 	 */
 
@@ -18034,7 +18031,6 @@
 	  if (typeof keyCode === 'string') {
 	    keyCode = code(keyCode); // 转换成键码
 	  }
-
 	  return _downKeys.indexOf(keyCode) !== -1;
 	}
 
@@ -18078,7 +18074,7 @@
 	    _mods[key] = false;
 
 	    // 将修饰键重置为false
-	    for (var k in _modifier) if (_modifier[k] === key) hotkeys[k] = false;
+	    for (var _k in _modifier) if (_modifier[_k] === key) hotkeys[_k] = false;
 	  }
 	}
 	function unbind(keysInfo) {
@@ -18220,8 +18216,8 @@
 	    _mods[key] = true;
 
 	    // 将特殊字符的key注册到 hotkeys 上
-	    for (var k in _modifier) {
-	      if (_modifier[k] === key) hotkeys[k] = true;
+	    for (var _k2 in _modifier) {
+	      if (_modifier[_k2] === key) hotkeys[_k2] = true;
 	    }
 	    if (!asterisk) return;
 	  }
@@ -18295,6 +18291,7 @@
 	  var keydown = true;
 	  var splitKey = '+';
 	  var capture = false;
+	  var single = false; // 单个callback
 
 	  // 对为设定范围的判断
 	  if (method === undefined && typeof option === 'function') {
@@ -18307,10 +18304,13 @@
 	    if (option.keydown !== undefined) keydown = option.keydown; // eslint-disable-line
 	    if (option.capture !== undefined) capture = option.capture; // eslint-disable-line
 	    if (typeof option.splitKey === 'string') splitKey = option.splitKey; // eslint-disable-line
+	    if (option.single === true) single = true; // eslint-disable-line
 	  }
-
 	  if (typeof option === 'string') scope = option;
 
+	  // 如果只允许单个callback，先unbind
+	  if (single) unbind(key, scope);
+
 	  // 对于每个快捷键进行处理
 	  for (; i < keys.length; i++) {
 	    key = keys[i].split(splitKey); // 按键列表
@@ -21743,7 +21743,6 @@
 	  this.tShift.push(0);
 	  this.lineMax = this.bMarks.length - 1; // don't count last fake line
 	}
-
 	StateBlock.prototype.isEmpty = function isEmpty(line) {
 	  return this.bMarks[line] + this.tShift[line] >= this.eMarks[line];
 	};
@@ -22609,7 +22608,6 @@
 	  var lc = ch | 0x20; // to lower case
 	  return lc >= 0x61 /* a */ && lc <= 0x7a /* z */;
 	}
-
 	function htmlblock(state, startLine, endLine, silent) {
 	  var ch,
 	    match,
@@ -23002,7 +23000,6 @@
 	      // go to the next loop iteration:
 	      // insert DD tag and repeat checking
 	    }
-
 	    if (nextLine >= endLine) {
 	      break;
 	    }
@@ -24440,7 +24437,6 @@
 	  var lc = ch | 0x20; // to lower case
 	  return lc >= 0x61 /* a */ && lc <= 0x7a /* z */;
 	}
-
 	function htmltag(state, silent) {
 	  var ch,
 	    match,
@@ -24672,7 +24668,6 @@
 	    highlight: null,
 	    maxNesting: 20 // Internal protection, recursion limit
 	  },
-
 	  components: {
 	    core: {
 	      rules: ['block', 'inline', 'references', 'replacements', 'smartquotes', 'references', 'abbr2', 'footnote_tail']
@@ -24714,7 +24709,6 @@
 	    highlight: null,
 	    maxNesting: 20 // Internal protection, recursion limit
 	  },
-
 	  components: {
 	    // Don't restrict core/block/inline rules
 	    core: {},
@@ -24751,7 +24745,6 @@
 	    highlight: null,
 	    maxNesting: 20 // Internal protection, recursion limit
 	  },
-
 	  components: {
 	    core: {
 	      rules: ['block', 'inline', 'references', 'abbr2']
@@ -25383,7 +25376,6 @@
 	          // TODO: implement isMouseDown
 	          // this.reset()
 	        },
-
 	        click: onClick
 	      };
 	    },
@@ -25511,12 +25503,12 @@
 	    /******/
 	  }
 	  /************************************************************************/
-	  /******/([/* 0 */
+	  /******/([( /* 0 */
 	  /***/function (module, exports, __webpack_require__) {
 	    module.exports = __webpack_require__(1);
 
 	    /***/
-	  }, /* 1 */
+	  }), ( /* 1 */
 	  /***/function (module, exports, __webpack_require__) {
 
 	    Object.defineProperty(exports, "__esModule", {
@@ -25549,7 +25541,7 @@
 	    });
 
 	    /***/
-	  }, /* 2 */
+	  }), ( /* 2 */
 	  /***/function (module, exports) {
 
 	    Object.defineProperty(exports, "__esModule", {
@@ -25708,9 +25700,8 @@
 
 	    /***/
 	  }
-	  /******/]);
+	  /******/)]);
 	});
-
 	unwrapExports(dist);
 	var dist_1 = dist.findAll;
 
@@ -30227,14 +30218,14 @@
 	        if (selectAllLabel && selectAllLabel in currentValue) {
 	          var _currentValue = currentValue,
 	            del = _currentValue[selectAllLabel],
-	            obj = _objectWithoutPropertiesLoose(_currentValue, [selectAllLabel].map(_toPropertyKey$1));
+	            obj = _objectWithoutPropertiesLoose(_currentValue, [selectAllLabel].map(_toPropertyKey));
 	          currentValue = _extends({}, obj);
 	        }
 	      } else {
 	        if (currentValue[value]) {
 	          var _currentValue2 = currentValue,
 	            _del = _currentValue2[value],
-	            rest = _objectWithoutPropertiesLoose(_currentValue2, [value].map(_toPropertyKey$1));
+	            rest = _objectWithoutPropertiesLoose(_currentValue2, [value].map(_toPropertyKey));
 	          currentValue = _extends({}, rest);
 	        } else if (Array.isArray(value)) {
 	          value.forEach(function (val) {
@@ -30246,7 +30237,7 @@
 	        if (selectAllLabel && selectAllLabel in currentValue) {
 	          var _currentValue3 = currentValue,
 	            _del2 = _currentValue3[selectAllLabel],
-	            _obj = _objectWithoutPropertiesLoose(_currentValue3, [selectAllLabel].map(_toPropertyKey$1));
+	            _obj = _objectWithoutPropertiesLoose(_currentValue3, [selectAllLabel].map(_toPropertyKey));
 	          currentValue = _extends({}, _obj);
 	        }
 	        finalValues = Object.keys(currentValue);
@@ -33226,14 +33217,14 @@
 	        if (selectAllLabel && selectAllLabel in currentValue) {
 	          var _currentValue = currentValue,
 	            del = _currentValue[selectAllLabel],
-	            obj = _objectWithoutPropertiesLoose(_currentValue, [selectAllLabel].map(_toPropertyKey$1));
+	            obj = _objectWithoutPropertiesLoose(_currentValue, [selectAllLabel].map(_toPropertyKey));
 	          currentValue = _extends({}, obj);
 	        }
 	      } else {
 	        if (currentValue[value]) {
 	          var _currentValue2 = currentValue,
 	            _del = _currentValue2[value],
-	            rest = _objectWithoutPropertiesLoose(_currentValue2, [value].map(_toPropertyKey$1));
+	            rest = _objectWithoutPropertiesLoose(_currentValue2, [value].map(_toPropertyKey));
 	          currentValue = _extends({}, rest);
 	        } else {
 	          currentValue[value] = true;
@@ -33241,7 +33232,7 @@
 	        if (selectAllLabel && selectAllLabel in currentValue) {
 	          var _currentValue3 = currentValue,
 	            _del2 = _currentValue3[selectAllLabel],
-	            _obj = _objectWithoutPropertiesLoose(_currentValue3, [selectAllLabel].map(_toPropertyKey$1));
+	            _obj = _objectWithoutPropertiesLoose(_currentValue3, [selectAllLabel].map(_toPropertyKey));
 	          currentValue = _extends({}, _obj);
 	        }
 	        finalValues = Object.keys(currentValue);
@@ -36383,7 +36374,7 @@
 	        });
 	        var _selectedValues = selectedValues,
 	          del = _selectedValues[item],
-	          selected = _objectWithoutPropertiesLoose(_selectedValues, [item].map(_toPropertyKey$1));
+	          selected = _objectWithoutPropertiesLoose(_selectedValues, [item].map(_toPropertyKey));
 	        selectedValues = selected;
 	      } else {
 	        var _extends2;
@@ -38514,10 +38505,9 @@
 	}
 
 	script.render = render;
-	script.__file = "node_modules/vue-google-maps-community-fork/src/components/marker.vue";
+	script.__file = "node_modules/@appbaseio/vue-google-maps-community-fork/src/components/marker.vue";
 
-	// do not edit .js files directly - edit src/index.jst
-	var fastDeepEqual = function equal(a, b) {
+	function equal(a, b) {
 	  if (a === b) return true;
 	  if (a && b && typeof a == 'object' && typeof b == 'object') {
 	    if (a.constructor !== b.constructor) return false;
@@ -38528,6 +38518,32 @@
 	      for (i = length; i-- !== 0;) if (!equal(a[i], b[i])) return false;
 	      return true;
 	    }
+	    if (a instanceof Map && b instanceof Map) {
+	      if (a.size !== b.size) return false;
+	      for (var _iterator = _createForOfIteratorHelperLoose(a.entries()), _step; !(_step = _iterator()).done;) {
+	        i = _step.value;
+	        if (!b.has(i[0])) return false;
+	      }
+	      for (var _iterator2 = _createForOfIteratorHelperLoose(a.entries()), _step2; !(_step2 = _iterator2()).done;) {
+	        i = _step2.value;
+	        if (!equal(i[1], b.get(i[0]))) return false;
+	      }
+	      return true;
+	    }
+	    if (a instanceof Set && b instanceof Set) {
+	      if (a.size !== b.size) return false;
+	      for (var _iterator3 = _createForOfIteratorHelperLoose(a.entries()), _step3; !(_step3 = _iterator3()).done;) {
+	        i = _step3.value;
+	        if (!b.has(i[0])) return false;
+	      }
+	      return true;
+	    }
+	    if (ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {
+	      length = a.length;
+	      if (length != b.length) return false;
+	      for (i = length; i-- !== 0;) if (a[i] !== b[i]) return false;
+	      return true;
+	    }
 	    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;
 	    if (a.valueOf !== Object.prototype.valueOf) return a.valueOf() === b.valueOf();
 	    if (a.toString !== Object.prototype.toString) return a.toString() === b.toString();
@@ -38544,254 +38560,16 @@
 
 	  // true if both NaN, false otherwise
 	  return a !== a && b !== b;
-	};
-
-	var ARRAY_TYPES = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array];
-
-	/** @typedef {Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor} TypedArrayConstructor */
-
-	var VERSION = 1; // serialized format version
-	var HEADER_SIZE = 8;
-	var KDBush = /*#__PURE__*/function () {
-	  /**
-	   * Creates an index from raw `ArrayBuffer` data.
-	   * @param {ArrayBuffer} data
-	   */
-	  KDBush.from = function from(data) {
-	    if (!(data instanceof ArrayBuffer)) {
-	      throw new Error('Data must be an instance of ArrayBuffer.');
-	    }
-	    var _Uint8Array = new Uint8Array(data, 0, 2),
-	      magic = _Uint8Array[0],
-	      versionAndType = _Uint8Array[1];
-	    if (magic !== 0xdb) {
-	      throw new Error('Data does not appear to be in a KDBush format.');
-	    }
-	    var version = versionAndType >> 4;
-	    if (version !== VERSION) {
-	      throw new Error("Got v" + version + " data when expected v" + VERSION + ".");
-	    }
-	    var ArrayType = ARRAY_TYPES[versionAndType & 0x0f];
-	    if (!ArrayType) {
-	      throw new Error('Unrecognized array type.');
-	    }
-	    var _Uint16Array = new Uint16Array(data, 2, 1),
-	      nodeSize = _Uint16Array[0];
-	    var _Uint32Array = new Uint32Array(data, 4, 1),
-	      numItems = _Uint32Array[0];
-	    return new KDBush(numItems, nodeSize, ArrayType, data);
-	  }
-
-	  /**
-	   * Creates an index that will hold a given number of items.
-	   * @param {number} numItems
-	   * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).
-	   * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
-	   * @param {ArrayBuffer} [data] (For internal use only)
-	   */;
-	  function KDBush(numItems, nodeSize, ArrayType, data) {
-	    if (nodeSize === void 0) {
-	      nodeSize = 64;
-	    }
-	    if (ArrayType === void 0) {
-	      ArrayType = Float64Array;
-	    }
-	    if (isNaN(numItems) || numItems < 0) throw new Error("Unpexpected numItems value: " + numItems + ".");
-	    this.numItems = +numItems;
-	    this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);
-	    this.ArrayType = ArrayType;
-	    this.IndexArrayType = numItems < 65536 ? Uint16Array : Uint32Array;
-	    var arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);
-	    var coordsByteSize = numItems * 2 * this.ArrayType.BYTES_PER_ELEMENT;
-	    var idsByteSize = numItems * this.IndexArrayType.BYTES_PER_ELEMENT;
-	    var padCoords = (8 - idsByteSize % 8) % 8;
-	    if (arrayTypeIndex < 0) {
-	      throw new Error("Unexpected typed array class: " + ArrayType + ".");
-	    }
-	    if (data && data instanceof ArrayBuffer) {
-	      // reconstruct an index from a buffer
-	      this.data = data;
-	      this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);
-	      this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);
-	      this._pos = numItems * 2;
-	      this._finished = true;
-	    } else {
-	      // initialize a new index
-	      this.data = new ArrayBuffer(HEADER_SIZE + coordsByteSize + idsByteSize + padCoords);
-	      this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);
-	      this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);
-	      this._pos = 0;
-	      this._finished = false;
-
-	      // set header
-	      new Uint8Array(this.data, 0, 2).set([0xdb, (VERSION << 4) + arrayTypeIndex]);
-	      new Uint16Array(this.data, 2, 1)[0] = nodeSize;
-	      new Uint32Array(this.data, 4, 1)[0] = numItems;
-	    }
-	  }
-
-	  /**
-	   * Add a point to the index.
-	   * @param {number} x
-	   * @param {number} y
-	   * @returns {number} An incremental index associated with the added item (starting from `0`).
-	   */
-	  var _proto = KDBush.prototype;
-	  _proto.add = function add(x, y) {
-	    var index = this._pos >> 1;
-	    this.ids[index] = index;
-	    this.coords[this._pos++] = x;
-	    this.coords[this._pos++] = y;
-	    return index;
-	  }
-
-	  /**
-	   * Perform indexing of the added points.
-	   */;
-	  _proto.finish = function finish() {
-	    var numAdded = this._pos >> 1;
-	    if (numAdded !== this.numItems) {
-	      throw new Error("Added " + numAdded + " items when expected " + this.numItems + ".");
-	    }
-	    // kd-sort both arrays for efficient search
-	    sort(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0);
-	    this._finished = true;
-	    return this;
-	  }
-
-	  /**
-	   * Search the index for items within a given bounding box.
-	   * @param {number} minX
-	   * @param {number} minY
-	   * @param {number} maxX
-	   * @param {number} maxY
-	   * @returns {number[]} An array of indices correponding to the found items.
-	   */;
-	  _proto.range = function range(minX, minY, maxX, maxY) {
-	    if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');
-	    var ids = this.ids,
-	      coords = this.coords,
-	      nodeSize = this.nodeSize;
-	    var stack = [0, ids.length - 1, 0];
-	    var result = [];
-
-	    // recursively search for items in range in the kd-sorted arrays
-	    while (stack.length) {
-	      var axis = stack.pop() || 0;
-	      var right = stack.pop() || 0;
-	      var left = stack.pop() || 0;
-
-	      // if we reached "tree node", search linearly
-	      if (right - left <= nodeSize) {
-	        for (var i = left; i <= right; i++) {
-	          var _x = coords[2 * i];
-	          var _y = coords[2 * i + 1];
-	          if (_x >= minX && _x <= maxX && _y >= minY && _y <= maxY) result.push(ids[i]);
-	        }
-	        continue;
-	      }
-
-	      // otherwise find the middle index
-	      var m = left + right >> 1;
-
-	      // include the middle item if it's in range
-	      var x = coords[2 * m];
-	      var y = coords[2 * m + 1];
-	      if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[m]);
-
-	      // queue search in halves that intersect the query
-	      if (axis === 0 ? minX <= x : minY <= y) {
-	        stack.push(left);
-	        stack.push(m - 1);
-	        stack.push(1 - axis);
-	      }
-	      if (axis === 0 ? maxX >= x : maxY >= y) {
-	        stack.push(m + 1);
-	        stack.push(right);
-	        stack.push(1 - axis);
-	      }
-	    }
-	    return result;
-	  }
-
-	  /**
-	   * Search the index for items within a given radius.
-	   * @param {number} qx
-	   * @param {number} qy
-	   * @param {number} r Query radius.
-	   * @returns {number[]} An array of indices correponding to the found items.
-	   */;
-	  _proto.within = function within(qx, qy, r) {
-	    if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');
-	    var ids = this.ids,
-	      coords = this.coords,
-	      nodeSize = this.nodeSize;
-	    var stack = [0, ids.length - 1, 0];
-	    var result = [];
-	    var r2 = r * r;
-
-	    // recursively search for items within radius in the kd-sorted arrays
-	    while (stack.length) {
-	      var axis = stack.pop() || 0;
-	      var right = stack.pop() || 0;
-	      var left = stack.pop() || 0;
-
-	      // if we reached "tree node", search linearly
-	      if (right - left <= nodeSize) {
-	        for (var i = left; i <= right; i++) {
-	          if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) result.push(ids[i]);
-	        }
-	        continue;
-	      }
-
-	      // otherwise find the middle index
-	      var m = left + right >> 1;
-
-	      // include the middle item if it's in range
-	      var x = coords[2 * m];
-	      var y = coords[2 * m + 1];
-	      if (sqDist(x, y, qx, qy) <= r2) result.push(ids[m]);
+	}
 
-	      // queue search in halves that intersect the query
-	      if (axis === 0 ? qx - r <= x : qy - r <= y) {
-	        stack.push(left);
-	        stack.push(m - 1);
-	        stack.push(1 - axis);
-	      }
-	      if (axis === 0 ? qx + r >= x : qy + r >= y) {
-	        stack.push(m + 1);
-	        stack.push(right);
-	        stack.push(1 - axis);
-	      }
-	    }
-	    return result;
-	  };
-	  return KDBush;
-	}();
-	function sort(ids, coords, nodeSize, left, right, axis) {
+	function sortKD(ids, coords, nodeSize, left, right, depth) {
 	  if (right - left <= nodeSize) return;
-	  var m = left + right >> 1; // middle index
-
-	  // sort ids and coords around the middle index so that the halves lie
-	  // either left/right or top/bottom correspondingly (taking turns)
-	  select(ids, coords, m, left, right, axis);
-
-	  // recursively kd-sort first half and second half on the opposite axis
-	  sort(ids, coords, nodeSize, left, m - 1, 1 - axis);
-	  sort(ids, coords, nodeSize, m + 1, right, 1 - axis);
+	  var m = left + right >> 1;
+	  select(ids, coords, m, left, right, depth % 2);
+	  sortKD(ids, coords, nodeSize, left, m - 1, depth + 1);
+	  sortKD(ids, coords, nodeSize, m + 1, right, depth + 1);
 	}
-
-	/**
-	 * Custom Floyd-Rivest selection algorithm: sort ids and coords so that
-	 * [left..k-1] items are smaller than k-th item (on either x or y axis)
-	 * @param {Uint16Array | Uint32Array} ids
-	 * @param {InstanceType<TypedArrayConstructor>} coords
-	 * @param {number} k
-	 * @param {number} left
-	 * @param {number} right
-	 * @param {number} axis
-	 */
-	function select(ids, coords, k, left, right, axis) {
+	function select(ids, coords, k, left, right, inc) {
 	  while (right > left) {
 	    if (right - left > 600) {
 	      var n = right - left + 1;
@@ -38801,21 +38579,21 @@
 	      var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
 	      var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
 	      var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
-	      select(ids, coords, k, newLeft, newRight, axis);
+	      select(ids, coords, k, newLeft, newRight, inc);
 	    }
-	    var t = coords[2 * k + axis];
+	    var t = coords[2 * k + inc];
 	    var i = left;
 	    var j = right;
 	    swapItem(ids, coords, left, k);
-	    if (coords[2 * right + axis] > t) swapItem(ids, coords, left, right);
+	    if (coords[2 * right + inc] > t) swapItem(ids, coords, left, right);
 	    while (i < j) {
 	      swapItem(ids, coords, i, j);
 	      i++;
 	      j--;
-	      while (coords[2 * i + axis] < t) i++;
-	      while (coords[2 * j + axis] > t) j--;
+	      while (coords[2 * i + inc] < t) i++;
+	      while (coords[2 * j + inc] > t) j--;
 	    }
-	    if (coords[2 * left + axis] === t) swapItem(ids, coords, left, j);else {
+	    if (coords[2 * left + inc] === t) swapItem(ids, coords, left, j);else {
 	      j++;
 	      swapItem(ids, coords, j, right);
 	    }
@@ -38823,42 +38601,132 @@
 	    if (k <= j) right = j - 1;
 	  }
 	}
-
-	/**
-	 * @param {Uint16Array | Uint32Array} ids
-	 * @param {InstanceType<TypedArrayConstructor>} coords
-	 * @param {number} i
-	 * @param {number} j
-	 */
 	function swapItem(ids, coords, i, j) {
 	  swap(ids, i, j);
 	  swap(coords, 2 * i, 2 * j);
 	  swap(coords, 2 * i + 1, 2 * j + 1);
 	}
-
-	/**
-	 * @param {InstanceType<TypedArrayConstructor>} arr
-	 * @param {number} i
-	 * @param {number} j
-	 */
 	function swap(arr, i, j) {
 	  var tmp = arr[i];
 	  arr[i] = arr[j];
 	  arr[j] = tmp;
 	}
 
-	/**
-	 * @param {number} ax
-	 * @param {number} ay
-	 * @param {number} bx
-	 * @param {number} by
-	 */
+	function range(ids, coords, minX, minY, maxX, maxY, nodeSize) {
+	  var stack = [0, ids.length - 1, 0];
+	  var result = [];
+	  var x, y;
+	  while (stack.length) {
+	    var axis = stack.pop();
+	    var right = stack.pop();
+	    var left = stack.pop();
+	    if (right - left <= nodeSize) {
+	      for (var i = left; i <= right; i++) {
+	        x = coords[2 * i];
+	        y = coords[2 * i + 1];
+	        if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[i]);
+	      }
+	      continue;
+	    }
+	    var m = Math.floor((left + right) / 2);
+	    x = coords[2 * m];
+	    y = coords[2 * m + 1];
+	    if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[m]);
+	    var nextAxis = (axis + 1) % 2;
+	    if (axis === 0 ? minX <= x : minY <= y) {
+	      stack.push(left);
+	      stack.push(m - 1);
+	      stack.push(nextAxis);
+	    }
+	    if (axis === 0 ? maxX >= x : maxY >= y) {
+	      stack.push(m + 1);
+	      stack.push(right);
+	      stack.push(nextAxis);
+	    }
+	  }
+	  return result;
+	}
+
+	function within(ids, coords, qx, qy, r, nodeSize) {
+	  var stack = [0, ids.length - 1, 0];
+	  var result = [];
+	  var r2 = r * r;
+	  while (stack.length) {
+	    var axis = stack.pop();
+	    var right = stack.pop();
+	    var left = stack.pop();
+	    if (right - left <= nodeSize) {
+	      for (var i = left; i <= right; i++) {
+	        if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) result.push(ids[i]);
+	      }
+	      continue;
+	    }
+	    var m = Math.floor((left + right) / 2);
+	    var x = coords[2 * m];
+	    var y = coords[2 * m + 1];
+	    if (sqDist(x, y, qx, qy) <= r2) result.push(ids[m]);
+	    var nextAxis = (axis + 1) % 2;
+	    if (axis === 0 ? qx - r <= x : qy - r <= y) {
+	      stack.push(left);
+	      stack.push(m - 1);
+	      stack.push(nextAxis);
+	    }
+	    if (axis === 0 ? qx + r >= x : qy + r >= y) {
+	      stack.push(m + 1);
+	      stack.push(right);
+	      stack.push(nextAxis);
+	    }
+	  }
+	  return result;
+	}
 	function sqDist(ax, ay, bx, by) {
 	  var dx = ax - bx;
 	  var dy = ay - by;
 	  return dx * dx + dy * dy;
 	}
 
+	var defaultGetX = function defaultGetX(p) {
+	  return p[0];
+	};
+	var defaultGetY = function defaultGetY(p) {
+	  return p[1];
+	};
+	var KDBush = /*#__PURE__*/function () {
+	  function KDBush(points, getX, getY, nodeSize, ArrayType) {
+	    if (getX === void 0) {
+	      getX = defaultGetX;
+	    }
+	    if (getY === void 0) {
+	      getY = defaultGetY;
+	    }
+	    if (nodeSize === void 0) {
+	      nodeSize = 64;
+	    }
+	    if (ArrayType === void 0) {
+	      ArrayType = Float64Array;
+	    }
+	    this.nodeSize = nodeSize;
+	    this.points = points;
+	    var IndexArrayType = points.length < 65536 ? Uint16Array : Uint32Array;
+	    var ids = this.ids = new IndexArrayType(points.length);
+	    var coords = this.coords = new ArrayType(points.length * 2);
+	    for (var i = 0; i < points.length; i++) {
+	      ids[i] = i;
+	      coords[2 * i] = getX(points[i]);
+	      coords[2 * i + 1] = getY(points[i]);
+	    }
+	    sortKD(ids, coords, nodeSize, 0, ids.length - 1, 0);
+	  }
+	  var _proto = KDBush.prototype;
+	  _proto.range = function range$1(minX, minY, maxX, maxY) {
+	    return range(this.ids, this.coords, minX, minY, maxX, maxY, this.nodeSize);
+	  };
+	  _proto.within = function within$1(x, y, r) {
+	    return within(this.ids, this.coords, x, y, r, this.nodeSize);
+	  };
+	  return KDBush;
+	}();
+
 	var defaultOptions = {
 	  minZoom: 0,
 	  // min zoom to generate clusters on
@@ -38886,62 +38754,36 @@
 	    return props;
 	  } // props => ({sum: props.my_value})
 	};
-
 	var fround = Math.fround || function (tmp) {
 	  return function (x) {
 	    tmp[0] = +x;
 	    return tmp[0];
 	  };
 	}(new Float32Array(1));
-	var OFFSET_ZOOM = 2;
-	var OFFSET_ID = 3;
-	var OFFSET_PARENT = 4;
-	var OFFSET_NUM = 5;
-	var OFFSET_PROP = 6;
 	var Supercluster = /*#__PURE__*/function () {
 	  function Supercluster(options) {
-	    this.options = Object.assign(Object.create(defaultOptions), options);
+	    this.options = extend(Object.create(defaultOptions), options);
 	    this.trees = new Array(this.options.maxZoom + 1);
-	    this.stride = this.options.reduce ? 7 : 6;
-	    this.clusterProps = [];
 	  }
 	  var _proto = Supercluster.prototype;
 	  _proto.load = function load(points) {
 	    var _this$options = this.options,
 	      log = _this$options.log,
 	      minZoom = _this$options.minZoom,
-	      maxZoom = _this$options.maxZoom;
+	      maxZoom = _this$options.maxZoom,
+	      nodeSize = _this$options.nodeSize;
 	    if (log) console.time('total time');
 	    var timerId = "prepare " + points.length + " points";
 	    if (log) console.time(timerId);
 	    this.points = points;
 
 	    // generate a cluster object for each point and index input points into a KD-tree
-	    var data = [];
+	    var clusters = [];
 	    for (var i = 0; i < points.length; i++) {
-	      var p = points[i];
-	      if (!p.geometry) continue;
-	      var _p$geometry$coordinat = p.geometry.coordinates,
-	        lng = _p$geometry$coordinat[0],
-	        lat = _p$geometry$coordinat[1];
-	      var x = fround(lngX(lng));
-	      var y = fround(latY(lat));
-	      // store internal point/cluster data in flat numeric arrays for performance
-	      data.push(x, y,
-	      // projected point coordinates
-	      Infinity,
-	      // the last zoom the point was processed at
-	      i,
-	      // index of the source feature in the original input array
-	      -1,
-	      // parent cluster id
-	      1 // number of points in a cluster
-	      );
-
-	      if (this.options.reduce) data.push(0); // noop
+	      if (!points[i].geometry) continue;
+	      clusters.push(createPointCluster(points[i], i));
 	    }
-
-	    var tree = this.trees[maxZoom + 1] = this._createTree(data);
+	    this.trees[maxZoom + 1] = new KDBush(clusters, getX, getY, nodeSize, Float32Array);
 	    if (log) console.timeEnd(timerId);
 
 	    // cluster points on max zoom, then cluster the results on previous zoom, etc.;
@@ -38950,8 +38792,9 @@
 	      var now = +Date.now();
 
 	      // create a new set of clusters for the zoom and index them with a KD-tree
-	      tree = this.trees[z] = this._createTree(this._cluster(tree, z));
-	      if (log) console.log('z%d: %d clusters in %dms', z, tree.numItems, +Date.now() - now);
+	      clusters = this._cluster(clusters, z);
+	      this.trees[z] = new KDBush(clusters, getX, getY, nodeSize, Float32Array);
+	      if (log) console.log('z%d: %d clusters in %dms', z, clusters.length, +Date.now() - now);
 	    }
 	    if (log) console.timeEnd('total time');
 	    return this;
@@ -38971,12 +38814,11 @@
 	    }
 	    var tree = this.trees[this._limitZoom(zoom)];
 	    var ids = tree.range(lngX(minLng), latY(maxLat), lngX(maxLng), latY(minLat));
-	    var data = tree.data;
 	    var clusters = [];
 	    for (var _iterator = _createForOfIteratorHelperLoose(ids), _step; !(_step = _iterator()).done;) {
 	      var id = _step.value;
-	      var k = this.stride * id;
-	      clusters.push(data[k + OFFSET_NUM] > 1 ? getClusterJSON(data, k, this.clusterProps) : this.points[data[k + OFFSET_ID]]);
+	      var c = tree.points[id];
+	      clusters.push(c.numPoints ? getClusterJSON(c) : this.points[c.index]);
 	    }
 	    return clusters;
 	  };
@@ -38984,20 +38826,18 @@
 	    var originId = this._getOriginId(clusterId);
 	    var originZoom = this._getOriginZoom(clusterId);
 	    var errorMsg = 'No cluster with the specified id.';
-	    var tree = this.trees[originZoom];
-	    if (!tree) throw new Error(errorMsg);
-	    var data = tree.data;
-	    if (originId * this.stride >= data.length) throw new Error(errorMsg);
+	    var index = this.trees[originZoom];
+	    if (!index) throw new Error(errorMsg);
+	    var origin = index.points[originId];
+	    if (!origin) throw new Error(errorMsg);
 	    var r = this.options.radius / (this.options.extent * Math.pow(2, originZoom - 1));
-	    var x = data[originId * this.stride];
-	    var y = data[originId * this.stride + 1];
-	    var ids = tree.within(x, y, r);
+	    var ids = index.within(origin.x, origin.y, r);
 	    var children = [];
 	    for (var _iterator2 = _createForOfIteratorHelperLoose(ids), _step2; !(_step2 = _iterator2()).done;) {
 	      var id = _step2.value;
-	      var k = id * this.stride;
-	      if (data[k + OFFSET_PARENT] === clusterId) {
-	        children.push(data[k + OFFSET_NUM] > 1 ? getClusterJSON(data, k, this.clusterProps) : this.points[data[k + OFFSET_ID]]);
+	      var c = index.points[id];
+	      if (c.parentId === clusterId) {
+	        children.push(c.numPoints ? getClusterJSON(c) : this.points[c.index]);
 	      }
 	    }
 	    if (children.length === 0) throw new Error(errorMsg);
@@ -39022,12 +38862,12 @@
 	    var tile = {
 	      features: []
 	    };
-	    this._addTileFeatures(tree.range((x - p) / z2, top, (x + 1 + p) / z2, bottom), tree.data, x, y, z2, tile);
+	    this._addTileFeatures(tree.range((x - p) / z2, top, (x + 1 + p) / z2, bottom), tree.points, x, y, z2, tile);
 	    if (x === 0) {
-	      this._addTileFeatures(tree.range(1 - p / z2, top, 1, bottom), tree.data, z2, y, z2, tile);
+	      this._addTileFeatures(tree.range(1 - p / z2, top, 1, bottom), tree.points, z2, y, z2, tile);
 	    }
 	    if (x === z2 - 1) {
-	      this._addTileFeatures(tree.range(0, top, p / z2, bottom), tree.data, -1, y, z2, tile);
+	      this._addTileFeatures(tree.range(0, top, p / z2, bottom), tree.points, -1, y, z2, tile);
 	    }
 	    return tile.features.length ? tile : null;
 	  };
@@ -39066,33 +38906,23 @@
 	    }
 	    return skipped;
 	  };
-	  _proto._createTree = function _createTree(data) {
-	    var tree = new KDBush(data.length / this.stride | 0, this.options.nodeSize, Float32Array);
-	    for (var i = 0; i < data.length; i += this.stride) tree.add(data[i], data[i + 1]);
-	    tree.finish();
-	    tree.data = data;
-	    return tree;
-	  };
-	  _proto._addTileFeatures = function _addTileFeatures(ids, data, x, y, z2, tile) {
+	  _proto._addTileFeatures = function _addTileFeatures(ids, points, x, y, z2, tile) {
 	    for (var _iterator4 = _createForOfIteratorHelperLoose(ids), _step4; !(_step4 = _iterator4()).done;) {
 	      var i = _step4.value;
-	      var k = i * this.stride;
-	      var isCluster = data[k + OFFSET_NUM] > 1;
+	      var c = points[i];
+	      var isCluster = c.numPoints;
 	      var tags = void 0,
 	        px = void 0,
 	        py = void 0;
 	      if (isCluster) {
-	        tags = getClusterProperties(data, k, this.clusterProps);
-	        px = data[k];
-	        py = data[k + 1];
+	        tags = getClusterProperties(c);
+	        px = c.x;
+	        py = c.y;
 	      } else {
-	        var p = this.points[data[k + OFFSET_ID]];
+	        var p = this.points[c.index];
 	        tags = p.properties;
-	        var _p$geometry$coordinat2 = p.geometry.coordinates,
-	          lng = _p$geometry$coordinat2[0],
-	          lat = _p$geometry$coordinat2[1];
-	        px = lngX(lng);
-	        py = latY(lat);
+	        px = lngX(p.geometry.coordinates[0]);
+	        py = latY(p.geometry.coordinates[1]);
 	      }
 	      var f = {
 	        type: 1,
@@ -39102,12 +38932,14 @@
 
 	      // assign id
 	      var id = void 0;
-	      if (isCluster || this.options.generateId) {
-	        // optionally generate id for points
-	        id = data[k + OFFSET_ID];
-	      } else {
+	      if (isCluster) {
+	        id = c.id;
+	      } else if (this.options.generateId) {
+	        // optionally generate id
+	        id = c.index;
+	      } else if (this.points[c.index].id) {
 	        // keep id if already assigned
-	        id = this.points[data[k + OFFSET_ID]].id;
+	        id = this.points[c.index].id;
 	      }
 	      if (id !== undefined) f.id = id;
 	      tile.features.push(f);
@@ -39116,84 +38948,76 @@
 	  _proto._limitZoom = function _limitZoom(z) {
 	    return Math.max(this.options.minZoom, Math.min(Math.floor(+z), this.options.maxZoom + 1));
 	  };
-	  _proto._cluster = function _cluster(tree, zoom) {
+	  _proto._cluster = function _cluster(points, zoom) {
+	    var clusters = [];
 	    var _this$options3 = this.options,
 	      radius = _this$options3.radius,
 	      extent = _this$options3.extent,
 	      reduce = _this$options3.reduce,
 	      minPoints = _this$options3.minPoints;
 	    var r = radius / (extent * Math.pow(2, zoom));
-	    var data = tree.data;
-	    var nextData = [];
-	    var stride = this.stride;
 
 	    // loop through each point
-	    for (var i = 0; i < data.length; i += stride) {
+	    for (var i = 0; i < points.length; i++) {
+	      var p = points[i];
 	      // if we've already visited the point at this zoom level, skip it
-	      if (data[i + OFFSET_ZOOM] <= zoom) continue;
-	      data[i + OFFSET_ZOOM] = zoom;
+	      if (p.zoom <= zoom) continue;
+	      p.zoom = zoom;
 
 	      // find all nearby points
-	      var x = data[i];
-	      var y = data[i + 1];
-	      var neighborIds = tree.within(data[i], data[i + 1], r);
-	      var numPointsOrigin = data[i + OFFSET_NUM];
+	      var tree = this.trees[zoom + 1];
+	      var neighborIds = tree.within(p.x, p.y, r);
+	      var numPointsOrigin = p.numPoints || 1;
 	      var numPoints = numPointsOrigin;
 
 	      // count the number of points in a potential cluster
 	      for (var _iterator5 = _createForOfIteratorHelperLoose(neighborIds), _step5; !(_step5 = _iterator5()).done;) {
 	        var _neighborId2 = _step5.value;
-	        var _k2 = _neighborId2 * stride;
+	        var _b2 = tree.points[_neighborId2];
 	        // filter out neighbors that are already processed
-	        if (data[_k2 + OFFSET_ZOOM] > zoom) numPoints += data[_k2 + OFFSET_NUM];
+	        if (_b2.zoom > zoom) numPoints += _b2.numPoints || 1;
 	      }
 
 	      // if there were neighbors to merge, and there are enough points to form a cluster
 	      if (numPoints > numPointsOrigin && numPoints >= minPoints) {
-	        var wx = x * numPointsOrigin;
-	        var wy = y * numPointsOrigin;
-	        var clusterProperties = void 0;
-	        var clusterPropIndex = -1;
+	        var wx = p.x * numPointsOrigin;
+	        var wy = p.y * numPointsOrigin;
+	        var clusterProperties = reduce && numPointsOrigin > 1 ? this._map(p, true) : null;
 
 	        // encode both zoom and point index on which the cluster originated -- offset by total length of features
-	        var id = ((i / stride | 0) << 5) + (zoom + 1) + this.points.length;
+	        var id = (i << 5) + (zoom + 1) + this.points.length;
 	        for (var _iterator6 = _createForOfIteratorHelperLoose(neighborIds), _step6; !(_step6 = _iterator6()).done;) {
 	          var neighborId = _step6.value;
-	          var k = neighborId * stride;
-	          if (data[k + OFFSET_ZOOM] <= zoom) continue;
-	          data[k + OFFSET_ZOOM] = zoom; // save the zoom (so it doesn't get processed twice)
-
-	          var numPoints2 = data[k + OFFSET_NUM];
-	          wx += data[k] * numPoints2; // accumulate coordinates for calculating weighted center
-	          wy += data[k + 1] * numPoints2;
-	          data[k + OFFSET_PARENT] = id;
+	          var b = tree.points[neighborId];
+	          if (b.zoom <= zoom) continue;
+	          b.zoom = zoom; // save the zoom (so it doesn't get processed twice)
+
+	          var numPoints2 = b.numPoints || 1;
+	          wx += b.x * numPoints2; // accumulate coordinates for calculating weighted center
+	          wy += b.y * numPoints2;
+	          b.parentId = id;
 	          if (reduce) {
-	            if (!clusterProperties) {
-	              clusterProperties = this._map(data, i, true);
-	              clusterPropIndex = this.clusterProps.length;
-	              this.clusterProps.push(clusterProperties);
-	            }
-	            reduce(clusterProperties, this._map(data, k));
+	            if (!clusterProperties) clusterProperties = this._map(p, true);
+	            reduce(clusterProperties, this._map(b));
 	          }
 	        }
-	        data[i + OFFSET_PARENT] = id;
-	        nextData.push(wx / numPoints, wy / numPoints, Infinity, id, -1, numPoints);
-	        if (reduce) nextData.push(clusterPropIndex);
+	        p.parentId = id;
+	        clusters.push(createCluster(wx / numPoints, wy / numPoints, id, numPoints, clusterProperties));
 	      } else {
 	        // left points as unclustered
-	        for (var j = 0; j < stride; j++) nextData.push(data[i + j]);
+	        clusters.push(p);
 	        if (numPoints > 1) {
 	          for (var _iterator7 = _createForOfIteratorHelperLoose(neighborIds), _step7; !(_step7 = _iterator7()).done;) {
 	            var _neighborId = _step7.value;
-	            var _k = _neighborId * stride;
-	            if (data[_k + OFFSET_ZOOM] <= zoom) continue;
-	            data[_k + OFFSET_ZOOM] = zoom;
-	            for (var _j = 0; _j < stride; _j++) nextData.push(data[_k + _j]);
+	            var _b = tree.points[_neighborId];
+	            if (_b.zoom <= zoom) continue;
+	            _b.zoom = zoom;
+	            clusters.push(_b);
 	          }
 	        }
 	      }
 	    }
-	    return nextData;
+	    return clusters;
 	  }
 
 	  // get index of the point from which the cluster originated
@@ -39207,36 +39031,63 @@
 	  _proto._getOriginZoom = function _getOriginZoom(clusterId) {
 	    return (clusterId - this.points.length) % 32;
 	  };
-	  _proto._map = function _map(data, i, clone) {
-	    if (data[i + OFFSET_NUM] > 1) {
-	      var props = this.clusterProps[data[i + OFFSET_PROP]];
-	      return clone ? Object.assign({}, props) : props;
+	  _proto._map = function _map(point, clone) {
+	    if (point.numPoints) {
+	      return clone ? extend({}, point.properties) : point.properties;
 	    }
-	    var original = this.points[data[i + OFFSET_ID]].properties;
+	    var original = this.points[point.index].properties;
 	    var result = this.options.map(original);
-	    return clone && result === original ? Object.assign({}, result) : result;
+	    return clone && result === original ? extend({}, result) : result;
 	  };
 	  return Supercluster;
 	}();
-	function getClusterJSON(data, i, clusterProps) {
+	function createCluster(x, y, id, numPoints, properties) {
+	  return {
+	    x: fround(x),
+	    // weighted cluster center; round for consistency with Float32Array index
+	    y: fround(y),
+	    zoom: Infinity,
+	    // the last zoom the cluster was processed at
+	    id: id,
+	    // encodes index of the first child of the cluster and its zoom level
+	    parentId: -1,
+	    // parent cluster id
+	    numPoints: numPoints,
+	    properties: properties
+	  };
+	}
+	function createPointCluster(p, id) {
+	  var _p$geometry$coordinat = p.geometry.coordinates,
+	    x = _p$geometry$coordinat[0],
+	    y = _p$geometry$coordinat[1];
+	  return {
+	    x: fround(lngX(x)),
+	    // projected point coordinates
+	    y: fround(latY(y)),
+	    zoom: Infinity,
+	    // the last zoom the point was processed at
+	    index: id,
+	    // index of the source feature in the original input array,
+	    parentId: -1 // parent cluster id
+	  };
+	}
+	function getClusterJSON(cluster) {
 	  return {
 	    type: 'Feature',
-	    id: data[i + OFFSET_ID],
-	    properties: getClusterProperties(data, i, clusterProps),
+	    id: cluster.id,
+	    properties: getClusterProperties(cluster),
 	    geometry: {
 	      type: 'Point',
-	      coordinates: [xLng(data[i]), yLat(data[i + 1])]
+	      coordinates: [xLng(cluster.x), yLat(cluster.y)]
 	    }
 	  };
 	}
-	function getClusterProperties(data, i, clusterProps) {
-	  var count = data[i + OFFSET_NUM];
+	function getClusterProperties(cluster) {
+	  var count = cluster.numPoints;
 	  var abbrev = count >= 10000 ? Math.round(count / 1000) + "k" : count >= 1000 ? Math.round(count / 100) / 10 + "k" : count;
-	  var propIndex = data[i + OFFSET_PROP];
-	  var properties = propIndex === -1 ? {} : Object.assign({}, clusterProps[propIndex]);
-	  return Object.assign(properties, {
+	  return extend(extend({}, cluster.properties), {
 	    cluster: true,
-	    cluster_id: data[i + OFFSET_ID],
+	    cluster_id: cluster.id,
 	    point_count: count,
 	    point_count_abbreviated: abbrev
 	  });
@@ -39260,6 +39111,16 @@
 	  var y2 = (180 - y * 360) * Math.PI / 180;
 	  return 360 * Math.atan(Math.exp(y2)) / Math.PI - 90;
 	}
+	function extend(dest, src) {
+	  for (var id in src) dest[id] = src[id];
+	  return dest;
+	}
+	function getX(p) {
+	  return p.x;
+	}
+	function getY(p) {
+	  return p.y;
+	}
 
 	/*! *****************************************************************************
 	Copyright (c) Microsoft Corporation.
@@ -39285,71 +39146,6 @@
 	  return t;
 	}
 
-	/**
-	 * Copyright 2023 Google LLC
-	 *
-	 * Licensed under the Apache License, Version 2.0 (the "License");
-	 * you may not use this file except in compliance with the License.
-	 * You may obtain a copy of the License at
-	 *
-	 *      http://www.apache.org/licenses/LICENSE-2.0
-	 *
-	 * Unless required by applicable law or agreed to in writing, software
-	 * distributed under the License is distributed on an "AS IS" BASIS,
-	 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-	 * See the License for the specific language governing permissions and
-	 * limitations under the License.
-	 */
-	/**
-	 * util class that creates a common set of convenience functions to wrap
-	 * shared behavior of Advanced Markers and Markers.
-	 */
-	var MarkerUtils = /*#__PURE__*/function () {
-	  function MarkerUtils() {}
-	  MarkerUtils.isAdvancedMarkerAvailable = function isAdvancedMarkerAvailable(map) {
-	    return google.maps.marker && map.getMapCapabilities().isAdvancedMarkersAvailable === true;
-	  };
-	  MarkerUtils.isAdvancedMarker = function isAdvancedMarker(marker) {
-	    return google.maps.marker && marker instanceof google.maps.marker.AdvancedMarkerElement;
-	  };
-	  MarkerUtils.setMap = function setMap(marker, map) {
-	    if (this.isAdvancedMarker(marker)) {
-	      marker.map = map;
-	    } else {
-	      marker.setMap(map);
-	    }
-	  };
-	  MarkerUtils.getPosition = function getPosition(marker) {
-	    // SuperClusterAlgorithm.calculate expects a LatLng instance so we fake it for Adv Markers
-	    if (this.isAdvancedMarker(marker)) {
-	      if (marker.position) {
-	        if (marker.position instanceof google.maps.LatLng) {
-	          return marker.position;
-	        }
-	        // since we can't cast to LatLngLiteral for reasons =(
-	        if (marker.position.lat && marker.position.lng) {
-	          return new google.maps.LatLng(marker.position.lat, marker.position.lng);
-	        }
-	      }
-	      return new google.maps.LatLng(null);
-	    }
-	    return marker.getPosition();
-	  };
-	  MarkerUtils.getVisible = function getVisible(marker) {
-	    if (this.isAdvancedMarker(marker)) {
-	      /**
-	       * Always return true for Advanced Markers because the clusterer
-	       * uses getVisible as a way to count legacy markers not as an actual
-	       * indicator of visibility for some reason. Even when markers are hidden
-	       * Marker.getVisible returns `true` and this is used to set the marker count
-	       * on the cluster. See the behavior of Cluster.count
-	       */
-	      return true;
-	    }
-	    return marker.getVisible();
-	  };
-	  return MarkerUtils;
-	}();
 	/**
 	 * Copyright 2021 Google LLC
 	 *
@@ -39390,8 +39186,8 @@
 	   */;
 	  _proto["delete"] = function _delete() {
 	    if (this.marker) {
-	      MarkerUtils.setMap(this.marker, null);
-	      this.marker = undefined;
+	      this.marker.setMap(null);
+	      delete this.marker;
 	    }
 	    this.markers.length = 0;
 	  };
@@ -39399,14 +39195,11 @@
 	    key: "bounds",
 	    get: function get() {
 	      if (this.markers.length === 0 && !this._position) {
-	        return;
-	      }
-	      var bounds = new google.maps.LatLngBounds(this._position, this._position);
-	      for (var _iterator = _createForOfIteratorHelperLoose(this.markers), _step; !(_step = _iterator()).done;) {
-	        var marker = _step.value;
-	        bounds.extend(MarkerUtils.getPosition(marker));
+	        return undefined;
 	      }
-	      return bounds;
+	      return this.markers.reduce(function (bounds, marker) {
+	        return bounds.extend(marker.getPosition());
+	      }, new google.maps.LatLngBounds(this._position, this._position));
 	    }
 	  }, {
 	    key: "position",
@@ -39420,7 +39213,7 @@
 	    key: "count",
 	    get: function get() {
 	      return this.markers.filter(function (m) {
-	        return MarkerUtils.getVisible(m);
+	        return m.getVisible();
 	      }).length;
 	    }
 	  }]);
@@ -39458,7 +39251,7 @@
 	   * ```typescript
 	   *  cluster({markers, map}: AlgorithmInput): Cluster[] {
 	   *    if (shouldBypassClustering(map)) {
-	   *      return this.noop({markers})
+	   *      return this.noop({markers, map})
 	   *    }
 	   * }
 	   * ```
@@ -39476,7 +39269,7 @@
 	var _noop = function _noop(markers) {
 	  var clusters = markers.map(function (marker) {
 	    return new Cluster({
-	      position: MarkerUtils.getPosition(marker),
+	      position: marker.getPosition(),
 	      markers: [marker]
 	    });
 	  });
@@ -39513,33 +39306,28 @@
 	    _this4 = _AbstractAlgorithm3.call(this, {
 	      maxZoom: maxZoom
 	    }) || this;
-	    _this4.state = {
-	      zoom: -1
-	    };
 	    _this4.superCluster = new Supercluster(Object.assign({
 	      maxZoom: _this4.maxZoom,
 	      radius: radius
 	    }, options));
+	    _this4.state = {
+	      zoom: null
+	    };
 	    return _this4;
 	  }
 	  var _proto6 = SuperClusterAlgorithm.prototype;
 	  _proto6.calculate = function calculate(input) {
 	    var changed = false;
-	    var state = {
-	      zoom: input.map.getZoom()
-	    };
-	    if (!fastDeepEqual(input.markers, this.markers)) {
+	    if (!equal(input.markers, this.markers)) {
 	      changed = true;
 	      // TODO use proxy to avoid copy?
 	      this.markers = [].concat(input.markers);
 	      var points = this.markers.map(function (marker) {
-	        var position = MarkerUtils.getPosition(marker);
-	        var coordinates = [position.lng(), position.lat()];
 	        return {
 	          type: "Feature",
 	          geometry: {
 	            type: "Point",
-	            coordinates: coordinates
+	            coordinates: [marker.getPosition().lng(), marker.getPosition().lat()]
 	          },
 	          properties: {
 	            marker: marker
@@ -39548,9 +39336,12 @@
 	      });
 	      this.superCluster.load(points);
 	    }
+	    var state = {
+	      zoom: input.map.getZoom()
+	    };
 	    if (!changed) {
-	      if (this.state.zoom <= this.maxZoom || state.zoom <= this.maxZoom) {
-	        changed = !fastDeepEqual(this.state, state);
+	      if (this.state.zoom > this.maxZoom && state.zoom > this.maxZoom) ;else {
+	        changed = changed || !equal(this.state, state);
 	      }
 	    }
 	    this.state = state;
@@ -39563,11 +39354,8 @@
 	    };
 	  };
 	  _proto6.cluster = function cluster(_ref10) {
-	    var _this5 = this;
 	    var map = _ref10.map;
-	    return this.superCluster.getClusters([-180, -90, 180, 90], Math.round(map.getZoom())).map(function (feature) {
-	      return _this5.transformCluster(feature);
-	    });
+	    return this.superCluster.getClusters([-180, -90, 180, 90], Math.round(map.getZoom())).map(this.transformCluster.bind(this));
 	  };
 	  _proto6.transformCluster = function transformCluster(_ref11) {
 	    var _ref11$geometry$coord = _ref11.geometry.coordinates,
@@ -39579,17 +39367,18 @@
 	        markers: this.superCluster.getLeaves(properties.cluster_id, Infinity).map(function (leaf) {
 	          return leaf.properties.marker;
 	        }),
-	        position: {
+	        position: new google.maps.LatLng({
 	          lat: lat,
 	          lng: lng
-	        }
+	        })
+	      });
+	    } else {
+	      var marker = properties.marker;
+	      return new Cluster({
+	        markers: [marker],
+	        position: marker.getPosition()
 	      });
 	    }
-	    var marker = properties.marker;
-	    return new Cluster({
-	      markers: [marker],
-	      position: MarkerUtils.getPosition(marker)
-	    });
 	  };
 	  return SuperClusterAlgorithm;
 	}(AbstractAlgorithm);
@@ -39633,7 +39422,7 @@
 	};
 	var DefaultRenderer = /*#__PURE__*/function () {
 	  function DefaultRenderer() {}
-	  var _proto8 = DefaultRenderer.prototype;
+	  var _proto7 = DefaultRenderer.prototype;
 	  /**
 	   * The default render function for the library used by {@link MarkerClusterer}.
 	   *
@@ -39672,40 +39461,29 @@
 	   * });
 	   * ```
 	   */
-	  _proto8.render = function render(_ref14, stats, map) {
-	    var count = _ref14.count,
-	      position = _ref14.position;
+	  _proto7.render = function render(_ref12, stats) {
+	    var count = _ref12.count,
+	      position = _ref12.position;
 	    // change color if this cluster has more markers than the mean cluster
 	    var color = count > Math.max(10, stats.clusters.markers.mean) ? "#ff0000" : "#0000ff";
-	    // create svg literal with fill color
-	    var 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>";
-	    var title = "Cluster of " + count + " markers",
-	      // adjust zIndex to be above other markers
-	      zIndex = Number(google.maps.Marker.MAX_ZINDEX) + count;
-	    if (MarkerUtils.isAdvancedMarkerAvailable(map)) {
-	      // create cluster SVG element
-	      var parser = new DOMParser();
-	      var svgEl = parser.parseFromString(svg, "image/svg+xml").documentElement;
-	      svgEl.setAttribute("transform", "translate(0 25)");
-	      var _clusterOptions = {
-	        map: map,
-	        position: position,
-	        zIndex: zIndex,
-	        title: title,
-	        content: svgEl
-	      };
-	      return new google.maps.marker.AdvancedMarkerElement(_clusterOptions);
-	    }
-	    var clusterOptions = {
+	    // create svg url with fill color
+	    var 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  </svg>");
+	    // create marker using svg icon
+	    return new google.maps.Marker({
 	      position: position,
-	      zIndex: zIndex,
-	      title: title,
 	      icon: {
-	        url: "data:image/svg+xml;base64," + btoa(svg),
-	        anchor: new google.maps.Point(25, 25)
-	      }
-	    };
-	    return new google.maps.Marker(clusterOptions);
+	        url: "data:image/svg+xml;base64," + svg,
+	        scaledSize: new google.maps.Size(45, 45)
+	      },
+	      label: {
+	        text: String(count),
+	        color: "rgba(255,255,255,0.9)",
+	        fontSize: "12px"
+	      },
+	      title: "Cluster of " + count + " markers",
+	      // adjust zIndex to be above other markers
+	      zIndex: Number(google.maps.Marker.MAX_ZINDEX) + count
+	    });
 	  };
 	  return DefaultRenderer;
 	}();
@@ -39732,7 +39510,7 @@
 	 * @ignore
 	 */
 	// eslint-disable-next-line @typescript-eslint/no-explicit-any
-	function extend(type1, type2) {
+	function extend$1(type1, type2) {
 	  /* istanbul ignore next */
 	  // eslint-disable-next-line prefer-const
 	  for (var property in type2.prototype) {
@@ -39748,7 +39526,7 @@
 	  // because it might not always be available when the code is defined so we
 	  // look for it at the last possible moment. If it doesn't exist now then
 	  // there is no point going ahead :)
-	  extend(OverlayViewSafe, google.maps.OverlayView);
+	  extend$1(OverlayViewSafe, google.maps.OverlayView);
 	};
 	/**
 	 * Copyright 2021 Google LLC
@@ -39781,32 +39559,32 @@
 	 */
 	var MarkerClusterer = /*#__PURE__*/function (_OverlayViewSafe) {
 	  _inheritsLoose(MarkerClusterer, _OverlayViewSafe);
-	  function MarkerClusterer(_ref15) {
-	    var _this8;
-	    var map = _ref15.map,
-	      _ref15$markers = _ref15.markers,
-	      markers = _ref15$markers === void 0 ? [] : _ref15$markers,
-	      _ref15$algorithmOptio = _ref15.algorithmOptions,
-	      algorithmOptions = _ref15$algorithmOptio === void 0 ? {} : _ref15$algorithmOptio,
-	      _ref15$algorithm = _ref15.algorithm,
-	      algorithm = _ref15$algorithm === void 0 ? new SuperClusterAlgorithm(algorithmOptions) : _ref15$algorithm,
-	      _ref15$renderer = _ref15.renderer,
-	      renderer = _ref15$renderer === void 0 ? new DefaultRenderer() : _ref15$renderer,
-	      _ref15$onClusterClick = _ref15.onClusterClick,
-	      onClusterClick = _ref15$onClusterClick === void 0 ? defaultOnClusterClickHandler : _ref15$onClusterClick;
-	    _this8 = _OverlayViewSafe.call(this) || this;
-	    _this8.markers = [].concat(markers);
-	    _this8.clusters = [];
-	    _this8.algorithm = algorithm;
-	    _this8.renderer = renderer;
-	    _this8.onClusterClick = onClusterClick;
+	  function MarkerClusterer(_ref13) {
+	    var _this5;
+	    var map = _ref13.map,
+	      _ref13$markers = _ref13.markers,
+	      markers = _ref13$markers === void 0 ? [] : _ref13$markers,
+	      _ref13$algorithmOptio = _ref13.algorithmOptions,
+	      algorithmOptions = _ref13$algorithmOptio === void 0 ? {} : _ref13$algorithmOptio,
+	      _ref13$algorithm = _ref13.algorithm,
+	      algorithm = _ref13$algorithm === void 0 ? new SuperClusterAlgorithm(algorithmOptions) : _ref13$algorithm,
+	      _ref13$renderer = _ref13.renderer,
+	      renderer = _ref13$renderer === void 0 ? new DefaultRenderer() : _ref13$renderer,
+	      _ref13$onClusterClick = _ref13.onClusterClick,
+	      onClusterClick = _ref13$onClusterClick === void 0 ? defaultOnClusterClickHandler : _ref13$onClusterClick;
+	    _this5 = _OverlayViewSafe.call(this) || this;
+	    _this5.markers = [].concat(markers);
+	    _this5.clusters = [];
+	    _this5.algorithm = algorithm;
+	    _this5.renderer = renderer;
+	    _this5.onClusterClick = onClusterClick;
 	    if (map) {
-	      _this8.setMap(map);
+	      _this5.setMap(map);
 	    }
-	    return _this8;
+	    return _this5;
 	  }
-	  var _proto9 = MarkerClusterer.prototype;
-	  _proto9.addMarker = function addMarker(marker, noDraw) {
+	  var _proto8 = MarkerClusterer.prototype;
+	  _proto8.addMarker = function addMarker(marker, noDraw) {
 	    if (this.markers.includes(marker)) {
 	      return;
 	    }
@@ -39815,40 +39593,40 @@
 	      this.render();
 	    }
 	  };
-	  _proto9.addMarkers = function addMarkers(markers, noDraw) {
-	    var _this9 = this;
+	  _proto8.addMarkers = function addMarkers(markers, noDraw) {
+	    var _this6 = this;
 	    markers.forEach(function (marker) {
-	      _this9.addMarker(marker, true);
+	      _this6.addMarker(marker, true);
 	    });
 	    if (!noDraw) {
 	      this.render();
 	    }
 	  };
-	  _proto9.removeMarker = function removeMarker(marker, noDraw) {
+	  _proto8.removeMarker = function removeMarker(marker, noDraw) {
 	    var index = this.markers.indexOf(marker);
 	    if (index === -1) {
 	      // Marker is not in our list of markers, so do nothing:
 	      return false;
 	    }
-	    MarkerUtils.setMap(marker, null);
+	    marker.setMap(null);
 	    this.markers.splice(index, 1); // Remove the marker from the list of managed markers
 	    if (!noDraw) {
 	      this.render();
 	    }
 	    return true;
 	  };
-	  _proto9.removeMarkers = function removeMarkers(markers, noDraw) {
-	    var _this10 = this;
+	  _proto8.removeMarkers = function removeMarkers(markers, noDraw) {
+	    var _this7 = this;
 	    var removed = false;
 	    markers.forEach(function (marker) {
-	      removed = _this10.removeMarker(marker, true) || removed;
+	      removed = _this7.removeMarker(marker, true) || removed;
 	    });
 	    if (removed && !noDraw) {
 	      this.render();
 	    }
 	    return removed;
 	  };
-	  _proto9.clearMarkers = function clearMarkers(noDraw) {
+	  _proto8.clearMarkers = function clearMarkers(noDraw) {
 	    this.markers.length = 0;
 	    if (!noDraw) {
 	      this.render();
@@ -39857,9 +39635,9 @@
 	  /**
 	   * Recalculates and draws all the marker clusters.
 	   */;
-	  _proto9.render = function render() {
+	  _proto8.render = function render() {
 	    var map = this.getMap();
-	    if (map instanceof google.maps.Map && map.getProjection()) {
+	    if (map instanceof google.maps.Map && this.getProjection()) {
 	      google.maps.event.trigger(this, MarkerClustererEvents.CLUSTERING_BEGIN, this);
 	      var _this$algorithm$calcu = this.algorithm.calculate({
 	          markers: this.markers,
@@ -39868,90 +39646,53 @@
 	        }),
 	        clusters = _this$algorithm$calcu.clusters,
 	        changed = _this$algorithm$calcu.changed;
-	      // Allow algorithms to return flag on whether the clusters/markers have changed.
+	      // allow algorithms to return flag on whether the clusters/markers have changed
 	      if (changed || changed == undefined) {
-	        // Accumulate the markers of the clusters composed of a single marker.
-	        // Those clusters directly use the marker.
-	        // Clusters with more than one markers use a group marker generated by a renderer.
-	        var singleMarker = new Set();
-	        for (var _iterator2 = _createForOfIteratorHelperLoose(clusters), _step2; !(_step2 = _iterator2()).done;) {
-	          var cluster = _step2.value;
-	          if (cluster.markers.length == 1) {
-	            singleMarker.add(cluster.markers[0]);
-	          }
-	        }
-	        var groupMarkers = [];
-	        // Iterate the clusters that are currently rendered.
-	        for (var _iterator3 = _createForOfIteratorHelperLoose(this.clusters), _step3; !(_step3 = _iterator3()).done;) {
-	          var _cluster2 = _step3.value;
-	          if (_cluster2.marker == null) {
-	            continue;
-	          }
-	          if (_cluster2.markers.length == 1) {
-	            if (!singleMarker.has(_cluster2.marker)) {
-	              // The marker:
-	              // - was previously rendered because it is from a cluster with 1 marker,
-	              // - should no more be rendered as it is not in singleMarker.
-	              MarkerUtils.setMap(_cluster2.marker, null);
-	            }
-	          } else {
-	            // Delay the removal of old group markers to avoid flickering.
-	            groupMarkers.push(_cluster2.marker);
-	          }
-	        }
+	        // reset visibility of markers and clusters
+	        this.reset();
+	        // store new clusters
 	        this.clusters = clusters;
 	        this.renderClusters();
-	        // Delayed removal of the markers of the former groups.
-	        requestAnimationFrame(function () {
-	          return groupMarkers.forEach(function (marker) {
-	            return MarkerUtils.setMap(marker, null);
-	          });
-	        });
 	      }
 	      google.maps.event.trigger(this, MarkerClustererEvents.CLUSTERING_END, this);
 	    }
 	  };
-	  _proto9.onAdd = function onAdd() {
+	  _proto8.onAdd = function onAdd() {
 	    this.idleListener = this.getMap().addListener("idle", this.render.bind(this));
 	    this.render();
 	  };
-	  _proto9.onRemove = function onRemove() {
+	  _proto8.onRemove = function onRemove() {
 	    google.maps.event.removeListener(this.idleListener);
 	    this.reset();
 	  };
-	  _proto9.reset = function reset() {
+	  _proto8.reset = function reset() {
 	    this.markers.forEach(function (marker) {
-	      return MarkerUtils.setMap(marker, null);
+	      return marker.setMap(null);
 	    });
 	    this.clusters.forEach(function (cluster) {
 	      return cluster["delete"]();
 	    });
 	    this.clusters = [];
 	  };
-	  _proto9.renderClusters = function renderClusters() {
-	    var _this11 = this;
-	    // Generate stats to pass to renderers.
+	  _proto8.renderClusters = function renderClusters() {
+	    var _this8 = this;
+	    // generate stats to pass to renderers
 	    var stats = new ClusterStats(this.markers, this.clusters);
 	    var map = this.getMap();
 	    this.clusters.forEach(function (cluster) {
 	      if (cluster.markers.length === 1) {
 	        cluster.marker = cluster.markers[0];
 	      } else {
-	        // Generate the marker to represent the group.
-	        cluster.marker = _this11.renderer.render(cluster, stats, map);
-	        // Make sure all individual markers are removed from the map.
-	        cluster.markers.forEach(function (marker) {
-	          return MarkerUtils.setMap(marker, null);
-	        });
-	        if (_this11.onClusterClick) {
+	        cluster.marker = _this8.renderer.render(cluster, stats);
+	        if (_this8.onClusterClick) {
 	          cluster.marker.addListener("click", /* istanbul ignore next */
 	          function (event) {
-	            google.maps.event.trigger(_this11, MarkerClustererEvents.CLUSTER_CLICK, cluster);
-	            _this11.onClusterClick(event, cluster, map);
+	            google.maps.event.trigger(_this8, MarkerClustererEvents.CLUSTER_CLICK, cluster);
+	            _this8.onClusterClick(event, cluster, map);
 	          });
 	        }
 	      }
-	      MarkerUtils.setMap(cluster.marker, map);
+	      cluster.marker.setMap(map);
 	    });
 	  };
 	  return MarkerClusterer;
@@ -40028,7 +39769,7 @@
 	}
 
 	script$1.render = render$1;
-	script$1.__file = "node_modules/vue-google-maps-community-fork/src/components/cluster.vue";
+	script$1.__file = "node_modules/@appbaseio/vue-google-maps-community-fork/src/components/cluster.vue";
 
 	var props$7 = {
 	  options: {
@@ -40111,7 +39852,7 @@
 	}
 
 	script$2.render = render$2;
-	script$2.__file = "node_modules/vue-google-maps-community-fork/src/components/infoWindow.vue";
+	script$2.__file = "node_modules/@appbaseio/vue-google-maps-community-fork/src/components/infoWindow.vue";
 
 	/*
 	Mixin for objects that are mounted by Google Maps
@@ -40404,7 +40145,7 @@
 	styleInject(css_248z$2);
 
 	script$3.render = render$3;
-	script$3.__file = "node_modules/vue-google-maps-community-fork/src/components/map.vue";
+	script$3.__file = "node_modules/@appbaseio/vue-google-maps-community-fork/src/components/map.vue";
 
 	var props$9 = {
 	  options: {
@@ -40532,7 +40273,7 @@
 	}
 
 	script$4.render = render$4;
-	script$4.__file = "node_modules/vue-google-maps-community-fork/src/components/autocomplete.vue";
+	script$4.__file = "node_modules/@appbaseio/vue-google-maps-community-fork/src/components/autocomplete.vue";
 
 	var GMapApi = null;
 	function install(Vue, options) {
@@ -42264,7 +42005,7 @@
 	      var id = marker.metaData && marker.metaData._id;
 	      var _this$openMarkers = this.openMarkers,
 	        del = _this$openMarkers[id],
-	        activeMarkers = _objectWithoutPropertiesLoose(_this$openMarkers, [id].map(_toPropertyKey$1));
+	        activeMarkers = _objectWithoutPropertiesLoose(_this$openMarkers, [id].map(_toPropertyKey));
 	      var newOpenMarkers = autoClosePopover ? {} : activeMarkers;
 	      this.setOpenMarkers(newOpenMarkers);
 	      handlePreserveCenter(true);
@@ -42765,7 +42506,7 @@
 	        openMarkers = _this$$props2.openMarkers;
 	      var id = marker._id;
 	      var del = openMarkers[id],
-	        activeMarkers = _objectWithoutPropertiesLoose(openMarkers, [id].map(_toPropertyKey$1));
+	        activeMarkers = _objectWithoutPropertiesLoose(openMarkers, [id].map(_toPropertyKey));
 	      var newOpenMarkers = autoClosePopover ? {} : activeMarkers;
 	      handleOpenMarkers(newOpenMarkers);
 	      handlePreserveCenter(true);
@@ -43234,9 +42975,10 @@
 	var EMPTY_OBJ =  Object.freeze({}) ;
 	var EMPTY_ARR =  Object.freeze([]) ;
 	var NOOP = function NOOP() {};
-	var onRE = /^on[^a-z]/;
 	var isOn = function isOn(key) {
-	  return onRE.test(key);
+	  return key.charCodeAt(0) === 111 && key.charCodeAt(1) === 110 && (
+	  // uppercase letter
+	  key.charCodeAt(2) > 122 || key.charCodeAt(2) < 97);
 	};
 	var isArray = Array.isArray;
 	var isFunction$1 = function isFunction(val) {
@@ -43266,7 +43008,7 @@
 	var getGlobalThis = function getGlobalThis() {
 	  return _globalThis || (_globalThis = typeof globalThis !== "undefined" ? globalThis : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : typeof global$1 !== "undefined" ? global$1 : {});
 	};
-	var PatchFlagNames = (_PatchFlagNames = {}, _PatchFlagNames[1] = "TEXT", _PatchFlagNames[2] = "CLASS", _PatchFlagNames[4] = "STYLE", _PatchFlagNames[8] = "PROPS", _PatchFlagNames[16] = "FULL_PROPS", _PatchFlagNames[32] = "HYDRATE_EVENTS", _PatchFlagNames[64] = "STABLE_FRAGMENT", _PatchFlagNames[128] = "KEYED_FRAGMENT", _PatchFlagNames[256] = "UNKEYED_FRAGMENT", _PatchFlagNames[512] = "NEED_PATCH", _PatchFlagNames[1024] = "DYNAMIC_SLOTS", _PatchFlagNames[2048] = "DEV_ROOT_FRAGMENT", _PatchFlagNames[-1] = "HOISTED", _PatchFlagNames[-2] = "BAIL", _PatchFlagNames);
+	var PatchFlagNames = (_PatchFlagNames = {}, _PatchFlagNames[1] = "TEXT", _PatchFlagNames[2] = "CLASS", _PatchFlagNames[4] = "STYLE", _PatchFlagNames[8] = "PROPS", _PatchFlagNames[16] = "FULL_PROPS", _PatchFlagNames[32] = "NEED_HYDRATION", _PatchFlagNames[64] = "STABLE_FRAGMENT", _PatchFlagNames[128] = "KEYED_FRAGMENT", _PatchFlagNames[256] = "UNKEYED_FRAGMENT", _PatchFlagNames[512] = "NEED_PATCH", _PatchFlagNames[1024] = "DYNAMIC_SLOTS", _PatchFlagNames[2048] = "DEV_ROOT_FRAGMENT", _PatchFlagNames[-1] = "HOISTED", _PatchFlagNames[-2] = "BAIL", _PatchFlagNames);
 	var slotFlagsText = (_slotFlagsText = {}, _slotFlagsText[1] = "STABLE", _slotFlagsText[2] = "DYNAMIC", _slotFlagsText[3] = "FORWARDED", _slotFlagsText);
 	function normalizeStyle(value) {
 	  if (isArray(value)) {
@@ -43526,7 +43268,6 @@
 	  var instance = createComponentInstance(vnode, parentComponent, null);
 	  var res = setupComponent(instance, true
 	  /* isSSR */);
-
 	  var hasAsyncSetup = isPromise(res);
 	  var prefetches = instance.sp;
 	  if (hasAsyncSetup || prefetches) {
@@ -43566,7 +43307,10 @@
 	    }
 	    for (var _iterator = _createForOfIteratorHelperLoose(instance.scope.effects), _step; !(_step = _iterator()).done;) {
 	      var e = _step.value;
-	      if (e.computed) e.computed._cacheable = true;
+	      if (e.computed) {
+	        e.computed._dirty = true;
+	        e.computed._cacheable = true;
+	      }
 	    }
 	    var ssrRender = instance.ssrRender || comp.ssrRender;
 	    if (ssrRender) {
@@ -44205,7 +43949,7 @@
 	  }, queryString, renderFunction);
 	}
 
-	var version = "3.3.0";
+	var version = "3.3.1";
 
 	var components = [RLConnected, ResultCard, ResultList, ReactiveBase, SBConnected, ListConnected, ListConnected$1, RangeConnected$1, RangeConnected$2, RangeConnected$3, RangeConnected, RcConnected, RcConnected$1, RcConnected$2, TBConnected, ListConnected$2, ListConnected$3, StateProviderConnected, RangeConnected$4, TreeListConnected, AIConnected];
 	function install$1 (Vue) {