@mapsindoors/map-template 1.0.0 → 1.1.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.
Files changed (77) hide show
  1. package/README.md +1 -1
  2. package/package.json +2 -2
  3. package/dist/_commonjsHelpers-ba3f0406-b96e6d6a.mjs +0 -21
  4. package/dist/combo-box-item.entry-95ce1f59.mjs +0 -14
  5. package/dist/combo-box-item.entry-dbddbad6.mjs +0 -12
  6. package/dist/icon-b8d01d6f-ddfa2c17.mjs +0 -24
  7. package/dist/mapsindoors-react.es.js +0 -7
  8. package/dist/mapsindoors-react.umd.js +0 -1391
  9. package/dist/mapsindoors-webcomponent.es.js +0 -5
  10. package/dist/mapsindoors-webcomponent.umd.js +0 -1385
  11. package/dist/mi-card_2.entry-19c978a9.mjs +0 -25
  12. package/dist/mi-card_2.entry-edc337b6.mjs +0 -23
  13. package/dist/mi-chip.entry-4e72635b.mjs +0 -15
  14. package/dist/mi-chip.entry-a27bcae2.mjs +0 -13
  15. package/dist/mi-column.entry-f0216749.mjs +0 -20
  16. package/dist/mi-column.entry-fff64658.mjs +0 -18
  17. package/dist/mi-combo-box.entry-1df97caf.mjs +0 -262
  18. package/dist/mi-combo-box.entry-d5c49dbf.mjs +0 -260
  19. package/dist/mi-data-table.entry-075c3b63.mjs +0 -215
  20. package/dist/mi-data-table.entry-1a2a465b.mjs +0 -213
  21. package/dist/mi-distance_2.entry-67441b8d.mjs +0 -54
  22. package/dist/mi-distance_2.entry-99adc361.mjs +0 -56
  23. package/dist/mi-dropdown-item.entry-62debc4c.mjs +0 -14
  24. package/dist/mi-dropdown-item.entry-6c3c44c7.mjs +0 -12
  25. package/dist/mi-dropdown.entry-8eae4521.mjs +0 -298
  26. package/dist/mi-dropdown.entry-b0e299e8.mjs +0 -296
  27. package/dist/mi-keyboard.entry-b730227d.mjs +0 -2962
  28. package/dist/mi-keyboard.entry-e869affa.mjs +0 -2960
  29. package/dist/mi-list-item-category.entry-8896172f.mjs +0 -38
  30. package/dist/mi-list-item-category.entry-955e75d9.mjs +0 -36
  31. package/dist/mi-list-item-location.entry-da7df958.mjs +0 -127
  32. package/dist/mi-list-item-location.entry-f36e8cf1.mjs +0 -125
  33. package/dist/mi-list.entry-15713742.mjs +0 -41
  34. package/dist/mi-list.entry-6e9a5556.mjs +0 -39
  35. package/dist/mi-location-booking.entry-49bbfc83.mjs +0 -4863
  36. package/dist/mi-location-booking.entry-a8ab6205.mjs +0 -4865
  37. package/dist/mi-location-info.entry-366b91be.mjs +0 -24
  38. package/dist/mi-location-info.entry-ed98b07a.mjs +0 -22
  39. package/dist/mi-map-googlemaps.entry-172794d0.mjs +0 -396
  40. package/dist/mi-map-googlemaps.entry-a71fa364.mjs +0 -398
  41. package/dist/mi-map-mapbox.entry-45457559.mjs +0 -298
  42. package/dist/mi-map-mapbox.entry-c77a7266.mjs +0 -300
  43. package/dist/mi-metric-card.entry-32f831b0.mjs +0 -26
  44. package/dist/mi-metric-card.entry-55487c97.mjs +0 -28
  45. package/dist/mi-notification.entry-44dee5c8.mjs +0 -83
  46. package/dist/mi-notification.entry-eadf8dc9.mjs +0 -81
  47. package/dist/mi-route-instructions-heading.entry-a4e69ea6.mjs +0 -72
  48. package/dist/mi-route-instructions-heading.entry-e612f18b.mjs +0 -74
  49. package/dist/mi-route-instructions-maneuver_2.entry-9a0ff4c4.mjs +0 -115
  50. package/dist/mi-route-instructions-maneuver_2.entry-a8e830aa.mjs +0 -113
  51. package/dist/mi-route-instructions-step-legacy.entry-27292122.mjs +0 -201
  52. package/dist/mi-route-instructions-step-legacy.entry-4591ba3d.mjs +0 -199
  53. package/dist/mi-route-instructions-step.entry-09d5478d.mjs +0 -201
  54. package/dist/mi-route-instructions-step.entry-2cce3752.mjs +0 -199
  55. package/dist/mi-route-instructions.entry-2bc0ccf6.mjs +0 -141
  56. package/dist/mi-route-instructions.entry-b0cadde4.mjs +0 -139
  57. package/dist/mi-scroll-buttons.entry-1f0e7f57.mjs +0 -46
  58. package/dist/mi-scroll-buttons.entry-822cb937.mjs +0 -48
  59. package/dist/mi-search.entry-8462b146.mjs +0 -206
  60. package/dist/mi-search.entry-b0ed69a4.mjs +0 -208
  61. package/dist/mi-share-sms.entry-15b65316.mjs +0 -55
  62. package/dist/mi-share-sms.entry-f455e43c.mjs +0 -53
  63. package/dist/mi-step-switcher.entry-1a3cca1d.mjs +0 -26
  64. package/dist/mi-step-switcher.entry-5001def0.mjs +0 -24
  65. package/dist/mi-tab-panel.entry-4720796b.mjs +0 -21
  66. package/dist/mi-tab-panel.entry-e06e834d.mjs +0 -19
  67. package/dist/mi-tab.entry-93c67c99.mjs +0 -13
  68. package/dist/mi-tab.entry-a6fccd52.mjs +0 -11
  69. package/dist/mi-tabs.entry-0880cd97.mjs +0 -36
  70. package/dist/mi-tabs.entry-32262f70.mjs +0 -34
  71. package/dist/mi-variables-9a6c8d4d-e06eec88.mjs +0 -7
  72. package/dist/reactcomponent-2798f651.mjs +0 -27217
  73. package/dist/route-travel-mode.enum-7f4ce9c7-a9c95a83.mjs +0 -7
  74. package/dist/sort-order.enum-64ce8998-b75ac596.mjs +0 -317
  75. package/dist/unit-system.enum-eaefb53e-0f424da4.mjs +0 -7
  76. package/dist/utils-ae714467-b07fc3be.mjs +0 -36
  77. package/dist/webcomponent-5ad04e2a.mjs +0 -31996
@@ -1,7 +0,0 @@
1
- var n;
2
- (function(i) {
3
- i.Walking = "walking", i.Bicycling = "bicycling", i.Transit = "transit", i.Driving = "driving";
4
- })(n || (n = {}));
5
- export {
6
- n as R
7
- };
@@ -1,317 +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
- };
@@ -1,7 +0,0 @@
1
- var r;
2
- (function(i) {
3
- i.Imperial = "imperial", i.Metric = "metric";
4
- })(r || (r = {}));
5
- export {
6
- r as U
7
- };
@@ -1,36 +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
- };