@local-logic/maps 0.1.3 → 0.1.4

package/dist/{index-J8lmJ6Xj.js → index-CNP-c5ZB.js}

@@ -1,7 +1,7 @@
 import { jsx as _ } from "react/jsx-runtime";
 import * as Z from "react";
-import ct, { useContext as ut, useState as L, useMemo as O, lazy as w, Suspense as R, useRef as j, useEffect as V } from "react";
-const nt = ct.createContext({}), I = () => ut(nt), C = {
+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 = {
   zoom: 14,
   pitch: 0,
   bearing: 0,
@@ -9,43 +9,46 @@ const nt = ct.createContext({}), I = () => ut(nt), C = {
 }, J = {
   maptiler: "600d69cb-288d-445e-9839-3dfe4d76b31a",
   mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
-  google: "a7ff20eb973126bb"
-}, lt = {
+  google: "a7ff20eb973126bb",
+  testing: "testing"
+}, pt = {
   top: 10,
   bottom: 10,
   left: 10,
   right: 10
-}, W = 10, pt = 22, Wt = 10, ht = 30, ft = 60, Yt = 15, dt = [-180, -85.0511, 180, 85.0511], mt = "w-full h-full relative overflow-hidden", gt = w(() => import("./index-NMqp09ek.js")), yt = w(() => import("./index-B1dI6iqp.js")), wt = w(() => import("./index-Bm2KdhhT.js")), Mt = w(() => import("./index-qqbvBkdn.js")), _t = ({ children: r }) => {
+}, 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-MZUXTR07.js")), wt = w(() => import("./index-zzok3ruU.js")), Mt = w(() => import("./index-QxKYqddl.js")), Y = w(() => import("./index-DXT59VJA.js")), _t = ({ children: r }) => {
   const {
     mapProvider: t,
     center: e,
     zoom: n = C.zoom,
-    pitch: o = C.pitch,
-    bearing: i = C.bearing,
+    pitch: i = C.pitch,
+    bearing: o = C.bearing,
     cooperativeGestures: a = C.cooperativeGestures,
     zoomPosition: c
-  } = I(), [s] = L(n), l = O(() => {
+  } = I(), [s] = L(n), l = v(() => {
     switch (t?.name) {
       case "maptiler":
-        return gt;
-      case "google":
         return yt;
-      case "mapbox":
+      case "google":
         return wt;
-      default:
+      case "mapbox":
         return Mt;
+      case "testing":
+        return Y;
+      default:
+        return Y;
     }
   }, [t]);
   return /* @__PURE__ */ _(
     "div",
     {
-      className: mt,
+      className: gt,
       "data-testid": "base-map",
       "data-map-provider-name": t?.name,
       "data-map-provider-theme": t?.theme || J[t?.name] || J.maptiler,
       "data-initial-zoom": s,
-      "data-pitch": o,
-      "data-bearing": i,
+      "data-pitch": i,
+      "data-bearing": o,
       "data-cooperative-gestures": a,
       "data-zoom-position": c,
       "data-center-latitude": e.latitude,
@@ -53,9 +56,9 @@ const nt = ct.createContext({}), I = () => ut(nt), C = {
       children: /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(l, { children: r }) })
     }
   );
-}, Pt = w(() => import("./index-C3Tj3r2u.js")), At = w(() => import("./index-CUUravWc.js")), Et = w(() => import("./index-eWv3le07.js"));
-function xt(r) {
-  const { mapProvider: t } = I(), e = O(() => {
+}, 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(() => {
     switch (t?.name) {
       case "maptiler":
         return Pt;
@@ -63,13 +66,15 @@ function xt(r) {
         return At;
       case "mapbox":
         return Et;
+      case "testing":
+        return xt;
       default:
         return null;
     }
   }, [t]);
   return e ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(e, { ...r }) }) : null;
 }
-function rt(r, t, e = {}) {
+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;
 }
@@ -80,23 +85,23 @@ function bt(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 (!K(r[0]) || !K(r[1]))
     throw new Error("coordinates must contain numbers");
-  return rt({
+  return st({
     type: "Point",
     coordinates: r
   }, t, e);
 }
-function Kt(r, t, e = {}) {
-  return rt({
+function te(r, t, e = {}) {
+  return st({
     type: "MultiPoint",
     coordinates: r
   }, t, e);
 }
-function Y(r) {
+function K(r) {
   return !isNaN(r) && r !== null && !Array.isArray(r);
 }
-const K = [
+const q = [
   Int8Array,
   Uint8Array,
   Uint8ClampedArray,
@@ -106,7 +111,7 @@ const K = [
   Uint32Array,
   Float32Array,
   Float64Array
-], F = 1, S = 8;
+], F = 1, O = 8;
 class G {
   /**
    * Creates an index from raw `ArrayBuffer` data.
@@ -118,14 +123,14 @@ class G {
     const [e, n] = new Uint8Array(t, 0, 2);
     if (e !== 219)
       throw new Error("Data does not appear to be in a KDBush format.");
-    const o = n >> 4;
-    if (o !== F)
-      throw new Error(`Got v${o} data when expected v${F}.`);
-    const i = K[n & 15];
-    if (!i)
+    const i = n >> 4;
+    if (i !== F)
+      throw new Error(`Got v${i} data when expected v${F}.`);
+    const o = q[n & 15];
+    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, i, t);
+    return new G(c, a, o, t);
   }
   /**
    * Creates an index that will hold a given number of items.
@@ -134,13 +139,13 @@ class G {
    * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
    * @param {ArrayBuffer} [data] (For internal use only)
    */
-  constructor(t, e = 64, n = Float64Array, o) {
+  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 i = K.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)
+    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}.`);
-    o && o instanceof ArrayBuffer ? (this.data = o, 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) + i]), 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, 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);
   }
   /**
    * Add a point to the index.
@@ -169,20 +174,20 @@ class G {
    * @param {number} maxY
    * @returns {number[]} An array of indices correponding to the found items.
    */
-  range(t, e, n, o) {
+  range(t, e, n, i) {
     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], l = [];
+    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;
       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 <= o && l.push(i[p]);
+          m >= t && m <= n && M >= e && M <= i && l.push(o[p]);
         }
         continue;
       }
       const d = f + u >> 1, g = a[2 * d], y = a[2 * d + 1];
-      g >= t && g <= n && y >= e && y <= o && l.push(i[d]), (h === 0 ? t <= g : e <= y) && (s.push(f), s.push(d - 1), s.push(1 - h)), (h === 0 ? n >= g : o >= y) && (s.push(d + 1), s.push(u), s.push(1 - h));
+      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));
     }
     return l;
   }
@@ -195,50 +200,50 @@ class G {
    */
   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 = [], l = n * n;
+    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;
       if (u - f <= a) {
         for (let p = f; p <= u; p++)
-          q(i[2 * p], i[2 * p + 1], t, e) <= l && s.push(o[p]);
+          Q(o[2 * p], o[2 * p + 1], t, e) <= l && s.push(i[p]);
         continue;
       }
-      const d = f + u >> 1, g = i[2 * d], y = i[2 * d + 1];
-      q(g, y, t, e) <= l && s.push(o[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));
+      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));
     }
     return s;
   }
 }
-function k(r, t, e, n, o, i) {
-  if (o - n <= e) return;
-  const a = n + o >> 1;
-  st(r, t, a, n, o, i), k(r, t, e, n, a - 1, 1 - i), k(r, t, e, a + 1, o, 1 - i);
+function k(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);
 }
-function st(r, t, e, n, o, i) {
-  for (; o > n; ) {
-    if (o - n > 600) {
-      const l = o - 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(o, Math.floor(e + (l - h) * f / l + d));
-      st(r, t, e, g, y, i);
+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));
+      it(r, t, e, g, y, o);
     }
-    const a = t[2 * e + i];
-    let c = n, s = o;
-    for (T(r, t, n, e), t[2 * o + i] > a && T(r, t, n, o); c < s; ) {
-      for (T(r, t, c, s), c++, s--; t[2 * c + i] < a; ) c++;
-      for (; t[2 * s + i] > a; ) s--;
+    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 (; t[2 * s + o] > a; ) s--;
     }
-    t[2 * n + i] === a ? T(r, t, n, s) : (s++, T(r, t, s, o)), s <= e && (n = s + 1), e <= s && (o = s - 1);
+    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);
   }
 }
-function T(r, t, e, n) {
+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 N(r, t, e) {
   const n = r[t];
   r[t] = r[e], r[e] = n;
 }
-function q(r, t, e, n) {
-  const o = r - e, i = t - n;
-  return o * o + i * i;
+function Q(r, t, e, n) {
+  const i = r - e, o = t - n;
+  return i * i + o * o;
 }
 const vt = {
   minZoom: 0,
@@ -263,21 +268,21 @@ const vt = {
   // 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)), b = 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, z = 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 = [];
   }
   load(t) {
-    const { log: e, minZoom: n, maxZoom: o } = this.options;
+    const { log: e, minZoom: n, maxZoom: i } = this.options;
     e && console.time("total time");
-    const i = `prepare ${t.length} points`;
-    e && console.time(i), this.points = t;
+    const o = `prepare ${t.length} points`;
+    e && console.time(o), this.points = t;
     const a = [];
     for (let s = 0; s < t.length; s++) {
       const l = t[s];
       if (!l.geometry) continue;
-      const [h, u] = l.geometry.coordinates, f = Q(U(h)), d = Q(D(u));
+      const [h, u] = l.geometry.coordinates, f = X(U(h)), d = X(D(u));
       a.push(
         f,
         d,
@@ -292,9 +297,9 @@ class Ot {
         // number of points in a cluster
       ), this.options.reduce && a.push(0);
     }
-    let c = this.trees[o + 1] = this._createTree(a);
-    e && console.timeEnd(i);
-    for (let s = o; s >= n; s--) {
+    let c = this.trees[i + 1] = this._createTree(a);
+    e && console.timeEnd(o);
+    for (let s = i; s >= n; s--) {
       const l = +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() - l);
     }
@@ -302,64 +307,64 @@ class Ot {
   }
   getClusters(t, e) {
     let n = ((t[0] + 180) % 360 + 360) % 360 - 180;
-    const o = Math.max(-90, Math.min(90, t[1]));
-    let i = t[2] === 180 ? 180 : ((t[2] + 180) % 360 + 360) % 360 - 180;
+    const i = Math.max(-90, Math.min(90, t[1]));
+    let o = t[2] === 180 ? 180 : ((t[2] + 180) % 360 + 360) % 360 - 180;
     const a = Math.max(-90, Math.min(90, t[3]));
     if (t[2] - t[0] >= 360)
-      n = -180, i = 180;
-    else if (n > i) {
-      const u = this.getClusters([n, o, 180, a], e), f = this.getClusters([-180, o, i, a], e);
+      n = -180, o = 180;
+    else if (n > o) {
+      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(i), D(o)), 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, h = [];
     for (const u of s) {
       const f = this.stride * u;
-      h.push(l[f + A] > 1 ? X(l, f, this.clusterProps) : this.points[l[f + E]]);
+      h.push(l[f + A] > 1 ? tt(l, f, this.clusterProps) : this.points[l[f + E]]);
     }
     return h;
   }
   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], l = a[e * this.stride + 1], h = i.within(s, l, c), u = [];
+    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 d = f * this.stride;
-      a[d + z] === t && u.push(a[d + A] > 1 ? X(a, d, this.clusterProps) : this.points[a[d + E]]);
+      a[d + z] === t && u.push(a[d + A] > 1 ? tt(a, d, this.clusterProps) : this.points[a[d + E]]);
     }
-    if (u.length === 0) throw new Error(o);
+    if (u.length === 0) throw new Error(i);
     return u;
   }
   getLeaves(t, e, n) {
     e = e || 10, n = n || 0;
-    const o = [];
-    return this._appendLeaves(o, t, e, n, 0), o;
+    const i = [];
+    return this._appendLeaves(i, t, e, n, 0), i;
   }
   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, l = (n - s) / i, h = (n + 1 + s) / i, 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, h = (n + 1 + s) / o, u = {
       features: []
     };
     return this._addTileFeatures(
-      o.range((e - s) / i, l, (e + 1 + s) / i, h),
-      o.data,
+      i.range((e - s) / o, l, (e + 1 + s) / o, h),
+      i.data,
       e,
       n,
-      i,
+      o,
       u
     ), e === 0 && this._addTileFeatures(
-      o.range(1 - s / i, l, 1, h),
-      o.data,
-      i,
+      i.range(1 - s / o, l, 1, h),
+      i.data,
+      o,
       n,
-      i,
+      o,
       u
-    ), e === i - 1 && this._addTileFeatures(
-      o.range(0, l, s / i, h),
-      o.data,
+    ), e === o - 1 && this._addTileFeatures(
+      i.range(0, l, s / o, h),
+      i.data,
       -1,
       n,
-      i,
+      o,
       u
     ), u.features.length ? u : null;
   }
@@ -372,25 +377,25 @@ class Ot {
     }
     return e;
   }
-  _appendLeaves(t, e, n, o, i) {
+  _appendLeaves(t, e, n, i, o) {
     const a = this.getChildren(e);
     for (const c of a) {
       const s = c.properties;
-      if (s && s.cluster ? i + s.point_count <= o ? i += s.point_count : i = this._appendLeaves(t, s.cluster_id, n, o, i) : i < o ? i++ : t.push(c), t.length === n) break;
+      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 i;
+    return o;
   }
   _createTree(t) {
     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) {
+  _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;
       if (l)
-        h = it(e, s, this.clusterProps), u = e[s], f = e[s + 1];
+        h = at(e, s, this.clusterProps), u = e[s], f = e[s + 1];
       else {
         const y = this.points[e[s + E]];
         h = y.properties;
@@ -400,8 +405,8 @@ class Ot {
       const d = {
         type: 1,
         geometry: [[
-          Math.round(this.options.extent * (u * i - n)),
-          Math.round(this.options.extent * (f * i - o))
+          Math.round(this.options.extent * (u * o - n)),
+          Math.round(this.options.extent * (f * o - i))
         ]],
         tags: h
       };
@@ -413,34 +418,34 @@ class Ot {
     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, l = [], h = this.stride;
+    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) {
-      if (s[u + b] <= e) continue;
-      s[u + b] = e;
+      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;
       for (const m of g) {
         const M = m * h;
-        s[M + b] > e && (p += s[M + A]);
+        s[M + T] > e && (p += 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;
-        for (const at of g) {
-          const x = at * h;
-          if (s[x + b] <= e) continue;
-          s[x + b] = e;
+        for (const ct of g) {
+          const x = ct * h;
+          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, i && (P || (P = this._map(s, u, !0), $ = this.clusterProps.length, this.clusterProps.push(P)), i(P, this._map(s, x)));
+          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)));
         }
-        s[u + z] = B, l.push(m / p, M / p, 1 / 0, B, -1, p), i && l.push($);
+        s[u + z] = B, l.push(m / p, M / p, 1 / 0, B, -1, p), o && l.push($);
       } else {
         for (let m = 0; m < h; m++) l.push(s[u + m]);
         if (p > 1)
           for (const m of g) {
             const M = m * h;
-            if (!(s[M + b] <= e)) {
-              s[M + b] = e;
+            if (!(s[M + T] <= e)) {
+              s[M + T] = e;
               for (let P = 0; P < h; P++) l.push(s[M + P]);
             }
           }
@@ -461,28 +466,28 @@ class Ot {
       const a = this.clusterProps[t[e + ot]];
       return n ? Object.assign({}, a) : a;
     }
-    const o = this.points[t[e + E]].properties, i = this.options.map(o);
-    return n && i === o ? Object.assign({}, i) : i;
+    const i = this.points[t[e + E]].properties, o = this.options.map(i);
+    return n && o === i ? Object.assign({}, o) : o;
   }
 }
-function X(r, t, e) {
+function tt(r, t, e) {
   return {
     type: "Feature",
     id: r[t + E],
-    properties: it(r, t, e),
+    properties: at(r, t, e),
     geometry: {
       type: "Point",
-      coordinates: [St(r[t]), Tt(r[t + 1])]
+      coordinates: [St(r[t]), Ct(r[t + 1])]
     }
   };
 }
-function it(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 + ot], a = i === -1 ? {} : Object.assign({}, e[i]);
+function at(r, t, e) {
+  const n = r[t + A], i = n >= 1e4 ? `${Math.round(n / 1e3)}k` : n >= 1e3 ? `${Math.round(n / 100) / 10}k` : n, o = r[t + ot], a = o === -1 ? {} : Object.assign({}, e[o]);
   return Object.assign(a, {
     cluster: !0,
     cluster_id: r[t + E],
     point_count: n,
-    point_count_abbreviated: o
+    point_count_abbreviated: i
   });
 }
 function U(r) {
@@ -495,38 +500,38 @@ function D(r) {
 function St(r) {
   return (r - 0.5) * 360;
 }
-function Tt(r) {
+function Ct(r) {
   const t = (180 - r * 360) * Math.PI / 180;
   return 360 * Math.atan(Math.exp(t)) / Math.PI - 90;
 }
-var tt = Object.prototype.hasOwnProperty;
-function et(r, t, e) {
+var et = Object.prototype.hasOwnProperty;
+function nt(r, t, e) {
   for (e of r.keys())
-    if (v(e, t)) return e;
+    if (b(e, t)) return e;
 }
-function v(r, t) {
-  var e, n, o;
+function b(r, t) {
+  var e, n, i;
   if (r === t) return !0;
   if (r && t && (e = r.constructor) === t.constructor) {
     if (e === Date) return r.getTime() === t.getTime();
     if (e === RegExp) return r.toString() === t.toString();
     if (e === Array) {
       if ((n = r.length) === t.length)
-        for (; n-- && v(r[n], t[n]); ) ;
+        for (; n-- && b(r[n], t[n]); ) ;
       return n === -1;
     }
     if (e === Set) {
       if (r.size !== t.size)
         return !1;
       for (n of r)
-        if (o = n, o && typeof o == "object" && (o = et(t, o), !o) || !t.has(o)) return !1;
+        if (i = n, i && typeof i == "object" && (i = nt(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 (o = n[0], o && typeof o == "object" && (o = et(t, o), !o) || !v(n[1], t.get(o)))
+        if (i = n[0], i && typeof i == "object" && (i = nt(t, i), !i) || !b(n[1], t.get(i)))
           return !1;
       return !0;
     }
@@ -545,53 +550,53 @@ function v(r, t) {
     if (!e || typeof r == "object") {
       n = 0;
       for (e in r)
-        if (tt.call(r, e) && ++n && !tt.call(t, e) || !(e in t) || !v(r[e], t[e])) return !1;
+        if (et.call(r, e) && ++n && !et.call(t, e) || !(e in t) || !b(r[e], t[e])) return !1;
       return Object.keys(t).length === n;
     }
   }
   return r !== r && t !== t;
 }
-function Ct(r) {
+function Lt(r) {
   var t = Z.useRef(r), e = Z.useRef(0);
-  return v(r, t.current) || (t.current = r, e.current += 1), Z.useMemo(function() {
+  return b(r, t.current) || (t.current = r, e.current += 1), Z.useMemo(function() {
     return t.current;
   }, [e.current]);
 }
-function Lt(r, t) {
-  return Z.useEffect(r, Ct(t));
+function Rt(r, t) {
+  return Z.useEffect(r, Lt(t));
 }
-var Rt = function(t) {
-  var e = t.points, n = t.bounds, o = t.zoom, i = t.options, a = t.disableRefresh, c = j(), s = j(), l = L([]), h = l[0], u = l[1], f = Math.round(o);
-  return Lt(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]), {
+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);
+  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);
+  }, [e, n, f, o, a]), {
     clusters: h,
     supercluster: c.current
   };
 };
-const It = w(() => import("./index-Deqck8KU.js")), Ut = w(() => import("./index-CFioISlP.js")), Dt = w(() => import("./index-CyFpPXRS.js"));
-function Zt({ isLoading: r, markers: t, onClick: e, ...n }) {
-  const { mapProvider: o, activeMarker: i, zoom: a, setMarkerPoints: c, setClusterPoints: s } = I();
+const Ut = w(() => import("./index-0EkdzCyN.js")), Dt = w(() => import("./index-CZPGxjSJ.js")), Zt = w(() => import("./index-BY_xYg2p.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(() => {
     if (r)
       return;
     const p = (t || []).map((m) => [m.longitude, m.latitude]);
     c(p);
   }, [t, c]);
-  const l = O(
+  const l = v(
     () => ({
       points: t.map((p) => bt([p.longitude, p.latitude], p)),
       // Using world bounds to avoid issues with markers near the edges of the map
-      bounds: dt,
+      bounds: mt,
       zoom: a,
       options: {
-        radius: o.name === "google" && a > W ? ft : ht,
+        radius: i.name === "google" && a > W ? dt : ft,
         minZoom: W,
-        maxZoom: pt
+        maxZoom: ht
       }
     }),
-    [t, o, a]
-  ), { clusters: h, supercluster: u } = Rt(l), f = j("");
+    [t, i, a]
+  ), { clusters: h, supercluster: u } = It(l), f = j("");
   V(() => {
     const p = JSON.stringify(
       h.map((m) => ({
@@ -620,26 +625,28 @@ function Zt({ isLoading: r, markers: t, onClick: e, ...n }) {
       markers: [p.properties]
     });
   }, g = (p) => {
-    if (!u || !i) return !1;
-    if (i.id === `${p}`)
+    if (!u || !o) return !1;
+    if (o.id === `${p}`)
       return !0;
     try {
-      return u.getLeaves(p)?.find((m) => m.properties.id === i.id) !== void 0;
+      return u.getLeaves(p)?.find((m) => m.properties.id === o.id) !== void 0;
     } catch {
       return !1;
     }
-  }, y = O(() => {
-    switch (o?.name) {
+  }, y = v(() => {
+    switch (i?.name) {
       case "maptiler":
-        return It;
-      case "google":
         return Ut;
-      case "mapbox":
+      case "google":
         return Dt;
+      case "mapbox":
+        return Zt;
+      case "testing":
+        return Bt;
       default:
         return null;
     }
-  }, [o]);
+  }, [i]);
   return y ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(
     y,
     {
@@ -650,76 +657,80 @@ function Zt({ isLoading: r, markers: t, onClick: e, ...n }) {
     }
   ) }) : null;
 }
-const Bt = w(() => import("./index-zqYpD_YN.js")), Ft = w(() => import("./index-CzqD82Cl.js")), Nt = w(() => import("./index-VFglx6lb.js"));
-function zt({ children: r, anchor: t = "bottom", ...e }) {
-  const { mapProvider: n } = I(), o = O(() => {
+const Nt = w(() => import("./index--PIAfLjo.js")), zt = w(() => import("./index-BnTZMzoy.js")), jt = w(() => import("./index-GoHd1Tri.js")), kt = w(() => import("./index-COB6j_V1.js"));
+function Gt({ children: r, anchor: t = "bottom", ...e }) {
+  const { mapProvider: n } = I(), i = v(() => {
     switch (n?.name) {
       case "maptiler":
-        return Bt;
+        return Nt;
       case "google":
-        return Ft;
+        return zt;
       case "mapbox":
-        return Nt;
+        return jt;
+      case "testing":
+        return kt;
       default:
         return null;
     }
   }, [n]);
-  return o ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(o, { ...e, anchor: t, children: r }) }) : null;
+  return i ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(i, { ...e, anchor: t, children: r }) }) : null;
 }
-const jt = w(() => import("./index-DKy2opdk.js")), kt = w(() => import("./index-k9UFzKZZ.js")), Gt = w(() => import("./index-D8-yY6UK.js"));
-function $t(r) {
-  const { mapProvider: t } = I(), e = O(() => {
+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(() => {
     switch (t?.name) {
       case "maptiler":
-        return jt;
+        return $t;
       case "google":
-        return kt;
+        return Ht;
       case "mapbox":
-        return Gt;
+        return Vt;
+      case "testing":
+        return Jt;
       default:
         return null;
     }
   }, [t]);
   return e ? /* @__PURE__ */ _(R, { fallback: null, children: /* @__PURE__ */ _(e, { ...r }) }) : null;
 }
-function Ht(r) {
-  const [t, e] = L([]), [n, o] = L([]), [i, a] = L(r.zoom || C.zoom);
+function Yt(r) {
+  const [t, e] = L([]), [n, i] = L([]), [o, a] = L(r.zoom || C.zoom);
   return /* @__PURE__ */ _(
-    nt.Provider,
+    rt.Provider,
     {
       value: {
         ...r,
         locale: r.locale || "en",
-        mapPadding: r.mapPadding || lt,
+        mapPadding: r.mapPadding || pt,
         locationBoundary: r.locationBoundary ? r.locationBoundary : [[r.center.longitude, r.center.latitude]],
         markerPoints: t,
         setMarkerPoints: e,
         clusterPoints: n,
-        setClusterPoints: o,
-        zoom: i,
+        setClusterPoints: i,
+        zoom: o,
         setZoom: a
       },
       children: r.children
     }
   );
 }
-const qt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ee = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   BaseMap: _t,
-  CenterPin: xt,
-  Layers: $t,
-  Markers: Zt,
-  Popup: zt,
-  Root: Ht
+  CenterPin: Tt,
+  Layers: Wt,
+  Markers: Ft,
+  Popup: Gt,
+  Root: Yt
 }, Symbol.toStringTag, { value: "Module" }));
 export {
   C as D,
-  Wt as M,
-  Yt as P,
-  dt as W,
+  Qt as M,
+  Xt as P,
+  mt as W,
   J as a,
-  lt as b,
-  qt as i,
-  Kt as m,
+  pt as b,
+  ee as i,
+  te as m,
   I as u
 };