@maptiler/geocoding-control 0.0.52 → 0.0.54

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.
package/dist/leaflet.js CHANGED
@@ -673,15 +673,15 @@ function Fl(r, t, e) {
673
673
  return r === n && e ? r : ((r - i) % o + o) % o + i;
674
674
  }
675
675
  function Bl(r, t, e) {
676
- let n, { $$slots: i = {}, $$scope: o } = t, { class: s = void 0 } = t, { mapController: a = void 0 } = t, { apiKey: u } = t, { debounceSearch: l = 200 } = t, { placeholder: c = "Search" } = t, { errorMessage: f = "Searching failed" } = t, { noResultsMessage: h = "No results found" } = t, { proximity: g = void 0 } = t, { bbox: p = void 0 } = t, { trackProximity: m = !0 } = t, { minLength: d = 2 } = t, { language: y = void 0 } = t, { showResultsWhileTyping: I = !0 } = t, { zoom: C = 16 } = t, { flyTo: x = !0 } = t, { collapsed: b = !1 } = t, { clearOnBlur: w = !1 } = t, { enableReverse: D = !1 } = t, { reverseButtonTitle: T = "toggle reverse geocoding" } = t, { clearButtonTitle: F = "clear" } = t, { filter: j = () => !0 } = t, { searchValue: k = "" } = t, { reverseActive: O = D === "always" } = t, { showPlaceType: Y = !1 } = t, { showFullGeometry: P = !0 } = t, { limit: X = void 0 } = t, { fuzzyMatch: ut = !0 } = t, { country: yt = void 0 } = t, { types: qt = void 0 } = t;
676
+ let n, { $$slots: i = {}, $$scope: o } = t, { class: s = void 0 } = t, { mapController: a = void 0 } = t, { apiKey: u } = t, { debounceSearch: l = 200 } = t, { placeholder: c = "Search" } = t, { errorMessage: f = "Searching failed" } = t, { noResultsMessage: h = "No results found" } = t, { proximity: g = void 0 } = t, { bbox: p = void 0 } = t, { trackProximity: m = !0 } = t, { minLength: d = 2 } = t, { language: y = void 0 } = t, { showResultsWhileTyping: I = !0 } = t, { zoom: C = 16 } = t, { flyTo: x = !0 } = t, { collapsed: b = !1 } = t, { clearOnBlur: w = !1 } = t, { enableReverse: D = !1 } = t, { reverseButtonTitle: T = "toggle reverse geocoding" } = t, { clearButtonTitle: F = "clear" } = t, { filter: j = () => !0 } = t, { searchValue: k = "" } = t, { reverseActive: O = D === "always" } = t, { showPlaceType: Y = !1 } = t, { showFullGeometry: P = !0 } = t, { limit: X = void 0 } = t, { fuzzyMatch: ut = !0 } = t, { country: yt = void 0 } = t, { types: Xt = void 0 } = t;
677
677
  function we() {
678
678
  An.focus();
679
679
  }
680
680
  function Ar() {
681
681
  An.blur();
682
682
  }
683
- function Ze(N, Xt = !0) {
684
- e(0, k = N), Xt ? (e(13, At = -1), Js()) : (as(), setTimeout(() => {
683
+ function Ze(N, Ft = !0) {
684
+ e(0, k = N), Ft ? (e(13, At = -1), Js()) : (as(), setTimeout(() => {
685
685
  An.focus(), An.select();
686
686
  }));
687
687
  }
@@ -694,22 +694,22 @@ function Bl(r, t, e) {
694
694
  if (si && (clearTimeout(si), si = void 0), At > -1 && J)
695
695
  e(44, it = J[At]), e(0, k = it.place_name.replace(/,.*/, "")), e(16, gr = void 0), e(43, Mt = void 0), e(13, At = -1);
696
696
  else if (k) {
697
- const Xt = N || !Zs();
697
+ const Ft = N || !Zs();
698
698
  ss(k, { exact: !0 }).then(() => {
699
- e(43, Mt = J), e(44, it = void 0), Xt && Xu();
699
+ e(43, Mt = J), e(44, it = void 0), Ft && Xu();
700
700
  }).catch((Fn) => e(16, gr = Fn));
701
701
  }
702
702
  }
703
703
  function Zs() {
704
704
  return /^-?\d+(\.\d+)?,-?\d+(\.\d+)?$/.test(k);
705
705
  }
706
- async function ss(N, { byId: Xt = !1, exact: Fn = !1 } = {}) {
706
+ async function ss(N, { byId: Ft = !1, exact: Fn = !1 } = {}) {
707
707
  e(16, gr = void 0);
708
708
  const Vi = Zs(), Ge = new URLSearchParams();
709
- y && Ge.set("language", Array.isArray(y) ? y.join(",") : y), yt && Ge.set("country", Array.isArray(yt) ? yt.join(",") : yt), qt && Ge.set("types", qt.join(",")), Vi || (p && Ge.set("bbox", p.map((Gr) => Gr.toFixed(6)).join(",")), g && Ge.set("proximity", g.map((Gr) => Gr.toFixed(6)).join(",")), (Fn || !I) && Ge.set("autocomplete", "false"), Ge.set("fuzzyMatch", String(ut))), X !== void 0 && Ge.set("limit", String(X)), Ge.set("key", u);
709
+ y && Ge.set("language", Array.isArray(y) ? y.join(",") : y), yt && Ge.set("country", Array.isArray(yt) ? yt.join(",") : yt), Xt && Ge.set("types", Xt.join(",")), Vi || (p && Ge.set("bbox", p.map((Gr) => Gr.toFixed(6)).join(",")), Ft || (g && Ge.set("proximity", g.map((Gr) => Gr.toFixed(6)).join(",")), (Fn || !I) && Ge.set("autocomplete", "false"), Ge.set("fuzzyMatch", String(ut)))), X !== void 0 && Ge.set("limit", String(X)), Ge.set("key", u);
710
710
  const Br = "https://api.maptiler.com/geocoding/" + encodeURIComponent(N) + ".json?" + Ge.toString();
711
711
  if (Br === Qs) {
712
- Xt ? (e(12, J = void 0), e(44, it = Eo[0])) : e(12, J = Eo);
712
+ Ft ? (e(12, J = void 0), e(44, it = Eo[0])) : e(12, J = Eo);
713
713
  return;
714
714
  }
715
715
  Qs = Br, Fr == null || Fr.abort(), e(17, Fr = new AbortController());
@@ -726,15 +726,15 @@ function Bl(r, t, e) {
726
726
  if (!ve.ok)
727
727
  throw new Error();
728
728
  const ls = await ve.json();
729
- pr("response", { url: Br, featureCollection: ls }), Xt ? (e(12, J = void 0), e(44, it = ls.features[0]), Eo = [it]) : (e(12, J = ls.features.filter(j)), Eo = J, Vi && An.focus());
729
+ pr("response", { url: Br, featureCollection: ls }), Ft ? (e(12, J = void 0), e(44, it = ls.features[0]), Eo = [it]) : (e(12, J = ls.features.filter(j)), Eo = J, Vi && An.focus());
730
730
  }
731
731
  function Xu() {
732
732
  var Fn, Vi, Ge, Br;
733
733
  if (!(Mt != null && Mt.length) || !x)
734
734
  return;
735
- const N = [180, 90, -180, -90], Xt = !Mt.some((ve) => !ve.matching_text);
735
+ const N = [180, 90, -180, -90], Ft = !Mt.some((ve) => !ve.matching_text);
736
736
  for (const ve of Mt)
737
- (Xt || !ve.matching_text) && (N[0] = Math.min(N[0], ((Fn = ve.bbox) == null ? void 0 : Fn[0]) ?? ve.center[0]), N[1] = Math.min(N[1], ((Vi = ve.bbox) == null ? void 0 : Vi[1]) ?? ve.center[1]), N[2] = Math.max(N[2], ((Ge = ve.bbox) == null ? void 0 : Ge[2]) ?? ve.center[0]), N[3] = Math.max(N[3], ((Br = ve.bbox) == null ? void 0 : Br[3]) ?? ve.center[1]));
737
+ (Ft || !ve.matching_text) && (N[0] = Math.min(N[0], ((Fn = ve.bbox) == null ? void 0 : Fn[0]) ?? ve.center[0]), N[1] = Math.min(N[1], ((Vi = ve.bbox) == null ? void 0 : Vi[1]) ?? ve.center[1]), N[2] = Math.max(N[2], ((Ge = ve.bbox) == null ? void 0 : Ge[2]) ?? ve.center[0]), N[3] = Math.max(N[3], ((Br = ve.bbox) == null ? void 0 : Br[3]) ?? ve.center[1]));
738
738
  a && Mt.length > 0 && (it && N[0] === N[2] && N[1] === N[3] ? a.flyTo(it.center, C) : a.fitBounds(N, 50));
739
739
  }
740
740
  function Yu(N) {
@@ -743,16 +743,16 @@ function Bl(r, t, e) {
743
743
  function Hu(N) {
744
744
  if (!J)
745
745
  return;
746
- let Xt = N.key === "ArrowDown" ? 1 : N.key === "ArrowUp" ? -1 : 0;
747
- Xt ? (At === -1 && Xt === -1 && e(13, At = J.length), e(13, At += Xt), At >= J.length && e(13, At = -1), N.preventDefault()) : ["ArrowLeft", "ArrowRight", "Home", "End"].includes(N.key) && e(13, At = -1);
746
+ let Ft = N.key === "ArrowDown" ? 1 : N.key === "ArrowUp" ? -1 : 0;
747
+ Ft ? (At === -1 && Ft === -1 && e(13, At = J.length), e(13, At += Ft), At >= J.length && e(13, At = -1), N.preventDefault()) : ["ArrowLeft", "ArrowRight", "Home", "End"].includes(N.key) && e(13, At = -1);
748
748
  }
749
749
  function as(N = !0) {
750
750
  if (I && k.length > d) {
751
751
  si && clearTimeout(si);
752
- const Xt = k;
752
+ const Ft = k;
753
753
  si = window.setTimeout(
754
754
  () => {
755
- ss(Xt).catch((Fn) => e(16, gr = Fn));
755
+ ss(Ft).catch((Fn) => e(16, gr = Fn));
756
756
  },
757
757
  N ? l : 0
758
758
  );
@@ -760,7 +760,7 @@ function Bl(r, t, e) {
760
760
  e(12, J = void 0), e(16, gr = void 0);
761
761
  }
762
762
  function us(N) {
763
- console.log(N), e(44, it = N), e(0, k = N.place_name), e(13, At = -1);
763
+ e(44, it = N), e(0, k = N.place_name), e(13, At = -1);
764
764
  }
765
765
  const Wu = () => An.focus();
766
766
  function ju(N) {
@@ -776,7 +776,7 @@ function Bl(r, t, e) {
776
776
  }, tl = () => e(1, O = !O), el = (N) => e(13, At = N), nl = (N) => us(N), rl = () => e(13, At = -1), il = () => {
777
777
  };
778
778
  return r.$$set = (N) => {
779
- "class" in N && e(2, s = N.class), "mapController" in N && e(23, a = N.mapController), "apiKey" in N && e(24, u = N.apiKey), "debounceSearch" in N && e(25, l = N.debounceSearch), "placeholder" in N && e(3, c = N.placeholder), "errorMessage" in N && e(4, f = N.errorMessage), "noResultsMessage" in N && e(5, h = N.noResultsMessage), "proximity" in N && e(22, g = N.proximity), "bbox" in N && e(26, p = N.bbox), "trackProximity" in N && e(27, m = N.trackProximity), "minLength" in N && e(28, d = N.minLength), "language" in N && e(29, y = N.language), "showResultsWhileTyping" in N && e(30, I = N.showResultsWhileTyping), "zoom" in N && e(31, C = N.zoom), "flyTo" in N && e(32, x = N.flyTo), "collapsed" in N && e(6, b = N.collapsed), "clearOnBlur" in N && e(33, w = N.clearOnBlur), "enableReverse" in N && e(7, D = N.enableReverse), "reverseButtonTitle" in N && e(8, T = N.reverseButtonTitle), "clearButtonTitle" in N && e(9, F = N.clearButtonTitle), "filter" in N && e(34, j = N.filter), "searchValue" in N && e(0, k = N.searchValue), "reverseActive" in N && e(1, O = N.reverseActive), "showPlaceType" in N && e(10, Y = N.showPlaceType), "showFullGeometry" in N && e(35, P = N.showFullGeometry), "limit" in N && e(36, X = N.limit), "fuzzyMatch" in N && e(37, ut = N.fuzzyMatch), "country" in N && e(38, yt = N.country), "types" in N && e(39, qt = N.types), "$$scope" in N && e(46, o = N.$$scope);
779
+ "class" in N && e(2, s = N.class), "mapController" in N && e(23, a = N.mapController), "apiKey" in N && e(24, u = N.apiKey), "debounceSearch" in N && e(25, l = N.debounceSearch), "placeholder" in N && e(3, c = N.placeholder), "errorMessage" in N && e(4, f = N.errorMessage), "noResultsMessage" in N && e(5, h = N.noResultsMessage), "proximity" in N && e(22, g = N.proximity), "bbox" in N && e(26, p = N.bbox), "trackProximity" in N && e(27, m = N.trackProximity), "minLength" in N && e(28, d = N.minLength), "language" in N && e(29, y = N.language), "showResultsWhileTyping" in N && e(30, I = N.showResultsWhileTyping), "zoom" in N && e(31, C = N.zoom), "flyTo" in N && e(32, x = N.flyTo), "collapsed" in N && e(6, b = N.collapsed), "clearOnBlur" in N && e(33, w = N.clearOnBlur), "enableReverse" in N && e(7, D = N.enableReverse), "reverseButtonTitle" in N && e(8, T = N.reverseButtonTitle), "clearButtonTitle" in N && e(9, F = N.clearButtonTitle), "filter" in N && e(34, j = N.filter), "searchValue" in N && e(0, k = N.searchValue), "reverseActive" in N && e(1, O = N.reverseActive), "showPlaceType" in N && e(10, Y = N.showPlaceType), "showFullGeometry" in N && e(35, P = N.showFullGeometry), "limit" in N && e(36, X = N.limit), "fuzzyMatch" in N && e(37, ut = N.fuzzyMatch), "country" in N && e(38, yt = N.country), "types" in N && e(39, Xt = N.types), "$$scope" in N && e(46, o = N.$$scope);
780
780
  }, r.$$.update = () => {
781
781
  if (r.$$.dirty[0] & 134217728 && (m || e(22, g = void 0)), r.$$.dirty[0] & 2048 | r.$$.dirty[1] & 4 && setTimeout(() => {
782
782
  e(14, Io = Le), w && !Le && e(0, k = "");
@@ -790,12 +790,12 @@ function Bl(r, t, e) {
790
790
  break;
791
791
  case "markerClick":
792
792
  {
793
- const Xt = J == null ? void 0 : J.find((Fn) => Fn.id === N.id);
794
- Xt && us(Xt);
793
+ const Ft = J == null ? void 0 : J.find((Fn) => Fn.id === N.id);
794
+ Ft && us(Ft);
795
795
  }
796
796
  break;
797
797
  case "markerMouseEnter":
798
- e(13, At = Io ? (J == null ? void 0 : J.findIndex((Xt) => Xt.id === N.id)) ?? -1 : -1);
798
+ e(13, At = Io ? (J == null ? void 0 : J.findIndex((Ft) => Ft.id === N.id)) ?? -1 : -1);
799
799
  break;
800
800
  case "markerMouseLeave":
801
801
  e(13, At = -1);
@@ -846,7 +846,7 @@ function Bl(r, t, e) {
846
846
  X,
847
847
  ut,
848
848
  yt,
849
- qt,
849
+ Xt,
850
850
  we,
851
851
  Ar,
852
852
  Ze,
@@ -3243,13 +3243,13 @@ var ou = function() {
3243
3243
  }, t.prototype.getClass = function() {
3244
3244
  return t;
3245
3245
  }, t;
3246
- }(ou), kt = function() {
3246
+ }(ou), zt = function() {
3247
3247
  };
3248
- kt.arraycopy = function(t, e, n, i, o) {
3248
+ zt.arraycopy = function(t, e, n, i, o) {
3249
3249
  for (var s = 0, a = e; a < e + o; a++)
3250
3250
  n[i + s] = t[a], s++;
3251
3251
  };
3252
- kt.getProperty = function(t) {
3252
+ zt.getProperty = function(t) {
3253
3253
  return {
3254
3254
  "line.separator": `
3255
3255
  `
@@ -3863,7 +3863,7 @@ var Tr = function(r) {
3863
3863
  return Math.abs(i) < u && (a = i, u = Math.abs(i)), Math.abs(o) < u && (a = o, u = Math.abs(o)), Math.abs(s) < u && (a = s), a;
3864
3864
  }, t.prototype.checkDD = function(n, i, o, s, a) {
3865
3865
  var u = ae.intersection(n, i, o, s), l = this.isInSegmentEnvelopes(u);
3866
- kt.out.println("DD in env = " + l + " --------------------- " + u), a.distance(u) > 1e-4 && kt.out.println("Distance = " + a.distance(u));
3866
+ zt.out.println("DD in env = " + l + " --------------------- " + u), a.distance(u) > 1e-4 && zt.out.println("Distance = " + a.distance(u));
3867
3867
  }, t.prototype.intersectionWithNormalization = function(n, i, o, s) {
3868
3868
  var a = new v(n), u = new v(i), l = new v(o), c = new v(s), f = new v();
3869
3869
  this.normalizeToEnvCentre(a, u, l, c, f);
@@ -4651,7 +4651,7 @@ W.scroll = function(t, e) {
4651
4651
  if (n < 0)
4652
4652
  return null;
4653
4653
  var i = new Array(t.length).fill(null);
4654
- kt.arraycopy(t, n, i, 0, t.length - n), kt.arraycopy(t, 0, i, t.length - n, n), kt.arraycopy(i, 0, t, 0, t.length);
4654
+ zt.arraycopy(t, n, i, 0, t.length - n), zt.arraycopy(t, 0, i, t.length - n, n), zt.arraycopy(i, 0, t, 0, t.length);
4655
4655
  };
4656
4656
  W.equals = function() {
4657
4657
  if (arguments.length === 2) {
@@ -5543,7 +5543,7 @@ Re.spaces = function(t) {
5543
5543
  return Re.chars(" ", t);
5544
5544
  };
5545
5545
  Bs.NEWLINE.get = function() {
5546
- return kt.getProperty("line.separator");
5546
+ return zt.getProperty("line.separator");
5547
5547
  };
5548
5548
  Bs.SIMPLE_ORDINATE_FORMAT.get = function() {
5549
5549
  return new mc();
@@ -5936,9 +5936,9 @@ var Rt = function(r) {
5936
5936
  if (s.isEmpty())
5937
5937
  return null;
5938
5938
  var u = new Array(s.getCoordinates().length - 1).fill(null);
5939
- kt.arraycopy(s.getCoordinates(), 0, u, 0, u.length);
5939
+ zt.arraycopy(s.getCoordinates(), 0, u, 0, u.length);
5940
5940
  var l = W.minCoordinate(s.getCoordinates());
5941
- W.scroll(u, l), kt.arraycopy(u, 0, s.getCoordinates(), 0, u.length), s.getCoordinates()[u.length] = u[0], R.isCCW(s.getCoordinates()) === a && W.reverse(s.getCoordinates());
5941
+ W.scroll(u, l), zt.arraycopy(u, 0, s.getCoordinates(), 0, u.length), s.getCoordinates()[u.length] = u[0], R.isCCW(s.getCoordinates()) === a && W.reverse(s.getCoordinates());
5942
5942
  }
5943
5943
  }, t.prototype.getCoordinate = function() {
5944
5944
  return this._shell.getCoordinate();
@@ -7940,7 +7940,7 @@ gt.prototype.linkResultDirectedEdges = function() {
7940
7940
  }
7941
7941
  };
7942
7942
  gt.prototype.debugPrintln = function(t) {
7943
- kt.out.println(t);
7943
+ zt.out.println(t);
7944
7944
  };
7945
7945
  gt.prototype.isBoundaryNode = function(t, e) {
7946
7946
  var n = this._nodes.find(e);
@@ -7962,7 +7962,7 @@ gt.prototype.getEdgeEnds = function() {
7962
7962
  return this._edgeEndList;
7963
7963
  };
7964
7964
  gt.prototype.debugPrint = function(t) {
7965
- kt.out.print(t);
7965
+ zt.out.print(t);
7966
7966
  };
7967
7967
  gt.prototype.getEdgeIterator = function() {
7968
7968
  return this._edges.iterator();
@@ -10313,7 +10313,7 @@ jt.prototype.getCoordinate = function() {
10313
10313
  return e.getCoordinate();
10314
10314
  };
10315
10315
  jt.prototype.print = function(t) {
10316
- kt.out.println("EdgeEndStar: " + this.getCoordinate());
10316
+ zt.out.println("EdgeEndStar: " + this.getCoordinate());
10317
10317
  for (var e = this.iterator(); e.hasNext(); ) {
10318
10318
  var n = e.next();
10319
10319
  n.print(t);
@@ -10446,7 +10446,7 @@ var wc = function(r) {
10446
10446
  var s = n.get(i - 1), a = o.getQuadrant(), u = s.getQuadrant();
10447
10447
  return rt.isNorthern(a) && rt.isNorthern(u) ? o : !rt.isNorthern(a) && !rt.isNorthern(u) ? s : o.getDy() !== 0 ? o : s.getDy() !== 0 ? s : (q.shouldNeverReachHere("found two horizontal edges incident on node"), null);
10448
10448
  }, t.prototype.print = function(n) {
10449
- kt.out.println("DirectedEdgeStar: " + this.getCoordinate());
10449
+ zt.out.println("DirectedEdgeStar: " + this.getCoordinate());
10450
10450
  for (var i = this.iterator(); i.hasNext(); ) {
10451
10451
  var o = i.next();
10452
10452
  n.print("out "), o.print(n), n.println(), n.print("in "), o.getSym().print(n), n.println();
@@ -10885,7 +10885,7 @@ Qn.prototype.interfaces_ = function() {
10885
10885
  Qn.prototype.getClass = function() {
10886
10886
  return Qn;
10887
10887
  };
10888
- var Gt = function r() {
10888
+ var kt = function r() {
10889
10889
  var t = this;
10890
10890
  this._depth = Array(2).fill().map(function() {
10891
10891
  return Array(3);
@@ -10894,29 +10894,29 @@ var Gt = function r() {
10894
10894
  for (var n = 0; n < 3; n++)
10895
10895
  t._depth[e][n] = r.NULL_VALUE;
10896
10896
  }, mu = { NULL_VALUE: { configurable: !0 } };
10897
- Gt.prototype.getDepth = function(t, e) {
10897
+ kt.prototype.getDepth = function(t, e) {
10898
10898
  return this._depth[t][e];
10899
10899
  };
10900
- Gt.prototype.setDepth = function(t, e, n) {
10900
+ kt.prototype.setDepth = function(t, e, n) {
10901
10901
  this._depth[t][e] = n;
10902
10902
  };
10903
- Gt.prototype.isNull = function() {
10903
+ kt.prototype.isNull = function() {
10904
10904
  var t = this;
10905
10905
  if (arguments.length === 0) {
10906
10906
  for (var e = 0; e < 2; e++)
10907
10907
  for (var n = 0; n < 3; n++)
10908
- if (t._depth[e][n] !== Gt.NULL_VALUE)
10908
+ if (t._depth[e][n] !== kt.NULL_VALUE)
10909
10909
  return !1;
10910
10910
  return !0;
10911
10911
  } else if (arguments.length === 1) {
10912
10912
  var i = arguments[0];
10913
- return this._depth[i][1] === Gt.NULL_VALUE;
10913
+ return this._depth[i][1] === kt.NULL_VALUE;
10914
10914
  } else if (arguments.length === 2) {
10915
10915
  var o = arguments[0], s = arguments[1];
10916
- return this._depth[o][s] === Gt.NULL_VALUE;
10916
+ return this._depth[o][s] === kt.NULL_VALUE;
10917
10917
  }
10918
10918
  };
10919
- Gt.prototype.normalize = function() {
10919
+ kt.prototype.normalize = function() {
10920
10920
  for (var t = this, e = 0; e < 2; e++)
10921
10921
  if (!t.isNull(e)) {
10922
10922
  var n = t._depth[e][1];
@@ -10927,44 +10927,44 @@ Gt.prototype.normalize = function() {
10927
10927
  }
10928
10928
  }
10929
10929
  };
10930
- Gt.prototype.getDelta = function(t) {
10930
+ kt.prototype.getDelta = function(t) {
10931
10931
  return this._depth[t][S.RIGHT] - this._depth[t][S.LEFT];
10932
10932
  };
10933
- Gt.prototype.getLocation = function(t, e) {
10933
+ kt.prototype.getLocation = function(t, e) {
10934
10934
  return this._depth[t][e] <= 0 ? _.EXTERIOR : _.INTERIOR;
10935
10935
  };
10936
- Gt.prototype.toString = function() {
10936
+ kt.prototype.toString = function() {
10937
10937
  return "A: " + this._depth[0][1] + "," + this._depth[0][2] + " B: " + this._depth[1][1] + "," + this._depth[1][2];
10938
10938
  };
10939
- Gt.prototype.add = function() {
10939
+ kt.prototype.add = function() {
10940
10940
  var t = this;
10941
10941
  if (arguments.length === 1)
10942
10942
  for (var e = arguments[0], n = 0; n < 2; n++)
10943
10943
  for (var i = 1; i < 3; i++) {
10944
10944
  var o = e.getLocation(n, i);
10945
- (o === _.EXTERIOR || o === _.INTERIOR) && (t.isNull(n, i) ? t._depth[n][i] = Gt.depthAtLocation(o) : t._depth[n][i] += Gt.depthAtLocation(o));
10945
+ (o === _.EXTERIOR || o === _.INTERIOR) && (t.isNull(n, i) ? t._depth[n][i] = kt.depthAtLocation(o) : t._depth[n][i] += kt.depthAtLocation(o));
10946
10946
  }
10947
10947
  else if (arguments.length === 3) {
10948
10948
  var s = arguments[0], a = arguments[1], u = arguments[2];
10949
10949
  u === _.INTERIOR && this._depth[s][a]++;
10950
10950
  }
10951
10951
  };
10952
- Gt.prototype.interfaces_ = function() {
10952
+ kt.prototype.interfaces_ = function() {
10953
10953
  return [];
10954
10954
  };
10955
- Gt.prototype.getClass = function() {
10956
- return Gt;
10955
+ kt.prototype.getClass = function() {
10956
+ return kt;
10957
10957
  };
10958
- Gt.depthAtLocation = function(t) {
10959
- return t === _.EXTERIOR ? 0 : t === _.INTERIOR ? 1 : Gt.NULL_VALUE;
10958
+ kt.depthAtLocation = function(t) {
10959
+ return t === _.EXTERIOR ? 0 : t === _.INTERIOR ? 1 : kt.NULL_VALUE;
10960
10960
  };
10961
10961
  mu.NULL_VALUE.get = function() {
10962
10962
  return -1;
10963
10963
  };
10964
- Object.defineProperties(Gt, mu);
10964
+ Object.defineProperties(kt, mu);
10965
10965
  var ko = function(r) {
10966
10966
  function t() {
10967
- if (r.call(this), this.pts = null, this._env = null, this.eiList = new Pn(this), this._name = null, this._mce = null, this._isIsolated = !0, this._depth = new Gt(), this._depthDelta = 0, arguments.length === 1) {
10967
+ if (r.call(this), this.pts = null, this._env = null, this.eiList = new Pn(this), this._name = null, this._mce = null, this._isIsolated = !0, this._depth = new kt(), this._depthDelta = 0, arguments.length === 1) {
10968
10968
  var e = arguments[0];
10969
10969
  t.call(this, e, null);
10970
10970
  } else if (arguments.length === 2) {
@@ -11185,7 +11185,7 @@ ur.prototype.rescale = function() {
11185
11185
  else if (arguments[0] instanceof Array) {
11186
11186
  for (var o = arguments[0], s = 0; s < o.length; s++)
11187
11187
  o[s].x = o[s].x / t._scaleFactor + t._offsetX, o[s].y = o[s].y / t._scaleFactor + t._offsetY;
11188
- o.length === 2 && o[0].equals2D(o[1]) && kt.out.println(o);
11188
+ o.length === 2 && o[0].equals2D(o[1]) && zt.out.println(o);
11189
11189
  }
11190
11190
  };
11191
11191
  ur.prototype.scale = function() {
@@ -11508,7 +11508,7 @@ Rn.prototype.interfaces_ = function() {
11508
11508
  Rn.prototype.getClass = function() {
11509
11509
  return Rn;
11510
11510
  };
11511
- var Bt = function() {
11511
+ var Gt = function() {
11512
11512
  if (this._argGeom = null, this._distance = null, this._bufParams = new $(), this._resultGeometry = null, this._saveException = null, arguments.length === 1) {
11513
11513
  var t = arguments[0];
11514
11514
  this._argGeom = t;
@@ -11517,14 +11517,14 @@ var Bt = function() {
11517
11517
  this._argGeom = e, this._bufParams = n;
11518
11518
  }
11519
11519
  }, ki = { CAP_ROUND: { configurable: !0 }, CAP_BUTT: { configurable: !0 }, CAP_FLAT: { configurable: !0 }, CAP_SQUARE: { configurable: !0 }, MAX_PRECISION_DIGITS: { configurable: !0 } };
11520
- Bt.prototype.bufferFixedPrecision = function(t) {
11520
+ Gt.prototype.bufferFixedPrecision = function(t) {
11521
11521
  var e = new ur(new Rn(new tt(1)), t.getScale()), n = new ee(this._bufParams);
11522
11522
  n.setWorkingPrecisionModel(t), n.setNoder(e), this._resultGeometry = n.buffer(this._argGeom, this._distance);
11523
11523
  };
11524
- Bt.prototype.bufferReducedPrecision = function() {
11524
+ Gt.prototype.bufferReducedPrecision = function() {
11525
11525
  var t = this;
11526
11526
  if (arguments.length === 0) {
11527
- for (var e = Bt.MAX_PRECISION_DIGITS; e >= 0; e--) {
11527
+ for (var e = Gt.MAX_PRECISION_DIGITS; e >= 0; e--) {
11528
11528
  try {
11529
11529
  t.bufferReducedPrecision(e);
11530
11530
  } catch (s) {
@@ -11539,20 +11539,20 @@ Bt.prototype.bufferReducedPrecision = function() {
11539
11539
  }
11540
11540
  throw this._saveException;
11541
11541
  } else if (arguments.length === 1) {
11542
- var n = arguments[0], i = Bt.precisionScaleFactor(this._argGeom, this._distance, n), o = new tt(i);
11542
+ var n = arguments[0], i = Gt.precisionScaleFactor(this._argGeom, this._distance, n), o = new tt(i);
11543
11543
  this.bufferFixedPrecision(o);
11544
11544
  }
11545
11545
  };
11546
- Bt.prototype.computeGeometry = function() {
11546
+ Gt.prototype.computeGeometry = function() {
11547
11547
  if (this.bufferOriginalPrecision(), this._resultGeometry !== null)
11548
11548
  return null;
11549
11549
  var t = this._argGeom.getFactory().getPrecisionModel();
11550
11550
  t.getType() === tt.FIXED ? this.bufferFixedPrecision(t) : this.bufferReducedPrecision();
11551
11551
  };
11552
- Bt.prototype.setQuadrantSegments = function(t) {
11552
+ Gt.prototype.setQuadrantSegments = function(t) {
11553
11553
  this._bufParams.setQuadrantSegments(t);
11554
11554
  };
11555
- Bt.prototype.bufferOriginalPrecision = function() {
11555
+ Gt.prototype.bufferOriginalPrecision = function() {
11556
11556
  try {
11557
11557
  var t = new ee(this._bufParams);
11558
11558
  this._resultGeometry = t.buffer(this._argGeom, this._distance);
@@ -11564,40 +11564,40 @@ Bt.prototype.bufferOriginalPrecision = function() {
11564
11564
  } finally {
11565
11565
  }
11566
11566
  };
11567
- Bt.prototype.getResultGeometry = function(t) {
11567
+ Gt.prototype.getResultGeometry = function(t) {
11568
11568
  return this._distance = t, this.computeGeometry(), this._resultGeometry;
11569
11569
  };
11570
- Bt.prototype.setEndCapStyle = function(t) {
11570
+ Gt.prototype.setEndCapStyle = function(t) {
11571
11571
  this._bufParams.setEndCapStyle(t);
11572
11572
  };
11573
- Bt.prototype.interfaces_ = function() {
11573
+ Gt.prototype.interfaces_ = function() {
11574
11574
  return [];
11575
11575
  };
11576
- Bt.prototype.getClass = function() {
11577
- return Bt;
11576
+ Gt.prototype.getClass = function() {
11577
+ return Gt;
11578
11578
  };
11579
- Bt.bufferOp = function() {
11579
+ Gt.bufferOp = function() {
11580
11580
  if (arguments.length === 2) {
11581
- var t = arguments[0], e = arguments[1], n = new Bt(t), i = n.getResultGeometry(e);
11581
+ var t = arguments[0], e = arguments[1], n = new Gt(t), i = n.getResultGeometry(e);
11582
11582
  return i;
11583
11583
  } else if (arguments.length === 3) {
11584
11584
  if (Number.isInteger(arguments[2]) && arguments[0] instanceof G && typeof arguments[1] == "number") {
11585
- var o = arguments[0], s = arguments[1], a = arguments[2], u = new Bt(o);
11585
+ var o = arguments[0], s = arguments[1], a = arguments[2], u = new Gt(o);
11586
11586
  u.setQuadrantSegments(a);
11587
11587
  var l = u.getResultGeometry(s);
11588
11588
  return l;
11589
11589
  } else if (arguments[2] instanceof $ && arguments[0] instanceof G && typeof arguments[1] == "number") {
11590
- var c = arguments[0], f = arguments[1], h = arguments[2], g = new Bt(c, h), p = g.getResultGeometry(f);
11590
+ var c = arguments[0], f = arguments[1], h = arguments[2], g = new Gt(c, h), p = g.getResultGeometry(f);
11591
11591
  return p;
11592
11592
  }
11593
11593
  } else if (arguments.length === 4) {
11594
- var m = arguments[0], d = arguments[1], y = arguments[2], I = arguments[3], C = new Bt(m);
11594
+ var m = arguments[0], d = arguments[1], y = arguments[2], I = arguments[3], C = new Gt(m);
11595
11595
  C.setQuadrantSegments(y), C.setEndCapStyle(I);
11596
11596
  var x = C.getResultGeometry(d);
11597
11597
  return x;
11598
11598
  }
11599
11599
  };
11600
- Bt.precisionScaleFactor = function(t, e, n) {
11600
+ Gt.precisionScaleFactor = function(t, e, n) {
11601
11601
  var i = t.getEnvelopeInternal(), o = Ie.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 = n - u, c = Math.pow(10, l);
11602
11602
  return c;
11603
11603
  };
@@ -11616,7 +11616,7 @@ ki.CAP_SQUARE.get = function() {
11616
11616
  ki.MAX_PRECISION_DIGITS.get = function() {
11617
11617
  return 12;
11618
11618
  };
11619
- Object.defineProperties(Bt, ki);
11619
+ Object.defineProperties(Gt, ki);
11620
11620
  var Zt = function() {
11621
11621
  this._pt = [new v(), new v()], this._distance = V.NaN, this._isNull = !0;
11622
11622
  };
@@ -11798,7 +11798,7 @@ Yn.getPolygons = function() {
11798
11798
  return e instanceof Rt ? n.add(e) : e instanceof ne && e.apply(new Yn(n)), n;
11799
11799
  }
11800
11800
  };
11801
- var Ft = function() {
11801
+ var Bt = function() {
11802
11802
  if (this._lines = null, this._isForcedToLineString = !1, arguments.length === 1) {
11803
11803
  var t = arguments[0];
11804
11804
  this._lines = t;
@@ -11807,59 +11807,59 @@ var Ft = function() {
11807
11807
  this._lines = e, this._isForcedToLineString = n;
11808
11808
  }
11809
11809
  };
11810
- Ft.prototype.filter = function(t) {
11810
+ Bt.prototype.filter = function(t) {
11811
11811
  if (this._isForcedToLineString && t instanceof wn) {
11812
11812
  var e = t.getFactory().createLineString(t.getCoordinateSequence());
11813
11813
  return this._lines.add(e), null;
11814
11814
  }
11815
11815
  t instanceof dt && this._lines.add(t);
11816
11816
  };
11817
- Ft.prototype.setForceToLineString = function(t) {
11817
+ Bt.prototype.setForceToLineString = function(t) {
11818
11818
  this._isForcedToLineString = t;
11819
11819
  };
11820
- Ft.prototype.interfaces_ = function() {
11820
+ Bt.prototype.interfaces_ = function() {
11821
11821
  return [Wn];
11822
11822
  };
11823
- Ft.prototype.getClass = function() {
11824
- return Ft;
11823
+ Bt.prototype.getClass = function() {
11824
+ return Bt;
11825
11825
  };
11826
- Ft.getGeometry = function() {
11826
+ Bt.getGeometry = function() {
11827
11827
  if (arguments.length === 1) {
11828
11828
  var t = arguments[0];
11829
- return t.getFactory().buildGeometry(Ft.getLines(t));
11829
+ return t.getFactory().buildGeometry(Bt.getLines(t));
11830
11830
  } else if (arguments.length === 2) {
11831
11831
  var e = arguments[0], n = arguments[1];
11832
- return e.getFactory().buildGeometry(Ft.getLines(e, n));
11832
+ return e.getFactory().buildGeometry(Bt.getLines(e, n));
11833
11833
  }
11834
11834
  };
11835
- Ft.getLines = function() {
11835
+ Bt.getLines = function() {
11836
11836
  if (arguments.length === 1) {
11837
11837
  var t = arguments[0];
11838
- return Ft.getLines(t, !1);
11838
+ return Bt.getLines(t, !1);
11839
11839
  } else if (arguments.length === 2) {
11840
11840
  if (z(arguments[0], wt) && z(arguments[1], wt)) {
11841
11841
  for (var e = arguments[0], n = arguments[1], i = e.iterator(); i.hasNext(); ) {
11842
11842
  var o = i.next();
11843
- Ft.getLines(o, n);
11843
+ Bt.getLines(o, n);
11844
11844
  }
11845
11845
  return n;
11846
11846
  } else if (arguments[0] instanceof G && typeof arguments[1] == "boolean") {
11847
11847
  var s = arguments[0], a = arguments[1], u = new L();
11848
- return s.apply(new Ft(u, a)), u;
11848
+ return s.apply(new Bt(u, a)), u;
11849
11849
  } else if (arguments[0] instanceof G && z(arguments[1], wt)) {
11850
11850
  var l = arguments[0], c = arguments[1];
11851
- return l instanceof dt ? c.add(l) : l.apply(new Ft(c)), c;
11851
+ return l instanceof dt ? c.add(l) : l.apply(new Bt(c)), c;
11852
11852
  }
11853
11853
  } else if (arguments.length === 3) {
11854
11854
  if (typeof arguments[2] == "boolean" && z(arguments[0], wt) && z(arguments[1], wt)) {
11855
11855
  for (var f = arguments[0], h = arguments[1], g = arguments[2], p = f.iterator(); p.hasNext(); ) {
11856
11856
  var m = p.next();
11857
- Ft.getLines(m, h, g);
11857
+ Bt.getLines(m, h, g);
11858
11858
  }
11859
11859
  return h;
11860
11860
  } else if (typeof arguments[2] == "boolean" && arguments[0] instanceof G && z(arguments[1], wt)) {
11861
11861
  var d = arguments[0], y = arguments[1], I = arguments[2];
11862
- return d.apply(new Ft(y, I)), y;
11862
+ return d.apply(new Bt(y, I)), y;
11863
11863
  }
11864
11864
  }
11865
11865
  };
@@ -12013,7 +12013,7 @@ Kr.getLocations = function(t) {
12013
12013
  var e = new L();
12014
12014
  return t.apply(new Kr(e)), e;
12015
12015
  };
12016
- var zt = function() {
12016
+ var Vt = function() {
12017
12017
  if (this._geom = null, this._terminateDistance = 0, this._ptLocator = new We(), this._minDistanceLocation = null, this._minDistance = V.MAX_VALUE, arguments.length === 2) {
12018
12018
  var t = arguments[0], e = arguments[1];
12019
12019
  this._geom = [t, e], this._terminateDistance = 0;
@@ -12022,7 +12022,7 @@ var zt = function() {
12022
12022
  this._geom = new Array(2).fill(null), this._geom[0] = n, this._geom[1] = i, this._terminateDistance = o;
12023
12023
  }
12024
12024
  };
12025
- zt.prototype.computeContainmentDistance = function() {
12025
+ Vt.prototype.computeContainmentDistance = function() {
12026
12026
  var t = this;
12027
12027
  if (arguments.length === 0) {
12028
12028
  var e = new Array(2).fill(null);
@@ -12049,7 +12049,7 @@ zt.prototype.computeContainmentDistance = function() {
12049
12049
  }
12050
12050
  }
12051
12051
  };
12052
- zt.prototype.computeMinDistanceLinesPoints = function(t, e, n) {
12052
+ Vt.prototype.computeMinDistanceLinesPoints = function(t, e, n) {
12053
12053
  for (var i = this, o = 0; o < t.size(); o++)
12054
12054
  for (var s = t.get(o), a = 0; a < e.size(); a++) {
12055
12055
  var u = e.get(a);
@@ -12057,26 +12057,26 @@ zt.prototype.computeMinDistanceLinesPoints = function(t, e, n) {
12057
12057
  return null;
12058
12058
  }
12059
12059
  };
12060
- zt.prototype.computeFacetDistance = function() {
12061
- var t = new Array(2).fill(null), e = Ft.getLines(this._geom[0]), n = Ft.getLines(this._geom[1]), i = nr.getPoints(this._geom[0]), o = nr.getPoints(this._geom[1]);
12060
+ Vt.prototype.computeFacetDistance = function() {
12061
+ var t = new Array(2).fill(null), e = Bt.getLines(this._geom[0]), n = Bt.getLines(this._geom[1]), i = nr.getPoints(this._geom[0]), o = nr.getPoints(this._geom[1]);
12062
12062
  if (this.computeMinDistanceLines(e, n, t), this.updateMinDistance(t, !1), this._minDistance <= this._terminateDistance || (t[0] = null, t[1] = null, this.computeMinDistanceLinesPoints(e, o, t), this.updateMinDistance(t, !1), this._minDistance <= this._terminateDistance) || (t[0] = null, t[1] = null, this.computeMinDistanceLinesPoints(n, i, t), this.updateMinDistance(t, !0), this._minDistance <= this._terminateDistance))
12063
12063
  return null;
12064
12064
  t[0] = null, t[1] = null, this.computeMinDistancePoints(i, o, t), this.updateMinDistance(t, !1);
12065
12065
  };
12066
- zt.prototype.nearestLocations = function() {
12066
+ Vt.prototype.nearestLocations = function() {
12067
12067
  return this.computeMinDistance(), this._minDistanceLocation;
12068
12068
  };
12069
- zt.prototype.updateMinDistance = function(t, e) {
12069
+ Vt.prototype.updateMinDistance = function(t, e) {
12070
12070
  if (t[0] === null)
12071
12071
  return null;
12072
12072
  e ? (this._minDistanceLocation[0] = t[1], this._minDistanceLocation[1] = t[0]) : (this._minDistanceLocation[0] = t[0], this._minDistanceLocation[1] = t[1]);
12073
12073
  };
12074
- zt.prototype.nearestPoints = function() {
12074
+ Vt.prototype.nearestPoints = function() {
12075
12075
  this.computeMinDistance();
12076
12076
  var t = [this._minDistanceLocation[0].getCoordinate(), this._minDistanceLocation[1].getCoordinate()];
12077
12077
  return t;
12078
12078
  };
12079
- zt.prototype.computeMinDistance = function() {
12079
+ Vt.prototype.computeMinDistance = function() {
12080
12080
  var t = this;
12081
12081
  if (arguments.length === 0) {
12082
12082
  if (this._minDistanceLocation !== null || (this._minDistanceLocation = new Array(2).fill(null), this.computeContainmentDistance(), this._minDistance <= this._terminateDistance))
@@ -12115,7 +12115,7 @@ zt.prototype.computeMinDistance = function() {
12115
12115
  }
12116
12116
  }
12117
12117
  };
12118
- zt.prototype.computeMinDistancePoints = function(t, e, n) {
12118
+ Vt.prototype.computeMinDistancePoints = function(t, e, n) {
12119
12119
  for (var i = this, o = 0; o < t.size(); o++)
12120
12120
  for (var s = t.get(o), a = 0; a < e.size(); a++) {
12121
12121
  var u = e.get(a), l = s.getCoordinate().distance(u.getCoordinate());
@@ -12123,12 +12123,12 @@ zt.prototype.computeMinDistancePoints = function(t, e, n) {
12123
12123
  return null;
12124
12124
  }
12125
12125
  };
12126
- zt.prototype.distance = function() {
12126
+ Vt.prototype.distance = function() {
12127
12127
  if (this._geom[0] === null || this._geom[1] === null)
12128
12128
  throw new ft("null geometries are not supported");
12129
12129
  return this._geom[0].isEmpty() || this._geom[1].isEmpty() ? 0 : (this.computeMinDistance(), this._minDistance);
12130
12130
  };
12131
- zt.prototype.computeMinDistanceLines = function(t, e, n) {
12131
+ Vt.prototype.computeMinDistanceLines = function(t, e, n) {
12132
12132
  for (var i = this, o = 0; o < t.size(); o++)
12133
12133
  for (var s = t.get(o), a = 0; a < e.size(); a++) {
12134
12134
  var u = e.get(a);
@@ -12136,22 +12136,22 @@ zt.prototype.computeMinDistanceLines = function(t, e, n) {
12136
12136
  return null;
12137
12137
  }
12138
12138
  };
12139
- zt.prototype.interfaces_ = function() {
12139
+ Vt.prototype.interfaces_ = function() {
12140
12140
  return [];
12141
12141
  };
12142
- zt.prototype.getClass = function() {
12143
- return zt;
12142
+ Vt.prototype.getClass = function() {
12143
+ return Vt;
12144
12144
  };
12145
- zt.distance = function(t, e) {
12146
- var n = new zt(t, e);
12145
+ Vt.distance = function(t, e) {
12146
+ var n = new Vt(t, e);
12147
12147
  return n.distance();
12148
12148
  };
12149
- zt.isWithinDistance = function(t, e, n) {
12150
- var i = new zt(t, e, n);
12149
+ Vt.isWithinDistance = function(t, e, n) {
12150
+ var i = new Vt(t, e, n);
12151
12151
  return i.distance() <= n;
12152
12152
  };
12153
- zt.nearestPoints = function(t, e) {
12154
- var n = new zt(t, e);
12153
+ Vt.nearestPoints = function(t, e) {
12154
+ var n = new Vt(t, e);
12155
12155
  return n.nearestPoints();
12156
12156
  };
12157
12157
  var Yt = function() {
@@ -12358,7 +12358,7 @@ fe.prototype.checkMaximumDistance = function(t, e, n) {
12358
12358
  };
12359
12359
  fe.prototype.isValid = function() {
12360
12360
  var t = Math.abs(this._bufDistance), e = fe.MAX_DISTANCE_DIFF_FRAC * t;
12361
- return this._minValidDistance = t - e, this._maxValidDistance = t + e, this._input.isEmpty() || this._result.isEmpty() ? !0 : (this._bufDistance > 0 ? this.checkPositiveValid() : this.checkNegativeValid(), fe.VERBOSE && kt.out.println("Min Dist= " + this._minDistanceFound + " err= " + (1 - this._minDistanceFound / this._bufDistance) + " Max Dist= " + this._maxDistanceFound + " err= " + (this._maxDistanceFound / this._bufDistance - 1)), this._isValid);
12361
+ return this._minValidDistance = t - e, this._maxValidDistance = t + e, this._input.isEmpty() || this._result.isEmpty() ? !0 : (this._bufDistance > 0 ? this.checkPositiveValid() : this.checkNegativeValid(), fe.VERBOSE && zt.out.println("Min Dist= " + this._minDistanceFound + " err= " + (1 - this._minDistanceFound / this._bufDistance) + " Max Dist= " + this._maxDistanceFound + " err= " + (this._maxDistanceFound / this._bufDistance - 1)), this._isValid);
12362
12362
  };
12363
12363
  fe.prototype.checkNegativeValid = function() {
12364
12364
  if (!(this._input instanceof Rt || this._input instanceof Nn || this._input instanceof ne))
@@ -12372,7 +12372,7 @@ fe.prototype.getErrorIndicator = function() {
12372
12372
  return this._errorIndicator;
12373
12373
  };
12374
12374
  fe.prototype.checkMinimumDistance = function(t, e, n) {
12375
- var i = new zt(t, e, n);
12375
+ var i = new Vt(t, e, n);
12376
12376
  if (this._minDistanceFound = i.distance(), this._minDistanceFound < n) {
12377
12377
  this._isValid = !1;
12378
12378
  var o = i.nearestPoints();
@@ -12389,7 +12389,7 @@ fe.prototype.getErrorLocation = function() {
12389
12389
  return this._errorLocation;
12390
12390
  };
12391
12391
  fe.prototype.getPolygonLines = function(t) {
12392
- for (var e = new L(), n = new Ft(e), i = Yn.getPolygons(t), o = i.iterator(); o.hasNext(); ) {
12392
+ for (var e = new L(), n = new Bt(e), i = Yn.getPolygons(t), o = i.iterator(); o.hasNext(); ) {
12393
12393
  var s = o.next();
12394
12394
  s.apply(n);
12395
12395
  }
@@ -12411,64 +12411,64 @@ Ys.MAX_DISTANCE_DIFF_FRAC.get = function() {
12411
12411
  return 0.012;
12412
12412
  };
12413
12413
  Object.defineProperties(fe, Ys);
12414
- var Vt = function(t, e, n) {
12414
+ var Ut = function(t, e, n) {
12415
12415
  this._isValid = !0, this._errorMsg = null, this._errorLocation = null, this._errorIndicator = null, this._input = t || null, this._distance = e || null, this._result = n || null;
12416
12416
  }, Hs = { VERBOSE: { configurable: !0 }, MAX_ENV_DIFF_FRAC: { configurable: !0 } };
12417
- Vt.prototype.isValid = function() {
12417
+ Ut.prototype.isValid = function() {
12418
12418
  return this.checkPolygonal(), this._isValid ? (this.checkExpectedEmpty(), this._isValid ? (this.checkEnvelope(), this._isValid ? (this.checkArea(), this._isValid ? (this.checkDistance(), this._isValid) : this._isValid) : this._isValid) : this._isValid) : this._isValid;
12419
12419
  };
12420
- Vt.prototype.checkEnvelope = function() {
12420
+ Ut.prototype.checkEnvelope = function() {
12421
12421
  if (this._distance < 0)
12422
12422
  return null;
12423
- var t = this._distance * Vt.MAX_ENV_DIFF_FRAC;
12423
+ var t = this._distance * Ut.MAX_ENV_DIFF_FRAC;
12424
12424
  t === 0 && (t = 1e-3);
12425
12425
  var e = new M(this._input.getEnvelopeInternal());
12426
12426
  e.expandBy(this._distance);
12427
12427
  var n = new M(this._result.getEnvelopeInternal());
12428
12428
  n.expandBy(t), n.contains(e) || (this._isValid = !1, this._errorMsg = "Buffer envelope is incorrect", this._errorIndicator = this._input.getFactory().toGeometry(n)), this.report("Envelope");
12429
12429
  };
12430
- Vt.prototype.checkDistance = function() {
12430
+ Ut.prototype.checkDistance = function() {
12431
12431
  var t = new fe(this._input, this._distance, this._result);
12432
12432
  t.isValid() || (this._isValid = !1, this._errorMsg = t.getErrorMessage(), this._errorLocation = t.getErrorLocation(), this._errorIndicator = t.getErrorIndicator()), this.report("Distance");
12433
12433
  };
12434
- Vt.prototype.checkArea = function() {
12434
+ Ut.prototype.checkArea = function() {
12435
12435
  var t = this._input.getArea(), e = this._result.getArea();
12436
12436
  this._distance > 0 && t > e && (this._isValid = !1, this._errorMsg = "Area of positive buffer is smaller than input", this._errorIndicator = this._result), this._distance < 0 && t < e && (this._isValid = !1, this._errorMsg = "Area of negative buffer is larger than input", this._errorIndicator = this._result), this.report("Area");
12437
12437
  };
12438
- Vt.prototype.checkPolygonal = function() {
12438
+ Ut.prototype.checkPolygonal = function() {
12439
12439
  this._result instanceof Rt || this._result instanceof Nn || (this._isValid = !1), this._errorMsg = "Result is not polygonal", this._errorIndicator = this._result, this.report("Polygonal");
12440
12440
  };
12441
- Vt.prototype.getErrorIndicator = function() {
12441
+ Ut.prototype.getErrorIndicator = function() {
12442
12442
  return this._errorIndicator;
12443
12443
  };
12444
- Vt.prototype.getErrorLocation = function() {
12444
+ Ut.prototype.getErrorLocation = function() {
12445
12445
  return this._errorLocation;
12446
12446
  };
12447
- Vt.prototype.checkExpectedEmpty = function() {
12447
+ Ut.prototype.checkExpectedEmpty = function() {
12448
12448
  if (this._input.getDimension() >= 2 || this._distance > 0)
12449
12449
  return null;
12450
12450
  this._result.isEmpty() || (this._isValid = !1, this._errorMsg = "Result is non-empty", this._errorIndicator = this._result), this.report("ExpectedEmpty");
12451
12451
  };
12452
- Vt.prototype.report = function(t) {
12453
- if (!Vt.VERBOSE)
12452
+ Ut.prototype.report = function(t) {
12453
+ if (!Ut.VERBOSE)
12454
12454
  return null;
12455
- kt.out.println("Check " + t + ": " + (this._isValid ? "passed" : "FAILED"));
12455
+ zt.out.println("Check " + t + ": " + (this._isValid ? "passed" : "FAILED"));
12456
12456
  };
12457
- Vt.prototype.getErrorMessage = function() {
12457
+ Ut.prototype.getErrorMessage = function() {
12458
12458
  return this._errorMsg;
12459
12459
  };
12460
- Vt.prototype.interfaces_ = function() {
12460
+ Ut.prototype.interfaces_ = function() {
12461
12461
  return [];
12462
12462
  };
12463
- Vt.prototype.getClass = function() {
12464
- return Vt;
12463
+ Ut.prototype.getClass = function() {
12464
+ return Ut;
12465
12465
  };
12466
- Vt.isValidMsg = function(t, e, n) {
12467
- var i = new Vt(t, e, n);
12466
+ Ut.isValidMsg = function(t, e, n) {
12467
+ var i = new Ut(t, e, n);
12468
12468
  return i.isValid() ? null : i.getErrorMessage();
12469
12469
  };
12470
- Vt.isValid = function(t, e, n) {
12471
- var i = new Vt(t, e, n);
12470
+ Ut.isValid = function(t, e, n) {
12471
+ var i = new Ut(t, e, n);
12472
12472
  return !!i.isValid();
12473
12473
  };
12474
12474
  Hs.VERBOSE.get = function() {
@@ -12477,7 +12477,7 @@ Hs.VERBOSE.get = function() {
12477
12477
  Hs.MAX_ENV_DIFF_FRAC.get = function() {
12478
12478
  return 0.012;
12479
12479
  };
12480
- Object.defineProperties(Vt, Hs);
12480
+ Object.defineProperties(Ut, Hs);
12481
12481
  var dn = function() {
12482
12482
  this._pts = null, this._data = null;
12483
12483
  var t = arguments[0], e = arguments[1];
@@ -13128,7 +13128,7 @@ Tt.prototype.getResultGeometry = function(t) {
13128
13128
  return this.prepareResult(n);
13129
13129
  };
13130
13130
  Tt.prototype.checkValid = function(t) {
13131
- t.isValid() || kt.out.println("Snapped geometry is invalid");
13131
+ t.isValid() || zt.out.println("Snapped geometry is invalid");
13132
13132
  };
13133
13133
  Tt.prototype.computeSnapTolerance = function() {
13134
13134
  this._snapTolerance = _t.computeOverlaySnapTolerance(this._geom[0], this._geom[1]);
@@ -13275,14 +13275,14 @@ zo.prototype.interfaces_ = function() {
13275
13275
  zo.prototype.getClass = function() {
13276
13276
  return zo;
13277
13277
  };
13278
- var Ut = function() {
13278
+ var qt = function() {
13279
13279
  this._hasIntersection = !1, this._hasProper = !1, this._hasProperInterior = !1, this._properIntersectionPoint = null, this._li = null, this._includeProper = null, this._recordIsolated = null, this._isSelfIntersection = null, this._numIntersections = 0, this.numTests = 0, this._bdyNodes = null, this._isDone = !1, this._isDoneWhenProperInt = !1;
13280
13280
  var t = arguments[0], e = arguments[1], n = arguments[2];
13281
13281
  this._li = t, this._includeProper = e, this._recordIsolated = n;
13282
13282
  };
13283
- Ut.prototype.isTrivialIntersection = function(t, e, n, i) {
13283
+ qt.prototype.isTrivialIntersection = function(t, e, n, i) {
13284
13284
  if (t === n && this._li.getIntersectionNum() === 1) {
13285
- if (Ut.isAdjacentSegments(e, i))
13285
+ if (qt.isAdjacentSegments(e, i))
13286
13286
  return !0;
13287
13287
  if (t.isClosed()) {
13288
13288
  var o = t.getNumPoints() - 1;
@@ -13292,16 +13292,16 @@ Ut.prototype.isTrivialIntersection = function(t, e, n, i) {
13292
13292
  }
13293
13293
  return !1;
13294
13294
  };
13295
- Ut.prototype.getProperIntersectionPoint = function() {
13295
+ qt.prototype.getProperIntersectionPoint = function() {
13296
13296
  return this._properIntersectionPoint;
13297
13297
  };
13298
- Ut.prototype.setIsDoneIfProperInt = function(t) {
13298
+ qt.prototype.setIsDoneIfProperInt = function(t) {
13299
13299
  this._isDoneWhenProperInt = t;
13300
13300
  };
13301
- Ut.prototype.hasProperInteriorIntersection = function() {
13301
+ qt.prototype.hasProperInteriorIntersection = function() {
13302
13302
  return this._hasProperInterior;
13303
13303
  };
13304
- Ut.prototype.isBoundaryPointInternal = function(t, e) {
13304
+ qt.prototype.isBoundaryPointInternal = function(t, e) {
13305
13305
  for (var n = e.iterator(); n.hasNext(); ) {
13306
13306
  var i = n.next(), o = i.getCoordinate();
13307
13307
  if (t.isIntersection(o))
@@ -13309,35 +13309,35 @@ Ut.prototype.isBoundaryPointInternal = function(t, e) {
13309
13309
  }
13310
13310
  return !1;
13311
13311
  };
13312
- Ut.prototype.hasProperIntersection = function() {
13312
+ qt.prototype.hasProperIntersection = function() {
13313
13313
  return this._hasProper;
13314
13314
  };
13315
- Ut.prototype.hasIntersection = function() {
13315
+ qt.prototype.hasIntersection = function() {
13316
13316
  return this._hasIntersection;
13317
13317
  };
13318
- Ut.prototype.isDone = function() {
13318
+ qt.prototype.isDone = function() {
13319
13319
  return this._isDone;
13320
13320
  };
13321
- Ut.prototype.isBoundaryPoint = function(t, e) {
13321
+ qt.prototype.isBoundaryPoint = function(t, e) {
13322
13322
  return e === null ? !1 : !!(this.isBoundaryPointInternal(t, e[0]) || this.isBoundaryPointInternal(t, e[1]));
13323
13323
  };
13324
- Ut.prototype.setBoundaryNodes = function(t, e) {
13324
+ qt.prototype.setBoundaryNodes = function(t, e) {
13325
13325
  this._bdyNodes = new Array(2).fill(null), this._bdyNodes[0] = t, this._bdyNodes[1] = e;
13326
13326
  };
13327
- Ut.prototype.addIntersections = function(t, e, n, i) {
13327
+ qt.prototype.addIntersections = function(t, e, n, i) {
13328
13328
  if (t === n && e === i)
13329
13329
  return null;
13330
13330
  this.numTests++;
13331
13331
  var o = t.getCoordinates()[e], s = t.getCoordinates()[e + 1], a = n.getCoordinates()[i], u = n.getCoordinates()[i + 1];
13332
13332
  this._li.computeIntersection(o, s, a, u), this._li.hasIntersection() && (this._recordIsolated && (t.setIsolated(!1), n.setIsolated(!1)), this._numIntersections++, this.isTrivialIntersection(t, e, n, i) || (this._hasIntersection = !0, (this._includeProper || !this._li.isProper()) && (t.addIntersections(this._li, e, 0), n.addIntersections(this._li, i, 1)), this._li.isProper() && (this._properIntersectionPoint = this._li.getIntersection(0).copy(), this._hasProper = !0, this._isDoneWhenProperInt && (this._isDone = !0), this.isBoundaryPoint(this._li, this._bdyNodes) || (this._hasProperInterior = !0))));
13333
13333
  };
13334
- Ut.prototype.interfaces_ = function() {
13334
+ qt.prototype.interfaces_ = function() {
13335
13335
  return [];
13336
13336
  };
13337
- Ut.prototype.getClass = function() {
13338
- return Ut;
13337
+ qt.prototype.getClass = function() {
13338
+ return qt;
13339
13339
  };
13340
- Ut.isAdjacentSegments = function(t, e) {
13340
+ qt.isAdjacentSegments = function(t, e) {
13341
13341
  return Math.abs(t - e) === 1;
13342
13342
  };
13343
13343
  var Lc = function(r) {
@@ -13362,10 +13362,10 @@ var Lc = function(r) {
13362
13362
  break;
13363
13363
  }
13364
13364
  } else if (arguments.length === 3) {
13365
- if (arguments[2] instanceof Ut && z(arguments[0], Ve) && z(arguments[1], Ve)) {
13365
+ if (arguments[2] instanceof qt && z(arguments[0], Ve) && z(arguments[1], Ve)) {
13366
13366
  var a = arguments[0], u = arguments[1], l = arguments[2];
13367
13367
  this.addEdges(a, a), this.addEdges(u, u), this.computeIntersections(l);
13368
- } else if (typeof arguments[2] == "boolean" && z(arguments[0], Ve) && arguments[1] instanceof Ut) {
13368
+ } else if (typeof arguments[2] == "boolean" && z(arguments[0], Ve) && arguments[1] instanceof qt) {
13369
13369
  var c = arguments[0], f = arguments[1], h = arguments[2];
13370
13370
  h ? this.addEdges(c, null) : this.addEdges(c), this.computeIntersections(f);
13371
13371
  }
@@ -13495,7 +13495,7 @@ Tn.prototype.buildRoot = function() {
13495
13495
  this._root = this.buildTree();
13496
13496
  };
13497
13497
  Tn.prototype.printNode = function(t) {
13498
- kt.out.println(Ue.toLineString(new v(t._min, this._level), new v(t._max, this._level)));
13498
+ zt.out.println(Ue.toLineString(new v(t._min, this._level), new v(t._max, this._level)));
13499
13499
  };
13500
13500
  Tn.prototype.init = function() {
13501
13501
  if (this._root !== null)
@@ -13580,7 +13580,7 @@ var Rr = function() {
13580
13580
  this.init(t);
13581
13581
  };
13582
13582
  Rr.prototype.init = function(t) {
13583
- for (var e = this, n = Ft.getLines(t), i = n.iterator(); i.hasNext(); ) {
13583
+ for (var e = this, n = Bt.getLines(t), i = n.iterator(); i.hasNext(); ) {
13584
13584
  var o = i.next(), s = o.getCoordinates();
13585
13585
  e.addLine(s);
13586
13586
  }
@@ -13626,7 +13626,7 @@ var qi = function(r) {
13626
13626
  var n = arguments[0], i = arguments[1];
13627
13627
  return this.computeSelfNodes(n, i, !1);
13628
13628
  } else if (arguments.length === 3) {
13629
- var o = arguments[0], s = arguments[1], a = arguments[2], u = new Ut(o, !0, !1);
13629
+ var o = arguments[0], s = arguments[1], a = arguments[2], u = new qt(o, !0, !1);
13630
13630
  u.setIsDoneIfProperInt(a);
13631
13631
  var l = this.createEdgeSetIntersector(), c = this._parentGeom instanceof wn || this._parentGeom instanceof Rt || this._parentGeom instanceof Nn, f = s || !c;
13632
13632
  return l.computeIntersections(this._edges, u, f), this.addSelfIntersectionNodes(this._argIndex), u;
@@ -13637,7 +13637,7 @@ var qi = function(r) {
13637
13637
  o.eiList.addSplitEdges(n);
13638
13638
  }
13639
13639
  }, t.prototype.computeEdgeIntersections = function(n, i, o) {
13640
- var s = new Ut(i, o, !0);
13640
+ var s = new qt(i, o, !0);
13641
13641
  s.setBoundaryNodes(this.getBoundaryNodes(), n.getBoundaryNodes());
13642
13642
  var a = this.createEdgeSetIntersector();
13643
13643
  return a.computeIntersections(this._edges, n._edges, s), s;
@@ -14063,7 +14063,7 @@ Or.prototype.setSidesToGenerate = function(t, e) {
14063
14063
  this._doLeft = t, this._doRight = e;
14064
14064
  };
14065
14065
  Or.prototype.getPoints = function(t) {
14066
- for (var e = this, n = new L(), i = Ft.getLines(this._g), o = i.iterator(); o.hasNext(); ) {
14066
+ for (var e = this, n = new L(), i = Bt.getLines(this._g), o = i.iterator(); o.hasNext(); ) {
14067
14067
  var s = o.next();
14068
14068
  e.extractPoints(s, t, n);
14069
14069
  }
@@ -14092,7 +14092,7 @@ var Se = function r() {
14092
14092
  this._boundaryDistanceTolerance = r.computeBoundaryDistanceTolerance(t, e), this._geom = [t, e, n], this._locFinder = [new rr(this._geom[0], this._boundaryDistanceTolerance), new rr(this._geom[1], this._boundaryDistanceTolerance), new rr(this._geom[2], this._boundaryDistanceTolerance)];
14093
14093
  }, Lu = { TOLERANCE: { configurable: !0 } };
14094
14094
  Se.prototype.reportResult = function(t, e, n) {
14095
- kt.out.println("Overlay result invalid - A:" + _.toLocationSymbol(e[0]) + " B:" + _.toLocationSymbol(e[1]) + " expected:" + (n ? "i" : "e") + " actual:" + _.toLocationSymbol(e[2]));
14095
+ zt.out.println("Overlay result invalid - A:" + _.toLocationSymbol(e[0]) + " B:" + _.toLocationSymbol(e[1]) + " expected:" + (n ? "i" : "e") + " actual:" + _.toLocationSymbol(e[2]));
14096
14096
  };
14097
14097
  Se.prototype.isValid = function(t) {
14098
14098
  this.addTestPts(this._geom[0]), this.addTestPts(this._geom[1]);
@@ -14694,8 +14694,8 @@ function Bc(r, t, e, n) {
14694
14694
  }
14695
14695
  function F() {
14696
14696
  for (var X = 0, ut = 0, yt = g.length; ut < yt; ++ut)
14697
- for (var qt = g[ut], we = 1, Ar = qt.length, Ze = qt[0], Le, J, Mt = Ze[0], it = Ze[1]; we < Ar; ++we)
14698
- Le = Mt, J = it, Ze = qt[we], Mt = Ze[0], it = Ze[1], J <= n ? it > n && (Mt - Le) * (n - J) > (it - J) * (r - Le) && ++X : it <= n && (Mt - Le) * (n - J) < (it - J) * (r - Le) && --X;
14697
+ for (var Xt = g[ut], we = 1, Ar = Xt.length, Ze = Xt[0], Le, J, Mt = Ze[0], it = Ze[1]; we < Ar; ++we)
14698
+ Le = Mt, J = it, Ze = Xt[we], Mt = Ze[0], it = Ze[1], J <= n ? it > n && (Mt - Le) * (n - J) > (it - J) * (r - Le) && ++X : it <= n && (Mt - Le) * (n - J) < (it - J) * (r - Le) && --X;
14699
14699
  return X;
14700
14700
  }
14701
14701
  function j() {
@@ -14718,8 +14718,8 @@ function Bc(r, t, e, n) {
14718
14718
  else if (yt && x)
14719
14719
  c.point(X, ut);
14720
14720
  else {
14721
- var qt = [I = Math.max(Lo, Math.min(Yi, I)), C = Math.max(Lo, Math.min(Yi, C))], we = [X = Math.max(Lo, Math.min(Yi, X)), ut = Math.max(Lo, Math.min(Yi, ut))];
14722
- Mc(qt, we, r, t, e, n) ? (x || (c.lineStart(), c.point(qt[0], qt[1])), c.point(we[0], we[1]), yt || c.lineEnd(), w = !1) : yt && (c.lineStart(), c.point(X, ut), w = !1);
14721
+ var Xt = [I = Math.max(Lo, Math.min(Yi, I)), C = Math.max(Lo, Math.min(Yi, C))], we = [X = Math.max(Lo, Math.min(Yi, X)), ut = Math.max(Lo, Math.min(Yi, ut))];
14722
+ Mc(Xt, we, r, t, e, n) ? (x || (c.lineStart(), c.point(Xt[0], Xt[1])), c.point(we[0], we[1]), yt || c.lineEnd(), w = !1) : yt && (c.lineStart(), c.point(X, ut), w = !1);
14723
14723
  }
14724
14724
  I = X, C = ut, x = yt;
14725
14725
  }
@@ -14913,10 +14913,10 @@ function Yc(r, t) {
14913
14913
  var Y = zi(O), P = So(F, (-j - Y) / k);
14914
14914
  if (ps(P, D), P = Ps(P), !h)
14915
14915
  return P;
14916
- var X = c[0], ut = f[0], yt = c[1], qt = f[1], we;
14916
+ var X = c[0], ut = f[0], yt = c[1], Xt = f[1], we;
14917
14917
  ut < X && (we = X, X = ut, ut = we);
14918
14918
  var Ar = ut - X, Ze = te(Ar - ot) < pt, Le = Ze || Ar < pt;
14919
- if (!Ze && qt < yt && (we = yt, yt = qt, qt = we), Le ? Ze ? yt + qt > 0 ^ P[1] < (te(P[0] - X) < pt ? yt : qt) : yt <= P[1] && P[1] <= qt : Ar > ot ^ (X <= P[0] && P[0] <= ut)) {
14919
+ if (!Ze && Xt < yt && (we = yt, yt = Xt, Xt = we), Le ? Ze ? yt + Xt > 0 ^ P[1] < (te(P[0] - X) < pt ? yt : Xt) : yt <= P[1] && P[1] <= Xt : Ar > ot ^ (X <= P[0] && P[0] <= ut)) {
14920
14920
  var J = So(F, (-j + Y) / k);
14921
14921
  return ps(J, D), [P, Ps(J)];
14922
14922
  }
@@ -15157,7 +15157,7 @@ function To(r, t, e, n) {
15157
15157
  var a = nf(o), u = {
15158
15158
  type: o.type,
15159
15159
  coordinates: Uu(o.coordinates, a)
15160
- }, l = new Vs(), c = l.read(u), f = uc(lc(t, e), "meters"), h = Bt.bufferOp(c, f, n), g = new fu();
15160
+ }, l = new Vs(), c = l.read(u), f = uc(lc(t, e), "meters"), h = Gt.bufferOp(c, f, n), g = new fu();
15161
15161
  if (h = g.write(h), !Vu(h.coordinates)) {
15162
15162
  var p = {
15163
15163
  type: h.type,