@local-logic/maps 0.0.6 → 0.0.8

package/dist/{index-CXLLvdx4.js → index-CY0to_1B.js}

@@ -1,71 +1,76 @@
-import { jsx as x, Fragment as nt } from "react/jsx-runtime";
+import { jsx as x, Fragment as st } from "react/jsx-runtime";
 import * as F from "react";
-import st, { useContext as it, lazy as w, useMemo as L, useRef as G, useState as Q } from "react";
-const q = st.createContext(
+import ot, { useContext as it, lazy as w, useMemo as L, useRef as G, useState as Q } from "react";
+const X = ot.createContext(
   {}
-), R = () => it(q), S = {
+), R = () => it(X), S = {
   zoom: 16,
   pitch: 0,
   bearing: 0,
   cooperativeGestures: !1
-}, ot = "w-full h-full relative overflow-hidden", at = w(() => import("./index-Bd-X-1Gd.js")), ct = w(() => import("./index-BAAE2pMq.js")), ut = w(() => import("./index-B_LO5X9C.js")), ht = w(() => import("./index-qqbvBkdn.js")), pt = ({ children: n }) => {
+}, V = {
+  maptiler: "600d69cb-288d-445e-9839-3dfe4d76b31a",
+  mapbox: "locallogic/cmb9nz9kb011501ru8drq8fqf",
+  google: "a7ff20eb973126bb"
+}, at = "w-full h-full relative overflow-hidden", ct = w(() => import("./index-BF2kb4Y-.js")), ut = w(() => import("./index-C5-_i-6M.js")), ht = w(() => import("./index-CrIFr9oc.js")), pt = w(() => import("./index-qqbvBkdn.js")), lt = ({ children: r }) => {
   const {
     mapProvider: t,
     center: e,
-    zoom: r = S.zoom,
-    pitch: i = S.pitch,
-    bearing: o = S.bearing,
+    zoom: n = S.zoom,
+    pitch: o = S.pitch,
+    bearing: i = S.bearing,
     cooperativeGestures: a = S.cooperativeGestures,
     zoomPosition: u
   } = R(), s = L(() => {
     switch (t == null ? void 0 : t.name) {
       case "maptiler":
-        return at;
-      case "google":
         return ct;
-      case "mapbox":
+      case "google":
         return ut;
-      default:
+      case "mapbox":
         return ht;
+      default:
+        return pt;
     }
   }, [t]);
   return /* @__PURE__ */ x(
     "div",
     {
-      className: ot,
+      className: at,
       "data-testid": "base-map",
-      "data-map-provider": t == null ? void 0 : t.name,
-      "data-zoom": r,
-      "data-pitch": i,
-      "data-bearing": o,
+      "data-map-provider-name": t == null ? void 0 : t.name,
+      "data-map-provider-theme": (t == null ? void 0 : t.theme) || V[t == null ? void 0 : t.name] || V.maptiler,
+      "data-zoom": n,
+      "data-pitch": o,
+      "data-bearing": i,
       "data-cooperative-gestures": a,
       "data-zoom-position": u,
       "data-center-latitude": e.latitude,
       "data-center-longitude": e.longitude,
-      children: /* @__PURE__ */ x(s, { children: n })
+      children: /* @__PURE__ */ x(s, { children: r })
     }
   );
 };
-function lt(n, t, e = {}) {
-  const r = { type: "Feature" };
-  return (e.id === 0 || e.id) && (r.id = e.id), e.bbox && (r.bbox = e.bbox), r.properties = t || {}, r.geometry = n, r;
+function ft(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 ft(n, t, e = {}) {
-  if (!n)
+function dt(r, t, e = {}) {
+  if (!r)
     throw new Error("coordinates is required");
-  if (!Array.isArray(n))
+  if (!Array.isArray(r))
     throw new Error("coordinates must be an Array");
-  if (n.length < 2)
+  if (r.length < 2)
     throw new Error("coordinates must be at least 2 numbers long");
-  if (!V(n[0]) || !V(n[1]))
+  if (!k(r[0]) || !k(r[1]))
     throw new Error("coordinates must contain numbers");
-  return lt({
+  return ft({
     type: "Point",
-    coordinates: n
+    coordinates: r
   }, t, e);
 }
-function V(n) {
-  return !isNaN(n) && n !== null && !Array.isArray(n);
+function k(r) {
+  return !isNaN(r) && r !== null && !Array.isArray(r);
 }
 const H = [
   Int8Array,
@@ -77,7 +82,7 @@ const H = [
   Uint32Array,
   Float32Array,
   Float64Array
-], C = 1, P = 8;
+], C = 1, O = 8;
 class D {
   /**
    * Creates an index from raw `ArrayBuffer` data.
@@ -86,17 +91,17 @@ class D {
   static from(t) {
     if (!(t instanceof ArrayBuffer))
       throw new Error("Data must be an instance of ArrayBuffer.");
-    const [e, r] = new Uint8Array(t, 0, 2);
+    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 i = r >> 4;
-    if (i !== C)
-      throw new Error(`Got v${i} data when expected v${C}.`);
-    const o = H[r & 15];
-    if (!o)
+    const o = n >> 4;
+    if (o !== C)
+      throw new Error(`Got v${o} data when expected v${C}.`);
+    const i = H[n & 15];
+    if (!i)
       throw new Error("Unrecognized array type.");
     const [a] = new Uint16Array(t, 2, 1), [u] = new Uint32Array(t, 4, 1);
-    return new D(u, a, o, t);
+    return new D(u, a, i, t);
   }
   /**
    * Creates an index that will hold a given number of items.
@@ -105,13 +110,13 @@ class D {
    * @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, r = Float64Array, i) {
+  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 = r, this.IndexArrayType = t < 65536 ? Uint16Array : Uint32Array;
-    const o = H.indexOf(this.ArrayType), a = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, u = t * this.IndexArrayType.BYTES_PER_ELEMENT, s = (8 - u % 8) % 8;
-    if (o < 0)
-      throw new Error(`Unexpected typed array class: ${r}.`);
-    i && i instanceof ArrayBuffer ? (this.data = i, this.ids = new this.IndexArrayType(this.data, P, t), this.coords = new this.ArrayType(this.data, P + u + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(P + a + u + s), this.ids = new this.IndexArrayType(this.data, P, t), this.coords = new this.ArrayType(this.data, P + u + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (C << 4) + o]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t);
+    this.numItems = +t, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.ArrayType = n, this.IndexArrayType = t < 65536 ? Uint16Array : Uint32Array;
+    const i = H.indexOf(this.ArrayType), a = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, u = t * this.IndexArrayType.BYTES_PER_ELEMENT, s = (8 - u % 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, O, t), this.coords = new this.ArrayType(this.data, O + u + s, t * 2), this._pos = t * 2, this._finished = !0) : (this.data = new ArrayBuffer(O + a + u + s), this.ids = new this.IndexArrayType(this.data, O, t), this.coords = new this.ArrayType(this.data, O + u + s, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (C << 4) + i]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t);
   }
   /**
    * Add a point to the index.
@@ -120,8 +125,8 @@ class D {
    * @returns {number} An incremental index associated with the added item (starting from `0`).
    */
   add(t, e) {
-    const r = this._pos >> 1;
-    return this.ids[r] = r, this.coords[this._pos++] = t, this.coords[this._pos++] = e, r;
+    const n = this._pos >> 1;
+    return this.ids[n] = n, this.coords[this._pos++] = t, this.coords[this._pos++] = e, n;
   }
   /**
    * Perform indexing of the added points.
@@ -140,20 +145,20 @@ class D {
    * @param {number} maxY
    * @returns {number[]} An array of indices correponding to the found items.
    */
-  range(t, e, r, i) {
+  range(t, e, n, o) {
     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], c = [];
+    const { ids: i, coords: a, nodeSize: u } = this, s = [0, i.length - 1, 0], c = [];
     for (; s.length; ) {
       const p = s.pop() || 0, h = s.pop() || 0, l = s.pop() || 0;
       if (h - l <= u) {
         for (let d = l; d <= h; d++) {
           const y = a[2 * d], M = a[2 * d + 1];
-          y >= t && y <= r && M >= e && M <= i && c.push(o[d]);
+          y >= t && y <= n && M >= e && M <= o && c.push(i[d]);
         }
         continue;
       }
       const f = l + h >> 1, g = a[2 * f], m = a[2 * f + 1];
-      g >= t && g <= r && m >= e && m <= i && c.push(o[f]), (p === 0 ? t <= g : e <= m) && (s.push(l), s.push(f - 1), s.push(1 - p)), (p === 0 ? r >= g : i >= m) && (s.push(f + 1), s.push(h), s.push(1 - p));
+      g >= t && g <= n && m >= e && m <= o && c.push(i[f]), (p === 0 ? t <= g : e <= m) && (s.push(l), s.push(f - 1), s.push(1 - p)), (p === 0 ? n >= g : o >= m) && (s.push(f + 1), s.push(h), s.push(1 - p));
     }
     return c;
   }
@@ -164,54 +169,54 @@ class D {
    * @param {number} r Query radius.
    * @returns {number[]} An array of indices correponding to the found items.
    */
-  within(t, e, r) {
+  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 = [], c = r * r;
+    const { ids: o, coords: i, nodeSize: a } = this, u = [0, o.length - 1, 0], s = [], c = n * n;
     for (; u.length; ) {
       const p = u.pop() || 0, h = u.pop() || 0, l = u.pop() || 0;
       if (h - l <= a) {
         for (let d = l; d <= h; d++)
-          k(o[2 * d], o[2 * d + 1], t, e) <= c && s.push(i[d]);
+          J(i[2 * d], i[2 * d + 1], t, e) <= c && s.push(o[d]);
         continue;
       }
-      const f = l + h >> 1, g = o[2 * f], m = o[2 * f + 1];
-      k(g, m, t, e) <= c && s.push(i[f]), (p === 0 ? t - r <= g : e - r <= m) && (u.push(l), u.push(f - 1), u.push(1 - p)), (p === 0 ? t + r >= g : e + r >= m) && (u.push(f + 1), u.push(h), u.push(1 - p));
+      const f = l + h >> 1, g = i[2 * f], m = i[2 * f + 1];
+      J(g, m, t, e) <= c && s.push(o[f]), (p === 0 ? t - n <= g : e - n <= m) && (u.push(l), u.push(f - 1), u.push(1 - p)), (p === 0 ? t + n >= g : e + n >= m) && (u.push(f + 1), u.push(h), u.push(1 - p));
     }
     return s;
   }
 }
-function j(n, t, e, r, i, o) {
-  if (i - r <= e) return;
-  const a = r + i >> 1;
-  X(n, t, a, r, i, o), j(n, t, e, r, a - 1, 1 - o), j(n, t, e, a + 1, i, 1 - o);
+function j(r, t, e, n, o, i) {
+  if (o - n <= e) return;
+  const a = n + o >> 1;
+  tt(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 X(n, t, e, r, i, o) {
-  for (; i > r; ) {
-    if (i - r > 600) {
-      const c = i - r + 1, p = e - r + 1, h = Math.log(c), l = 0.5 * Math.exp(2 * h / 3), f = 0.5 * Math.sqrt(h * l * (c - l) / c) * (p - c / 2 < 0 ? -1 : 1), g = Math.max(r, Math.floor(e - p * l / c + f)), m = Math.min(i, Math.floor(e + (c - p) * l / c + f));
-      X(n, t, e, g, m, o);
+function tt(r, t, e, n, o, i) {
+  for (; o > n; ) {
+    if (o - n > 600) {
+      const c = o - n + 1, p = e - n + 1, h = Math.log(c), l = 0.5 * Math.exp(2 * h / 3), f = 0.5 * Math.sqrt(h * l * (c - l) / c) * (p - c / 2 < 0 ? -1 : 1), g = Math.max(n, Math.floor(e - p * l / c + f)), m = Math.min(o, Math.floor(e + (c - p) * l / c + f));
+      tt(r, t, e, g, m, i);
     }
-    const a = t[2 * e + o];
-    let u = r, s = i;
-    for (O(n, t, r, e), t[2 * i + o] > a && O(n, t, r, i); u < s; ) {
-      for (O(n, t, u, s), u++, s--; t[2 * u + o] < a; ) u++;
-      for (; t[2 * s + o] > a; ) s--;
+    const a = t[2 * e + i];
+    let u = n, s = o;
+    for (P(r, t, n, e), t[2 * o + i] > a && P(r, t, n, o); u < s; ) {
+      for (P(r, t, u, s), u++, s--; t[2 * u + i] < a; ) u++;
+      for (; t[2 * s + i] > a; ) s--;
     }
-    t[2 * r + o] === a ? O(n, t, r, s) : (s++, O(n, t, s, i)), s <= e && (r = s + 1), e <= s && (i = s - 1);
+    t[2 * n + i] === a ? P(r, t, n, s) : (s++, P(r, t, s, o)), s <= e && (n = s + 1), e <= s && (o = s - 1);
   }
 }
-function O(n, t, e, r) {
-  U(n, e, r), U(t, 2 * e, 2 * r), U(t, 2 * e + 1, 2 * r + 1);
+function P(r, t, e, n) {
+  U(r, e, n), U(t, 2 * e, 2 * n), U(t, 2 * e + 1, 2 * n + 1);
 }
-function U(n, t, e) {
-  const r = n[t];
-  n[t] = n[e], n[e] = r;
+function U(r, t, e) {
+  const n = r[t];
+  r[t] = r[e], r[e] = n;
 }
-function k(n, t, e, r) {
-  const i = n - e, o = t - r;
-  return i * i + o * o;
+function J(r, t, e, n) {
+  const o = r - e, i = t - n;
+  return o * o + i * i;
 }
-const dt = {
+const gt = {
   minZoom: 0,
   // min zoom to generate clusters on
   maxZoom: 16,
@@ -232,23 +237,23 @@ const dt = {
   reduce: null,
   // (accumulated, props) => { accumulated.sum += props.sum; }
   // properties to use for individual points when running the reducer
-  map: (n) => n
+  map: (r) => r
   // props => ({sum: props.my_value})
-}, J = Math.fround || /* @__PURE__ */ ((n) => (t) => (n[0] = +t, n[0]))(new Float32Array(1)), v = 2, E = 3, z = 4, A = 5, tt = 6;
-class gt {
+}, K = Math.fround || /* @__PURE__ */ ((r) => (t) => (r[0] = +t, r[0]))(new Float32Array(1)), T = 2, E = 3, z = 4, A = 5, et = 6;
+class mt {
   constructor(t) {
-    this.options = Object.assign(Object.create(dt), t), this.trees = new Array(this.options.maxZoom + 1), this.stride = this.options.reduce ? 7 : 6, this.clusterProps = [];
+    this.options = Object.assign(Object.create(gt), t), this.trees = new Array(this.options.maxZoom + 1), this.stride = this.options.reduce ? 7 : 6, this.clusterProps = [];
   }
   load(t) {
-    const { log: e, minZoom: r, maxZoom: i } = this.options;
+    const { log: e, minZoom: n, maxZoom: o } = this.options;
     e && console.time("total time");
-    const o = `prepare ${t.length} points`;
-    e && console.time(o), this.points = t;
+    const i = `prepare ${t.length} points`;
+    e && console.time(i), this.points = t;
     const a = [];
     for (let s = 0; s < t.length; s++) {
       const c = t[s];
       if (!c.geometry) continue;
-      const [p, h] = c.geometry.coordinates, l = J(I(p)), f = J(B(h));
+      const [p, h] = c.geometry.coordinates, l = K(I(p)), f = K(B(h));
       a.push(
         l,
         f,
@@ -263,105 +268,105 @@ class gt {
         // number of points in a cluster
       ), this.options.reduce && a.push(0);
     }
-    let u = this.trees[i + 1] = this._createTree(a);
-    e && console.timeEnd(o);
-    for (let s = i; s >= r; s--) {
+    let u = this.trees[o + 1] = this._createTree(a);
+    e && console.timeEnd(i);
+    for (let s = o; s >= n; s--) {
       const c = +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() - c);
     }
     return e && console.timeEnd("total time"), this;
   }
   getClusters(t, e) {
-    let r = ((t[0] + 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;
+    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 a = Math.max(-90, Math.min(90, t[3]));
     if (t[2] - t[0] >= 360)
-      r = -180, o = 180;
-    else if (r > o) {
-      const h = this.getClusters([r, i, 180, a], e), l = this.getClusters([-180, i, o, a], e);
+      n = -180, i = 180;
+    else if (n > i) {
+      const h = this.getClusters([n, o, 180, a], e), l = this.getClusters([-180, o, i, a], e);
       return h.concat(l);
     }
-    const u = this.trees[this._limitZoom(e)], s = u.range(I(r), B(a), I(o), B(i)), c = u.data, p = [];
+    const u = this.trees[this._limitZoom(e)], s = u.range(I(n), B(a), I(i), B(o)), c = u.data, p = [];
     for (const h of s) {
       const l = this.stride * h;
-      p.push(c[l + A] > 1 ? K(c, l, this.clusterProps) : this.points[c[l + E]]);
+      p.push(c[l + A] > 1 ? W(c, l, this.clusterProps) : this.points[c[l + E]]);
     }
     return p;
   }
   getChildren(t) {
-    const e = this._getOriginId(t), r = this._getOriginZoom(t), i = "No cluster with the specified id.", o = this.trees[r];
-    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, r - 1)), s = a[e * this.stride], c = a[e * this.stride + 1], p = o.within(s, c, u), h = [];
+    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 u = this.options.radius / (this.options.extent * Math.pow(2, n - 1)), s = a[e * this.stride], c = a[e * this.stride + 1], p = i.within(s, c, u), h = [];
     for (const l of p) {
       const f = l * this.stride;
-      a[f + z] === t && h.push(a[f + A] > 1 ? K(a, f, this.clusterProps) : this.points[a[f + E]]);
+      a[f + z] === t && h.push(a[f + A] > 1 ? W(a, f, this.clusterProps) : this.points[a[f + E]]);
     }
-    if (h.length === 0) throw new Error(i);
+    if (h.length === 0) throw new Error(o);
     return h;
   }
-  getLeaves(t, e, r) {
-    e = e || 10, r = r || 0;
-    const i = [];
-    return this._appendLeaves(i, t, e, r, 0), i;
+  getLeaves(t, e, n) {
+    e = e || 10, n = n || 0;
+    const o = [];
+    return this._appendLeaves(o, t, e, n, 0), o;
   }
-  getTile(t, e, r) {
-    const i = this.trees[this._limitZoom(t)], o = Math.pow(2, t), { extent: a, radius: u } = this.options, s = u / a, c = (r - s) / o, p = (r + 1 + s) / o, h = {
+  getTile(t, e, n) {
+    const o = this.trees[this._limitZoom(t)], i = Math.pow(2, t), { extent: a, radius: u } = this.options, s = u / a, c = (n - s) / i, p = (n + 1 + s) / i, h = {
       features: []
     };
     return this._addTileFeatures(
-      i.range((e - s) / o, c, (e + 1 + s) / o, p),
-      i.data,
+      o.range((e - s) / i, c, (e + 1 + s) / i, p),
+      o.data,
       e,
-      r,
-      o,
+      n,
+      i,
       h
     ), e === 0 && this._addTileFeatures(
-      i.range(1 - s / o, c, 1, p),
-      i.data,
-      o,
-      r,
-      o,
+      o.range(1 - s / i, c, 1, p),
+      o.data,
+      i,
+      n,
+      i,
       h
-    ), e === o - 1 && this._addTileFeatures(
-      i.range(0, c, s / o, p),
-      i.data,
+    ), e === i - 1 && this._addTileFeatures(
+      o.range(0, c, s / i, p),
+      o.data,
       -1,
-      r,
-      o,
+      n,
+      i,
       h
     ), h.features.length ? h : null;
   }
   getClusterExpansionZoom(t) {
     let e = this._getOriginZoom(t) - 1;
     for (; e <= this.options.maxZoom; ) {
-      const r = this.getChildren(t);
-      if (e++, r.length !== 1) break;
-      t = r[0].properties.cluster_id;
+      const n = this.getChildren(t);
+      if (e++, n.length !== 1) break;
+      t = n[0].properties.cluster_id;
     }
     return e;
   }
-  _appendLeaves(t, e, r, i, o) {
+  _appendLeaves(t, e, n, o, i) {
     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, r, i, o) : o < i ? o++ : t.push(u), t.length === r) break;
+      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(u), t.length === n) break;
     }
-    return o;
+    return i;
   }
   _createTree(t) {
     const e = new D(t.length / this.stride | 0, this.options.nodeSize, Float32Array);
-    for (let r = 0; r < t.length; r += this.stride) e.add(t[r], t[r + 1]);
+    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, r, i, o, a) {
+  _addTileFeatures(t, e, n, o, i, a) {
     for (const u of t) {
       const s = u * this.stride, c = e[s + A] > 1;
       let p, h, l;
       if (c)
-        p = et(e, s, this.clusterProps), h = e[s], l = e[s + 1];
+        p = nt(e, s, this.clusterProps), h = e[s], l = e[s + 1];
       else {
         const m = this.points[e[s + E]];
         p = m.properties;
@@ -371,8 +376,8 @@ class gt {
       const f = {
         type: 1,
         geometry: [[
-          Math.round(this.options.extent * (h * o - r)),
-          Math.round(this.options.extent * (l * o - i))
+          Math.round(this.options.extent * (h * i - n)),
+          Math.round(this.options.extent * (l * i - o))
         ]],
         tags: p
       };
@@ -384,34 +389,34 @@ class gt {
     return Math.max(this.options.minZoom, Math.min(Math.floor(+t), this.options.maxZoom + 1));
   }
   _cluster(t, e) {
-    const { radius: r, extent: i, reduce: o, minPoints: a } = this.options, u = r / (i * Math.pow(2, e)), s = t.data, c = [], p = this.stride;
+    const { radius: n, extent: o, reduce: i, minPoints: a } = this.options, u = n / (o * Math.pow(2, e)), s = t.data, c = [], p = this.stride;
     for (let h = 0; h < s.length; h += p) {
-      if (s[h + v] <= e) continue;
-      s[h + v] = e;
+      if (s[h + T] <= e) continue;
+      s[h + T] = e;
       const l = s[h], f = s[h + 1], g = t.within(s[h], s[h + 1], u), m = s[h + A];
       let d = m;
       for (const y of g) {
         const M = y * p;
-        s[M + v] > e && (d += s[M + A]);
+        s[M + T] > e && (d += s[M + A]);
       }
       if (d > m && d >= a) {
         let y = l * m, M = f * m, _, N = -1;
         const Z = ((h / p | 0) << 5) + (e + 1) + this.points.length;
         for (const rt of g) {
           const b = rt * p;
-          if (s[b + v] <= e) continue;
-          s[b + v] = e;
+          if (s[b + T] <= e) continue;
+          s[b + T] = e;
           const $ = s[b + A];
-          y += s[b] * $, M += s[b + 1] * $, s[b + z] = Z, o && (_ || (_ = this._map(s, h, !0), N = this.clusterProps.length, this.clusterProps.push(_)), o(_, this._map(s, b)));
+          y += s[b] * $, M += s[b + 1] * $, s[b + z] = Z, i && (_ || (_ = this._map(s, h, !0), N = this.clusterProps.length, this.clusterProps.push(_)), i(_, this._map(s, b)));
         }
-        s[h + z] = Z, c.push(y / d, M / d, 1 / 0, Z, -1, d), o && c.push(N);
+        s[h + z] = Z, c.push(y / d, M / d, 1 / 0, Z, -1, d), i && c.push(N);
       } else {
         for (let y = 0; y < p; y++) c.push(s[h + y]);
         if (d > 1)
           for (const y of g) {
             const M = y * p;
-            if (!(s[M + v] <= e)) {
-              s[M + v] = e;
+            if (!(s[M + T] <= e)) {
+              s[M + T] = e;
               for (let _ = 0; _ < p; _++) c.push(s[M + _]);
             }
           }
@@ -427,120 +432,120 @@ class gt {
   _getOriginZoom(t) {
     return (t - this.points.length) % 32;
   }
-  _map(t, e, r) {
+  _map(t, e, n) {
     if (t[e + A] > 1) {
-      const a = this.clusterProps[t[e + tt]];
-      return r ? Object.assign({}, a) : a;
+      const a = this.clusterProps[t[e + et]];
+      return n ? Object.assign({}, a) : a;
     }
-    const i = this.points[t[e + E]].properties, o = this.options.map(i);
-    return r && o === i ? Object.assign({}, o) : o;
+    const o = this.points[t[e + E]].properties, i = this.options.map(o);
+    return n && i === o ? Object.assign({}, i) : i;
   }
 }
-function K(n, t, e) {
+function W(r, t, e) {
   return {
     type: "Feature",
-    id: n[t + E],
-    properties: et(n, t, e),
+    id: r[t + E],
+    properties: nt(r, t, e),
     geometry: {
       type: "Point",
-      coordinates: [mt(n[t]), yt(n[t + 1])]
+      coordinates: [yt(r[t]), wt(r[t + 1])]
     }
   };
 }
-function et(n, t, e) {
-  const r = n[t + A], i = r >= 1e4 ? `${Math.round(r / 1e3)}k` : r >= 1e3 ? `${Math.round(r / 100) / 10}k` : r, o = n[t + tt], a = o === -1 ? {} : Object.assign({}, e[o]);
+function nt(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 + et], a = i === -1 ? {} : Object.assign({}, e[i]);
   return Object.assign(a, {
     cluster: !0,
-    cluster_id: n[t + E],
-    point_count: r,
-    point_count_abbreviated: i
+    cluster_id: r[t + E],
+    point_count: n,
+    point_count_abbreviated: o
   });
 }
-function I(n) {
-  return n / 360 + 0.5;
+function I(r) {
+  return r / 360 + 0.5;
 }
-function B(n) {
-  const t = Math.sin(n * Math.PI / 180), e = 0.5 - 0.25 * Math.log((1 + t) / (1 - t)) / Math.PI;
+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 mt(n) {
-  return (n - 0.5) * 360;
+function yt(r) {
+  return (r - 0.5) * 360;
 }
-function yt(n) {
-  const t = (180 - n * 360) * Math.PI / 180;
+function wt(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 Y(n, t, e) {
-  for (e of n.keys())
-    if (T(e, t)) return e;
+var Y = Object.prototype.hasOwnProperty;
+function q(r, t, e) {
+  for (e of r.keys())
+    if (v(e, t)) return e;
 }
-function T(n, t) {
-  var e, r, i;
-  if (n === t) return !0;
-  if (n && t && (e = n.constructor) === t.constructor) {
-    if (e === Date) return n.getTime() === t.getTime();
-    if (e === RegExp) return n.toString() === t.toString();
+function v(r, t) {
+  var e, n, o;
+  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 ((r = n.length) === t.length)
-        for (; r-- && T(n[r], t[r]); ) ;
-      return r === -1;
+      if ((n = r.length) === t.length)
+        for (; n-- && v(r[n], t[n]); ) ;
+      return n === -1;
     }
     if (e === Set) {
-      if (n.size !== t.size)
+      if (r.size !== t.size)
         return !1;
-      for (r of n)
-        if (i = r, i && typeof i == "object" && (i = Y(t, i), !i) || !t.has(i)) return !1;
+      for (n of r)
+        if (o = n, o && typeof o == "object" && (o = q(t, o), !o) || !t.has(o)) return !1;
       return !0;
     }
     if (e === Map) {
-      if (n.size !== t.size)
+      if (r.size !== t.size)
         return !1;
-      for (r of n)
-        if (i = r[0], i && typeof i == "object" && (i = Y(t, i), !i) || !T(r[1], t.get(i)))
+      for (n of r)
+        if (o = n[0], o && typeof o == "object" && (o = q(t, o), !o) || !v(n[1], t.get(o)))
           return !1;
       return !0;
     }
     if (e === ArrayBuffer)
-      n = new Uint8Array(n), t = new Uint8Array(t);
+      r = new Uint8Array(r), t = new Uint8Array(t);
     else if (e === DataView) {
-      if ((r = n.byteLength) === t.byteLength)
-        for (; r-- && n.getInt8(r) === t.getInt8(r); ) ;
-      return r === -1;
+      if ((n = r.byteLength) === t.byteLength)
+        for (; n-- && r.getInt8(n) === t.getInt8(n); ) ;
+      return n === -1;
     }
-    if (ArrayBuffer.isView(n)) {
-      if ((r = n.byteLength) === t.byteLength)
-        for (; r-- && n[r] === t[r]; ) ;
-      return r === -1;
+    if (ArrayBuffer.isView(r)) {
+      if ((n = r.byteLength) === t.byteLength)
+        for (; n-- && r[n] === t[n]; ) ;
+      return n === -1;
     }
-    if (!e || typeof n == "object") {
-      r = 0;
-      for (e in n)
-        if (W.call(n, e) && ++r && !W.call(t, e) || !(e in t) || !T(n[e], t[e])) return !1;
-      return Object.keys(t).length === r;
+    if (!e || typeof r == "object") {
+      n = 0;
+      for (e in r)
+        if (Y.call(r, e) && ++n && !Y.call(t, e) || !(e in t) || !v(r[e], t[e])) return !1;
+      return Object.keys(t).length === n;
     }
   }
-  return n !== n && t !== t;
+  return r !== r && t !== t;
 }
-function wt(n) {
-  var t = F.useRef(n), e = F.useRef(0);
-  return T(n, t.current) || (t.current = n, e.current += 1), F.useMemo(function() {
+function Mt(r) {
+  var t = F.useRef(r), e = F.useRef(0);
+  return v(r, t.current) || (t.current = r, e.current += 1), F.useMemo(function() {
     return t.current;
   }, [e.current]);
 }
-function Mt(n, t) {
-  return F.useEffect(n, wt(t));
+function xt(r, t) {
+  return F.useEffect(r, Mt(t));
 }
-var xt = function(t) {
-  var e = t.points, r = t.bounds, i = t.zoom, o = t.options, a = t.disableRefresh, u = G(), s = G(), c = Q([]), p = c[0], h = c[1], l = Math.round(i);
-  return Mt(function() {
-    a !== !0 && ((!u.current || !T(s.current, e) || !T(u.current.options, o)) && (u.current = new gt(o), u.current.load(e)), r && h(u.current.getClusters(r, l)), s.current = e);
-  }, [e, r, l, o, a]), {
+var _t = function(t) {
+  var e = t.points, n = t.bounds, o = t.zoom, i = t.options, a = t.disableRefresh, u = G(), s = G(), c = Q([]), p = c[0], h = c[1], l = Math.round(o);
+  return xt(function() {
+    a !== !0 && ((!u.current || !v(s.current, e) || !v(u.current.options, i)) && (u.current = new mt(i), u.current.load(e)), n && h(u.current.getClusters(n, l)), s.current = e);
+  }, [e, n, l, i, a]), {
     clusters: p,
     supercluster: u.current
   };
 };
-const Ut = `
+const zt = `
   cursor-pointer
   relative
   h-7
@@ -550,7 +555,7 @@ const Ut = `
   transition-transform
 
   data-[is-cluster=true]:w-auto
-`, _t = `
+`, At = `
   cursor-pointer
   fill-primary-100
   stroke-1
@@ -559,23 +564,23 @@ const Ut = `
   transition-transform
   group-hover:stroke-base-white
   group-focus:stroke-base-white
-`, zt = `
+`, jt = `
   absolute top-1 left-1/2 transform -translate-x-1/2
   flex justify-center items-center rounded-full overflow-hidden
   transition-all w-3.5 h-3.5
 
   group-hover:bg-base-white
-`, jt = `
+`, Dt = `
   m-auto transition-all w-full h-full
   max-w-3.5 max-h-3.5
 
   group-hover:text-primary-100
   group-hover:max-w-2.5
   group-hover:max-h-2.5
-`, At = w(() => import("./index-DHw9gU4K.js")), Et = w(() => import("./index-BHjgd5HB.js")), bt = w(() => import("./index-BbrOUWDy.js")), vt = ({ markers: n, onClick: t, ...e }) => {
-  const { mapProvider: r, bounds: i } = R(), { clusters: o, supercluster: a } = xt({
-    points: n.map((c) => ft([c.longitude, c.latitude], c)),
-    bounds: i,
+`, Et = w(() => import("./index-92HhWupr.js")), bt = w(() => import("./index-ChwN5abO.js")), Tt = w(() => import("./index-D5-2anzJ.js")), vt = ({ markers: r, onClick: t, ...e }) => {
+  const { mapProvider: n, bounds: o } = R(), { clusters: i, supercluster: a } = _t({
+    points: r.map((c) => dt([c.longitude, c.latitude], c)),
+    bounds: o,
     zoom: 16,
     options: { radius: 50, maxZoom: 30 }
   }), u = (c) => {
@@ -598,73 +603,74 @@ const Ut = `
       markers: [c.properties]
     });
   }, s = L(() => {
-    switch (r == null ? void 0 : r.name) {
+    switch (n == null ? void 0 : n.name) {
       case "maptiler":
-        return At;
-      case "google":
         return Et;
-      case "mapbox":
+      case "google":
         return bt;
+      case "mapbox":
+        return Tt;
       default:
         return null;
     }
-  }, [r]);
-  return s ? /* @__PURE__ */ x(nt, { children: /* @__PURE__ */ x(s, { clusters: o, onClick: u, ...e, children: /* @__PURE__ */ x("svg", { viewBox: "0 0 20 28", fill: "none", className: _t, children: /* @__PURE__ */ x(
+  }, [n]);
+  return s ? /* @__PURE__ */ x(st, { children: /* @__PURE__ */ x(s, { clusters: i, onClick: u, ...e, children: /* @__PURE__ */ x("svg", { viewBox: "0 0 20 28", fill: "none", className: At, children: /* @__PURE__ */ x(
     "path",
     {
       d: "M20 10C20 15.5228 12 27.5 10 27.5C8 27.5 0 15.5228 0 10C0 4.47715 4.47715 0 10 0C15.5228 0 20 4.47715 20 10Z",
       fill: "inherit"
     }
   ) }) }) }) : null;
-}, Tt = w(() => import("./index-J1MKzGEM.js")), Pt = w(() => import("./index-BZ2605rA.js")), Ot = w(() => import("./index-B43MtiHH.js"));
-function St({ children: n, ...t }) {
-  const { mapProvider: e } = R(), r = L(() => {
+}, Ot = w(() => import("./index-J1MKzGEM.js")), Pt = w(() => import("./index-BZ2605rA.js")), St = w(() => import("./index-B43MtiHH.js"));
+function It({ children: r, ...t }) {
+  const { mapProvider: e } = R(), n = L(() => {
     switch (e == null ? void 0 : e.name) {
       case "maptiler":
-        return Tt;
+        return Ot;
       case "google":
         return Pt;
       case "mapbox":
-        return Ot;
+        return St;
       default:
         return null;
     }
   }, [e]);
-  return r ? /* @__PURE__ */ x(r, { ...t, children: n }) : null;
+  return n ? /* @__PURE__ */ x(n, { ...t, children: r }) : null;
 }
-const It = w(() => import("./index-CTk5bvm9.js")), Bt = w(() => import("./index-CPq7k7F4.js")), Ft = w(() => import("./index-DVitM43i.js"));
-function Lt(n) {
+const Bt = w(() => import("./index-CTk5bvm9.js")), Ft = w(() => import("./index-CPq7k7F4.js")), Lt = w(() => import("./index-DVitM43i.js"));
+function Rt(r) {
   const { mapProvider: t } = R(), e = L(() => {
     switch (t == null ? void 0 : t.name) {
       case "maptiler":
-        return It;
-      case "google":
         return Bt;
-      case "mapbox":
+      case "google":
         return Ft;
+      case "mapbox":
+        return Lt;
       default:
         return null;
     }
   }, [t]);
-  return e ? /* @__PURE__ */ x(e, { ...n }) : null;
+  return e ? /* @__PURE__ */ x(e, { ...r }) : null;
 }
-function Rt(n) {
+function Zt(r) {
   const [t, e] = Q();
-  return /* @__PURE__ */ x(q.Provider, { value: { ...n, bounds: t, setBounds: e }, children: n.children });
+  return /* @__PURE__ */ x(X.Provider, { value: { ...r, bounds: t, setBounds: e }, children: r.children });
 }
-const Dt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Nt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BaseMap: pt,
-  Layers: Lt,
+  BaseMap: lt,
+  Layers: Rt,
   Markers: vt,
-  Popup: St,
-  Root: Rt
+  Popup: It,
+  Root: Zt
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  jt as a,
+  V as a,
   Dt as b,
-  Ut as c,
+  zt as c,
   S as d,
-  zt as i,
+  Nt as e,
+  jt as i,
   R as u
 };