@uni-sw/u-design 2.0.4

package/es/components/UMap/map/components/PointDraw/modelcluster/index.js

@@ -0,0 +1,534 @@
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
+function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
+function _possibleConstructorReturn(t, e) { if (e && ("object" == _typeof(e) || "function" == typeof e)) return e; if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined"); return _assertThisInitialized(t); }
+function _assertThisInitialized(e) { if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); return e; }
+function _isNativeReflectConstruct() { try { var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); } catch (t) {} return (_isNativeReflectConstruct = function _isNativeReflectConstruct() { return !!t; })(); }
+function _getPrototypeOf(t) { return _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) { return t.__proto__ || Object.getPrototypeOf(t); }, _getPrototypeOf(t); }
+function _inherits(t, e) { if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function"); t.prototype = Object.create(e && e.prototype, { constructor: { value: t, writable: !0, configurable: !0 } }), Object.defineProperty(t, "prototype", { writable: !1 }), e && _setPrototypeOf(t, e); }
+function _setPrototypeOf(t, e) { return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) { return t.__proto__ = e, t; }, _setPrototypeOf(t, e); }
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
+function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
+function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }
+function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
+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 _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+var H = Object.defineProperty;
+var D = Math.pow,
+  J = function J(c, t, n) {
+    return t in c ? H(c, t, {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: n
+    }) : c[t] = n;
+  };
+var E = function E(c, t, n) {
+  return J(c, _typeof(t) != "symbol" ? t + "" : t, n);
+};
+import { merge as b } from "lodash";
+var v = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array],
+  I = 1,
+  M = 8;
+var L = /*#__PURE__*/function () {
+  /**
+   * 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 L(t) {
+    var n = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 64;
+    var s = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : Float64Array;
+    var o = arguments.length > 3 ? arguments[3] : undefined;
+    _classCallCheck(this, L);
+    if (isNaN(t) || t < 0) throw new Error("Unpexpected numItems value: ".concat(t, "."));
+    this.numItems = +t, this.nodeSize = Math.min(Math.max(+n, 2), 65535), this.ArrayType = s, this.IndexArrayType = t < 65536 ? Uint16Array : Uint32Array;
+    var r = v.indexOf(this.ArrayType),
+      i = t * 2 * this.ArrayType.BYTES_PER_ELEMENT,
+      h = t * this.IndexArrayType.BYTES_PER_ELEMENT,
+      e = (8 - h % 8) % 8;
+    if (r < 0) throw new Error("Unexpected typed array class: ".concat(s, "."));
+    o && o instanceof ArrayBuffer ? (this.data = o, this.ids = new this.IndexArrayType(this.data, M, t), this.coords = new this.ArrayType(this.data, M + h + e, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(M + i + h + e), this.ids = new this.IndexArrayType(this.data, M, t), this.coords = new this.ArrayType(this.data, M + h + e, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (I << 4) + r]), new Uint16Array(this.data, 2, 1)[0] = n, new Uint32Array(this.data, 4, 1)[0] = t);
+  }
+  /**
+   * 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`).
+   */
+  return _createClass(L, [{
+    key: "add",
+    value: function add(t, n) {
+      var s = this._pos >> 1;
+      return this.ids[s] = s, this.coords[this._pos++] = t, this.coords[this._pos++] = n, s;
+    }
+    /**
+     * Perform indexing of the added points.
+     */
+  }, {
+    key: "finish",
+    value: function finish() {
+      var t = this._pos >> 1;
+      if (t !== this.numItems) throw new Error("Added ".concat(t, " items when expected ").concat(this.numItems, "."));
+      return F(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0), this._finished = !0, 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.
+     */
+  }, {
+    key: "range",
+    value: function range(t, n, s, o) {
+      if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+      var r = this.ids,
+        i = this.coords,
+        h = this.nodeSize,
+        e = [0, r.length - 1, 0],
+        l = [];
+      for (; e.length;) {
+        var p = e.pop() || 0,
+          f = e.pop() || 0,
+          a = e.pop() || 0;
+        if (f - a <= h) {
+          for (var y = a; y <= f; y++) {
+            var T = i[2 * y],
+              _ = i[2 * y + 1];
+            T >= t && T <= s && _ >= n && _ <= o && l.push(r[y]);
+          }
+          continue;
+        }
+        var u = a + f >> 1,
+          d = i[2 * u],
+          w = i[2 * u + 1];
+        d >= t && d <= s && w >= n && w <= o && l.push(r[u]), (p === 0 ? t <= d : n <= w) && (e.push(a), e.push(u - 1), e.push(1 - p)), (p === 0 ? s >= d : o >= w) && (e.push(u + 1), e.push(f), e.push(1 - p));
+      }
+      return l;
+    }
+    /**
+     * 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.
+     */
+  }, {
+    key: "within",
+    value: function within(t, n, s) {
+      if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+      var o = this.ids,
+        r = this.coords,
+        i = this.nodeSize,
+        h = [0, o.length - 1, 0],
+        e = [],
+        l = s * s;
+      for (; h.length;) {
+        var p = h.pop() || 0,
+          f = h.pop() || 0,
+          a = h.pop() || 0;
+        if (f - a <= i) {
+          for (var y = a; y <= f; y++) N(r[2 * y], r[2 * y + 1], t, n) <= l && e.push(o[y]);
+          continue;
+        }
+        var u = a + f >> 1,
+          d = r[2 * u],
+          w = r[2 * u + 1];
+        N(d, w, t, n) <= l && e.push(o[u]), (p === 0 ? t - s <= d : n - s <= w) && (h.push(a), h.push(u - 1), h.push(1 - p)), (p === 0 ? t + s >= d : n + s >= w) && (h.push(u + 1), h.push(f), h.push(1 - p));
+      }
+      return e;
+    }
+  }], [{
+    key: "from",
+    value:
+    /**
+     * Creates an index from raw `ArrayBuffer` data.
+     * @param {ArrayBuffer} data
+     */
+    function from(t) {
+      if (!(t instanceof ArrayBuffer)) throw new Error("Data must be an instance of ArrayBuffer.");
+      var _Uint8Array = new Uint8Array(t, 0, 2),
+        _Uint8Array2 = _slicedToArray(_Uint8Array, 2),
+        n = _Uint8Array2[0],
+        s = _Uint8Array2[1];
+      if (n !== 219) throw new Error("Data does not appear to be in a KDBush format.");
+      var o = s >> 4;
+      if (o !== I) throw new Error("Got v".concat(o, " data when expected v").concat(I, "."));
+      var r = v[s & 15];
+      if (!r) throw new Error("Unrecognized array type.");
+      var _Uint16Array = new Uint16Array(t, 2, 1),
+        _Uint16Array2 = _slicedToArray(_Uint16Array, 1),
+        i = _Uint16Array2[0],
+        _Uint32Array = new Uint32Array(t, 4, 1),
+        _Uint32Array2 = _slicedToArray(_Uint32Array, 1),
+        h = _Uint32Array2[0];
+      return new L(h, i, r, t);
+    }
+  }]);
+}();
+function F(c, t, n, s, o, r) {
+  if (o - s <= n) return;
+  var i = s + o >> 1;
+  $(c, t, i, s, o, r), F(c, t, n, s, i - 1, 1 - r), F(c, t, n, i + 1, o, 1 - r);
+}
+function $(c, t, n, s, o, r) {
+  for (; o > s;) {
+    if (o - s > 600) {
+      var l = o - s + 1,
+        p = n - s + 1,
+        f = Math.log(l),
+        a = 0.5 * Math.exp(2 * f / 3),
+        u = 0.5 * Math.sqrt(f * a * (l - a) / l) * (p - l / 2 < 0 ? -1 : 1),
+        d = Math.max(s, Math.floor(n - p * a / l + u)),
+        w = Math.min(o, Math.floor(n + (l - p) * a / l + u));
+      $(c, t, n, d, w, r);
+    }
+    var i = t[2 * n + r];
+    var h = s,
+      e = o;
+    for (x(c, t, s, n), t[2 * o + r] > i && x(c, t, s, o); h < e;) {
+      for (x(c, t, h, e), h++, e--; t[2 * h + r] < i;) h++;
+      for (; t[2 * e + r] > i;) e--;
+    }
+    t[2 * s + r] === i ? x(c, t, s, e) : (e++, x(c, t, e, o)), e <= n && (s = e + 1), n <= e && (o = e - 1);
+  }
+}
+function x(c, t, n, s) {
+  S(c, n, s), S(t, 2 * n, 2 * s), S(t, 2 * n + 1, 2 * s + 1);
+}
+function S(c, t, n) {
+  var s = c[t];
+  c[t] = c[n], c[n] = s;
+}
+function N(c, t, n, s) {
+  var o = c - n,
+    r = t - s;
+  return o * o + r * r;
+}
+var K = /*#__PURE__*/function (_L) {
+  function K() {
+    var _this;
+    _classCallCheck(this, K);
+    _this = _callSuper(this, K, arguments);
+    E(_this, "originData", []);
+    return _this;
+  }
+  _inherits(K, _L);
+  return _createClass(K);
+}(L);
+var z = {
+    maxZoom: 8,
+    // 聚类点的最大缩放级别
+    minPoints: 2,
+    // 形成聚类的最小点数
+    radius: 4,
+    // 聚类半径（像素）
+    nodeSize: 64,
+    // KD树叶节点的大小，影响性能
+    log: !1
+    // 是否记录时间信息
+  },
+  B = D(2, 20),
+  R = Math.fround || /* @__PURE__ */function (c) {
+    return function (t) {
+      return c[0] = +t, c[0];
+    };
+  }(new Float32Array(1)),
+  g = 6,
+  m = 2,
+  O = 3,
+  Z = 4,
+  A = 5;
+var Q = /*#__PURE__*/function () {
+  function Q(t) {
+    _classCallCheck(this, Q);
+    E(this, "options");
+    E(this, "trees");
+    E(this, "points", []);
+    this.options = b(z, t), this.trees = Array.from({
+      length: this.options.maxZoom + 1
+    });
+  }
+  return _createClass(Q, [{
+    key: "maxZoom",
+    get: function get() {
+      return this.options.maxZoom;
+    }
+  }, {
+    key: "load",
+    value: function load(t) {
+      var _this$options = this.options,
+        n = _this$options.log,
+        s = _this$options.maxZoom;
+      n && console.time("total time");
+      var o = "prepare ".concat(t.length, " points");
+      n && console.time(o), this.points = t;
+      var r = [];
+      for (var e = 0; e < t.length; e++) {
+        var l = t[e],
+          _l$coords = _slicedToArray(l.coords, 2),
+          p = _l$coords[0],
+          f = _l$coords[1],
+          a = R(U(p)),
+          u = R(C(f));
+        r.push(a, u,
+        // 投影点坐标
+        1 / 0,
+        // 点被处理的最后缩放级别
+        e,
+        // 原始输入数组中源要素的索引
+        -1,
+        // 父聚类ID
+        1
+        // 聚类中的点数
+        );
+      }
+      var i = +Date.now();
+      var h = this.trees[s] = this._createTree(r);
+      n && console.log("z%d: %d clusters in %dms", s, h.numItems, +Date.now() - i), n && console.timeEnd(o);
+      for (var _e = s - 1; _e >= 0; _e--) {
+        var _l = +Date.now();
+        h = this.trees[_e] = this._createTree(this._cluster(h, _e)), n && console.log("z%d: %d clusters in %dms", _e, h.numItems, +Date.now() - _l);
+      }
+      return n && console.timeEnd("total time"), this;
+    }
+  }, {
+    key: "getClusters",
+    value: function getClusters(t, n) {
+      var s = ((t[0] + 180) % 360 + 360) % 360 - 180;
+      var o = Math.max(-90, Math.min(90, t[1]));
+      var r = t[2] === 180 ? 180 : ((t[2] + 180) % 360 + 360) % 360 - 180;
+      var i = Math.max(-90, Math.min(90, t[3]));
+      if (t[2] - t[0] >= 360) s = -180, r = 180;else if (s > r) {
+        var f = this.getClusters([s, o, 180, i], n),
+          a = this.getClusters([-180, o, r, i], n);
+        return f.concat(a);
+      }
+      var h = this.trees[this._limitZoom(n)],
+        e = h.range(U(s), C(i), U(r), C(o)),
+        l = h.originData,
+        p = [];
+      var _iterator = _createForOfIteratorHelper(e),
+        _step;
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var _f = _step.value;
+          var _a = g * _f;
+          p.push(l[_a + A] > 1 ? this._getClusterJSON(l, _a) : this.points[l[_a + O]]);
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+      return p;
+    }
+  }, {
+    key: "getChildren",
+    value: function getChildren(t) {
+      var n = this._getOriginId(t),
+        s = this._getOriginZoom(t),
+        o = "No cluster with the specified id.",
+        r = this.trees[s];
+      if (!r) throw new Error(o);
+      var i = r.originData;
+      if (n * g >= i.length) throw new Error(o);
+      var h = this.options.radius / (B * D(2, s - 1)),
+        e = i[n * g],
+        l = i[n * g + 1],
+        p = r.within(e, l, h),
+        f = [];
+      var _iterator2 = _createForOfIteratorHelper(p),
+        _step2;
+      try {
+        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+          var a = _step2.value;
+          var u = a * g;
+          i[u + Z] === t && f.push(i[u + A] > 1 ? this._getClusterJSON(i, u) : this.points[i[u + O]]);
+        }
+      } catch (err) {
+        _iterator2.e(err);
+      } finally {
+        _iterator2.f();
+      }
+      if (f.length === 0) throw new Error(o);
+      return f;
+    }
+  }, {
+    key: "getLeaves",
+    value: function getLeaves(t, n, s) {
+      n = n || 10, s = s || 0;
+      var o = [];
+      return this._appendLeaves(o, t, n, s, 0), o;
+    }
+  }, {
+    key: "getClusterExpansionZoom",
+    value: function getClusterExpansionZoom(t) {
+      var s;
+      var n = this._getOriginZoom(t) - 1;
+      for (; n <= this.options.maxZoom;) {
+        var o = this.getChildren(t);
+        if (n++, o.length !== 1) break;
+        t = (s = o[0].cluster) == null ? void 0 : s.cluster_id;
+      }
+      return n;
+    }
+  }, {
+    key: "_appendLeaves",
+    value: function _appendLeaves(t, n, s, o, r) {
+      var i = this.getChildren(n);
+      var _iterator3 = _createForOfIteratorHelper(i),
+        _step3;
+      try {
+        for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+          var h = _step3.value;
+          var e = h.cluster;
+          if (e ? r + e.point_count <= o ? r += e.point_count : r = this._appendLeaves(t, e.cluster_id, s, o, r) : r < o ? r++ : t.push(h), t.length === s) break;
+        }
+      } catch (err) {
+        _iterator3.e(err);
+      } finally {
+        _iterator3.f();
+      }
+      return r;
+    }
+  }, {
+    key: "_createTree",
+    value: function _createTree(t) {
+      var n = new K(t.length / g | 0, this.options.nodeSize, Float32Array);
+      for (var s = 0; s < t.length; s += g) n.add(t[s], t[s + 1]);
+      return n.finish(), n.originData = t, n;
+    }
+  }, {
+    key: "_limitZoom",
+    value: function _limitZoom(t) {
+      return Math.max(0, Math.min(Math.floor(+t), this.options.maxZoom + 1));
+    }
+  }, {
+    key: "_cluster",
+    value: function _cluster(t, n) {
+      var _this$options2 = this.options,
+        s = _this$options2.radius,
+        o = _this$options2.minPoints,
+        r = s / (B * D(2, n)),
+        i = t.originData,
+        h = [];
+      for (var e = 0; e < i.length; e += g) {
+        if (i[e + m] <= n) continue;
+        i[e + m] = n;
+        var l = i[e],
+          p = i[e + 1],
+          f = t.within(i[e], i[e + 1], r),
+          a = i[e + A];
+        var u = a;
+        var _iterator4 = _createForOfIteratorHelper(f),
+          _step4;
+        try {
+          for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
+            var _d3 = _step4.value;
+            var _w2 = _d3 * g;
+            i[_w2 + m] > n && (u += i[_w2 + A]);
+          }
+        } catch (err) {
+          _iterator4.e(err);
+        } finally {
+          _iterator4.f();
+        }
+        if (u > a && u >= o) {
+          var d = l * a,
+            w = p * a;
+          var y = ((e / g | 0) << 5) + (n + 1) + this.points.length;
+          var _iterator5 = _createForOfIteratorHelper(f),
+            _step5;
+          try {
+            for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
+              var T = _step5.value;
+              var _ = T * g;
+              if (i[_ + m] <= n) continue;
+              i[_ + m] = n;
+              var P = i[_ + A];
+              d += i[_] * P, w += i[_ + 1] * P, i[_ + Z] = y;
+            }
+          } catch (err) {
+            _iterator5.e(err);
+          } finally {
+            _iterator5.f();
+          }
+          i[e + Z] = y, h.push(d / u, w / u, 1 / 0, y, -1, u);
+        } else {
+          for (var _d = 0; _d < g; _d++) h.push(i[e + _d]);
+          if (u > 1) {
+            var _iterator6 = _createForOfIteratorHelper(f),
+              _step6;
+            try {
+              for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
+                var _d2 = _step6.value;
+                var _w = _d2 * g;
+                if (!(i[_w + m] <= n)) {
+                  i[_w + m] = n;
+                  for (var _y = 0; _y < g; _y++) h.push(i[_w + _y]);
+                }
+              }
+            } catch (err) {
+              _iterator6.e(err);
+            } finally {
+              _iterator6.f();
+            }
+          }
+        }
+      }
+      return h;
+    }
+  }, {
+    key: "_getClusterJSON",
+    value: function _getClusterJSON(t, n) {
+      var s = t[n + A],
+        o = s >= 1e4 ? "".concat(Math.round(s / 1e3), "k") : s >= 1e3 ? "".concat(Math.round(s / 100) / 10, "k") : "".concat(s);
+      return {
+        coords: [G(t[n]), V(t[n + 1])],
+        cluster: {
+          cluster_id: t[n + O],
+          point_count: s,
+          point_count_abbreviated: o
+        }
+      };
+    }
+    // 获取聚类起源点的索引
+  }, {
+    key: "_getOriginId",
+    value: function _getOriginId(t) {
+      return t - this.points.length >> 5;
+    }
+    // 获取聚类起源点的缩放级别
+  }, {
+    key: "_getOriginZoom",
+    value: function _getOriginZoom(t) {
+      return (t - this.points.length) % 32;
+    }
+  }]);
+}();
+function U(c) {
+  return c / 360 + 0.5;
+}
+function C(c) {
+  var t = Math.sin(c * Math.PI / 180),
+    n = 0.5 - 0.25 * Math.log((1 + t) / (1 - t)) / Math.PI;
+  return n < 0 ? 0 : n > 1 ? 1 : n;
+}
+function G(c) {
+  return (c - 0.5) * 360;
+}
+function V(c) {
+  var t = (180 - c * 360) * Math.PI / 180;
+  return 360 * Math.atan(Math.exp(t)) / Math.PI - 90;
+}
+export { Q as default };

package/es/components/UMap/map/components/PointDraw/renderers/DomPointRenderer.d.ts

@@ -0,0 +1,17 @@
+import { IPointRenderer, RendererParams } from './IPointRenderer';
+import { IPoint, Position, IDrawPointData } from '../core';
+/** Dom 渲染器 */
+export declare class DomPointRenderer extends IPointRenderer<'dom'> {
+    constructor(params: RendererParams<'dom'>);
+    add(point: IPoint, pointLayer: string, position: Position, visible?: boolean): IDrawPointData | null;
+    remove(rec: IDrawPointData): void;
+    setVisible(rec: IDrawPointData, visible: boolean): void;
+    setNameVisible(rec: IDrawPointData, visible: boolean): void;
+    updatePosition(rec: IDrawPointData, position: Position): void;
+    setNameHoverActive(rec: IDrawPointData, isActive: boolean): void;
+    /** dom点只需要挂载一次 */
+    protected _mount(rec: IDrawPointData): void;
+    protected _mountDraw(rec: IDrawPointData): null | undefined;
+    protected _mountLabel(rec: IDrawPointData): void;
+    private _getDom;
+}