@mapsindoors/map-template 1.93.2 → 1.94.0
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/{GoogleMapsMap-982405ad.mjs → GoogleMapsMap-BqYRaFgc.mjs} +51 -62
- package/dist/MapboxMap-CUYrfLHY.mjs +34732 -0
- package/dist/_commonjsHelpers-ba3f0406.js +21 -0
- package/dist/combo-box-item.entry.js +15 -0
- package/dist/icon-b8d01d6f.js +24 -0
- package/dist/index-7e9696f3.js +1678 -0
- package/dist/index.js +1 -0
- package/dist/loader.js +18 -0
- package/dist/mapsindoors-react.es.js +3 -5
- package/dist/mapsindoors-react.umd.js +197 -582
- package/dist/mapsindoors-webcomponent.es.js +58512 -75790
- package/dist/mi-card_2.entry.js +28 -0
- package/dist/mi-chip.entry.js +22 -0
- package/dist/mi-column.entry.js +28 -0
- package/dist/mi-combo-box.entry.js +416 -0
- package/dist/mi-components.js +18 -0
- package/dist/mi-data-table.entry.js +302 -0
- package/dist/mi-distance_2.entry.js +67 -0
- package/dist/mi-dropdown-item.entry.js +15 -0
- package/dist/mi-dropdown.entry.js +610 -0
- package/dist/mi-floor-selector.entry.js +202 -0
- package/dist/mi-keyboard.entry.js +238 -0
- package/dist/mi-list-item-category.entry.js +48 -0
- package/dist/mi-list-item-location.entry.js +171 -0
- package/dist/mi-list.entry.js +56 -0
- package/dist/mi-location-booking.entry.js +5193 -0
- package/dist/mi-location-info.entry.js +63 -0
- package/dist/mi-map-googlemaps.entry.js +750 -0
- package/dist/mi-map-mapbox.entry.js +467 -0
- package/dist/mi-metric-card.entry.js +48 -0
- package/dist/mi-my-position.entry.js +986 -0
- package/dist/mi-notification.entry.js +127 -0
- package/dist/mi-route-instructions-heading.entry.js +73 -0
- package/dist/mi-route-instructions-maneuver-legacy.entry.js +82 -0
- package/dist/mi-route-instructions-maneuver.entry.js +82 -0
- package/dist/mi-route-instructions-step-legacy.entry.js +308 -0
- package/dist/mi-route-instructions-step.entry.js +321 -0
- package/dist/mi-route-instructions.entry.js +157 -0
- package/dist/mi-scroll-buttons.entry.js +112 -0
- package/dist/mi-search.entry.js +376 -0
- package/dist/mi-share-sms.entry.js +80 -0
- package/dist/mi-step-switcher.entry.js +31 -0
- package/dist/mi-tab-panel.entry.js +25 -0
- package/dist/mi-tab.entry.js +12 -0
- package/dist/mi-tabs.entry.js +47 -0
- package/dist/mi-time.entry.js +57 -0
- package/dist/mi-variables-9a6c8d4d.js +6 -0
- package/dist/polyfills/core-js.js +11 -0
- package/dist/polyfills/css-shim.js +1 -0
- package/dist/polyfills/dom.js +79 -0
- package/dist/polyfills/es5-html-element.js +1 -0
- package/dist/polyfills/index.js +34 -0
- package/dist/polyfills/system.js +6 -0
- package/dist/{reactcomponent-7fbbd9b2.mjs → reactcomponent-DTepe7hB.mjs} +14121 -14626
- package/dist/route-travel-mode.enum-7f4ce9c7.js +9 -0
- package/dist/sort-order.enum-64ce8998.js +552 -0
- package/dist/unit-system.enum-eaefb53e.js +7 -0
- package/dist/utils-ae714467.js +61 -0
- package/package.json +10 -6
- package/dist/MapboxMap-06ef82a3.mjs +0 -37815
- package/dist/_commonjsHelpers-ba3f0406-b96e6d6a.mjs +0 -22
- package/dist/combo-box-item.entry-d35f3d51.mjs +0 -15
- package/dist/icon-b8d01d6f-ddfa2c17.mjs +0 -25
- package/dist/mapsindoors-webcomponent.umd.js +0 -3245
- package/dist/mi-card_2.entry-fc772c35.mjs +0 -26
- package/dist/mi-chip.entry-81c742a1.mjs +0 -19
- package/dist/mi-column.entry-3a083282.mjs +0 -21
- package/dist/mi-combo-box.entry-cae6401a.mjs +0 -263
- package/dist/mi-data-table.entry-d4c3f445.mjs +0 -224
- package/dist/mi-distance_2.entry-a33ed69a.mjs +0 -339
- package/dist/mi-dropdown-item.entry-974d1e4f.mjs +0 -15
- package/dist/mi-dropdown.entry-5317db65.mjs +0 -349
- package/dist/mi-floor-selector.entry-185fbd8b.mjs +0 -115
- package/dist/mi-keyboard.entry-eaf4b9ef.mjs +0 -3103
- package/dist/mi-list-item-category.entry-9c95008c.mjs +0 -39
- package/dist/mi-list-item-location.entry-8b41e8f0.mjs +0 -137
- package/dist/mi-list.entry-1218d29d.mjs +0 -42
- package/dist/mi-location-booking.entry-270aaf5a.mjs +0 -4866
- package/dist/mi-location-info.entry-e4f7fd04.mjs +0 -32
- package/dist/mi-map-googlemaps.entry-81fa28d2.mjs +0 -467
- package/dist/mi-map-mapbox.entry-31821da3.mjs +0 -301
- package/dist/mi-metric-card.entry-40407f04.mjs +0 -29
- package/dist/mi-my-position.entry-bc48fe6e.mjs +0 -703
- package/dist/mi-notification.entry-9a2bc53b.mjs +0 -84
- package/dist/mi-route-instructions-heading.entry-e5b1ff04.mjs +0 -75
- package/dist/mi-route-instructions-maneuver-legacy.entry-2c3d73ab.mjs +0 -76
- package/dist/mi-route-instructions-maneuver.entry-c6f01024.mjs +0 -76
- package/dist/mi-route-instructions-step-legacy.entry-80bcf097.mjs +0 -202
- package/dist/mi-route-instructions-step.entry-db802e13.mjs +0 -231
- package/dist/mi-route-instructions.entry-62416e29.mjs +0 -143
- package/dist/mi-scroll-buttons.entry-92b62b21.mjs +0 -83
- package/dist/mi-search.entry-87f1e64a.mjs +0 -251
- package/dist/mi-share-sms.entry-b6725edb.mjs +0 -56
- package/dist/mi-step-switcher.entry-f8f6c040.mjs +0 -27
- package/dist/mi-tab-panel.entry-a89213c2.mjs +0 -22
- package/dist/mi-tab.entry-a2fb3f8c.mjs +0 -14
- package/dist/mi-tabs.entry-cd638ea7.mjs +0 -37
- package/dist/mi-time.entry-0b02870d.mjs +0 -46
- package/dist/mi-variables-9a6c8d4d-e06eec88.mjs +0 -8
- package/dist/route-travel-mode.enum-7f4ce9c7-a9c95a83.mjs +0 -8
- package/dist/sort-order.enum-64ce8998-b75ac596.mjs +0 -318
- package/dist/unit-system.enum-eaefb53e-0f424da4.mjs +0 -8
- package/dist/utils-ae714467-b07fc3be.mjs +0 -37
|
@@ -1,318 +0,0 @@
|
|
|
1
|
-
import { c as ve, a as te } from "./_commonjsHelpers-ba3f0406-b96e6d6a.mjs";
|
|
2
|
-
var se = ve(function(z) {
|
|
3
|
-
((J, T) => {
|
|
4
|
-
z.exports ? z.exports = T() : J.fuzzysort = T();
|
|
5
|
-
})(te, (J) => {
|
|
6
|
-
var T = (a, e) => {
|
|
7
|
-
if (a == "farzher")
|
|
8
|
-
return { target: "farzher was here (^-^*)/", score: 0, _indexes: [0] };
|
|
9
|
-
if (!a || !e)
|
|
10
|
-
return g;
|
|
11
|
-
var n = Q(a);
|
|
12
|
-
k(e) || (e = m(e));
|
|
13
|
-
var i = n.bitflags;
|
|
14
|
-
return (i & e._bitflags) !== i ? g : C(n, e);
|
|
15
|
-
}, Z = (a, e, n) => {
|
|
16
|
-
if (a == "farzher")
|
|
17
|
-
return [{ target: "farzher was here (^-^*)/", score: 0, _indexes: [0], obj: e ? e[0] : g }];
|
|
18
|
-
if (!a)
|
|
19
|
-
return n && n.all ? j(a, e, n) : E;
|
|
20
|
-
var i = Q(a), f = i.bitflags, v = n && n.threshold || y, t = n && n.limit || D, r = 0, s = 0, l = e.length;
|
|
21
|
-
if (n && n.key)
|
|
22
|
-
for (var o = n.key, u = 0; u < l; ++u) {
|
|
23
|
-
var _ = e[u], c = M(_, o);
|
|
24
|
-
if (c && (k(c) || (c = m(c)), (f & c._bitflags) === f)) {
|
|
25
|
-
var x = C(i, c);
|
|
26
|
-
x !== g && (x.score < v || (x = { target: x.target, _targetLower: "", _targetLowerCodes: g, _nextBeginningIndexes: g, _bitflags: 0, score: x.score, _indexes: x._indexes, obj: _ }, r < t ? (w.add(x), ++r) : (++s, x.score > w.peek().score && w.replaceTop(x))));
|
|
27
|
-
}
|
|
28
|
-
}
|
|
29
|
-
else if (n && n.keys)
|
|
30
|
-
for (var S = n.scoreFn || ne, B = n.keys, P = B.length, u = 0; u < l; ++u) {
|
|
31
|
-
for (var _ = e[u], h = new Array(P), L = 0; L < P; ++L) {
|
|
32
|
-
var o = B[L], c = M(_, o);
|
|
33
|
-
if (!c) {
|
|
34
|
-
h[L] = g;
|
|
35
|
-
continue;
|
|
36
|
-
}
|
|
37
|
-
k(c) || (c = m(c)), (f & c._bitflags) !== f ? h[L] = g : h[L] = C(i, c);
|
|
38
|
-
}
|
|
39
|
-
h.obj = _;
|
|
40
|
-
var d = S(h);
|
|
41
|
-
d !== g && (d < v || (h.score = d, r < t ? (w.add(h), ++r) : (++s, d > w.peek().score && w.replaceTop(h))));
|
|
42
|
-
}
|
|
43
|
-
else
|
|
44
|
-
for (var u = 0; u < l; ++u) {
|
|
45
|
-
var c = e[u];
|
|
46
|
-
if (c && (k(c) || (c = m(c)), (f & c._bitflags) === f)) {
|
|
47
|
-
var x = C(i, c);
|
|
48
|
-
x !== g && (x.score < v || (r < t ? (w.add(x), ++r) : (++s, x.score > w.peek().score && w.replaceTop(x))));
|
|
49
|
-
}
|
|
50
|
-
}
|
|
51
|
-
if (r === 0)
|
|
52
|
-
return E;
|
|
53
|
-
for (var A = new Array(r), u = r - 1; u >= 0; --u)
|
|
54
|
-
A[u] = w.poll();
|
|
55
|
-
return A.total = r + s, A;
|
|
56
|
-
}, $ = (a, e, n) => {
|
|
57
|
-
if (typeof e == "function")
|
|
58
|
-
return U(a, e);
|
|
59
|
-
if (a === g)
|
|
60
|
-
return g;
|
|
61
|
-
e === void 0 && (e = "<b>"), n === void 0 && (n = "</b>");
|
|
62
|
-
var i = "", f = 0, v = !1, t = a.target, r = t.length, s = a._indexes;
|
|
63
|
-
s = s.slice(0, s.len).sort((u, _) => u - _);
|
|
64
|
-
for (var l = 0; l < r; ++l) {
|
|
65
|
-
var o = t[l];
|
|
66
|
-
if (s[f] === l) {
|
|
67
|
-
if (++f, v || (v = !0, i += e), f === s.length) {
|
|
68
|
-
i += o + n + t.substr(l + 1);
|
|
69
|
-
break;
|
|
70
|
-
}
|
|
71
|
-
} else
|
|
72
|
-
v && (v = !1, i += n);
|
|
73
|
-
i += o;
|
|
74
|
-
}
|
|
75
|
-
return i;
|
|
76
|
-
}, U = (l, e) => {
|
|
77
|
-
if (l === g)
|
|
78
|
-
return g;
|
|
79
|
-
var n = l.target, i = n.length, f = l._indexes;
|
|
80
|
-
f = f.slice(0, f.len).sort((_, c) => _ - c);
|
|
81
|
-
for (var v = "", t = 0, r = 0, s = !1, l = [], o = 0; o < i; ++o) {
|
|
82
|
-
var u = n[o];
|
|
83
|
-
if (f[r] === o) {
|
|
84
|
-
if (++r, s || (s = !0, l.push(v), v = ""), r === f.length) {
|
|
85
|
-
v += u, l.push(e(v, t++)), v = "", l.push(n.substr(o + 1));
|
|
86
|
-
break;
|
|
87
|
-
}
|
|
88
|
-
} else
|
|
89
|
-
s && (s = !1, l.push(e(v, t++)), v = "");
|
|
90
|
-
v += u;
|
|
91
|
-
}
|
|
92
|
-
return l;
|
|
93
|
-
}, O = (a) => a._indexes.slice(0, a._indexes.len).sort((e, n) => e - n), F = (a) => {
|
|
94
|
-
typeof a != "string" && (a = "");
|
|
95
|
-
var e = V(a);
|
|
96
|
-
return { target: a, _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _nextBeginningIndexes: g, _bitflags: e.bitflags, score: g, _indexes: [0], obj: g };
|
|
97
|
-
}, K = (a) => {
|
|
98
|
-
typeof a != "string" && (a = ""), a = a.trim();
|
|
99
|
-
var e = V(a), n = [];
|
|
100
|
-
if (e.containsSpace) {
|
|
101
|
-
var i = a.split(/\s+/);
|
|
102
|
-
i = [...new Set(i)];
|
|
103
|
-
for (var f = 0; f < i.length; f++)
|
|
104
|
-
if (i[f] !== "") {
|
|
105
|
-
var v = V(i[f]);
|
|
106
|
-
n.push({ lowerCodes: v.lowerCodes, _lower: i[f].toLowerCase(), containsSpace: !1 });
|
|
107
|
-
}
|
|
108
|
-
}
|
|
109
|
-
return { lowerCodes: e.lowerCodes, bitflags: e.bitflags, containsSpace: e.containsSpace, _lower: e._lower, spaceSearches: n };
|
|
110
|
-
}, m = (a) => {
|
|
111
|
-
if (a.length > 999)
|
|
112
|
-
return F(a);
|
|
113
|
-
var e = X.get(a);
|
|
114
|
-
return e !== void 0 || (e = F(a), X.set(a, e)), e;
|
|
115
|
-
}, Q = (a) => {
|
|
116
|
-
if (a.length > 999)
|
|
117
|
-
return K(a);
|
|
118
|
-
var e = q.get(a);
|
|
119
|
-
return e !== void 0 || (e = K(a), q.set(a, e)), e;
|
|
120
|
-
}, j = (a, e, n) => {
|
|
121
|
-
var i = [];
|
|
122
|
-
i.total = e.length;
|
|
123
|
-
var f = n && n.limit || D;
|
|
124
|
-
if (n && n.key)
|
|
125
|
-
for (var v = 0; v < e.length; v++) {
|
|
126
|
-
var t = e[v], r = M(t, n.key);
|
|
127
|
-
if (r) {
|
|
128
|
-
k(r) || (r = m(r)), r.score = y, r._indexes.len = 0;
|
|
129
|
-
var s = r;
|
|
130
|
-
if (s = { target: s.target, _targetLower: "", _targetLowerCodes: g, _nextBeginningIndexes: g, _bitflags: 0, score: r.score, _indexes: g, obj: t }, i.push(s), i.length >= f)
|
|
131
|
-
return i;
|
|
132
|
-
}
|
|
133
|
-
}
|
|
134
|
-
else if (n && n.keys)
|
|
135
|
-
for (var v = 0; v < e.length; v++) {
|
|
136
|
-
for (var t = e[v], l = new Array(n.keys.length), o = n.keys.length - 1; o >= 0; --o) {
|
|
137
|
-
var r = M(t, n.keys[o]);
|
|
138
|
-
if (!r) {
|
|
139
|
-
l[o] = g;
|
|
140
|
-
continue;
|
|
141
|
-
}
|
|
142
|
-
k(r) || (r = m(r)), r.score = y, r._indexes.len = 0, l[o] = r;
|
|
143
|
-
}
|
|
144
|
-
if (l.obj = t, l.score = y, i.push(l), i.length >= f)
|
|
145
|
-
return i;
|
|
146
|
-
}
|
|
147
|
-
else
|
|
148
|
-
for (var v = 0; v < e.length; v++) {
|
|
149
|
-
var r = e[v];
|
|
150
|
-
if (r && (k(r) || (r = m(r)), r.score = y, r._indexes.len = 0, i.push(r), i.length >= f))
|
|
151
|
-
return i;
|
|
152
|
-
}
|
|
153
|
-
return i;
|
|
154
|
-
}, C = (a, e, n = !1) => {
|
|
155
|
-
if (n === !1 && a.containsSpace)
|
|
156
|
-
return R(a, e);
|
|
157
|
-
for (var i = a._lower, f = a.lowerCodes, v = f[0], t = e._targetLowerCodes, r = f.length, s = t.length, _ = 0, l = 0, o = 0; ; ) {
|
|
158
|
-
var u = v === t[l];
|
|
159
|
-
if (u) {
|
|
160
|
-
if (p[o++] = l, ++_, _ === r)
|
|
161
|
-
break;
|
|
162
|
-
v = f[_];
|
|
163
|
-
}
|
|
164
|
-
if (++l, l >= s)
|
|
165
|
-
return g;
|
|
166
|
-
}
|
|
167
|
-
var _ = 0, c = !1, x = 0, S = e._nextBeginningIndexes;
|
|
168
|
-
S === g && (S = e._nextBeginningIndexes = re(e.target)), l = p[0] === 0 ? 0 : S[p[0] - 1];
|
|
169
|
-
var B = 0;
|
|
170
|
-
if (l !== s)
|
|
171
|
-
for (; ; )
|
|
172
|
-
if (l >= s) {
|
|
173
|
-
if (_ <= 0 || (++B, B > 200))
|
|
174
|
-
break;
|
|
175
|
-
--_;
|
|
176
|
-
var P = N[--x];
|
|
177
|
-
l = S[P];
|
|
178
|
-
} else {
|
|
179
|
-
var u = f[_] === t[l];
|
|
180
|
-
if (u) {
|
|
181
|
-
if (N[x++] = l, ++_, _ === r) {
|
|
182
|
-
c = !0;
|
|
183
|
-
break;
|
|
184
|
-
}
|
|
185
|
-
++l;
|
|
186
|
-
} else
|
|
187
|
-
l = S[l];
|
|
188
|
-
}
|
|
189
|
-
var h = e._targetLower.indexOf(i, p[0]), L = ~h;
|
|
190
|
-
if (L && !c)
|
|
191
|
-
for (var d = 0; d < o; ++d)
|
|
192
|
-
p[d] = h + d;
|
|
193
|
-
var A = !1;
|
|
194
|
-
L && (A = e._nextBeginningIndexes[h - 1] === h);
|
|
195
|
-
{
|
|
196
|
-
if (c)
|
|
197
|
-
var b = N, G = x;
|
|
198
|
-
else
|
|
199
|
-
var b = p, G = o;
|
|
200
|
-
for (var I = 0, W = 0, d = 1; d < r; ++d)
|
|
201
|
-
b[d] - b[d - 1] !== 1 && (I -= b[d], ++W);
|
|
202
|
-
var fe = b[r - 1] - b[0] - (r - 1);
|
|
203
|
-
if (I -= (12 + fe) * W, b[0] !== 0 && (I -= b[0] * b[0] * 0.2), !c)
|
|
204
|
-
I *= 1e3;
|
|
205
|
-
else {
|
|
206
|
-
for (var H = 1, d = S[0]; d < s; d = S[d])
|
|
207
|
-
++H;
|
|
208
|
-
H > 24 && (I *= (H - 24) * 10);
|
|
209
|
-
}
|
|
210
|
-
L && (I /= 1 + r * r * 1), A && (I /= 1 + r * r * 1), I -= s - r, e.score = I;
|
|
211
|
-
for (var d = 0; d < G; ++d)
|
|
212
|
-
e._indexes[d] = b[d];
|
|
213
|
-
return e._indexes.len = G, e;
|
|
214
|
-
}
|
|
215
|
-
}, R = (a, e) => {
|
|
216
|
-
for (var n = /* @__PURE__ */ new Set(), i = 0, f = g, v = 0, t = a.spaceSearches, o = 0; o < t.length; ++o) {
|
|
217
|
-
var r = t[o];
|
|
218
|
-
if (f = C(r, e), f === g)
|
|
219
|
-
return g;
|
|
220
|
-
i += f.score, f._indexes[0] < v && (i -= v - f._indexes[0]), v = f._indexes[0];
|
|
221
|
-
for (var s = 0; s < f._indexes.len; ++s)
|
|
222
|
-
n.add(f._indexes[s]);
|
|
223
|
-
}
|
|
224
|
-
var l = C(
|
|
225
|
-
a,
|
|
226
|
-
e,
|
|
227
|
-
/*allowSpaces=*/
|
|
228
|
-
!0
|
|
229
|
-
);
|
|
230
|
-
if (l !== g && l.score > i)
|
|
231
|
-
return l;
|
|
232
|
-
f.score = i;
|
|
233
|
-
var o = 0;
|
|
234
|
-
for (let u of n)
|
|
235
|
-
f._indexes[o++] = u;
|
|
236
|
-
return f._indexes.len = o, f;
|
|
237
|
-
}, V = (a) => {
|
|
238
|
-
for (var e = a.length, n = a.toLowerCase(), i = [], f = 0, v = !1, t = 0; t < e; ++t) {
|
|
239
|
-
var r = i[t] = n.charCodeAt(t);
|
|
240
|
-
if (r === 32) {
|
|
241
|
-
v = !0;
|
|
242
|
-
continue;
|
|
243
|
-
}
|
|
244
|
-
var s = r >= 97 && r <= 122 ? r - 97 : r >= 48 && r <= 57 ? 26 : r <= 127 ? 30 : 31;
|
|
245
|
-
f |= 1 << s;
|
|
246
|
-
}
|
|
247
|
-
return { lowerCodes: i, bitflags: f, containsSpace: v, _lower: n };
|
|
248
|
-
}, ee = (a) => {
|
|
249
|
-
for (var e = a.length, n = [], i = 0, f = !1, v = !1, t = 0; t < e; ++t) {
|
|
250
|
-
var r = a.charCodeAt(t), s = r >= 65 && r <= 90, l = s || r >= 97 && r <= 122 || r >= 48 && r <= 57, o = s && !f || !v || !l;
|
|
251
|
-
f = s, v = l, o && (n[i++] = t);
|
|
252
|
-
}
|
|
253
|
-
return n;
|
|
254
|
-
}, re = (a) => {
|
|
255
|
-
for (var e = a.length, n = ee(a), i = [], f = n[0], v = 0, t = 0; t < e; ++t)
|
|
256
|
-
f > t ? i[t] = f : (f = n[++v], i[t] = f === void 0 ? e : f);
|
|
257
|
-
return i;
|
|
258
|
-
}, ae = () => {
|
|
259
|
-
X.clear(), q.clear(), p = [], N = [];
|
|
260
|
-
}, X = /* @__PURE__ */ new Map(), q = /* @__PURE__ */ new Map(), p = [], N = [], ne = (a) => {
|
|
261
|
-
for (var e = y, n = a.length, i = 0; i < n; ++i) {
|
|
262
|
-
var f = a[i];
|
|
263
|
-
if (f !== g) {
|
|
264
|
-
var v = f.score;
|
|
265
|
-
v > e && (e = v);
|
|
266
|
-
}
|
|
267
|
-
}
|
|
268
|
-
return e === y ? g : e;
|
|
269
|
-
}, M = (a, e) => {
|
|
270
|
-
var n = a[e];
|
|
271
|
-
if (n !== void 0)
|
|
272
|
-
return n;
|
|
273
|
-
var i = e;
|
|
274
|
-
Array.isArray(e) || (i = e.split("."));
|
|
275
|
-
for (var f = i.length, v = -1; a && ++v < f; )
|
|
276
|
-
a = a[i[v]];
|
|
277
|
-
return a;
|
|
278
|
-
}, k = (a) => typeof a == "object", D = 1 / 0, y = -D, E = [];
|
|
279
|
-
E.total = 0;
|
|
280
|
-
var g = null, ie = (a) => {
|
|
281
|
-
var e = [], n = 0, i = {}, f = (v) => {
|
|
282
|
-
for (var t = 0, r = e[t], s = 1; s < n; ) {
|
|
283
|
-
var l = s + 1;
|
|
284
|
-
t = s, l < n && e[l].score < e[s].score && (t = l), e[t - 1 >> 1] = e[t], s = 1 + (t << 1);
|
|
285
|
-
}
|
|
286
|
-
for (var o = t - 1 >> 1; t > 0 && r.score < e[o].score; o = (t = o) - 1 >> 1)
|
|
287
|
-
e[t] = e[o];
|
|
288
|
-
e[t] = r;
|
|
289
|
-
};
|
|
290
|
-
return i.add = (v) => {
|
|
291
|
-
var t = n;
|
|
292
|
-
e[n++] = v;
|
|
293
|
-
for (var r = t - 1 >> 1; t > 0 && v.score < e[r].score; r = (t = r) - 1 >> 1)
|
|
294
|
-
e[t] = e[r];
|
|
295
|
-
e[t] = v;
|
|
296
|
-
}, i.poll = (v) => {
|
|
297
|
-
if (n !== 0) {
|
|
298
|
-
var t = e[0];
|
|
299
|
-
return e[0] = e[--n], f(), t;
|
|
300
|
-
}
|
|
301
|
-
}, i.peek = (v) => {
|
|
302
|
-
if (n !== 0)
|
|
303
|
-
return e[0];
|
|
304
|
-
}, i.replaceTop = (v) => {
|
|
305
|
-
e[0] = v, f();
|
|
306
|
-
}, i;
|
|
307
|
-
}, w = ie();
|
|
308
|
-
return { single: T, go: Z, highlight: $, prepare: F, indexes: O, cleanup: ae };
|
|
309
|
-
});
|
|
310
|
-
}), Y;
|
|
311
|
-
(function(z) {
|
|
312
|
-
z.Asc = "asc", z.Desc = "desc";
|
|
313
|
-
})(Y || (Y = {}));
|
|
314
|
-
export {
|
|
315
|
-
Y as S,
|
|
316
|
-
se as f
|
|
317
|
-
};
|
|
318
|
-
//# sourceMappingURL=sort-order.enum-64ce8998-b75ac596.mjs.map
|
|
@@ -1,37 +0,0 @@
|
|
|
1
|
-
function u(e) {
|
|
2
|
-
return e !== null && e > "" && !isNaN(Number(e));
|
|
3
|
-
}
|
|
4
|
-
function c(e) {
|
|
5
|
-
return Number(e).toLocaleString(void 0, { minimumFractionDigits: 0 });
|
|
6
|
-
}
|
|
7
|
-
function m(e) {
|
|
8
|
-
return e == null;
|
|
9
|
-
}
|
|
10
|
-
function d() {
|
|
11
|
-
return !!(navigator.userAgent.match(/Trident/g) || navigator.userAgent.match(/MSIE/g));
|
|
12
|
-
}
|
|
13
|
-
function o(e) {
|
|
14
|
-
try {
|
|
15
|
-
return new URL(e), !0;
|
|
16
|
-
} catch {
|
|
17
|
-
return !1;
|
|
18
|
-
}
|
|
19
|
-
}
|
|
20
|
-
function f(e, r) {
|
|
21
|
-
if (o(e) === !1)
|
|
22
|
-
return;
|
|
23
|
-
const t = new URL(e), n = t.hostname;
|
|
24
|
-
if (n === "image.mapsindoors.com") {
|
|
25
|
-
const a = Math.max(2, window.devicePixelRatio || 1), i = r * a, s = r * a;
|
|
26
|
-
t.searchParams.set("width", i.toString()), t.searchParams.set("height", s.toString()), t.searchParams.set("fitMode", "cover");
|
|
27
|
-
}
|
|
28
|
-
return ["app.mapsindoors.com", "v2.mapsindoors.com"].includes(n) && t.searchParams.set("scale", "2"), t.toString();
|
|
29
|
-
}
|
|
30
|
-
export {
|
|
31
|
-
u as a,
|
|
32
|
-
f as b,
|
|
33
|
-
d as c,
|
|
34
|
-
c as f,
|
|
35
|
-
m as i
|
|
36
|
-
};
|
|
37
|
-
//# sourceMappingURL=utils-ae714467-b07fc3be.mjs.map
|