@local-logic/maps 0.0.23 → 0.0.24

package/dist/{index-CN_dNOir.js → index-Ct-3yYUx.js}

@@ -1,7 +1,7 @@
 import { jsx as O } from "react/jsx-runtime";
-import * as U from "react";
-import it, { useContext as at, useState as L, useMemo as b, lazy as y, useRef as k, useEffect as ct } from "react";
-const tt = it.createContext({}), I = () => at(tt), C = {
+import * as D from "react";
+import at, { useContext as ct, useState as L, useMemo as S, lazy as w, useRef as z, useEffect as H } from "react";
+const et = at.createContext({}), R = () => ct(et), C = {
   zoom: 14,
   pitch: 0,
   bearing: 0,
@@ -10,61 +10,66 @@ const tt = it.createContext({}), I = () => at(tt), C = {
   maptiler: "600d69cb-288d-445e-9839-3dfe4d76b31a",
   mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
   google: "a7ff20eb973126bb"
-}, H = 13, ut = 22, Vt = 12.5, pt = 30, ht = 60, lt = "w-full h-full relative overflow-hidden", ft = y(() => import("./index-BpFpg_5A.js")), dt = y(() => import("./index-CceEGv05.js")), mt = y(() => import("./index-arkRlpaR.js")), gt = y(() => import("./index-qqbvBkdn.js")), yt = ({ padding: r = 1e-3, children: t }) => {
+}, ut = {
+  top: 10,
+  bottom: 10,
+  left: 10,
+  right: 10
+}, J = 13, pt = 22, Jt = 12.5, ht = 30, lt = 60, Wt = 15, ft = [-180, -85.0511, 180, 85.0511], dt = "w-full h-full relative overflow-hidden", mt = w(() => import("./index-BOZt1-DO.js")), gt = w(() => import("./index-CUvZ7gVt.js")), yt = w(() => import("./index-DJx0avMT.js")), wt = w(() => import("./index-qqbvBkdn.js")), Mt = ({ children: r }) => {
   const {
-    mapProvider: e,
-    center: n,
-    zoom: o = C.zoom,
-    pitch: i = C.pitch,
-    bearing: a = C.bearing,
-    cooperativeGestures: c = C.cooperativeGestures,
-    zoomPosition: s
-  } = I(), [p] = L(o), h = b(() => {
-    switch (e?.name) {
+    mapProvider: t,
+    center: e,
+    zoom: n = C.zoom,
+    pitch: o = C.pitch,
+    bearing: i = C.bearing,
+    cooperativeGestures: a = C.cooperativeGestures,
+    zoomPosition: c
+  } = R(), [s] = L(n), h = S(() => {
+    switch (t?.name) {
       case "maptiler":
-        return ft;
+        return mt;
       case "google":
-        return dt;
+        return gt;
       case "mapbox":
-        return mt;
+        return yt;
       default:
-        return gt;
+        return wt;
     }
-  }, [e]);
+  }, [t]);
   return /* @__PURE__ */ O(
     "div",
     {
-      className: lt,
+      className: dt,
       "data-testid": "base-map",
-      "data-map-provider-name": e?.name,
-      "data-map-provider-theme": e?.theme || V[e?.name] || V.maptiler,
-      "data-initial-zoom": p,
-      "data-pitch": i,
-      "data-bearing": a,
-      "data-cooperative-gestures": c,
-      "data-zoom-position": s,
-      "data-center-latitude": n.latitude,
-      "data-center-longitude": n.longitude,
-      children: /* @__PURE__ */ O(h, { padding: r, children: t })
+      "data-map-provider-name": t?.name,
+      "data-map-provider-theme": t?.theme || V[t?.name] || V.maptiler,
+      "data-initial-zoom": s,
+      "data-pitch": o,
+      "data-bearing": i,
+      "data-cooperative-gestures": a,
+      "data-zoom-position": c,
+      "data-center-latitude": e.latitude,
+      "data-center-longitude": e.longitude,
+      children: /* @__PURE__ */ O(h, { children: r })
     }
   );
-}, wt = y(() => import("./index-vHMPqmOL.js")), Mt = y(() => import("./index-DNNz78Rc.js")), _t = y(() => import("./index-CiWKwaC4.js"));
-function At(r) {
-  const { mapProvider: t } = I(), e = b(() => {
+}, _t = w(() => import("./index-C3Tj3r2u.js")), Pt = w(() => import("./index-CUUravWc.js")), At = w(() => import("./index-eWv3le07.js"));
+function Et(r) {
+  const { mapProvider: t } = R(), e = S(() => {
     switch (t?.name) {
       case "maptiler":
-        return wt;
+        return _t;
       case "google":
-        return Mt;
+        return Pt;
       case "mapbox":
-        return _t;
+        return At;
       default:
         return null;
     }
   }, [t]);
   return e ? /* @__PURE__ */ O(e, { ...r }) : null;
 }
-function et(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;
 }
@@ -75,23 +80,23 @@ function xt(r, t, e = {}) {
     throw new Error("coordinates must be an Array");
   if (r.length < 2)
     throw new Error("coordinates must be at least 2 numbers long");
-  if (!Y(r[0]) || !Y(r[1]))
+  if (!W(r[0]) || !W(r[1]))
     throw new Error("coordinates must contain numbers");
-  return et({
+  return nt({
     type: "Point",
     coordinates: r
   }, t, e);
 }
-function Ht(r, t, e = {}) {
-  return et({
+function Yt(r, t, e = {}) {
+  return nt({
     type: "MultiPoint",
     coordinates: r
   }, t, e);
 }
-function Y(r) {
+function W(r) {
   return !isNaN(r) && r !== null && !Array.isArray(r);
 }
-const J = [
+const Y = [
   Int8Array,
   Uint8Array,
   Uint8ClampedArray,
@@ -102,7 +107,7 @@ const J = [
   Float32Array,
   Float64Array
 ], F = 1, T = 8;
-class j {
+class G {
   /**
    * Creates an index from raw `ArrayBuffer` data.
    * @param {ArrayBuffer} data
@@ -116,11 +121,11 @@ class j {
     const o = n >> 4;
     if (o !== F)
       throw new Error(`Got v${o} data when expected v${F}.`);
-    const i = J[n & 15];
+    const i = Y[n & 15];
     if (!i)
       throw new Error("Unrecognized array type.");
     const [a] = new Uint16Array(t, 2, 1), [c] = new Uint32Array(t, 4, 1);
-    return new j(c, a, i, t);
+    return new G(c, a, i, t);
   }
   /**
    * Creates an index that will hold a given number of items.
@@ -132,7 +137,7 @@ class j {
   constructor(t, e = 64, n = Float64Array, o) {
     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 i = J.indexOf(this.ArrayType), a = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, c = t * this.IndexArrayType.BYTES_PER_ELEMENT, s = (8 - c % 8) % 8;
+    const i = 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 (i < 0)
       throw new Error(`Unexpected typed array class: ${n}.`);
     o && o instanceof ArrayBuffer ? (this.data = o, this.ids = new this.IndexArrayType(this.data, T, t), this.coords = new this.ArrayType(this.data, T + c + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(T + a + c + s), this.ids = new this.IndexArrayType(this.data, T, t), this.coords = new this.ArrayType(this.data, T + c + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (F << 4) + i]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t);
@@ -154,7 +159,7 @@ class j {
     const t = this._pos >> 1;
     if (t !== this.numItems)
       throw new Error(`Added ${t} items when expected ${this.numItems}.`);
-    return N(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.
@@ -166,20 +171,20 @@ class j {
    */
   range(t, e, n, o) {
     if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: i, coords: a, nodeSize: c } = this, s = [0, i.length - 1, 0], p = [];
+    const { ids: i, coords: a, nodeSize: c } = this, s = [0, i.length - 1, 0], h = [];
     for (; s.length; ) {
-      const h = s.pop() || 0, u = s.pop() || 0, f = s.pop() || 0;
+      const l = s.pop() || 0, u = s.pop() || 0, f = s.pop() || 0;
       if (u - f <= c) {
-        for (let m = f; m <= u; m++) {
-          const w = a[2 * m], M = a[2 * m + 1];
-          w >= t && w <= n && M >= e && M <= o && p.push(i[m]);
+        for (let p = f; p <= u; p++) {
+          const m = a[2 * p], M = a[2 * p + 1];
+          m >= t && m <= n && M >= e && M <= o && h.push(i[p]);
         }
         continue;
       }
-      const d = f + u >> 1, g = a[2 * d], l = a[2 * d + 1];
-      g >= t && g <= n && l >= e && l <= o && p.push(i[d]), (h === 0 ? t <= g : e <= l) && (s.push(f), s.push(d - 1), s.push(1 - h)), (h === 0 ? n >= g : o >= l) && (s.push(d + 1), s.push(u), s.push(1 - h));
+      const d = f + u >> 1, g = a[2 * d], y = a[2 * d + 1];
+      g >= t && g <= n && y >= e && y <= o && h.push(i[d]), (l === 0 ? t <= g : e <= y) && (s.push(f), s.push(d - 1), s.push(1 - l)), (l === 0 ? n >= g : o >= y) && (s.push(d + 1), s.push(u), s.push(1 - l));
     }
-    return p;
+    return h;
   }
   /**
    * Search the index for items within a given radius.
@@ -190,44 +195,44 @@ class j {
    */
   within(t, e, n) {
     if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
-    const { ids: o, coords: i, nodeSize: a } = this, c = [0, o.length - 1, 0], s = [], p = n * n;
+    const { ids: o, coords: i, nodeSize: a } = this, c = [0, o.length - 1, 0], s = [], h = n * n;
     for (; c.length; ) {
-      const h = c.pop() || 0, u = c.pop() || 0, f = c.pop() || 0;
+      const l = c.pop() || 0, u = c.pop() || 0, f = c.pop() || 0;
       if (u - f <= a) {
-        for (let m = f; m <= u; m++)
-          K(i[2 * m], i[2 * m + 1], t, e) <= p && s.push(o[m]);
+        for (let p = f; p <= u; p++)
+          K(i[2 * p], i[2 * p + 1], t, e) <= h && s.push(o[p]);
         continue;
       }
-      const d = f + u >> 1, g = i[2 * d], l = i[2 * d + 1];
-      K(g, l, t, e) <= p && s.push(o[d]), (h === 0 ? t - n <= g : e - n <= l) && (c.push(f), c.push(d - 1), c.push(1 - h)), (h === 0 ? t + n >= g : e + n >= l) && (c.push(d + 1), c.push(u), c.push(1 - h));
+      const d = f + u >> 1, g = i[2 * d], y = i[2 * d + 1];
+      K(g, y, t, e) <= h && s.push(o[d]), (l === 0 ? t - n <= g : e - n <= y) && (c.push(f), c.push(d - 1), c.push(1 - l)), (l === 0 ? t + n >= g : e + n >= y) && (c.push(d + 1), c.push(u), c.push(1 - l));
     }
     return s;
   }
 }
-function N(r, t, e, n, o, i) {
+function j(r, t, e, n, o, i) {
   if (o - n <= e) return;
   const a = n + o >> 1;
-  nt(r, t, a, n, o, i), N(r, t, e, n, a - 1, 1 - i), N(r, t, e, a + 1, o, 1 - i);
+  rt(r, t, a, n, o, i), j(r, t, e, n, a - 1, 1 - i), j(r, t, e, a + 1, o, 1 - i);
 }
-function nt(r, t, e, n, o, i) {
+function rt(r, t, e, n, o, i) {
   for (; o > n; ) {
     if (o - n > 600) {
-      const p = o - n + 1, h = e - n + 1, u = Math.log(p), f = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * f * (p - f) / p) * (h - p / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - h * f / p + d)), l = Math.min(o, Math.floor(e + (p - h) * f / p + d));
-      nt(r, t, e, g, l, i);
+      const h = o - n + 1, l = e - n + 1, u = Math.log(h), f = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * f * (h - f) / h) * (l - h / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - l * f / h + d)), y = Math.min(o, Math.floor(e + (h - l) * f / h + d));
+      rt(r, t, e, g, y, i);
     }
     const a = t[2 * e + i];
     let c = n, s = o;
-    for (S(r, t, n, e), t[2 * o + i] > a && S(r, t, n, o); c < s; ) {
-      for (S(r, t, c, s), c++, s--; t[2 * c + i] < a; ) c++;
+    for (b(r, t, n, e), t[2 * o + i] > a && b(r, t, n, o); c < s; ) {
+      for (b(r, t, c, s), c++, s--; t[2 * c + i] < a; ) c++;
       for (; t[2 * s + i] > a; ) s--;
     }
-    t[2 * n + i] === a ? S(r, t, n, s) : (s++, S(r, t, s, o)), s <= e && (n = s + 1), e <= s && (o = s - 1);
+    t[2 * n + i] === a ? b(r, t, n, s) : (s++, b(r, t, s, o)), s <= e && (n = s + 1), e <= s && (o = s - 1);
   }
 }
-function S(r, t, e, n) {
-  z(r, e, n), z(t, 2 * e, 2 * n), z(t, 2 * e + 1, 2 * n + 1);
+function b(r, t, e, n) {
+  B(r, e, n), B(t, 2 * e, 2 * n), B(t, 2 * e + 1, 2 * n + 1);
 }
-function z(r, t, e) {
+function B(r, t, e) {
   const n = r[t];
   r[t] = r[e], r[e] = n;
 }
@@ -235,7 +240,7 @@ function K(r, t, e, n) {
   const o = r - e, i = t - n;
   return o * o + i * i;
 }
-const Et = {
+const vt = {
   minZoom: 0,
   // min zoom to generate clusters on
   maxZoom: 16,
@@ -258,10 +263,10 @@ const Et = {
   // properties to use for individual points when running the reducer
   map: (r) => r
   // props => ({sum: props.my_value})
-}, q = Math.fround || /* @__PURE__ */ ((r) => (t) => (r[0] = +t, r[0]))(new Float32Array(1)), P = 2, x = 3, D = 4, A = 5, rt = 6;
-class Pt {
+}, q = Math.fround || /* @__PURE__ */ ((r) => (t) => (r[0] = +t, r[0]))(new Float32Array(1)), x = 2, A = 3, N = 4, P = 5, st = 6;
+class Ot {
   constructor(t) {
-    this.options = Object.assign(Object.create(Et), t), this.trees = new Array(this.options.maxZoom + 1), this.stride = this.options.reduce ? 7 : 6, this.clusterProps = [];
+    this.options = Object.assign(Object.create(vt), t), this.trees = new Array(this.options.maxZoom + 1), this.stride = this.options.reduce ? 7 : 6, this.clusterProps = [];
   }
   load(t) {
     const { log: e, minZoom: n, maxZoom: o } = this.options;
@@ -270,9 +275,9 @@ class Pt {
     e && console.time(i), this.points = t;
     const a = [];
     for (let s = 0; s < t.length; s++) {
-      const p = t[s];
-      if (!p.geometry) continue;
-      const [h, u] = p.geometry.coordinates, f = q(R(h)), d = q(Z(u));
+      const h = t[s];
+      if (!h.geometry) continue;
+      const [l, u] = h.geometry.coordinates, f = q(I(l)), d = q(U(u));
       a.push(
         f,
         d,
@@ -290,8 +295,8 @@ class Pt {
     let c = this.trees[o + 1] = this._createTree(a);
     e && console.timeEnd(i);
     for (let s = o; s >= n; s--) {
-      const p = +Date.now();
-      c = this.trees[s] = this._createTree(this._cluster(c, s)), e && console.log("z%d: %d clusters in %dms", s, c.numItems, +Date.now() - p);
+      const h = +Date.now();
+      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;
   }
@@ -306,22 +311,22 @@ class Pt {
       const u = this.getClusters([n, o, 180, a], e), f = this.getClusters([-180, o, i, a], e);
       return u.concat(f);
     }
-    const c = this.trees[this._limitZoom(e)], s = c.range(R(n), Z(a), R(i), Z(o)), p = c.data, h = [];
+    const c = this.trees[this._limitZoom(e)], s = c.range(I(n), U(a), I(i), U(o)), h = c.data, l = [];
     for (const u of s) {
       const f = this.stride * u;
-      h.push(p[f + A] > 1 ? Q(p, f, this.clusterProps) : this.points[p[f + x]]);
+      l.push(h[f + P] > 1 ? Q(h, f, this.clusterProps) : this.points[h[f + A]]);
     }
-    return h;
+    return l;
   }
   getChildren(t) {
     const e = this._getOriginId(t), n = this._getOriginZoom(t), o = "No cluster with the specified id.", i = this.trees[n];
     if (!i) throw new Error(o);
     const a = i.data;
     if (e * this.stride >= a.length) throw new Error(o);
-    const c = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], p = a[e * this.stride + 1], h = i.within(s, p, c), u = [];
-    for (const f of h) {
+    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 = i.within(s, h, c), u = [];
+    for (const f of l) {
       const d = f * this.stride;
-      a[d + D] === t && u.push(a[d + A] > 1 ? Q(a, d, this.clusterProps) : this.points[a[d + x]]);
+      a[d + N] === t && u.push(a[d + P] > 1 ? Q(a, d, this.clusterProps) : this.points[a[d + A]]);
     }
     if (u.length === 0) throw new Error(o);
     return u;
@@ -332,25 +337,25 @@ class Pt {
     return this._appendLeaves(o, t, e, n, 0), o;
   }
   getTile(t, e, n) {
-    const o = this.trees[this._limitZoom(t)], i = Math.pow(2, t), { extent: a, radius: c } = this.options, s = c / a, p = (n - s) / i, h = (n + 1 + s) / i, u = {
+    const o = this.trees[this._limitZoom(t)], i = Math.pow(2, t), { extent: a, radius: c } = this.options, s = c / a, h = (n - s) / i, l = (n + 1 + s) / i, u = {
       features: []
     };
     return this._addTileFeatures(
-      o.range((e - s) / i, p, (e + 1 + s) / i, h),
+      o.range((e - s) / i, h, (e + 1 + s) / i, l),
       o.data,
       e,
       n,
       i,
       u
     ), e === 0 && this._addTileFeatures(
-      o.range(1 - s / i, p, 1, h),
+      o.range(1 - s / i, h, 1, l),
       o.data,
       i,
       n,
       i,
       u
     ), e === i - 1 && this._addTileFeatures(
-      o.range(0, p, s / i, h),
+      o.range(0, h, s / i, l),
       o.data,
       -1,
       n,
@@ -376,21 +381,21 @@ class Pt {
     return i;
   }
   _createTree(t) {
-    const e = new j(t.length / this.stride | 0, this.options.nodeSize, Float32Array);
+    const e = new G(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, o, i, a) {
     for (const c of t) {
-      const s = c * this.stride, p = e[s + A] > 1;
-      let h, u, f;
-      if (p)
-        h = st(e, s, this.clusterProps), u = e[s], f = e[s + 1];
+      const s = c * this.stride, h = e[s + P] > 1;
+      let l, u, f;
+      if (h)
+        l = ot(e, s, this.clusterProps), u = e[s], f = e[s + 1];
       else {
-        const l = this.points[e[s + x]];
-        h = l.properties;
-        const [m, w] = l.geometry.coordinates;
-        u = R(m), f = Z(w);
+        const y = this.points[e[s + A]];
+        l = y.properties;
+        const [p, m] = y.geometry.coordinates;
+        u = I(p), f = U(m);
       }
       const d = {
         type: 1,
@@ -398,50 +403,50 @@ class Pt {
           Math.round(this.options.extent * (u * i - n)),
           Math.round(this.options.extent * (f * i - o))
         ]],
-        tags: h
+        tags: l
       };
       let g;
-      p || this.options.generateId ? g = e[s + x] : g = this.points[e[s + x]].id, g !== void 0 && (d.id = g), a.features.push(d);
+      h || this.options.generateId ? g = e[s + A] : g = this.points[e[s + A]].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: o, reduce: i, minPoints: a } = this.options, c = n / (o * Math.pow(2, e)), s = t.data, p = [], h = this.stride;
-    for (let u = 0; u < s.length; u += h) {
-      if (s[u + P] <= e) continue;
-      s[u + P] = e;
-      const f = s[u], d = s[u + 1], g = t.within(s[u], s[u + 1], c), l = s[u + A];
-      let m = l;
-      for (const w of g) {
-        const M = w * h;
-        s[M + P] > e && (m += s[M + A]);
+    const { radius: n, extent: o, reduce: i, minPoints: a } = this.options, c = n / (o * 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 f = s[u], d = s[u + 1], g = t.within(s[u], s[u + 1], c), y = s[u + P];
+      let p = y;
+      for (const m of g) {
+        const M = m * l;
+        s[M + x] > e && (p += s[M + P]);
       }
-      if (m > l && m >= a) {
-        let w = f * l, M = d * l, _, G = -1;
-        const B = ((u / h | 0) << 5) + (e + 1) + this.points.length;
-        for (const ot of g) {
-          const E = ot * h;
-          if (s[E + P] <= e) continue;
-          s[E + P] = e;
-          const $ = s[E + A];
-          w += s[E] * $, M += s[E + 1] * $, s[E + D] = B, i && (_ || (_ = this._map(s, u, !0), G = this.clusterProps.length, this.clusterProps.push(_)), i(_, this._map(s, E)));
+      if (p > y && p >= a) {
+        let m = f * y, M = d * y, _, $ = -1;
+        const Z = ((u / l | 0) << 5) + (e + 1) + this.points.length;
+        for (const it of g) {
+          const E = it * l;
+          if (s[E + x] <= e) continue;
+          s[E + x] = e;
+          const k = s[E + P];
+          m += s[E] * k, M += s[E + 1] * k, s[E + N] = Z, i && (_ || (_ = this._map(s, u, !0), $ = this.clusterProps.length, this.clusterProps.push(_)), i(_, this._map(s, E)));
         }
-        s[u + D] = B, p.push(w / m, M / m, 1 / 0, B, -1, m), i && p.push(G);
+        s[u + N] = Z, h.push(m / p, M / p, 1 / 0, Z, -1, p), i && h.push($);
       } else {
-        for (let w = 0; w < h; w++) p.push(s[u + w]);
-        if (m > 1)
-          for (const w of g) {
-            const M = w * h;
-            if (!(s[M + P] <= e)) {
-              s[M + P] = e;
-              for (let _ = 0; _ < h; _++) p.push(s[M + _]);
+        for (let m = 0; m < l; m++) h.push(s[u + m]);
+        if (p > 1)
+          for (const m of g) {
+            const M = m * l;
+            if (!(s[M + x] <= e)) {
+              s[M + x] = e;
+              for (let _ = 0; _ < l; _++) h.push(s[M + _]);
             }
           }
       }
     }
-    return p;
+    return h;
   }
   // get index of the point from which the cluster originated
   _getOriginId(t) {
@@ -452,50 +457,50 @@ class Pt {
     return (t - this.points.length) % 32;
   }
   _map(t, e, n) {
-    if (t[e + A] > 1) {
-      const a = this.clusterProps[t[e + rt]];
+    if (t[e + P] > 1) {
+      const a = this.clusterProps[t[e + st]];
       return n ? Object.assign({}, a) : a;
     }
-    const o = this.points[t[e + x]].properties, i = this.options.map(o);
+    const o = this.points[t[e + A]].properties, i = this.options.map(o);
     return n && i === o ? Object.assign({}, i) : i;
   }
 }
 function Q(r, t, e) {
   return {
     type: "Feature",
-    id: r[t + x],
-    properties: st(r, t, e),
+    id: r[t + A],
+    properties: ot(r, t, e),
     geometry: {
       type: "Point",
-      coordinates: [vt(r[t]), Ot(r[t + 1])]
+      coordinates: [St(r[t]), Tt(r[t + 1])]
     }
   };
 }
-function st(r, t, e) {
-  const n = r[t + A], o = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, i = r[t + rt], a = i === -1 ? {} : Object.assign({}, e[i]);
+function ot(r, t, e) {
+  const n = r[t + P], o = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, i = r[t + st], a = i === -1 ? {} : Object.assign({}, e[i]);
   return Object.assign(a, {
     cluster: !0,
-    cluster_id: r[t + x],
+    cluster_id: r[t + A],
     point_count: n,
     point_count_abbreviated: o
   });
 }
-function R(r) {
+function I(r) {
   return r / 360 + 0.5;
 }
-function Z(r) {
+function U(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 vt(r) {
+function St(r) {
   return (r - 0.5) * 360;
 }
-function Ot(r) {
+function Tt(r) {
   const t = (180 - r * 360) * Math.PI / 180;
   return 360 * Math.atan(Math.exp(t)) / Math.PI - 90;
 }
-var W = Object.prototype.hasOwnProperty;
-function X(r, t, e) {
+var X = Object.prototype.hasOwnProperty;
+function tt(r, t, e) {
   for (e of r.keys())
     if (v(e, t)) return e;
 }
@@ -514,14 +519,14 @@ function v(r, t) {
       if (r.size !== t.size)
         return !1;
       for (n of r)
-        if (o = n, o && typeof o == "object" && (o = X(t, o), !o) || !t.has(o)) return !1;
+        if (o = n, o && typeof o == "object" && (o = tt(t, o), !o) || !t.has(o)) return !1;
       return !0;
     }
     if (e === Map) {
       if (r.size !== t.size)
         return !1;
       for (n of r)
-        if (o = n[0], o && typeof o == "object" && (o = X(t, o), !o) || !v(n[1], t.get(o)))
+        if (o = n[0], o && typeof o == "object" && (o = tt(t, o), !o) || !v(n[1], t.get(o)))
           return !1;
       return !0;
     }
@@ -540,99 +545,110 @@ function v(r, t) {
     if (!e || typeof r == "object") {
       n = 0;
       for (e in r)
-        if (W.call(r, e) && ++n && !W.call(t, e) || !(e in t) || !v(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 bt(r) {
-  var t = U.useRef(r), e = U.useRef(0);
-  return v(r, t.current) || (t.current = r, e.current += 1), U.useMemo(function() {
+  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 Tt(r, t) {
-  return U.useEffect(r, bt(t));
+function Ct(r, t) {
+  return D.useEffect(r, bt(t));
 }
-var St = function(t) {
-  var e = t.points, n = t.bounds, o = t.zoom, i = t.options, a = t.disableRefresh, c = k(), s = k(), p = L([]), h = p[0], u = p[1], f = Math.round(o);
-  return Tt(function() {
-    a !== !0 && ((!c.current || !v(s.current, e) || !v(c.current.options, i)) && (c.current = new Pt(i), c.current.load(e)), n && u(c.current.getClusters(n, f)), s.current = e);
+var Lt = function(t) {
+  var e = t.points, n = t.bounds, o = t.zoom, i = t.options, a = t.disableRefresh, c = z(), s = z(), h = L([]), l = h[0], u = h[1], f = Math.round(o);
+  return Ct(function() {
+    a !== !0 && ((!c.current || !v(s.current, e) || !v(c.current.options, i)) && (c.current = new Ot(i), c.current.load(e)), n && u(c.current.getClusters(n, f)), s.current = e);
   }, [e, n, f, i, a]), {
-    clusters: h,
+    clusters: l,
     supercluster: c.current
   };
 };
-const Ct = y(() => import("./index-BrxP9NHZ.js")), Lt = y(() => import("./index-ufLC1PLO.js")), It = y(() => import("./index-B85VZGVP.js"));
-function Rt({ markers: r, onClick: t, ...e }) {
-  const { mapProvider: n, activeMarker: o, center: i, bounds: a, zoom: c, setMarkerPoints: s } = I();
-  ct(() => {
-    let l = [[i.latitude, i.longitude]];
-    r.length > 0 && (l = l.concat(
-      r.map((m) => [m.latitude, m.longitude])
-    )), s(l);
+const Rt = w(() => import("./index-Buv9_Jj9.js")), It = w(() => import("./index-DbyYOXrb.js")), Ut = w(() => import("./index-DOkeQ2e4.js"));
+function Dt({ markers: r, onClick: t, ...e }) {
+  const { mapProvider: n, activeMarker: o, center: i, zoom: a, setMarkerPoints: c, setClusterPoints: s } = R();
+  H(() => {
+    let p = [[i.longitude, i.latitude]];
+    r.length > 0 && (p = p.concat(
+      r.map((m) => [m.longitude, m.latitude])
+    )), c(p);
   }, [r, i]);
-  const p = b(
+  const h = S(
     () => ({
-      points: r.map((l) => xt([l.longitude, l.latitude], l)),
-      bounds: a,
-      zoom: c,
+      points: r.map((p) => xt([p.longitude, p.latitude], p)),
+      // Using world bounds to avoid issues with markers near the edges of the map
+      bounds: ft,
+      zoom: a,
       options: {
-        radius: n.name === "google" && c > H ? ht : pt,
-        minZoom: H,
-        maxZoom: ut
+        radius: n.name === "google" && a > J ? lt : ht,
+        minZoom: J,
+        maxZoom: pt
       }
     }),
-    [r, n, a, c]
-  ), { clusters: h, supercluster: u } = St(p), f = (l) => {
-    if (!("properties" in l))
+    [r, n, a]
+  ), { clusters: l, supercluster: u } = Lt(h), f = z("");
+  H(() => {
+    const p = JSON.stringify(
+      l.map((m) => ({
+        coords: m.geometry.coordinates,
+        props: m.properties
+      }))
+    );
+    p !== f.current && (s(l), f.current = p);
+  }, [l, s]);
+  const d = (p) => {
+    if (!("properties" in p))
       throw new Error("Cluster does not have properties");
-    if (l.properties?.cluster && typeof l.properties?.cluster_id == "number") {
+    if (p.properties?.cluster && typeof p.properties?.cluster_id == "number") {
       t?.({
-        id: `${l.properties.cluster_id}`,
-        latitude: l.geometry.coordinates[1],
-        longitude: l.geometry.coordinates[0],
-        markers: u?.getLeaves(l.properties.cluster_id)?.map((m) => m.properties) ?? []
+        id: `${p.properties.cluster_id}`,
+        latitude: p.geometry.coordinates[1],
+        longitude: p.geometry.coordinates[0],
+        markers: u?.getLeaves(p.properties.cluster_id)?.map((m) => m.properties) ?? []
       });
       return;
     }
     t?.({
-      id: l.properties.id,
-      latitude: l.properties.latitude,
-      longitude: l.properties.longitude,
-      markers: [l.properties]
+      id: p.properties.id,
+      latitude: p.properties.latitude,
+      longitude: p.properties.longitude,
+      markers: [p.properties]
     });
-  }, d = (l) => !u || !o ? !1 : o.id === `${l}` ? !0 : u.getLeaves(l)?.find((m) => m.properties.id === o.id) !== void 0, g = b(() => {
+  }, g = (p) => !u || !o ? !1 : o.id === `${p}` ? !0 : u.getLeaves(p)?.find((m) => m.properties.id === o.id) !== void 0, y = S(() => {
     switch (n?.name) {
       case "maptiler":
-        return Ct;
+        return Rt;
       case "google":
-        return Lt;
-      case "mapbox":
         return It;
+      case "mapbox":
+        return Ut;
       default:
         return null;
     }
   }, [n]);
-  return g ? /* @__PURE__ */ O(
-    g,
+  return y ? /* @__PURE__ */ O(
+    y,
     {
-      clusters: h,
-      onClick: f,
-      doesSuperclusterContainActiveMarker: d,
+      clusters: l,
+      onClick: d,
+      doesSuperclusterContainActiveMarker: g,
       ...e
     }
   ) : null;
 }
-const Zt = y(() => import("./index-CRdDPWou.js")), Ut = y(() => import("./index-D5kHxP9H.js")), Bt = y(() => import("./index-Db33Ugg9.js"));
-function Ft({ children: r, anchor: t = "bottom", ...e }) {
-  const { mapProvider: n } = I(), o = b(() => {
+const Zt = w(() => import("./index-CCS3Ef2w.js")), Ft = w(() => import("./index-C6a0FCIX.js")), Bt = w(() => import("./index-Y5T20C1G.js"));
+function Nt({ children: r, anchor: t = "bottom", ...e }) {
+  const { mapProvider: n } = R(), o = S(() => {
     switch (n?.name) {
       case "maptiler":
         return Zt;
       case "google":
-        return Ut;
+        return Ft;
       case "mapbox":
         return Bt;
       default:
@@ -641,46 +657,58 @@ function Ft({ children: r, anchor: t = "bottom", ...e }) {
   }, [n]);
   return o ? /* @__PURE__ */ O(o, { ...e, anchor: t, children: r }) : null;
 }
-const zt = y(() => import("./index-DfhwDiOS.js")), Dt = y(() => import("./index-CSVsF1EQ.js")), Nt = y(() => import("./index-BRD3rjLE.js"));
-function jt(r) {
-  const { mapProvider: t } = I(), e = b(() => {
+const zt = w(() => import("./index-GGtrKiJn.js")), jt = w(() => import("./index-CEDpofgZ.js")), Gt = w(() => import("./index-CIE9YlvM.js"));
+function $t(r) {
+  const { mapProvider: t } = R(), e = S(() => {
     switch (t?.name) {
       case "maptiler":
         return zt;
       case "google":
-        return Dt;
+        return jt;
       case "mapbox":
-        return Nt;
+        return Gt;
       default:
         return null;
     }
   }, [t]);
   return e ? /* @__PURE__ */ O(e, { ...r }) : null;
 }
-function Gt(r) {
-  const [t, e] = L([]), [n, o] = L(r.zoom || C.zoom), [i, a] = L();
+function kt(r) {
+  const [t, e] = L([]), [n, o] = L([]), [i, a] = L(r.zoom || C.zoom);
   return /* @__PURE__ */ O(
-    tt.Provider,
+    et.Provider,
     {
-      value: { ...r, markerPoints: t, setMarkerPoints: e, bounds: i, setBounds: a, zoom: n, setZoom: o },
+      value: {
+        ...r,
+        mapPadding: r.mapPadding || ut,
+        markerPoints: t,
+        setMarkerPoints: e,
+        clusterPoints: n,
+        setClusterPoints: o,
+        zoom: i,
+        setZoom: a
+      },
       children: r.children
     }
   );
 }
-const Yt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Kt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BaseMap: yt,
-  CenterPin: At,
-  Layers: jt,
-  Markers: Rt,
-  Popup: Ft,
-  Root: Gt
+  BaseMap: Mt,
+  CenterPin: Et,
+  Layers: $t,
+  Markers: Dt,
+  Popup: Nt,
+  Root: kt
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  Vt as M,
+  C as D,
+  Jt as M,
+  Wt as P,
+  ft as W,
   V as a,
-  C as d,
-  Yt as i,
-  Ht as m,
-  I as u
+  ut as b,
+  Kt as i,
+  Yt as m,
+  R as u
 };