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