@maptiler/geocoding-control 0.0.75 → 0.0.77

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