@mapsindoors/map-template 1.66.0 → 1.66.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/mapsindoors-react.es.js +59824 -7
- package/dist/mapsindoors-react.umd.js +491 -560
- package/dist/mapsindoors-webcomponent.es.js +39970 -51199
- package/dist/mapsindoors-webcomponent.umd.js +480 -554
- package/package.json +6 -4
- package/dist/_commonjsHelpers-ba3f0406-b177c122.mjs +0 -30
- package/dist/combo-box-item.entry-9b982e8c.mjs +0 -22
- package/dist/icon-b8d01d6f-a7517024.mjs +0 -33
- package/dist/mi-card_2.entry-e26ef04d.mjs +0 -33
- package/dist/mi-chip.entry-cdb7e39c.mjs +0 -26
- package/dist/mi-column.entry-292211cb.mjs +0 -28
- package/dist/mi-combo-box.entry-c969e712.mjs +0 -270
- package/dist/mi-data-table.entry-8b2850dd.mjs +0 -231
- package/dist/mi-distance_2.entry-f00f425b.mjs +0 -346
- package/dist/mi-dropdown-item.entry-59303d02.mjs +0 -22
- package/dist/mi-dropdown.entry-bee1749d.mjs +0 -331
- package/dist/mi-floor-selector.entry-4e8b95b2.mjs +0 -122
- package/dist/mi-keyboard.entry-48ff850f.mjs +0 -3048
- package/dist/mi-list-item-category.entry-cfc47430.mjs +0 -46
- package/dist/mi-list-item-location.entry-6b5c4bc1.mjs +0 -144
- package/dist/mi-list.entry-0ed8f950.mjs +0 -49
- package/dist/mi-location-booking.entry-ad586693.mjs +0 -4873
- package/dist/mi-location-info.entry-638658ec.mjs +0 -39
- package/dist/mi-map-googlemaps.entry-21520a21.mjs +0 -406
- package/dist/mi-map-mapbox.entry-59fb70af.mjs +0 -308
- package/dist/mi-metric-card.entry-d71eb47f.mjs +0 -36
- package/dist/mi-my-position.entry-3cfdf5c0.mjs +0 -1406
- package/dist/mi-notification.entry-43a2513d.mjs +0 -91
- package/dist/mi-route-instructions-heading.entry-44d0821c.mjs +0 -82
- package/dist/mi-route-instructions-maneuver-legacy.entry-4c173878.mjs +0 -83
- package/dist/mi-route-instructions-maneuver.entry-bc47957a.mjs +0 -83
- package/dist/mi-route-instructions-step-legacy.entry-aaac79d0.mjs +0 -209
- package/dist/mi-route-instructions-step.entry-f86b55bf.mjs +0 -244
- package/dist/mi-route-instructions.entry-92ffcedb.mjs +0 -150
- package/dist/mi-scroll-buttons.entry-6491dd8f.mjs +0 -86
- package/dist/mi-search.entry-67e073b6.mjs +0 -258
- package/dist/mi-share-sms.entry-9744b5f5.mjs +0 -63
- package/dist/mi-step-switcher.entry-63c969ca.mjs +0 -34
- package/dist/mi-tab-panel.entry-d5e78add.mjs +0 -29
- package/dist/mi-tab.entry-7f290119.mjs +0 -21
- package/dist/mi-tabs.entry-4a660558.mjs +0 -44
- package/dist/mi-time.entry-f8deb036.mjs +0 -53
- package/dist/mi-variables-9a6c8d4d-6f6e1dd9.mjs +0 -16
- package/dist/reactcomponent-ad7142b4.mjs +0 -57763
- package/dist/route-travel-mode.enum-7f4ce9c7-f43c56e7.mjs +0 -16
- package/dist/sort-order.enum-64ce8998-958536ad.mjs +0 -326
- package/dist/unit-system.enum-eaefb53e-2fda1d29.mjs +0 -16
- package/dist/utils-ae714467-b97fee1b.mjs +0 -45
|
@@ -1,16 +0,0 @@
|
|
|
1
|
-
import "./reactcomponent-ad7142b4.mjs";
|
|
2
|
-
(function() {
|
|
3
|
-
try {
|
|
4
|
-
var n = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, i = new n.Error().stack;
|
|
5
|
-
i && (n._sentryDebugIds = n._sentryDebugIds || {}, n._sentryDebugIds[i] = "94111198-93f8-458c-b8c4-05ff2145f450", n._sentryDebugIdIdentifier = "sentry-dbid-94111198-93f8-458c-b8c4-05ff2145f450");
|
|
6
|
-
} catch {
|
|
7
|
-
}
|
|
8
|
-
})();
|
|
9
|
-
var f;
|
|
10
|
-
(function(n) {
|
|
11
|
-
n.Walking = "walking", n.Bicycling = "bicycling", n.Transit = "transit", n.Driving = "driving";
|
|
12
|
-
})(f || (f = {}));
|
|
13
|
-
export {
|
|
14
|
-
f as R
|
|
15
|
-
};
|
|
16
|
-
//# sourceMappingURL=route-travel-mode.enum-7f4ce9c7-f43c56e7.mjs.map
|
|
@@ -1,326 +0,0 @@
|
|
|
1
|
-
import { c as ve, a as te } from "./_commonjsHelpers-ba3f0406-b177c122.mjs";
|
|
2
|
-
import "./reactcomponent-ad7142b4.mjs";
|
|
3
|
-
(function() {
|
|
4
|
-
try {
|
|
5
|
-
var w = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, B = new w.Error().stack;
|
|
6
|
-
B && (w._sentryDebugIds = w._sentryDebugIds || {}, w._sentryDebugIds[B] = "c7b95bbe-09c5-45e0-8842-e8e69d0d3bfd", w._sentryDebugIdIdentifier = "sentry-dbid-c7b95bbe-09c5-45e0-8842-e8e69d0d3bfd");
|
|
7
|
-
} catch {
|
|
8
|
-
}
|
|
9
|
-
})();
|
|
10
|
-
var oe = ve(function(w) {
|
|
11
|
-
((B, T) => {
|
|
12
|
-
w.exports ? w.exports = T() : B.fuzzysort = T();
|
|
13
|
-
})(te, (B) => {
|
|
14
|
-
var T = (a, e) => {
|
|
15
|
-
if (a == "farzher")
|
|
16
|
-
return { target: "farzher was here (^-^*)/", score: 0, _indexes: [0] };
|
|
17
|
-
if (!a || !e)
|
|
18
|
-
return d;
|
|
19
|
-
var n = Q(a);
|
|
20
|
-
k(e) || (e = p(e));
|
|
21
|
-
var i = n.bitflags;
|
|
22
|
-
return (i & e._bitflags) !== i ? d : A(n, e);
|
|
23
|
-
}, Z = (a, e, n) => {
|
|
24
|
-
if (a == "farzher")
|
|
25
|
-
return [{ target: "farzher was here (^-^*)/", score: 0, _indexes: [0], obj: e ? e[0] : d }];
|
|
26
|
-
if (!a)
|
|
27
|
-
return n && n.all ? j(a, e, n) : G;
|
|
28
|
-
var i = Q(a), f = i.bitflags, v = n && n.threshold || C, t = n && n.limit || q, r = 0, l = 0, s = e.length;
|
|
29
|
-
if (n && n.key)
|
|
30
|
-
for (var o = n.key, c = 0; c < s; ++c) {
|
|
31
|
-
var _ = e[c], g = M(_, o);
|
|
32
|
-
if (g && (k(g) || (g = p(g)), (f & g._bitflags) === f)) {
|
|
33
|
-
var x = A(i, g);
|
|
34
|
-
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))));
|
|
35
|
-
}
|
|
36
|
-
}
|
|
37
|
-
else if (n && n.keys)
|
|
38
|
-
for (var y = n.scoreFn || ne, N = n.keys, P = N.length, c = 0; c < s; ++c) {
|
|
39
|
-
for (var _ = e[c], h = new Array(P), L = 0; L < P; ++L) {
|
|
40
|
-
var o = N[L], g = M(_, o);
|
|
41
|
-
if (!g) {
|
|
42
|
-
h[L] = d;
|
|
43
|
-
continue;
|
|
44
|
-
}
|
|
45
|
-
k(g) || (g = p(g)), (f & g._bitflags) !== f ? h[L] = d : h[L] = A(i, g);
|
|
46
|
-
}
|
|
47
|
-
h.obj = _;
|
|
48
|
-
var u = y(h);
|
|
49
|
-
u !== d && (u < v || (h.score = u, r < t ? (b.add(h), ++r) : (++l, u > b.peek().score && b.replaceTop(h))));
|
|
50
|
-
}
|
|
51
|
-
else
|
|
52
|
-
for (var c = 0; c < s; ++c) {
|
|
53
|
-
var g = e[c];
|
|
54
|
-
if (g && (k(g) || (g = p(g)), (f & g._bitflags) === f)) {
|
|
55
|
-
var x = A(i, g);
|
|
56
|
-
x !== d && (x.score < v || (r < t ? (b.add(x), ++r) : (++l, x.score > b.peek().score && b.replaceTop(x))));
|
|
57
|
-
}
|
|
58
|
-
}
|
|
59
|
-
if (r === 0)
|
|
60
|
-
return G;
|
|
61
|
-
for (var z = new Array(r), c = r - 1; c >= 0; --c)
|
|
62
|
-
z[c] = b.poll();
|
|
63
|
-
return z.total = r + l, z;
|
|
64
|
-
}, $ = (a, e, n) => {
|
|
65
|
-
if (typeof e == "function")
|
|
66
|
-
return U(a, e);
|
|
67
|
-
if (a === d)
|
|
68
|
-
return d;
|
|
69
|
-
e === void 0 && (e = "<b>"), n === void 0 && (n = "</b>");
|
|
70
|
-
var i = "", f = 0, v = !1, t = a.target, r = t.length, l = a._indexes;
|
|
71
|
-
l = l.slice(0, l.len).sort((c, _) => c - _);
|
|
72
|
-
for (var s = 0; s < r; ++s) {
|
|
73
|
-
var o = t[s];
|
|
74
|
-
if (l[f] === s) {
|
|
75
|
-
if (++f, v || (v = !0, i += e), f === l.length) {
|
|
76
|
-
i += o + n + t.substr(s + 1);
|
|
77
|
-
break;
|
|
78
|
-
}
|
|
79
|
-
} else
|
|
80
|
-
v && (v = !1, i += n);
|
|
81
|
-
i += o;
|
|
82
|
-
}
|
|
83
|
-
return i;
|
|
84
|
-
}, U = (s, e) => {
|
|
85
|
-
if (s === d)
|
|
86
|
-
return d;
|
|
87
|
-
var n = s.target, i = n.length, f = s._indexes;
|
|
88
|
-
f = f.slice(0, f.len).sort((_, g) => _ - g);
|
|
89
|
-
for (var v = "", t = 0, r = 0, l = !1, s = [], o = 0; o < i; ++o) {
|
|
90
|
-
var c = n[o];
|
|
91
|
-
if (f[r] === o) {
|
|
92
|
-
if (++r, l || (l = !0, s.push(v), v = ""), r === f.length) {
|
|
93
|
-
v += c, s.push(e(v, t++)), v = "", s.push(n.substr(o + 1));
|
|
94
|
-
break;
|
|
95
|
-
}
|
|
96
|
-
} else
|
|
97
|
-
l && (l = !1, s.push(e(v, t++)), v = "");
|
|
98
|
-
v += c;
|
|
99
|
-
}
|
|
100
|
-
return s;
|
|
101
|
-
}, O = (a) => a._indexes.slice(0, a._indexes.len).sort((e, n) => e - n), F = (a) => {
|
|
102
|
-
typeof a != "string" && (a = "");
|
|
103
|
-
var e = E(a);
|
|
104
|
-
return { target: a, _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _nextBeginningIndexes: d, _bitflags: e.bitflags, score: d, _indexes: [0], obj: d };
|
|
105
|
-
}, K = (a) => {
|
|
106
|
-
typeof a != "string" && (a = ""), a = a.trim();
|
|
107
|
-
var e = E(a), n = [];
|
|
108
|
-
if (e.containsSpace) {
|
|
109
|
-
var i = a.split(/\s+/);
|
|
110
|
-
i = [...new Set(i)];
|
|
111
|
-
for (var f = 0; f < i.length; f++)
|
|
112
|
-
if (i[f] !== "") {
|
|
113
|
-
var v = E(i[f]);
|
|
114
|
-
n.push({ lowerCodes: v.lowerCodes, _lower: i[f].toLowerCase(), containsSpace: !1 });
|
|
115
|
-
}
|
|
116
|
-
}
|
|
117
|
-
return { lowerCodes: e.lowerCodes, bitflags: e.bitflags, containsSpace: e.containsSpace, _lower: e._lower, spaceSearches: n };
|
|
118
|
-
}, p = (a) => {
|
|
119
|
-
if (a.length > 999)
|
|
120
|
-
return F(a);
|
|
121
|
-
var e = V.get(a);
|
|
122
|
-
return e !== void 0 || (e = F(a), V.set(a, e)), e;
|
|
123
|
-
}, Q = (a) => {
|
|
124
|
-
if (a.length > 999)
|
|
125
|
-
return K(a);
|
|
126
|
-
var e = X.get(a);
|
|
127
|
-
return e !== void 0 || (e = K(a), X.set(a, e)), e;
|
|
128
|
-
}, j = (a, e, n) => {
|
|
129
|
-
var i = [];
|
|
130
|
-
i.total = e.length;
|
|
131
|
-
var f = n && n.limit || q;
|
|
132
|
-
if (n && n.key)
|
|
133
|
-
for (var v = 0; v < e.length; v++) {
|
|
134
|
-
var t = e[v], r = M(t, n.key);
|
|
135
|
-
if (r) {
|
|
136
|
-
k(r) || (r = p(r)), r.score = C, r._indexes.len = 0;
|
|
137
|
-
var l = r;
|
|
138
|
-
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)
|
|
139
|
-
return i;
|
|
140
|
-
}
|
|
141
|
-
}
|
|
142
|
-
else if (n && n.keys)
|
|
143
|
-
for (var v = 0; v < e.length; v++) {
|
|
144
|
-
for (var t = e[v], s = new Array(n.keys.length), o = n.keys.length - 1; o >= 0; --o) {
|
|
145
|
-
var r = M(t, n.keys[o]);
|
|
146
|
-
if (!r) {
|
|
147
|
-
s[o] = d;
|
|
148
|
-
continue;
|
|
149
|
-
}
|
|
150
|
-
k(r) || (r = p(r)), r.score = C, r._indexes.len = 0, s[o] = r;
|
|
151
|
-
}
|
|
152
|
-
if (s.obj = t, s.score = C, i.push(s), i.length >= f)
|
|
153
|
-
return i;
|
|
154
|
-
}
|
|
155
|
-
else
|
|
156
|
-
for (var v = 0; v < e.length; v++) {
|
|
157
|
-
var r = e[v];
|
|
158
|
-
if (r && (k(r) || (r = p(r)), r.score = C, r._indexes.len = 0, i.push(r), i.length >= f))
|
|
159
|
-
return i;
|
|
160
|
-
}
|
|
161
|
-
return i;
|
|
162
|
-
}, A = (a, e, n = !1) => {
|
|
163
|
-
if (n === !1 && a.containsSpace)
|
|
164
|
-
return R(a, e);
|
|
165
|
-
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; ; ) {
|
|
166
|
-
var c = v === t[s];
|
|
167
|
-
if (c) {
|
|
168
|
-
if (m[o++] = s, ++_, _ === r)
|
|
169
|
-
break;
|
|
170
|
-
v = f[_];
|
|
171
|
-
}
|
|
172
|
-
if (++s, s >= l)
|
|
173
|
-
return d;
|
|
174
|
-
}
|
|
175
|
-
var _ = 0, g = !1, x = 0, y = e._nextBeginningIndexes;
|
|
176
|
-
y === d && (y = e._nextBeginningIndexes = re(e.target)), s = m[0] === 0 ? 0 : y[m[0] - 1];
|
|
177
|
-
var N = 0;
|
|
178
|
-
if (s !== l)
|
|
179
|
-
for (; ; )
|
|
180
|
-
if (s >= l) {
|
|
181
|
-
if (_ <= 0 || (++N, N > 200))
|
|
182
|
-
break;
|
|
183
|
-
--_;
|
|
184
|
-
var P = D[--x];
|
|
185
|
-
s = y[P];
|
|
186
|
-
} else {
|
|
187
|
-
var c = f[_] === t[s];
|
|
188
|
-
if (c) {
|
|
189
|
-
if (D[x++] = s, ++_, _ === r) {
|
|
190
|
-
g = !0;
|
|
191
|
-
break;
|
|
192
|
-
}
|
|
193
|
-
++s;
|
|
194
|
-
} else
|
|
195
|
-
s = y[s];
|
|
196
|
-
}
|
|
197
|
-
var h = e._targetLower.indexOf(i, m[0]), L = ~h;
|
|
198
|
-
if (L && !g)
|
|
199
|
-
for (var u = 0; u < o; ++u)
|
|
200
|
-
m[u] = h + u;
|
|
201
|
-
var z = !1;
|
|
202
|
-
L && (z = e._nextBeginningIndexes[h - 1] === h);
|
|
203
|
-
{
|
|
204
|
-
if (g)
|
|
205
|
-
var S = D, H = x;
|
|
206
|
-
else
|
|
207
|
-
var S = m, H = o;
|
|
208
|
-
for (var I = 0, W = 0, u = 1; u < r; ++u)
|
|
209
|
-
S[u] - S[u - 1] !== 1 && (I -= S[u], ++W);
|
|
210
|
-
var fe = S[r - 1] - S[0] - (r - 1);
|
|
211
|
-
if (I -= (12 + fe) * W, S[0] !== 0 && (I -= S[0] * S[0] * 0.2), !g)
|
|
212
|
-
I *= 1e3;
|
|
213
|
-
else {
|
|
214
|
-
for (var J = 1, u = y[0]; u < l; u = y[u])
|
|
215
|
-
++J;
|
|
216
|
-
J > 24 && (I *= (J - 24) * 10);
|
|
217
|
-
}
|
|
218
|
-
L && (I /= 1 + r * r * 1), z && (I /= 1 + r * r * 1), I -= l - r, e.score = I;
|
|
219
|
-
for (var u = 0; u < H; ++u)
|
|
220
|
-
e._indexes[u] = S[u];
|
|
221
|
-
return e._indexes.len = H, e;
|
|
222
|
-
}
|
|
223
|
-
}, R = (a, e) => {
|
|
224
|
-
for (var n = /* @__PURE__ */ new Set(), i = 0, f = d, v = 0, t = a.spaceSearches, o = 0; o < t.length; ++o) {
|
|
225
|
-
var r = t[o];
|
|
226
|
-
if (f = A(r, e), f === d)
|
|
227
|
-
return d;
|
|
228
|
-
i += f.score, f._indexes[0] < v && (i -= v - f._indexes[0]), v = f._indexes[0];
|
|
229
|
-
for (var l = 0; l < f._indexes.len; ++l)
|
|
230
|
-
n.add(f._indexes[l]);
|
|
231
|
-
}
|
|
232
|
-
var s = A(
|
|
233
|
-
a,
|
|
234
|
-
e,
|
|
235
|
-
/*allowSpaces=*/
|
|
236
|
-
!0
|
|
237
|
-
);
|
|
238
|
-
if (s !== d && s.score > i)
|
|
239
|
-
return s;
|
|
240
|
-
f.score = i;
|
|
241
|
-
var o = 0;
|
|
242
|
-
for (let c of n)
|
|
243
|
-
f._indexes[o++] = c;
|
|
244
|
-
return f._indexes.len = o, f;
|
|
245
|
-
}, E = (a) => {
|
|
246
|
-
for (var e = a.length, n = a.toLowerCase(), i = [], f = 0, v = !1, t = 0; t < e; ++t) {
|
|
247
|
-
var r = i[t] = n.charCodeAt(t);
|
|
248
|
-
if (r === 32) {
|
|
249
|
-
v = !0;
|
|
250
|
-
continue;
|
|
251
|
-
}
|
|
252
|
-
var l = r >= 97 && r <= 122 ? r - 97 : r >= 48 && r <= 57 ? 26 : r <= 127 ? 30 : 31;
|
|
253
|
-
f |= 1 << l;
|
|
254
|
-
}
|
|
255
|
-
return { lowerCodes: i, bitflags: f, containsSpace: v, _lower: n };
|
|
256
|
-
}, ee = (a) => {
|
|
257
|
-
for (var e = a.length, n = [], i = 0, f = !1, v = !1, t = 0; t < e; ++t) {
|
|
258
|
-
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;
|
|
259
|
-
f = l, v = s, o && (n[i++] = t);
|
|
260
|
-
}
|
|
261
|
-
return n;
|
|
262
|
-
}, re = (a) => {
|
|
263
|
-
for (var e = a.length, n = ee(a), i = [], f = n[0], v = 0, t = 0; t < e; ++t)
|
|
264
|
-
f > t ? i[t] = f : (f = n[++v], i[t] = f === void 0 ? e : f);
|
|
265
|
-
return i;
|
|
266
|
-
}, ae = () => {
|
|
267
|
-
V.clear(), X.clear(), m = [], D = [];
|
|
268
|
-
}, V = /* @__PURE__ */ new Map(), X = /* @__PURE__ */ new Map(), m = [], D = [], ne = (a) => {
|
|
269
|
-
for (var e = C, n = a.length, i = 0; i < n; ++i) {
|
|
270
|
-
var f = a[i];
|
|
271
|
-
if (f !== d) {
|
|
272
|
-
var v = f.score;
|
|
273
|
-
v > e && (e = v);
|
|
274
|
-
}
|
|
275
|
-
}
|
|
276
|
-
return e === C ? d : e;
|
|
277
|
-
}, M = (a, e) => {
|
|
278
|
-
var n = a[e];
|
|
279
|
-
if (n !== void 0)
|
|
280
|
-
return n;
|
|
281
|
-
var i = e;
|
|
282
|
-
Array.isArray(e) || (i = e.split("."));
|
|
283
|
-
for (var f = i.length, v = -1; a && ++v < f; )
|
|
284
|
-
a = a[i[v]];
|
|
285
|
-
return a;
|
|
286
|
-
}, k = (a) => typeof a == "object", q = 1 / 0, C = -q, G = [];
|
|
287
|
-
G.total = 0;
|
|
288
|
-
var d = null, ie = (a) => {
|
|
289
|
-
var e = [], n = 0, i = {}, f = (v) => {
|
|
290
|
-
for (var t = 0, r = e[t], l = 1; l < n; ) {
|
|
291
|
-
var s = l + 1;
|
|
292
|
-
t = l, s < n && e[s].score < e[l].score && (t = s), e[t - 1 >> 1] = e[t], l = 1 + (t << 1);
|
|
293
|
-
}
|
|
294
|
-
for (var o = t - 1 >> 1; t > 0 && r.score < e[o].score; o = (t = o) - 1 >> 1)
|
|
295
|
-
e[t] = e[o];
|
|
296
|
-
e[t] = r;
|
|
297
|
-
};
|
|
298
|
-
return i.add = (v) => {
|
|
299
|
-
var t = n;
|
|
300
|
-
e[n++] = v;
|
|
301
|
-
for (var r = t - 1 >> 1; t > 0 && v.score < e[r].score; r = (t = r) - 1 >> 1)
|
|
302
|
-
e[t] = e[r];
|
|
303
|
-
e[t] = v;
|
|
304
|
-
}, i.poll = (v) => {
|
|
305
|
-
if (n !== 0) {
|
|
306
|
-
var t = e[0];
|
|
307
|
-
return e[0] = e[--n], f(), t;
|
|
308
|
-
}
|
|
309
|
-
}, i.peek = (v) => {
|
|
310
|
-
if (n !== 0)
|
|
311
|
-
return e[0];
|
|
312
|
-
}, i.replaceTop = (v) => {
|
|
313
|
-
e[0] = v, f();
|
|
314
|
-
}, i;
|
|
315
|
-
}, b = ie();
|
|
316
|
-
return { single: T, go: Z, highlight: $, prepare: F, indexes: O, cleanup: ae };
|
|
317
|
-
});
|
|
318
|
-
}), Y;
|
|
319
|
-
(function(w) {
|
|
320
|
-
w.Asc = "asc", w.Desc = "desc";
|
|
321
|
-
})(Y || (Y = {}));
|
|
322
|
-
export {
|
|
323
|
-
Y as S,
|
|
324
|
-
oe as f
|
|
325
|
-
};
|
|
326
|
-
//# sourceMappingURL=sort-order.enum-64ce8998-958536ad.mjs.map
|
|
@@ -1,16 +0,0 @@
|
|
|
1
|
-
import "./reactcomponent-ad7142b4.mjs";
|
|
2
|
-
(function() {
|
|
3
|
-
try {
|
|
4
|
-
var e = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, d = new e.Error().stack;
|
|
5
|
-
d && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[d] = "2fd6c030-7bb7-401c-a871-5584ba0fb24d", e._sentryDebugIdIdentifier = "sentry-dbid-2fd6c030-7bb7-401c-a871-5584ba0fb24d");
|
|
6
|
-
} catch {
|
|
7
|
-
}
|
|
8
|
-
})();
|
|
9
|
-
var n;
|
|
10
|
-
(function(e) {
|
|
11
|
-
e.Imperial = "imperial", e.Metric = "metric";
|
|
12
|
-
})(n || (n = {}));
|
|
13
|
-
export {
|
|
14
|
-
n as U
|
|
15
|
-
};
|
|
16
|
-
//# sourceMappingURL=unit-system.enum-eaefb53e-2fda1d29.mjs.map
|
|
@@ -1,45 +0,0 @@
|
|
|
1
|
-
import "./reactcomponent-ad7142b4.mjs";
|
|
2
|
-
(function() {
|
|
3
|
-
try {
|
|
4
|
-
var e = typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, n = new e.Error().stack;
|
|
5
|
-
n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "cb143716-c7fc-47f9-a337-623b10f32524", e._sentryDebugIdIdentifier = "sentry-dbid-cb143716-c7fc-47f9-a337-623b10f32524");
|
|
6
|
-
} catch {
|
|
7
|
-
}
|
|
8
|
-
})();
|
|
9
|
-
function c(e) {
|
|
10
|
-
return e !== null && e > "" && !isNaN(Number(e));
|
|
11
|
-
}
|
|
12
|
-
function d(e) {
|
|
13
|
-
return Number(e).toLocaleString(void 0, { minimumFractionDigits: 0 });
|
|
14
|
-
}
|
|
15
|
-
function f(e) {
|
|
16
|
-
return e == null;
|
|
17
|
-
}
|
|
18
|
-
function m() {
|
|
19
|
-
return !!(navigator.userAgent.match(/Trident/g) || navigator.userAgent.match(/MSIE/g));
|
|
20
|
-
}
|
|
21
|
-
function o(e) {
|
|
22
|
-
try {
|
|
23
|
-
return new URL(e), !0;
|
|
24
|
-
} catch {
|
|
25
|
-
return !1;
|
|
26
|
-
}
|
|
27
|
-
}
|
|
28
|
-
function l(e, n) {
|
|
29
|
-
if (o(e) === !1)
|
|
30
|
-
return;
|
|
31
|
-
const t = new URL(e), r = t.hostname;
|
|
32
|
-
if (r === "image.mapsindoors.com") {
|
|
33
|
-
const a = Math.max(2, window.devicePixelRatio || 1), s = n * a, i = n * a;
|
|
34
|
-
t.searchParams.set("width", s.toString()), t.searchParams.set("height", i.toString()), t.searchParams.set("fitMode", "cover");
|
|
35
|
-
}
|
|
36
|
-
return ["app.mapsindoors.com", "v2.mapsindoors.com"].includes(r) && t.searchParams.set("scale", "2"), t.toString();
|
|
37
|
-
}
|
|
38
|
-
export {
|
|
39
|
-
c as a,
|
|
40
|
-
l as b,
|
|
41
|
-
m as c,
|
|
42
|
-
d as f,
|
|
43
|
-
f as i
|
|
44
|
-
};
|
|
45
|
-
//# sourceMappingURL=utils-ae714467-b97fee1b.mjs.map
|