@local-logic/maps 0.0.10 → 0.0.12

package/dist/{index-DgHrPgsK.js → index-Bd7meO8V.js}

@@ -1,16 +1,16 @@
 import { jsx as T } from "react/jsx-runtime";
-import * as B from "react";
-import ot, { useContext as at, useMemo as v, lazy as _, useRef as V, useState as D, useEffect as ct } from "react";
-const X = ot.createContext({}), Z = () => at(X), R = {
+import * as D from "react";
+import at, { useContext as ct, useState as U, useMemo as P, lazy as A, useRef as H, useEffect as ut } from "react";
+const et = at.createContext({}), Z = () => ct(et), R = {
   zoom: 14,
   pitch: 0,
   bearing: 0,
   cooperativeGestures: !1
-}, H = {
+}, J = {
   maptiler: "600d69cb-288d-445e-9839-3dfe4d76b31a",
   mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
   google: "a7ff20eb973126bb"
-}, ut = 13, ht = 22, lt = 30, pt = "w-full h-full relative overflow-hidden", ft = _(() => import("./index-JQfyhSrg.js")), dt = _(() => import("./index-CR8t37Oz.js")), gt = _(() => import("./index-BtwgeEEU.js")), mt = _(() => import("./index-qqbvBkdn.js")), yt = ({ children: r }) => {
+}, K = 13, ht = 22, lt = 30, pt = 60, ft = "w-full h-full relative overflow-hidden", dt = A(() => import("./index-aDlW4ps0.js")), gt = A(() => import("./index-CzBPD5Sw.js")), mt = A(() => import("./index-LKvWHhi6.js")), yt = A(() => import("./index-qqbvBkdn.js")), wt = ({ children: r }) => {
   const {
     mapProvider: t,
     center: e,
@@ -18,86 +18,86 @@ const X = ot.createContext({}), Z = () => at(X), R = {
     pitch: i = R.pitch,
     bearing: o = R.bearing,
     cooperativeGestures: a = R.cooperativeGestures,
-    zoomPosition: u
-  } = Z(), s = v(() => {
+    zoomPosition: c
+  } = Z(), [s] = U(n), h = P(() => {
     switch (t == null ? void 0 : t.name) {
       case "maptiler":
-        return ft;
-      case "google":
         return dt;
-      case "mapbox":
+      case "google":
         return gt;
-      default:
+      case "mapbox":
         return mt;
+      default:
+        return yt;
     }
   }, [t]);
   return /* @__PURE__ */ T(
     "div",
     {
-      className: pt,
+      className: ft,
       "data-testid": "base-map",
       "data-map-provider-name": t == null ? void 0 : t.name,
-      "data-map-provider-theme": (t == null ? void 0 : t.theme) || H[t == null ? void 0 : t.name] || H.maptiler,
-      "data-zoom": n,
+      "data-map-provider-theme": (t == null ? void 0 : t.theme) || J[t == null ? void 0 : t.name] || J.maptiler,
+      "data-initial-zoom": s,
       "data-pitch": i,
       "data-bearing": o,
       "data-cooperative-gestures": a,
-      "data-zoom-position": u,
+      "data-zoom-position": c,
       "data-center-latitude": e.latitude,
       "data-center-longitude": e.longitude,
-      children: /* @__PURE__ */ T(s, { children: r })
+      children: /* @__PURE__ */ T(h, { children: r })
     }
   );
-}, wt = _(() => import("./index-Do_dW76Q.js")), Mt = _(() => import("./index-BCa658u4.js")), _t = _(() => import("./index-CNxLnZ8O.js"));
-function At(r) {
-  const { mapProvider: t } = Z(), e = v(() => {
+}, Mt = A(() => import("./index-Do_dW76Q.js")), _t = A(() => import("./index-BCa658u4.js")), At = A(() => import("./index-CNxLnZ8O.js"));
+function Et(r) {
+  const { mapProvider: t } = Z(), e = P(() => {
     switch (t == null ? void 0 : t.name) {
       case "maptiler":
-        return wt;
-      case "google":
         return Mt;
-      case "mapbox":
+      case "google":
         return _t;
+      case "mapbox":
+        return At;
       default:
         return null;
     }
   }, [t]);
   return e ? /* @__PURE__ */ T(e, { ...r }) : null;
 }
-function tt(r, t, e = {}) {
+function nt(r, t, e = {}) {
   const n = { type: "Feature" };
   return (e.id === 0 || e.id) && (n.id = e.id), e.bbox && (n.bbox = e.bbox), n.properties = t || {}, n.geometry = r, n;
 }
-function Et(r, t, e = {}) {
+function bt(r, t, e = {}) {
   if (!r)
     throw new Error("coordinates is required");
   if (!Array.isArray(r))
     throw new Error("coordinates must be an Array");
   if (r.length < 2)
     throw new Error("coordinates must be at least 2 numbers long");
-  if (!J(r[0]) || !J(r[1]))
+  if (!W(r[0]) || !W(r[1]))
     throw new Error("coordinates must contain numbers");
-  return tt({
+  return nt({
     type: "Point",
     coordinates: r
   }, t, e);
 }
-function bt(r, t, e = {}) {
-  return tt({
+function St(r, t, e = {}) {
+  return nt({
     type: "MultiPoint",
     coordinates: r
   }, t, e);
 }
-function J(r) {
+function W(r) {
   return !isNaN(r) && r !== null && !Array.isArray(r);
 }
-function et(r, t, e) {
+function rt(r, t, e) {
   if (r !== null)
-    for (var n, i, o, a, u, s, h, l = 0, c = 0, p, d = r.type, y = d === "FeatureCollection", f = d === "Feature", m = y ? r.features.length : 1, g = 0; g < m; g++) {
-      h = y ? r.features[g].geometry : f ? r.geometry : r, p = h ? h.type === "GeometryCollection" : !1, u = p ? h.geometries.length : 1;
-      for (var M = 0; M < u; M++) {
-        var w = 0, A = 0;
-        if (a = p ? h.geometries[M] : h, a !== null) {
+    for (var n, i, o, a, c, s, h, l = 0, u = 0, p, d = r.type, g = d === "FeatureCollection", M = d === "Feature", w = g ? r.features.length : 1, y = 0; y < w; y++) {
+      h = g ? r.features[y].geometry : M ? r.geometry : r, p = h ? h.type === "GeometryCollection" : !1, c = p ? h.geometries.length : 1;
+      for (var f = 0; f < c; f++) {
+        var m = 0, _ = 0;
+        if (a = p ? h.geometries[f] : h, a !== null) {
           s = a.coordinates;
           var E = a.type;
           switch (l = 0, E) {
@@ -106,28 +106,28 @@ function et(r, t, e) {
             case "Point":
               if (t(
                 s,
-                c,
-                g,
-                w,
-                A
+                u,
+                y,
+                m,
+                _
               ) === !1)
                 return !1;
-              c++, w++;
+              u++, m++;
               break;
             case "LineString":
             case "MultiPoint":
               for (n = 0; n < s.length; n++) {
                 if (t(
                   s[n],
-                  c,
-                  g,
-                  w,
-                  A
+                  u,
+                  y,
+                  m,
+                  _
                 ) === !1)
                   return !1;
-                c++, E === "MultiPoint" && w++;
+                u++, E === "MultiPoint" && m++;
               }
-              E === "LineString" && w++;
+              E === "LineString" && m++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -135,40 +135,40 @@ function et(r, t, e) {
                 for (i = 0; i < s[n].length - l; i++) {
                   if (t(
                     s[n][i],
-                    c,
-                    g,
-                    w,
-                    A
+                    u,
+                    y,
+                    m,
+                    _
                   ) === !1)
                     return !1;
-                  c++;
+                  u++;
                 }
-                E === "MultiLineString" && w++, E === "Polygon" && A++;
+                E === "MultiLineString" && m++, E === "Polygon" && _++;
               }
-              E === "Polygon" && w++;
+              E === "Polygon" && m++;
               break;
             case "MultiPolygon":
               for (n = 0; n < s.length; n++) {
-                for (A = 0, i = 0; i < s[n].length; i++) {
+                for (_ = 0, i = 0; i < s[n].length; i++) {
                   for (o = 0; o < s[n][i].length - l; o++) {
                     if (t(
                       s[n][i][o],
-                      c,
-                      g,
-                      w,
-                      A
+                      u,
+                      y,
+                      m,
+                      _
                     ) === !1)
                       return !1;
-                    c++;
+                    u++;
                   }
-                  A++;
+                  _++;
                 }
-                w++;
+                m++;
               }
               break;
             case "GeometryCollection":
               for (n = 0; n < a.geometries.length; n++)
-                if (et(a.geometries[n], t) === !1)
+                if (rt(a.geometries[n], t) === !1)
                   return !1;
               break;
             default:
@@ -178,15 +178,15 @@ function et(r, t, e) {
       }
     }
 }
-function St(r, t = {}) {
+function Ot(r, t = {}) {
   if (r.bbox != null && t.recompute !== !0)
     return r.bbox;
   const e = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-  return et(r, (n) => {
+  return rt(r, (n) => {
     e[0] > n[0] && (e[0] = n[0]), e[1] > n[1] && (e[1] = n[1]), e[2] < n[0] && (e[2] = n[0]), e[3] < n[1] && (e[3] = n[1]);
   }), e;
 }
-const K = [
+const Y = [
   Int8Array,
   Uint8Array,
   Uint8ClampedArray,
@@ -196,8 +196,8 @@ const K = [
   Uint32Array,
   Float32Array,
   Float64Array
-], F = 1, L = 8;
-class j {
+], G = 1, L = 8;
+class I {
   /**
    * Creates an index from raw `ArrayBuffer` data.
    * @param {ArrayBuffer} data
@@ -209,13 +209,13 @@ class j {
     if (e !== 219)
       throw new Error("Data does not appear to be in a KDBush format.");
     const i = n >> 4;
-    if (i !== F)
-      throw new Error(`Got v${i} data when expected v${F}.`);
-    const o = K[n & 15];
+    if (i !== G)
+      throw new Error(`Got v${i} data when expected v${G}.`);
+    const o = Y[n & 15];
     if (!o)
       throw new Error("Unrecognized array type.");
-    const [a] = new Uint16Array(t, 2, 1), [u] = new Uint32Array(t, 4, 1);
-    return new j(u, a, o, t);
+    const [a] = new Uint16Array(t, 2, 1), [c] = new Uint32Array(t, 4, 1);
+    return new I(c, a, o, t);
   }
   /**
    * Creates an index that will hold a given number of items.
@@ -227,10 +227,10 @@ class j {
   constructor(t, e = 64, n = Float64Array, i) {
     if (isNaN(t) || t < 0) throw new Error(`Unpexpected numItems value: ${t}.`);
     this.numItems = +t, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.ArrayType = n, this.IndexArrayType = t < 65536 ? Uint16Array : Uint32Array;
-    const o = K.indexOf(this.ArrayType), a = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, u = t * this.IndexArrayType.BYTES_PER_ELEMENT, s = (8 - u % 8) % 8;
+    const o = Y.indexOf(this.ArrayType), a = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, c = t * this.IndexArrayType.BYTES_PER_ELEMENT, s = (8 - c % 8) % 8;
     if (o < 0)
       throw new Error(`Unexpected typed array class: ${n}.`);
-    i && i instanceof ArrayBuffer ? (this.data = i, this.ids = new this.IndexArrayType(this.data, L, t), this.coords = new this.ArrayType(this.data, L + u + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(L + a + u + s), this.ids = new this.IndexArrayType(this.data, L, t), this.coords = new this.ArrayType(this.data, L + u + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (F << 4) + o]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t);
+    i && i instanceof ArrayBuffer ? (this.data = i, this.ids = new this.IndexArrayType(this.data, L, t), this.coords = new this.ArrayType(this.data, L + c + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(L + a + c + s), this.ids = new this.IndexArrayType(this.data, L, t), this.coords = new this.ArrayType(this.data, L + c + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (G << 4) + o]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t);
   }
   /**
    * Add a point to the index.
@@ -249,7 +249,7 @@ class j {
     const t = this._pos >> 1;
     if (t !== this.numItems)
       throw new Error(`Added ${t} items when expected ${this.numItems}.`);
-    return $(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0), this._finished = !0, this;
+    return j(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.
@@ -261,18 +261,18 @@ class j {
    */
   range(t, e, n, i) {
     if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: o, coords: a, nodeSize: u } = this, s = [0, o.length - 1, 0], h = [];
+    const { ids: o, coords: a, nodeSize: c } = this, s = [0, o.length - 1, 0], h = [];
     for (; s.length; ) {
-      const l = s.pop() || 0, c = s.pop() || 0, p = s.pop() || 0;
-      if (c - p <= u) {
-        for (let m = p; m <= c; m++) {
-          const g = a[2 * m], M = a[2 * m + 1];
-          g >= t && g <= n && M >= e && M <= i && h.push(o[m]);
+      const l = s.pop() || 0, u = s.pop() || 0, p = s.pop() || 0;
+      if (u - p <= c) {
+        for (let w = p; w <= u; w++) {
+          const y = a[2 * w], f = a[2 * w + 1];
+          y >= t && y <= n && f >= e && f <= i && h.push(o[w]);
         }
         continue;
       }
-      const d = p + c >> 1, y = a[2 * d], f = a[2 * d + 1];
-      y >= t && y <= n && f >= e && f <= i && h.push(o[d]), (l === 0 ? t <= y : e <= f) && (s.push(p), s.push(d - 1), s.push(1 - l)), (l === 0 ? n >= y : i >= f) && (s.push(d + 1), s.push(c), s.push(1 - l));
+      const d = p + u >> 1, g = a[2 * d], M = a[2 * d + 1];
+      g >= t && g <= n && M >= e && M <= i && h.push(o[d]), (l === 0 ? t <= g : e <= M) && (s.push(p), s.push(d - 1), s.push(1 - l)), (l === 0 ? n >= g : i >= M) && (s.push(d + 1), s.push(u), s.push(1 - l));
     }
     return h;
   }
@@ -285,35 +285,35 @@ class j {
    */
   within(t, e, n) {
     if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: i, coords: o, nodeSize: a } = this, u = [0, i.length - 1, 0], s = [], h = n * n;
-    for (; u.length; ) {
-      const l = u.pop() || 0, c = u.pop() || 0, p = u.pop() || 0;
-      if (c - p <= a) {
-        for (let m = p; m <= c; m++)
-          W(o[2 * m], o[2 * m + 1], t, e) <= h && s.push(i[m]);
+    const { ids: i, coords: o, nodeSize: a } = this, c = [0, i.length - 1, 0], s = [], h = n * n;
+    for (; c.length; ) {
+      const l = c.pop() || 0, u = c.pop() || 0, p = c.pop() || 0;
+      if (u - p <= a) {
+        for (let w = p; w <= u; w++)
+          q(o[2 * w], o[2 * w + 1], t, e) <= h && s.push(i[w]);
         continue;
       }
-      const d = p + c >> 1, y = o[2 * d], f = o[2 * d + 1];
-      W(y, f, t, e) <= h && s.push(i[d]), (l === 0 ? t - n <= y : e - n <= f) && (u.push(p), u.push(d - 1), u.push(1 - l)), (l === 0 ? t + n >= y : e + n >= f) && (u.push(d + 1), u.push(c), u.push(1 - l));
+      const d = p + u >> 1, g = o[2 * d], M = o[2 * d + 1];
+      q(g, M, t, e) <= h && s.push(i[d]), (l === 0 ? t - n <= g : e - n <= M) && (c.push(p), c.push(d - 1), c.push(1 - l)), (l === 0 ? t + n >= g : e + n >= M) && (c.push(d + 1), c.push(u), c.push(1 - l));
     }
     return s;
   }
 }
-function $(r, t, e, n, i, o) {
+function j(r, t, e, n, i, o) {
   if (i - n <= e) return;
   const a = n + i >> 1;
-  nt(r, t, a, n, i, o), $(r, t, e, n, a - 1, 1 - o), $(r, t, e, a + 1, i, 1 - o);
+  st(r, t, a, n, i, o), j(r, t, e, n, a - 1, 1 - o), j(r, t, e, a + 1, i, 1 - o);
 }
-function nt(r, t, e, n, i, o) {
+function st(r, t, e, n, i, o) {
   for (; i > n; ) {
     if (i - n > 600) {
-      const h = i - n + 1, l = e - n + 1, c = Math.log(h), p = 0.5 * Math.exp(2 * c / 3), d = 0.5 * Math.sqrt(c * p * (h - p) / h) * (l - h / 2 < 0 ? -1 : 1), y = Math.max(n, Math.floor(e - l * p / h + d)), f = Math.min(i, Math.floor(e + (h - l) * p / h + d));
-      nt(r, t, e, y, f, o);
+      const h = i - n + 1, l = e - n + 1, u = Math.log(h), p = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * p * (h - p) / h) * (l - h / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - l * p / h + d)), M = Math.min(i, Math.floor(e + (h - l) * p / h + d));
+      st(r, t, e, g, M, o);
     }
     const a = t[2 * e + o];
-    let u = n, s = i;
-    for (C(r, t, n, e), t[2 * i + o] > a && C(r, t, n, i); u < s; ) {
-      for (C(r, t, u, s), u++, s--; t[2 * u + o] < a; ) u++;
+    let c = n, s = i;
+    for (C(r, t, n, e), t[2 * i + o] > a && C(r, t, n, i); c < s; ) {
+      for (C(r, t, c, s), c++, s--; t[2 * c + o] < a; ) c++;
       for (; t[2 * s + o] > a; ) s--;
     }
     t[2 * n + o] === a ? C(r, t, n, s) : (s++, C(r, t, s, i)), s <= e && (n = s + 1), e <= s && (i = s - 1);
@@ -326,7 +326,7 @@ function N(r, t, e) {
   const n = r[t];
   r[t] = r[e], r[e] = n;
 }
-function W(r, t, e, n) {
+function q(r, t, e, n) {
   const i = r - e, o = t - n;
   return i * i + o * o;
 }
@@ -353,7 +353,7 @@ const xt = {
   // properties to use for individual points when running the reducer
   map: (r) => r
   // props => ({sum: props.my_value})
-}, Y = Math.fround || /* @__PURE__ */ ((r) => (t) => (r[0] = +t, r[0]))(new Float32Array(1)), P = 2, S = 3, G = 4, b = 5, rt = 6;
+}, Q = Math.fround || /* @__PURE__ */ ((r) => (t) => (r[0] = +t, r[0]))(new Float32Array(1)), x = 2, S = 3, $ = 4, b = 5, it = 6;
 class Pt {
   constructor(t) {
     this.options = Object.assign(Object.create(xt), t), this.trees = new Array(this.options.maxZoom + 1), this.stride = this.options.reduce ? 7 : 6, this.clusterProps = [];
@@ -367,7 +367,7 @@ class Pt {
     for (let s = 0; s < t.length; s++) {
       const h = t[s];
       if (!h.geometry) continue;
-      const [l, c] = h.geometry.coordinates, p = Y(U(l)), d = Y(z(c));
+      const [l, u] = h.geometry.coordinates, p = Q(z(l)), d = Q(B(u));
       a.push(
         p,
         d,
@@ -382,11 +382,11 @@ class Pt {
         // number of points in a cluster
       ), this.options.reduce && a.push(0);
     }
-    let u = this.trees[i + 1] = this._createTree(a);
+    let c = this.trees[i + 1] = this._createTree(a);
     e && console.timeEnd(o);
     for (let s = i; s >= n; s--) {
       const h = +Date.now();
-      u = this.trees[s] = this._createTree(this._cluster(u, s)), e && console.log("z%d: %d clusters in %dms", s, u.numItems, +Date.now() - h);
+      c = this.trees[s] = this._createTree(this._cluster(c, s)), e && console.log("z%d: %d clusters in %dms", s, c.numItems, +Date.now() - h);
     }
     return e && console.timeEnd("total time"), this;
   }
@@ -398,13 +398,13 @@ class Pt {
     if (t[2] - t[0] >= 360)
       n = -180, o = 180;
     else if (n > o) {
-      const c = this.getClusters([n, i, 180, a], e), p = this.getClusters([-180, i, o, a], e);
-      return c.concat(p);
+      const u = this.getClusters([n, i, 180, a], e), p = this.getClusters([-180, i, o, a], e);
+      return u.concat(p);
     }
-    const u = this.trees[this._limitZoom(e)], s = u.range(U(n), z(a), U(o), z(i)), h = u.data, l = [];
-    for (const c of s) {
-      const p = this.stride * c;
-      l.push(h[p + b] > 1 ? q(h, p, this.clusterProps) : this.points[h[p + S]]);
+    const c = this.trees[this._limitZoom(e)], s = c.range(z(n), B(a), z(o), B(i)), h = c.data, l = [];
+    for (const u of s) {
+      const p = this.stride * u;
+      l.push(h[p + b] > 1 ? k(h, p, this.clusterProps) : this.points[h[p + S]]);
     }
     return l;
   }
@@ -413,13 +413,13 @@ class Pt {
     if (!o) throw new Error(i);
     const a = o.data;
     if (e * this.stride >= a.length) throw new Error(i);
-    const u = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], h = a[e * this.stride + 1], l = o.within(s, h, u), c = [];
+    const c = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], h = a[e * this.stride + 1], l = o.within(s, h, c), u = [];
     for (const p of l) {
       const d = p * this.stride;
-      a[d + G] === t && c.push(a[d + b] > 1 ? q(a, d, this.clusterProps) : this.points[a[d + S]]);
+      a[d + $] === t && u.push(a[d + b] > 1 ? k(a, d, this.clusterProps) : this.points[a[d + S]]);
     }
-    if (c.length === 0) throw new Error(i);
-    return c;
+    if (u.length === 0) throw new Error(i);
+    return u;
   }
   getLeaves(t, e, n) {
     e = e || 10, n = n || 0;
@@ -427,7 +427,7 @@ class Pt {
     return this._appendLeaves(i, t, e, n, 0), i;
   }
   getTile(t, e, n) {
-    const i = this.trees[this._limitZoom(t)], o = Math.pow(2, t), { extent: a, radius: u } = this.options, s = u / a, h = (n - s) / o, l = (n + 1 + s) / o, c = {
+    const i = this.trees[this._limitZoom(t)], o = Math.pow(2, t), { extent: a, radius: c } = this.options, s = c / a, h = (n - s) / o, l = (n + 1 + s) / o, u = {
       features: []
     };
     return this._addTileFeatures(
@@ -436,22 +436,22 @@ class Pt {
       e,
       n,
       o,
-      c
+      u
     ), e === 0 && this._addTileFeatures(
       i.range(1 - s / o, h, 1, l),
       i.data,
       o,
       n,
       o,
-      c
+      u
     ), e === o - 1 && this._addTileFeatures(
       i.range(0, h, s / o, l),
       i.data,
       -1,
       n,
       o,
-      c
-    ), c.features.length ? c : null;
+      u
+    ), u.features.length ? u : null;
   }
   getClusterExpansionZoom(t) {
     let e = this._getOriginZoom(t) - 1;
@@ -464,74 +464,74 @@ class Pt {
   }
   _appendLeaves(t, e, n, i, o) {
     const a = this.getChildren(e);
-    for (const u of a) {
-      const s = u.properties;
-      if (s && s.cluster ? o + s.point_count <= i ? o += s.point_count : o = this._appendLeaves(t, s.cluster_id, n, i, o) : o < i ? o++ : t.push(u), t.length === n) break;
+    for (const c of a) {
+      const s = c.properties;
+      if (s && s.cluster ? o + s.point_count <= i ? o += s.point_count : o = this._appendLeaves(t, s.cluster_id, n, i, o) : o < i ? o++ : t.push(c), t.length === n) break;
     }
     return o;
   }
   _createTree(t) {
-    const e = new j(t.length / this.stride | 0, this.options.nodeSize, Float32Array);
+    const e = new I(t.length / this.stride | 0, this.options.nodeSize, Float32Array);
     for (let n = 0; n < t.length; n += this.stride) e.add(t[n], t[n + 1]);
     return e.finish(), e.data = t, e;
   }
   _addTileFeatures(t, e, n, i, o, a) {
-    for (const u of t) {
-      const s = u * this.stride, h = e[s + b] > 1;
-      let l, c, p;
+    for (const c of t) {
+      const s = c * this.stride, h = e[s + b] > 1;
+      let l, u, p;
       if (h)
-        l = st(e, s, this.clusterProps), c = e[s], p = e[s + 1];
+        l = ot(e, s, this.clusterProps), u = e[s], p = e[s + 1];
       else {
-        const f = this.points[e[s + S]];
-        l = f.properties;
-        const [m, g] = f.geometry.coordinates;
-        c = U(m), p = z(g);
+        const M = this.points[e[s + S]];
+        l = M.properties;
+        const [w, y] = M.geometry.coordinates;
+        u = z(w), p = B(y);
       }
       const d = {
         type: 1,
         geometry: [[
-          Math.round(this.options.extent * (c * o - n)),
+          Math.round(this.options.extent * (u * o - n)),
           Math.round(this.options.extent * (p * o - i))
         ]],
         tags: l
       };
-      let y;
-      h || this.options.generateId ? y = e[s + S] : y = this.points[e[s + S]].id, y !== void 0 && (d.id = y), a.features.push(d);
+      let g;
+      h || this.options.generateId ? g = e[s + S] : g = this.points[e[s + S]].id, g !== void 0 && (d.id = g), a.features.push(d);
     }
   }
   _limitZoom(t) {
     return Math.max(this.options.minZoom, Math.min(Math.floor(+t), this.options.maxZoom + 1));
   }
   _cluster(t, e) {
-    const { radius: n, extent: i, reduce: o, minPoints: a } = this.options, u = n / (i * Math.pow(2, e)), s = t.data, h = [], l = this.stride;
-    for (let c = 0; c < s.length; c += l) {
-      if (s[c + P] <= e) continue;
-      s[c + P] = e;
-      const p = s[c], d = s[c + 1], y = t.within(s[c], s[c + 1], u), f = s[c + b];
-      let m = f;
-      for (const g of y) {
-        const M = g * l;
-        s[M + P] > e && (m += s[M + b]);
+    const { radius: n, extent: i, reduce: o, minPoints: a } = this.options, c = n / (i * Math.pow(2, e)), s = t.data, h = [], l = this.stride;
+    for (let u = 0; u < s.length; u += l) {
+      if (s[u + x] <= e) continue;
+      s[u + x] = e;
+      const p = s[u], d = s[u + 1], g = t.within(s[u], s[u + 1], c), M = s[u + b];
+      let w = M;
+      for (const y of g) {
+        const f = y * l;
+        s[f + x] > e && (w += s[f + b]);
       }
-      if (m > f && m >= a) {
-        let g = p * f, M = d * f, w, A = -1;
-        const E = ((c / l | 0) << 5) + (e + 1) + this.points.length;
-        for (const it of y) {
-          const x = it * l;
-          if (s[x + P] <= e) continue;
-          s[x + P] = e;
-          const I = s[x + b];
-          g += s[x] * I, M += s[x + 1] * I, s[x + G] = E, o && (w || (w = this._map(s, c, !0), A = this.clusterProps.length, this.clusterProps.push(w)), o(w, this._map(s, x)));
+      if (w > M && w >= a) {
+        let y = p * M, f = d * M, m, _ = -1;
+        const E = ((u / l | 0) << 5) + (e + 1) + this.points.length;
+        for (const F of g) {
+          const O = F * l;
+          if (s[O + x] <= e) continue;
+          s[O + x] = e;
+          const V = s[O + b];
+          y += s[O] * V, f += s[O + 1] * V, s[O + $] = E, o && (m || (m = this._map(s, u, !0), _ = this.clusterProps.length, this.clusterProps.push(m)), o(m, this._map(s, O)));
         }
-        s[c + G] = E, h.push(g / m, M / m, 1 / 0, E, -1, m), o && h.push(A);
+        s[u + $] = E, h.push(y / w, f / w, 1 / 0, E, -1, w), o && h.push(_);
       } else {
-        for (let g = 0; g < l; g++) h.push(s[c + g]);
-        if (m > 1)
-          for (const g of y) {
-            const M = g * l;
-            if (!(s[M + P] <= e)) {
-              s[M + P] = e;
-              for (let w = 0; w < l; w++) h.push(s[M + w]);
+        for (let y = 0; y < l; y++) h.push(s[u + y]);
+        if (w > 1)
+          for (const y of g) {
+            const f = y * l;
+            if (!(s[f + x] <= e)) {
+              s[f + x] = e;
+              for (let m = 0; m < l; m++) h.push(s[f + m]);
             }
           }
       }
@@ -548,26 +548,26 @@ class Pt {
   }
   _map(t, e, n) {
     if (t[e + b] > 1) {
-      const a = this.clusterProps[t[e + rt]];
+      const a = this.clusterProps[t[e + it]];
       return n ? Object.assign({}, a) : a;
     }
     const i = this.points[t[e + S]].properties, o = this.options.map(i);
     return n && o === i ? Object.assign({}, o) : o;
   }
 }
-function q(r, t, e) {
+function k(r, t, e) {
   return {
     type: "Feature",
     id: r[t + S],
-    properties: st(r, t, e),
+    properties: ot(r, t, e),
     geometry: {
       type: "Point",
-      coordinates: [Ot(r[t]), Tt(r[t + 1])]
+      coordinates: [vt(r[t]), Tt(r[t + 1])]
     }
   };
 }
-function st(r, t, e) {
-  const n = r[t + b], i = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, o = r[t + rt], a = o === -1 ? {} : Object.assign({}, e[o]);
+function ot(r, t, e) {
+  const n = r[t + b], i = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, o = r[t + it], a = o === -1 ? {} : Object.assign({}, e[o]);
   return Object.assign(a, {
     cluster: !0,
     cluster_id: r[t + S],
@@ -575,26 +575,26 @@ function st(r, t, e) {
     point_count_abbreviated: i
   });
 }
-function U(r) {
+function z(r) {
   return r / 360 + 0.5;
 }
-function z(r) {
+function B(r) {
   const t = Math.sin(r * Math.PI / 180), e = 0.5 - 0.25 * Math.log((1 + t) / (1 - t)) / Math.PI;
   return e < 0 ? 0 : e > 1 ? 1 : e;
 }
-function Ot(r) {
+function vt(r) {
   return (r - 0.5) * 360;
 }
 function Tt(r) {
   const t = (180 - r * 360) * Math.PI / 180;
   return 360 * Math.atan(Math.exp(t)) / Math.PI - 90;
 }
-var Q = Object.prototype.hasOwnProperty;
-function k(r, t, e) {
+var X = Object.prototype.hasOwnProperty;
+function tt(r, t, e) {
   for (e of r.keys())
-    if (O(e, t)) return e;
+    if (v(e, t)) return e;
 }
-function O(r, t) {
+function v(r, t) {
   var e, n, i;
   if (r === t) return !0;
   if (r && t && (e = r.constructor) === t.constructor) {
@@ -602,21 +602,21 @@ function O(r, t) {
     if (e === RegExp) return r.toString() === t.toString();
     if (e === Array) {
       if ((n = r.length) === t.length)
-        for (; n-- && O(r[n], t[n]); ) ;
+        for (; n-- && v(r[n], t[n]); ) ;
       return n === -1;
     }
     if (e === Set) {
       if (r.size !== t.size)
         return !1;
       for (n of r)
-        if (i = n, i && typeof i == "object" && (i = k(t, i), !i) || !t.has(i)) return !1;
+        if (i = n, i && typeof i == "object" && (i = tt(t, i), !i) || !t.has(i)) return !1;
       return !0;
     }
     if (e === Map) {
       if (r.size !== t.size)
         return !1;
       for (n of r)
-        if (i = n[0], i && typeof i == "object" && (i = k(t, i), !i) || !O(n[1], t.get(i)))
+        if (i = n[0], i && typeof i == "object" && (i = tt(t, i), !i) || !v(n[1], t.get(i)))
           return !1;
       return !0;
     }
@@ -635,57 +635,64 @@ function O(r, t) {
     if (!e || typeof r == "object") {
       n = 0;
       for (e in r)
-        if (Q.call(r, e) && ++n && !Q.call(t, e) || !(e in t) || !O(r[e], t[e])) return !1;
+        if (X.call(r, e) && ++n && !X.call(t, e) || !(e in t) || !v(r[e], t[e])) return !1;
       return Object.keys(t).length === n;
     }
   }
   return r !== r && t !== t;
 }
-function vt(r) {
-  var t = B.useRef(r), e = B.useRef(0);
-  return O(r, t.current) || (t.current = r, e.current += 1), B.useMemo(function() {
+function Lt(r) {
+  var t = D.useRef(r), e = D.useRef(0);
+  return v(r, t.current) || (t.current = r, e.current += 1), D.useMemo(function() {
     return t.current;
   }, [e.current]);
 }
-function Lt(r, t) {
-  return B.useEffect(r, vt(t));
+function Ct(r, t) {
+  return D.useEffect(r, Lt(t));
 }
-var Ct = function(t) {
-  var e = t.points, n = t.bounds, i = t.zoom, o = t.options, a = t.disableRefresh, u = V(), s = V(), h = D([]), l = h[0], c = h[1], p = Math.round(i);
-  return Lt(function() {
-    a !== !0 && ((!u.current || !O(s.current, e) || !O(u.current.options, o)) && (u.current = new Pt(o), u.current.load(e)), n && c(u.current.getClusters(n, p)), s.current = e);
+var Rt = function(t) {
+  var e = t.points, n = t.bounds, i = t.zoom, o = t.options, a = t.disableRefresh, c = H(), s = H(), h = U([]), l = h[0], u = h[1], p = Math.round(i);
+  return Ct(function() {
+    a !== !0 && ((!c.current || !v(s.current, e) || !v(c.current.options, o)) && (c.current = new Pt(o), c.current.load(e)), n && u(c.current.getClusters(n, p)), s.current = e);
   }, [e, n, p, o, a]), {
     clusters: l,
-    supercluster: u.current
+    supercluster: c.current
   };
 };
-const Rt = _(() => import("./index-CRQ5kxRL.js")), Zt = _(() => import("./index-DnsF5I7I.js")), Ut = _(() => import("./index-DNKXUpkv.js"));
-function zt({ markers: r, markerBoundsPadding: t = 1e-3, onClick: e, ...n }) {
-  const { mapProvider: i, center: o, bounds: a, zoom: u } = Z(), [s, h] = D(a);
-  ct(() => {
-    const f = r.length > 0 ? r.map((g) => [g.latitude, g.longitude]) : [[o.latitude, o.longitude]], m = St(bt(f));
-    h(m);
-  }, [r, o]);
-  const l = v(() => typeof t == "number" ? {
+const Ut = A(() => import("./index-Bu4XEiYU.js")), Zt = A(() => import("./index-DsrEcQq0.js")), zt = A(() => import("./index-BcpSqK0X.js"));
+function Bt({ markers: r, markerBoundsPadding: t = 1e-3, onClick: e, ...n }) {
+  const { mapProvider: i, activeMarker: o, center: a, bounds: c, zoom: s } = Z(), [h, l] = U(c);
+  ut(() => {
+    const f = r.length > 0 ? r.map((_) => [_.latitude, _.longitude]) : [[a.latitude, a.longitude]], m = Ot(St(f));
+    l(m);
+  }, [r, a]);
+  const u = P(() => typeof t == "number" ? {
     top: t,
     bottom: t,
     left: t,
     right: t
-  } : t, [t]), { clusters: c, supercluster: p } = Ct({
-    points: r.map((f) => Et([f.longitude, f.latitude], f)),
-    bounds: a,
-    zoom: u,
-    options: { radius: lt, minZoom: ut, maxZoom: ht }
-  }), d = (f) => {
-    var m, g, M;
+  } : t, [t]), p = P(
+    () => ({
+      points: r.map((f) => bt([f.longitude, f.latitude], f)),
+      bounds: c,
+      zoom: s,
+      options: {
+        radius: i.name === "google" && s > K ? pt : lt,
+        minZoom: K,
+        maxZoom: ht
+      }
+    }),
+    [r, i, c, s]
+  ), { clusters: d, supercluster: g } = Rt(p), M = (f) => {
+    var m, _, E;
     if (!("properties" in f))
       throw new Error("Cluster does not have properties");
-    if ((m = f.properties) != null && m.cluster && typeof ((g = f.properties) == null ? void 0 : g.cluster_id) == "number") {
+    if ((m = f.properties) != null && m.cluster && typeof ((_ = f.properties) == null ? void 0 : _.cluster_id) == "number") {
       e == null || e({
         id: `${f.properties.cluster_id}`,
         latitude: f.geometry.coordinates[1],
         longitude: f.geometry.coordinates[0],
-        markers: ((M = p == null ? void 0 : p.getLeaves(f.properties.cluster_id)) == null ? void 0 : M.map((w) => w.properties)) ?? []
+        markers: ((E = g == null ? void 0 : g.getLeaves(f.properties.cluster_id)) == null ? void 0 : E.map((F) => F.properties)) ?? []
       });
       return;
     }
@@ -695,14 +702,17 @@ function zt({ markers: r, markerBoundsPadding: t = 1e-3, onClick: e, ...n }) {
       longitude: f.properties.longitude,
       markers: [f.properties]
     });
-  }, y = v(() => {
+  }, w = (f) => {
+    var m;
+    return !g || !o ? !1 : o.id === `${f}` ? !0 : ((m = g.getLeaves(f)) == null ? void 0 : m.find((_) => _.properties.id === o.id)) !== void 0;
+  }, y = P(() => {
     switch (i == null ? void 0 : i.name) {
       case "maptiler":
-        return Rt;
+        return Ut;
       case "google":
         return Zt;
       case "mapbox":
-        return Ut;
+        return zt;
       default:
         return null;
     }
@@ -710,63 +720,64 @@ function zt({ markers: r, markerBoundsPadding: t = 1e-3, onClick: e, ...n }) {
   return y ? /* @__PURE__ */ T(
     y,
     {
-      clusters: c,
-      markerBounds: s,
-      markerBoundsPadding: l,
-      onClick: d,
+      clusters: d,
+      markerBounds: h,
+      markerBoundsPadding: u,
+      onClick: M,
+      doesSuperclusterContainActiveMarker: w,
       ...n
     }
   ) : null;
 }
-const Bt = _(() => import("./index-BOuko7CL.js")), Dt = _(() => import("./index-9RZYMoMG.js")), Ft = _(() => import("./index-D5uhfwEH.js"));
+const Dt = A(() => import("./index-BhldVNew.js")), Ft = A(() => import("./index-B9YXnLOH.js")), Gt = A(() => import("./index-DFdfOz0d.js"));
 function Nt({ children: r, ...t }) {
-  const { mapProvider: e } = Z(), n = v(() => {
+  const { mapProvider: e } = Z(), n = P(() => {
     switch (e == null ? void 0 : e.name) {
       case "maptiler":
-        return Bt;
-      case "google":
         return Dt;
-      case "mapbox":
+      case "google":
         return Ft;
+      case "mapbox":
+        return Gt;
       default:
         return null;
     }
   }, [e]);
   return n ? /* @__PURE__ */ T(n, { ...t, children: r }) : null;
 }
-const Gt = _(() => import("./index-CTk5bvm9.js")), $t = _(() => import("./index-BsnsAUt5.js")), jt = _(() => import("./index-DVitM43i.js"));
-function It(r) {
-  const { mapProvider: t } = Z(), e = v(() => {
+const $t = A(() => import("./index-CTk5bvm9.js")), jt = A(() => import("./index-UEadmVww.js")), It = A(() => import("./index-DVitM43i.js"));
+function Vt(r) {
+  const { mapProvider: t } = Z(), e = P(() => {
     switch (t == null ? void 0 : t.name) {
       case "maptiler":
-        return Gt;
-      case "google":
         return $t;
-      case "mapbox":
+      case "google":
         return jt;
+      case "mapbox":
+        return It;
       default:
         return null;
     }
   }, [t]);
   return e ? /* @__PURE__ */ T(e, { ...r }) : null;
 }
-function Vt(r) {
-  const [t, e] = D(r.zoom || R.zoom), [n, i] = D();
-  return /* @__PURE__ */ T(X.Provider, { value: { ...r, bounds: n, setBounds: i, zoom: t, setZoom: e }, children: r.children });
+function Ht(r) {
+  const [t, e] = U(r.zoom || R.zoom), [n, i] = U();
+  return /* @__PURE__ */ T(et.Provider, { value: { ...r, bounds: n, setBounds: i, zoom: t, setZoom: e }, children: r.children });
 }
-const Kt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Wt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BaseMap: yt,
-  CenterPin: At,
-  Layers: It,
-  Markers: zt,
+  BaseMap: wt,
+  CenterPin: Et,
+  Layers: Vt,
+  Markers: Bt,
   Popup: Nt,
-  Root: Vt
+  Root: Ht
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  ut as M,
-  H as a,
+  K as M,
+  J as a,
   R as d,
-  Kt as i,
+  Wt as i,
   Z as u
 };