@mapsindoors/map-template 1.66.2 → 1.66.3

package/dist/route-travel-mode.enum-7f4ce9c7-0da65b8e.mjs

@@ -0,0 +1,16 @@
+import "./reactcomponent-fed5da4c.mjs";
+(function() {
+  try {
+    var n = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, i = new n.Error().stack;
+    i && (n._sentryDebugIds = n._sentryDebugIds || {}, n._sentryDebugIds[i] = "94111198-93f8-458c-b8c4-05ff2145f450", n._sentryDebugIdIdentifier = "sentry-dbid-94111198-93f8-458c-b8c4-05ff2145f450");
+  } catch {
+  }
+})();
+var f;
+(function(n) {
+  n.Walking = "walking", n.Bicycling = "bicycling", n.Transit = "transit", n.Driving = "driving";
+})(f || (f = {}));
+export {
+  f as R
+};
+//# sourceMappingURL=route-travel-mode.enum-7f4ce9c7-0da65b8e.mjs.map

package/dist/sort-order.enum-64ce8998-fb78d66a.mjs

@@ -0,0 +1,326 @@
+import { c as ve, a as te } from "./_commonjsHelpers-ba3f0406-b20f75c1.mjs";
+import "./reactcomponent-fed5da4c.mjs";
+(function() {
+  try {
+    var w = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, B = new w.Error().stack;
+    B && (w._sentryDebugIds = w._sentryDebugIds || {}, w._sentryDebugIds[B] = "c7b95bbe-09c5-45e0-8842-e8e69d0d3bfd", w._sentryDebugIdIdentifier = "sentry-dbid-c7b95bbe-09c5-45e0-8842-e8e69d0d3bfd");
+  } catch {
+  }
+})();
+var oe = ve(function(w) {
+  ((B, T) => {
+    w.exports ? w.exports = T() : B.fuzzysort = T();
+  })(te, (B) => {
+    var T = (a, e) => {
+      if (a == "farzher")
+        return { target: "farzher was here (^-^*)/", score: 0, _indexes: [0] };
+      if (!a || !e)
+        return d;
+      var n = Q(a);
+      k(e) || (e = p(e));
+      var i = n.bitflags;
+      return (i & e._bitflags) !== i ? d : A(n, e);
+    }, Z = (a, e, n) => {
+      if (a == "farzher")
+        return [{ target: "farzher was here (^-^*)/", score: 0, _indexes: [0], obj: e ? e[0] : d }];
+      if (!a)
+        return n && n.all ? j(a, e, n) : G;
+      var i = Q(a), f = i.bitflags, v = n && n.threshold || C, t = n && n.limit || q, r = 0, l = 0, s = e.length;
+      if (n && n.key)
+        for (var o = n.key, c = 0; c < s; ++c) {
+          var _ = e[c], g = M(_, o);
+          if (g && (k(g) || (g = p(g)), (f & g._bitflags) === f)) {
+            var x = A(i, g);
+            x !== d && (x.score < v || (x = { target: x.target, _targetLower: "", _targetLowerCodes: d, _nextBeginningIndexes: d, _bitflags: 0, score: x.score, _indexes: x._indexes, obj: _ }, r < t ? (b.add(x), ++r) : (++l, x.score > b.peek().score && b.replaceTop(x))));
+          }
+        }
+      else if (n && n.keys)
+        for (var y = n.scoreFn || ne, N = n.keys, P = N.length, c = 0; c < s; ++c) {
+          for (var _ = e[c], h = new Array(P), L = 0; L < P; ++L) {
+            var o = N[L], g = M(_, o);
+            if (!g) {
+              h[L] = d;
+              continue;
+            }
+            k(g) || (g = p(g)), (f & g._bitflags) !== f ? h[L] = d : h[L] = A(i, g);
+          }
+          h.obj = _;
+          var u = y(h);
+          u !== d && (u < v || (h.score = u, r < t ? (b.add(h), ++r) : (++l, u > b.peek().score && b.replaceTop(h))));
+        }
+      else
+        for (var c = 0; c < s; ++c) {
+          var g = e[c];
+          if (g && (k(g) || (g = p(g)), (f & g._bitflags) === f)) {
+            var x = A(i, g);
+            x !== d && (x.score < v || (r < t ? (b.add(x), ++r) : (++l, x.score > b.peek().score && b.replaceTop(x))));
+          }
+        }
+      if (r === 0)
+        return G;
+      for (var z = new Array(r), c = r - 1; c >= 0; --c)
+        z[c] = b.poll();
+      return z.total = r + l, z;
+    }, $ = (a, e, n) => {
+      if (typeof e == "function")
+        return U(a, e);
+      if (a === d)
+        return d;
+      e === void 0 && (e = "<b>"), n === void 0 && (n = "</b>");
+      var i = "", f = 0, v = !1, t = a.target, r = t.length, l = a._indexes;
+      l = l.slice(0, l.len).sort((c, _) => c - _);
+      for (var s = 0; s < r; ++s) {
+        var o = t[s];
+        if (l[f] === s) {
+          if (++f, v || (v = !0, i += e), f === l.length) {
+            i += o + n + t.substr(s + 1);
+            break;
+          }
+        } else
+          v && (v = !1, i += n);
+        i += o;
+      }
+      return i;
+    }, U = (s, e) => {
+      if (s === d)
+        return d;
+      var n = s.target, i = n.length, f = s._indexes;
+      f = f.slice(0, f.len).sort((_, g) => _ - g);
+      for (var v = "", t = 0, r = 0, l = !1, s = [], o = 0; o < i; ++o) {
+        var c = n[o];
+        if (f[r] === o) {
+          if (++r, l || (l = !0, s.push(v), v = ""), r === f.length) {
+            v += c, s.push(e(v, t++)), v = "", s.push(n.substr(o + 1));
+            break;
+          }
+        } else
+          l && (l = !1, s.push(e(v, t++)), v = "");
+        v += c;
+      }
+      return s;
+    }, O = (a) => a._indexes.slice(0, a._indexes.len).sort((e, n) => e - n), F = (a) => {
+      typeof a != "string" && (a = "");
+      var e = E(a);
+      return { target: a, _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _nextBeginningIndexes: d, _bitflags: e.bitflags, score: d, _indexes: [0], obj: d };
+    }, K = (a) => {
+      typeof a != "string" && (a = ""), a = a.trim();
+      var e = E(a), n = [];
+      if (e.containsSpace) {
+        var i = a.split(/\s+/);
+        i = [...new Set(i)];
+        for (var f = 0; f < i.length; f++)
+          if (i[f] !== "") {
+            var v = E(i[f]);
+            n.push({ lowerCodes: v.lowerCodes, _lower: i[f].toLowerCase(), containsSpace: !1 });
+          }
+      }
+      return { lowerCodes: e.lowerCodes, bitflags: e.bitflags, containsSpace: e.containsSpace, _lower: e._lower, spaceSearches: n };
+    }, p = (a) => {
+      if (a.length > 999)
+        return F(a);
+      var e = V.get(a);
+      return e !== void 0 || (e = F(a), V.set(a, e)), e;
+    }, Q = (a) => {
+      if (a.length > 999)
+        return K(a);
+      var e = X.get(a);
+      return e !== void 0 || (e = K(a), X.set(a, e)), e;
+    }, j = (a, e, n) => {
+      var i = [];
+      i.total = e.length;
+      var f = n && n.limit || q;
+      if (n && n.key)
+        for (var v = 0; v < e.length; v++) {
+          var t = e[v], r = M(t, n.key);
+          if (r) {
+            k(r) || (r = p(r)), r.score = C, r._indexes.len = 0;
+            var l = r;
+            if (l = { target: l.target, _targetLower: "", _targetLowerCodes: d, _nextBeginningIndexes: d, _bitflags: 0, score: r.score, _indexes: d, obj: t }, i.push(l), i.length >= f)
+              return i;
+          }
+        }
+      else if (n && n.keys)
+        for (var v = 0; v < e.length; v++) {
+          for (var t = e[v], s = new Array(n.keys.length), o = n.keys.length - 1; o >= 0; --o) {
+            var r = M(t, n.keys[o]);
+            if (!r) {
+              s[o] = d;
+              continue;
+            }
+            k(r) || (r = p(r)), r.score = C, r._indexes.len = 0, s[o] = r;
+          }
+          if (s.obj = t, s.score = C, i.push(s), i.length >= f)
+            return i;
+        }
+      else
+        for (var v = 0; v < e.length; v++) {
+          var r = e[v];
+          if (r && (k(r) || (r = p(r)), r.score = C, r._indexes.len = 0, i.push(r), i.length >= f))
+            return i;
+        }
+      return i;
+    }, A = (a, e, n = !1) => {
+      if (n === !1 && a.containsSpace)
+        return R(a, e);
+      for (var i = a._lower, f = a.lowerCodes, v = f[0], t = e._targetLowerCodes, r = f.length, l = t.length, _ = 0, s = 0, o = 0; ; ) {
+        var c = v === t[s];
+        if (c) {
+          if (m[o++] = s, ++_, _ === r)
+            break;
+          v = f[_];
+        }
+        if (++s, s >= l)
+          return d;
+      }
+      var _ = 0, g = !1, x = 0, y = e._nextBeginningIndexes;
+      y === d && (y = e._nextBeginningIndexes = re(e.target)), s = m[0] === 0 ? 0 : y[m[0] - 1];
+      var N = 0;
+      if (s !== l)
+        for (; ; )
+          if (s >= l) {
+            if (_ <= 0 || (++N, N > 200))
+              break;
+            --_;
+            var P = D[--x];
+            s = y[P];
+          } else {
+            var c = f[_] === t[s];
+            if (c) {
+              if (D[x++] = s, ++_, _ === r) {
+                g = !0;
+                break;
+              }
+              ++s;
+            } else
+              s = y[s];
+          }
+      var h = e._targetLower.indexOf(i, m[0]), L = ~h;
+      if (L && !g)
+        for (var u = 0; u < o; ++u)
+          m[u] = h + u;
+      var z = !1;
+      L && (z = e._nextBeginningIndexes[h - 1] === h);
+      {
+        if (g)
+          var S = D, H = x;
+        else
+          var S = m, H = o;
+        for (var I = 0, W = 0, u = 1; u < r; ++u)
+          S[u] - S[u - 1] !== 1 && (I -= S[u], ++W);
+        var fe = S[r - 1] - S[0] - (r - 1);
+        if (I -= (12 + fe) * W, S[0] !== 0 && (I -= S[0] * S[0] * 0.2), !g)
+          I *= 1e3;
+        else {
+          for (var J = 1, u = y[0]; u < l; u = y[u])
+            ++J;
+          J > 24 && (I *= (J - 24) * 10);
+        }
+        L && (I /= 1 + r * r * 1), z && (I /= 1 + r * r * 1), I -= l - r, e.score = I;
+        for (var u = 0; u < H; ++u)
+          e._indexes[u] = S[u];
+        return e._indexes.len = H, e;
+      }
+    }, R = (a, e) => {
+      for (var n = /* @__PURE__ */ new Set(), i = 0, f = d, v = 0, t = a.spaceSearches, o = 0; o < t.length; ++o) {
+        var r = t[o];
+        if (f = A(r, e), f === d)
+          return d;
+        i += f.score, f._indexes[0] < v && (i -= v - f._indexes[0]), v = f._indexes[0];
+        for (var l = 0; l < f._indexes.len; ++l)
+          n.add(f._indexes[l]);
+      }
+      var s = A(
+        a,
+        e,
+        /*allowSpaces=*/
+        !0
+      );
+      if (s !== d && s.score > i)
+        return s;
+      f.score = i;
+      var o = 0;
+      for (let c of n)
+        f._indexes[o++] = c;
+      return f._indexes.len = o, f;
+    }, E = (a) => {
+      for (var e = a.length, n = a.toLowerCase(), i = [], f = 0, v = !1, t = 0; t < e; ++t) {
+        var r = i[t] = n.charCodeAt(t);
+        if (r === 32) {
+          v = !0;
+          continue;
+        }
+        var l = r >= 97 && r <= 122 ? r - 97 : r >= 48 && r <= 57 ? 26 : r <= 127 ? 30 : 31;
+        f |= 1 << l;
+      }
+      return { lowerCodes: i, bitflags: f, containsSpace: v, _lower: n };
+    }, ee = (a) => {
+      for (var e = a.length, n = [], i = 0, f = !1, v = !1, t = 0; t < e; ++t) {
+        var r = a.charCodeAt(t), l = r >= 65 && r <= 90, s = l || r >= 97 && r <= 122 || r >= 48 && r <= 57, o = l && !f || !v || !s;
+        f = l, v = s, o && (n[i++] = t);
+      }
+      return n;
+    }, re = (a) => {
+      for (var e = a.length, n = ee(a), i = [], f = n[0], v = 0, t = 0; t < e; ++t)
+        f > t ? i[t] = f : (f = n[++v], i[t] = f === void 0 ? e : f);
+      return i;
+    }, ae = () => {
+      V.clear(), X.clear(), m = [], D = [];
+    }, V = /* @__PURE__ */ new Map(), X = /* @__PURE__ */ new Map(), m = [], D = [], ne = (a) => {
+      for (var e = C, n = a.length, i = 0; i < n; ++i) {
+        var f = a[i];
+        if (f !== d) {
+          var v = f.score;
+          v > e && (e = v);
+        }
+      }
+      return e === C ? d : e;
+    }, M = (a, e) => {
+      var n = a[e];
+      if (n !== void 0)
+        return n;
+      var i = e;
+      Array.isArray(e) || (i = e.split("."));
+      for (var f = i.length, v = -1; a && ++v < f; )
+        a = a[i[v]];
+      return a;
+    }, k = (a) => typeof a == "object", q = 1 / 0, C = -q, G = [];
+    G.total = 0;
+    var d = null, ie = (a) => {
+      var e = [], n = 0, i = {}, f = (v) => {
+        for (var t = 0, r = e[t], l = 1; l < n; ) {
+          var s = l + 1;
+          t = l, s < n && e[s].score < e[l].score && (t = s), e[t - 1 >> 1] = e[t], l = 1 + (t << 1);
+        }
+        for (var o = t - 1 >> 1; t > 0 && r.score < e[o].score; o = (t = o) - 1 >> 1)
+          e[t] = e[o];
+        e[t] = r;
+      };
+      return i.add = (v) => {
+        var t = n;
+        e[n++] = v;
+        for (var r = t - 1 >> 1; t > 0 && v.score < e[r].score; r = (t = r) - 1 >> 1)
+          e[t] = e[r];
+        e[t] = v;
+      }, i.poll = (v) => {
+        if (n !== 0) {
+          var t = e[0];
+          return e[0] = e[--n], f(), t;
+        }
+      }, i.peek = (v) => {
+        if (n !== 0)
+          return e[0];
+      }, i.replaceTop = (v) => {
+        e[0] = v, f();
+      }, i;
+    }, b = ie();
+    return { single: T, go: Z, highlight: $, prepare: F, indexes: O, cleanup: ae };
+  });
+}), Y;
+(function(w) {
+  w.Asc = "asc", w.Desc = "desc";
+})(Y || (Y = {}));
+export {
+  Y as S,
+  oe as f
+};
+//# sourceMappingURL=sort-order.enum-64ce8998-fb78d66a.mjs.map

package/dist/unit-system.enum-eaefb53e-5d1cf129.mjs

@@ -0,0 +1,16 @@
+import "./reactcomponent-fed5da4c.mjs";
+(function() {
+  try {
+    var e = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, d = new e.Error().stack;
+    d && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[d] = "2fd6c030-7bb7-401c-a871-5584ba0fb24d", e._sentryDebugIdIdentifier = "sentry-dbid-2fd6c030-7bb7-401c-a871-5584ba0fb24d");
+  } catch {
+  }
+})();
+var n;
+(function(e) {
+  e.Imperial = "imperial", e.Metric = "metric";
+})(n || (n = {}));
+export {
+  n as U
+};
+//# sourceMappingURL=unit-system.enum-eaefb53e-5d1cf129.mjs.map

package/dist/utils-ae714467-4f4e3a56.mjs

@@ -0,0 +1,45 @@
+import "./reactcomponent-fed5da4c.mjs";
+(function() {
+  try {
+    var e = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, n = new e.Error().stack;
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "cb143716-c7fc-47f9-a337-623b10f32524", e._sentryDebugIdIdentifier = "sentry-dbid-cb143716-c7fc-47f9-a337-623b10f32524");
+  } catch {
+  }
+})();
+function c(e) {
+  return e !== null && e > "" && !isNaN(Number(e));
+}
+function d(e) {
+  return Number(e).toLocaleString(void 0, { minimumFractionDigits: 0 });
+}
+function f(e) {
+  return e == null;
+}
+function m() {
+  return !!(navigator.userAgent.match(/Trident/g) || navigator.userAgent.match(/MSIE/g));
+}
+function o(e) {
+  try {
+    return new URL(e), !0;
+  } catch {
+    return !1;
+  }
+}
+function l(e, n) {
+  if (o(e) === !1)
+    return;
+  const t = new URL(e), r = t.hostname;
+  if (r === "image.mapsindoors.com") {
+    const a = Math.max(2, window.devicePixelRatio || 1), s = n * a, i = n * a;
+    t.searchParams.set("width", s.toString()), t.searchParams.set("height", i.toString()), t.searchParams.set("fitMode", "cover");
+  }
+  return ["app.mapsindoors.com", "v2.mapsindoors.com"].includes(r) && t.searchParams.set("scale", "2"), t.toString();
+}
+export {
+  c as a,
+  l as b,
+  m as c,
+  d as f,
+  f as i
+};
+//# sourceMappingURL=utils-ae714467-4f4e3a56.mjs.map

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@mapsindoors/map-template",
   "description": "Get a MapsIndoors map up and running in less than 10 mins.",
-  "version": "1.66.2",
+  "version": "1.66.3",
   "private": false,
   "files": [
     "dist/*.js",