@maptiler/geocoding-control 0.0.82 → 0.0.84

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.
@@ -1,225 +1,3 @@
1
- function ci() {
2
- }
3
- function zs(n) {
4
- return n();
5
- }
6
- function rs() {
7
- return /* @__PURE__ */ Object.create(null);
8
- }
9
- function ro(n) {
10
- n.forEach(zs);
11
- }
12
- function Us(n) {
13
- return typeof n == "function";
14
- }
15
- function Ga(n, t) {
16
- return n != n ? t == t : n !== t || n && typeof n == "object" || typeof n == "function";
17
- }
18
- function Va(n) {
19
- return Object.keys(n).length === 0;
20
- }
21
- function ka(n, t) {
22
- n.appendChild(t);
23
- }
24
- function za(n, t, e) {
25
- n.insertBefore(t, e || null);
26
- }
27
- function qs(n) {
28
- n.parentNode && n.parentNode.removeChild(n);
29
- }
30
- function ns(n) {
31
- return document.createElementNS("http://www.w3.org/2000/svg", n);
32
- }
33
- function pr(n, t, e) {
34
- e == null ? n.removeAttribute(t) : n.getAttribute(t) !== e && n.setAttribute(t, e);
35
- }
36
- function Ua(n) {
37
- return Array.from(n.childNodes);
38
- }
39
- function Ai(n, t, e) {
40
- n.classList[e ? "add" : "remove"](t);
41
- }
42
- let Go;
43
- function ui(n) {
44
- Go = n;
45
- }
46
- const Pn = [], is = [];
47
- let Rn = [];
48
- const os = [], qa = /* @__PURE__ */ Promise.resolve();
49
- let Co = !1;
50
- function Xa() {
51
- Co || (Co = !0, qa.then(Xs));
52
- }
53
- function No(n) {
54
- Rn.push(n);
55
- }
56
- const yo = /* @__PURE__ */ new Set();
57
- let wn = 0;
58
- function Xs() {
59
- if (wn !== 0)
60
- return;
61
- const n = Go;
62
- do {
63
- try {
64
- for (; wn < Pn.length; ) {
65
- const t = Pn[wn];
66
- wn++, ui(t), Ya(t.$$);
67
- }
68
- } catch (t) {
69
- throw Pn.length = 0, wn = 0, t;
70
- }
71
- for (ui(null), Pn.length = 0, wn = 0; is.length; )
72
- is.pop()();
73
- for (let t = 0; t < Rn.length; t += 1) {
74
- const e = Rn[t];
75
- yo.has(e) || (yo.add(e), e());
76
- }
77
- Rn.length = 0;
78
- } while (Pn.length);
79
- for (; os.length; )
80
- os.pop()();
81
- Co = !1, yo.clear(), ui(n);
82
- }
83
- function Ya(n) {
84
- if (n.fragment !== null) {
85
- n.update(), ro(n.before_update);
86
- const t = n.dirty;
87
- n.dirty = [-1], n.fragment && n.fragment.p(n.ctx, t), n.after_update.forEach(No);
88
- }
89
- }
90
- function Ha(n) {
91
- const t = [], e = [];
92
- Rn.forEach((r) => n.indexOf(r) === -1 ? t.push(r) : e.push(r)), e.forEach((r) => r()), Rn = t;
93
- }
94
- const Wa = /* @__PURE__ */ new Set();
95
- function ja(n, t) {
96
- n && n.i && (Wa.delete(n), n.i(t));
97
- }
98
- function Ka(n, t, e, r) {
99
- const { fragment: i, after_update: o } = n.$$;
100
- i && i.m(t, e), r || No(() => {
101
- const s = n.$$.on_mount.map(zs).filter(Us);
102
- n.$$.on_destroy ? n.$$.on_destroy.push(...s) : ro(s), n.$$.on_mount = [];
103
- }), o.forEach(No);
104
- }
105
- function Qa(n, t) {
106
- const e = n.$$;
107
- e.fragment !== null && (Ha(e.after_update), ro(e.on_destroy), e.fragment && e.fragment.d(t), e.on_destroy = e.fragment = null, e.ctx = []);
108
- }
109
- function Ja(n, t) {
110
- n.$$.dirty[0] === -1 && (Pn.push(n), Xa(), n.$$.dirty.fill(0)), n.$$.dirty[t / 31 | 0] |= 1 << t % 31;
111
- }
112
- function Za(n, t, e, r, i, o, s, a = [-1]) {
113
- const u = Go;
114
- ui(n);
115
- const l = n.$$ = {
116
- fragment: null,
117
- ctx: [],
118
- // state
119
- props: o,
120
- update: ci,
121
- not_equal: i,
122
- bound: rs(),
123
- // lifecycle
124
- on_mount: [],
125
- on_destroy: [],
126
- on_disconnect: [],
127
- before_update: [],
128
- after_update: [],
129
- context: new Map(t.context || (u ? u.$$.context : [])),
130
- // everything else
131
- callbacks: rs(),
132
- dirty: a,
133
- skip_bound: !1,
134
- root: t.target || u.$$.root
135
- };
136
- s && s(l.root);
137
- let c = !1;
138
- if (l.ctx = e ? e(n, t.props || {}, (f, h, ...p) => {
139
- const g = p.length ? p[0] : h;
140
- return l.ctx && i(l.ctx[f], l.ctx[f] = g) && (!l.skip_bound && l.bound[f] && l.bound[f](g), c && Ja(n, f)), h;
141
- }) : [], l.update(), c = !0, ro(l.before_update), l.fragment = r ? r(l.ctx) : !1, t.target) {
142
- if (t.hydrate) {
143
- const f = Ua(t.target);
144
- l.fragment && l.fragment.l(f), f.forEach(qs);
145
- } else
146
- l.fragment && l.fragment.c();
147
- t.intro && ja(n.$$.fragment), Ka(n, t.target, t.anchor, t.customElement), Xs();
148
- }
149
- ui(u);
150
- }
151
- class $a {
152
- $destroy() {
153
- Qa(this, 1), this.$destroy = ci;
154
- }
155
- $on(t, e) {
156
- if (!Us(e))
157
- return ci;
158
- const r = this.$$.callbacks[t] || (this.$$.callbacks[t] = []);
159
- return r.push(e), () => {
160
- const i = r.indexOf(e);
161
- i !== -1 && r.splice(i, 1);
162
- };
163
- }
164
- $set(t) {
165
- this.$$set && !Va(t) && (this.$$.skip_bound = !0, this.$$set(t), this.$$.skip_bound = !1);
166
- }
167
- }
168
- function tu(n) {
169
- let t, e, r;
170
- return {
171
- c() {
172
- t = ns("svg"), e = ns("path"), pr(e, "stroke-width", "4"), pr(e, "fill-rule", "evenodd"), pr(e, "clip-rule", "evenodd"), pr(e, "d", "M 5,33.103579 C 5,17.607779 18.457,5 35,5 C 51.543,5 65,17.607779 65,33.103579 C 65,56.388679 40.4668,76.048179 36.6112,79.137779 C 36.3714,79.329879 36.2116,79.457979 36.1427,79.518879 C 35.8203,79.800879 35.4102,79.942779 35,79.942779 C 34.5899,79.942779 34.1797,79.800879 33.8575,79.518879 C 33.7886,79.457979 33.6289,79.330079 33.3893,79.138079 C 29.5346,76.049279 5,56.389379 5,33.103579 Z M 35.0001,49.386379 C 43.1917,49.386379 49.8323,42.646079 49.8323,34.331379 C 49.8323,26.016779 43.1917,19.276479 35.0001,19.276479 C 26.8085,19.276479 20.1679,26.016779 20.1679,34.331379 C 20.1679,42.646079 26.8085,49.386379 35.0001,49.386379 Z"), pr(e, "class", "svelte-1k1cmht"), pr(t, "width", r = /*displayIn*/
173
- n[0] !== "list" ? void 0 : "20"), pr(t, "viewBox", "0 0 70 85"), pr(t, "fill", "none"), pr(t, "class", "svelte-1k1cmht"), Ai(
174
- t,
175
- "in-map",
176
- /*displayIn*/
177
- n[0] !== "list"
178
- ), Ai(
179
- t,
180
- "list-icon",
181
- /*displayIn*/
182
- n[0] === "list"
183
- );
184
- },
185
- m(i, o) {
186
- za(i, t, o), ka(t, e);
187
- },
188
- p(i, [o]) {
189
- o & /*displayIn*/
190
- 1 && r !== (r = /*displayIn*/
191
- i[0] !== "list" ? void 0 : "20") && pr(t, "width", r), o & /*displayIn*/
192
- 1 && Ai(
193
- t,
194
- "in-map",
195
- /*displayIn*/
196
- i[0] !== "list"
197
- ), o & /*displayIn*/
198
- 1 && Ai(
199
- t,
200
- "list-icon",
201
- /*displayIn*/
202
- i[0] === "list"
203
- );
204
- },
205
- i: ci,
206
- o: ci,
207
- d(i) {
208
- i && qs(t);
209
- }
210
- };
211
- }
212
- function eu(n, t, e) {
213
- let { displayIn: r } = t;
214
- return n.$$set = (i) => {
215
- "displayIn" in i && e(0, r = i.displayIn);
216
- }, [r];
217
- }
218
- class ru extends $a {
219
- constructor(t) {
220
- super(), Za(this, t, eu, tu, Ga, { displayIn: 0 });
221
- }
222
- }
223
1
  /**
224
2
  * splaytree v3.1.1
225
3
  * Fast Splay tree for Node and browser
@@ -242,7 +20,7 @@ MERCHANTABLITY OR NON-INFRINGEMENT.
242
20
  See the Apache Version 2.0 License for specific language governing permissions
243
21
  and limitations under the License.
244
22
  ***************************************************************************** */
245
- function nu(n, t) {
23
+ function Ga(n, t) {
246
24
  var e = { label: 0, sent: function() {
247
25
  if (o[0] & 1)
248
26
  throw o[1];
@@ -316,7 +94,7 @@ var Kr = (
316
94
  return n;
317
95
  }()
318
96
  );
319
- function iu(n, t) {
97
+ function Va(n, t) {
320
98
  return n > t ? 1 : n < t ? -1 : 0;
321
99
  }
322
100
  function Yr(n, t, e) {
@@ -345,7 +123,7 @@ function Yr(n, t, e) {
345
123
  }
346
124
  return i.right = t.left, o.left = t.right, t.left = r.right, t.right = r.left, t;
347
125
  }
348
- function mo(n, t, e, r) {
126
+ function yo(n, t, e, r) {
349
127
  var i = new Kr(n, t);
350
128
  if (e === null)
351
129
  return i.left = i.right = null, i;
@@ -353,7 +131,7 @@ function mo(n, t, e, r) {
353
131
  var o = r(n, e.key);
354
132
  return o < 0 ? (i.left = e.left, i.right = e, e.left = null) : o >= 0 && (i.right = e.right, i.left = e, e.right = null), i;
355
133
  }
356
- function ss(n, t, e) {
134
+ function rs(n, t, e) {
357
135
  var r = null, i = null;
358
136
  if (t) {
359
137
  t = Yr(n, t, e);
@@ -362,25 +140,25 @@ function ss(n, t, e) {
362
140
  }
363
141
  return { left: r, right: i };
364
142
  }
365
- function ou(n, t, e) {
143
+ function ka(n, t, e) {
366
144
  return t === null ? n : (n === null || (t = Yr(n.key, t, e), t.left = n), t);
367
145
  }
368
- function xo(n, t, e, r, i) {
146
+ function Co(n, t, e, r, i) {
369
147
  if (n) {
370
148
  r("" + t + (e ? "└── " : "├── ") + i(n) + `
371
149
  `);
372
150
  var o = t + (e ? " " : "│ ");
373
- n.left && xo(n.left, o, !1, r, i), n.right && xo(n.right, o, !0, r, i);
151
+ n.left && Co(n.left, o, !1, r, i), n.right && Co(n.right, o, !0, r, i);
374
152
  }
375
153
  }
376
- var Vo = (
154
+ var Go = (
377
155
  /** @class */
378
156
  function() {
379
157
  function n(t) {
380
- t === void 0 && (t = iu), this._root = null, this._size = 0, this._comparator = t;
158
+ t === void 0 && (t = Va), this._root = null, this._size = 0, this._comparator = t;
381
159
  }
382
160
  return n.prototype.insert = function(t, e) {
383
- return this._size++, this._root = mo(t, e, this._root, this._comparator);
161
+ return this._size++, this._root = yo(t, e, this._root, this._comparator);
384
162
  }, n.prototype.add = function(t, e) {
385
163
  var r = new Kr(t, e);
386
164
  this._root === null && (r.left = r.right = null, this._size++, this._root = r);
@@ -505,15 +283,15 @@ var Vo = (
505
283
  }, n.prototype.clear = function() {
506
284
  return this._root = null, this._size = 0, this;
507
285
  }, n.prototype.toList = function() {
508
- return au(this._root);
286
+ return Ua(this._root);
509
287
  }, n.prototype.load = function(t, e, r) {
510
288
  e === void 0 && (e = []), r === void 0 && (r = !1);
511
289
  var i = t.length, o = this._comparator;
512
- if (r && wo(t, e, 0, i - 1, o), this._root === null)
513
- this._root = So(t, e, 0, i), this._size = i;
290
+ if (r && So(t, e, 0, i - 1, o), this._root === null)
291
+ this._root = No(t, e, 0, i), this._size = i;
514
292
  else {
515
- var s = uu(this.toList(), su(t, e), o);
516
- i = this._size + i, this._root = Lo({ head: s }, 0, i);
293
+ var s = qa(this.toList(), za(t, e), o);
294
+ i = this._size + i, this._root = xo({ head: s }, 0, i);
517
295
  }
518
296
  return this;
519
297
  }, n.prototype.isEmpty = function() {
@@ -535,17 +313,17 @@ var Vo = (
535
313
  return String(r.key);
536
314
  });
537
315
  var e = [];
538
- return xo(this._root, "", !0, function(r) {
316
+ return Co(this._root, "", !0, function(r) {
539
317
  return e.push(r);
540
318
  }, t), e.join("");
541
319
  }, n.prototype.update = function(t, e, r) {
542
- var i = this._comparator, o = ss(t, this._root, i), s = o.left, a = o.right;
543
- i(t, e) < 0 ? a = mo(e, r, a, i) : s = mo(e, r, s, i), this._root = ou(s, a, i);
320
+ var i = this._comparator, o = rs(t, this._root, i), s = o.left, a = o.right;
321
+ i(t, e) < 0 ? a = yo(e, r, a, i) : s = yo(e, r, s, i), this._root = ka(s, a, i);
544
322
  }, n.prototype.split = function(t) {
545
- return ss(t, this._root, this._comparator);
323
+ return rs(t, this._root, this._comparator);
546
324
  }, n.prototype[Symbol.iterator] = function() {
547
325
  var t;
548
- return nu(this, function(e) {
326
+ return Ga(this, function(e) {
549
327
  switch (e.label) {
550
328
  case 0:
551
329
  t = this.minNode(), e.label = 1;
@@ -563,38 +341,38 @@ var Vo = (
563
341
  }, n;
564
342
  }()
565
343
  );
566
- function So(n, t, e, r) {
344
+ function No(n, t, e, r) {
567
345
  var i = r - e;
568
346
  if (i > 0) {
569
347
  var o = e + Math.floor(i / 2), s = n[o], a = t[o], u = new Kr(s, a);
570
- return u.left = So(n, t, e, o), u.right = So(n, t, o + 1, r), u;
348
+ return u.left = No(n, t, e, o), u.right = No(n, t, o + 1, r), u;
571
349
  }
572
350
  return null;
573
351
  }
574
- function su(n, t) {
352
+ function za(n, t) {
575
353
  for (var e = new Kr(null, null), r = e, i = 0; i < n.length; i++)
576
354
  r = r.next = new Kr(n[i], t[i]);
577
355
  return r.next = null, e.next;
578
356
  }
579
- function au(n) {
357
+ function Ua(n) {
580
358
  for (var t = n, e = [], r = !1, i = new Kr(null, null), o = i; !r; )
581
359
  t ? (e.push(t), t = t.left) : e.length > 0 ? (t = o = o.next = e.pop(), t = t.right) : r = !0;
582
360
  return o.next = null, i.next;
583
361
  }
584
- function Lo(n, t, e) {
362
+ function xo(n, t, e) {
585
363
  var r = e - t;
586
364
  if (r > 0) {
587
- var i = t + Math.floor(r / 2), o = Lo(n, t, i), s = n.head;
588
- return s.left = o, n.head = n.head.next, s.right = Lo(n, i + 1, e), s;
365
+ var i = t + Math.floor(r / 2), o = xo(n, t, i), s = n.head;
366
+ return s.left = o, n.head = n.head.next, s.right = xo(n, i + 1, e), s;
589
367
  }
590
368
  return null;
591
369
  }
592
- function uu(n, t, e) {
370
+ function qa(n, t, e) {
593
371
  for (var r = new Kr(null, null), i = r, o = n, s = t; o !== null && s !== null; )
594
372
  e(o.key, s.key) < 0 ? (i.next = o, o = o.next) : (i.next = s, s = s.next), i = i.next;
595
373
  return o !== null ? i.next = o : s !== null && (i.next = s), r.next;
596
374
  }
597
- function wo(n, t, e, r, i) {
375
+ function So(n, t, e, r, i) {
598
376
  if (!(e >= r)) {
599
377
  for (var o = n[e + r >> 1], s = e - 1, a = r + 1; ; ) {
600
378
  do
@@ -608,25 +386,25 @@ function wo(n, t, e, r, i) {
608
386
  var u = n[s];
609
387
  n[s] = n[a], n[a] = u, u = t[s], t[s] = t[a], t[a] = u;
610
388
  }
611
- wo(n, t, e, a, i), wo(n, t, a + 1, r, i);
389
+ So(n, t, e, a, i), So(n, t, a + 1, r, i);
612
390
  }
613
391
  }
614
392
  function Qe(n, t) {
615
393
  if (!(n instanceof t))
616
394
  throw new TypeError("Cannot call a class as a function");
617
395
  }
618
- function as(n, t) {
396
+ function ns(n, t) {
619
397
  for (var e = 0; e < t.length; e++) {
620
398
  var r = t[e];
621
399
  r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(n, r.key, r);
622
400
  }
623
401
  }
624
402
  function ae(n, t, e) {
625
- return t && as(n.prototype, t), e && as(n, e), n;
403
+ return t && ns(n.prototype, t), e && ns(n, e), n;
626
404
  }
627
405
  var ii = function(t, e) {
628
406
  return t.ll.x <= e.x && e.x <= t.ur.x && t.ll.y <= e.y && e.y <= t.ur.y;
629
- }, Po = function(t, e) {
407
+ }, Lo = function(t, e) {
630
408
  if (e.ur.x < t.ll.x || t.ur.x < e.ll.x || e.ur.y < t.ll.y || t.ur.y < e.ll.y)
631
409
  return null;
632
410
  var r = t.ll.x < e.ll.x ? e.ll.x : t.ll.x, i = t.ur.x < e.ur.x ? t.ur.x : e.ur.x, o = t.ll.y < e.ll.y ? e.ll.y : t.ll.y, s = t.ur.y < e.ur.y ? t.ur.y : e.ur.y;
@@ -642,19 +420,19 @@ var ii = function(t, e) {
642
420
  };
643
421
  }, Hr = Number.EPSILON;
644
422
  Hr === void 0 && (Hr = Math.pow(2, -52));
645
- var lu = Hr * Hr, bo = function(t, e) {
423
+ var Xa = Hr * Hr, wo = function(t, e) {
646
424
  if (-Hr < t && t < Hr && -Hr < e && e < Hr)
647
425
  return 0;
648
426
  var r = t - e;
649
- return r * r < lu * t * e ? 0 : t < e ? -1 : 1;
650
- }, cu = /* @__PURE__ */ function() {
427
+ return r * r < Xa * t * e ? 0 : t < e ? -1 : 1;
428
+ }, Ya = /* @__PURE__ */ function() {
651
429
  function n() {
652
430
  Qe(this, n), this.reset();
653
431
  }
654
432
  return ae(n, [{
655
433
  key: "reset",
656
434
  value: function() {
657
- this.xRounder = new us(), this.yRounder = new us();
435
+ this.xRounder = new is(), this.yRounder = new is();
658
436
  }
659
437
  }, {
660
438
  key: "round",
@@ -665,36 +443,36 @@ var lu = Hr * Hr, bo = function(t, e) {
665
443
  };
666
444
  }
667
445
  }]), n;
668
- }(), us = /* @__PURE__ */ function() {
446
+ }(), is = /* @__PURE__ */ function() {
669
447
  function n() {
670
- Qe(this, n), this.tree = new Vo(), this.round(0);
448
+ Qe(this, n), this.tree = new Go(), this.round(0);
671
449
  }
672
450
  return ae(n, [{
673
451
  key: "round",
674
452
  value: function(e) {
675
453
  var r = this.tree.add(e), i = this.tree.prev(r);
676
- if (i !== null && bo(r.key, i.key) === 0)
454
+ if (i !== null && wo(r.key, i.key) === 0)
677
455
  return this.tree.remove(e), i.key;
678
456
  var o = this.tree.next(r);
679
- return o !== null && bo(r.key, o.key) === 0 ? (this.tree.remove(e), o.key) : e;
457
+ return o !== null && wo(r.key, o.key) === 0 ? (this.tree.remove(e), o.key) : e;
680
458
  }
681
459
  }]), n;
682
- }(), fi = new cu(), li = function(t, e) {
460
+ }(), ci = new Ya(), ui = function(t, e) {
683
461
  return t.x * e.y - t.y * e.x;
684
- }, Ys = function(t, e) {
462
+ }, zs = function(t, e) {
685
463
  return t.x * e.x + t.y * e.y;
686
- }, ls = function(t, e, r) {
464
+ }, os = function(t, e, r) {
687
465
  var i = {
688
466
  x: e.x - t.x,
689
467
  y: e.y - t.y
690
468
  }, o = {
691
469
  x: r.x - t.x,
692
470
  y: r.y - t.y
693
- }, s = li(i, o);
694
- return bo(s, 0);
471
+ }, s = ui(i, o);
472
+ return wo(s, 0);
695
473
  }, qi = function(t) {
696
- return Math.sqrt(Ys(t, t));
697
- }, fu = function(t, e, r) {
474
+ return Math.sqrt(zs(t, t));
475
+ }, Ha = function(t, e, r) {
698
476
  var i = {
699
477
  x: e.x - t.x,
700
478
  y: e.y - t.y
@@ -702,8 +480,8 @@ var lu = Hr * Hr, bo = function(t, e) {
702
480
  x: r.x - t.x,
703
481
  y: r.y - t.y
704
482
  };
705
- return li(o, i) / qi(o) / qi(i);
706
- }, hu = function(t, e, r) {
483
+ return ui(o, i) / qi(o) / qi(i);
484
+ }, Wa = function(t, e, r) {
707
485
  var i = {
708
486
  x: e.x - t.x,
709
487
  y: e.y - t.y
@@ -711,33 +489,33 @@ var lu = Hr * Hr, bo = function(t, e) {
711
489
  x: r.x - t.x,
712
490
  y: r.y - t.y
713
491
  };
714
- return Ys(o, i) / qi(o) / qi(i);
715
- }, cs = function(t, e, r) {
492
+ return zs(o, i) / qi(o) / qi(i);
493
+ }, ss = function(t, e, r) {
716
494
  return e.y === 0 ? null : {
717
495
  x: t.x + e.x / e.y * (r - t.y),
718
496
  y: r
719
497
  };
720
- }, fs = function(t, e, r) {
498
+ }, as = function(t, e, r) {
721
499
  return e.x === 0 ? null : {
722
500
  x: r,
723
501
  y: t.y + e.y / e.x * (r - t.x)
724
502
  };
725
- }, pu = function(t, e, r, i) {
503
+ }, ja = function(t, e, r, i) {
726
504
  if (e.x === 0)
727
- return fs(r, i, t.x);
505
+ return as(r, i, t.x);
728
506
  if (i.x === 0)
729
- return fs(t, e, r.x);
507
+ return as(t, e, r.x);
730
508
  if (e.y === 0)
731
- return cs(r, i, t.y);
509
+ return ss(r, i, t.y);
732
510
  if (i.y === 0)
733
- return cs(t, e, r.y);
734
- var o = li(e, i);
511
+ return ss(t, e, r.y);
512
+ var o = ui(e, i);
735
513
  if (o == 0)
736
514
  return null;
737
515
  var s = {
738
516
  x: r.x - t.x,
739
517
  y: r.y - t.y
740
- }, a = li(s, e) / o, u = li(s, i) / o, l = t.x + u * e.x, c = r.x + a * i.x, f = t.y + u * e.y, h = r.y + a * i.y, p = (l + c) / 2, g = (f + h) / 2;
518
+ }, a = ui(s, e) / o, u = ui(s, i) / o, l = t.x + u * e.x, c = r.x + a * i.x, f = t.y + u * e.y, h = r.y + a * i.y, p = (l + c) / 2, g = (f + h) / 2;
741
519
  return {
742
520
  x: p,
743
521
  y: g
@@ -811,8 +589,8 @@ var lu = Hr * Hr, bo = function(t, e) {
811
589
  var r = this, i = /* @__PURE__ */ new Map(), o = function(a) {
812
590
  var u = a.otherSE;
813
591
  i.set(a, {
814
- sine: fu(r.point, e.point, u.point),
815
- cosine: hu(r.point, e.point, u.point)
592
+ sine: Ha(r.point, e.point, u.point),
593
+ cosine: Wa(r.point, e.point, u.point)
816
594
  });
817
595
  };
818
596
  return function(s, a) {
@@ -822,7 +600,7 @@ var lu = Hr * Hr, bo = function(t, e) {
822
600
  };
823
601
  }
824
602
  }]), n;
825
- }(), gu = 0, Xi = /* @__PURE__ */ function() {
603
+ }(), Ka = 0, Xi = /* @__PURE__ */ function() {
826
604
  ae(n, null, [{
827
605
  key: "compare",
828
606
  /* This compare() function is for ordering segments in the sweep
@@ -898,7 +676,7 @@ var lu = Hr * Hr, bo = function(t, e) {
898
676
  * and possibly will be later modified */
899
677
  }]);
900
678
  function n(t, e, r, i) {
901
- Qe(this, n), this.id = ++gu, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = r, this.windings = i;
679
+ Qe(this, n), this.id = ++Ka, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = r, this.windings = i;
902
680
  }
903
681
  return ae(n, [{
904
682
  key: "replaceRightSE",
@@ -980,7 +758,7 @@ var lu = Hr * Hr, bo = function(t, e) {
980
758
  }, {
981
759
  key: "getIntersection",
982
760
  value: function(e) {
983
- var r = this.bbox(), i = e.bbox(), o = Po(r, i);
761
+ var r = this.bbox(), i = e.bbox(), o = Lo(r, i);
984
762
  if (o === null)
985
763
  return null;
986
764
  var s = this.leftSE.point, a = this.rightSE.point, u = e.leftSE.point, l = e.rightSE.point, c = ii(r, u) && this.comparePoint(u) === 0, f = ii(i, s) && e.comparePoint(s) === 0, h = ii(r, l) && this.comparePoint(l) === 0, p = ii(i, a) && e.comparePoint(a) === 0;
@@ -996,8 +774,8 @@ var lu = Hr * Hr, bo = function(t, e) {
996
774
  return a;
997
775
  if (h)
998
776
  return l;
999
- var g = pu(s, this.vector(), u, e.vector());
1000
- return g === null || !ii(o, g) ? null : fi.round(g.x, g.y);
777
+ var g = ja(s, this.vector(), u, e.vector());
778
+ return g === null || !ii(o, g) ? null : ci.round(g.x, g.y);
1001
779
  }
1002
780
  /**
1003
781
  * Split the given segment into multiple segments on the given points.
@@ -1161,13 +939,13 @@ var lu = Hr * Hr, bo = function(t, e) {
1161
939
  return new n(l, c, [i], [a]);
1162
940
  }
1163
941
  }]), n;
1164
- }(), hs = /* @__PURE__ */ function() {
942
+ }(), us = /* @__PURE__ */ function() {
1165
943
  function n(t, e, r) {
1166
944
  if (Qe(this, n), !Array.isArray(t) || t.length === 0)
1167
945
  throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
1168
946
  if (this.poly = e, this.isExterior = r, this.segments = [], typeof t[0][0] != "number" || typeof t[0][1] != "number")
1169
947
  throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
1170
- var i = fi.round(t[0][0], t[0][1]);
948
+ var i = ci.round(t[0][0], t[0][1]);
1171
949
  this.bbox = {
1172
950
  ll: {
1173
951
  x: i.x,
@@ -1181,7 +959,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1181
959
  for (var o = i, s = 1, a = t.length; s < a; s++) {
1182
960
  if (typeof t[s][0] != "number" || typeof t[s][1] != "number")
1183
961
  throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
1184
- var u = fi.round(t[s][0], t[s][1]);
962
+ var u = ci.round(t[s][0], t[s][1]);
1185
963
  u.x === o.x && u.y === o.y || (this.segments.push(Xi.fromRing(o, u, this)), u.x < this.bbox.ll.x && (this.bbox.ll.x = u.x), u.y < this.bbox.ll.y && (this.bbox.ll.y = u.y), u.x > this.bbox.ur.x && (this.bbox.ur.x = u.x), u.y > this.bbox.ur.y && (this.bbox.ur.y = u.y), o = u);
1186
964
  }
1187
965
  (i.x !== o.x || i.y !== o.y) && this.segments.push(Xi.fromRing(o, i, this));
@@ -1196,11 +974,11 @@ var lu = Hr * Hr, bo = function(t, e) {
1196
974
  return e;
1197
975
  }
1198
976
  }]), n;
1199
- }(), du = /* @__PURE__ */ function() {
977
+ }(), Qa = /* @__PURE__ */ function() {
1200
978
  function n(t, e) {
1201
979
  if (Qe(this, n), !Array.isArray(t))
1202
980
  throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
1203
- this.exteriorRing = new hs(t[0], this, !0), this.bbox = {
981
+ this.exteriorRing = new us(t[0], this, !0), this.bbox = {
1204
982
  ll: {
1205
983
  x: this.exteriorRing.bbox.ll.x,
1206
984
  y: this.exteriorRing.bbox.ll.y
@@ -1211,7 +989,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1211
989
  }
1212
990
  }, this.interiorRings = [];
1213
991
  for (var r = 1, i = t.length; r < i; r++) {
1214
- var o = new hs(t[r], this, !1);
992
+ var o = new us(t[r], this, !1);
1215
993
  o.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = o.bbox.ll.x), o.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = o.bbox.ll.y), o.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = o.bbox.ur.x), o.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = o.bbox.ur.y), this.interiorRings.push(o);
1216
994
  }
1217
995
  this.multiPoly = e;
@@ -1225,7 +1003,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1225
1003
  return e;
1226
1004
  }
1227
1005
  }]), n;
1228
- }(), ps = /* @__PURE__ */ function() {
1006
+ }(), ls = /* @__PURE__ */ function() {
1229
1007
  function n(t, e) {
1230
1008
  if (Qe(this, n), !Array.isArray(t))
1231
1009
  throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1244,7 +1022,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1244
1022
  }
1245
1023
  };
1246
1024
  for (var r = 0, i = t.length; r < i; r++) {
1247
- var o = new du(t[r], this);
1025
+ var o = new Qa(t[r], this);
1248
1026
  o.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = o.bbox.ll.x), o.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = o.bbox.ll.y), o.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = o.bbox.ur.x), o.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = o.bbox.ur.y), this.polys.push(o);
1249
1027
  }
1250
1028
  this.isSubject = e;
@@ -1258,7 +1036,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1258
1036
  return e;
1259
1037
  }
1260
1038
  }]), n;
1261
- }(), vu = /* @__PURE__ */ function() {
1039
+ }(), Ja = /* @__PURE__ */ function() {
1262
1040
  ae(n, null, [{
1263
1041
  key: "factory",
1264
1042
  /* Given the segments from the sweep line pass, compute & return a series
@@ -1313,12 +1091,12 @@ var lu = Hr * Hr, bo = function(t, e) {
1313
1091
  value: function() {
1314
1092
  for (var e = this.events[0].point, r = [e], i = 1, o = this.events.length - 1; i < o; i++) {
1315
1093
  var s = this.events[i].point, a = this.events[i + 1].point;
1316
- ls(s, e, a) !== 0 && (r.push(s), e = s);
1094
+ os(s, e, a) !== 0 && (r.push(s), e = s);
1317
1095
  }
1318
1096
  if (r.length === 1)
1319
1097
  return null;
1320
1098
  var u = r[0], l = r[1];
1321
- ls(u, e, l) === 0 && r.shift(), r.push(r[0]);
1099
+ os(u, e, l) === 0 && r.shift(), r.push(r[0]);
1322
1100
  for (var c = this.isExteriorRing() ? 1 : -1, f = this.isExteriorRing() ? 0 : r.length - 1, h = this.isExteriorRing() ? r.length : -1, p = [], g = f; g != h; g += c)
1323
1101
  p.push([r[g].x, r[g].y]);
1324
1102
  return p;
@@ -1356,7 +1134,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1356
1134
  }
1357
1135
  }
1358
1136
  }]), n;
1359
- }(), gs = /* @__PURE__ */ function() {
1137
+ }(), cs = /* @__PURE__ */ function() {
1360
1138
  function n(t) {
1361
1139
  Qe(this, n), this.exteriorRing = t, t.poly = this, this.interiorRings = [];
1362
1140
  }
@@ -1378,7 +1156,7 @@ var lu = Hr * Hr, bo = function(t, e) {
1378
1156
  return e;
1379
1157
  }
1380
1158
  }]), n;
1381
- }(), yu = /* @__PURE__ */ function() {
1159
+ }(), Za = /* @__PURE__ */ function() {
1382
1160
  function n(t) {
1383
1161
  Qe(this, n), this.rings = t, this.polys = this._composePolys(t);
1384
1162
  }
@@ -1398,19 +1176,19 @@ var lu = Hr * Hr, bo = function(t, e) {
1398
1176
  var s = e[i];
1399
1177
  if (!s.poly)
1400
1178
  if (s.isExteriorRing())
1401
- r.push(new gs(s));
1179
+ r.push(new cs(s));
1402
1180
  else {
1403
1181
  var a = s.enclosingRing();
1404
- a.poly || r.push(new gs(a)), a.poly.addInterior(s);
1182
+ a.poly || r.push(new cs(a)), a.poly.addInterior(s);
1405
1183
  }
1406
1184
  }
1407
1185
  return r;
1408
1186
  }
1409
1187
  }]), n;
1410
- }(), mu = /* @__PURE__ */ function() {
1188
+ }(), $a = /* @__PURE__ */ function() {
1411
1189
  function n(t) {
1412
1190
  var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : Xi.compare;
1413
- Qe(this, n), this.queue = t, this.tree = new Vo(e), this.segments = [];
1191
+ Qe(this, n), this.queue = t, this.tree = new Go(e), this.segments = [];
1414
1192
  }
1415
1193
  return ae(n, [{
1416
1194
  key: "process",
@@ -1483,38 +1261,38 @@ var lu = Hr * Hr, bo = function(t, e) {
1483
1261
  return o.push(i), e.consumedBy === void 0 && this.tree.insert(e), o;
1484
1262
  }
1485
1263
  }]), n;
1486
- }(), ds = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, _u = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6, Eu = /* @__PURE__ */ function() {
1264
+ }(), fs = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, tu = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6, eu = /* @__PURE__ */ function() {
1487
1265
  function n() {
1488
1266
  Qe(this, n);
1489
1267
  }
1490
1268
  return ae(n, [{
1491
1269
  key: "run",
1492
1270
  value: function(e, r, i) {
1493
- tr.type = e, fi.reset();
1494
- for (var o = [new ps(r, !0)], s = 0, a = i.length; s < a; s++)
1495
- o.push(new ps(i[s], !1));
1271
+ tr.type = e, ci.reset();
1272
+ for (var o = [new ls(r, !0)], s = 0, a = i.length; s < a; s++)
1273
+ o.push(new ls(i[s], !1));
1496
1274
  if (tr.numMultiPolys = o.length, tr.type === "difference")
1497
1275
  for (var u = o[0], l = 1; l < o.length; )
1498
- Po(o[l].bbox, u.bbox) !== null ? l++ : o.splice(l, 1);
1276
+ Lo(o[l].bbox, u.bbox) !== null ? l++ : o.splice(l, 1);
1499
1277
  if (tr.type === "intersection") {
1500
1278
  for (var c = 0, f = o.length; c < f; c++)
1501
1279
  for (var h = o[c], p = c + 1, g = o.length; p < g; p++)
1502
- if (Po(h.bbox, o[p].bbox) === null)
1280
+ if (Lo(h.bbox, o[p].bbox) === null)
1503
1281
  return [];
1504
1282
  }
1505
- for (var y = new Vo(yr.compare), m = 0, _ = o.length; m < _; m++)
1283
+ for (var y = new Go(yr.compare), m = 0, _ = o.length; m < _; m++)
1506
1284
  for (var I = o[m].getSweepEvents(), C = 0, x = I.length; C < x; C++)
1507
- if (y.insert(I[C]), y.size > ds)
1285
+ if (y.insert(I[C]), y.size > fs)
1508
1286
  throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big). Please file a bug report.");
1509
- for (var b = new mu(y), P = y.size, D = y.pop(); D; ) {
1287
+ for (var b = new $a(y), P = y.size, D = y.pop(); D; ) {
1510
1288
  var G = D.key;
1511
1289
  if (y.size === P) {
1512
1290
  var A = G.segment;
1513
1291
  throw new Error("Unable to pop() ".concat(G.isLeft ? "left" : "right", " SweepEvent ") + "[".concat(G.point.x, ", ").concat(G.point.y, "] from segment #").concat(A.id, " ") + "[".concat(A.leftSE.point.x, ", ").concat(A.leftSE.point.y, "] -> ") + "[".concat(A.rightSE.point.x, ", ").concat(A.rightSE.point.y, "] from queue. ") + "Please file a bug report.");
1514
1292
  }
1515
- if (y.size > ds)
1293
+ if (y.size > fs)
1516
1294
  throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big). Please file a bug report.");
1517
- if (b.segments.length > _u)
1295
+ if (b.segments.length > tu)
1518
1296
  throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments). Please file a bug report.");
1519
1297
  for (var et = b.process(G), K = 0, nt = et.length; K < nt; K++) {
1520
1298
  var ct = et[K];
@@ -1522,33 +1300,33 @@ var lu = Hr * Hr, bo = function(t, e) {
1522
1300
  }
1523
1301
  P = y.size, D = y.pop();
1524
1302
  }
1525
- fi.reset();
1526
- var w = vu.factory(b.segments), X = new yu(w);
1303
+ ci.reset();
1304
+ var w = Ja.factory(b.segments), X = new Za(w);
1527
1305
  return X.getGeom();
1528
1306
  }
1529
1307
  }]), n;
1530
- }(), tr = new Eu(), Iu = function(t) {
1308
+ }(), tr = new eu(), ru = function(t) {
1531
1309
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1532
1310
  r[i - 1] = arguments[i];
1533
1311
  return tr.run("union", t, r);
1534
- }, Cu = function(t) {
1312
+ }, nu = function(t) {
1535
1313
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1536
1314
  r[i - 1] = arguments[i];
1537
1315
  return tr.run("intersection", t, r);
1538
- }, Nu = function(t) {
1316
+ }, iu = function(t) {
1539
1317
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1540
1318
  r[i - 1] = arguments[i];
1541
1319
  return tr.run("xor", t, r);
1542
- }, xu = function(t) {
1320
+ }, ou = function(t) {
1543
1321
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1544
1322
  r[i - 1] = arguments[i];
1545
1323
  return tr.run("difference", t, r);
1546
- }, Hs = {
1547
- union: Iu,
1548
- intersection: Cu,
1549
- xor: Nu,
1550
- difference: xu
1551
- }, ie = 63710088e-1, Ws = {
1324
+ }, Us = {
1325
+ union: ru,
1326
+ intersection: nu,
1327
+ xor: iu,
1328
+ difference: ou
1329
+ }, ie = 63710088e-1, qs = {
1552
1330
  centimeters: ie * 100,
1553
1331
  centimetres: ie * 100,
1554
1332
  degrees: ie / 111325,
@@ -1565,27 +1343,27 @@ var lu = Hr * Hr, bo = function(t, e) {
1565
1343
  radians: 1,
1566
1344
  yards: ie * 1.0936
1567
1345
  };
1568
- function no(n, t, e) {
1346
+ function ro(n, t, e) {
1569
1347
  e === void 0 && (e = {});
1570
1348
  var r = { type: "Feature" };
1571
1349
  return (e.id === 0 || e.id) && (r.id = e.id), e.bbox && (r.bbox = e.bbox), r.properties = t || {}, r.geometry = n, r;
1572
1350
  }
1573
- function Su(n, t, e) {
1351
+ function su(n, t, e) {
1574
1352
  if (e === void 0 && (e = {}), !n)
1575
1353
  throw new Error("coordinates is required");
1576
1354
  if (!Array.isArray(n))
1577
1355
  throw new Error("coordinates must be an Array");
1578
1356
  if (n.length < 2)
1579
1357
  throw new Error("coordinates must be at least 2 numbers long");
1580
- if (!vs(n[0]) || !vs(n[1]))
1358
+ if (!hs(n[0]) || !hs(n[1]))
1581
1359
  throw new Error("coordinates must contain numbers");
1582
1360
  var r = {
1583
1361
  type: "Point",
1584
1362
  coordinates: n
1585
1363
  };
1586
- return no(r, t, e);
1364
+ return ro(r, t, e);
1587
1365
  }
1588
- function js(n, t, e) {
1366
+ function Xs(n, t, e) {
1589
1367
  e === void 0 && (e = {});
1590
1368
  for (var r = 0, i = n; r < i.length; r++) {
1591
1369
  var o = i[r];
@@ -1599,52 +1377,267 @@ function js(n, t, e) {
1599
1377
  type: "Polygon",
1600
1378
  coordinates: n
1601
1379
  };
1602
- return no(a, t, e);
1380
+ return ro(a, t, e);
1603
1381
  }
1604
- function Ro(n, t) {
1382
+ function Po(n, t) {
1605
1383
  t === void 0 && (t = {});
1606
1384
  var e = { type: "FeatureCollection" };
1607
1385
  return t.id && (e.id = t.id), t.bbox && (e.bbox = t.bbox), e.features = n, e;
1608
1386
  }
1609
- function Ks(n, t, e) {
1387
+ function Ys(n, t, e) {
1610
1388
  e === void 0 && (e = {});
1611
1389
  var r = {
1612
1390
  type: "MultiPolygon",
1613
1391
  coordinates: n
1614
1392
  };
1615
- return no(r, t, e);
1393
+ return ro(r, t, e);
1616
1394
  }
1617
- function Lu(n, t) {
1395
+ function au(n, t) {
1618
1396
  t === void 0 && (t = "kilometers");
1619
- var e = Ws[t];
1397
+ var e = qs[t];
1620
1398
  if (!e)
1621
1399
  throw new Error(t + " units is invalid");
1622
1400
  return n * e;
1623
1401
  }
1624
- function wu(n, t) {
1402
+ function uu(n, t) {
1625
1403
  t === void 0 && (t = "kilometers");
1626
- var e = Ws[t];
1404
+ var e = qs[t];
1627
1405
  if (!e)
1628
1406
  throw new Error(t + " units is invalid");
1629
1407
  return n / e;
1630
1408
  }
1631
- function vs(n) {
1409
+ function hs(n) {
1632
1410
  return !isNaN(n) && n !== null && !Array.isArray(n);
1633
1411
  }
1634
1412
  function Yi(n) {
1635
1413
  return n.type === "Feature" ? n.geometry : n;
1636
1414
  }
1637
- function Pu(n, t, e) {
1415
+ function lu(n, t, e) {
1638
1416
  e === void 0 && (e = {});
1639
- var r = Yi(n), i = Yi(t), o = Hs.union(r.coordinates, i.coordinates);
1640
- return o.length === 0 ? null : o.length === 1 ? js(o[0], e.properties) : Ks(o, e.properties);
1417
+ var r = Yi(n), i = Yi(t), o = Us.union(r.coordinates, i.coordinates);
1418
+ return o.length === 0 ? null : o.length === 1 ? Xs(o[0], e.properties) : Ys(o, e.properties);
1641
1419
  }
1642
- function bu(n, t) {
1643
- var e = Yi(n), r = Yi(t), i = n.properties || {}, o = Hs.difference(
1644
- e.coordinates,
1645
- r.coordinates
1646
- );
1647
- return o.length === 0 ? null : o.length === 1 ? js(o[0], i) : Ks(o, i);
1420
+ function fi() {
1421
+ }
1422
+ function Hs(n) {
1423
+ return n();
1424
+ }
1425
+ function ps() {
1426
+ return /* @__PURE__ */ Object.create(null);
1427
+ }
1428
+ function no(n) {
1429
+ n.forEach(Hs);
1430
+ }
1431
+ function Ws(n) {
1432
+ return typeof n == "function";
1433
+ }
1434
+ function cu(n, t) {
1435
+ return n != n ? t == t : n !== t || n && typeof n == "object" || typeof n == "function";
1436
+ }
1437
+ function fu(n) {
1438
+ return Object.keys(n).length === 0;
1439
+ }
1440
+ function hu(n, t) {
1441
+ n.appendChild(t);
1442
+ }
1443
+ function pu(n, t, e) {
1444
+ n.insertBefore(t, e || null);
1445
+ }
1446
+ function js(n) {
1447
+ n.parentNode && n.parentNode.removeChild(n);
1448
+ }
1449
+ function gs(n) {
1450
+ return document.createElementNS("http://www.w3.org/2000/svg", n);
1451
+ }
1452
+ function pr(n, t, e) {
1453
+ e == null ? n.removeAttribute(t) : n.getAttribute(t) !== e && n.setAttribute(t, e);
1454
+ }
1455
+ function gu(n) {
1456
+ return Array.from(n.childNodes);
1457
+ }
1458
+ function Ai(n, t, e) {
1459
+ n.classList[e ? "add" : "remove"](t);
1460
+ }
1461
+ let Vo;
1462
+ function li(n) {
1463
+ Vo = n;
1464
+ }
1465
+ const Pn = [], ds = [];
1466
+ let Rn = [];
1467
+ const vs = [], du = /* @__PURE__ */ Promise.resolve();
1468
+ let bo = !1;
1469
+ function vu() {
1470
+ bo || (bo = !0, du.then(Ks));
1471
+ }
1472
+ function Ro(n) {
1473
+ Rn.push(n);
1474
+ }
1475
+ const mo = /* @__PURE__ */ new Set();
1476
+ let wn = 0;
1477
+ function Ks() {
1478
+ if (wn !== 0)
1479
+ return;
1480
+ const n = Vo;
1481
+ do {
1482
+ try {
1483
+ for (; wn < Pn.length; ) {
1484
+ const t = Pn[wn];
1485
+ wn++, li(t), yu(t.$$);
1486
+ }
1487
+ } catch (t) {
1488
+ throw Pn.length = 0, wn = 0, t;
1489
+ }
1490
+ for (li(null), Pn.length = 0, wn = 0; ds.length; )
1491
+ ds.pop()();
1492
+ for (let t = 0; t < Rn.length; t += 1) {
1493
+ const e = Rn[t];
1494
+ mo.has(e) || (mo.add(e), e());
1495
+ }
1496
+ Rn.length = 0;
1497
+ } while (Pn.length);
1498
+ for (; vs.length; )
1499
+ vs.pop()();
1500
+ bo = !1, mo.clear(), li(n);
1501
+ }
1502
+ function yu(n) {
1503
+ if (n.fragment !== null) {
1504
+ n.update(), no(n.before_update);
1505
+ const t = n.dirty;
1506
+ n.dirty = [-1], n.fragment && n.fragment.p(n.ctx, t), n.after_update.forEach(Ro);
1507
+ }
1508
+ }
1509
+ function mu(n) {
1510
+ const t = [], e = [];
1511
+ Rn.forEach((r) => n.indexOf(r) === -1 ? t.push(r) : e.push(r)), e.forEach((r) => r()), Rn = t;
1512
+ }
1513
+ const _u = /* @__PURE__ */ new Set();
1514
+ function Eu(n, t) {
1515
+ n && n.i && (_u.delete(n), n.i(t));
1516
+ }
1517
+ function Iu(n, t, e, r) {
1518
+ const { fragment: i, after_update: o } = n.$$;
1519
+ i && i.m(t, e), r || Ro(() => {
1520
+ const s = n.$$.on_mount.map(Hs).filter(Ws);
1521
+ n.$$.on_destroy ? n.$$.on_destroy.push(...s) : no(s), n.$$.on_mount = [];
1522
+ }), o.forEach(Ro);
1523
+ }
1524
+ function Cu(n, t) {
1525
+ const e = n.$$;
1526
+ e.fragment !== null && (mu(e.after_update), no(e.on_destroy), e.fragment && e.fragment.d(t), e.on_destroy = e.fragment = null, e.ctx = []);
1527
+ }
1528
+ function Nu(n, t) {
1529
+ n.$$.dirty[0] === -1 && (Pn.push(n), vu(), n.$$.dirty.fill(0)), n.$$.dirty[t / 31 | 0] |= 1 << t % 31;
1530
+ }
1531
+ function xu(n, t, e, r, i, o, s, a = [-1]) {
1532
+ const u = Vo;
1533
+ li(n);
1534
+ const l = n.$$ = {
1535
+ fragment: null,
1536
+ ctx: [],
1537
+ // state
1538
+ props: o,
1539
+ update: fi,
1540
+ not_equal: i,
1541
+ bound: ps(),
1542
+ // lifecycle
1543
+ on_mount: [],
1544
+ on_destroy: [],
1545
+ on_disconnect: [],
1546
+ before_update: [],
1547
+ after_update: [],
1548
+ context: new Map(t.context || (u ? u.$$.context : [])),
1549
+ // everything else
1550
+ callbacks: ps(),
1551
+ dirty: a,
1552
+ skip_bound: !1,
1553
+ root: t.target || u.$$.root
1554
+ };
1555
+ s && s(l.root);
1556
+ let c = !1;
1557
+ if (l.ctx = e ? e(n, t.props || {}, (f, h, ...p) => {
1558
+ const g = p.length ? p[0] : h;
1559
+ return l.ctx && i(l.ctx[f], l.ctx[f] = g) && (!l.skip_bound && l.bound[f] && l.bound[f](g), c && Nu(n, f)), h;
1560
+ }) : [], l.update(), c = !0, no(l.before_update), l.fragment = r ? r(l.ctx) : !1, t.target) {
1561
+ if (t.hydrate) {
1562
+ const f = gu(t.target);
1563
+ l.fragment && l.fragment.l(f), f.forEach(js);
1564
+ } else
1565
+ l.fragment && l.fragment.c();
1566
+ t.intro && Eu(n.$$.fragment), Iu(n, t.target, t.anchor, t.customElement), Ks();
1567
+ }
1568
+ li(u);
1569
+ }
1570
+ class Su {
1571
+ $destroy() {
1572
+ Cu(this, 1), this.$destroy = fi;
1573
+ }
1574
+ $on(t, e) {
1575
+ if (!Ws(e))
1576
+ return fi;
1577
+ const r = this.$$.callbacks[t] || (this.$$.callbacks[t] = []);
1578
+ return r.push(e), () => {
1579
+ const i = r.indexOf(e);
1580
+ i !== -1 && r.splice(i, 1);
1581
+ };
1582
+ }
1583
+ $set(t) {
1584
+ this.$$set && !fu(t) && (this.$$.skip_bound = !0, this.$$set(t), this.$$.skip_bound = !1);
1585
+ }
1586
+ }
1587
+ function Lu(n) {
1588
+ let t, e, r;
1589
+ return {
1590
+ c() {
1591
+ t = gs("svg"), e = gs("path"), pr(e, "stroke-width", "4"), pr(e, "fill-rule", "evenodd"), pr(e, "clip-rule", "evenodd"), pr(e, "d", "M 5,33.103579 C 5,17.607779 18.457,5 35,5 C 51.543,5 65,17.607779 65,33.103579 C 65,56.388679 40.4668,76.048179 36.6112,79.137779 C 36.3714,79.329879 36.2116,79.457979 36.1427,79.518879 C 35.8203,79.800879 35.4102,79.942779 35,79.942779 C 34.5899,79.942779 34.1797,79.800879 33.8575,79.518879 C 33.7886,79.457979 33.6289,79.330079 33.3893,79.138079 C 29.5346,76.049279 5,56.389379 5,33.103579 Z M 35.0001,49.386379 C 43.1917,49.386379 49.8323,42.646079 49.8323,34.331379 C 49.8323,26.016779 43.1917,19.276479 35.0001,19.276479 C 26.8085,19.276479 20.1679,26.016779 20.1679,34.331379 C 20.1679,42.646079 26.8085,49.386379 35.0001,49.386379 Z"), pr(e, "class", "svelte-1k1cmht"), pr(t, "width", r = /*displayIn*/
1592
+ n[0] !== "list" ? void 0 : "20"), pr(t, "viewBox", "0 0 70 85"), pr(t, "fill", "none"), pr(t, "class", "svelte-1k1cmht"), Ai(
1593
+ t,
1594
+ "in-map",
1595
+ /*displayIn*/
1596
+ n[0] !== "list"
1597
+ ), Ai(
1598
+ t,
1599
+ "list-icon",
1600
+ /*displayIn*/
1601
+ n[0] === "list"
1602
+ );
1603
+ },
1604
+ m(i, o) {
1605
+ pu(i, t, o), hu(t, e);
1606
+ },
1607
+ p(i, [o]) {
1608
+ o & /*displayIn*/
1609
+ 1 && r !== (r = /*displayIn*/
1610
+ i[0] !== "list" ? void 0 : "20") && pr(t, "width", r), o & /*displayIn*/
1611
+ 1 && Ai(
1612
+ t,
1613
+ "in-map",
1614
+ /*displayIn*/
1615
+ i[0] !== "list"
1616
+ ), o & /*displayIn*/
1617
+ 1 && Ai(
1618
+ t,
1619
+ "list-icon",
1620
+ /*displayIn*/
1621
+ i[0] === "list"
1622
+ );
1623
+ },
1624
+ i: fi,
1625
+ o: fi,
1626
+ d(i) {
1627
+ i && js(t);
1628
+ }
1629
+ };
1630
+ }
1631
+ function wu(n, t, e) {
1632
+ let { displayIn: r } = t;
1633
+ return n.$$set = (i) => {
1634
+ "displayIn" in i && e(0, r = i.displayIn);
1635
+ }, [r];
1636
+ }
1637
+ class Pu extends Su {
1638
+ constructor(t) {
1639
+ super(), xu(this, t, wu, Lu, cu, { displayIn: 0 });
1640
+ }
1648
1641
  }
1649
1642
  function Qs(n, t, e) {
1650
1643
  if (n !== null)
@@ -1798,10 +1791,10 @@ function Oo(n) {
1798
1791
  }), t;
1799
1792
  }
1800
1793
  Oo.default = Oo;
1801
- function Ru(n, t) {
1794
+ function bu(n, t) {
1802
1795
  t === void 0 && (t = {});
1803
1796
  var e = Oo(n), r = (e[0] + e[2]) / 2, i = (e[1] + e[3]) / 2;
1804
- return Su([r, i], t.properties, t);
1797
+ return su([r, i], t.properties, t);
1805
1798
  }
1806
1799
  "fill" in Array.prototype || Object.defineProperty(Array.prototype, "fill", {
1807
1800
  configurable: !0,
@@ -3998,7 +3991,7 @@ var S = function(n) {
3998
3991
  var o = this.array_[r];
3999
3992
  return this.array_[r] = i, o;
4000
3993
  }, t.prototype.iterator = function() {
4001
- return new Ou(this);
3994
+ return new Ru(this);
4002
3995
  }, t.prototype.get = function(r) {
4003
3996
  if (r < 0 || r >= this.size())
4004
3997
  throw new zo();
@@ -4019,7 +4012,7 @@ var S = function(n) {
4019
4012
  }
4020
4013
  return o;
4021
4014
  }, t;
4022
- }(Ne), Ou = function(n) {
4015
+ }(Ne), Ru = function(n) {
4023
4016
  function t(e) {
4024
4017
  n.call(this), this.arrayList_ = e, this.position_ = 0;
4025
4018
  }
@@ -4348,7 +4341,7 @@ xn.prototype.values = function() {
4348
4341
  };
4349
4342
  xn.prototype.entrySet = function() {
4350
4343
  };
4351
- var Du = function(n) {
4344
+ var Ou = function(n) {
4352
4345
  function t() {
4353
4346
  n.apply(this, arguments);
4354
4347
  }
@@ -4392,9 +4385,9 @@ var Uo = function(n) {
4392
4385
  i.push(r.array_[o]);
4393
4386
  return i;
4394
4387
  }, t.prototype.iterator = function() {
4395
- return new Tu(this);
4388
+ return new Du(this);
4396
4389
  }, t;
4397
- }(ao), Tu = function(n) {
4390
+ }(ao), Du = function(n) {
4398
4391
  function t(e) {
4399
4392
  n.call(this), this.hashSet_ = e, this.position_ = 0;
4400
4393
  }
@@ -4426,7 +4419,7 @@ function _s(n) {
4426
4419
  function At() {
4427
4420
  this.root_ = null, this.size_ = 0;
4428
4421
  }
4429
- At.prototype = new Du();
4422
+ At.prototype = new Ou();
4430
4423
  At.prototype.get = function(n) {
4431
4424
  for (var t = this.root_; t !== null; ) {
4432
4425
  var e = n.compareTo(t.key);
@@ -4990,18 +4983,18 @@ Wi.prototype.interfaces_ = function() {
4990
4983
  Wi.prototype.getClass = function() {
4991
4984
  return Wi;
4992
4985
  };
4993
- function Mu() {
4986
+ function Tu() {
4994
4987
  }
4995
- function Au() {
4988
+ function Mu() {
4996
4989
  }
4997
- var Fu = function() {
4990
+ var Au = function() {
4998
4991
  };
4992
+ function Fu() {
4993
+ }
4999
4994
  function Bu() {
5000
4995
  }
5001
4996
  function Gu() {
5002
4997
  }
5003
- function Vu() {
5004
- }
5005
4998
  var de = function() {
5006
4999
  }, qo = { NEWLINE: { configurable: !0 }, SIMPLE_ORDINATE_FORMAT: { configurable: !0 } };
5007
5000
  de.prototype.interfaces_ = function() {
@@ -5017,16 +5010,16 @@ de.chars = function(t, e) {
5017
5010
  };
5018
5011
  de.getStackTrace = function() {
5019
5012
  if (arguments.length === 1) {
5020
- var t = arguments[0], e = new Bu(), r = new Mu();
5013
+ var t = arguments[0], e = new Fu(), r = new Tu();
5021
5014
  return t.printStackTrace(r), e.toString();
5022
5015
  } else if (arguments.length === 2) {
5023
5016
  var i = arguments[0], o = arguments[1], s = "";
5024
- new Au(de.getStackTrace(i));
5025
- for (var a = new Vu(), u = 0; u < o; u++)
5017
+ new Mu(de.getStackTrace(i));
5018
+ for (var a = new Gu(), u = 0; u < o; u++)
5026
5019
  try {
5027
5020
  s += a.readLine() + de.NEWLINE;
5028
5021
  } catch (l) {
5029
- if (l instanceof Gu)
5022
+ if (l instanceof Bu)
5030
5023
  V.shouldNeverReachHere();
5031
5024
  else
5032
5025
  throw l;
@@ -5058,7 +5051,7 @@ qo.NEWLINE.get = function() {
5058
5051
  return Rt.getProperty("line.separator");
5059
5052
  };
5060
5053
  qo.SIMPLE_ORDINATE_FORMAT.get = function() {
5061
- return new Fu();
5054
+ return new Au();
5062
5055
  };
5063
5056
  Object.defineProperties(de, qo);
5064
5057
  var gt = function() {
@@ -6234,7 +6227,7 @@ sa.serialVersionUID.get = function() {
6234
6227
  return -6820524753094096e3;
6235
6228
  };
6236
6229
  Object.defineProperties(k, sa);
6237
- var ku = ["Point", "MultiPoint", "LineString", "MultiLineString", "Polygon", "MultiPolygon"], co = function(t) {
6230
+ var Vu = ["Point", "MultiPoint", "LineString", "MultiLineString", "Polygon", "MultiPolygon"], co = function(t) {
6238
6231
  this.geometryFactory = t || new k();
6239
6232
  };
6240
6233
  co.prototype.read = function(t) {
@@ -6243,7 +6236,7 @@ co.prototype.read = function(t) {
6243
6236
  var r = e.type;
6244
6237
  if (!Fe[r])
6245
6238
  throw new Error("Unknown GeoJSON type: " + e.type);
6246
- return ku.indexOf(r) !== -1 ? Fe[r].apply(this, [e.coordinates]) : r === "GeometryCollection" ? Fe[r].apply(this, [e.geometries]) : Fe[r].apply(this, [e]);
6239
+ return Vu.indexOf(r) !== -1 ? Fe[r].apply(this, [e.coordinates]) : r === "GeometryCollection" ? Fe[r].apply(this, [e.geometries]) : Fe[r].apply(this, [e]);
6247
6240
  };
6248
6241
  co.prototype.write = function(t) {
6249
6242
  var e = t.getGeometryType();
@@ -7149,7 +7142,7 @@ mt.prototype.interfaces_ = function() {
7149
7142
  mt.prototype.getClass = function() {
7150
7143
  return mt;
7151
7144
  };
7152
- var zu = function(n) {
7145
+ var ku = function(n) {
7153
7146
  function t() {
7154
7147
  var e = arguments[0], r = arguments[1];
7155
7148
  n.call(this, e, r);
@@ -7163,7 +7156,7 @@ var zu = function(n) {
7163
7156
  }, t.prototype.getClass = function() {
7164
7157
  return t;
7165
7158
  }, t;
7166
- }(mt), Uu = function(n) {
7159
+ }(mt), zu = function(n) {
7167
7160
  function t() {
7168
7161
  var e = arguments[0], r = arguments[1];
7169
7162
  n.call(this, e, r);
@@ -7172,7 +7165,7 @@ var zu = function(n) {
7172
7165
  var r = this, i = new S(), o = this._startDe;
7173
7166
  do {
7174
7167
  if (o.getMinEdgeRing() === null) {
7175
- var s = new zu(o, r._geometryFactory);
7168
+ var s = new ku(o, r._geometryFactory);
7176
7169
  i.add(s);
7177
7170
  }
7178
7171
  o = o.getNext();
@@ -7737,7 +7730,7 @@ ee.prototype.buildMaximalEdgeRings = function(t) {
7737
7730
  for (var e = this, r = new S(), i = t.iterator(); i.hasNext(); ) {
7738
7731
  var o = i.next();
7739
7732
  if (o.isInResult() && o.getLabel().isArea() && o.getEdgeRing() === null) {
7740
- var s = new Uu(o, e._geometryFactory);
7733
+ var s = new zu(o, e._geometryFactory);
7741
7734
  r.add(s), s.setInResult();
7742
7735
  }
7743
7736
  }
@@ -8150,7 +8143,7 @@ xt.compareDoubles = function(t, e) {
8150
8143
  return t > e ? 1 : t < e ? -1 : 0;
8151
8144
  };
8152
8145
  vo.IntersectsOp.get = function() {
8153
- return qu;
8146
+ return Uu;
8154
8147
  };
8155
8148
  vo.serialVersionUID.get = function() {
8156
8149
  return -3886435814360241e3;
@@ -8159,7 +8152,7 @@ vo.DEFAULT_NODE_CAPACITY.get = function() {
8159
8152
  return 10;
8160
8153
  };
8161
8154
  Object.defineProperties(xt, vo);
8162
- var qu = function() {
8155
+ var Uu = function() {
8163
8156
  }, zn = function() {
8164
8157
  };
8165
8158
  zn.prototype.distance = function(t, e) {
@@ -10069,7 +10062,7 @@ Bt.prototype.interfaces_ = function() {
10069
10062
  Bt.prototype.getClass = function() {
10070
10063
  return Bt;
10071
10064
  };
10072
- var Xu = function(n) {
10065
+ var qu = function(n) {
10073
10066
  function t() {
10074
10067
  n.call(this), this._resultAreaEdgeList = null, this._label = null, this._SCANNING_FOR_INCOMING = 1, this._LINKING_TO_OUTGOING = 2;
10075
10068
  }
@@ -10227,7 +10220,7 @@ var Xu = function(n) {
10227
10220
  n.apply(this, arguments);
10228
10221
  }
10229
10222
  return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.createNode = function(r) {
10230
- return new go(r, new Xu());
10223
+ return new go(r, new qu());
10231
10224
  }, t.prototype.interfaces_ = function() {
10232
10225
  return [];
10233
10226
  }, t.prototype.getClass = function() {
@@ -13004,7 +12997,7 @@ Tt.prototype.getClass = function() {
13004
12997
  Tt.isAdjacentSegments = function(t, e) {
13005
12998
  return Math.abs(t - e) === 1;
13006
12999
  };
13007
- var Yu = function(n) {
13000
+ var Xu = function(n) {
13008
13001
  function t() {
13009
13002
  n.call(this), this.events = new S(), this.nOverlaps = null;
13010
13003
  }
@@ -13101,7 +13094,7 @@ xi.prototype.interfaces_ = function() {
13101
13094
  xi.prototype.getClass = function() {
13102
13095
  return xi;
13103
13096
  };
13104
- var Hu = function(n) {
13097
+ var Yu = function(n) {
13105
13098
  function t() {
13106
13099
  n.call(this), this._item = null;
13107
13100
  var e = arguments[0], r = arguments[1], i = arguments[2];
@@ -13116,7 +13109,7 @@ var Hu = function(n) {
13116
13109
  }, t.prototype.getClass = function() {
13117
13110
  return t;
13118
13111
  }, t;
13119
- }(cr), Wu = function(n) {
13112
+ }(cr), Hu = function(n) {
13120
13113
  function t() {
13121
13114
  n.call(this), this._node1 = null, this._node2 = null;
13122
13115
  var e = arguments[0], r = arguments[1];
@@ -13148,7 +13141,7 @@ fr.prototype.buildTree = function() {
13148
13141
  fr.prototype.insert = function(t, e, r) {
13149
13142
  if (this._root !== null)
13150
13143
  throw new Error("Index cannot be added to once it has been queried");
13151
- this._leaves.add(new Hu(t, e, r));
13144
+ this._leaves.add(new Yu(t, e, r));
13152
13145
  };
13153
13146
  fr.prototype.query = function(t, e, r) {
13154
13147
  this.init(), this._root.query(t, e, r);
@@ -13173,7 +13166,7 @@ fr.prototype.buildLevel = function(t, e) {
13173
13166
  if (o === null)
13174
13167
  e.add(i);
13175
13168
  else {
13176
- var s = new Wu(t.get(r), t.get(r + 1));
13169
+ var s = new Hu(t.get(r), t.get(r + 1));
13177
13170
  e.add(s);
13178
13171
  }
13179
13172
  }
@@ -13364,7 +13357,7 @@ var oi = function(n) {
13364
13357
  var s = this._nodes.addNode(i), a = s.getLabel();
13365
13358
  a === null ? s._label = new Q(r, o) : a.setLocation(r, o);
13366
13359
  }, t.prototype.createEdgeSetIntersector = function() {
13367
- return new Yu();
13360
+ return new Xu();
13368
13361
  }, t.prototype.addSelfIntersectionNodes = function(r) {
13369
13362
  for (var i = this, o = this._edges.iterator(); o.hasNext(); )
13370
13363
  for (var s = o.next(), a = s.getLabel().getLocation(r), u = s.eiList.iterator(); u.hasNext(); ) {
@@ -14019,7 +14012,7 @@ function Cs(n, t, e) {
14019
14012
  var r = n.s = t + e, i = r - t, o = r - i;
14020
14013
  n.t = t - o + (e - i);
14021
14014
  }
14022
- var at = 1e-6, Z = Math.PI, _r = Z / 2, Ns = Z / 4, Lr = Z * 2, Xr = 180 / Z, Ae = Z / 180, Ut = Math.abs, ju = Math.atan, Kn = Math.atan2, Et = Math.cos, It = Math.sin, Ti = Math.sqrt;
14015
+ var at = 1e-6, Z = Math.PI, _r = Z / 2, Ns = Z / 4, Lr = Z * 2, Xr = 180 / Z, Ae = Z / 180, Ut = Math.abs, Wu = Math.atan, Kn = Math.atan2, Et = Math.cos, It = Math.sin, Ti = Math.sqrt;
14023
14016
  function Sa(n) {
14024
14017
  return n > 1 ? 0 : n < -1 ? Z : Math.acos(n);
14025
14018
  }
@@ -14081,7 +14074,7 @@ function Ls(n, t) {
14081
14074
  To(n[e], t, 1);
14082
14075
  t.polygonEnd();
14083
14076
  }
14084
- function Ku(n, t) {
14077
+ function ju(n, t) {
14085
14078
  n && xs.hasOwnProperty(n.type) ? xs[n.type](n, t) : Zi(n, t);
14086
14079
  }
14087
14080
  an();
@@ -14122,7 +14115,7 @@ function Fo(n, t) {
14122
14115
  return [n > Z ? n - Lr : n < -Z ? n + Lr : n, t];
14123
14116
  }
14124
14117
  Fo.invert = Fo;
14125
- function Qu(n, t, e) {
14118
+ function Ku(n, t, e) {
14126
14119
  return (n %= Lr) ? t || e ? La(Ps(n), bs(t, e)) : Ps(n) : t || e ? bs(t, e) : Fo;
14127
14120
  }
14128
14121
  function ws(n) {
@@ -14151,7 +14144,7 @@ function bs(n, t) {
14151
14144
  ];
14152
14145
  }, s;
14153
14146
  }
14154
- function Ju(n, t, e, r, i, o) {
14147
+ function Qu(n, t, e, r, i, o) {
14155
14148
  if (e) {
14156
14149
  var s = Et(t), a = It(t), u = r * e;
14157
14150
  i == null ? (i = t + r * Lr, o = t - u / 2) : (i = Rs(s, i), o = Rs(s, o), (r > 0 ? i < o : i > o) && (i += r * Lr));
@@ -14183,7 +14176,7 @@ function wa() {
14183
14176
  }
14184
14177
  };
14185
14178
  }
14186
- function Zu(n, t, e, r, i, o) {
14179
+ function Ju(n, t, e, r, i, o) {
14187
14180
  var s = n[0], a = n[1], u = t[0], l = t[1], c = 0, f = 1, h = u - s, p = l - a, g;
14188
14181
  if (g = e - s, !(!h && g > 0)) {
14189
14182
  if (g /= h, h < 0) {
@@ -14290,8 +14283,8 @@ function Os(n) {
14290
14283
  function ba(n, t) {
14291
14284
  return n < t ? -1 : n > t ? 1 : n >= t ? 0 : NaN;
14292
14285
  }
14293
- function $u(n) {
14294
- return n.length === 1 && (n = tl(n)), {
14286
+ function Zu(n) {
14287
+ return n.length === 1 && (n = $u(n)), {
14295
14288
  left: function(t, e, r, i) {
14296
14289
  for (r == null && (r = 0), i == null && (i = t.length); r < i; ) {
14297
14290
  var o = r + i >>> 1;
@@ -14308,12 +14301,12 @@ function $u(n) {
14308
14301
  }
14309
14302
  };
14310
14303
  }
14311
- function tl(n) {
14304
+ function $u(n) {
14312
14305
  return function(t, e) {
14313
14306
  return ba(n(t), e);
14314
14307
  };
14315
14308
  }
14316
- $u(ba);
14309
+ Zu(ba);
14317
14310
  function Ra(n) {
14318
14311
  for (var t = n.length, e, r = -1, i = 0, o, s; ++r < t; )
14319
14312
  i += n[r].length;
@@ -14323,7 +14316,7 @@ function Ra(n) {
14323
14316
  return o;
14324
14317
  }
14325
14318
  var ai = 1e9, ki = -ai;
14326
- function el(n, t, e, r) {
14319
+ function tl(n, t, e, r) {
14327
14320
  function i(l, c) {
14328
14321
  return n <= l && l <= e && t <= c && c <= r;
14329
14322
  }
@@ -14384,7 +14377,7 @@ function el(n, t, e, r) {
14384
14377
  c.point(X, ft);
14385
14378
  else {
14386
14379
  var pe = [I = Math.max(ki, Math.min(ai, I)), C = Math.max(ki, Math.min(ai, C))], Te = [X = Math.max(ki, Math.min(ai, X)), ft = Math.max(ki, Math.min(ai, ft))];
14387
- Zu(pe, Te, n, t, e, r) ? (x || (c.lineStart(), c.point(pe[0], pe[1])), c.point(Te[0], Te[1]), Gt || c.lineEnd(), P = !1) : Gt && (c.lineStart(), c.point(X, ft), P = !1);
14380
+ Ju(pe, Te, n, t, e, r) ? (x || (c.lineStart(), c.point(pe[0], pe[1])), c.point(Te[0], Te[1]), Gt || c.lineEnd(), P = !1) : Gt && (c.lineStart(), c.point(X, ft), P = !1);
14388
14381
  }
14389
14382
  I = X, C = ft, x = Gt;
14390
14383
  }
@@ -14392,7 +14385,7 @@ function el(n, t, e, r) {
14392
14385
  };
14393
14386
  }
14394
14387
  var Io = an();
14395
- function rl(n, t) {
14388
+ function el(n, t) {
14396
14389
  var e = t[0], r = t[1], i = [It(e), -Et(e), 0], o = 0, s = 0;
14397
14390
  Io.reset();
14398
14391
  for (var a = 0, u = n.length; a < u; ++a)
@@ -14417,7 +14410,7 @@ function Ds(n) {
14417
14410
  an();
14418
14411
  an();
14419
14412
  var Zn = 1 / 0, to = Zn, Si = -Zn, eo = Si, Ts = {
14420
- point: nl,
14413
+ point: rl,
14421
14414
  lineStart: si,
14422
14415
  lineEnd: si,
14423
14416
  polygonStart: si,
@@ -14427,7 +14420,7 @@ var Zn = 1 / 0, to = Zn, Si = -Zn, eo = Si, Ts = {
14427
14420
  return Si = eo = -(to = Zn = 1 / 0), n;
14428
14421
  }
14429
14422
  };
14430
- function nl(n, t) {
14423
+ function rl(n, t) {
14431
14424
  n < Zn && (Zn = n), n > Si && (Si = n), t < to && (to = t), t > eo && (eo = t);
14432
14425
  }
14433
14426
  an();
@@ -14442,8 +14435,8 @@ function Oa(n, t, e, r) {
14442
14435
  },
14443
14436
  polygonEnd: function() {
14444
14437
  g.point = y, g.lineStart = _, g.lineEnd = I, h = Ra(h);
14445
- var P = rl(f, a);
14446
- h.length ? (c || (o.polygonStart(), c = !0), Pa(h, ol, P, e, o)) : P && (c || (o.polygonStart(), c = !0), o.lineStart(), e(null, null, 1, o), o.lineEnd()), c && (o.polygonEnd(), c = !1), h = f = null;
14438
+ var P = el(f, a);
14439
+ h.length ? (c || (o.polygonStart(), c = !0), Pa(h, il, P, e, o)) : P && (c || (o.polygonStart(), c = !0), o.lineStart(), e(null, null, 1, o), o.lineEnd()), c && (o.polygonEnd(), c = !1), h = f = null;
14447
14440
  },
14448
14441
  sphere: function() {
14449
14442
  o.polygonStart(), o.lineStart(), e(null, null, 1, o), o.lineEnd(), o.polygonEnd();
@@ -14483,27 +14476,27 @@ function Oa(n, t, e, r) {
14483
14476
  }
14484
14477
  return;
14485
14478
  }
14486
- A > 1 && P & 2 && D.push(D.pop().concat(D.shift())), h.push(D.filter(il));
14479
+ A > 1 && P & 2 && D.push(D.pop().concat(D.shift())), h.push(D.filter(nl));
14487
14480
  }
14488
14481
  }
14489
14482
  return g;
14490
14483
  };
14491
14484
  }
14492
- function il(n) {
14485
+ function nl(n) {
14493
14486
  return n.length > 1;
14494
14487
  }
14495
- function ol(n, t) {
14488
+ function il(n, t) {
14496
14489
  return ((n = n.x)[0] < 0 ? n[1] - _r - at : _r - n[1]) - ((t = t.x)[0] < 0 ? t[1] - _r - at : _r - t[1]);
14497
14490
  }
14498
14491
  const Ms = Oa(
14499
14492
  function() {
14500
14493
  return !0;
14501
14494
  },
14502
- sl,
14503
- ul,
14495
+ ol,
14496
+ al,
14504
14497
  [-Z, -_r]
14505
14498
  );
14506
- function sl(n) {
14499
+ function ol(n) {
14507
14500
  var t = NaN, e = NaN, r = NaN, i;
14508
14501
  return {
14509
14502
  lineStart: function() {
@@ -14511,7 +14504,7 @@ function sl(n) {
14511
14504
  },
14512
14505
  point: function(o, s) {
14513
14506
  var a = o > 0 ? Z : -Z, u = Ut(o - t);
14514
- Ut(u - Z) < at ? (n.point(t, e = (e + s) / 2 > 0 ? _r : -_r), n.point(r, e), n.lineEnd(), n.lineStart(), n.point(a, e), n.point(o, e), i = 0) : r !== a && u >= Z && (Ut(t - r) < at && (t -= r * at), Ut(o - a) < at && (o -= a * at), e = al(t, e, o, s), n.point(r, e), n.lineEnd(), n.lineStart(), n.point(a, e), i = 0), n.point(t = o, e = s), r = a;
14507
+ Ut(u - Z) < at ? (n.point(t, e = (e + s) / 2 > 0 ? _r : -_r), n.point(r, e), n.lineEnd(), n.lineStart(), n.point(a, e), n.point(o, e), i = 0) : r !== a && u >= Z && (Ut(t - r) < at && (t -= r * at), Ut(o - a) < at && (o -= a * at), e = sl(t, e, o, s), n.point(r, e), n.lineEnd(), n.lineStart(), n.point(a, e), i = 0), n.point(t = o, e = s), r = a;
14515
14508
  },
14516
14509
  lineEnd: function() {
14517
14510
  n.lineEnd(), t = e = NaN;
@@ -14521,11 +14514,11 @@ function sl(n) {
14521
14514
  }
14522
14515
  };
14523
14516
  }
14524
- function al(n, t, e, r) {
14517
+ function sl(n, t, e, r) {
14525
14518
  var i, o, s = It(n - e);
14526
- return Ut(s) > at ? ju((It(t) * (o = Et(r)) * It(e) - It(r) * (i = Et(t)) * It(n)) / (i * o * s)) : (t + r) / 2;
14519
+ return Ut(s) > at ? Wu((It(t) * (o = Et(r)) * It(e) - It(r) * (i = Et(t)) * It(n)) / (i * o * s)) : (t + r) / 2;
14527
14520
  }
14528
- function ul(n, t, e, r) {
14521
+ function al(n, t, e, r) {
14529
14522
  var i;
14530
14523
  if (n == null)
14531
14524
  i = e * _r, r.point(-Z, i), r.point(0, i), r.point(Z, i), r.point(Z, 0), r.point(Z, -i), r.point(0, -i), r.point(-Z, -i), r.point(-Z, 0), r.point(-Z, i);
@@ -14535,10 +14528,10 @@ function ul(n, t, e, r) {
14535
14528
  } else
14536
14529
  r.point(t[0], t[1]);
14537
14530
  }
14538
- function ll(n, t) {
14531
+ function ul(n, t) {
14539
14532
  var e = Et(n), r = e > 0, i = Ut(e) > at;
14540
14533
  function o(c, f, h, p) {
14541
- Ju(p, n, t, h, c, f);
14534
+ Qu(p, n, t, h, c, f);
14542
14535
  }
14543
14536
  function s(c, f) {
14544
14537
  return Et(c) * Et(f) > e;
@@ -14628,30 +14621,30 @@ Bo.prototype = {
14628
14621
  };
14629
14622
  function Ta(n, t, e) {
14630
14623
  var r = t[1][0] - t[0][0], i = t[1][1] - t[0][1], o = n.clipExtent && n.clipExtent();
14631
- n.scale(150).translate([0, 0]), o != null && n.clipExtent(null), Ku(e, n.stream(Ts));
14624
+ n.scale(150).translate([0, 0]), o != null && n.clipExtent(null), ju(e, n.stream(Ts));
14632
14625
  var s = Ts.result(), a = Math.min(r / (s[1][0] - s[0][0]), i / (s[1][1] - s[0][1])), u = +t[0][0] + (r - a * (s[1][0] + s[0][0])) / 2, l = +t[0][1] + (i - a * (s[1][1] + s[0][1])) / 2;
14633
14626
  return o != null && n.clipExtent(o), n.scale(a * 150).translate([u, l]);
14634
14627
  }
14635
- function cl(n, t, e) {
14628
+ function ll(n, t, e) {
14636
14629
  return Ta(n, [[0, 0], t], e);
14637
14630
  }
14638
- var As = 16, fl = Et(30 * Ae);
14631
+ var As = 16, cl = Et(30 * Ae);
14639
14632
  function Fs(n, t) {
14640
- return +t ? pl(n, t) : hl(n);
14633
+ return +t ? hl(n, t) : fl(n);
14641
14634
  }
14642
- function hl(n) {
14635
+ function fl(n) {
14643
14636
  return Da({
14644
14637
  point: function(t, e) {
14645
14638
  t = n(t, e), this.stream.point(t[0], t[1]);
14646
14639
  }
14647
14640
  });
14648
14641
  }
14649
- function pl(n, t) {
14642
+ function hl(n, t) {
14650
14643
  function e(r, i, o, s, a, u, l, c, f, h, p, g, y, m) {
14651
14644
  var _ = l - r, I = c - i, C = _ * _ + I * I;
14652
14645
  if (C > 4 * t && y--) {
14653
14646
  var x = s + h, b = a + p, P = u + g, D = Ti(x * x + b * b + P * P), G = Qn(P /= D), A = Ut(Ut(P) - 1) < at || Ut(o - f) < at ? (o + f) / 2 : Kn(b, x), et = n(A, G), K = et[0], nt = et[1], ct = K - r, w = nt - i, X = I * ct - _ * w;
14654
- (X * X / C > t || Ut((_ * ct + I * w) / C - 0.5) > 0.3 || s * h + a * p + u * g < fl) && (e(r, i, o, s, a, u, K, nt, A, x /= D, b /= D, P, y, m), m.point(K, nt), e(K, nt, A, x, b, P, l, c, f, h, p, g, y, m));
14647
+ (X * X / C > t || Ut((_ * ct + I * w) / C - 0.5) > 0.3 || s * h + a * p + u * g < cl) && (e(r, i, o, s, a, u, K, nt, A, x /= D, b /= D, P, y, m), m.point(K, nt), e(K, nt, A, x, b, P, l, c, f, h, p, g, y, m));
14655
14648
  }
14656
14649
  }
14657
14650
  return function(r) {
@@ -14691,17 +14684,17 @@ function pl(n, t) {
14691
14684
  return m;
14692
14685
  };
14693
14686
  }
14694
- var gl = Da({
14687
+ var pl = Da({
14695
14688
  point: function(n, t) {
14696
14689
  this.stream.point(n * Ae, t * Ae);
14697
14690
  }
14698
14691
  });
14699
- function dl(n) {
14700
- return vl(function() {
14692
+ function gl(n) {
14693
+ return dl(function() {
14701
14694
  return n;
14702
14695
  })();
14703
14696
  }
14704
- function vl(n) {
14697
+ function dl(n) {
14705
14698
  var t, e = 150, r = 480, i = 250, o, s, a = 0, u = 0, l = 0, c = 0, f = 0, h, p, g = null, y = Ms, m = null, _, I, C, x = Ds, b = 0.5, P = Fs(K, b), D, G;
14706
14699
  function A(w) {
14707
14700
  return w = p(w[0] * Ae, w[1] * Ae), [w[0] * e + o, s - w[1] * e];
@@ -14713,11 +14706,11 @@ function vl(n) {
14713
14706
  return w = t(w, X), [w[0] * e + o, s - w[1] * e];
14714
14707
  }
14715
14708
  A.stream = function(w) {
14716
- return D && G === w ? D : D = gl(y(h, P(x(G = w))));
14709
+ return D && G === w ? D : D = pl(y(h, P(x(G = w))));
14717
14710
  }, A.clipAngle = function(w) {
14718
- return arguments.length ? (y = +w ? ll(g = w * Ae, 6 * Ae) : (g = null, Ms), ct()) : g * Xr;
14711
+ return arguments.length ? (y = +w ? ul(g = w * Ae, 6 * Ae) : (g = null, Ms), ct()) : g * Xr;
14719
14712
  }, A.clipExtent = function(w) {
14720
- return arguments.length ? (x = w == null ? (m = _ = I = C = null, Ds) : el(m = +w[0][0], _ = +w[0][1], I = +w[1][0], C = +w[1][1]), ct()) : m == null ? null : [[m, _], [I, C]];
14713
+ return arguments.length ? (x = w == null ? (m = _ = I = C = null, Ds) : tl(m = +w[0][0], _ = +w[0][1], I = +w[1][0], C = +w[1][1]), ct()) : m == null ? null : [[m, _], [I, C]];
14721
14714
  }, A.scale = function(w) {
14722
14715
  return arguments.length ? (e = +w, nt()) : e;
14723
14716
  }, A.translate = function(w) {
@@ -14731,10 +14724,10 @@ function vl(n) {
14731
14724
  }, A.fitExtent = function(w, X) {
14732
14725
  return Ta(A, w, X);
14733
14726
  }, A.fitSize = function(w, X) {
14734
- return cl(A, w, X);
14727
+ return ll(A, w, X);
14735
14728
  };
14736
14729
  function nt() {
14737
- p = La(h = Qu(l, c, f), t);
14730
+ p = La(h = Ku(l, c, f), t);
14738
14731
  var w = t(a, u);
14739
14732
  return o = r - w[0] * e, s = i + w[1] * e, ct();
14740
14733
  }
@@ -14745,7 +14738,7 @@ function vl(n) {
14745
14738
  return t = n.apply(this, arguments), A.invert = t.invert && et, nt();
14746
14739
  };
14747
14740
  }
14748
- function yl(n) {
14741
+ function vl(n) {
14749
14742
  return function(t, e) {
14750
14743
  var r = Et(t), i = Et(e), o = n(r * i);
14751
14744
  return [
@@ -14754,7 +14747,7 @@ function yl(n) {
14754
14747
  ];
14755
14748
  };
14756
14749
  }
14757
- function ml(n) {
14750
+ function yl(n) {
14758
14751
  return function(t, e) {
14759
14752
  var r = Ti(t * t + e * e), i = n(r), o = It(i), s = Et(i);
14760
14753
  return [
@@ -14763,20 +14756,20 @@ function ml(n) {
14763
14756
  ];
14764
14757
  };
14765
14758
  }
14766
- var Ma = yl(function(n) {
14759
+ var Ma = vl(function(n) {
14767
14760
  return (n = Sa(n)) && n / It(n);
14768
14761
  });
14769
- Ma.invert = ml(function(n) {
14762
+ Ma.invert = yl(function(n) {
14770
14763
  return n;
14771
14764
  });
14772
- function _l() {
14773
- return dl(Ma).scale(79.4188).clipAngle(180 - 1e-3);
14765
+ function ml() {
14766
+ return gl(Ma).scale(79.4188).clipAngle(180 - 1e-3);
14774
14767
  }
14775
14768
  function Bs(n, t) {
14776
14769
  return [n, t];
14777
14770
  }
14778
14771
  Bs.invert = Bs;
14779
- function El(n, t, e) {
14772
+ function _l(n, t, e) {
14780
14773
  e = e || {};
14781
14774
  var r = e.units || "kilometers", i = e.steps || 8;
14782
14775
  if (!n)
@@ -14795,14 +14788,14 @@ function El(n, t, e) {
14795
14788
  return Js(n, function(s) {
14796
14789
  var a = Ui(s, t, r, i);
14797
14790
  a && o.push(a);
14798
- }), Ro(o);
14791
+ }), Po(o);
14799
14792
  case "FeatureCollection":
14800
14793
  return ys(n, function(s) {
14801
14794
  var a = Ui(s, t, r, i);
14802
14795
  a && ys(a, function(u) {
14803
14796
  u && o.push(u);
14804
14797
  });
14805
- }), Ro(o);
14798
+ }), Po(o);
14806
14799
  }
14807
14800
  return Ui(n, t, r, i);
14808
14801
  }
@@ -14813,18 +14806,18 @@ function Ui(n, t, e, r) {
14813
14806
  return Js(n, function(y) {
14814
14807
  var m = Ui(y, t, e, r);
14815
14808
  m && s.push(m);
14816
- }), Ro(s);
14809
+ }), Po(s);
14817
14810
  }
14818
- var a = Il(o), u = {
14811
+ var a = El(o), u = {
14819
14812
  type: o.type,
14820
14813
  coordinates: Fa(o.coordinates, a)
14821
- }, l = new Wo(), c = l.read(u), f = Lu(wu(t, e), "meters"), h = Pt.bufferOp(c, f, r), p = new aa();
14814
+ }, l = new Wo(), c = l.read(u), f = au(uu(t, e), "meters"), h = Pt.bufferOp(c, f, r), p = new aa();
14822
14815
  if (h = p.write(h), !Aa(h.coordinates)) {
14823
14816
  var g = {
14824
14817
  type: h.type,
14825
14818
  coordinates: Ba(h.coordinates, a)
14826
14819
  };
14827
- return no(g, i);
14820
+ return ro(g, i);
14828
14821
  }
14829
14822
  }
14830
14823
  function Aa(n) {
@@ -14840,9 +14833,16 @@ function Ba(n, t) {
14840
14833
  return Ba(e, t);
14841
14834
  });
14842
14835
  }
14843
- function Il(n) {
14844
- var t = Ru(n).geometry.coordinates, e = [-t[0], -t[1]];
14845
- return _l().rotate(e).scale(ie);
14836
+ function El(n) {
14837
+ var t = bu(n).geometry.coordinates, e = [-t[0], -t[1]];
14838
+ return ml().rotate(e).scale(ie);
14839
+ }
14840
+ function Il(n, t) {
14841
+ var e = Yi(n), r = Yi(t), i = n.properties || {}, o = Us.difference(
14842
+ e.coordinates,
14843
+ r.coordinates
14844
+ );
14845
+ return o.length === 0 ? null : o.length === 1 ? Xs(o[0], i) : Ys(o, i);
14846
14846
  }
14847
14847
  function Gs(n) {
14848
14848
  let t;
@@ -14850,7 +14850,7 @@ function Gs(n) {
14850
14850
  t && e[0] - t[0] >= 180 ? e[0] -= 360 : t && e[0] - t[0] < -180 && (e[0] += 360), t = e;
14851
14851
  }
14852
14852
  function Vs(n, t) {
14853
- const e = bu(
14853
+ const e = Il(
14854
14854
  {
14855
14855
  type: "Polygon",
14856
14856
  coordinates: [
@@ -14868,7 +14868,7 @@ function Vs(n, t) {
14868
14868
  if (!e)
14869
14869
  return;
14870
14870
  e.properties = { isMask: "y" };
14871
- const r = El(n, 0);
14871
+ const r = _l(n, 0);
14872
14872
  if (r.geometry.type === "Polygon")
14873
14873
  for (const i of r.geometry.coordinates)
14874
14874
  Gs(i);
@@ -14939,7 +14939,7 @@ function Cl(n, t, e = !0, r = !0, i = {}, o = {}, s = {
14939
14939
  if (!t)
14940
14940
  throw new Error();
14941
14941
  const I = document.createElement("div");
14942
- return _ && I.classList.add("marker-interactive"), new ru({
14942
+ return _ && I.classList.add("marker-interactive"), new Pu({
14943
14943
  props: { displayIn: "maplibre" },
14944
14944
  target: I
14945
14945
  }), new t.Marker({ element: I, offset: [1, -13] });
@@ -14985,7 +14985,7 @@ function Cl(n, t, e = !0, r = !0, i = {}, o = {}, s = {
14985
14985
  if (b.length > 0) {
14986
14986
  let P = b.pop();
14987
14987
  for (const D of b)
14988
- P = Pu(P, D);
14988
+ P = lu(P, D);
14989
14989
  Vs({ ...I, geometry: P }, C), x = !0;
14990
14990
  } else {
14991
14991
  const P = I.geometry.geometries.filter(