@maptiler/geocoding-control 0.0.76 → 0.0.78

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,4 +1,4 @@
1
- import * as Pn from "leaflet";
1
+ import * as wn from "leaflet";
2
2
  function fi() {
3
3
  }
4
4
  function zs(n) {
@@ -13,16 +13,16 @@ function no(n) {
13
13
  function Us(n) {
14
14
  return typeof n == "function";
15
15
  }
16
- function ka(n, t) {
16
+ function Ga(n, t) {
17
17
  return n != n ? t == t : n !== t || n && typeof n == "object" || typeof n == "function";
18
18
  }
19
- function za(n) {
19
+ function Va(n) {
20
20
  return Object.keys(n).length === 0;
21
21
  }
22
- function Ua(n, t) {
22
+ function ka(n, t) {
23
23
  n.appendChild(t);
24
24
  }
25
- function qa(n, t, e) {
25
+ function za(n, t, e) {
26
26
  n.insertBefore(t, e || null);
27
27
  }
28
28
  function qs(n) {
@@ -34,77 +34,83 @@ function is(n) {
34
34
  function pr(n, t, e) {
35
35
  e == null ? n.removeAttribute(t) : n.getAttribute(t) !== e && n.setAttribute(t, e);
36
36
  }
37
- function Xa(n) {
37
+ function Ua(n) {
38
38
  return Array.from(n.childNodes);
39
39
  }
40
- function Ai(n, t, e) {
40
+ function Fi(n, t, e) {
41
41
  n.classList[e ? "add" : "remove"](t);
42
42
  }
43
43
  let Vo;
44
44
  function li(n) {
45
45
  Vo = n;
46
46
  }
47
- const Rn = [], os = [], zi = [], ss = [], Ya = Promise.resolve();
47
+ const bn = [], os = [];
48
+ let On = [];
49
+ const ss = [], qa = /* @__PURE__ */ Promise.resolve();
48
50
  let No = !1;
49
- function Ha() {
50
- No || (No = !0, Ya.then(Xs));
51
+ function Xa() {
52
+ No || (No = !0, qa.then(Xs));
51
53
  }
52
54
  function xo(n) {
53
- zi.push(n);
55
+ On.push(n);
54
56
  }
55
57
  const mo = /* @__PURE__ */ new Set();
56
- let bn = 0;
58
+ let Pn = 0;
57
59
  function Xs() {
58
- if (bn !== 0)
60
+ if (Pn !== 0)
59
61
  return;
60
62
  const n = Vo;
61
63
  do {
62
64
  try {
63
- for (; bn < Rn.length; ) {
64
- const t = Rn[bn];
65
- bn++, li(t), Wa(t.$$);
65
+ for (; Pn < bn.length; ) {
66
+ const t = bn[Pn];
67
+ Pn++, li(t), Ya(t.$$);
66
68
  }
67
69
  } catch (t) {
68
- throw Rn.length = 0, bn = 0, t;
70
+ throw bn.length = 0, Pn = 0, t;
69
71
  }
70
- for (li(null), Rn.length = 0, bn = 0; os.length; )
72
+ for (li(null), bn.length = 0, Pn = 0; os.length; )
71
73
  os.pop()();
72
- for (let t = 0; t < zi.length; t += 1) {
73
- const e = zi[t];
74
+ for (let t = 0; t < On.length; t += 1) {
75
+ const e = On[t];
74
76
  mo.has(e) || (mo.add(e), e());
75
77
  }
76
- zi.length = 0;
77
- } while (Rn.length);
78
+ On.length = 0;
79
+ } while (bn.length);
78
80
  for (; ss.length; )
79
81
  ss.pop()();
80
82
  No = !1, mo.clear(), li(n);
81
83
  }
82
- function Wa(n) {
84
+ function Ya(n) {
83
85
  if (n.fragment !== null) {
84
86
  n.update(), no(n.before_update);
85
87
  const t = n.dirty;
86
88
  n.dirty = [-1], n.fragment && n.fragment.p(n.ctx, t), n.after_update.forEach(xo);
87
89
  }
88
90
  }
89
- const ja = /* @__PURE__ */ new Set();
90
- function Ka(n, t) {
91
- n && n.i && (ja.delete(n), n.i(t));
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));
92
98
  }
93
- function Qa(n, t, e, r) {
99
+ function Ka(n, t, e, r) {
94
100
  const { fragment: i, after_update: o } = n.$$;
95
101
  i && i.m(t, e), r || xo(() => {
96
102
  const s = n.$$.on_mount.map(zs).filter(Us);
97
103
  n.$$.on_destroy ? n.$$.on_destroy.push(...s) : no(s), n.$$.on_mount = [];
98
104
  }), o.forEach(xo);
99
105
  }
100
- function Ja(n, t) {
106
+ function Qa(n, t) {
101
107
  const e = n.$$;
102
- e.fragment !== null && (no(e.on_destroy), e.fragment && e.fragment.d(t), e.on_destroy = e.fragment = null, e.ctx = []);
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 = []);
103
109
  }
104
- function Za(n, t) {
105
- n.$$.dirty[0] === -1 && (Rn.push(n), Ha(), n.$$.dirty.fill(0)), n.$$.dirty[t / 31 | 0] |= 1 << t % 31;
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;
106
112
  }
107
- function $a(n, t, e, r, i, o, s, a = [-1]) {
113
+ function Za(n, t, e, r, i, o, s, a = [-1]) {
108
114
  const u = Vo;
109
115
  li(n);
110
116
  const l = n.$$ = {
@@ -132,20 +138,20 @@ function $a(n, t, e, r, i, o, s, a = [-1]) {
132
138
  let c = !1;
133
139
  if (l.ctx = e ? e(n, t.props || {}, (f, h, ...p) => {
134
140
  const g = p.length ? p[0] : h;
135
- return l.ctx && i(l.ctx[f], l.ctx[f] = g) && (!l.skip_bound && l.bound[f] && l.bound[f](g), c && Za(n, f)), 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;
136
142
  }) : [], l.update(), c = !0, no(l.before_update), l.fragment = r ? r(l.ctx) : !1, t.target) {
137
143
  if (t.hydrate) {
138
- const f = Xa(t.target);
144
+ const f = Ua(t.target);
139
145
  l.fragment && l.fragment.l(f), f.forEach(qs);
140
146
  } else
141
147
  l.fragment && l.fragment.c();
142
- t.intro && Ka(n.$$.fragment), Qa(n, t.target, t.anchor, t.customElement), Xs();
148
+ t.intro && ja(n.$$.fragment), Ka(n, t.target, t.anchor, t.customElement), Xs();
143
149
  }
144
150
  li(u);
145
151
  }
146
- class tu {
152
+ class $a {
147
153
  $destroy() {
148
- Ja(this, 1), this.$destroy = fi;
154
+ Qa(this, 1), this.$destroy = fi;
149
155
  }
150
156
  $on(t, e) {
151
157
  if (!Us(e))
@@ -157,20 +163,20 @@ class tu {
157
163
  };
158
164
  }
159
165
  $set(t) {
160
- this.$$set && !za(t) && (this.$$.skip_bound = !0, this.$$set(t), this.$$.skip_bound = !1);
166
+ this.$$set && !Va(t) && (this.$$.skip_bound = !0, this.$$set(t), this.$$.skip_bound = !1);
161
167
  }
162
168
  }
163
- function eu(n) {
169
+ function tu(n) {
164
170
  let t, e, r;
165
171
  return {
166
172
  c() {
167
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*/
168
- n[0] !== "list" ? void 0 : "20"), pr(t, "viewBox", "0 0 70 85"), pr(t, "fill", "none"), pr(t, "class", "svelte-1k1cmht"), Ai(
174
+ n[0] !== "list" ? void 0 : "20"), pr(t, "viewBox", "0 0 70 85"), pr(t, "fill", "none"), pr(t, "class", "svelte-1k1cmht"), Fi(
169
175
  t,
170
176
  "in-map",
171
177
  /*displayIn*/
172
178
  n[0] !== "list"
173
- ), Ai(
179
+ ), Fi(
174
180
  t,
175
181
  "list-icon",
176
182
  /*displayIn*/
@@ -178,19 +184,19 @@ function eu(n) {
178
184
  );
179
185
  },
180
186
  m(i, o) {
181
- qa(i, t, o), Ua(t, e);
187
+ za(i, t, o), ka(t, e);
182
188
  },
183
189
  p(i, [o]) {
184
190
  o & /*displayIn*/
185
191
  1 && r !== (r = /*displayIn*/
186
192
  i[0] !== "list" ? void 0 : "20") && pr(t, "width", r), o & /*displayIn*/
187
- 1 && Ai(
193
+ 1 && Fi(
188
194
  t,
189
195
  "in-map",
190
196
  /*displayIn*/
191
197
  i[0] !== "list"
192
198
  ), o & /*displayIn*/
193
- 1 && Ai(
199
+ 1 && Fi(
194
200
  t,
195
201
  "list-icon",
196
202
  /*displayIn*/
@@ -204,15 +210,15 @@ function eu(n) {
204
210
  }
205
211
  };
206
212
  }
207
- function ru(n, t, e) {
213
+ function eu(n, t, e) {
208
214
  let { displayIn: r } = t;
209
215
  return n.$$set = (i) => {
210
216
  "displayIn" in i && e(0, r = i.displayIn);
211
217
  }, [r];
212
218
  }
213
- class nu extends tu {
219
+ class ru extends $a {
214
220
  constructor(t) {
215
- super(), $a(this, t, ru, eu, ka, { displayIn: 0 });
221
+ super(), Za(this, t, eu, tu, Ga, { displayIn: 0 });
216
222
  }
217
223
  }
218
224
  /**
@@ -237,7 +243,7 @@ MERCHANTABLITY OR NON-INFRINGEMENT.
237
243
  See the Apache Version 2.0 License for specific language governing permissions
238
244
  and limitations under the License.
239
245
  ***************************************************************************** */
240
- function iu(n, t) {
246
+ function nu(n, t) {
241
247
  var e = { label: 0, sent: function() {
242
248
  if (o[0] & 1)
243
249
  throw o[1];
@@ -311,7 +317,7 @@ var Kr = (
311
317
  return n;
312
318
  }()
313
319
  );
314
- function ou(n, t) {
320
+ function iu(n, t) {
315
321
  return n > t ? 1 : n < t ? -1 : 0;
316
322
  }
317
323
  function Yr(n, t, e) {
@@ -357,7 +363,7 @@ function as(n, t, e) {
357
363
  }
358
364
  return { left: r, right: i };
359
365
  }
360
- function su(n, t, e) {
366
+ function ou(n, t, e) {
361
367
  return t === null ? n : (n === null || (t = Yr(n.key, t, e), t.left = n), t);
362
368
  }
363
369
  function So(n, t, e, r, i) {
@@ -372,7 +378,7 @@ var ko = (
372
378
  /** @class */
373
379
  function() {
374
380
  function n(t) {
375
- t === void 0 && (t = ou), this._root = null, this._size = 0, this._comparator = t;
381
+ t === void 0 && (t = iu), this._root = null, this._size = 0, this._comparator = t;
376
382
  }
377
383
  return n.prototype.insert = function(t, e) {
378
384
  return this._size++, this._root = _o(t, e, this._root, this._comparator);
@@ -500,14 +506,14 @@ var ko = (
500
506
  }, n.prototype.clear = function() {
501
507
  return this._root = null, this._size = 0, this;
502
508
  }, n.prototype.toList = function() {
503
- return uu(this._root);
509
+ return au(this._root);
504
510
  }, n.prototype.load = function(t, e, r) {
505
511
  e === void 0 && (e = []), r === void 0 && (r = !1);
506
512
  var i = t.length, o = this._comparator;
507
513
  if (r && Po(t, e, 0, i - 1, o), this._root === null)
508
514
  this._root = Lo(t, e, 0, i), this._size = i;
509
515
  else {
510
- var s = lu(this.toList(), au(t, e), o);
516
+ var s = uu(this.toList(), su(t, e), o);
511
517
  i = this._size + i, this._root = wo({ head: s }, 0, i);
512
518
  }
513
519
  return this;
@@ -535,12 +541,12 @@ var ko = (
535
541
  }, t), e.join("");
536
542
  }, n.prototype.update = function(t, e, r) {
537
543
  var i = this._comparator, o = as(t, this._root, i), s = o.left, a = o.right;
538
- i(t, e) < 0 ? a = _o(e, r, a, i) : s = _o(e, r, s, i), this._root = su(s, a, i);
544
+ i(t, e) < 0 ? a = _o(e, r, a, i) : s = _o(e, r, s, i), this._root = ou(s, a, i);
539
545
  }, n.prototype.split = function(t) {
540
546
  return as(t, this._root, this._comparator);
541
547
  }, n.prototype[Symbol.iterator] = function() {
542
548
  var t;
543
- return iu(this, function(e) {
549
+ return nu(this, function(e) {
544
550
  switch (e.label) {
545
551
  case 0:
546
552
  t = this.minNode(), e.label = 1;
@@ -566,12 +572,12 @@ function Lo(n, t, e, r) {
566
572
  }
567
573
  return null;
568
574
  }
569
- function au(n, t) {
575
+ function su(n, t) {
570
576
  for (var e = new Kr(null, null), r = e, i = 0; i < n.length; i++)
571
577
  r = r.next = new Kr(n[i], t[i]);
572
578
  return r.next = null, e.next;
573
579
  }
574
- function uu(n) {
580
+ function au(n) {
575
581
  for (var t = n, e = [], r = !1, i = new Kr(null, null), o = i; !r; )
576
582
  t ? (e.push(t), t = t.left) : e.length > 0 ? (t = o = o.next = e.pop(), t = t.right) : r = !0;
577
583
  return o.next = null, i.next;
@@ -584,7 +590,7 @@ function wo(n, t, e) {
584
590
  }
585
591
  return null;
586
592
  }
587
- function lu(n, t, e) {
593
+ function uu(n, t, e) {
588
594
  for (var r = new Kr(null, null), i = r, o = n, s = t; o !== null && s !== null; )
589
595
  e(o.key, s.key) < 0 ? (i.next = o, o = o.next) : (i.next = s, s = s.next), i = i.next;
590
596
  return o !== null ? i.next = o : s !== null && (i.next = s), r.next;
@@ -637,12 +643,12 @@ var oi = function(t, e) {
637
643
  };
638
644
  }, Hr = Number.EPSILON;
639
645
  Hr === void 0 && (Hr = Math.pow(2, -52));
640
- var cu = Hr * Hr, Ro = function(t, e) {
646
+ var lu = Hr * Hr, Ro = function(t, e) {
641
647
  if (-Hr < t && t < Hr && -Hr < e && e < Hr)
642
648
  return 0;
643
649
  var r = t - e;
644
- return r * r < cu * t * e ? 0 : t < e ? -1 : 1;
645
- }, fu = /* @__PURE__ */ function() {
650
+ return r * r < lu * t * e ? 0 : t < e ? -1 : 1;
651
+ }, cu = /* @__PURE__ */ function() {
646
652
  function n() {
647
653
  Qe(this, n), this.reset();
648
654
  }
@@ -674,7 +680,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
674
680
  return o !== null && Ro(r.key, o.key) === 0 ? (this.tree.remove(e), o.key) : e;
675
681
  }
676
682
  }]), n;
677
- }(), hi = new fu(), ci = function(t, e) {
683
+ }(), hi = new cu(), ci = function(t, e) {
678
684
  return t.x * e.y - t.y * e.x;
679
685
  }, Ys = function(t, e) {
680
686
  return t.x * e.x + t.y * e.y;
@@ -689,7 +695,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
689
695
  return Ro(s, 0);
690
696
  }, Xi = function(t) {
691
697
  return Math.sqrt(Ys(t, t));
692
- }, hu = function(t, e, r) {
698
+ }, fu = function(t, e, r) {
693
699
  var i = {
694
700
  x: e.x - t.x,
695
701
  y: e.y - t.y
@@ -698,7 +704,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
698
704
  y: r.y - t.y
699
705
  };
700
706
  return ci(o, i) / Xi(o) / Xi(i);
701
- }, pu = function(t, e, r) {
707
+ }, hu = function(t, e, r) {
702
708
  var i = {
703
709
  x: e.x - t.x,
704
710
  y: e.y - t.y
@@ -717,7 +723,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
717
723
  x: r,
718
724
  y: t.y + e.y / e.x * (r - t.x)
719
725
  };
720
- }, gu = function(t, e, r, i) {
726
+ }, pu = function(t, e, r, i) {
721
727
  if (e.x === 0)
722
728
  return hs(r, i, t.x);
723
729
  if (i.x === 0)
@@ -806,8 +812,8 @@ var cu = Hr * Hr, Ro = function(t, e) {
806
812
  var r = this, i = /* @__PURE__ */ new Map(), o = function(a) {
807
813
  var u = a.otherSE;
808
814
  i.set(a, {
809
- sine: hu(r.point, e.point, u.point),
810
- cosine: pu(r.point, e.point, u.point)
815
+ sine: fu(r.point, e.point, u.point),
816
+ cosine: hu(r.point, e.point, u.point)
811
817
  });
812
818
  };
813
819
  return function(s, a) {
@@ -817,7 +823,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
817
823
  };
818
824
  }
819
825
  }]), n;
820
- }(), du = 0, Yi = /* @__PURE__ */ function() {
826
+ }(), gu = 0, Yi = /* @__PURE__ */ function() {
821
827
  ae(n, null, [{
822
828
  key: "compare",
823
829
  /* This compare() function is for ordering segments in the sweep
@@ -893,7 +899,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
893
899
  * and possibly will be later modified */
894
900
  }]);
895
901
  function n(t, e, r, i) {
896
- Qe(this, n), this.id = ++du, 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
+ 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;
897
903
  }
898
904
  return ae(n, [{
899
905
  key: "replaceRightSE",
@@ -991,7 +997,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
991
997
  return a;
992
998
  if (h)
993
999
  return l;
994
- var g = gu(s, this.vector(), u, e.vector());
1000
+ var g = pu(s, this.vector(), u, e.vector());
995
1001
  return g === null || !oi(o, g) ? null : hi.round(g.x, g.y);
996
1002
  }
997
1003
  /**
@@ -1191,7 +1197,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1191
1197
  return e;
1192
1198
  }
1193
1199
  }]), n;
1194
- }(), vu = /* @__PURE__ */ function() {
1200
+ }(), du = /* @__PURE__ */ function() {
1195
1201
  function n(t, e) {
1196
1202
  if (Qe(this, n), !Array.isArray(t))
1197
1203
  throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1239,7 +1245,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1239
1245
  }
1240
1246
  };
1241
1247
  for (var r = 0, i = t.length; r < i; r++) {
1242
- var o = new vu(t[r], this);
1248
+ var o = new du(t[r], this);
1243
1249
  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);
1244
1250
  }
1245
1251
  this.isSubject = e;
@@ -1253,7 +1259,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1253
1259
  return e;
1254
1260
  }
1255
1261
  }]), n;
1256
- }(), yu = /* @__PURE__ */ function() {
1262
+ }(), vu = /* @__PURE__ */ function() {
1257
1263
  ae(n, null, [{
1258
1264
  key: "factory",
1259
1265
  /* Given the segments from the sweep line pass, compute & return a series
@@ -1373,7 +1379,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1373
1379
  return e;
1374
1380
  }
1375
1381
  }]), n;
1376
- }(), mu = /* @__PURE__ */ function() {
1382
+ }(), yu = /* @__PURE__ */ function() {
1377
1383
  function n(t) {
1378
1384
  Qe(this, n), this.rings = t, this.polys = this._composePolys(t);
1379
1385
  }
@@ -1402,7 +1408,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1402
1408
  return r;
1403
1409
  }
1404
1410
  }]), n;
1405
- }(), _u = /* @__PURE__ */ function() {
1411
+ }(), mu = /* @__PURE__ */ function() {
1406
1412
  function n(t) {
1407
1413
  var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : Yi.compare;
1408
1414
  Qe(this, n), this.queue = t, this.tree = new ko(e), this.segments = [];
@@ -1478,7 +1484,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1478
1484
  return o.push(i), e.consumedBy === void 0 && this.tree.insert(e), o;
1479
1485
  }
1480
1486
  }]), n;
1481
- }(), vs = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, Eu = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6, Iu = /* @__PURE__ */ function() {
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() {
1482
1488
  function n() {
1483
1489
  Qe(this, n);
1484
1490
  }
@@ -1501,7 +1507,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1501
1507
  for (var I = o[v].getSweepEvents(), C = 0, S = I.length; C < S; C++)
1502
1508
  if (E.insert(I[C]), E.size > vs)
1503
1509
  throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big). Please file a bug report.");
1504
- for (var b = new _u(E), P = E.size, D = E.pop(); D; ) {
1510
+ for (var b = new mu(E), P = E.size, D = E.pop(); D; ) {
1505
1511
  var G = D.key;
1506
1512
  if (E.size === P) {
1507
1513
  var A = G.segment;
@@ -1509,7 +1515,7 @@ var cu = Hr * Hr, Ro = function(t, e) {
1509
1515
  }
1510
1516
  if (E.size > vs)
1511
1517
  throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big). Please file a bug report.");
1512
- if (b.segments.length > Eu)
1518
+ if (b.segments.length > _u)
1513
1519
  throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments). Please file a bug report.");
1514
1520
  for (var et = b.process(G), K = 0, nt = et.length; K < nt; K++) {
1515
1521
  var ct = et[K];
@@ -1518,31 +1524,31 @@ var cu = Hr * Hr, Ro = function(t, e) {
1518
1524
  P = E.size, D = E.pop();
1519
1525
  }
1520
1526
  hi.reset();
1521
- var w = yu.factory(b.segments), X = new mu(w);
1527
+ var w = vu.factory(b.segments), X = new yu(w);
1522
1528
  return X.getGeom();
1523
1529
  }
1524
1530
  }]), n;
1525
- }(), tr = new Iu(), Cu = function(t) {
1531
+ }(), tr = new Eu(), Iu = function(t) {
1526
1532
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1527
1533
  r[i - 1] = arguments[i];
1528
1534
  return tr.run("union", t, r);
1529
- }, Nu = function(t) {
1535
+ }, Cu = function(t) {
1530
1536
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1531
1537
  r[i - 1] = arguments[i];
1532
1538
  return tr.run("intersection", t, r);
1533
- }, xu = function(t) {
1539
+ }, Nu = function(t) {
1534
1540
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1535
1541
  r[i - 1] = arguments[i];
1536
1542
  return tr.run("xor", t, r);
1537
- }, Su = function(t) {
1543
+ }, xu = function(t) {
1538
1544
  for (var e = arguments.length, r = new Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
1539
1545
  r[i - 1] = arguments[i];
1540
1546
  return tr.run("difference", t, r);
1541
1547
  }, Hs = {
1542
- union: Cu,
1543
- intersection: Nu,
1544
- xor: xu,
1545
- difference: Su
1548
+ union: Iu,
1549
+ intersection: Cu,
1550
+ xor: Nu,
1551
+ difference: xu
1546
1552
  }, ie = 63710088e-1, Ws = {
1547
1553
  centimeters: ie * 100,
1548
1554
  centimetres: ie * 100,
@@ -1565,7 +1571,7 @@ function io(n, t, e) {
1565
1571
  var r = { type: "Feature" };
1566
1572
  return (e.id === 0 || e.id) && (r.id = e.id), e.bbox && (r.bbox = e.bbox), r.properties = t || {}, r.geometry = n, r;
1567
1573
  }
1568
- function Lu(n, t, e) {
1574
+ function Su(n, t, e) {
1569
1575
  if (e === void 0 && (e = {}), !n)
1570
1576
  throw new Error("coordinates is required");
1571
1577
  if (!Array.isArray(n))
@@ -1609,14 +1615,14 @@ function Ks(n, t, e) {
1609
1615
  };
1610
1616
  return io(r, t, e);
1611
1617
  }
1612
- function wu(n, t) {
1618
+ function Lu(n, t) {
1613
1619
  t === void 0 && (t = "kilometers");
1614
1620
  var e = Ws[t];
1615
1621
  if (!e)
1616
1622
  throw new Error(t + " units is invalid");
1617
1623
  return n * e;
1618
1624
  }
1619
- function Pu(n, t) {
1625
+ function wu(n, t) {
1620
1626
  t === void 0 && (t = "kilometers");
1621
1627
  var e = Ws[t];
1622
1628
  if (!e)
@@ -1629,12 +1635,12 @@ function ys(n) {
1629
1635
  function Hi(n) {
1630
1636
  return n.type === "Feature" ? n.geometry : n;
1631
1637
  }
1632
- function bu(n, t, e) {
1638
+ function Pu(n, t, e) {
1633
1639
  e === void 0 && (e = {});
1634
1640
  var r = Hi(n), i = Hi(t), o = Hs.union(r.coordinates, i.coordinates);
1635
1641
  return o.length === 0 ? null : o.length === 1 ? js(o[0], e.properties) : Ks(o, e.properties);
1636
1642
  }
1637
- function Ru(n, t) {
1643
+ function bu(n, t) {
1638
1644
  var e = Hi(n), r = Hi(t), i = n.properties || {}, o = Hs.difference(
1639
1645
  e.coordinates,
1640
1646
  r.coordinates
@@ -1793,10 +1799,10 @@ function Do(n) {
1793
1799
  }), t;
1794
1800
  }
1795
1801
  Do.default = Do;
1796
- function Ou(n, t) {
1802
+ function Ru(n, t) {
1797
1803
  t === void 0 && (t = {});
1798
1804
  var e = Do(n), r = (e[0] + e[2]) / 2, i = (e[1] + e[3]) / 2;
1799
- return Lu([r, i], t.properties, t);
1805
+ return Su([r, i], t.properties, t);
1800
1806
  }
1801
1807
  "fill" in Array.prototype || Object.defineProperty(Array.prototype, "fill", {
1802
1808
  configurable: !0,
@@ -1873,7 +1879,7 @@ var d = function n() {
1873
1879
  this.x = t.x, this.y = t.y, this.z = t.z;
1874
1880
  } else
1875
1881
  arguments.length === 2 ? (this.x = arguments[0], this.y = arguments[1], this.z = n.NULL_ORDINATE) : arguments.length === 3 && (this.x = arguments[0], this.y = arguments[1], this.z = arguments[2]);
1876
- }, Cn = { DimensionalComparator: { configurable: !0 }, serialVersionUID: { configurable: !0 }, NULL_ORDINATE: { configurable: !0 }, X: { configurable: !0 }, Y: { configurable: !0 }, Z: { configurable: !0 } };
1882
+ }, In = { DimensionalComparator: { configurable: !0 }, serialVersionUID: { configurable: !0 }, NULL_ORDINATE: { configurable: !0 }, X: { configurable: !0 }, Y: { configurable: !0 }, Z: { configurable: !0 } };
1877
1883
  d.prototype.setOrdinate = function(t, e) {
1878
1884
  switch (t) {
1879
1885
  case d.X:
@@ -1957,25 +1963,25 @@ d.hashCode = function() {
1957
1963
  return Math.trunc((e ^ e) >>> 32);
1958
1964
  }
1959
1965
  };
1960
- Cn.DimensionalComparator.get = function() {
1966
+ In.DimensionalComparator.get = function() {
1961
1967
  return Or;
1962
1968
  };
1963
- Cn.serialVersionUID.get = function() {
1969
+ In.serialVersionUID.get = function() {
1964
1970
  return 6683108902428367e3;
1965
1971
  };
1966
- Cn.NULL_ORDINATE.get = function() {
1972
+ In.NULL_ORDINATE.get = function() {
1967
1973
  return F.NaN;
1968
1974
  };
1969
- Cn.X.get = function() {
1975
+ In.X.get = function() {
1970
1976
  return 0;
1971
1977
  };
1972
- Cn.Y.get = function() {
1978
+ In.Y.get = function() {
1973
1979
  return 1;
1974
1980
  };
1975
- Cn.Z.get = function() {
1981
+ In.Z.get = function() {
1976
1982
  return 2;
1977
1983
  };
1978
- Object.defineProperties(d, Cn);
1984
+ Object.defineProperties(d, In);
1979
1985
  var Or = function(t) {
1980
1986
  if (this._dimensionsToTest = 2, arguments.length !== 0) {
1981
1987
  if (arguments.length === 1) {
@@ -2637,7 +2643,7 @@ q.prototype.getClass = function() {
2637
2643
  };
2638
2644
  Object.defineProperties(q, Pi);
2639
2645
  var ea = function() {
2640
- }, $n = function(n) {
2646
+ }, ti = function(n) {
2641
2647
  function t() {
2642
2648
  n.call(this, "Projective point not representable on the Cartesian plane.");
2643
2649
  }
@@ -2686,13 +2692,13 @@ var Ce = function n() {
2686
2692
  Ce.prototype.getY = function() {
2687
2693
  var t = this.y / this.w;
2688
2694
  if (F.isNaN(t) || F.isInfinite(t))
2689
- throw new $n();
2695
+ throw new ti();
2690
2696
  return t;
2691
2697
  };
2692
2698
  Ce.prototype.getX = function() {
2693
2699
  var t = this.x / this.w;
2694
2700
  if (F.isNaN(t) || F.isInfinite(t))
2695
- throw new $n();
2701
+ throw new ti();
2696
2702
  return t;
2697
2703
  };
2698
2704
  Ce.prototype.getCoordinate = function() {
@@ -2708,7 +2714,7 @@ Ce.prototype.getClass = function() {
2708
2714
  Ce.intersection = function(t, e, r, i) {
2709
2715
  var o = t.y - e.y, s = e.x - t.x, a = t.x * e.y - e.x * t.y, u = r.y - i.y, l = i.x - r.x, c = r.x * i.y - i.x * r.y, f = s * c - l * a, h = u * a - o * c, p = o * l - u * s, g = f / p, E = h / p;
2710
2716
  if (F.isNaN(g) || F.isInfinite(g) || F.isNaN(E) || F.isInfinite(E))
2711
- throw new $n();
2717
+ throw new ti();
2712
2718
  return new d(g, E);
2713
2719
  };
2714
2720
  var R = function n() {
@@ -2930,7 +2936,7 @@ so.prototype.read = function(t) {
2930
2936
  var e, r, i;
2931
2937
  t = t.replace(/[\n\r]/g, " ");
2932
2938
  var o = Me.typeStr.exec(t);
2933
- if (t.search("EMPTY") !== -1 && (o = Me.emptyTypeStr.exec(t), o[2] = void 0), o && (r = o[1].toLowerCase(), i = o[2], On[r] && (e = On[r].apply(this, [i]))), e === void 0)
2939
+ if (t.search("EMPTY") !== -1 && (o = Me.emptyTypeStr.exec(t), o[2] = void 0), o && (r = o[1].toLowerCase(), i = o[2], Rn[r] && (e = Rn[r].apply(this, [i]))), e === void 0)
2934
2940
  throw new Error("Could not parse WKT " + t);
2935
2941
  return e;
2936
2942
  };
@@ -3035,7 +3041,7 @@ var dr = {
3035
3041
  r.push(e.extractGeometry(t._geometries[i]));
3036
3042
  return r.join(",");
3037
3043
  }
3038
- }, On = {
3044
+ }, Rn = {
3039
3045
  /**
3040
3046
  * Return point geometry given a point WKT fragment.
3041
3047
  *
@@ -3064,7 +3070,7 @@ var dr = {
3064
3070
  if (t === void 0)
3065
3071
  return this.geometryFactory.createMultiPoint();
3066
3072
  for (var r, i = t.trim().split(","), o = [], s = 0, a = i.length; s < a; ++s)
3067
- r = i[s].replace(Me.trimParens, "$1"), o.push(On.point.apply(e, [r]));
3073
+ r = i[s].replace(Me.trimParens, "$1"), o.push(Rn.point.apply(e, [r]));
3068
3074
  return this.geometryFactory.createMultiPoint(o);
3069
3075
  },
3070
3076
  /**
@@ -3107,7 +3113,7 @@ var dr = {
3107
3113
  if (t === void 0)
3108
3114
  return this.geometryFactory.createMultiLineString();
3109
3115
  for (var r, i = t.trim().split(Me.parenComma), o = [], s = 0, a = i.length; s < a; ++s)
3110
- r = i[s].replace(Me.trimParens, "$1"), o.push(On.linestring.apply(e, [r]));
3116
+ r = i[s].replace(Me.trimParens, "$1"), o.push(Rn.linestring.apply(e, [r]));
3111
3117
  return this.geometryFactory.createMultiLineString(o);
3112
3118
  },
3113
3119
  /**
@@ -3122,7 +3128,7 @@ var dr = {
3122
3128
  if (t === void 0)
3123
3129
  return this.geometryFactory.createPolygon();
3124
3130
  for (var r, i, o, s = t.trim().split(Me.parenComma), a, u = [], l = 0, c = s.length; l < c; ++l)
3125
- r = s[l].replace(Me.trimParens, "$1"), i = On.linestring.apply(e, [r]), o = e.geometryFactory.createLinearRing(i._points), l === 0 ? a = o : u.push(o);
3131
+ r = s[l].replace(Me.trimParens, "$1"), i = Rn.linestring.apply(e, [r]), o = e.geometryFactory.createLinearRing(i._points), l === 0 ? a = o : u.push(o);
3126
3132
  return this.geometryFactory.createPolygon(a, u);
3127
3133
  },
3128
3134
  /**
@@ -3137,7 +3143,7 @@ var dr = {
3137
3143
  if (t === void 0)
3138
3144
  return this.geometryFactory.createMultiPolygon();
3139
3145
  for (var r, i = t.trim().split(Me.doubleParenComma), o = [], s = 0, a = i.length; s < a; ++s)
3140
- r = i[s].replace(Me.trimParens, "$1"), o.push(On.polygon.apply(e, [r]));
3146
+ r = i[s].replace(Me.trimParens, "$1"), o.push(Rn.polygon.apply(e, [r]));
3141
3147
  return this.geometryFactory.createMultiPolygon(o);
3142
3148
  },
3143
3149
  /**
@@ -3220,7 +3226,7 @@ var ot = function() {
3220
3226
  this._result = null, this._inputLines = Array(2).fill().map(function() {
3221
3227
  return Array(2);
3222
3228
  }), this._intPt = new Array(2).fill(null), this._intLineIndex = null, this._isProper = null, this._pa = null, this._pb = null, this._precisionModel = null, this._intPt[0] = new d(), this._intPt[1] = new d(), this._pa = this._intPt[0], this._pb = this._intPt[1], this._result = 0;
3223
- }, Nn = { DONT_INTERSECT: { configurable: !0 }, DO_INTERSECT: { configurable: !0 }, COLLINEAR: { configurable: !0 }, NO_INTERSECTION: { configurable: !0 }, POINT_INTERSECTION: { configurable: !0 }, COLLINEAR_INTERSECTION: { configurable: !0 } };
3229
+ }, Cn = { DONT_INTERSECT: { configurable: !0 }, DO_INTERSECT: { configurable: !0 }, COLLINEAR: { configurable: !0 }, NO_INTERSECTION: { configurable: !0 }, POINT_INTERSECTION: { configurable: !0 }, COLLINEAR_INTERSECTION: { configurable: !0 } };
3224
3230
  ot.prototype.getIndexAlongSegment = function(t, e) {
3225
3231
  return this.computeIntLineIndex(), this._intLineIndex[t][e];
3226
3232
  };
@@ -3314,25 +3320,25 @@ ot.nonRobustComputeEdgeDistance = function(t, e, r) {
3314
3320
  var i = t.x - e.x, o = t.y - e.y, s = Math.sqrt(i * i + o * o);
3315
3321
  return V.isTrue(!(s === 0 && !t.equals(e)), "Invalid distance calculation"), s;
3316
3322
  };
3317
- Nn.DONT_INTERSECT.get = function() {
3323
+ Cn.DONT_INTERSECT.get = function() {
3318
3324
  return 0;
3319
3325
  };
3320
- Nn.DO_INTERSECT.get = function() {
3326
+ Cn.DO_INTERSECT.get = function() {
3321
3327
  return 1;
3322
3328
  };
3323
- Nn.COLLINEAR.get = function() {
3329
+ Cn.COLLINEAR.get = function() {
3324
3330
  return 2;
3325
3331
  };
3326
- Nn.NO_INTERSECTION.get = function() {
3332
+ Cn.NO_INTERSECTION.get = function() {
3327
3333
  return 0;
3328
3334
  };
3329
- Nn.POINT_INTERSECTION.get = function() {
3335
+ Cn.POINT_INTERSECTION.get = function() {
3330
3336
  return 1;
3331
3337
  };
3332
- Nn.COLLINEAR_INTERSECTION.get = function() {
3338
+ Cn.COLLINEAR_INTERSECTION.get = function() {
3333
3339
  return 2;
3334
3340
  };
3335
- Object.defineProperties(ot, Nn);
3341
+ Object.defineProperties(ot, Cn);
3336
3342
  var sn = function(n) {
3337
3343
  function t() {
3338
3344
  n.apply(this, arguments);
@@ -3355,7 +3361,7 @@ var sn = function(n) {
3355
3361
  try {
3356
3362
  a = Ce.intersection(r, i, o, s);
3357
3363
  } catch (u) {
3358
- if (u instanceof $n)
3364
+ if (u instanceof ti)
3359
3365
  a = t.nearestEndpoint(r, i, o, s);
3360
3366
  else
3361
3367
  throw u;
@@ -3518,7 +3524,7 @@ Ge.locatePointInRing = function() {
3518
3524
  }
3519
3525
  };
3520
3526
  var L = function() {
3521
- }, xn = { CLOCKWISE: { configurable: !0 }, RIGHT: { configurable: !0 }, COUNTERCLOCKWISE: { configurable: !0 }, LEFT: { configurable: !0 }, COLLINEAR: { configurable: !0 }, STRAIGHT: { configurable: !0 } };
3527
+ }, Nn = { CLOCKWISE: { configurable: !0 }, RIGHT: { configurable: !0 }, COUNTERCLOCKWISE: { configurable: !0 }, LEFT: { configurable: !0 }, COLLINEAR: { configurable: !0 }, STRAIGHT: { configurable: !0 } };
3522
3528
  L.prototype.interfaces_ = function() {
3523
3529
  return [];
3524
3530
  };
@@ -3649,25 +3655,25 @@ L.isOnLine = function(t, e) {
3649
3655
  }
3650
3656
  return !1;
3651
3657
  };
3652
- xn.CLOCKWISE.get = function() {
3658
+ Nn.CLOCKWISE.get = function() {
3653
3659
  return -1;
3654
3660
  };
3655
- xn.RIGHT.get = function() {
3661
+ Nn.RIGHT.get = function() {
3656
3662
  return L.CLOCKWISE;
3657
3663
  };
3658
- xn.COUNTERCLOCKWISE.get = function() {
3664
+ Nn.COUNTERCLOCKWISE.get = function() {
3659
3665
  return 1;
3660
3666
  };
3661
- xn.LEFT.get = function() {
3667
+ Nn.LEFT.get = function() {
3662
3668
  return L.COUNTERCLOCKWISE;
3663
3669
  };
3664
- xn.COLLINEAR.get = function() {
3670
+ Nn.COLLINEAR.get = function() {
3665
3671
  return 0;
3666
3672
  };
3667
- xn.STRAIGHT.get = function() {
3673
+ Nn.STRAIGHT.get = function() {
3668
3674
  return L.COLLINEAR;
3669
3675
  };
3670
- Object.defineProperties(L, xn);
3676
+ Object.defineProperties(L, Nn);
3671
3677
  var Cr = function() {
3672
3678
  };
3673
3679
  Cr.prototype.filter = function(t) {
@@ -3952,13 +3958,13 @@ function Uo(n) {
3952
3958
  }
3953
3959
  Uo.prototype = new Error();
3954
3960
  Uo.prototype.name = "IndexOutOfBoundsException";
3955
- var ti = function() {
3961
+ var ei = function() {
3956
3962
  };
3957
- ti.prototype.hasNext = function() {
3963
+ ei.prototype.hasNext = function() {
3958
3964
  };
3959
- ti.prototype.next = function() {
3965
+ ei.prototype.next = function() {
3960
3966
  };
3961
- ti.prototype.remove = function() {
3967
+ ei.prototype.remove = function() {
3962
3968
  };
3963
3969
  var Ne = function(n) {
3964
3970
  function t() {
@@ -3969,11 +3975,11 @@ var Ne = function(n) {
3969
3975
  }, t.prototype.isEmpty = function() {
3970
3976
  }, t;
3971
3977
  }(_t);
3972
- function ei(n) {
3978
+ function ri(n) {
3973
3979
  this.message = n || "";
3974
3980
  }
3975
- ei.prototype = new Error();
3976
- ei.prototype.name = "NoSuchElementException";
3981
+ ri.prototype = new Error();
3982
+ ri.prototype.name = "NoSuchElementException";
3977
3983
  var x = function(n) {
3978
3984
  function t() {
3979
3985
  n.call(this), this.array_ = [], arguments[0] instanceof _t && this.addAll(arguments[0]);
@@ -3993,7 +3999,7 @@ var x = function(n) {
3993
3999
  var o = this.array_[r];
3994
4000
  return this.array_[r] = i, o;
3995
4001
  }, t.prototype.iterator = function() {
3996
- return new Du(this);
4002
+ return new Ou(this);
3997
4003
  }, t.prototype.get = function(r) {
3998
4004
  if (r < 0 || r >= this.size())
3999
4005
  throw new Uo();
@@ -4014,13 +4020,13 @@ var x = function(n) {
4014
4020
  }
4015
4021
  return o;
4016
4022
  }, t;
4017
- }(Ne), Du = function(n) {
4023
+ }(Ne), Ou = function(n) {
4018
4024
  function t(e) {
4019
4025
  n.call(this), this.arrayList_ = e, this.position_ = 0;
4020
4026
  }
4021
4027
  return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.next = function() {
4022
4028
  if (this.position_ === this.arrayList_.size())
4023
- throw new ei();
4029
+ throw new ri();
4024
4030
  return this.arrayList_.get(this.position_++);
4025
4031
  }, t.prototype.hasNext = function() {
4026
4032
  return this.position_ < this.arrayList_.size();
@@ -4029,7 +4035,7 @@ var x = function(n) {
4029
4035
  }, t.prototype.remove = function() {
4030
4036
  this.arrayList_.remove(this.arrayList_.get(this.position_));
4031
4037
  }, t;
4032
- }(ti), bi = function(n) {
4038
+ }(ei), bi = function(n) {
4033
4039
  function t() {
4034
4040
  if (n.call(this), arguments.length !== 0) {
4035
4041
  if (arguments.length === 1) {
@@ -4331,24 +4337,24 @@ Gn.prototype.interfaces_ = function() {
4331
4337
  Gn.prototype.getClass = function() {
4332
4338
  return Gn;
4333
4339
  };
4334
- var Sn = function() {
4340
+ var xn = function() {
4335
4341
  };
4336
- Sn.prototype.get = function() {
4342
+ xn.prototype.get = function() {
4337
4343
  };
4338
- Sn.prototype.put = function() {
4344
+ xn.prototype.put = function() {
4339
4345
  };
4340
- Sn.prototype.size = function() {
4346
+ xn.prototype.size = function() {
4341
4347
  };
4342
- Sn.prototype.values = function() {
4348
+ xn.prototype.values = function() {
4343
4349
  };
4344
- Sn.prototype.entrySet = function() {
4350
+ xn.prototype.entrySet = function() {
4345
4351
  };
4346
- var Tu = function(n) {
4352
+ var Du = function(n) {
4347
4353
  function t() {
4348
4354
  n.apply(this, arguments);
4349
4355
  }
4350
4356
  return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t;
4351
- }(Sn);
4357
+ }(xn);
4352
4358
  function Ri(n) {
4353
4359
  this.message = n || "";
4354
4360
  }
@@ -4387,22 +4393,22 @@ var qo = function(n) {
4387
4393
  i.push(r.array_[o]);
4388
4394
  return i;
4389
4395
  }, t.prototype.iterator = function() {
4390
- return new Mu(this);
4396
+ return new Tu(this);
4391
4397
  }, t;
4392
- }(uo), Mu = function(n) {
4398
+ }(uo), Tu = function(n) {
4393
4399
  function t(e) {
4394
4400
  n.call(this), this.hashSet_ = e, this.position_ = 0;
4395
4401
  }
4396
4402
  return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.next = function() {
4397
4403
  if (this.position_ === this.hashSet_.size())
4398
- throw new ei();
4404
+ throw new ri();
4399
4405
  return this.hashSet_.array_[this.position_++];
4400
4406
  }, t.prototype.hasNext = function() {
4401
4407
  return this.position_ < this.hashSet_.size();
4402
4408
  }, t.prototype.remove = function() {
4403
4409
  throw new Ri();
4404
4410
  }, t;
4405
- }(ti), mr = 0, qr = 1;
4411
+ }(ei), mr = 0, qr = 1;
4406
4412
  function _s(n) {
4407
4413
  return n === null ? mr : n.color;
4408
4414
  }
@@ -4421,7 +4427,7 @@ function Es(n) {
4421
4427
  function At() {
4422
4428
  this.root_ = null, this.size_ = 0;
4423
4429
  }
4424
- At.prototype = new Tu();
4430
+ At.prototype = new Du();
4425
4431
  At.prototype.get = function(n) {
4426
4432
  for (var t = this.root_; t !== null; ) {
4427
4433
  var e = n.compareTo(t.key);
@@ -4599,7 +4605,7 @@ var lo = function(n) {
4599
4605
  };
4600
4606
  lo.prototype.next = function() {
4601
4607
  if (this.position_ === this.treeSet_.size())
4602
- throw new ei();
4608
+ throw new ri();
4603
4609
  return this.treeSet_.array_[this.position_++];
4604
4610
  };
4605
4611
  lo.prototype.hasNext = function() {
@@ -4985,18 +4991,18 @@ ji.prototype.interfaces_ = function() {
4985
4991
  ji.prototype.getClass = function() {
4986
4992
  return ji;
4987
4993
  };
4988
- function Au() {
4994
+ function Mu() {
4989
4995
  }
4990
- function Fu() {
4996
+ function Au() {
4991
4997
  }
4992
- var Bu = function() {
4998
+ var Fu = function() {
4993
4999
  };
5000
+ function Bu() {
5001
+ }
4994
5002
  function Gu() {
4995
5003
  }
4996
5004
  function Vu() {
4997
5005
  }
4998
- function ku() {
4999
- }
5000
5006
  var de = function() {
5001
5007
  }, Xo = { NEWLINE: { configurable: !0 }, SIMPLE_ORDINATE_FORMAT: { configurable: !0 } };
5002
5008
  de.prototype.interfaces_ = function() {
@@ -5012,16 +5018,16 @@ de.chars = function(t, e) {
5012
5018
  };
5013
5019
  de.getStackTrace = function() {
5014
5020
  if (arguments.length === 1) {
5015
- var t = arguments[0], e = new Gu(), r = new Au();
5021
+ var t = arguments[0], e = new Bu(), r = new Mu();
5016
5022
  return t.printStackTrace(r), e.toString();
5017
5023
  } else if (arguments.length === 2) {
5018
5024
  var i = arguments[0], o = arguments[1], s = "";
5019
- new Fu(de.getStackTrace(i));
5020
- for (var a = new ku(), u = 0; u < o; u++)
5025
+ new Au(de.getStackTrace(i));
5026
+ for (var a = new Vu(), u = 0; u < o; u++)
5021
5027
  try {
5022
5028
  s += a.readLine() + de.NEWLINE;
5023
5029
  } catch (l) {
5024
- if (l instanceof Vu)
5030
+ if (l instanceof Gu)
5025
5031
  V.shouldNeverReachHere();
5026
5032
  else
5027
5033
  throw l;
@@ -5053,7 +5059,7 @@ Xo.NEWLINE.get = function() {
5053
5059
  return Rt.getProperty("line.separator");
5054
5060
  };
5055
5061
  Xo.SIMPLE_ORDINATE_FORMAT.get = function() {
5056
- return new Bu();
5062
+ return new Fu();
5057
5063
  };
5058
5064
  Object.defineProperties(de, Xo);
5059
5065
  var gt = function() {
@@ -5923,7 +5929,7 @@ var oa = function(n) {
5923
5929
  }, t.prototype.size = function() {
5924
5930
  return this.map_.size();
5925
5931
  }, t;
5926
- }(Sn), W = function n() {
5932
+ }(xn), W = function n() {
5927
5933
  if (this._modelType = null, this._scale = null, arguments.length === 0)
5928
5934
  this._modelType = n.FLOATING;
5929
5935
  else if (arguments.length === 1) {
@@ -6229,7 +6235,7 @@ sa.serialVersionUID.get = function() {
6229
6235
  return -6820524753094096e3;
6230
6236
  };
6231
6237
  Object.defineProperties(k, sa);
6232
- var zu = ["Point", "MultiPoint", "LineString", "MultiLineString", "Polygon", "MultiPolygon"], fo = function(t) {
6238
+ var ku = ["Point", "MultiPoint", "LineString", "MultiLineString", "Polygon", "MultiPolygon"], fo = function(t) {
6233
6239
  this.geometryFactory = t || new k();
6234
6240
  };
6235
6241
  fo.prototype.read = function(t) {
@@ -6238,7 +6244,7 @@ fo.prototype.read = function(t) {
6238
6244
  var r = e.type;
6239
6245
  if (!Fe[r])
6240
6246
  throw new Error("Unknown GeoJSON type: " + e.type);
6241
- return zu.indexOf(r) !== -1 ? Fe[r].apply(this, [e.coordinates]) : r === "GeometryCollection" ? Fe[r].apply(this, [e.geometries]) : Fe[r].apply(this, [e]);
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]);
6242
6248
  };
6243
6249
  fo.prototype.write = function(t) {
6244
6250
  var e = t.getGeometryType();
@@ -7144,7 +7150,7 @@ mt.prototype.interfaces_ = function() {
7144
7150
  mt.prototype.getClass = function() {
7145
7151
  return mt;
7146
7152
  };
7147
- var Uu = function(n) {
7153
+ var zu = function(n) {
7148
7154
  function t() {
7149
7155
  var e = arguments[0], r = arguments[1];
7150
7156
  n.call(this, e, r);
@@ -7158,7 +7164,7 @@ var Uu = function(n) {
7158
7164
  }, t.prototype.getClass = function() {
7159
7165
  return t;
7160
7166
  }, t;
7161
- }(mt), qu = function(n) {
7167
+ }(mt), Uu = function(n) {
7162
7168
  function t() {
7163
7169
  var e = arguments[0], r = arguments[1];
7164
7170
  n.call(this, e, r);
@@ -7167,7 +7173,7 @@ var Uu = function(n) {
7167
7173
  var r = this, i = new x(), o = this._startDe;
7168
7174
  do {
7169
7175
  if (o.getMinEdgeRing() === null) {
7170
- var s = new Uu(o, r._geometryFactory);
7176
+ var s = new zu(o, r._geometryFactory);
7171
7177
  i.add(s);
7172
7178
  }
7173
7179
  o = o.getNext();
@@ -7732,7 +7738,7 @@ ee.prototype.buildMaximalEdgeRings = function(t) {
7732
7738
  for (var e = this, r = new x(), i = t.iterator(); i.hasNext(); ) {
7733
7739
  var o = i.next();
7734
7740
  if (o.isInResult() && o.getLabel().isArea() && o.getEdgeRing() === null) {
7735
- var s = new qu(o, e._geometryFactory);
7741
+ var s = new Uu(o, e._geometryFactory);
7736
7742
  r.add(s), s.setInResult();
7737
7743
  }
7738
7744
  }
@@ -8145,7 +8151,7 @@ xt.compareDoubles = function(t, e) {
8145
8151
  return t > e ? 1 : t < e ? -1 : 0;
8146
8152
  };
8147
8153
  yo.IntersectsOp.get = function() {
8148
- return Xu;
8154
+ return qu;
8149
8155
  };
8150
8156
  yo.serialVersionUID.get = function() {
8151
8157
  return -3886435814360241e3;
@@ -8154,7 +8160,7 @@ yo.DEFAULT_NODE_CAPACITY.get = function() {
8154
8160
  return 10;
8155
8161
  };
8156
8162
  Object.defineProperties(xt, yo);
8157
- var Xu = function() {
8163
+ var qu = function() {
8158
8164
  }, Un = function() {
8159
8165
  };
8160
8166
  Un.prototype.distance = function(t, e) {
@@ -8739,7 +8745,7 @@ O.prototype.lineIntersection = function(t) {
8739
8745
  var e = Ce.intersection(this.p0, this.p1, t.p0, t.p1);
8740
8746
  return e;
8741
8747
  } catch (r) {
8742
- if (!(r instanceof $n))
8748
+ if (!(r instanceof ti))
8743
8749
  throw r;
8744
8750
  } finally {
8745
8751
  }
@@ -9252,7 +9258,7 @@ fa.COORDINATE_ARRAY_TYPE.get = function() {
9252
9258
  };
9253
9259
  Object.defineProperties(ce, fa);
9254
9260
  var U = function() {
9255
- }, Ln = { PI_TIMES_2: { configurable: !0 }, PI_OVER_2: { configurable: !0 }, PI_OVER_4: { configurable: !0 }, COUNTERCLOCKWISE: { configurable: !0 }, CLOCKWISE: { configurable: !0 }, NONE: { configurable: !0 } };
9261
+ }, Sn = { PI_TIMES_2: { configurable: !0 }, PI_OVER_2: { configurable: !0 }, PI_OVER_4: { configurable: !0 }, COUNTERCLOCKWISE: { configurable: !0 }, CLOCKWISE: { configurable: !0 }, NONE: { configurable: !0 } };
9256
9262
  U.prototype.interfaces_ = function() {
9257
9263
  return [];
9258
9264
  };
@@ -9321,25 +9327,25 @@ U.angleBetweenOriented = function(t, e, r) {
9321
9327
  var i = U.angle(e, t), o = U.angle(e, r), s = o - i;
9322
9328
  return s <= -Math.PI ? s + U.PI_TIMES_2 : s > Math.PI ? s - U.PI_TIMES_2 : s;
9323
9329
  };
9324
- Ln.PI_TIMES_2.get = function() {
9330
+ Sn.PI_TIMES_2.get = function() {
9325
9331
  return 2 * Math.PI;
9326
9332
  };
9327
- Ln.PI_OVER_2.get = function() {
9333
+ Sn.PI_OVER_2.get = function() {
9328
9334
  return Math.PI / 2;
9329
9335
  };
9330
- Ln.PI_OVER_4.get = function() {
9336
+ Sn.PI_OVER_4.get = function() {
9331
9337
  return Math.PI / 4;
9332
9338
  };
9333
- Ln.COUNTERCLOCKWISE.get = function() {
9339
+ Sn.COUNTERCLOCKWISE.get = function() {
9334
9340
  return L.COUNTERCLOCKWISE;
9335
9341
  };
9336
- Ln.CLOCKWISE.get = function() {
9342
+ Sn.CLOCKWISE.get = function() {
9337
9343
  return L.CLOCKWISE;
9338
9344
  };
9339
- Ln.NONE.get = function() {
9345
+ Sn.NONE.get = function() {
9340
9346
  return L.COLLINEAR;
9341
9347
  };
9342
- Object.defineProperties(U, Ln);
9348
+ Object.defineProperties(U, Sn);
9343
9349
  var rt = function n() {
9344
9350
  this._maxCurveSegmentError = 0, this._filletAngleQuantum = null, this._closingSegLengthFactor = 1, this._segList = null, this._distance = 0, this._precisionModel = null, this._bufParams = null, this._li = null, this._s0 = null, this._s1 = null, this._s2 = null, this._seg0 = new O(), this._seg1 = new O(), this._offset0 = new O(), this._offset1 = new O(), this._side = 0, this._hasNarrowConcaveAngle = !1;
9345
9351
  var t = arguments[0], e = arguments[1], r = arguments[2];
@@ -9383,7 +9389,7 @@ rt.prototype.addMitreJoin = function(t, e, r, i) {
9383
9389
  var a = i <= 0 ? 1 : s.distance(t) / Math.abs(i);
9384
9390
  a > this._bufParams.getMitreLimit() && (o = !1);
9385
9391
  } catch (u) {
9386
- if (u instanceof $n)
9392
+ if (u instanceof ti)
9387
9393
  s = new d(0, 0), o = !1;
9388
9394
  else
9389
9395
  throw u;
@@ -9866,7 +9872,7 @@ rr.prototype.next = function() {
9866
9872
  this._subcollectionIterator = null;
9867
9873
  }
9868
9874
  if (this._index >= this._max)
9869
- throw new ei();
9875
+ throw new ri();
9870
9876
  var t = this._parent.getGeometryN(this._index++);
9871
9877
  return t instanceof Xt ? (this._subcollectionIterator = new rr(t), this._subcollectionIterator.next()) : t;
9872
9878
  };
@@ -9884,7 +9890,7 @@ rr.prototype.hasNext = function() {
9884
9890
  return !(this._index >= this._max);
9885
9891
  };
9886
9892
  rr.prototype.interfaces_ = function() {
9887
- return [ti];
9893
+ return [ei];
9888
9894
  };
9889
9895
  rr.prototype.getClass = function() {
9890
9896
  return rr;
@@ -10064,7 +10070,7 @@ Bt.prototype.interfaces_ = function() {
10064
10070
  Bt.prototype.getClass = function() {
10065
10071
  return Bt;
10066
10072
  };
10067
- var Yu = function(n) {
10073
+ var Xu = function(n) {
10068
10074
  function t() {
10069
10075
  n.call(this), this._resultAreaEdgeList = null, this._label = null, this._SCANNING_FOR_INCOMING = 1, this._LINKING_TO_OUTGOING = 2;
10070
10076
  }
@@ -10222,7 +10228,7 @@ var Yu = function(n) {
10222
10228
  n.apply(this, arguments);
10223
10229
  }
10224
10230
  return n && (t.__proto__ = n), t.prototype = Object.create(n && n.prototype), t.prototype.constructor = t, t.prototype.createNode = function(r) {
10225
- return new vo(r, new Yu());
10231
+ return new vo(r, new Xu());
10226
10232
  }, t.prototype.interfaces_ = function() {
10227
10233
  return [];
10228
10234
  }, t.prototype.getClass = function() {
@@ -11175,7 +11181,7 @@ var Pt = function() {
11175
11181
  var e = arguments[0], r = arguments[1];
11176
11182
  this._argGeom = e, this._bufParams = r;
11177
11183
  }
11178
- }, ri = { CAP_ROUND: { configurable: !0 }, CAP_BUTT: { configurable: !0 }, CAP_FLAT: { configurable: !0 }, CAP_SQUARE: { configurable: !0 }, MAX_PRECISION_DIGITS: { configurable: !0 } };
11184
+ }, ni = { CAP_ROUND: { configurable: !0 }, CAP_BUTT: { configurable: !0 }, CAP_FLAT: { configurable: !0 }, CAP_SQUARE: { configurable: !0 }, MAX_PRECISION_DIGITS: { configurable: !0 } };
11179
11185
  Pt.prototype.bufferFixedPrecision = function(t) {
11180
11186
  var e = new Gr(new ur(new W(1)), t.getScale()), r = new qt(this._bufParams);
11181
11187
  r.setWorkingPrecisionModel(t), r.setNoder(e), this._resultGeometry = r.buffer(this._argGeom, this._distance);
@@ -11260,22 +11266,22 @@ Pt.precisionScaleFactor = function(t, e, r) {
11260
11266
  var i = t.getEnvelopeInternal(), o = ue.max(Math.abs(i.getMaxX()), Math.abs(i.getMaxY()), Math.abs(i.getMinX()), Math.abs(i.getMinY())), s = e > 0 ? e : 0, a = o + 2 * s, u = Math.trunc(Math.log(a) / Math.log(10) + 1), l = r - u, c = Math.pow(10, l);
11261
11267
  return c;
11262
11268
  };
11263
- ri.CAP_ROUND.get = function() {
11269
+ ni.CAP_ROUND.get = function() {
11264
11270
  return H.CAP_ROUND;
11265
11271
  };
11266
- ri.CAP_BUTT.get = function() {
11272
+ ni.CAP_BUTT.get = function() {
11267
11273
  return H.CAP_FLAT;
11268
11274
  };
11269
- ri.CAP_FLAT.get = function() {
11275
+ ni.CAP_FLAT.get = function() {
11270
11276
  return H.CAP_FLAT;
11271
11277
  };
11272
- ri.CAP_SQUARE.get = function() {
11278
+ ni.CAP_SQUARE.get = function() {
11273
11279
  return H.CAP_SQUARE;
11274
11280
  };
11275
- ri.MAX_PRECISION_DIGITS.get = function() {
11281
+ ni.MAX_PRECISION_DIGITS.get = function() {
11276
11282
  return 12;
11277
11283
  };
11278
- Object.defineProperties(Pt, ri);
11284
+ Object.defineProperties(Pt, ni);
11279
11285
  var kt = function() {
11280
11286
  this._pt = [new d(), new d()], this._distance = F.NaN, this._isNull = !0;
11281
11287
  };
@@ -12999,7 +13005,7 @@ Tt.prototype.getClass = function() {
12999
13005
  Tt.isAdjacentSegments = function(t, e) {
13000
13006
  return Math.abs(t - e) === 1;
13001
13007
  };
13002
- var Hu = function(n) {
13008
+ var Yu = function(n) {
13003
13009
  function t() {
13004
13010
  n.call(this), this.events = new x(), this.nOverlaps = null;
13005
13011
  }
@@ -13096,7 +13102,7 @@ Si.prototype.interfaces_ = function() {
13096
13102
  Si.prototype.getClass = function() {
13097
13103
  return Si;
13098
13104
  };
13099
- var Wu = function(n) {
13105
+ var Hu = function(n) {
13100
13106
  function t() {
13101
13107
  n.call(this), this._item = null;
13102
13108
  var e = arguments[0], r = arguments[1], i = arguments[2];
@@ -13111,7 +13117,7 @@ var Wu = function(n) {
13111
13117
  }, t.prototype.getClass = function() {
13112
13118
  return t;
13113
13119
  }, t;
13114
- }(cr), ju = function(n) {
13120
+ }(cr), Wu = function(n) {
13115
13121
  function t() {
13116
13122
  n.call(this), this._node1 = null, this._node2 = null;
13117
13123
  var e = arguments[0], r = arguments[1];
@@ -13143,7 +13149,7 @@ fr.prototype.buildTree = function() {
13143
13149
  fr.prototype.insert = function(t, e, r) {
13144
13150
  if (this._root !== null)
13145
13151
  throw new Error("Index cannot be added to once it has been queried");
13146
- this._leaves.add(new Wu(t, e, r));
13152
+ this._leaves.add(new Hu(t, e, r));
13147
13153
  };
13148
13154
  fr.prototype.query = function(t, e, r) {
13149
13155
  this.init(), this._root.query(t, e, r);
@@ -13168,7 +13174,7 @@ fr.prototype.buildLevel = function(t, e) {
13168
13174
  if (o === null)
13169
13175
  e.add(i);
13170
13176
  else {
13171
- var s = new ju(t.get(r), t.get(r + 1));
13177
+ var s = new Wu(t.get(r), t.get(r + 1));
13172
13178
  e.add(s);
13173
13179
  }
13174
13180
  }
@@ -13359,7 +13365,7 @@ var si = function(n) {
13359
13365
  var s = this._nodes.addNode(i), a = s.getLabel();
13360
13366
  a === null ? s._label = new Q(r, o) : a.setLocation(r, o);
13361
13367
  }, t.prototype.createEdgeSetIntersector = function() {
13362
- return new Hu();
13368
+ return new Yu();
13363
13369
  }, t.prototype.addSelfIntersectionNodes = function(r) {
13364
13370
  for (var i = this, o = this._edges.iterator(); o.hasNext(); )
13365
13371
  for (var s = o.next(), a = s.getLabel().getLocation(r), u = s.eiList.iterator(); u.hasNext(); ) {
@@ -14003,22 +14009,22 @@ Zi.prototype = {
14003
14009
  this.t = 0;
14004
14010
  },
14005
14011
  add: function(n) {
14006
- Ns(Fi, n, this.t), Ns(this, Fi.s, this.s), this.s ? this.t += Fi.t : this.s = Fi.t;
14012
+ Ns(Bi, n, this.t), Ns(this, Bi.s, this.s), this.s ? this.t += Bi.t : this.s = Bi.t;
14007
14013
  },
14008
14014
  valueOf: function() {
14009
14015
  return this.s;
14010
14016
  }
14011
14017
  };
14012
- var Fi = new Zi();
14018
+ var Bi = new Zi();
14013
14019
  function Ns(n, t, e) {
14014
14020
  var r = n.s = t + e, i = r - t, o = r - i;
14015
14021
  n.t = t - o + (e - i);
14016
14022
  }
14017
- 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, Ku = Math.atan, Qn = Math.atan2, Et = Math.cos, It = Math.sin, ni = Math.sqrt;
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;
14018
14024
  function Sa(n) {
14019
14025
  return n > 1 ? 0 : n < -1 ? Z : Math.acos(n);
14020
14026
  }
14021
- function In(n) {
14027
+ function Jn(n) {
14022
14028
  return n > 1 ? _r : n < -1 ? -_r : Math.asin(n);
14023
14029
  }
14024
14030
  function ai() {
@@ -14076,19 +14082,19 @@ function ws(n, t) {
14076
14082
  Mo(n[e], t, 1);
14077
14083
  t.polygonEnd();
14078
14084
  }
14079
- function Qu(n, t) {
14085
+ function Ku(n, t) {
14080
14086
  n && Ss.hasOwnProperty(n.type) ? Ss[n.type](n, t) : $i(n, t);
14081
14087
  }
14082
14088
  an();
14083
14089
  an();
14084
14090
  function Ao(n) {
14085
- return [Qn(n[1], n[0]), In(n[2])];
14091
+ return [Qn(n[1], n[0]), Jn(n[2])];
14086
14092
  }
14087
- function Jn(n) {
14093
+ function Zn(n) {
14088
14094
  var t = n[0], e = n[1], r = Et(e);
14089
14095
  return [r * Et(t), r * It(t), It(e)];
14090
14096
  }
14091
- function Bi(n, t) {
14097
+ function Gi(n, t) {
14092
14098
  return n[0] * t[0] + n[1] * t[1] + n[2] * t[2];
14093
14099
  }
14094
14100
  function to(n, t) {
@@ -14097,11 +14103,11 @@ function to(n, t) {
14097
14103
  function Io(n, t) {
14098
14104
  n[0] += t[0], n[1] += t[1], n[2] += t[2];
14099
14105
  }
14100
- function Gi(n, t) {
14106
+ function Vi(n, t) {
14101
14107
  return [n[0] * t, n[1] * t, n[2] * t];
14102
14108
  }
14103
14109
  function Fo(n) {
14104
- var t = ni(n[0] * n[0] + n[1] * n[1] + n[2] * n[2]);
14110
+ var t = Mi(n[0] * n[0] + n[1] * n[1] + n[2] * n[2]);
14105
14111
  n[0] /= t, n[1] /= t, n[2] /= t;
14106
14112
  }
14107
14113
  an();
@@ -14117,7 +14123,7 @@ function Bo(n, t) {
14117
14123
  return [n > Z ? n - Lr : n < -Z ? n + Lr : n, t];
14118
14124
  }
14119
14125
  Bo.invert = Bo;
14120
- function Ju(n, t, e) {
14126
+ function Qu(n, t, e) {
14121
14127
  return (n %= Lr) ? t || e ? La(bs(n), Rs(t, e)) : bs(n) : t || e ? Rs(t, e) : Bo;
14122
14128
  }
14123
14129
  function Ps(n) {
@@ -14135,18 +14141,18 @@ function Rs(n, t) {
14135
14141
  var l = Et(u), c = Et(a) * l, f = It(a) * l, h = It(u), p = h * e + c * r;
14136
14142
  return [
14137
14143
  Qn(f * i - p * o, c * e - h * r),
14138
- In(p * i + f * o)
14144
+ Jn(p * i + f * o)
14139
14145
  ];
14140
14146
  }
14141
14147
  return s.invert = function(a, u) {
14142
14148
  var l = Et(u), c = Et(a) * l, f = It(a) * l, h = It(u), p = h * i - f * o;
14143
14149
  return [
14144
14150
  Qn(f * i + h * o, c * e + p * r),
14145
- In(p * e - c * r)
14151
+ Jn(p * e - c * r)
14146
14152
  ];
14147
14153
  }, s;
14148
14154
  }
14149
- function Zu(n, t, e, r, i, o) {
14155
+ function Ju(n, t, e, r, i, o) {
14150
14156
  if (e) {
14151
14157
  var s = Et(t), a = It(t), u = r * e;
14152
14158
  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));
@@ -14155,7 +14161,7 @@ function Zu(n, t, e, r, i, o) {
14155
14161
  }
14156
14162
  }
14157
14163
  function Os(n, t) {
14158
- t = Jn(t), t[0] -= n, Fo(t);
14164
+ t = Zn(t), t[0] -= n, Fo(t);
14159
14165
  var e = Sa(-t[1]);
14160
14166
  return ((-t[2] < 0 ? -e : e) + Lr - at) % Lr;
14161
14167
  }
@@ -14178,7 +14184,7 @@ function wa() {
14178
14184
  }
14179
14185
  };
14180
14186
  }
14181
- function $u(n, t, e, r, i, o) {
14187
+ function Zu(n, t, e, r, i, o) {
14182
14188
  var s = n[0], a = n[1], u = t[0], l = t[1], c = 0, f = 1, h = u - s, p = l - a, g;
14183
14189
  if (g = e - s, !(!h && g > 0)) {
14184
14190
  if (g /= h, h < 0) {
@@ -14229,7 +14235,7 @@ function $u(n, t, e, r, i, o) {
14229
14235
  function Ui(n, t) {
14230
14236
  return Ut(n[0] - t[0]) < at && Ut(n[1] - t[1]) < at;
14231
14237
  }
14232
- function Vi(n, t, e, r) {
14238
+ function ki(n, t, e, r) {
14233
14239
  this.x = n, this.z = t, this.o = e, this.e = r, this.v = !1, this.n = this.p = null;
14234
14240
  }
14235
14241
  function Pa(n, t, e, r, i) {
@@ -14243,7 +14249,7 @@ function Pa(n, t, e, r, i) {
14243
14249
  i.lineEnd();
14244
14250
  return;
14245
14251
  }
14246
- o.push(I = new Vi(v, g, null, !0)), s.push(I.o = new Vi(v, null, I, !1)), o.push(I = new Vi(m, g, null, !1)), s.push(I.o = new Vi(m, null, I, !0));
14252
+ o.push(I = new ki(v, g, null, !0)), s.push(I.o = new ki(v, null, I, !1)), o.push(I = new ki(m, g, null, !1)), s.push(I.o = new ki(m, null, I, !0));
14247
14253
  }
14248
14254
  }), !!o.length) {
14249
14255
  for (s.sort(t), Ds(o), Ds(s), a = 0, u = s.length; a < u; ++a)
@@ -14285,8 +14291,8 @@ function Ds(n) {
14285
14291
  function ba(n, t) {
14286
14292
  return n < t ? -1 : n > t ? 1 : n >= t ? 0 : NaN;
14287
14293
  }
14288
- function tl(n) {
14289
- return n.length === 1 && (n = el(n)), {
14294
+ function $u(n) {
14295
+ return n.length === 1 && (n = tl(n)), {
14290
14296
  left: function(t, e, r, i) {
14291
14297
  for (r == null && (r = 0), i == null && (i = t.length); r < i; ) {
14292
14298
  var o = r + i >>> 1;
@@ -14303,12 +14309,12 @@ function tl(n) {
14303
14309
  }
14304
14310
  };
14305
14311
  }
14306
- function el(n) {
14312
+ function tl(n) {
14307
14313
  return function(t, e) {
14308
14314
  return ba(n(t), e);
14309
14315
  };
14310
14316
  }
14311
- tl(ba);
14317
+ $u(ba);
14312
14318
  function Ra(n) {
14313
14319
  for (var t = n.length, e, r = -1, i = 0, o, s; ++r < t; )
14314
14320
  i += n[r].length;
@@ -14317,8 +14323,8 @@ function Ra(n) {
14317
14323
  o[--i] = s[e];
14318
14324
  return o;
14319
14325
  }
14320
- var ui = 1e9, ki = -ui;
14321
- function rl(n, t, e, r) {
14326
+ var ui = 1e9, zi = -ui;
14327
+ function el(n, t, e, r) {
14322
14328
  function i(l, c) {
14323
14329
  return n <= l && l <= e && t <= c && c <= r;
14324
14330
  }
@@ -14354,8 +14360,8 @@ function rl(n, t, e, r) {
14354
14360
  }
14355
14361
  function A() {
14356
14362
  for (var X = 0, ft = 0, Gt = p.length; ft < Gt; ++ft)
14357
- for (var pe = p[ft], Te = 1, ii = pe.length, br = pe[0], un, Rr, Mi = br[0], wn = br[1]; Te < ii; ++Te)
14358
- un = Mi, Rr = wn, br = pe[Te], Mi = br[0], wn = br[1], Rr <= r ? wn > r && (Mi - un) * (r - Rr) > (wn - Rr) * (n - un) && ++X : wn <= r && (Mi - un) * (r - Rr) < (wn - Rr) * (n - un) && --X;
14363
+ for (var pe = p[ft], Te = 1, ii = pe.length, br = pe[0], un, Rr, Ai = br[0], Ln = br[1]; Te < ii; ++Te)
14364
+ un = Ai, Rr = Ln, br = pe[Te], Ai = br[0], Ln = br[1], Rr <= r ? Ln > r && (Ai - un) * (r - Rr) > (Ln - Rr) * (n - un) && ++X : Ln <= r && (Ai - un) * (r - Rr) < (Ln - Rr) * (n - un) && --X;
14359
14365
  return X;
14360
14366
  }
14361
14367
  function et() {
@@ -14378,8 +14384,8 @@ function rl(n, t, e, r) {
14378
14384
  else if (Gt && S)
14379
14385
  c.point(X, ft);
14380
14386
  else {
14381
- var pe = [I = Math.max(ki, Math.min(ui, I)), C = Math.max(ki, Math.min(ui, C))], Te = [X = Math.max(ki, Math.min(ui, X)), ft = Math.max(ki, Math.min(ui, ft))];
14382
- $u(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);
14387
+ 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);
14383
14389
  }
14384
14390
  I = X, C = ft, S = Gt;
14385
14391
  }
@@ -14387,7 +14393,7 @@ function rl(n, t, e, r) {
14387
14393
  };
14388
14394
  }
14389
14395
  var Co = an();
14390
- function nl(n, t) {
14396
+ function rl(n, t) {
14391
14397
  var e = t[0], r = t[1], i = [It(e), -Et(e), 0], o = 0, s = 0;
14392
14398
  Co.reset();
14393
14399
  for (var a = 0, u = n.length; a < u; ++a)
@@ -14395,11 +14401,11 @@ function nl(n, t) {
14395
14401
  for (var l, c, f = l[c - 1], h = f[0], p = f[1] / 2 + xs, g = It(p), E = Et(p), v = 0; v < c; ++v, h = I, g = S, E = b, f = m) {
14396
14402
  var m = l[v], I = m[0], C = m[1] / 2 + xs, S = It(C), b = Et(C), P = I - h, D = P >= 0 ? 1 : -1, G = D * P, A = G > Z, et = g * S;
14397
14403
  if (Co.add(Qn(et * D * It(G), E * b + et * Et(G))), o += A ? P + D * Lr : P, A ^ h >= e ^ I >= e) {
14398
- var K = to(Jn(f), Jn(m));
14404
+ var K = to(Zn(f), Zn(m));
14399
14405
  Fo(K);
14400
14406
  var nt = to(i, K);
14401
14407
  Fo(nt);
14402
- var ct = (A ^ P >= 0 ? -1 : 1) * In(nt[2]);
14408
+ var ct = (A ^ P >= 0 ? -1 : 1) * Jn(nt[2]);
14403
14409
  (r > ct || r === ct && (K[0] || K[1])) && (s += A ^ P >= 0 ? 1 : -1);
14404
14410
  }
14405
14411
  }
@@ -14411,19 +14417,19 @@ function Ts(n) {
14411
14417
  }
14412
14418
  an();
14413
14419
  an();
14414
- var Zn = 1 / 0, eo = Zn, Li = -Zn, ro = Li, Ms = {
14415
- point: il,
14420
+ var $n = 1 / 0, eo = $n, Li = -$n, ro = Li, Ms = {
14421
+ point: nl,
14416
14422
  lineStart: ai,
14417
14423
  lineEnd: ai,
14418
14424
  polygonStart: ai,
14419
14425
  polygonEnd: ai,
14420
14426
  result: function() {
14421
- var n = [[Zn, eo], [Li, ro]];
14422
- return Li = ro = -(eo = Zn = 1 / 0), n;
14427
+ var n = [[$n, eo], [Li, ro]];
14428
+ return Li = ro = -(eo = $n = 1 / 0), n;
14423
14429
  }
14424
14430
  };
14425
- function il(n, t) {
14426
- n < Zn && (Zn = n), n > Li && (Li = n), t < eo && (eo = t), t > ro && (ro = t);
14431
+ function nl(n, t) {
14432
+ n < $n && ($n = n), n > Li && (Li = n), t < eo && (eo = t), t > ro && (ro = t);
14427
14433
  }
14428
14434
  an();
14429
14435
  function Oa(n, t, e, r) {
@@ -14437,8 +14443,8 @@ function Oa(n, t, e, r) {
14437
14443
  },
14438
14444
  polygonEnd: function() {
14439
14445
  g.point = E, g.lineStart = m, g.lineEnd = I, h = Ra(h);
14440
- var P = nl(f, a);
14441
- h.length ? (c || (o.polygonStart(), c = !0), Pa(h, sl, 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;
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;
14442
14448
  },
14443
14449
  sphere: function() {
14444
14450
  o.polygonStart(), o.lineStart(), e(null, null, 1, o), o.lineEnd(), o.polygonEnd();
@@ -14478,27 +14484,27 @@ function Oa(n, t, e, r) {
14478
14484
  }
14479
14485
  return;
14480
14486
  }
14481
- A > 1 && P & 2 && D.push(D.pop().concat(D.shift())), h.push(D.filter(ol));
14487
+ A > 1 && P & 2 && D.push(D.pop().concat(D.shift())), h.push(D.filter(il));
14482
14488
  }
14483
14489
  }
14484
14490
  return g;
14485
14491
  };
14486
14492
  }
14487
- function ol(n) {
14493
+ function il(n) {
14488
14494
  return n.length > 1;
14489
14495
  }
14490
- function sl(n, t) {
14496
+ function ol(n, t) {
14491
14497
  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]);
14492
14498
  }
14493
14499
  const As = Oa(
14494
14500
  function() {
14495
14501
  return !0;
14496
14502
  },
14497
- al,
14498
- ll,
14503
+ sl,
14504
+ ul,
14499
14505
  [-Z, -_r]
14500
14506
  );
14501
- function al(n) {
14507
+ function sl(n) {
14502
14508
  var t = NaN, e = NaN, r = NaN, i;
14503
14509
  return {
14504
14510
  lineStart: function() {
@@ -14506,7 +14512,7 @@ function al(n) {
14506
14512
  },
14507
14513
  point: function(o, s) {
14508
14514
  var a = o > 0 ? Z : -Z, u = Ut(o - t);
14509
- 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 = ul(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
+ 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;
14510
14516
  },
14511
14517
  lineEnd: function() {
14512
14518
  n.lineEnd(), t = e = NaN;
@@ -14516,11 +14522,11 @@ function al(n) {
14516
14522
  }
14517
14523
  };
14518
14524
  }
14519
- function ul(n, t, e, r) {
14525
+ function al(n, t, e, r) {
14520
14526
  var i, o, s = It(n - e);
14521
- return Ut(s) > at ? Ku((It(t) * (o = Et(r)) * It(e) - It(r) * (i = Et(t)) * It(n)) / (i * o * s)) : (t + r) / 2;
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;
14522
14528
  }
14523
- function ll(n, t, e, r) {
14529
+ function ul(n, t, e, r) {
14524
14530
  var i;
14525
14531
  if (n == null)
14526
14532
  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);
@@ -14530,10 +14536,10 @@ function ll(n, t, e, r) {
14530
14536
  } else
14531
14537
  r.point(t[0], t[1]);
14532
14538
  }
14533
- function cl(n, t) {
14539
+ function ll(n, t) {
14534
14540
  var e = Et(n), r = e > 0, i = Ut(e) > at;
14535
14541
  function o(c, f, h, p) {
14536
- Zu(p, n, t, h, c, f);
14542
+ Ju(p, n, t, h, c, f);
14537
14543
  }
14538
14544
  function s(c, f) {
14539
14545
  return Et(c) * Et(f) > e;
@@ -14565,21 +14571,21 @@ function cl(n, t) {
14565
14571
  };
14566
14572
  }
14567
14573
  function u(c, f, h) {
14568
- var p = Jn(c), g = Jn(f), E = [1, 0, 0], v = to(p, g), m = Bi(v, v), I = v[0], C = m - I * I;
14574
+ var p = Zn(c), g = Zn(f), E = [1, 0, 0], v = to(p, g), m = Gi(v, v), I = v[0], C = m - I * I;
14569
14575
  if (!C)
14570
14576
  return !h && c;
14571
- var S = e * m / C, b = -e * I / C, P = to(E, v), D = Gi(E, S), G = Gi(v, b);
14577
+ var S = e * m / C, b = -e * I / C, P = to(E, v), D = Vi(E, S), G = Vi(v, b);
14572
14578
  Io(D, G);
14573
- var A = P, et = Bi(D, A), K = Bi(A, A), nt = et * et - K * (Bi(D, D) - 1);
14579
+ var A = P, et = Gi(D, A), K = Gi(A, A), nt = et * et - K * (Gi(D, D) - 1);
14574
14580
  if (!(nt < 0)) {
14575
- var ct = ni(nt), w = Gi(A, (-et - ct) / K);
14581
+ var ct = Mi(nt), w = Vi(A, (-et - ct) / K);
14576
14582
  if (Io(w, D), w = Ao(w), !h)
14577
14583
  return w;
14578
14584
  var X = c[0], ft = f[0], Gt = c[1], pe = f[1], Te;
14579
14585
  ft < X && (Te = X, X = ft, ft = Te);
14580
14586
  var ii = ft - X, br = Ut(ii - Z) < at, un = br || ii < at;
14581
14587
  if (!br && pe < Gt && (Te = Gt, Gt = pe, pe = Te), un ? br ? Gt + pe > 0 ^ w[1] < (Ut(w[0] - X) < at ? Gt : pe) : Gt <= w[1] && w[1] <= pe : ii > Z ^ (X <= w[0] && w[0] <= ft)) {
14582
- var Rr = Gi(A, (-et + ct) / K);
14588
+ var Rr = Vi(A, (-et + ct) / K);
14583
14589
  return Io(Rr, D), [w, Ao(Rr)];
14584
14590
  }
14585
14591
  }
@@ -14623,30 +14629,30 @@ Go.prototype = {
14623
14629
  };
14624
14630
  function Ta(n, t, e) {
14625
14631
  var r = t[1][0] - t[0][0], i = t[1][1] - t[0][1], o = n.clipExtent && n.clipExtent();
14626
- n.scale(150).translate([0, 0]), o != null && n.clipExtent(null), Qu(e, n.stream(Ms));
14632
+ n.scale(150).translate([0, 0]), o != null && n.clipExtent(null), Ku(e, n.stream(Ms));
14627
14633
  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;
14628
14634
  return o != null && n.clipExtent(o), n.scale(a * 150).translate([u, l]);
14629
14635
  }
14630
- function fl(n, t, e) {
14636
+ function cl(n, t, e) {
14631
14637
  return Ta(n, [[0, 0], t], e);
14632
14638
  }
14633
- var Fs = 16, hl = Et(30 * Ae);
14639
+ var Fs = 16, fl = Et(30 * Ae);
14634
14640
  function Bs(n, t) {
14635
- return +t ? gl(n, t) : pl(n);
14641
+ return +t ? pl(n, t) : hl(n);
14636
14642
  }
14637
- function pl(n) {
14643
+ function hl(n) {
14638
14644
  return Da({
14639
14645
  point: function(t, e) {
14640
14646
  t = n(t, e), this.stream.point(t[0], t[1]);
14641
14647
  }
14642
14648
  });
14643
14649
  }
14644
- function gl(n, t) {
14650
+ function pl(n, t) {
14645
14651
  function e(r, i, o, s, a, u, l, c, f, h, p, g, E, v) {
14646
14652
  var m = l - r, I = c - i, C = m * m + I * I;
14647
14653
  if (C > 4 * t && E--) {
14648
- var S = s + h, b = a + p, P = u + g, D = ni(S * S + b * b + P * P), G = In(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;
14649
- (X * X / C > t || Ut((m * ct + I * w) / C - 0.5) > 0.3 || s * h + a * p + u * g < hl) && (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));
14654
+ 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));
14650
14656
  }
14651
14657
  }
14652
14658
  return function(r) {
@@ -14668,7 +14674,7 @@ function gl(n, t) {
14668
14674
  f = NaN, v.point = C, r.lineStart();
14669
14675
  }
14670
14676
  function C(G, A) {
14671
- var et = Jn([G, A]), K = n(G, A);
14677
+ var et = Zn([G, A]), K = n(G, A);
14672
14678
  e(f, h, c, p, g, E, f = K[0], h = K[1], c = G, p = et[0], g = et[1], E = et[2], Fs, r), r.point(f, h);
14673
14679
  }
14674
14680
  function S() {
@@ -14686,17 +14692,17 @@ function gl(n, t) {
14686
14692
  return v;
14687
14693
  };
14688
14694
  }
14689
- var dl = Da({
14695
+ var gl = Da({
14690
14696
  point: function(n, t) {
14691
14697
  this.stream.point(n * Ae, t * Ae);
14692
14698
  }
14693
14699
  });
14694
- function vl(n) {
14695
- return yl(function() {
14700
+ function dl(n) {
14701
+ return vl(function() {
14696
14702
  return n;
14697
14703
  })();
14698
14704
  }
14699
- function yl(n) {
14705
+ function vl(n) {
14700
14706
  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;
14701
14707
  function A(w) {
14702
14708
  return w = p(w[0] * Ae, w[1] * Ae), [w[0] * e + o, s - w[1] * e];
@@ -14708,11 +14714,11 @@ function yl(n) {
14708
14714
  return w = t(w, X), [w[0] * e + o, s - w[1] * e];
14709
14715
  }
14710
14716
  A.stream = function(w) {
14711
- return D && G === w ? D : D = dl(E(h, P(S(G = w))));
14717
+ return D && G === w ? D : D = gl(E(h, P(S(G = w))));
14712
14718
  }, A.clipAngle = function(w) {
14713
- return arguments.length ? (E = +w ? cl(g = w * Ae, 6 * Ae) : (g = null, As), ct()) : g * Xr;
14719
+ return arguments.length ? (E = +w ? ll(g = w * Ae, 6 * Ae) : (g = null, As), ct()) : g * Xr;
14714
14720
  }, A.clipExtent = function(w) {
14715
- return arguments.length ? (S = w == null ? (v = m = I = C = null, Ts) : rl(v = +w[0][0], m = +w[0][1], I = +w[1][0], C = +w[1][1]), ct()) : v == null ? null : [[v, m], [I, C]];
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]];
14716
14722
  }, A.scale = function(w) {
14717
14723
  return arguments.length ? (e = +w, nt()) : e;
14718
14724
  }, A.translate = function(w) {
@@ -14722,14 +14728,14 @@ function yl(n) {
14722
14728
  }, A.rotate = function(w) {
14723
14729
  return arguments.length ? (l = w[0] % 360 * Ae, c = w[1] % 360 * Ae, f = w.length > 2 ? w[2] % 360 * Ae : 0, nt()) : [l * Xr, c * Xr, f * Xr];
14724
14730
  }, A.precision = function(w) {
14725
- return arguments.length ? (P = Bs(K, b = w * w), ct()) : ni(b);
14731
+ return arguments.length ? (P = Bs(K, b = w * w), ct()) : Mi(b);
14726
14732
  }, A.fitExtent = function(w, X) {
14727
14733
  return Ta(A, w, X);
14728
14734
  }, A.fitSize = function(w, X) {
14729
- return fl(A, w, X);
14735
+ return cl(A, w, X);
14730
14736
  };
14731
14737
  function nt() {
14732
- p = La(h = Ju(l, c, f), t);
14738
+ p = La(h = Qu(l, c, f), t);
14733
14739
  var w = t(a, u);
14734
14740
  return o = r - w[0] * e, s = i + w[1] * e, ct();
14735
14741
  }
@@ -14740,7 +14746,7 @@ function yl(n) {
14740
14746
  return t = n.apply(this, arguments), A.invert = t.invert && et, nt();
14741
14747
  };
14742
14748
  }
14743
- function Ma(n) {
14749
+ function yl(n) {
14744
14750
  return function(t, e) {
14745
14751
  var r = Et(t), i = Et(e), o = n(r * i);
14746
14752
  return [
@@ -14749,29 +14755,23 @@ function Ma(n) {
14749
14755
  ];
14750
14756
  };
14751
14757
  }
14752
- function Aa(n) {
14758
+ function ml(n) {
14753
14759
  return function(t, e) {
14754
- var r = ni(t * t + e * e), i = n(r), o = It(i), s = Et(i);
14760
+ var r = Mi(t * t + e * e), i = n(r), o = It(i), s = Et(i);
14755
14761
  return [
14756
14762
  Qn(t * o, r * s),
14757
- In(r && e * o / r)
14763
+ Jn(r && e * o / r)
14758
14764
  ];
14759
14765
  };
14760
14766
  }
14761
- var ml = Ma(function(n) {
14762
- return ni(2 / (1 + n));
14763
- });
14764
- ml.invert = Aa(function(n) {
14765
- return 2 * In(n / 2);
14766
- });
14767
- var Fa = Ma(function(n) {
14767
+ var Ma = yl(function(n) {
14768
14768
  return (n = Sa(n)) && n / It(n);
14769
14769
  });
14770
- Fa.invert = Aa(function(n) {
14770
+ Ma.invert = ml(function(n) {
14771
14771
  return n;
14772
14772
  });
14773
14773
  function _l() {
14774
- return vl(Fa).scale(79.4188).clipAngle(180 - 1e-3);
14774
+ return dl(Ma).scale(79.4188).clipAngle(180 - 1e-3);
14775
14775
  }
14776
14776
  function Gs(n, t) {
14777
14777
  return [n, t];
@@ -14818,31 +14818,31 @@ function qi(n, t, e, r) {
14818
14818
  }
14819
14819
  var a = Il(o), u = {
14820
14820
  type: o.type,
14821
- coordinates: Ga(o.coordinates, a)
14822
- }, l = new jo(), c = l.read(u), f = wu(Pu(t, e), "meters"), h = Pt.bufferOp(c, f, r), p = new aa();
14823
- if (h = p.write(h), !Ba(h.coordinates)) {
14821
+ 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();
14823
+ if (h = p.write(h), !Aa(h.coordinates)) {
14824
14824
  var g = {
14825
14825
  type: h.type,
14826
- coordinates: Va(h.coordinates, a)
14826
+ coordinates: Ba(h.coordinates, a)
14827
14827
  };
14828
14828
  return io(g, i);
14829
14829
  }
14830
14830
  }
14831
- function Ba(n) {
14832
- return Array.isArray(n[0]) ? Ba(n[0]) : isNaN(n[0]);
14831
+ function Aa(n) {
14832
+ return Array.isArray(n[0]) ? Aa(n[0]) : isNaN(n[0]);
14833
14833
  }
14834
- function Ga(n, t) {
14834
+ function Fa(n, t) {
14835
14835
  return typeof n[0] != "object" ? t(n) : n.map(function(e) {
14836
- return Ga(e, t);
14836
+ return Fa(e, t);
14837
14837
  });
14838
14838
  }
14839
- function Va(n, t) {
14839
+ function Ba(n, t) {
14840
14840
  return typeof n[0] != "object" ? t.invert(n) : n.map(function(e) {
14841
- return Va(e, t);
14841
+ return Ba(e, t);
14842
14842
  });
14843
14843
  }
14844
14844
  function Il(n) {
14845
- var t = Ou(n).geometry.coordinates, e = [-t[0], -t[1]];
14845
+ var t = Ru(n).geometry.coordinates, e = [-t[0], -t[1]];
14846
14846
  return _l().rotate(e).scale(ie);
14847
14847
  }
14848
14848
  function Vs(n) {
@@ -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 = Ru(
14854
+ const e = bu(
14855
14855
  {
14856
14856
  type: "Polygon",
14857
14857
  coordinates: [
@@ -14894,7 +14894,7 @@ function Cl(n, t = !0, e = !0, r = {}, i = {}, o = (s) => {
14894
14894
  lineCap: "butt"
14895
14895
  };
14896
14896
  }) {
14897
- let s, a, u = [], l, c, f = Pn.geoJSON(void 0, {
14897
+ let s, a, u = [], l, c, f = wn.geoJSON(void 0, {
14898
14898
  style: o,
14899
14899
  interactive: !1
14900
14900
  }).addTo(n);
@@ -14910,9 +14910,9 @@ 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 nu({ props: { displayIn: "leaflet" }, target: I }), new Pn.Marker(v, {
14913
+ return new ru({ props: { displayIn: "leaflet" }, target: I }), new wn.Marker(v, {
14914
14914
  interactive: m,
14915
- icon: new Pn.DivIcon({
14915
+ icon: new wn.DivIcon({
14916
14916
  html: I,
14917
14917
  className: "",
14918
14918
  iconAnchor: [12, 26],
@@ -14945,7 +14945,7 @@ function Cl(n, t = !0, e = !0, r = {}, i = {}, o = (s) => {
14945
14945
  if (!t)
14946
14946
  return;
14947
14947
  const m = v && [v[1], v[0]];
14948
- c ? m ? c.setLatLng(m) : (c.remove(), c = void 0) : m && (c = (typeof t == "object" ? new Pn.Marker(m, t) : g(m)).addTo(n), (I = c.getElement()) == null || I.classList.add("marker-reverse"));
14948
+ c ? m ? c.setLatLng(m) : (c.remove(), c = void 0) : m && (c = (typeof t == "object" ? new wn.Marker(m, t) : g(m)).addTo(n), (I = c.getElement()) == null || I.classList.add("marker-reverse"));
14949
14949
  },
14950
14950
  setMarkers(v, m) {
14951
14951
  if (!t)
@@ -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 = bu(P, D);
14967
+ P = Pu(P, D);
14968
14968
  ks({ ...m, geometry: P }, I), C = !0;
14969
14969
  } else {
14970
14970
  const P = m.geometry.geometries.filter(
@@ -14986,7 +14986,7 @@ function Cl(n, t = !0, e = !0, r = {}, i = {}, o = (s) => {
14986
14986
  }
14987
14987
  const S = [m.center[1], m.center[0]];
14988
14988
  u.push(
14989
- (typeof t == "object" ? new Pn.Marker(S, t) : g(S)).addTo(n)
14989
+ (typeof t == "object" ? new wn.Marker(S, t) : g(S)).addTo(n)
14990
14990
  );
14991
14991
  }
14992
14992
  if (e)
@@ -14996,7 +14996,7 @@ function Cl(n, t = !0, e = !0, r = {}, i = {}, o = (s) => {
14996
14996
  const S = [
14997
14997
  C.center[1],
14998
14998
  C.center[0]
14999
- ], b = typeof e == "object" ? new Pn.Marker(S, e) : g(S, !0);
14999
+ ], b = typeof e == "object" ? new wn.Marker(S, e) : g(S, !0);
15000
15000
  b.addTo(n).bindTooltip(C.place_name.replace(/,.*/, ""), {
15001
15001
  direction: "top"
15002
15002
  });