@local-logic/maps 0.1.5 → 0.1.6

package/dist/{index-Bbgg2AcG.js → index-eyFsWhYO.js}

@@ -1,7 +1,7 @@
 import { jsx as _ } from "react/jsx-runtime";
 import * as Z from "react";
-import ut, { useContext as lt, useState as L, useMemo as v, lazy as w, Suspense as R, useRef as j, useEffect as V } from "react";
-const rt = ut.createContext({}), I = () => lt(rt), C = {
+import ut, { useContext as lt, useState as b, useMemo as O, lazy as w, Suspense as R, useEffect as z, useRef as j } from "react";
+const rt = ut.createContext({}), I = () => lt(rt), L = {
   zoom: 14,
   pitch: 0,
   bearing: 0,
@@ -11,21 +11,21 @@ const rt = ut.createContext({}), I = () => lt(rt), C = {
   mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
   google: "a7ff20eb973126bb",
   testing: "testing"
-}, pt = {
+}, ht = {
   top: 10,
   bottom: 10,
   left: 10,
   right: 10
-}, W = 10, ht = 22, Qt = 10, ft = 30, dt = 60, Xt = 15, mt = [-180, -85.0511, 180, 85.0511], gt = "w-full h-full relative overflow-hidden", yt = w(() => import("./index-Caot5InX.js")), wt = w(() => import("./index-wmShBScF.js")), Mt = w(() => import("./index-BP_m_WyV.js")), Y = w(() => import("./index-Bx7faHOu.js")), _t = ({ children: r }) => {
+}, W = 10, pt = 22, Qt = 10, ft = 30, dt = 60, Xt = 15, mt = [-180, -85.0511, 180, 85.0511], gt = "w-full h-full relative overflow-hidden", yt = w(() => import("./index-BqhW6lBz.js")), wt = w(() => import("./index-B2t_G7DM.js")), Mt = w(() => import("./index-B13R2TUm.js")), Y = w(() => import("./index-Oeg9DKq8.js")), _t = ({ children: r }) => {
   const {
     mapProvider: t,
     center: e,
-    zoom: n = C.zoom,
-    pitch: i = C.pitch,
-    bearing: o = C.bearing,
-    cooperativeGestures: a = C.cooperativeGestures,
+    zoom: n = L.zoom,
+    pitch: i = L.pitch,
+    bearing: o = L.bearing,
+    cooperativeGestures: a = L.cooperativeGestures,
     zoomPosition: c
-  } = I(), [s] = L(n), l = v(() => {
+  } = I(), [s] = b(n), l = O(() => {
     switch (t?.name) {
       case "maptiler":
         return yt;
@@ -58,7 +58,14 @@ const rt = ut.createContext({}), I = () => lt(rt), C = {
   );
 }, Pt = w(() => import("./index-C3Tj3r2u.js")), At = w(() => import("./index-CUUravWc.js")), Et = w(() => import("./index-eWv3le07.js")), xt = w(() => import("./index-BO34uKgS.js"));
 function Tt(r) {
-  const { mapProvider: t } = I(), e = v(() => {
+  const { mapProvider: t, setCenterPinMarkerPoints: e } = I();
+  z(() => {
+    if (r?.marker)
+      return e([r.marker.longitude, r.marker.latitude]), () => {
+        e(void 0);
+      };
+  }, [r?.marker?.longitude, r?.marker?.latitude, e]);
+  const n = O(() => {
     switch (t?.name) {
       case "maptiler":
         return Pt;
@@ -72,13 +79,13 @@ function Tt(r) {
         return null;
     }
   }, [t]);
-  return e ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(e, { ...r }) }) : null;
+  return n ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(n, { ...r }) }) : null;
 }
 function st(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 bt(r, t, e = {}) {
+function vt(r, t, e = {}) {
   if (!r)
     throw new Error("coordinates is required");
   if (!Array.isArray(r))
@@ -111,8 +118,8 @@ const q = [
   Uint32Array,
   Float32Array,
   Float64Array
-], F = 1, O = 8;
-class G {
+], F = 1, S = 8;
+class $ {
   /**
    * Creates an index from raw `ArrayBuffer` data.
    * @param {ArrayBuffer} data
@@ -130,7 +137,7 @@ class G {
     if (!o)
       throw new Error("Unrecognized array type.");
     const [a] = new Uint16Array(t, 2, 1), [c] = new Uint32Array(t, 4, 1);
-    return new G(c, a, o, t);
+    return new $(c, a, o, t);
   }
   /**
    * Creates an index that will hold a given number of items.
@@ -145,7 +152,7 @@ class G {
     const o = q.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, O, t), this.coords = new this.ArrayType(this.data, O + c + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(O + a + c + s), this.ids = new this.IndexArrayType(this.data, O, t), this.coords = new this.ArrayType(this.data, O + c + 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, S, t), this.coords = new this.ArrayType(this.data, S + c + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(S + a + c + s), this.ids = new this.IndexArrayType(this.data, S, t), this.coords = new this.ArrayType(this.data, S + c + 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);
   }
   /**
    * Add a point to the index.
@@ -164,7 +171,7 @@ class G {
     const t = this._pos >> 1;
     if (t !== this.numItems)
       throw new Error(`Added ${t} items when expected ${this.numItems}.`);
-    return k(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0), this._finished = !0, this;
+    return G(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.
@@ -178,16 +185,16 @@ class G {
     if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
     const { ids: o, coords: a, nodeSize: c } = this, s = [0, o.length - 1, 0], l = [];
     for (; s.length; ) {
-      const h = s.pop() || 0, u = s.pop() || 0, f = s.pop() || 0;
+      const p = s.pop() || 0, u = s.pop() || 0, f = s.pop() || 0;
       if (u - f <= c) {
-        for (let p = f; p <= u; p++) {
-          const m = a[2 * p], M = a[2 * p + 1];
-          m >= t && m <= n && M >= e && M <= i && l.push(o[p]);
+        for (let h = f; h <= u; h++) {
+          const m = a[2 * h], M = a[2 * h + 1];
+          m >= t && m <= n && M >= e && M <= i && l.push(o[h]);
         }
         continue;
       }
       const d = f + u >> 1, g = a[2 * d], y = a[2 * d + 1];
-      g >= t && g <= n && y >= e && y <= i && l.push(o[d]), (h === 0 ? t <= g : e <= y) && (s.push(f), s.push(d - 1), s.push(1 - h)), (h === 0 ? n >= g : i >= y) && (s.push(d + 1), s.push(u), s.push(1 - h));
+      g >= t && g <= n && y >= e && y <= i && l.push(o[d]), (p === 0 ? t <= g : e <= y) && (s.push(f), s.push(d - 1), s.push(1 - p)), (p === 0 ? n >= g : i >= y) && (s.push(d + 1), s.push(u), s.push(1 - p));
     }
     return l;
   }
@@ -202,42 +209,42 @@ class G {
     if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
     const { ids: i, coords: o, nodeSize: a } = this, c = [0, i.length - 1, 0], s = [], l = n * n;
     for (; c.length; ) {
-      const h = c.pop() || 0, u = c.pop() || 0, f = c.pop() || 0;
+      const p = c.pop() || 0, u = c.pop() || 0, f = c.pop() || 0;
       if (u - f <= a) {
-        for (let p = f; p <= u; p++)
-          Q(o[2 * p], o[2 * p + 1], t, e) <= l && s.push(i[p]);
+        for (let h = f; h <= u; h++)
+          Q(o[2 * h], o[2 * h + 1], t, e) <= l && s.push(i[h]);
         continue;
       }
       const d = f + u >> 1, g = o[2 * d], y = o[2 * d + 1];
-      Q(g, y, t, e) <= l && s.push(i[d]), (h === 0 ? t - n <= g : e - n <= y) && (c.push(f), c.push(d - 1), c.push(1 - h)), (h === 0 ? t + n >= g : e + n >= y) && (c.push(d + 1), c.push(u), c.push(1 - h));
+      Q(g, y, t, e) <= l && s.push(i[d]), (p === 0 ? t - n <= g : e - n <= y) && (c.push(f), c.push(d - 1), c.push(1 - p)), (p === 0 ? t + n >= g : e + n >= y) && (c.push(d + 1), c.push(u), c.push(1 - p));
     }
     return s;
   }
 }
-function k(r, t, e, n, i, o) {
+function G(r, t, e, n, i, o) {
   if (i - n <= e) return;
   const a = n + i >> 1;
-  it(r, t, a, n, i, o), k(r, t, e, n, a - 1, 1 - o), k(r, t, e, a + 1, i, 1 - o);
+  it(r, t, a, n, i, o), G(r, t, e, n, a - 1, 1 - o), G(r, t, e, a + 1, i, 1 - o);
 }
 function it(r, t, e, n, i, o) {
   for (; i > n; ) {
     if (i - n > 600) {
-      const l = i - n + 1, h = e - n + 1, u = Math.log(l), f = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * f * (l - f) / l) * (h - l / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - h * f / l + d)), y = Math.min(i, Math.floor(e + (l - h) * f / l + d));
+      const l = i - n + 1, p = e - n + 1, u = Math.log(l), f = 0.5 * Math.exp(2 * u / 3), d = 0.5 * Math.sqrt(u * f * (l - f) / l) * (p - l / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - p * f / l + d)), y = Math.min(i, Math.floor(e + (l - p) * f / l + d));
       it(r, t, e, g, y, o);
     }
     const a = t[2 * e + o];
     let c = n, s = i;
-    for (S(r, t, n, e), t[2 * i + o] > a && S(r, t, n, i); c < s; ) {
-      for (S(r, t, c, s), c++, s--; t[2 * c + o] < a; ) c++;
+    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 ? S(r, t, n, s) : (s++, S(r, t, s, i)), s <= e && (n = s + 1), e <= s && (i = s - 1);
+    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);
   }
 }
-function S(r, t, e, n) {
-  N(r, e, n), N(t, 2 * e, 2 * n), N(t, 2 * e + 1, 2 * n + 1);
+function C(r, t, e, n) {
+  k(r, e, n), k(t, 2 * e, 2 * n), k(t, 2 * e + 1, 2 * n + 1);
 }
-function N(r, t, e) {
+function k(r, t, e) {
   const n = r[t];
   r[t] = r[e], r[e] = n;
 }
@@ -245,7 +252,7 @@ function Q(r, t, e, n) {
   const i = r - e, o = t - n;
   return i * i + o * o;
 }
-const vt = {
+const bt = {
   minZoom: 0,
   // min zoom to generate clusters on
   maxZoom: 16,
@@ -268,10 +275,10 @@ const vt = {
   // properties to use for individual points when running the reducer
   map: (r) => r
   // props => ({sum: props.my_value})
-}, X = Math.fround || /* @__PURE__ */ ((r) => ((t) => (r[0] = +t, r[0])))(new Float32Array(1)), T = 2, E = 3, z = 4, A = 5, ot = 6;
+}, X = Math.fround || /* @__PURE__ */ ((r) => ((t) => (r[0] = +t, r[0])))(new Float32Array(1)), T = 2, E = 3, N = 4, A = 5, ot = 6;
 class Ot {
   constructor(t) {
-    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 = [];
+    this.options = Object.assign(Object.create(bt), 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: i } = this.options;
@@ -282,7 +289,7 @@ class Ot {
     for (let s = 0; s < t.length; s++) {
       const l = t[s];
       if (!l.geometry) continue;
-      const [h, u] = l.geometry.coordinates, f = X(U(h)), d = X(D(u));
+      const [p, u] = l.geometry.coordinates, f = X(U(p)), d = X(D(u));
       a.push(
         f,
         d,
@@ -316,22 +323,22 @@ class Ot {
       const u = this.getClusters([n, i, 180, a], e), f = this.getClusters([-180, i, o, a], e);
       return u.concat(f);
     }
-    const c = this.trees[this._limitZoom(e)], s = c.range(U(n), D(a), U(o), D(i)), l = c.data, h = [];
+    const c = this.trees[this._limitZoom(e)], s = c.range(U(n), D(a), U(o), D(i)), l = c.data, p = [];
     for (const u of s) {
       const f = this.stride * u;
-      h.push(l[f + A] > 1 ? tt(l, f, this.clusterProps) : this.points[l[f + E]]);
+      p.push(l[f + A] > 1 ? tt(l, f, this.clusterProps) : this.points[l[f + E]]);
     }
-    return h;
+    return p;
   }
   getChildren(t) {
     const e = this._getOriginId(t), n = this._getOriginZoom(t), i = "No cluster with the specified id.", o = this.trees[n];
     if (!o) throw new Error(i);
     const a = o.data;
     if (e * this.stride >= a.length) throw new Error(i);
-    const c = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], l = a[e * this.stride + 1], h = o.within(s, l, 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], l = a[e * this.stride + 1], p = o.within(s, l, c), u = [];
+    for (const f of p) {
       const d = f * this.stride;
-      a[d + z] === t && u.push(a[d + A] > 1 ? tt(a, d, this.clusterProps) : this.points[a[d + E]]);
+      a[d + N] === t && u.push(a[d + A] > 1 ? tt(a, d, this.clusterProps) : this.points[a[d + E]]);
     }
     if (u.length === 0) throw new Error(i);
     return u;
@@ -342,25 +349,25 @@ class Ot {
     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: c } = this.options, s = c / a, l = (n - s) / o, h = (n + 1 + s) / o, u = {
+    const i = this.trees[this._limitZoom(t)], o = Math.pow(2, t), { extent: a, radius: c } = this.options, s = c / a, l = (n - s) / o, p = (n + 1 + s) / o, u = {
       features: []
     };
     return this._addTileFeatures(
-      i.range((e - s) / o, l, (e + 1 + s) / o, h),
+      i.range((e - s) / o, l, (e + 1 + s) / o, p),
       i.data,
       e,
       n,
       o,
       u
     ), e === 0 && this._addTileFeatures(
-      i.range(1 - s / o, l, 1, h),
+      i.range(1 - s / o, l, 1, p),
       i.data,
       o,
       n,
       o,
       u
     ), e === o - 1 && this._addTileFeatures(
-      i.range(0, l, s / o, h),
+      i.range(0, l, s / o, p),
       i.data,
       -1,
       n,
@@ -386,21 +393,21 @@ class Ot {
     return o;
   }
   _createTree(t) {
-    const e = new G(t.length / this.stride | 0, this.options.nodeSize, Float32Array);
+    const e = new $(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 c of t) {
       const s = c * this.stride, l = e[s + A] > 1;
-      let h, u, f;
+      let p, u, f;
       if (l)
-        h = at(e, s, this.clusterProps), u = e[s], f = e[s + 1];
+        p = at(e, s, this.clusterProps), u = e[s], f = e[s + 1];
       else {
         const y = this.points[e[s + E]];
-        h = y.properties;
-        const [p, m] = y.geometry.coordinates;
-        u = U(p), f = D(m);
+        p = y.properties;
+        const [h, m] = y.geometry.coordinates;
+        u = U(h), f = D(m);
       }
       const d = {
         type: 1,
@@ -408,7 +415,7 @@ class Ot {
           Math.round(this.options.extent * (u * o - n)),
           Math.round(this.options.extent * (f * o - i))
         ]],
-        tags: h
+        tags: p
       };
       let g;
       l || this.options.generateId ? g = e[s + E] : g = this.points[e[s + E]].id, g !== void 0 && (d.id = g), a.features.push(d);
@@ -418,35 +425,35 @@ class Ot {
     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, c = n / (i * Math.pow(2, e)), s = t.data, l = [], h = this.stride;
-    for (let u = 0; u < s.length; u += h) {
+    const { radius: n, extent: i, reduce: o, minPoints: a } = this.options, c = n / (i * Math.pow(2, e)), s = t.data, l = [], p = this.stride;
+    for (let u = 0; u < s.length; u += p) {
       if (s[u + T] <= e) continue;
       s[u + T] = e;
       const f = s[u], d = s[u + 1], g = t.within(s[u], s[u + 1], c), y = s[u + A];
-      let p = y;
+      let h = y;
       for (const m of g) {
-        const M = m * h;
-        s[M + T] > e && (p += s[M + A]);
+        const M = m * p;
+        s[M + T] > e && (h += s[M + A]);
       }
-      if (p > y && p >= a) {
-        let m = f * y, M = d * y, P, $ = -1;
-        const B = ((u / h | 0) << 5) + (e + 1) + this.points.length;
+      if (h > y && h >= a) {
+        let m = f * y, M = d * y, P, H = -1;
+        const B = ((u / p | 0) << 5) + (e + 1) + this.points.length;
         for (const ct of g) {
-          const x = ct * h;
+          const x = ct * p;
           if (s[x + T] <= e) continue;
           s[x + T] = e;
-          const H = s[x + A];
-          m += s[x] * H, M += s[x + 1] * H, s[x + z] = B, o && (P || (P = this._map(s, u, !0), $ = this.clusterProps.length, this.clusterProps.push(P)), o(P, this._map(s, x)));
+          const V = s[x + A];
+          m += s[x] * V, M += s[x + 1] * V, s[x + N] = B, o && (P || (P = this._map(s, u, !0), H = this.clusterProps.length, this.clusterProps.push(P)), o(P, this._map(s, x)));
         }
-        s[u + z] = B, l.push(m / p, M / p, 1 / 0, B, -1, p), o && l.push($);
+        s[u + N] = B, l.push(m / h, M / h, 1 / 0, B, -1, h), o && l.push(H);
       } else {
-        for (let m = 0; m < h; m++) l.push(s[u + m]);
-        if (p > 1)
+        for (let m = 0; m < p; m++) l.push(s[u + m]);
+        if (h > 1)
           for (const m of g) {
-            const M = m * h;
+            const M = m * p;
             if (!(s[M + T] <= e)) {
               s[M + T] = e;
-              for (let P = 0; P < h; P++) l.push(s[M + P]);
+              for (let P = 0; P < p; P++) l.push(s[M + P]);
             }
           }
       }
@@ -507,9 +514,9 @@ function Ct(r) {
 var et = Object.prototype.hasOwnProperty;
 function nt(r, t, e) {
   for (e of r.keys())
-    if (b(e, t)) return e;
+    if (v(e, t)) return e;
 }
-function b(r, t) {
+function v(r, t) {
   var e, n, i;
   if (r === t) return !0;
   if (r && t && (e = r.constructor) === t.constructor) {
@@ -517,7 +524,7 @@ function b(r, t) {
     if (e === RegExp) return r.toString() === t.toString();
     if (e === Array) {
       if ((n = r.length) === t.length)
-        for (; n-- && b(r[n], t[n]); ) ;
+        for (; n-- && v(r[n], t[n]); ) ;
       return n === -1;
     }
     if (e === Set) {
@@ -531,7 +538,7 @@ function b(r, t) {
       if (r.size !== t.size)
         return !1;
       for (n of r)
-        if (i = n[0], i && typeof i == "object" && (i = nt(t, i), !i) || !b(n[1], t.get(i)))
+        if (i = n[0], i && typeof i == "object" && (i = nt(t, i), !i) || !v(n[1], t.get(i)))
           return !1;
       return !0;
     }
@@ -550,7 +557,7 @@ function b(r, t) {
     if (!e || typeof r == "object") {
       n = 0;
       for (e in r)
-        if (et.call(r, e) && ++n && !et.call(t, e) || !(e in t) || !b(r[e], t[e])) return !1;
+        if (et.call(r, e) && ++n && !et.call(t, e) || !(e in t) || !v(r[e], t[e])) return !1;
       return Object.keys(t).length === n;
     }
   }
@@ -558,7 +565,7 @@ function b(r, t) {
 }
 function Lt(r) {
   var t = Z.useRef(r), e = Z.useRef(0);
-  return b(r, t.current) || (t.current = r, e.current += 1), Z.useMemo(function() {
+  return v(r, t.current) || (t.current = r, e.current += 1), Z.useMemo(function() {
     return t.current;
   }, [e.current]);
 }
@@ -566,74 +573,74 @@ function Rt(r, t) {
   return Z.useEffect(r, Lt(t));
 }
 var It = function(t) {
-  var e = t.points, n = t.bounds, i = t.zoom, o = t.options, a = t.disableRefresh, c = j(), s = j(), l = L([]), h = l[0], u = l[1], f = Math.round(i);
+  var e = t.points, n = t.bounds, i = t.zoom, o = t.options, a = t.disableRefresh, c = j(), s = j(), l = b([]), p = l[0], u = l[1], f = Math.round(i);
   return Rt(function() {
-    a !== !0 && ((!c.current || !b(s.current, e) || !b(c.current.options, o)) && (c.current = new Ot(o), c.current.load(e)), n && u(c.current.getClusters(n, f)), s.current = e);
+    a !== !0 && ((!c.current || !v(s.current, e) || !v(c.current.options, o)) && (c.current = new Ot(o), c.current.load(e)), n && u(c.current.getClusters(n, f)), s.current = e);
   }, [e, n, f, o, a]), {
-    clusters: h,
+    clusters: p,
     supercluster: c.current
   };
 };
-const Ut = w(() => import("./index-DBgzG__6.js")), Dt = w(() => import("./index-DsyoZEsZ.js")), Zt = w(() => import("./index-aSBXZLeP.js")), Bt = w(() => import("./index-DEFuc-6u.js"));
+const Ut = w(() => import("./index-BpXydeNl.js")), Dt = w(() => import("./index-qum6AMNP.js")), Zt = w(() => import("./index-BTgWiuFg.js")), Bt = w(() => import("./index-DEFuc-6u.js"));
 function Ft({ isLoading: r, markers: t, onClick: e, ...n }) {
   const { mapProvider: i, activeMarker: o, zoom: a, setMarkerPoints: c, setClusterPoints: s } = I();
-  V(() => {
+  z(() => {
     if (r)
       return;
-    const p = (t || []).map((m) => [m.longitude, m.latitude]);
-    c(p);
+    const h = (t || []).map((m) => [m.longitude, m.latitude]);
+    c(h);
   }, [t, c]);
-  const l = v(
+  const l = O(
     () => ({
-      points: t.map((p) => bt([p.longitude, p.latitude], p)),
+      points: t.map((h) => vt([h.longitude, h.latitude], h)),
       // Using world bounds to avoid issues with markers near the edges of the map
       bounds: mt,
       zoom: a,
       options: {
         radius: i.name === "google" && a > W ? dt : ft,
         minZoom: W,
-        maxZoom: ht
+        maxZoom: pt
       }
     }),
     [t, i, a]
-  ), { clusters: h, supercluster: u } = It(l), f = j("");
-  V(() => {
-    const p = JSON.stringify(
-      h.map((m) => ({
+  ), { clusters: p, supercluster: u } = It(l), f = j("");
+  z(() => {
+    const h = JSON.stringify(
+      p.map((m) => ({
         coords: m.geometry.coordinates,
         props: m.properties
       }))
     );
-    p !== f.current && (s(h), f.current = p);
-  }, [h, s]);
-  const d = (p) => {
-    if (!("properties" in p))
+    h !== f.current && (s(p), f.current = h);
+  }, [p, s]);
+  const d = (h) => {
+    if (!("properties" in h))
       throw new Error("Cluster does not have properties");
-    if (p.properties?.cluster && typeof p.properties?.cluster_id == "number") {
+    if (h.properties?.cluster && typeof h.properties?.cluster_id == "number") {
       e?.({
-        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) ?? []
+        id: `${h.properties.cluster_id}`,
+        latitude: h.geometry.coordinates[1],
+        longitude: h.geometry.coordinates[0],
+        markers: u?.getLeaves(h.properties.cluster_id)?.map((m) => m.properties) ?? []
       });
       return;
     }
     e?.({
-      id: p.properties.id,
-      latitude: p.properties.latitude,
-      longitude: p.properties.longitude,
-      markers: [p.properties]
+      id: h.properties.id,
+      latitude: h.properties.latitude,
+      longitude: h.properties.longitude,
+      markers: [h.properties]
     });
-  }, g = (p) => {
+  }, g = (h) => {
     if (!u || !o) return !1;
-    if (o.id === `${p}`)
+    if (o.id === `${h}`)
       return !0;
     try {
-      return u.getLeaves(p)?.find((m) => m.properties.id === o.id) !== void 0;
+      return u.getLeaves(h)?.find((m) => m.properties.id === o.id) !== void 0;
     } catch {
       return !1;
     }
-  }, y = v(() => {
+  }, y = O(() => {
     switch (i?.name) {
       case "maptiler":
         return Ut;
@@ -650,25 +657,25 @@ function Ft({ isLoading: r, markers: t, onClick: e, ...n }) {
   return y ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(
     y,
     {
-      clusters: h,
+      clusters: p,
       onClick: d,
       doesSuperclusterContainActiveMarker: g,
       ...n
     }
   ) }) : null;
 }
-const Nt = w(() => import("./index-D49Xw0s2.js")), zt = w(() => import("./index-DQ1iIFTk.js")), jt = w(() => import("./index-Bp7Yr6DA.js")), kt = w(() => import("./index-COB6j_V1.js"));
+const kt = w(() => import("./index-BL4YTPcp.js")), Nt = w(() => import("./index-DM-Ih4p_.js")), zt = w(() => import("./index-D9mXgSxJ.js")), jt = w(() => import("./index-COB6j_V1.js"));
 function Gt({ children: r, anchor: t = "bottom", ...e }) {
-  const { mapProvider: n } = I(), i = v(() => {
+  const { mapProvider: n } = I(), i = O(() => {
     switch (n?.name) {
       case "maptiler":
-        return Nt;
+        return kt;
       case "google":
-        return zt;
+        return Nt;
       case "mapbox":
-        return jt;
+        return zt;
       case "testing":
-        return kt;
+        return jt;
       default:
         return null;
     }
@@ -677,7 +684,7 @@ function Gt({ children: r, anchor: t = "bottom", ...e }) {
 }
 const $t = w(() => import("./index-DKy2opdk.js")), Ht = w(() => import("./index-k9UFzKZZ.js")), Vt = w(() => import("./index-D8-yY6UK.js")), Jt = w(() => import("./index-C0inY_TA.js"));
 function Wt(r) {
-  const { mapProvider: t } = I(), e = v(() => {
+  const { mapProvider: t } = I(), e = O(() => {
     switch (t?.name) {
       case "maptiler":
         return $t;
@@ -694,21 +701,23 @@ function Wt(r) {
   return e ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(e, { ...r }) }) : null;
 }
 function Yt(r) {
-  const [t, e] = L([]), [n, i] = L([]), [o, a] = L(r.zoom || C.zoom);
+  const [t, e] = b(), [n, i] = b([]), [o, a] = b([]), [c, s] = b(r.zoom || L.zoom);
   return /* @__PURE__ */ _(
     rt.Provider,
     {
       value: {
         ...r,
         locale: r.locale || "en",
-        mapPadding: r.mapPadding || pt,
+        mapPadding: r.mapPadding || ht,
         locationBoundary: r.locationBoundary ? r.locationBoundary : [[r.center.longitude, r.center.latitude]],
-        markerPoints: t,
-        setMarkerPoints: e,
-        clusterPoints: n,
-        setClusterPoints: i,
-        zoom: o,
-        setZoom: a
+        centerPinMarkerPoints: t,
+        setCenterPinMarkerPoints: e,
+        markerPoints: n,
+        setMarkerPoints: i,
+        clusterPoints: o,
+        setClusterPoints: a,
+        zoom: c,
+        setZoom: s
       },
       children: r.children
     }
@@ -724,12 +733,12 @@ const ee = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   Root: Yt
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  C as D,
+  L as D,
   Qt as M,
   Xt as P,
   mt as W,
   J as a,
-  pt as b,
+  ht as b,
   ee as i,
   te as m,
   I as u

package/dist/{index-DsyoZEsZ.js → index-qum6AMNP.js}

@@ -1,8 +1,8 @@
 import { jsxs as f, jsx as r } from "react/jsx-runtime";
 import { useMap as k, AdvancedMarker as u } from "@vis.gl/react-google-maps";
-import { u as M, M as g } from "./index-Bbgg2AcG.js";
+import { u as M, M as g } from "./index-eyFsWhYO.js";
 import { c as C, M as v } from "./index-D4t3jFAj.js";
-import { C as I } from "./index-Cz1bOBd_.js";
+import { C as I } from "./index-DFGiNPbe.js";
 function y({
   clusters: a,
   colors: o,

package/dist/index.es.js

@@ -1,4 +1,4 @@
-import { i as c } from "./index-Bbgg2AcG.js";
+import { i as c } from "./index-eyFsWhYO.js";
 export {
   c as LocalLogicMap
 };