@maptiler/geocoding-control 2.1.0-with-autocomplete-timeout → 2.1.2

package/openlayers-controller.js

@@ -1,122 +1,125 @@
-import { Feature as N } from "ol";
-import { Point as Z, Polygon as ut, MultiPolygon as ft, GeometryCollection as $t, LineString as ct, MultiLineString as ht } from "ol/geom";
-import Tt from "ol/layer/Vector";
-import { fromLonLat as V, transformExtent as qt, toLonLat as at, getUserProjection as Qt } from "ol/proj";
-import Ut from "ol/source/Vector";
-import gt from "ol/style/Fill";
-import Yt from "ol/style/Icon";
-import pt from "ol/style/Stroke";
-import Vt from "ol/style/Style";
-import jt from "ol/style/Text";
-function D(o, t, e = {}) {
+var ct = Object.defineProperty;
+var at = (i, t, e) => t in i ? ct(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e;
+var M = (i, t, e) => at(i, typeof t != "symbol" ? t + "" : t, e);
+import { Feature as se } from "ol";
+import { Point as Re, Polygon as Fe, MultiPolygon as qe, GeometryCollection as pt, LineString as De, MultiLineString as ze } from "ol/geom";
+import gt from "ol/layer/Vector";
+import { fromLonLat as me, transformExtent as yt, toLonLat as Ue, getUserProjection as mt } from "ol/proj";
+import dt from "ol/source/Vector";
+import Ve from "ol/style/Fill";
+import xt from "ol/style/Icon";
+import $e from "ol/style/Stroke";
+import wt from "ol/style/Style";
+import Et from "ol/style/Text";
+function Se(i, t, e = {}) {
   const n = { type: "Feature" };
-  return (e.id === 0 || e.id) && (n.id = e.id), e.bbox && (n.bbox = e.bbox), n.properties = t || {}, n.geometry = o, n;
+  return (e.id === 0 || e.id) && (n.id = e.id), e.bbox && (n.bbox = e.bbox), n.properties = t || {}, n.geometry = i, n;
 }
-function ot(o, t, e = {}) {
-  for (const r of o) {
+function Be(i, t, e = {}) {
+  for (const r of i) {
     if (r.length < 4)
       throw new Error(
         "Each LinearRing of a Polygon must have 4 or more Positions."
       );
     if (r[r.length - 1].length !== r[0].length)
       throw new Error("First and last Position are not equivalent.");
-    for (let i = 0; i < r[r.length - 1].length; i++)
-      if (r[r.length - 1][i] !== r[0][i])
+    for (let f = 0; f < r[r.length - 1].length; f++)
+      if (r[r.length - 1][f] !== r[0][f])
         throw new Error("First and last Position are not equivalent.");
   }
-  return D({
+  return Se({
     type: "Polygon",
-    coordinates: o
+    coordinates: i
   }, t, e);
 }
-function H(o, t = {}) {
+function Ce(i, t = {}) {
   const e = { type: "FeatureCollection" };
-  return t.id && (e.id = t.id), t.bbox && (e.bbox = t.bbox), e.features = o, e;
+  return t.id && (e.id = t.id), t.bbox && (e.bbox = t.bbox), e.features = i, e;
 }
-function At(o, t, e = {}) {
-  return D({
+function rt(i, t, e = {}) {
+  return Se({
     type: "MultiPolygon",
-    coordinates: o
+    coordinates: i
   }, t, e);
 }
-function Ot(o, t, e) {
-  if (o !== null)
-    for (var n, r, i, u, l, c, f, a = 0, s = 0, h, g = o.type, y = g === "FeatureCollection", p = g === "Feature", d = y ? o.features.length : 1, x = 0; x < d; x++) {
-      f = y ? o.features[x].geometry : p ? o.geometry : o, h = f ? f.type === "GeometryCollection" : !1, l = h ? f.geometries.length : 1;
-      for (var v = 0; v < l; v++) {
-        var w = 0, m = 0;
-        if (u = h ? f.geometries[v] : f, u !== null) {
-          c = u.coordinates;
-          var E = u.type;
-          switch (a = 0, E) {
+function st(i, t, e) {
+  if (i !== null)
+    for (var n, r, f, a, c, E, d, T = 0, b = 0, P, N = i.type, _ = N === "FeatureCollection", L = N === "Feature", A = _ ? i.features.length : 1, V = 0; V < A; V++) {
+      d = _ ? i.features[V].geometry : L ? i.geometry : i, P = d ? d.type === "GeometryCollection" : !1, c = P ? d.geometries.length : 1;
+      for (var S = 0; S < c; S++) {
+        var F = 0, B = 0;
+        if (a = P ? d.geometries[S] : d, a !== null) {
+          E = a.coordinates;
+          var Y = a.type;
+          switch (T = 0, Y) {
             case null:
               break;
             case "Point":
               if (t(
-                c,
-                s,
-                x,
-                w,
-                m
+                E,
+                b,
+                V,
+                F,
+                B
               ) === !1)
                 return !1;
-              s++, w++;
+              b++, F++;
               break;
             case "LineString":
             case "MultiPoint":
-              for (n = 0; n < c.length; n++) {
+              for (n = 0; n < E.length; n++) {
                 if (t(
-                  c[n],
-                  s,
-                  x,
-                  w,
-                  m
+                  E[n],
+                  b,
+                  V,
+                  F,
+                  B
                 ) === !1)
                   return !1;
-                s++, E === "MultiPoint" && w++;
+                b++, Y === "MultiPoint" && F++;
               }
-              E === "LineString" && w++;
+              Y === "LineString" && F++;
               break;
             case "Polygon":
             case "MultiLineString":
-              for (n = 0; n < c.length; n++) {
-                for (r = 0; r < c[n].length - a; r++) {
+              for (n = 0; n < E.length; n++) {
+                for (r = 0; r < E[n].length - T; r++) {
                   if (t(
-                    c[n][r],
-                    s,
-                    x,
-                    w,
-                    m
+                    E[n][r],
+                    b,
+                    V,
+                    F,
+                    B
                   ) === !1)
                     return !1;
-                  s++;
+                  b++;
                 }
-                E === "MultiLineString" && w++, E === "Polygon" && m++;
+                Y === "MultiLineString" && F++, Y === "Polygon" && B++;
               }
-              E === "Polygon" && w++;
+              Y === "Polygon" && F++;
               break;
             case "MultiPolygon":
-              for (n = 0; n < c.length; n++) {
-                for (m = 0, r = 0; r < c[n].length; r++) {
-                  for (i = 0; i < c[n][r].length - a; i++) {
+              for (n = 0; n < E.length; n++) {
+                for (B = 0, r = 0; r < E[n].length; r++) {
+                  for (f = 0; f < E[n][r].length - T; f++) {
                     if (t(
-                      c[n][r][i],
-                      s,
-                      x,
-                      w,
-                      m
+                      E[n][r][f],
+                      b,
+                      V,
+                      F,
+                      B
                     ) === !1)
                       return !1;
-                    s++;
+                    b++;
                   }
-                  m++;
+                  B++;
                 }
-                w++;
+                F++;
               }
               break;
             case "GeometryCollection":
-              for (n = 0; n < u.geometries.length; n++)
-                if (Ot(u.geometries[n], t) === !1)
+              for (n = 0; n < a.geometries.length; n++)
+                if (st(a.geometries[n], t) === !1)
                   return !1;
               break;
             default:
@@ -126,22 +129,22 @@ function Ot(o, t, e) {
       }
     }
 }
-function st(o, t) {
-  var e, n, r, i, u, l, c, f, a, s, h = 0, g = o.type === "FeatureCollection", y = o.type === "Feature", p = g ? o.features.length : 1;
-  for (e = 0; e < p; e++) {
-    for (l = g ? o.features[e].geometry : y ? o.geometry : o, f = g ? o.features[e].properties : y ? o.properties : {}, a = g ? o.features[e].bbox : y ? o.bbox : void 0, s = g ? o.features[e].id : y ? o.id : void 0, c = l ? l.type === "GeometryCollection" : !1, u = c ? l.geometries.length : 1, r = 0; r < u; r++) {
-      if (i = c ? l.geometries[r] : l, i === null) {
+function Ge(i, t) {
+  var e, n, r, f, a, c, E, d, T, b, P = 0, N = i.type === "FeatureCollection", _ = i.type === "Feature", L = N ? i.features.length : 1;
+  for (e = 0; e < L; e++) {
+    for (c = N ? i.features[e].geometry : _ ? i.geometry : i, d = N ? i.features[e].properties : _ ? i.properties : {}, T = N ? i.features[e].bbox : _ ? i.bbox : void 0, b = N ? i.features[e].id : _ ? i.id : void 0, E = c ? c.type === "GeometryCollection" : !1, a = E ? c.geometries.length : 1, r = 0; r < a; r++) {
+      if (f = E ? c.geometries[r] : c, f === null) {
         if (t(
           null,
-          h,
-          f,
-          a,
-          s
+          P,
+          d,
+          T,
+          b
         ) === !1)
           return !1;
         continue;
       }
-      switch (i.type) {
+      switch (f.type) {
         case "Point":
         case "LineString":
         case "MultiPoint":
@@ -149,23 +152,23 @@ function st(o, t) {
         case "MultiLineString":
         case "MultiPolygon": {
           if (t(
-            i,
-            h,
             f,
-            a,
-            s
+            P,
+            d,
+            T,
+            b
           ) === !1)
             return !1;
           break;
         }
         case "GeometryCollection": {
-          for (n = 0; n < i.geometries.length; n++)
+          for (n = 0; n < f.geometries.length; n++)
             if (t(
-              i.geometries[n],
-              h,
-              f,
-              a,
-              s
+              f.geometries[n],
+              P,
+              d,
+              T,
+              b
             ) === !1)
               return !1;
           break;
@@ -174,606 +177,1052 @@ function st(o, t) {
           throw new Error("Unknown Geometry Type");
       }
     }
-    h++;
+    P++;
   }
 }
-function Dt(o, t) {
-  st(o, function(e, n, r, i, u) {
-    var l = e === null ? null : e.type;
-    switch (l) {
+function St(i, t) {
+  Ge(i, function(e, n, r, f, a) {
+    var c = e === null ? null : e.type;
+    switch (c) {
       case null:
       case "Point":
       case "LineString":
       case "Polygon":
         return t(
-          D(e, r, { bbox: i, id: u }),
+          Se(e, r, { bbox: f, id: a }),
           n,
           0
         ) === !1 ? !1 : void 0;
     }
-    var c;
-    switch (l) {
+    var E;
+    switch (c) {
       case "MultiPoint":
-        c = "Point";
+        E = "Point";
         break;
       case "MultiLineString":
-        c = "LineString";
+        E = "LineString";
         break;
       case "MultiPolygon":
-        c = "Polygon";
+        E = "Polygon";
         break;
     }
-    for (var f = 0; f < e.coordinates.length; f++) {
-      var a = e.coordinates[f], s = {
-        type: c,
-        coordinates: a
+    for (var d = 0; d < e.coordinates.length; d++) {
+      var T = e.coordinates[d], b = {
+        type: E,
+        coordinates: T
       };
-      if (t(D(s, r), n, f) === !1)
+      if (t(Se(b, r), n, d) === !1)
         return !1;
     }
   });
 }
-function Xt(o, t = {}) {
-  if (o.bbox != null && t.recompute !== !0)
-    return o.bbox;
+function vt(i, t = {}) {
+  if (i.bbox != null && t.recompute !== !0)
+    return i.bbox;
   const e = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-  return Ot(o, (n) => {
+  return st(i, (n) => {
     e[0] > n[0] && (e[0] = n[0]), e[1] > n[1] && (e[1] = n[1]), e[2] < n[0] && (e[2] = n[0]), e[3] < n[1] && (e[3] = n[1]);
   }), e;
 }
-var yt = Xt;
-/**
- * splaytree v3.1.2
- * Fast Splay tree for Node and browser
- *
- * @author Alexander Milevski <info@w8r.name>
- * @license MIT
- * @preserve
- */
-/*! *****************************************************************************
-Copyright (c) Microsoft Corporation. All rights reserved.
-Licensed under the Apache License, Version 2.0 (the "License"); you may not use
-this file except in compliance with the License. You may obtain a copy of the
-License at http://www.apache.org/licenses/LICENSE-2.0
-
-THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
-WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
-MERCHANTABLITY OR NON-INFRINGEMENT.
-
-See the Apache Version 2.0 License for specific language governing permissions
-and limitations under the License.
-***************************************************************************** */
-function Wt(o, t) {
-  var e = { label: 0, sent: function() {
-    if (i[0] & 1) throw i[1];
-    return i[1];
-  }, trys: [], ops: [] }, n, r, i, u;
-  return u = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (u[Symbol.iterator] = function() {
-    return this;
-  }), u;
-  function l(f) {
-    return function(a) {
-      return c([f, a]);
-    };
-  }
-  function c(f) {
-    if (n) throw new TypeError("Generator is already executing.");
-    for (; e; ) try {
-      if (n = 1, r && (i = f[0] & 2 ? r.return : f[0] ? r.throw || ((i = r.return) && i.call(r), 0) : r.next) && !(i = i.call(r, f[1])).done) return i;
-      switch (r = 0, i && (f = [f[0] & 2, i.value]), f[0]) {
-        case 0:
-        case 1:
-          i = f;
-          break;
-        case 4:
-          return e.label++, { value: f[1], done: !1 };
-        case 5:
-          e.label++, r = f[1], f = [0];
-          continue;
-        case 7:
-          f = e.ops.pop(), e.trys.pop();
-          continue;
-        default:
-          if (i = e.trys, !(i = i.length > 0 && i[i.length - 1]) && (f[0] === 6 || f[0] === 2)) {
-            e = 0;
+var Ke = vt, bt = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, _e = Math.ceil, j = Math.floor, X = "[BigNumber Error] ", Xe = X + "Number primitive has more than 15 significant digits: ", ee = 1e14, C = 14, Ye = 9007199254740991, Oe = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], ue = 1e7, W = 1e9;
+function ot(i) {
+  var t, e, n, r = S.prototype = { constructor: S, toString: null, valueOf: null }, f = new S(1), a = 20, c = 4, E = -7, d = 21, T = -1e7, b = 1e7, P = !1, N = 1, _ = 0, L = {
+    prefix: "",
+    groupSize: 3,
+    secondaryGroupSize: 0,
+    groupSeparator: ",",
+    decimalSeparator: ".",
+    fractionGroupSize: 0,
+    fractionGroupSeparator: " ",
+    // non-breaking space
+    suffix: ""
+  }, A = "0123456789abcdefghijklmnopqrstuvwxyz", V = !0;
+  function S(s, o) {
+    var l, m, h, g, w, u, p, x, y = this;
+    if (!(y instanceof S)) return new S(s, o);
+    if (o == null) {
+      if (s && s._isBigNumber === !0) {
+        y.s = s.s, !s.c || s.e > b ? y.c = y.e = null : s.e < T ? y.c = [y.e = 0] : (y.e = s.e, y.c = s.c.slice());
+        return;
+      }
+      if ((u = typeof s == "number") && s * 0 == 0) {
+        if (y.s = 1 / s < 0 ? (s = -s, -1) : 1, s === ~~s) {
+          for (g = 0, w = s; w >= 10; w /= 10, g++) ;
+          g > b ? y.c = y.e = null : (y.e = g, y.c = [s]);
+          return;
+        }
+        x = String(s);
+      } else {
+        if (!bt.test(x = String(s))) return n(y, x, u);
+        y.s = x.charCodeAt(0) == 45 ? (x = x.slice(1), -1) : 1;
+      }
+      (g = x.indexOf(".")) > -1 && (x = x.replace(".", "")), (w = x.search(/e/i)) > 0 ? (g < 0 && (g = w), g += +x.slice(w + 1), x = x.substring(0, w)) : g < 0 && (g = x.length);
+    } else {
+      if (q(o, 2, A.length, "Base"), o == 10 && V)
+        return y = new S(s), Z(y, a + y.e + 1, c);
+      if (x = String(s), u = typeof s == "number") {
+        if (s * 0 != 0) return n(y, x, u, o);
+        if (y.s = 1 / s < 0 ? (x = x.slice(1), -1) : 1, S.DEBUG && x.replace(/^0\.0*|\./, "").length > 15)
+          throw Error(Xe + s);
+      } else
+        y.s = x.charCodeAt(0) === 45 ? (x = x.slice(1), -1) : 1;
+      for (l = A.slice(0, o), g = w = 0, p = x.length; w < p; w++)
+        if (l.indexOf(m = x.charAt(w)) < 0) {
+          if (m == ".") {
+            if (w > g) {
+              g = p;
+              continue;
+            }
+          } else if (!h && (x == x.toUpperCase() && (x = x.toLowerCase()) || x == x.toLowerCase() && (x = x.toUpperCase()))) {
+            h = !0, w = -1, g = 0;
             continue;
           }
-          if (f[0] === 3 && (!i || f[1] > i[0] && f[1] < i[3])) {
-            e.label = f[1];
-            break;
-          }
-          if (f[0] === 6 && e.label < i[1]) {
-            e.label = i[1], i = f;
-            break;
-          }
-          if (i && e.label < i[2]) {
-            e.label = i[2], e.ops.push(f);
-            break;
-          }
-          i[2] && e.ops.pop(), e.trys.pop();
-          continue;
-      }
-      f = t.call(o, e);
-    } catch (a) {
-      f = [6, a], r = 0;
-    } finally {
-      n = i = 0;
+          return n(y, String(s), u, o);
+        }
+      u = !1, x = e(x, o, 10, y.s), (g = x.indexOf(".")) > -1 ? x = x.replace(".", "") : g = x.length;
     }
-    if (f[0] & 5) throw f[1];
-    return { value: f[0] ? f[1] : void 0, done: !0 };
-  }
-}
-var $ = (
-  /** @class */
-  /* @__PURE__ */ function() {
-    function o(t, e) {
-      this.next = null, this.key = t, this.data = e, this.left = null, this.right = null;
-    }
-    return o;
-  }()
-);
-function Zt(o, t) {
-  return o > t ? 1 : o < t ? -1 : 0;
-}
-function G(o, t, e) {
-  for (var n = new $(null, null), r = n, i = n; ; ) {
-    var u = e(o, t.key);
-    if (u < 0) {
-      if (t.left === null)
-        break;
-      if (e(o, t.left.key) < 0) {
-        var l = t.left;
-        if (t.left = l.right, l.right = t, t = l, t.left === null)
-          break;
-      }
-      i.left = t, i = t, t = t.left;
-    } else if (u > 0) {
-      if (t.right === null)
-        break;
-      if (e(o, t.right.key) > 0) {
-        var l = t.right;
-        if (t.right = l.left, l.left = t, t = l, t.right === null)
-          break;
+    for (w = 0; x.charCodeAt(w) === 48; w++) ;
+    for (p = x.length; x.charCodeAt(--p) === 48; ) ;
+    if (x = x.slice(w, ++p)) {
+      if (p -= w, u && S.DEBUG && p > 15 && (s > Ye || s !== j(s)))
+        throw Error(Xe + y.s * s);
+      if ((g = g - w - 1) > b)
+        y.c = y.e = null;
+      else if (g < T)
+        y.c = [y.e = 0];
+      else {
+        if (y.e = g, y.c = [], w = (g + 1) % C, g < 0 && (w += C), w < p) {
+          for (w && y.c.push(+x.slice(0, w)), p -= C; w < p; )
+            y.c.push(+x.slice(w, w += C));
+          w = C - (x = x.slice(w)).length;
+        } else
+          w -= p;
+        for (; w--; x += "0") ;
+        y.c.push(+x);
       }
-      r.right = t, r = t, t = t.right;
     } else
-      break;
+      y.c = [y.e = 0];
   }
-  return r.right = t.left, i.left = t.right, t.left = n.right, t.right = n.left, t;
-}
-function J(o, t, e, n) {
-  var r = new $(o, t);
-  if (e === null)
-    return r.left = r.right = null, r;
-  e = G(o, e, n);
-  var i = n(o, e.key);
-  return i < 0 ? (r.left = e.left, r.right = e, e.left = null) : i >= 0 && (r.right = e.right, r.left = e, e.right = null), r;
-}
-function xt(o, t, e) {
-  var n = null, r = null;
-  if (t) {
-    t = G(o, t, e);
-    var i = e(t.key, o);
-    i === 0 ? (n = t.left, r = t.right) : i < 0 ? (r = t.right, t.right = null, n = t) : (n = t.left, t.left = null, r = t);
-  }
-  return { left: n, right: r };
-}
-function Jt(o, t, e) {
-  return t === null ? o : (o === null || (t = G(o.key, t, e), t.left = o), t);
-}
-function tt(o, t, e, n, r) {
-  if (o) {
-    n("" + t + (e ? "└── " : "├── ") + r(o) + `
-`);
-    var i = t + (e ? "    " : "│   ");
-    o.left && tt(o.left, i, !1, n, r), o.right && tt(o.right, i, !0, n, r);
-  }
-}
-var lt = (
-  /** @class */
-  function() {
-    function o(t) {
-      t === void 0 && (t = Zt), this._root = null, this._size = 0, this._comparator = t;
-    }
-    return o.prototype.insert = function(t, e) {
-      return this._size++, this._root = J(t, e, this._root, this._comparator);
-    }, o.prototype.add = function(t, e) {
-      var n = new $(t, e);
-      this._root === null && (n.left = n.right = null, this._size++, this._root = n);
-      var r = this._comparator, i = G(t, this._root, r), u = r(t, i.key);
-      return u === 0 ? this._root = i : (u < 0 ? (n.left = i.left, n.right = i, i.left = null) : u > 0 && (n.right = i.right, n.left = i, i.right = null), this._size++, this._root = n), this._root;
-    }, o.prototype.remove = function(t) {
-      this._root = this._remove(t, this._root, this._comparator);
-    }, o.prototype._remove = function(t, e, n) {
-      var r;
-      if (e === null)
-        return null;
-      e = G(t, e, n);
-      var i = n(t, e.key);
-      return i === 0 ? (e.left === null ? r = e.right : (r = G(t, e.left, n), r.right = e.right), this._size--, r) : e;
-    }, o.prototype.pop = function() {
-      var t = this._root;
-      if (t) {
-        for (; t.left; )
-          t = t.left;
-        return this._root = G(t.key, this._root, this._comparator), this._root = this._remove(t.key, this._root, this._comparator), { key: t.key, data: t.data };
+  S.clone = ot, S.ROUND_UP = 0, S.ROUND_DOWN = 1, S.ROUND_CEIL = 2, S.ROUND_FLOOR = 3, S.ROUND_HALF_UP = 4, S.ROUND_HALF_DOWN = 5, S.ROUND_HALF_EVEN = 6, S.ROUND_HALF_CEIL = 7, S.ROUND_HALF_FLOOR = 8, S.EUCLID = 9, S.config = S.set = function(s) {
+    var o, l;
+    if (s != null)
+      if (typeof s == "object") {
+        if (s.hasOwnProperty(o = "DECIMAL_PLACES") && (l = s[o], q(l, 0, W, o), a = l), s.hasOwnProperty(o = "ROUNDING_MODE") && (l = s[o], q(l, 0, 8, o), c = l), s.hasOwnProperty(o = "EXPONENTIAL_AT") && (l = s[o], l && l.pop ? (q(l[0], -1e9, 0, o), q(l[1], 0, W, o), E = l[0], d = l[1]) : (q(l, -1e9, W, o), E = -(d = l < 0 ? -l : l))), s.hasOwnProperty(o = "RANGE"))
+          if (l = s[o], l && l.pop)
+            q(l[0], -1e9, -1, o), q(l[1], 1, W, o), T = l[0], b = l[1];
+          else if (q(l, -1e9, W, o), l)
+            T = -(b = l < 0 ? -l : l);
+          else
+            throw Error(X + o + " cannot be zero: " + l);
+        if (s.hasOwnProperty(o = "CRYPTO"))
+          if (l = s[o], l === !!l)
+            if (l)
+              if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+                P = l;
+              else
+                throw P = !l, Error(X + "crypto unavailable");
+            else
+              P = l;
+          else
+            throw Error(X + o + " not true or false: " + l);
+        if (s.hasOwnProperty(o = "MODULO_MODE") && (l = s[o], q(l, 0, 9, o), N = l), s.hasOwnProperty(o = "POW_PRECISION") && (l = s[o], q(l, 0, W, o), _ = l), s.hasOwnProperty(o = "FORMAT"))
+          if (l = s[o], typeof l == "object") L = l;
+          else throw Error(X + o + " not an object: " + l);
+        if (s.hasOwnProperty(o = "ALPHABET"))
+          if (l = s[o], typeof l == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(l))
+            V = l.slice(0, 10) == "0123456789", A = l;
+          else
+            throw Error(X + o + " invalid: " + l);
+      } else
+        throw Error(X + "Object expected: " + s);
+    return {
+      DECIMAL_PLACES: a,
+      ROUNDING_MODE: c,
+      EXPONENTIAL_AT: [E, d],
+      RANGE: [T, b],
+      CRYPTO: P,
+      MODULO_MODE: N,
+      POW_PRECISION: _,
+      FORMAT: L,
+      ALPHABET: A
+    };
+  }, S.isBigNumber = function(s) {
+    if (!s || s._isBigNumber !== !0) return !1;
+    if (!S.DEBUG) return !0;
+    var o, l, m = s.c, h = s.e, g = s.s;
+    e: if ({}.toString.call(m) == "[object Array]") {
+      if ((g === 1 || g === -1) && h >= -1e9 && h <= W && h === j(h)) {
+        if (m[0] === 0) {
+          if (h === 0 && m.length === 1) return !0;
+          break e;
+        }
+        if (o = (h + 1) % C, o < 1 && (o += C), String(m[0]).length == o) {
+          for (o = 0; o < m.length; o++)
+            if (l = m[o], l < 0 || l >= ee || l !== j(l)) break e;
+          if (l !== 0) return !0;
+        }
       }
-      return null;
-    }, o.prototype.findStatic = function(t) {
-      for (var e = this._root, n = this._comparator; e; ) {
-        var r = n(t, e.key);
-        if (r === 0)
-          return e;
-        r < 0 ? e = e.left : e = e.right;
+    } else if (m === null && h === null && (g === null || g === 1 || g === -1))
+      return !0;
+    throw Error(X + "Invalid BigNumber: " + s);
+  }, S.maximum = S.max = function() {
+    return B(arguments, -1);
+  }, S.minimum = S.min = function() {
+    return B(arguments, 1);
+  }, S.random = function() {
+    var s = 9007199254740992, o = Math.random() * s & 2097151 ? function() {
+      return j(Math.random() * s);
+    } : function() {
+      return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
+    };
+    return function(l) {
+      var m, h, g, w, u, p = 0, x = [], y = new S(f);
+      if (l == null ? l = a : q(l, 0, W), w = _e(l / C), P)
+        if (crypto.getRandomValues) {
+          for (m = crypto.getRandomValues(new Uint32Array(w *= 2)); p < w; )
+            u = m[p] * 131072 + (m[p + 1] >>> 11), u >= 9e15 ? (h = crypto.getRandomValues(new Uint32Array(2)), m[p] = h[0], m[p + 1] = h[1]) : (x.push(u % 1e14), p += 2);
+          p = w / 2;
+        } else if (crypto.randomBytes) {
+          for (m = crypto.randomBytes(w *= 7); p < w; )
+            u = (m[p] & 31) * 281474976710656 + m[p + 1] * 1099511627776 + m[p + 2] * 4294967296 + m[p + 3] * 16777216 + (m[p + 4] << 16) + (m[p + 5] << 8) + m[p + 6], u >= 9e15 ? crypto.randomBytes(7).copy(m, p) : (x.push(u % 1e14), p += 7);
+          p = w / 7;
+        } else
+          throw P = !1, Error(X + "crypto unavailable");
+      if (!P)
+        for (; p < w; )
+          u = o(), u < 9e15 && (x[p++] = u % 1e14);
+      for (w = x[--p], l %= C, w && l && (u = Oe[C - l], x[p] = j(w / u) * u); x[p] === 0; x.pop(), p--) ;
+      if (p < 0)
+        x = [g = 0];
+      else {
+        for (g = -1; x[0] === 0; x.splice(0, 1), g -= C) ;
+        for (p = 1, u = x[0]; u >= 10; u /= 10, p++) ;
+        p < C && (g -= C - p);
       }
-      return null;
-    }, o.prototype.find = function(t) {
-      return this._root && (this._root = G(t, this._root, this._comparator), this._comparator(t, this._root.key) !== 0) ? null : this._root;
-    }, o.prototype.contains = function(t) {
-      for (var e = this._root, n = this._comparator; e; ) {
-        var r = n(t, e.key);
-        if (r === 0)
-          return !0;
-        r < 0 ? e = e.left : e = e.right;
+      return y.e = g, y.c = x, y;
+    };
+  }(), S.sum = function() {
+    for (var s = 1, o = arguments, l = new S(o[0]); s < o.length; ) l = l.plus(o[s++]);
+    return l;
+  }, e = /* @__PURE__ */ function() {
+    var s = "0123456789";
+    function o(l, m, h, g) {
+      for (var w, u = [0], p, x = 0, y = l.length; x < y; ) {
+        for (p = u.length; p--; u[p] *= m) ;
+        for (u[0] += g.indexOf(l.charAt(x++)), w = 0; w < u.length; w++)
+          u[w] > h - 1 && (u[w + 1] == null && (u[w + 1] = 0), u[w + 1] += u[w] / h | 0, u[w] %= h);
       }
-      return !1;
-    }, o.prototype.forEach = function(t, e) {
-      for (var n = this._root, r = [], i = !1; !i; )
-        n !== null ? (r.push(n), n = n.left) : r.length !== 0 ? (n = r.pop(), t.call(e, n), n = n.right) : i = !0;
-      return this;
-    }, o.prototype.range = function(t, e, n, r) {
-      for (var i = [], u = this._comparator, l = this._root, c; i.length !== 0 || l; )
-        if (l)
-          i.push(l), l = l.left;
-        else {
-          if (l = i.pop(), c = u(l.key, e), c > 0)
+      return u.reverse();
+    }
+    return function(l, m, h, g, w) {
+      var u, p, x, y, v, R, O, k, D = l.indexOf("."), U = a, I = c;
+      for (D >= 0 && (y = _, _ = 0, l = l.replace(".", ""), k = new S(m), R = k.pow(l.length - D), _ = y, k.c = o(
+        oe(J(R.c), R.e, "0"),
+        10,
+        h,
+        s
+      ), k.e = k.c.length), O = o(l, m, h, w ? (u = A, s) : (u = s, A)), x = y = O.length; O[--y] == 0; O.pop()) ;
+      if (!O[0]) return u.charAt(0);
+      if (D < 0 ? --x : (R.c = O, R.e = x, R.s = g, R = t(R, k, U, I, h), O = R.c, v = R.r, x = R.e), p = x + U + 1, D = O[p], y = h / 2, v = v || p < 0 || O[p + 1] != null, v = I < 4 ? (D != null || v) && (I == 0 || I == (R.s < 0 ? 3 : 2)) : D > y || D == y && (I == 4 || v || I == 6 && O[p - 1] & 1 || I == (R.s < 0 ? 8 : 7)), p < 1 || !O[0])
+        l = v ? oe(u.charAt(1), -U, u.charAt(0)) : u.charAt(0);
+      else {
+        if (O.length = p, v)
+          for (--h; ++O[--p] > h; )
+            O[p] = 0, p || (++x, O = [1].concat(O));
+        for (y = O.length; !O[--y]; ) ;
+        for (D = 0, l = ""; D <= y; l += u.charAt(O[D++])) ;
+        l = oe(l, x, u.charAt(0));
+      }
+      return l;
+    };
+  }(), t = /* @__PURE__ */ function() {
+    function s(m, h, g) {
+      var w, u, p, x, y = 0, v = m.length, R = h % ue, O = h / ue | 0;
+      for (m = m.slice(); v--; )
+        p = m[v] % ue, x = m[v] / ue | 0, w = O * p + x * R, u = R * p + w % ue * ue + y, y = (u / g | 0) + (w / ue | 0) + O * x, m[v] = u % g;
+      return y && (m = [y].concat(m)), m;
+    }
+    function o(m, h, g, w) {
+      var u, p;
+      if (g != w)
+        p = g > w ? 1 : -1;
+      else
+        for (u = p = 0; u < g; u++)
+          if (m[u] != h[u]) {
+            p = m[u] > h[u] ? 1 : -1;
             break;
-          if (u(l.key, t) >= 0 && n.call(r, l))
-            return this;
-          l = l.right;
-        }
-      return this;
-    }, o.prototype.keys = function() {
-      var t = [];
-      return this.forEach(function(e) {
-        var n = e.key;
-        return t.push(n);
-      }), t;
-    }, o.prototype.values = function() {
-      var t = [];
-      return this.forEach(function(e) {
-        var n = e.data;
-        return t.push(n);
-      }), t;
-    }, o.prototype.min = function() {
-      return this._root ? this.minNode(this._root).key : null;
-    }, o.prototype.max = function() {
-      return this._root ? this.maxNode(this._root).key : null;
-    }, o.prototype.minNode = function(t) {
-      if (t === void 0 && (t = this._root), t)
-        for (; t.left; )
-          t = t.left;
-      return t;
-    }, o.prototype.maxNode = function(t) {
-      if (t === void 0 && (t = this._root), t)
-        for (; t.right; )
-          t = t.right;
-      return t;
-    }, o.prototype.at = function(t) {
-      for (var e = this._root, n = !1, r = 0, i = []; !n; )
-        if (e)
-          i.push(e), e = e.left;
-        else if (i.length > 0) {
-          if (e = i.pop(), r === t)
-            return e;
-          r++, e = e.right;
-        } else
-          n = !0;
-      return null;
-    }, o.prototype.next = function(t) {
-      var e = this._root, n = null;
-      if (t.right) {
-        for (n = t.right; n.left; )
-          n = n.left;
-        return n;
+          }
+      return p;
+    }
+    function l(m, h, g, w) {
+      for (var u = 0; g--; )
+        m[g] -= u, u = m[g] < h[g] ? 1 : 0, m[g] = u * w + m[g] - h[g];
+      for (; !m[0] && m.length > 1; m.splice(0, 1)) ;
+    }
+    return function(m, h, g, w, u) {
+      var p, x, y, v, R, O, k, D, U, I, G, $, ye, Le, Me, te, he, H = m.s == h.s ? 1 : -1, K = m.c, z = h.c;
+      if (!K || !K[0] || !z || !z[0])
+        return new S(
+          // Return NaN if either NaN, or both Infinity or 0.
+          !m.s || !h.s || (K ? z && K[0] == z[0] : !z) ? NaN : (
+            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
+            K && K[0] == 0 || !z ? H * 0 : H / 0
+          )
+        );
+      for (D = new S(H), U = D.c = [], x = m.e - h.e, H = g + x + 1, u || (u = ee, x = Q(m.e / C) - Q(h.e / C), H = H / C | 0), y = 0; z[y] == (K[y] || 0); y++) ;
+      if (z[y] > (K[y] || 0) && x--, H < 0)
+        U.push(1), v = !0;
+      else {
+        for (Le = K.length, te = z.length, y = 0, H += 2, R = j(u / (z[0] + 1)), R > 1 && (z = s(z, R, u), K = s(K, R, u), te = z.length, Le = K.length), ye = te, I = K.slice(0, te), G = I.length; G < te; I[G++] = 0) ;
+        he = z.slice(), he = [0].concat(he), Me = z[0], z[1] >= u / 2 && Me++;
+        do {
+          if (R = 0, p = o(z, I, te, G), p < 0) {
+            if ($ = I[0], te != G && ($ = $ * u + (I[1] || 0)), R = j($ / Me), R > 1)
+              for (R >= u && (R = u - 1), O = s(z, R, u), k = O.length, G = I.length; o(O, I, k, G) == 1; )
+                R--, l(O, te < k ? he : z, k, u), k = O.length, p = 1;
+            else
+              R == 0 && (p = R = 1), O = z.slice(), k = O.length;
+            if (k < G && (O = [0].concat(O)), l(I, O, G, u), G = I.length, p == -1)
+              for (; o(z, I, te, G) < 1; )
+                R++, l(I, te < G ? he : z, G, u), G = I.length;
+          } else p === 0 && (R++, I = [0]);
+          U[y++] = R, I[0] ? I[G++] = K[ye] || 0 : (I = [K[ye]], G = 1);
+        } while ((ye++ < Le || I[0] != null) && H--);
+        v = I[0] != null, U[0] || U.splice(0, 1);
       }
-      for (var r = this._comparator; e; ) {
-        var i = r(t.key, e.key);
-        if (i === 0)
-          break;
-        i < 0 ? (n = e, e = e.left) : e = e.right;
+      if (u == ee) {
+        for (y = 1, H = U[0]; H >= 10; H /= 10, y++) ;
+        Z(D, g + (D.e = y + x * C - 1) + 1, w, v);
+      } else
+        D.e = x, D.r = +v;
+      return D;
+    };
+  }();
+  function F(s, o, l, m) {
+    var h, g, w, u, p;
+    if (l == null ? l = c : q(l, 0, 8), !s.c) return s.toString();
+    if (h = s.c[0], w = s.e, o == null)
+      p = J(s.c), p = m == 1 || m == 2 && (w <= E || w >= d) ? xe(p, w) : oe(p, w, "0");
+    else if (s = Z(new S(s), o, l), g = s.e, p = J(s.c), u = p.length, m == 1 || m == 2 && (o <= g || g <= E)) {
+      for (; u < o; p += "0", u++) ;
+      p = xe(p, g);
+    } else if (o -= w, p = oe(p, g, "0"), g + 1 > u) {
+      if (--o > 0) for (p += "."; o--; p += "0") ;
+    } else if (o += g - u, o > 0)
+      for (g + 1 == u && (p += "."); o--; p += "0") ;
+    return s.s < 0 && h ? "-" + p : p;
+  }
+  function B(s, o) {
+    for (var l, m, h = 1, g = new S(s[0]); h < s.length; h++)
+      m = new S(s[h]), (!m.s || (l = fe(g, m)) === o || l === 0 && g.s === o) && (g = m);
+    return g;
+  }
+  function Y(s, o, l) {
+    for (var m = 1, h = o.length; !o[--h]; o.pop()) ;
+    for (h = o[0]; h >= 10; h /= 10, m++) ;
+    return (l = m + l * C - 1) > b ? s.c = s.e = null : l < T ? s.c = [s.e = 0] : (s.e = l, s.c = o), s;
+  }
+  n = /* @__PURE__ */ function() {
+    var s = /^(-?)0([xbo])(?=\w[\w.]*$)/i, o = /^([^.]+)\.$/, l = /^\.([^.]+)$/, m = /^-?(Infinity|NaN)$/, h = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
+    return function(g, w, u, p) {
+      var x, y = u ? w : w.replace(h, "");
+      if (m.test(y))
+        g.s = isNaN(y) ? null : y < 0 ? -1 : 1;
+      else {
+        if (!u && (y = y.replace(s, function(v, R, O) {
+          return x = (O = O.toLowerCase()) == "x" ? 16 : O == "b" ? 2 : 8, !p || p == x ? R : v;
+        }), p && (x = p, y = y.replace(o, "$1").replace(l, "0.$1")), w != y))
+          return new S(y, x);
+        if (S.DEBUG)
+          throw Error(X + "Not a" + (p ? " base " + p : "") + " number: " + w);
+        g.s = null;
       }
-      return n;
-    }, o.prototype.prev = function(t) {
-      var e = this._root, n = null;
-      if (t.left !== null) {
-        for (n = t.left; n.right; )
-          n = n.right;
-        return n;
+      g.c = g.e = null;
+    };
+  }();
+  function Z(s, o, l, m) {
+    var h, g, w, u, p, x, y, v = s.c, R = Oe;
+    if (v) {
+      e: {
+        for (h = 1, u = v[0]; u >= 10; u /= 10, h++) ;
+        if (g = o - h, g < 0)
+          g += C, w = o, p = v[x = 0], y = j(p / R[h - w - 1] % 10);
+        else if (x = _e((g + 1) / C), x >= v.length)
+          if (m) {
+            for (; v.length <= x; v.push(0)) ;
+            p = y = 0, h = 1, g %= C, w = g - C + 1;
+          } else
+            break e;
+        else {
+          for (p = u = v[x], h = 1; u >= 10; u /= 10, h++) ;
+          g %= C, w = g - C + h, y = w < 0 ? 0 : j(p / R[h - w - 1] % 10);
+        }
+        if (m = m || o < 0 || // Are there any non-zero digits after the rounding digit?
+        // The expression  n % pows10[d - j - 1]  returns all digits of n to the right
+        // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
+        v[x + 1] != null || (w < 0 ? p : p % R[h - w - 1]), m = l < 4 ? (y || m) && (l == 0 || l == (s.s < 0 ? 3 : 2)) : y > 5 || y == 5 && (l == 4 || m || l == 6 && // Check whether the digit to the left of the rounding digit is odd.
+        (g > 0 ? w > 0 ? p / R[h - w] : 0 : v[x - 1]) % 10 & 1 || l == (s.s < 0 ? 8 : 7)), o < 1 || !v[0])
+          return v.length = 0, m ? (o -= s.e + 1, v[0] = R[(C - o % C) % C], s.e = -o || 0) : v[0] = s.e = 0, s;
+        if (g == 0 ? (v.length = x, u = 1, x--) : (v.length = x + 1, u = R[C - g], v[x] = w > 0 ? j(p / R[h - w] % R[w]) * u : 0), m)
+          for (; ; )
+            if (x == 0) {
+              for (g = 1, w = v[0]; w >= 10; w /= 10, g++) ;
+              for (w = v[0] += u, u = 1; w >= 10; w /= 10, u++) ;
+              g != u && (s.e++, v[0] == ee && (v[0] = 1));
+              break;
+            } else {
+              if (v[x] += u, v[x] != ee) break;
+              v[x--] = 0, u = 1;
+            }
+        for (g = v.length; v[--g] === 0; v.pop()) ;
       }
-      for (var r = this._comparator; e; ) {
-        var i = r(t.key, e.key);
-        if (i === 0)
-          break;
-        i < 0 ? e = e.left : (n = e, e = e.right);
+      s.e > b ? s.c = s.e = null : s.e < T && (s.c = [s.e = 0]);
+    }
+    return s;
+  }
+  function re(s) {
+    var o, l = s.e;
+    return l === null ? s.toString() : (o = J(s.c), o = l <= E || l >= d ? xe(o, l) : oe(o, l, "0"), s.s < 0 ? "-" + o : o);
+  }
+  return r.absoluteValue = r.abs = function() {
+    var s = new S(this);
+    return s.s < 0 && (s.s = 1), s;
+  }, r.comparedTo = function(s, o) {
+    return fe(this, new S(s, o));
+  }, r.decimalPlaces = r.dp = function(s, o) {
+    var l, m, h, g = this;
+    if (s != null)
+      return q(s, 0, W), o == null ? o = c : q(o, 0, 8), Z(new S(g), s + g.e + 1, o);
+    if (!(l = g.c)) return null;
+    if (m = ((h = l.length - 1) - Q(this.e / C)) * C, h = l[h]) for (; h % 10 == 0; h /= 10, m--) ;
+    return m < 0 && (m = 0), m;
+  }, r.dividedBy = r.div = function(s, o) {
+    return t(this, new S(s, o), a, c);
+  }, r.dividedToIntegerBy = r.idiv = function(s, o) {
+    return t(this, new S(s, o), 0, 1);
+  }, r.exponentiatedBy = r.pow = function(s, o) {
+    var l, m, h, g, w, u, p, x, y, v = this;
+    if (s = new S(s), s.c && !s.isInteger())
+      throw Error(X + "Exponent not an integer: " + re(s));
+    if (o != null && (o = new S(o)), u = s.e > 14, !v.c || !v.c[0] || v.c[0] == 1 && !v.e && v.c.length == 1 || !s.c || !s.c[0])
+      return y = new S(Math.pow(+re(v), u ? s.s * (2 - de(s)) : +re(s))), o ? y.mod(o) : y;
+    if (p = s.s < 0, o) {
+      if (o.c ? !o.c[0] : !o.s) return new S(NaN);
+      m = !p && v.isInteger() && o.isInteger(), m && (v = v.mod(o));
+    } else {
+      if (s.e > 9 && (v.e > 0 || v.e < -1 || (v.e == 0 ? v.c[0] > 1 || u && v.c[1] >= 24e7 : v.c[0] < 8e13 || u && v.c[0] <= 9999975e7)))
+        return g = v.s < 0 && de(s) ? -0 : 0, v.e > -1 && (g = 1 / g), new S(p ? 1 / g : g);
+      _ && (g = _e(_ / C + 2));
+    }
+    for (u ? (l = new S(0.5), p && (s.s = 1), x = de(s)) : (h = Math.abs(+re(s)), x = h % 2), y = new S(f); ; ) {
+      if (x) {
+        if (y = y.times(v), !y.c) break;
+        g ? y.c.length > g && (y.c.length = g) : m && (y = y.mod(o));
       }
-      return n;
-    }, o.prototype.clear = function() {
-      return this._root = null, this._size = 0, this;
-    }, o.prototype.toList = function() {
-      return Ht(this._root);
-    }, o.prototype.load = function(t, e, n) {
-      e === void 0 && (e = []), n === void 0 && (n = !1);
-      var r = t.length, i = this._comparator;
-      if (n && rt(t, e, 0, r - 1, i), this._root === null)
-        this._root = et(t, e, 0, r), this._size = r;
+      if (h) {
+        if (h = j(h / 2), h === 0) break;
+        x = h % 2;
+      } else if (s = s.times(l), Z(s, s.e + 1, 1), s.e > 14)
+        x = de(s);
       else {
-        var u = te(this.toList(), Kt(t, e), i);
-        r = this._size + r, this._root = nt({ head: u }, 0, r);
+        if (h = +re(s), h === 0) break;
+        x = h % 2;
       }
-      return this;
-    }, o.prototype.isEmpty = function() {
-      return this._root === null;
-    }, Object.defineProperty(o.prototype, "size", {
-      get: function() {
-        return this._size;
-      },
-      enumerable: !0,
-      configurable: !0
-    }), Object.defineProperty(o.prototype, "root", {
-      get: function() {
-        return this._root;
-      },
-      enumerable: !0,
-      configurable: !0
-    }), o.prototype.toString = function(t) {
-      t === void 0 && (t = function(n) {
-        return String(n.key);
-      });
-      var e = [];
-      return tt(this._root, "", !0, function(n) {
-        return e.push(n);
-      }, t), e.join("");
-    }, o.prototype.update = function(t, e, n) {
-      var r = this._comparator, i = xt(t, this._root, r), u = i.left, l = i.right;
-      r(t, e) < 0 ? l = J(e, n, l, r) : u = J(e, n, u, r), this._root = Jt(u, l, r);
-    }, o.prototype.split = function(t) {
-      return xt(t, this._root, this._comparator);
-    }, o.prototype[Symbol.iterator] = function() {
-      var t, e, n;
-      return Wt(this, function(r) {
-        switch (r.label) {
-          case 0:
-            t = this._root, e = [], n = !1, r.label = 1;
-          case 1:
-            return n ? [3, 6] : t === null ? [3, 2] : (e.push(t), t = t.left, [3, 5]);
-          case 2:
-            return e.length === 0 ? [3, 4] : (t = e.pop(), [4, t]);
-          case 3:
-            return r.sent(), t = t.right, [3, 5];
-          case 4:
-            n = !0, r.label = 5;
-          case 5:
-            return [3, 1];
-          case 6:
-            return [
-              2
-              /*return*/
-            ];
+      v = v.times(v), g ? v.c && v.c.length > g && (v.c.length = g) : m && (v = v.mod(o));
+    }
+    return m ? y : (p && (y = f.div(y)), o ? y.mod(o) : g ? Z(y, _, c, w) : y);
+  }, r.integerValue = function(s) {
+    var o = new S(this);
+    return s == null ? s = c : q(s, 0, 8), Z(o, o.e + 1, s);
+  }, r.isEqualTo = r.eq = function(s, o) {
+    return fe(this, new S(s, o)) === 0;
+  }, r.isFinite = function() {
+    return !!this.c;
+  }, r.isGreaterThan = r.gt = function(s, o) {
+    return fe(this, new S(s, o)) > 0;
+  }, r.isGreaterThanOrEqualTo = r.gte = function(s, o) {
+    return (o = fe(this, new S(s, o))) === 1 || o === 0;
+  }, r.isInteger = function() {
+    return !!this.c && Q(this.e / C) > this.c.length - 2;
+  }, r.isLessThan = r.lt = function(s, o) {
+    return fe(this, new S(s, o)) < 0;
+  }, r.isLessThanOrEqualTo = r.lte = function(s, o) {
+    return (o = fe(this, new S(s, o))) === -1 || o === 0;
+  }, r.isNaN = function() {
+    return !this.s;
+  }, r.isNegative = function() {
+    return this.s < 0;
+  }, r.isPositive = function() {
+    return this.s > 0;
+  }, r.isZero = function() {
+    return !!this.c && this.c[0] == 0;
+  }, r.minus = function(s, o) {
+    var l, m, h, g, w = this, u = w.s;
+    if (s = new S(s, o), o = s.s, !u || !o) return new S(NaN);
+    if (u != o)
+      return s.s = -o, w.plus(s);
+    var p = w.e / C, x = s.e / C, y = w.c, v = s.c;
+    if (!p || !x) {
+      if (!y || !v) return y ? (s.s = -o, s) : new S(v ? w : NaN);
+      if (!y[0] || !v[0])
+        return v[0] ? (s.s = -o, s) : new S(y[0] ? w : (
+          // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
+          c == 3 ? -0 : 0
+        ));
+    }
+    if (p = Q(p), x = Q(x), y = y.slice(), u = p - x) {
+      for ((g = u < 0) ? (u = -u, h = y) : (x = p, h = v), h.reverse(), o = u; o--; h.push(0)) ;
+      h.reverse();
+    } else
+      for (m = (g = (u = y.length) < (o = v.length)) ? u : o, u = o = 0; o < m; o++)
+        if (y[o] != v[o]) {
+          g = y[o] < v[o];
+          break;
         }
-      });
-    }, o;
-  }()
-);
-function et(o, t, e, n) {
-  var r = n - e;
-  if (r > 0) {
-    var i = e + Math.floor(r / 2), u = o[i], l = t[i], c = new $(u, l);
-    return c.left = et(o, t, e, i), c.right = et(o, t, i + 1, n), c;
-  }
-  return null;
-}
-function Kt(o, t) {
-  for (var e = new $(null, null), n = e, r = 0; r < o.length; r++)
-    n = n.next = new $(o[r], t[r]);
-  return n.next = null, e.next;
-}
-function Ht(o) {
-  for (var t = o, e = [], n = !1, r = new $(null, null), i = r; !n; )
-    t ? (e.push(t), t = t.left) : e.length > 0 ? (t = i = i.next = e.pop(), t = t.right) : n = !0;
-  return i.next = null, r.next;
-}
-function nt(o, t, e) {
-  var n = e - t;
-  if (n > 0) {
-    var r = t + Math.floor(n / 2), i = nt(o, t, r), u = o.head;
-    return u.left = i, o.head = o.head.next, u.right = nt(o, r + 1, e), u;
-  }
-  return null;
+    if (g && (h = y, y = v, v = h, s.s = -s.s), o = (m = v.length) - (l = y.length), o > 0) for (; o--; y[l++] = 0) ;
+    for (o = ee - 1; m > u; ) {
+      if (y[--m] < v[m]) {
+        for (l = m; l && !y[--l]; y[l] = o) ;
+        --y[l], y[m] += ee;
+      }
+      y[m] -= v[m];
+    }
+    for (; y[0] == 0; y.splice(0, 1), --x) ;
+    return y[0] ? Y(s, y, x) : (s.s = c == 3 ? -1 : 1, s.c = [s.e = 0], s);
+  }, r.modulo = r.mod = function(s, o) {
+    var l, m, h = this;
+    return s = new S(s, o), !h.c || !s.s || s.c && !s.c[0] ? new S(NaN) : !s.c || h.c && !h.c[0] ? new S(h) : (N == 9 ? (m = s.s, s.s = 1, l = t(h, s, 0, 3), s.s = m, l.s *= m) : l = t(h, s, 0, N), s = h.minus(l.times(s)), !s.c[0] && N == 1 && (s.s = h.s), s);
+  }, r.multipliedBy = r.times = function(s, o) {
+    var l, m, h, g, w, u, p, x, y, v, R, O, k, D, U, I = this, G = I.c, $ = (s = new S(s, o)).c;
+    if (!G || !$ || !G[0] || !$[0])
+      return !I.s || !s.s || G && !G[0] && !$ || $ && !$[0] && !G ? s.c = s.e = s.s = null : (s.s *= I.s, !G || !$ ? s.c = s.e = null : (s.c = [0], s.e = 0)), s;
+    for (m = Q(I.e / C) + Q(s.e / C), s.s *= I.s, p = G.length, v = $.length, p < v && (k = G, G = $, $ = k, h = p, p = v, v = h), h = p + v, k = []; h--; k.push(0)) ;
+    for (D = ee, U = ue, h = v; --h >= 0; ) {
+      for (l = 0, R = $[h] % U, O = $[h] / U | 0, w = p, g = h + w; g > h; )
+        x = G[--w] % U, y = G[w] / U | 0, u = O * x + y * R, x = R * x + u % U * U + k[g] + l, l = (x / D | 0) + (u / U | 0) + O * y, k[g--] = x % D;
+      k[g] = l;
+    }
+    return l ? ++m : k.splice(0, 1), Y(s, k, m);
+  }, r.negated = function() {
+    var s = new S(this);
+    return s.s = -s.s || null, s;
+  }, r.plus = function(s, o) {
+    var l, m = this, h = m.s;
+    if (s = new S(s, o), o = s.s, !h || !o) return new S(NaN);
+    if (h != o)
+      return s.s = -o, m.minus(s);
+    var g = m.e / C, w = s.e / C, u = m.c, p = s.c;
+    if (!g || !w) {
+      if (!u || !p) return new S(h / 0);
+      if (!u[0] || !p[0]) return p[0] ? s : new S(u[0] ? m : h * 0);
+    }
+    if (g = Q(g), w = Q(w), u = u.slice(), h = g - w) {
+      for (h > 0 ? (w = g, l = p) : (h = -h, l = u), l.reverse(); h--; l.push(0)) ;
+      l.reverse();
+    }
+    for (h = u.length, o = p.length, h - o < 0 && (l = p, p = u, u = l, o = h), h = 0; o; )
+      h = (u[--o] = u[o] + p[o] + h) / ee | 0, u[o] = ee === u[o] ? 0 : u[o] % ee;
+    return h && (u = [h].concat(u), ++w), Y(s, u, w);
+  }, r.precision = r.sd = function(s, o) {
+    var l, m, h, g = this;
+    if (s != null && s !== !!s)
+      return q(s, 1, W), o == null ? o = c : q(o, 0, 8), Z(new S(g), s, o);
+    if (!(l = g.c)) return null;
+    if (h = l.length - 1, m = h * C + 1, h = l[h]) {
+      for (; h % 10 == 0; h /= 10, m--) ;
+      for (h = l[0]; h >= 10; h /= 10, m++) ;
+    }
+    return s && g.e + 1 > m && (m = g.e + 1), m;
+  }, r.shiftedBy = function(s) {
+    return q(s, -9007199254740991, Ye), this.times("1e" + s);
+  }, r.squareRoot = r.sqrt = function() {
+    var s, o, l, m, h, g = this, w = g.c, u = g.s, p = g.e, x = a + 4, y = new S("0.5");
+    if (u !== 1 || !w || !w[0])
+      return new S(!u || u < 0 && (!w || w[0]) ? NaN : w ? g : 1 / 0);
+    if (u = Math.sqrt(+re(g)), u == 0 || u == 1 / 0 ? (o = J(w), (o.length + p) % 2 == 0 && (o += "0"), u = Math.sqrt(+o), p = Q((p + 1) / 2) - (p < 0 || p % 2), u == 1 / 0 ? o = "5e" + p : (o = u.toExponential(), o = o.slice(0, o.indexOf("e") + 1) + p), l = new S(o)) : l = new S(u + ""), l.c[0]) {
+      for (p = l.e, u = p + x, u < 3 && (u = 0); ; )
+        if (h = l, l = y.times(h.plus(t(g, h, x, 1))), J(h.c).slice(0, u) === (o = J(l.c)).slice(0, u))
+          if (l.e < p && --u, o = o.slice(u - 3, u + 1), o == "9999" || !m && o == "4999") {
+            if (!m && (Z(h, h.e + a + 2, 0), h.times(h).eq(g))) {
+              l = h;
+              break;
+            }
+            x += 4, u += 4, m = 1;
+          } else {
+            (!+o || !+o.slice(1) && o.charAt(0) == "5") && (Z(l, l.e + a + 2, 1), s = !l.times(l).eq(g));
+            break;
+          }
+    }
+    return Z(l, l.e + a + 1, c, s);
+  }, r.toExponential = function(s, o) {
+    return s != null && (q(s, 0, W), s++), F(this, s, o, 1);
+  }, r.toFixed = function(s, o) {
+    return s != null && (q(s, 0, W), s = s + this.e + 1), F(this, s, o);
+  }, r.toFormat = function(s, o, l) {
+    var m, h = this;
+    if (l == null)
+      s != null && o && typeof o == "object" ? (l = o, o = null) : s && typeof s == "object" ? (l = s, s = o = null) : l = L;
+    else if (typeof l != "object")
+      throw Error(X + "Argument not an object: " + l);
+    if (m = h.toFixed(s, o), h.c) {
+      var g, w = m.split("."), u = +l.groupSize, p = +l.secondaryGroupSize, x = l.groupSeparator || "", y = w[0], v = w[1], R = h.s < 0, O = R ? y.slice(1) : y, k = O.length;
+      if (p && (g = u, u = p, p = g, k -= g), u > 0 && k > 0) {
+        for (g = k % u || u, y = O.substr(0, g); g < k; g += u) y += x + O.substr(g, u);
+        p > 0 && (y += x + O.slice(g)), R && (y = "-" + y);
+      }
+      m = v ? y + (l.decimalSeparator || "") + ((p = +l.fractionGroupSize) ? v.replace(
+        new RegExp("\\d{" + p + "}\\B", "g"),
+        "$&" + (l.fractionGroupSeparator || "")
+      ) : v) : y;
+    }
+    return (l.prefix || "") + m + (l.suffix || "");
+  }, r.toFraction = function(s) {
+    var o, l, m, h, g, w, u, p, x, y, v, R, O = this, k = O.c;
+    if (s != null && (u = new S(s), !u.isInteger() && (u.c || u.s !== 1) || u.lt(f)))
+      throw Error(X + "Argument " + (u.isInteger() ? "out of range: " : "not an integer: ") + re(u));
+    if (!k) return new S(O);
+    for (o = new S(f), x = l = new S(f), m = p = new S(f), R = J(k), g = o.e = R.length - O.e - 1, o.c[0] = Oe[(w = g % C) < 0 ? C + w : w], s = !s || u.comparedTo(o) > 0 ? g > 0 ? o : x : u, w = b, b = 1 / 0, u = new S(R), p.c[0] = 0; y = t(u, o, 0, 1), h = l.plus(y.times(m)), h.comparedTo(s) != 1; )
+      l = m, m = h, x = p.plus(y.times(h = x)), p = h, o = u.minus(y.times(h = o)), u = h;
+    return h = t(s.minus(l), m, 0, 1), p = p.plus(h.times(x)), l = l.plus(h.times(m)), p.s = x.s = O.s, g = g * 2, v = t(x, m, g, c).minus(O).abs().comparedTo(
+      t(p, l, g, c).minus(O).abs()
+    ) < 1 ? [x, m] : [p, l], b = w, v;
+  }, r.toNumber = function() {
+    return +re(this);
+  }, r.toPrecision = function(s, o) {
+    return s != null && q(s, 1, W), F(this, s, o, 2);
+  }, r.toString = function(s) {
+    var o, l = this, m = l.s, h = l.e;
+    return h === null ? m ? (o = "Infinity", m < 0 && (o = "-" + o)) : o = "NaN" : (s == null ? o = h <= E || h >= d ? xe(J(l.c), h) : oe(J(l.c), h, "0") : s === 10 && V ? (l = Z(new S(l), a + h + 1, c), o = oe(J(l.c), l.e, "0")) : (q(s, 2, A.length, "Base"), o = e(oe(J(l.c), h, "0"), 10, s, m, !0)), m < 0 && l.c[0] && (o = "-" + o)), o;
+  }, r.valueOf = r.toJSON = function() {
+    return re(this);
+  }, r._isBigNumber = !0, r[Symbol.toStringTag] = "BigNumber", r[Symbol.for("nodejs.util.inspect.custom")] = r.valueOf, i != null && S.set(i), S;
 }
-function te(o, t, e) {
-  for (var n = new $(null, null), r = n, i = o, u = t; i !== null && u !== null; )
-    e(i.key, u.key) < 0 ? (r.next = i, i = i.next) : (r.next = u, u = u.next), r = r.next;
-  return i !== null ? r.next = i : u !== null && (r.next = u), n.next;
+function Q(i) {
+  var t = i | 0;
+  return i > 0 || i === t ? t : t - 1;
 }
-function rt(o, t, e, n, r) {
-  if (!(e >= n)) {
-    for (var i = o[e + n >> 1], u = e - 1, l = n + 1; ; ) {
-      do
-        u++;
-      while (r(o[u], i) < 0);
-      do
-        l--;
-      while (r(o[l], i) > 0);
-      if (u >= l)
-        break;
-      var c = o[u];
-      o[u] = o[l], o[l] = c, c = t[u], t[u] = t[l], t[l] = c;
-    }
-    rt(o, t, e, l, r), rt(o, t, l + 1, n, r);
+function J(i) {
+  for (var t, e, n = 1, r = i.length, f = i[0] + ""; n < r; ) {
+    for (t = i[n++] + "", e = C - t.length; e--; t = "0" + t) ;
+    f += t;
   }
+  for (r = f.length; f.charCodeAt(--r) === 48; ) ;
+  return f.slice(0, r + 1 || 1);
 }
-const F = 11102230246251565e-32, _ = 134217729, ee = (3 + 8 * F) * F;
-function K(o, t, e, n, r) {
-  let i, u, l, c, f = t[0], a = n[0], s = 0, h = 0;
-  a > f == a > -f ? (i = f, f = t[++s]) : (i = a, a = n[++h]);
-  let g = 0;
-  if (s < o && h < e)
-    for (a > f == a > -f ? (u = f + i, l = i - (u - f), f = t[++s]) : (u = a + i, l = i - (u - a), a = n[++h]), i = u, l !== 0 && (r[g++] = l); s < o && h < e; )
-      a > f == a > -f ? (u = i + f, c = u - i, l = i - (u - c) + (f - c), f = t[++s]) : (u = i + a, c = u - i, l = i - (u - c) + (a - c), a = n[++h]), i = u, l !== 0 && (r[g++] = l);
-  for (; s < o; )
-    u = i + f, c = u - i, l = i - (u - c) + (f - c), f = t[++s], i = u, l !== 0 && (r[g++] = l);
-  for (; h < e; )
-    u = i + a, c = u - i, l = i - (u - c) + (a - c), a = n[++h], i = u, l !== 0 && (r[g++] = l);
-  return (i !== 0 || g === 0) && (r[g++] = i), g;
+function fe(i, t) {
+  var e, n, r = i.c, f = t.c, a = i.s, c = t.s, E = i.e, d = t.e;
+  if (!a || !c) return null;
+  if (e = r && !r[0], n = f && !f[0], e || n) return e ? n ? 0 : -c : a;
+  if (a != c) return a;
+  if (e = a < 0, n = E == d, !r || !f) return n ? 0 : !r ^ e ? 1 : -1;
+  if (!n) return E > d ^ e ? 1 : -1;
+  for (c = (E = r.length) < (d = f.length) ? E : d, a = 0; a < c; a++) if (r[a] != f[a]) return r[a] > f[a] ^ e ? 1 : -1;
+  return E == d ? 0 : E > d ^ e ? 1 : -1;
 }
-function ne(o, t) {
-  let e = t[0];
-  for (let n = 1; n < o; n++) e += t[n];
-  return e;
+function q(i, t, e, n) {
+  if (i < t || i > e || i !== j(i))
+    throw Error(X + (n || "Argument") + (typeof i == "number" ? i < t || i > e ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(i));
 }
-function Y(o) {
-  return new Float64Array(o);
+function de(i) {
+  var t = i.c.length - 1;
+  return Q(i.e / C) == t && i.c[t] % 2 != 0;
 }
-const re = (3 + 16 * F) * F, ie = (2 + 12 * F) * F, oe = (9 + 64 * F) * F * F, T = Y(4), dt = Y(8), vt = Y(12), mt = Y(16), P = Y(4);
-function se(o, t, e, n, r, i, u) {
-  let l, c, f, a, s, h, g, y, p, d, x, v, w, m, E, b, M, S;
-  const L = o - r, I = e - r, k = t - i, C = n - i;
-  m = L * C, h = _ * L, g = h - (h - L), y = L - g, h = _ * C, p = h - (h - C), d = C - p, E = y * d - (m - g * p - y * p - g * d), b = k * I, h = _ * k, g = h - (h - k), y = k - g, h = _ * I, p = h - (h - I), d = I - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, T[0] = E - (x + s) + (s - M), v = m + x, s = v - m, w = m - (v - s) + (x - s), x = w - b, s = w - x, T[1] = w - (x + s) + (s - b), S = v + x, s = S - v, T[2] = v - (S - s) + (x - s), T[3] = S;
-  let O = ne(4, T), q = ie * u;
-  if (O >= q || -O >= q || (s = o - L, l = o - (L + s) + (s - r), s = e - I, f = e - (I + s) + (s - r), s = t - k, c = t - (k + s) + (s - i), s = n - C, a = n - (C + s) + (s - i), l === 0 && c === 0 && f === 0 && a === 0) || (q = oe * u + ee * Math.abs(O), O += L * a + C * l - (k * f + I * c), O >= q || -O >= q)) return O;
-  m = l * C, h = _ * l, g = h - (h - l), y = l - g, h = _ * C, p = h - (h - C), d = C - p, E = y * d - (m - g * p - y * p - g * d), b = c * I, h = _ * c, g = h - (h - c), y = c - g, h = _ * I, p = h - (h - I), d = I - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), v = m + x, s = v - m, w = m - (v - s) + (x - s), x = w - b, s = w - x, P[1] = w - (x + s) + (s - b), S = v + x, s = S - v, P[2] = v - (S - s) + (x - s), P[3] = S;
-  const Gt = K(4, T, 4, P, dt);
-  m = L * a, h = _ * L, g = h - (h - L), y = L - g, h = _ * a, p = h - (h - a), d = a - p, E = y * d - (m - g * p - y * p - g * d), b = k * f, h = _ * k, g = h - (h - k), y = k - g, h = _ * f, p = h - (h - f), d = f - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), v = m + x, s = v - m, w = m - (v - s) + (x - s), x = w - b, s = w - x, P[1] = w - (x + s) + (s - b), S = v + x, s = S - v, P[2] = v - (S - s) + (x - s), P[3] = S;
-  const Bt = K(Gt, dt, 4, P, vt);
-  m = l * a, h = _ * l, g = h - (h - l), y = l - g, h = _ * a, p = h - (h - a), d = a - p, E = y * d - (m - g * p - y * p - g * d), b = c * f, h = _ * c, g = h - (h - c), y = c - g, h = _ * f, p = h - (h - f), d = f - p, M = y * d - (b - g * p - y * p - g * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), v = m + x, s = v - m, w = m - (v - s) + (x - s), x = w - b, s = w - x, P[1] = w - (x + s) + (s - b), S = v + x, s = S - v, P[2] = v - (S - s) + (x - s), P[3] = S;
-  const zt = K(Bt, vt, 4, P, mt);
-  return mt[zt - 1];
+function xe(i, t) {
+  return (i.length > 1 ? i.charAt(0) + "." + i.slice(1) : i) + (t < 0 ? "e" : "e+") + t;
 }
-function le(o, t, e, n, r, i) {
-  const u = (t - i) * (e - r), l = (o - r) * (n - i), c = u - l, f = Math.abs(u + l);
-  return Math.abs(c) >= re * f ? c : -se(o, t, e, n, r, i, f);
+function oe(i, t, e) {
+  var n, r;
+  if (t < 0) {
+    for (r = e + "."; ++t; r += e) ;
+    i = r + i;
+  } else if (n = i.length, ++t > n) {
+    for (r = e, t -= n; --t; r += e) ;
+    i += r;
+  } else t < n && (i = i.slice(0, t) + "." + i.slice(t));
+  return i;
 }
-const Q = (o, t) => o.ll.x <= t.x && t.x <= o.ur.x && o.ll.y <= t.y && t.y <= o.ur.y, it = (o, t) => {
-  if (t.ur.x < o.ll.x || o.ur.x < t.ll.x || t.ur.y < o.ll.y || o.ur.y < t.ll.y) return null;
-  const e = o.ll.x < t.ll.x ? t.ll.x : o.ll.x, n = o.ur.x < t.ur.x ? o.ur.x : t.ur.x, r = o.ll.y < t.ll.y ? t.ll.y : o.ll.y, i = o.ur.y < t.ur.y ? o.ur.y : t.ur.y;
-  return {
-    ll: {
-      x: e,
-      y: r
-    },
-    ur: {
-      x: n,
-      y: i
-    }
-  };
-};
-let B = Number.EPSILON;
-B === void 0 && (B = Math.pow(2, -52));
-const ue = B * B, wt = (o, t) => {
-  if (-B < o && o < B && -B < t && t < B)
-    return 0;
-  const e = o - t;
-  return e * e < ue * o * t ? 0 : o < t ? -1 : 1;
-};
-class fe {
+var ne = ot(), Tt = class {
+  constructor(i) {
+    M(this, "key");
+    M(this, "left", null);
+    M(this, "right", null);
+    this.key = i;
+  }
+}, ce = class extends Tt {
+  constructor(i) {
+    super(i);
+  }
+}, Pt = class {
   constructor() {
-    this.reset();
+    M(this, "size", 0);
+    M(this, "modificationCount", 0);
+    M(this, "splayCount", 0);
   }
-  reset() {
-    this.xRounder = new Et(), this.yRounder = new Et();
+  splay(i) {
+    const t = this.root;
+    if (t == null)
+      return this.compare(i, i), -1;
+    let e = null, n = null, r = null, f = null, a = t;
+    const c = this.compare;
+    let E;
+    for (; ; )
+      if (E = c(a.key, i), E > 0) {
+        let d = a.left;
+        if (d == null || (E = c(d.key, i), E > 0 && (a.left = d.right, d.right = a, a = d, d = a.left, d == null)))
+          break;
+        e == null ? n = a : e.left = a, e = a, a = d;
+      } else if (E < 0) {
+        let d = a.right;
+        if (d == null || (E = c(d.key, i), E < 0 && (a.right = d.left, d.left = a, a = d, d = a.right, d == null)))
+          break;
+        r == null ? f = a : r.right = a, r = a, a = d;
+      } else
+        break;
+    return r != null && (r.right = a.left, a.left = f), e != null && (e.left = a.right, a.right = n), this.root !== a && (this.root = a, this.splayCount++), E;
+  }
+  splayMin(i) {
+    let t = i, e = t.left;
+    for (; e != null; ) {
+      const n = e;
+      t.left = n.right, n.right = t, t = n, e = t.left;
+    }
+    return t;
+  }
+  splayMax(i) {
+    let t = i, e = t.right;
+    for (; e != null; ) {
+      const n = e;
+      t.right = n.left, n.left = t, t = n, e = t.right;
+    }
+    return t;
+  }
+  _delete(i) {
+    if (this.root == null || this.splay(i) != 0) return null;
+    let e = this.root;
+    const n = e, r = e.left;
+    if (this.size--, r == null)
+      this.root = e.right;
+    else {
+      const f = e.right;
+      e = this.splayMax(r), e.right = f, this.root = e;
+    }
+    return this.modificationCount++, n;
+  }
+  addNewRoot(i, t) {
+    this.size++, this.modificationCount++;
+    const e = this.root;
+    if (e == null) {
+      this.root = i;
+      return;
+    }
+    t < 0 ? (i.left = e, i.right = e.right, e.right = null) : (i.right = e, i.left = e.left, e.left = null), this.root = i;
+  }
+  _first() {
+    const i = this.root;
+    return i == null ? null : (this.root = this.splayMin(i), this.root);
   }
-  round(t, e) {
+  _last() {
+    const i = this.root;
+    return i == null ? null : (this.root = this.splayMax(i), this.root);
+  }
+  clear() {
+    this.root = null, this.size = 0, this.modificationCount++;
+  }
+  has(i) {
+    return this.validKey(i) && this.splay(i) == 0;
+  }
+  defaultCompare() {
+    return (i, t) => i < t ? -1 : i > t ? 1 : 0;
+  }
+  wrap() {
     return {
-      x: this.xRounder.round(t),
-      y: this.yRounder.round(e)
+      getRoot: () => this.root,
+      setRoot: (i) => {
+        this.root = i;
+      },
+      getSize: () => this.size,
+      getModificationCount: () => this.modificationCount,
+      getSplayCount: () => this.splayCount,
+      setSplayCount: (i) => {
+        this.splayCount = i;
+      },
+      splay: (i) => this.splay(i),
+      has: (i) => this.has(i)
     };
   }
-}
-class Et {
-  constructor() {
-    this.tree = new lt(), this.round(0);
-  }
-  // Note: this can rounds input values backwards or forwards.
-  //       You might ask, why not restrict this to just rounding
-  //       forwards? Wouldn't that allow left endpoints to always
-  //       remain left endpoints during splitting (never change to
-  //       right). No - it wouldn't, because we snap intersections
-  //       to endpoints (to establish independence from the segment
-  //       angle for t-intersections).
-  round(t) {
-    const e = this.tree.add(t), n = this.tree.prev(e);
-    if (n !== null && wt(e.key, n.key) === 0)
-      return this.tree.remove(t), n.key;
-    const r = this.tree.next(e);
-    return r !== null && wt(e.key, r.key) === 0 ? (this.tree.remove(t), r.key) : t;
+}, it, nt, ve = class pe extends Pt {
+  constructor(e, n) {
+    super();
+    M(this, "root", null);
+    M(this, "compare");
+    M(this, "validKey");
+    M(this, it, "[object Set]");
+    this.compare = e ?? this.defaultCompare(), this.validKey = n ?? ((r) => r != null && r != null);
   }
-}
-const U = new fe(), j = (o, t) => o.x * t.y - o.y * t.x, Nt = (o, t) => o.x * t.x + o.y * t.y, bt = (o, t, e) => {
-  const n = le(o.x, o.y, t.x, t.y, e.x, e.y);
-  return n > 0 ? -1 : n < 0 ? 1 : 0;
-}, X = (o) => Math.sqrt(Nt(o, o)), ce = (o, t, e) => {
-  const n = {
-    x: t.x - o.x,
-    y: t.y - o.y
-  }, r = {
-    x: e.x - o.x,
-    y: e.y - o.y
-  };
-  return j(r, n) / X(r) / X(n);
-}, he = (o, t, e) => {
-  const n = {
-    x: t.x - o.x,
-    y: t.y - o.y
-  }, r = {
-    x: e.x - o.x,
-    y: e.y - o.y
-  };
-  return Nt(r, n) / X(r) / X(n);
-}, St = (o, t, e) => t.y === 0 ? null : {
-  x: o.x + t.x / t.y * (e - o.y),
-  y: e
-}, _t = (o, t, e) => t.x === 0 ? null : {
-  x: e,
-  y: o.y + t.y / t.x * (e - o.x)
-}, ae = (o, t, e, n) => {
-  if (t.x === 0) return _t(e, n, o.x);
-  if (n.x === 0) return _t(o, t, e.x);
-  if (t.y === 0) return St(e, n, o.y);
-  if (n.y === 0) return St(o, t, e.y);
-  const r = j(t, n);
-  if (r == 0) return null;
-  const i = {
-    x: e.x - o.x,
-    y: e.y - o.y
-  }, u = j(i, t) / r, l = j(i, n) / r, c = o.x + l * t.x, f = e.x + u * n.x, a = o.y + l * t.y, s = e.y + u * n.y, h = (c + f) / 2, g = (a + s) / 2;
-  return {
-    x: h,
-    y: g
-  };
+  delete(e) {
+    return this.validKey(e) ? this._delete(e) != null : !1;
+  }
+  deleteAll(e) {
+    for (const n of e)
+      this.delete(n);
+  }
+  forEach(e) {
+    const n = this[Symbol.iterator]();
+    let r;
+    for (; r = n.next(), !r.done; )
+      e(r.value, r.value, this);
+  }
+  add(e) {
+    const n = this.splay(e);
+    return n != 0 && this.addNewRoot(new ce(e), n), this;
+  }
+  addAndReturn(e) {
+    const n = this.splay(e);
+    return n != 0 && this.addNewRoot(new ce(e), n), this.root.key;
+  }
+  addAll(e) {
+    for (const n of e)
+      this.add(n);
+  }
+  isEmpty() {
+    return this.root == null;
+  }
+  isNotEmpty() {
+    return this.root != null;
+  }
+  single() {
+    if (this.size == 0) throw "Bad state: No element";
+    if (this.size > 1) throw "Bad state: Too many element";
+    return this.root.key;
+  }
+  first() {
+    if (this.size == 0) throw "Bad state: No element";
+    return this._first().key;
+  }
+  last() {
+    if (this.size == 0) throw "Bad state: No element";
+    return this._last().key;
+  }
+  lastBefore(e) {
+    if (e == null) throw "Invalid arguments(s)";
+    if (this.root == null) return null;
+    if (this.splay(e) < 0) return this.root.key;
+    let r = this.root.left;
+    if (r == null) return null;
+    let f = r.right;
+    for (; f != null; )
+      r = f, f = r.right;
+    return r.key;
+  }
+  firstAfter(e) {
+    if (e == null) throw "Invalid arguments(s)";
+    if (this.root == null) return null;
+    if (this.splay(e) > 0) return this.root.key;
+    let r = this.root.right;
+    if (r == null) return null;
+    let f = r.left;
+    for (; f != null; )
+      r = f, f = r.left;
+    return r.key;
+  }
+  retainAll(e) {
+    const n = new pe(this.compare, this.validKey), r = this.modificationCount;
+    for (const f of e) {
+      if (r != this.modificationCount)
+        throw "Concurrent modification during iteration.";
+      this.validKey(f) && this.splay(f) == 0 && n.add(this.root.key);
+    }
+    n.size != this.size && (this.root = n.root, this.size = n.size, this.modificationCount++);
+  }
+  lookup(e) {
+    return !this.validKey(e) || this.splay(e) != 0 ? null : this.root.key;
+  }
+  intersection(e) {
+    const n = new pe(this.compare, this.validKey);
+    for (const r of this)
+      e.has(r) && n.add(r);
+    return n;
+  }
+  difference(e) {
+    const n = new pe(this.compare, this.validKey);
+    for (const r of this)
+      e.has(r) || n.add(r);
+    return n;
+  }
+  union(e) {
+    const n = this.clone();
+    return n.addAll(e), n;
+  }
+  clone() {
+    const e = new pe(this.compare, this.validKey);
+    return e.size = this.size, e.root = this.copyNode(this.root), e;
+  }
+  copyNode(e) {
+    if (e == null) return null;
+    function n(f, a) {
+      let c, E;
+      do {
+        if (c = f.left, E = f.right, c != null) {
+          const d = new ce(c.key);
+          a.left = d, n(c, d);
+        }
+        if (E != null) {
+          const d = new ce(E.key);
+          a.right = d, f = E, a = d;
+        }
+      } while (E != null);
+    }
+    const r = new ce(e.key);
+    return n(e, r), r;
+  }
+  toSet() {
+    return this.clone();
+  }
+  entries() {
+    return new Mt(this.wrap());
+  }
+  keys() {
+    return this[Symbol.iterator]();
+  }
+  values() {
+    return this[Symbol.iterator]();
+  }
+  [(nt = Symbol.iterator, it = Symbol.toStringTag, nt)]() {
+    return new Lt(this.wrap());
+  }
+}, lt = class {
+  constructor(i) {
+    M(this, "tree");
+    M(this, "path", new Array());
+    M(this, "modificationCount", null);
+    M(this, "splayCount");
+    this.tree = i, this.splayCount = i.getSplayCount();
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+  next() {
+    return this.moveNext() ? { done: !1, value: this.current() } : { done: !0, value: null };
+  }
+  current() {
+    if (!this.path.length) return null;
+    const i = this.path[this.path.length - 1];
+    return this.getValue(i);
+  }
+  rebuildPath(i) {
+    this.path.splice(0, this.path.length), this.tree.splay(i), this.path.push(this.tree.getRoot()), this.splayCount = this.tree.getSplayCount();
+  }
+  findLeftMostDescendent(i) {
+    for (; i != null; )
+      this.path.push(i), i = i.left;
+  }
+  moveNext() {
+    if (this.modificationCount != this.tree.getModificationCount()) {
+      if (this.modificationCount == null) {
+        this.modificationCount = this.tree.getModificationCount();
+        let e = this.tree.getRoot();
+        for (; e != null; )
+          this.path.push(e), e = e.left;
+        return this.path.length > 0;
+      }
+      throw "Concurrent modification during iteration.";
+    }
+    if (!this.path.length) return !1;
+    this.splayCount != this.tree.getSplayCount() && this.rebuildPath(this.path[this.path.length - 1].key);
+    let i = this.path[this.path.length - 1], t = i.right;
+    if (t != null) {
+      for (; t != null; )
+        this.path.push(t), t = t.left;
+      return !0;
+    }
+    for (this.path.pop(); this.path.length && this.path[this.path.length - 1].right === i; )
+      i = this.path.pop();
+    return this.path.length > 0;
+  }
+}, Lt = class extends lt {
+  getValue(i) {
+    return i.key;
+  }
+}, Mt = class extends lt {
+  getValue(i) {
+    return [i.key, i.key];
+  }
+}, ut = (i) => () => i, Ne = (i) => {
+  const t = i ? (e, n) => n.minus(e).abs().isLessThanOrEqualTo(i) : ut(!1);
+  return (e, n) => t(e, n) ? 0 : e.comparedTo(n);
 };
-class R {
+function Rt(i) {
+  const t = i ? (e, n, r, f, a) => e.exponentiatedBy(2).isLessThanOrEqualTo(
+    f.minus(n).exponentiatedBy(2).plus(a.minus(r).exponentiatedBy(2)).times(i)
+  ) : ut(!1);
+  return (e, n, r) => {
+    const f = e.x, a = e.y, c = r.x, E = r.y, d = a.minus(E).times(n.x.minus(c)).minus(f.minus(c).times(n.y.minus(E)));
+    return t(d, f, a, c, E) ? 0 : d.comparedTo(0);
+  };
+}
+var _t = (i) => i, Ot = (i) => {
+  if (i) {
+    const t = new ve(Ne(i)), e = new ve(Ne(i)), n = (f, a) => a.addAndReturn(f), r = (f) => ({
+      x: n(f.x, t),
+      y: n(f.y, e)
+    });
+    return r({ x: new ne(0), y: new ne(0) }), r;
+  }
+  return _t;
+}, Ae = (i) => ({
+  set: (t) => {
+    le = Ae(t);
+  },
+  reset: () => Ae(i),
+  compare: Ne(i),
+  snap: Ot(i),
+  orient: Rt(i)
+}), le = Ae(), ae = (i, t) => i.ll.x.isLessThanOrEqualTo(t.x) && t.x.isLessThanOrEqualTo(i.ur.x) && i.ll.y.isLessThanOrEqualTo(t.y) && t.y.isLessThanOrEqualTo(i.ur.y), Ie = (i, t) => {
+  if (t.ur.x.isLessThan(i.ll.x) || i.ur.x.isLessThan(t.ll.x) || t.ur.y.isLessThan(i.ll.y) || i.ur.y.isLessThan(t.ll.y))
+    return null;
+  const e = i.ll.x.isLessThan(t.ll.x) ? t.ll.x : i.ll.x, n = i.ur.x.isLessThan(t.ur.x) ? i.ur.x : t.ur.x, r = i.ll.y.isLessThan(t.ll.y) ? t.ll.y : i.ll.y, f = i.ur.y.isLessThan(t.ur.y) ? i.ur.y : t.ur.y;
+  return { ll: { x: e, y: r }, ur: { x: n, y: f } };
+}, we = (i, t) => i.x.times(t.y).minus(i.y.times(t.x)), ft = (i, t) => i.x.times(t.x).plus(i.y.times(t.y)), be = (i) => ft(i, i).sqrt(), Ct = (i, t, e) => {
+  const n = { x: t.x.minus(i.x), y: t.y.minus(i.y) }, r = { x: e.x.minus(i.x), y: e.y.minus(i.y) };
+  return we(r, n).div(be(r)).div(be(n));
+}, Nt = (i, t, e) => {
+  const n = { x: t.x.minus(i.x), y: t.y.minus(i.y) }, r = { x: e.x.minus(i.x), y: e.y.minus(i.y) };
+  return ft(r, n).div(be(r)).div(be(n));
+}, We = (i, t, e) => t.y.isZero() ? null : { x: i.x.plus(t.x.div(t.y).times(e.minus(i.y))), y: e }, Ze = (i, t, e) => t.x.isZero() ? null : { x: e, y: i.y.plus(t.y.div(t.x).times(e.minus(i.x))) }, At = (i, t, e, n) => {
+  if (t.x.isZero()) return Ze(e, n, i.x);
+  if (n.x.isZero()) return Ze(i, t, e.x);
+  if (t.y.isZero()) return We(e, n, i.y);
+  if (n.y.isZero()) return We(i, t, e.y);
+  const r = we(t, n);
+  if (r.isZero()) return null;
+  const f = { x: e.x.minus(i.x), y: e.y.minus(i.y) }, a = we(f, t).div(r), c = we(f, n).div(r), E = i.x.plus(c.times(t.x)), d = e.x.plus(a.times(n.x)), T = i.y.plus(c.times(t.y)), b = e.y.plus(a.times(n.y)), P = E.plus(d).div(2), N = T.plus(b).div(2);
+  return { x: P, y: N };
+}, ie = class ht {
+  // Warning: 'point' input will be modified and re-used (for performance)
+  constructor(t, e) {
+    M(this, "point");
+    M(this, "isLeft");
+    M(this, "segment");
+    M(this, "otherSE");
+    M(this, "consumedBy");
+    t.events === void 0 ? t.events = [this] : t.events.push(this), this.point = t, this.isLeft = e;
+  }
   // for ordering sweep events in the sweep event queue
   static compare(t, e) {
-    const n = R.comparePoints(t.point, e.point);
-    return n !== 0 ? n : (t.point !== e.point && t.link(e), t.isLeft !== e.isLeft ? t.isLeft ? 1 : -1 : z.compare(t.segment, e.segment));
+    const n = ht.comparePoints(t.point, e.point);
+    return n !== 0 ? n : (t.point !== e.point && t.link(e), t.isLeft !== e.isLeft ? t.isLeft ? 1 : -1 : Pe.compare(t.segment, e.segment));
   }
   // for ordering points in sweep line order
   static comparePoints(t, e) {
-    return t.x < e.x ? -1 : t.x > e.x ? 1 : t.y < e.y ? -1 : t.y > e.y ? 1 : 0;
-  }
-  // Warning: 'point' input will be modified and re-used (for performance)
-  constructor(t, e) {
-    t.events === void 0 ? t.events = [this] : t.events.push(this), this.point = t, this.isLeft = e;
+    return t.x.isLessThan(e.x) ? -1 : t.x.isGreaterThan(e.x) ? 1 : t.y.isLessThan(e.y) ? -1 : t.y.isGreaterThan(e.y) ? 1 : 0;
   }
   link(t) {
     if (t.point === this.point)
       throw new Error("Tried to link already linked events");
     const e = t.point.events;
     for (let n = 0, r = e.length; n < r; n++) {
-      const i = e[n];
-      this.point.events.push(i), i.point = this.point;
+      const f = e[n];
+      this.point.events.push(f), f.point = this.point;
     }
     this.checkForConsuming();
   }
@@ -785,8 +1234,8 @@ class R {
       const n = this.point.events[e];
       if (n.segment.consumedBy === void 0)
         for (let r = e + 1; r < t; r++) {
-          const i = this.point.events[r];
-          i.consumedBy === void 0 && n.otherSE.point.events === i.otherSE.point.events && n.segment.consume(i.segment);
+          const f = this.point.events[r];
+          f.consumedBy === void 0 && n.otherSE.point.events === f.otherSE.point.events && n.segment.consume(f.segment);
         }
     }
   }
@@ -810,27 +1259,301 @@ class R {
    */
   getLeftmostComparator(t) {
     const e = /* @__PURE__ */ new Map(), n = (r) => {
-      const i = r.otherSE;
+      const f = r.otherSE;
       e.set(r, {
-        sine: ce(this.point, t.point, i.point),
-        cosine: he(this.point, t.point, i.point)
+        sine: Ct(this.point, t.point, f.point),
+        cosine: Nt(this.point, t.point, f.point)
       });
     };
-    return (r, i) => {
-      e.has(r) || n(r), e.has(i) || n(i);
-      const {
-        sine: u,
-        cosine: l
-      } = e.get(r), {
-        sine: c,
-        cosine: f
-      } = e.get(i);
-      return u >= 0 && c >= 0 ? l < f ? 1 : l > f ? -1 : 0 : u < 0 && c < 0 ? l < f ? -1 : l > f ? 1 : 0 : c < u ? -1 : c > u ? 1 : 0;
+    return (r, f) => {
+      e.has(r) || n(r), e.has(f) || n(f);
+      const { sine: a, cosine: c } = e.get(r), { sine: E, cosine: d } = e.get(f);
+      return a.isGreaterThanOrEqualTo(0) && E.isGreaterThanOrEqualTo(0) ? c.isLessThan(d) ? 1 : c.isGreaterThan(d) ? -1 : 0 : a.isLessThan(0) && E.isLessThan(0) ? c.isLessThan(d) ? -1 : c.isGreaterThan(d) ? 1 : 0 : E.isLessThan(a) ? -1 : E.isGreaterThan(a) ? 1 : 0;
     };
   }
-}
-let ge = 0;
-class z {
+}, It = class ke {
+  constructor(t) {
+    M(this, "events");
+    M(this, "poly");
+    M(this, "_isExteriorRing");
+    M(this, "_enclosingRing");
+    this.events = t;
+    for (let e = 0, n = t.length; e < n; e++)
+      t[e].segment.ringOut = this;
+    this.poly = null;
+  }
+  /* Given the segments from the sweep line pass, compute & return a series
+   * of closed rings from all the segments marked to be part of the result */
+  static factory(t) {
+    const e = [];
+    for (let n = 0, r = t.length; n < r; n++) {
+      const f = t[n];
+      if (!f.isInResult() || f.ringOut) continue;
+      let a = null, c = f.leftSE, E = f.rightSE;
+      const d = [c], T = c.point, b = [];
+      for (; a = c, c = E, d.push(c), c.point !== T; )
+        for (; ; ) {
+          const P = c.getAvailableLinkedEvents();
+          if (P.length === 0) {
+            const L = d[0].point, A = d[d.length - 1].point;
+            throw new Error(
+              `Unable to complete output ring starting at [${L.x}, ${L.y}]. Last matching segment found ends at [${A.x}, ${A.y}].`
+            );
+          }
+          if (P.length === 1) {
+            E = P[0].otherSE;
+            break;
+          }
+          let N = null;
+          for (let L = 0, A = b.length; L < A; L++)
+            if (b[L].point === c.point) {
+              N = L;
+              break;
+            }
+          if (N !== null) {
+            const L = b.splice(N)[0], A = d.splice(L.index);
+            A.unshift(A[0].otherSE), e.push(new ke(A.reverse()));
+            continue;
+          }
+          b.push({
+            index: d.length,
+            point: c.point
+          });
+          const _ = c.getLeftmostComparator(a);
+          E = P.sort(_)[0].otherSE;
+          break;
+        }
+      e.push(new ke(d));
+    }
+    return e;
+  }
+  getGeom() {
+    let t = this.events[0].point;
+    const e = [t];
+    for (let d = 1, T = this.events.length - 1; d < T; d++) {
+      const b = this.events[d].point, P = this.events[d + 1].point;
+      le.orient(b, t, P) !== 0 && (e.push(b), t = b);
+    }
+    if (e.length === 1) return null;
+    const n = e[0], r = e[1];
+    le.orient(n, t, r) === 0 && e.shift(), e.push(e[0]);
+    const f = this.isExteriorRing() ? 1 : -1, a = this.isExteriorRing() ? 0 : e.length - 1, c = this.isExteriorRing() ? e.length : -1, E = [];
+    for (let d = a; d != c; d += f)
+      E.push([e[d].x.toNumber(), e[d].y.toNumber()]);
+    return E;
+  }
+  isExteriorRing() {
+    if (this._isExteriorRing === void 0) {
+      const t = this.enclosingRing();
+      this._isExteriorRing = t ? !t.isExteriorRing() : !0;
+    }
+    return this._isExteriorRing;
+  }
+  enclosingRing() {
+    return this._enclosingRing === void 0 && (this._enclosingRing = this._calcEnclosingRing()), this._enclosingRing;
+  }
+  /* Returns the ring that encloses this one, if any */
+  _calcEnclosingRing() {
+    var r, f;
+    let t = this.events[0];
+    for (let a = 1, c = this.events.length; a < c; a++) {
+      const E = this.events[a];
+      ie.compare(t, E) > 0 && (t = E);
+    }
+    let e = t.segment.prevInResult(), n = e ? e.prevInResult() : null;
+    for (; ; ) {
+      if (!e) return null;
+      if (!n) return e.ringOut;
+      if (n.ringOut !== e.ringOut)
+        return ((r = n.ringOut) == null ? void 0 : r.enclosingRing()) !== e.ringOut ? e.ringOut : (f = e.ringOut) == null ? void 0 : f.enclosingRing();
+      e = n.prevInResult(), n = e ? e.prevInResult() : null;
+    }
+  }
+}, He = class {
+  constructor(i) {
+    M(this, "exteriorRing");
+    M(this, "interiorRings");
+    this.exteriorRing = i, i.poly = this, this.interiorRings = [];
+  }
+  addInterior(i) {
+    this.interiorRings.push(i), i.poly = this;
+  }
+  getGeom() {
+    const i = this.exteriorRing.getGeom();
+    if (i === null) return null;
+    const t = [i];
+    for (let e = 0, n = this.interiorRings.length; e < n; e++) {
+      const r = this.interiorRings[e].getGeom();
+      r !== null && t.push(r);
+    }
+    return t;
+  }
+}, kt = class {
+  constructor(i) {
+    M(this, "rings");
+    M(this, "polys");
+    this.rings = i, this.polys = this._composePolys(i);
+  }
+  getGeom() {
+    const i = [];
+    for (let t = 0, e = this.polys.length; t < e; t++) {
+      const n = this.polys[t].getGeom();
+      n !== null && i.push(n);
+    }
+    return i;
+  }
+  _composePolys(i) {
+    var e;
+    const t = [];
+    for (let n = 0, r = i.length; n < r; n++) {
+      const f = i[n];
+      if (!f.poly)
+        if (f.isExteriorRing()) t.push(new He(f));
+        else {
+          const a = f.enclosingRing();
+          a != null && a.poly || t.push(new He(a)), (e = a == null ? void 0 : a.poly) == null || e.addInterior(f);
+        }
+    }
+    return t;
+  }
+}, Bt = class {
+  constructor(i, t = Pe.compare) {
+    M(this, "queue");
+    M(this, "tree");
+    M(this, "segments");
+    this.queue = i, this.tree = new ve(t), this.segments = [];
+  }
+  process(i) {
+    const t = i.segment, e = [];
+    if (i.consumedBy)
+      return i.isLeft ? this.queue.delete(i.otherSE) : this.tree.delete(t), e;
+    i.isLeft && this.tree.add(t);
+    let n = t, r = t;
+    do
+      n = this.tree.lastBefore(n);
+    while (n != null && n.consumedBy != null);
+    do
+      r = this.tree.firstAfter(r);
+    while (r != null && r.consumedBy != null);
+    if (i.isLeft) {
+      let f = null;
+      if (n) {
+        const c = n.getIntersection(t);
+        if (c !== null && (t.isAnEndpoint(c) || (f = c), !n.isAnEndpoint(c))) {
+          const E = this._splitSafely(n, c);
+          for (let d = 0, T = E.length; d < T; d++)
+            e.push(E[d]);
+        }
+      }
+      let a = null;
+      if (r) {
+        const c = r.getIntersection(t);
+        if (c !== null && (t.isAnEndpoint(c) || (a = c), !r.isAnEndpoint(c))) {
+          const E = this._splitSafely(r, c);
+          for (let d = 0, T = E.length; d < T; d++)
+            e.push(E[d]);
+        }
+      }
+      if (f !== null || a !== null) {
+        let c = null;
+        f === null ? c = a : a === null ? c = f : c = ie.comparePoints(
+          f,
+          a
+        ) <= 0 ? f : a, this.queue.delete(t.rightSE), e.push(t.rightSE);
+        const E = t.split(c);
+        for (let d = 0, T = E.length; d < T; d++)
+          e.push(E[d]);
+      }
+      e.length > 0 ? (this.tree.delete(t), e.push(i)) : (this.segments.push(t), t.prev = n);
+    } else {
+      if (n && r) {
+        const f = n.getIntersection(r);
+        if (f !== null) {
+          if (!n.isAnEndpoint(f)) {
+            const a = this._splitSafely(n, f);
+            for (let c = 0, E = a.length; c < E; c++)
+              e.push(a[c]);
+          }
+          if (!r.isAnEndpoint(f)) {
+            const a = this._splitSafely(r, f);
+            for (let c = 0, E = a.length; c < E; c++)
+              e.push(a[c]);
+          }
+        }
+      }
+      this.tree.delete(t);
+    }
+    return e;
+  }
+  /* Safely split a segment that is currently in the datastructures
+   * IE - a segment other than the one that is currently being processed. */
+  _splitSafely(i, t) {
+    this.tree.delete(i);
+    const e = i.rightSE;
+    this.queue.delete(e);
+    const n = i.split(t);
+    return n.push(e), i.consumedBy === void 0 && this.tree.add(i), n;
+  }
+}, Gt = class {
+  constructor() {
+    M(this, "type");
+    M(this, "numMultiPolys");
+  }
+  run(i, t, e) {
+    ge.type = i;
+    const n = [new je(t, !0)];
+    for (let d = 0, T = e.length; d < T; d++)
+      n.push(new je(e[d], !1));
+    if (ge.numMultiPolys = n.length, ge.type === "difference") {
+      const d = n[0];
+      let T = 1;
+      for (; T < n.length; )
+        Ie(n[T].bbox, d.bbox) !== null ? T++ : n.splice(T, 1);
+    }
+    if (ge.type === "intersection")
+      for (let d = 0, T = n.length; d < T; d++) {
+        const b = n[d];
+        for (let P = d + 1, N = n.length; P < N; P++)
+          if (Ie(b.bbox, n[P].bbox) === null) return [];
+      }
+    const r = new ve(ie.compare);
+    for (let d = 0, T = n.length; d < T; d++) {
+      const b = n[d].getSweepEvents();
+      for (let P = 0, N = b.length; P < N; P++)
+        r.add(b[P]);
+    }
+    const f = new Bt(r);
+    let a = null;
+    for (r.size != 0 && (a = r.first(), r.delete(a)); a; ) {
+      const d = f.process(a);
+      for (let T = 0, b = d.length; T < b; T++) {
+        const P = d[T];
+        P.consumedBy === void 0 && r.add(P);
+      }
+      r.size != 0 ? (a = r.first(), r.delete(a)) : a = null;
+    }
+    le.reset();
+    const c = It.factory(f.segments);
+    return new kt(c).getGeom();
+  }
+}, ge = new Gt(), Te = ge, Ft = 0, Pe = class Ee {
+  /* Warning: a reference to ringWindings input will be stored,
+   *  and possibly will be later modified */
+  constructor(t, e, n, r) {
+    M(this, "id");
+    M(this, "leftSE");
+    M(this, "rightSE");
+    M(this, "rings");
+    M(this, "windings");
+    M(this, "ringOut");
+    M(this, "consumedBy");
+    M(this, "prev");
+    M(this, "_prevInResult");
+    M(this, "_beforeState");
+    M(this, "_afterState");
+    M(this, "_isInResult");
+    this.id = ++Ft, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = n, this.windings = r;
+  }
   /* This compare() function is for ordering segments in the sweep
    * line tree, and does so according to the following criteria:
    *
@@ -845,60 +1568,58 @@ class z {
    * is directly on the right-more of the two left inputs.
    */
   static compare(t, e) {
-    const n = t.leftSE.point.x, r = e.leftSE.point.x, i = t.rightSE.point.x, u = e.rightSE.point.x;
-    if (u < n) return 1;
-    if (i < r) return -1;
-    const l = t.leftSE.point.y, c = e.leftSE.point.y, f = t.rightSE.point.y, a = e.rightSE.point.y;
-    if (n < r) {
-      if (c < l && c < f) return 1;
-      if (c > l && c > f) return -1;
-      const s = t.comparePoint(e.leftSE.point);
-      if (s < 0) return 1;
-      if (s > 0) return -1;
-      const h = e.comparePoint(t.rightSE.point);
-      return h !== 0 ? h : -1;
-    }
-    if (n > r) {
-      if (l < c && l < a) return -1;
-      if (l > c && l > a) return 1;
-      const s = e.comparePoint(t.leftSE.point);
-      if (s !== 0) return s;
-      const h = t.comparePoint(e.rightSE.point);
-      return h < 0 ? 1 : h > 0 ? -1 : 1;
-    }
-    if (l < c) return -1;
-    if (l > c) return 1;
-    if (i < u) {
-      const s = e.comparePoint(t.rightSE.point);
-      if (s !== 0) return s;
-    }
-    if (i > u) {
-      const s = t.comparePoint(e.rightSE.point);
-      if (s < 0) return 1;
-      if (s > 0) return -1;
-    }
-    if (i !== u) {
-      const s = f - l, h = i - n, g = a - c, y = u - r;
-      if (s > h && g < y) return 1;
-      if (s < h && g > y) return -1;
-    }
-    return i > u ? 1 : i < u || f < a ? -1 : f > a ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
-  }
-  /* Warning: a reference to ringWindings input will be stored,
-   *  and possibly will be later modified */
-  constructor(t, e, n, r) {
-    this.id = ++ge, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = n, this.windings = r;
+    const n = t.leftSE.point.x, r = e.leftSE.point.x, f = t.rightSE.point.x, a = e.rightSE.point.x;
+    if (a.isLessThan(n)) return 1;
+    if (f.isLessThan(r)) return -1;
+    const c = t.leftSE.point.y, E = e.leftSE.point.y, d = t.rightSE.point.y, T = e.rightSE.point.y;
+    if (n.isLessThan(r)) {
+      if (E.isLessThan(c) && E.isLessThan(d)) return 1;
+      if (E.isGreaterThan(c) && E.isGreaterThan(d)) return -1;
+      const b = t.comparePoint(e.leftSE.point);
+      if (b < 0) return 1;
+      if (b > 0) return -1;
+      const P = e.comparePoint(t.rightSE.point);
+      return P !== 0 ? P : -1;
+    }
+    if (n.isGreaterThan(r)) {
+      if (c.isLessThan(E) && c.isLessThan(T)) return -1;
+      if (c.isGreaterThan(E) && c.isGreaterThan(T)) return 1;
+      const b = e.comparePoint(t.leftSE.point);
+      if (b !== 0) return b;
+      const P = t.comparePoint(e.rightSE.point);
+      return P < 0 ? 1 : P > 0 ? -1 : 1;
+    }
+    if (c.isLessThan(E)) return -1;
+    if (c.isGreaterThan(E)) return 1;
+    if (f.isLessThan(a)) {
+      const b = e.comparePoint(t.rightSE.point);
+      if (b !== 0) return b;
+    }
+    if (f.isGreaterThan(a)) {
+      const b = t.comparePoint(e.rightSE.point);
+      if (b < 0) return 1;
+      if (b > 0) return -1;
+    }
+    if (!f.eq(a)) {
+      const b = d.minus(c), P = f.minus(n), N = T.minus(E), _ = a.minus(r);
+      if (b.isGreaterThan(P) && N.isLessThan(_)) return 1;
+      if (b.isLessThan(P) && N.isGreaterThan(_)) return -1;
+    }
+    return f.isGreaterThan(a) ? 1 : f.isLessThan(a) || d.isLessThan(T) ? -1 : d.isGreaterThan(T) ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
   }
   static fromRing(t, e, n) {
-    let r, i, u;
-    const l = R.comparePoints(t, e);
-    if (l < 0)
-      r = t, i = e, u = 1;
-    else if (l > 0)
-      r = e, i = t, u = -1;
-    else throw new Error(`Tried to create degenerate segment at [${t.x}, ${t.y}]`);
-    const c = new R(r, !0), f = new R(i, !1);
-    return new z(c, f, [n], [u]);
+    let r, f, a;
+    const c = ie.comparePoints(t, e);
+    if (c < 0)
+      r = t, f = e, a = 1;
+    else if (c > 0)
+      r = e, f = t, a = -1;
+    else
+      throw new Error(
+        `Tried to create degenerate segment at [${t.x}, ${t.y}]`
+      );
+    const E = new ie(r, !0), d = new ie(f, !1);
+    return new Ee(E, d, [n], [a]);
   }
   /* When a segment is split, the rightSE is replaced with a new sweep event */
   replaceRightSE(t) {
@@ -907,25 +1628,19 @@ class z {
   bbox() {
     const t = this.leftSE.point.y, e = this.rightSE.point.y;
     return {
-      ll: {
-        x: this.leftSE.point.x,
-        y: t < e ? t : e
-      },
-      ur: {
-        x: this.rightSE.point.x,
-        y: t > e ? t : e
-      }
+      ll: { x: this.leftSE.point.x, y: t.isLessThan(e) ? t : e },
+      ur: { x: this.rightSE.point.x, y: t.isGreaterThan(e) ? t : e }
     };
   }
   /* A vector from the left point to the right */
   vector() {
     return {
-      x: this.rightSE.point.x - this.leftSE.point.x,
-      y: this.rightSE.point.y - this.leftSE.point.y
+      x: this.rightSE.point.x.minus(this.leftSE.point.x),
+      y: this.rightSE.point.y.minus(this.leftSE.point.y)
     };
   }
   isAnEndpoint(t) {
-    return t.x === this.leftSE.point.x && t.y === this.leftSE.point.y || t.x === this.rightSE.point.x && t.y === this.rightSE.point.y;
+    return t.x.eq(this.leftSE.point.x) && t.y.eq(this.leftSE.point.y) || t.x.eq(this.rightSE.point.x) && t.y.eq(this.rightSE.point.y);
   }
   /* Compare this segment with a point.
    *
@@ -941,14 +1656,7 @@ class z {
    *  -1: point lies below the segment (to the right of vertical)
    */
   comparePoint(t) {
-    if (this.isAnEndpoint(t)) return 0;
-    const e = this.leftSE.point, n = this.rightSE.point, r = this.vector();
-    if (e.x === n.x)
-      return t.x === e.x ? 0 : t.x < e.x ? 1 : -1;
-    const i = (t.y - e.y) / r.y, u = e.x + i * r.x;
-    if (t.x === u) return 0;
-    const l = (t.x - e.x) / r.x, c = e.y + l * r.y;
-    return t.y === c ? 0 : t.y < c ? -1 : 1;
+    return le.orient(this.leftSE.point, t, this.rightSE.point);
   }
   /**
    * Given another segment, returns the first non-trivial intersection
@@ -966,20 +1674,20 @@ class z {
    * Else, return null.
    */
   getIntersection(t) {
-    const e = this.bbox(), n = t.bbox(), r = it(e, n);
+    const e = this.bbox(), n = t.bbox(), r = Ie(e, n);
     if (r === null) return null;
-    const i = this.leftSE.point, u = this.rightSE.point, l = t.leftSE.point, c = t.rightSE.point, f = Q(e, l) && this.comparePoint(l) === 0, a = Q(n, i) && t.comparePoint(i) === 0, s = Q(e, c) && this.comparePoint(c) === 0, h = Q(n, u) && t.comparePoint(u) === 0;
-    if (a && f)
-      return h && !s ? u : !h && s ? c : null;
-    if (a)
-      return s && i.x === c.x && i.y === c.y ? null : i;
-    if (f)
-      return h && u.x === l.x && u.y === l.y ? null : l;
-    if (h && s) return null;
-    if (h) return u;
-    if (s) return c;
-    const g = ae(i, this.vector(), l, t.vector());
-    return g === null || !Q(r, g) ? null : U.round(g.x, g.y);
+    const f = this.leftSE.point, a = this.rightSE.point, c = t.leftSE.point, E = t.rightSE.point, d = ae(e, c) && this.comparePoint(c) === 0, T = ae(n, f) && t.comparePoint(f) === 0, b = ae(e, E) && this.comparePoint(E) === 0, P = ae(n, a) && t.comparePoint(a) === 0;
+    if (T && d)
+      return P && !b ? a : !P && b ? E : null;
+    if (T)
+      return b && f.x.eq(E.x) && f.y.eq(E.y) ? null : f;
+    if (d)
+      return P && a.x.eq(c.x) && a.y.eq(c.y) ? null : c;
+    if (P && b) return null;
+    if (P) return a;
+    if (b) return E;
+    const N = At(f, this.vector(), c, t.vector());
+    return N === null || !ae(r, N) ? null : le.snap(N);
   }
   /**
    * Split the given segment into multiple segments on the given points.
@@ -994,10 +1702,15 @@ class z {
    * Warning: input array of points is modified
    */
   split(t) {
-    const e = [], n = t.events !== void 0, r = new R(t, !0), i = new R(t, !1), u = this.rightSE;
-    this.replaceRightSE(i), e.push(i), e.push(r);
-    const l = new z(r, u, this.rings.slice(), this.windings.slice());
-    return R.comparePoints(l.leftSE.point, l.rightSE.point) > 0 && l.swapEvents(), R.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (r.checkForConsuming(), i.checkForConsuming()), e;
+    const e = [], n = t.events !== void 0, r = new ie(t, !0), f = new ie(t, !1), a = this.rightSE;
+    this.replaceRightSE(f), e.push(f), e.push(r);
+    const c = new Ee(
+      r,
+      a,
+      this.rings.slice(),
+      this.windings.slice()
+    );
+    return ie.comparePoints(c.leftSE.point, c.rightSE.point) > 0 && c.swapEvents(), ie.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (r.checkForConsuming(), f.checkForConsuming()), e;
   }
   /* Swap which event is left and right */
   swapEvents() {
@@ -1012,19 +1725,19 @@ class z {
     let e = this, n = t;
     for (; e.consumedBy; ) e = e.consumedBy;
     for (; n.consumedBy; ) n = n.consumedBy;
-    const r = z.compare(e, n);
+    const r = Ee.compare(e, n);
     if (r !== 0) {
       if (r > 0) {
-        const i = e;
-        e = n, n = i;
+        const f = e;
+        e = n, n = f;
       }
       if (e.prev === n) {
-        const i = e;
-        e = n, n = i;
+        const f = e;
+        e = n, n = f;
       }
-      for (let i = 0, u = n.rings.length; i < u; i++) {
-        const l = n.rings[i], c = n.windings[i], f = e.rings.indexOf(l);
-        f === -1 ? (e.rings.push(l), e.windings.push(c)) : e.windings[f] += c;
+      for (let f = 0, a = n.rings.length; f < a; f++) {
+        const c = n.rings[f], E = n.windings[f], d = e.rings.indexOf(c);
+        d === -1 ? (e.rings.push(c), e.windings.push(E)) : e.windings[d] += E;
       }
       n.rings = null, n.windings = null, n.consumedBy = e, n.leftSE.consumedBy = e.leftSE, n.rightSE.consumedBy = e.rightSE;
     }
@@ -1035,11 +1748,12 @@ class z {
   }
   beforeState() {
     if (this._beforeState !== void 0) return this._beforeState;
-    if (!this.prev) this._beforeState = {
-      rings: [],
-      windings: [],
-      multiPolys: []
-    };
+    if (!this.prev)
+      this._beforeState = {
+        rings: [],
+        windings: [],
+        multiPolys: []
+      };
     else {
       const t = this.prev.consumedBy || this.prev;
       this._beforeState = t.afterState();
@@ -1055,25 +1769,25 @@ class z {
       multiPolys: []
     };
     const e = this._afterState.rings, n = this._afterState.windings, r = this._afterState.multiPolys;
-    for (let l = 0, c = this.rings.length; l < c; l++) {
-      const f = this.rings[l], a = this.windings[l], s = e.indexOf(f);
-      s === -1 ? (e.push(f), n.push(a)) : n[s] += a;
-    }
-    const i = [], u = [];
-    for (let l = 0, c = e.length; l < c; l++) {
-      if (n[l] === 0) continue;
-      const f = e[l], a = f.poly;
-      if (u.indexOf(a) === -1)
-        if (f.isExterior) i.push(a);
+    for (let c = 0, E = this.rings.length; c < E; c++) {
+      const d = this.rings[c], T = this.windings[c], b = e.indexOf(d);
+      b === -1 ? (e.push(d), n.push(T)) : n[b] += T;
+    }
+    const f = [], a = [];
+    for (let c = 0, E = e.length; c < E; c++) {
+      if (n[c] === 0) continue;
+      const d = e[c], T = d.poly;
+      if (a.indexOf(T) === -1)
+        if (d.isExterior) f.push(T);
         else {
-          u.indexOf(a) === -1 && u.push(a);
-          const s = i.indexOf(f.poly);
-          s !== -1 && i.splice(s, 1);
+          a.indexOf(T) === -1 && a.push(T);
+          const b = f.indexOf(d.poly);
+          b !== -1 && f.splice(b, 1);
         }
     }
-    for (let l = 0, c = i.length; l < c; l++) {
-      const f = i[l].multiPoly;
-      r.indexOf(f) === -1 && r.push(f);
+    for (let c = 0, E = f.length; c < E; c++) {
+      const d = f[c].multiPoly;
+      r.indexOf(d) === -1 && r.push(d);
     }
     return this._afterState;
   }
@@ -1082,7 +1796,7 @@ class z {
     if (this.consumedBy) return !1;
     if (this._isInResult !== void 0) return this._isInResult;
     const t = this.beforeState().multiPolys, e = this.afterState().multiPolys;
-    switch (A.type) {
+    switch (Te.type) {
       case "union": {
         const n = t.length === 0, r = e.length === 0;
         this._isInResult = n !== r;
@@ -1090,7 +1804,7 @@ class z {
       }
       case "intersection": {
         let n, r;
-        t.length < e.length ? (n = t.length, r = e.length) : (n = e.length, r = t.length), this._isInResult = r === A.numMultiPolys && n < r;
+        t.length < e.length ? (n = t.length, r = e.length) : (n = e.length, r = t.length), this._isInResult = r === Te.numMultiPolys && n < r;
         break;
       }
       case "xor": {
@@ -1103,428 +1817,136 @@ class z {
         this._isInResult = n(t) !== n(e);
         break;
       }
-      default:
-        throw new Error(`Unrecognized operation type found ${A.type}`);
     }
     return this._isInResult;
   }
-}
-class Pt {
-  constructor(t, e, n) {
-    if (!Array.isArray(t) || t.length === 0)
+}, Je = class {
+  constructor(i, t, e) {
+    M(this, "poly");
+    M(this, "isExterior");
+    M(this, "segments");
+    M(this, "bbox");
+    if (!Array.isArray(i) || i.length === 0)
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-    if (this.poly = e, this.isExterior = n, this.segments = [], typeof t[0][0] != "number" || typeof t[0][1] != "number")
+    if (this.poly = t, this.isExterior = e, this.segments = [], typeof i[0][0] != "number" || typeof i[0][1] != "number")
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-    const r = U.round(t[0][0], t[0][1]);
+    const n = le.snap({ x: new ne(i[0][0]), y: new ne(i[0][1]) });
     this.bbox = {
-      ll: {
-        x: r.x,
-        y: r.y
-      },
-      ur: {
-        x: r.x,
-        y: r.y
-      }
+      ll: { x: n.x, y: n.y },
+      ur: { x: n.x, y: n.y }
     };
-    let i = r;
-    for (let u = 1, l = t.length; u < l; u++) {
-      if (typeof t[u][0] != "number" || typeof t[u][1] != "number")
+    let r = n;
+    for (let f = 1, a = i.length; f < a; f++) {
+      if (typeof i[f][0] != "number" || typeof i[f][1] != "number")
         throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-      let c = U.round(t[u][0], t[u][1]);
-      c.x === i.x && c.y === i.y || (this.segments.push(z.fromRing(i, c, this)), c.x < this.bbox.ll.x && (this.bbox.ll.x = c.x), c.y < this.bbox.ll.y && (this.bbox.ll.y = c.y), c.x > this.bbox.ur.x && (this.bbox.ur.x = c.x), c.y > this.bbox.ur.y && (this.bbox.ur.y = c.y), i = c);
+      const c = le.snap({ x: new ne(i[f][0]), y: new ne(i[f][1]) });
+      c.x.eq(r.x) && c.y.eq(r.y) || (this.segments.push(Pe.fromRing(r, c, this)), c.x.isLessThan(this.bbox.ll.x) && (this.bbox.ll.x = c.x), c.y.isLessThan(this.bbox.ll.y) && (this.bbox.ll.y = c.y), c.x.isGreaterThan(this.bbox.ur.x) && (this.bbox.ur.x = c.x), c.y.isGreaterThan(this.bbox.ur.y) && (this.bbox.ur.y = c.y), r = c);
     }
-    (r.x !== i.x || r.y !== i.y) && this.segments.push(z.fromRing(i, r, this));
+    (!n.x.eq(r.x) || !n.y.eq(r.y)) && this.segments.push(Pe.fromRing(r, n, this));
   }
   getSweepEvents() {
-    const t = [];
-    for (let e = 0, n = this.segments.length; e < n; e++) {
-      const r = this.segments[e];
-      t.push(r.leftSE), t.push(r.rightSE);
+    const i = [];
+    for (let t = 0, e = this.segments.length; t < e; t++) {
+      const n = this.segments[t];
+      i.push(n.leftSE), i.push(n.rightSE);
     }
-    return t;
+    return i;
   }
-}
-class pe {
-  constructor(t, e) {
-    if (!Array.isArray(t))
+}, qt = class {
+  constructor(i, t) {
+    M(this, "multiPoly");
+    M(this, "exteriorRing");
+    M(this, "interiorRings");
+    M(this, "bbox");
+    if (!Array.isArray(i))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-    this.exteriorRing = new Pt(t[0], this, !0), this.bbox = {
-      ll: {
-        x: this.exteriorRing.bbox.ll.x,
-        y: this.exteriorRing.bbox.ll.y
-      },
-      ur: {
-        x: this.exteriorRing.bbox.ur.x,
-        y: this.exteriorRing.bbox.ur.y
-      }
+    this.exteriorRing = new Je(i[0], this, !0), this.bbox = {
+      ll: { x: this.exteriorRing.bbox.ll.x, y: this.exteriorRing.bbox.ll.y },
+      ur: { x: this.exteriorRing.bbox.ur.x, y: this.exteriorRing.bbox.ur.y }
     }, this.interiorRings = [];
-    for (let n = 1, r = t.length; n < r; n++) {
-      const i = new Pt(t[n], this, !1);
-      i.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = i.bbox.ll.x), i.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = i.bbox.ll.y), i.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = i.bbox.ur.x), i.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = i.bbox.ur.y), this.interiorRings.push(i);
+    for (let e = 1, n = i.length; e < n; e++) {
+      const r = new Je(i[e], this, !1);
+      r.bbox.ll.x.isLessThan(this.bbox.ll.x) && (this.bbox.ll.x = r.bbox.ll.x), r.bbox.ll.y.isLessThan(this.bbox.ll.y) && (this.bbox.ll.y = r.bbox.ll.y), r.bbox.ur.x.isGreaterThan(this.bbox.ur.x) && (this.bbox.ur.x = r.bbox.ur.x), r.bbox.ur.y.isGreaterThan(this.bbox.ur.y) && (this.bbox.ur.y = r.bbox.ur.y), this.interiorRings.push(r);
     }
-    this.multiPoly = e;
+    this.multiPoly = t;
   }
   getSweepEvents() {
-    const t = this.exteriorRing.getSweepEvents();
-    for (let e = 0, n = this.interiorRings.length; e < n; e++) {
-      const r = this.interiorRings[e].getSweepEvents();
-      for (let i = 0, u = r.length; i < u; i++)
-        t.push(r[i]);
+    const i = this.exteriorRing.getSweepEvents();
+    for (let t = 0, e = this.interiorRings.length; t < e; t++) {
+      const n = this.interiorRings[t].getSweepEvents();
+      for (let r = 0, f = n.length; r < f; r++)
+        i.push(n[r]);
     }
-    return t;
+    return i;
   }
-}
-class Mt {
-  constructor(t, e) {
-    if (!Array.isArray(t))
+}, je = class {
+  constructor(i, t) {
+    M(this, "isSubject");
+    M(this, "polys");
+    M(this, "bbox");
+    if (!Array.isArray(i))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
     try {
-      typeof t[0][0][0] == "number" && (t = [t]);
+      typeof i[0][0][0] == "number" && (i = [i]);
     } catch {
     }
     this.polys = [], this.bbox = {
-      ll: {
-        x: Number.POSITIVE_INFINITY,
-        y: Number.POSITIVE_INFINITY
-      },
-      ur: {
-        x: Number.NEGATIVE_INFINITY,
-        y: Number.NEGATIVE_INFINITY
-      }
+      ll: { x: new ne(Number.POSITIVE_INFINITY), y: new ne(Number.POSITIVE_INFINITY) },
+      ur: { x: new ne(Number.NEGATIVE_INFINITY), y: new ne(Number.NEGATIVE_INFINITY) }
     };
-    for (let n = 0, r = t.length; n < r; n++) {
-      const i = new pe(t[n], this);
-      i.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = i.bbox.ll.x), i.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = i.bbox.ll.y), i.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = i.bbox.ur.x), i.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = i.bbox.ur.y), this.polys.push(i);
+    for (let e = 0, n = i.length; e < n; e++) {
+      const r = new qt(i[e], this);
+      r.bbox.ll.x.isLessThan(this.bbox.ll.x) && (this.bbox.ll.x = r.bbox.ll.x), r.bbox.ll.y.isLessThan(this.bbox.ll.y) && (this.bbox.ll.y = r.bbox.ll.y), r.bbox.ur.x.isGreaterThan(this.bbox.ur.x) && (this.bbox.ur.x = r.bbox.ur.x), r.bbox.ur.y.isGreaterThan(this.bbox.ur.y) && (this.bbox.ur.y = r.bbox.ur.y), this.polys.push(r);
     }
-    this.isSubject = e;
+    this.isSubject = t;
   }
   getSweepEvents() {
-    const t = [];
-    for (let e = 0, n = this.polys.length; e < n; e++) {
-      const r = this.polys[e].getSweepEvents();
-      for (let i = 0, u = r.length; i < u; i++)
-        t.push(r[i]);
-    }
-    return t;
-  }
-}
-class W {
-  /* Given the segments from the sweep line pass, compute & return a series
-   * of closed rings from all the segments marked to be part of the result */
-  static factory(t) {
-    const e = [];
-    for (let n = 0, r = t.length; n < r; n++) {
-      const i = t[n];
-      if (!i.isInResult() || i.ringOut) continue;
-      let u = null, l = i.leftSE, c = i.rightSE;
-      const f = [l], a = l.point, s = [];
-      for (; u = l, l = c, f.push(l), l.point !== a; )
-        for (; ; ) {
-          const h = l.getAvailableLinkedEvents();
-          if (h.length === 0) {
-            const p = f[0].point, d = f[f.length - 1].point;
-            throw new Error(`Unable to complete output ring starting at [${p.x}, ${p.y}]. Last matching segment found ends at [${d.x}, ${d.y}].`);
-          }
-          if (h.length === 1) {
-            c = h[0].otherSE;
-            break;
-          }
-          let g = null;
-          for (let p = 0, d = s.length; p < d; p++)
-            if (s[p].point === l.point) {
-              g = p;
-              break;
-            }
-          if (g !== null) {
-            const p = s.splice(g)[0], d = f.splice(p.index);
-            d.unshift(d[0].otherSE), e.push(new W(d.reverse()));
-            continue;
-          }
-          s.push({
-            index: f.length,
-            point: l.point
-          });
-          const y = l.getLeftmostComparator(u);
-          c = h.sort(y)[0].otherSE;
-          break;
-        }
-      e.push(new W(f));
-    }
-    return e;
-  }
-  constructor(t) {
-    this.events = t;
-    for (let e = 0, n = t.length; e < n; e++)
-      t[e].segment.ringOut = this;
-    this.poly = null;
-  }
-  getGeom() {
-    let t = this.events[0].point;
-    const e = [t];
-    for (let f = 1, a = this.events.length - 1; f < a; f++) {
-      const s = this.events[f].point, h = this.events[f + 1].point;
-      bt(s, t, h) !== 0 && (e.push(s), t = s);
-    }
-    if (e.length === 1) return null;
-    const n = e[0], r = e[1];
-    bt(n, t, r) === 0 && e.shift(), e.push(e[0]);
-    const i = this.isExteriorRing() ? 1 : -1, u = this.isExteriorRing() ? 0 : e.length - 1, l = this.isExteriorRing() ? e.length : -1, c = [];
-    for (let f = u; f != l; f += i) c.push([e[f].x, e[f].y]);
-    return c;
-  }
-  isExteriorRing() {
-    if (this._isExteriorRing === void 0) {
-      const t = this.enclosingRing();
-      this._isExteriorRing = t ? !t.isExteriorRing() : !0;
-    }
-    return this._isExteriorRing;
-  }
-  enclosingRing() {
-    return this._enclosingRing === void 0 && (this._enclosingRing = this._calcEnclosingRing()), this._enclosingRing;
-  }
-  /* Returns the ring that encloses this one, if any */
-  _calcEnclosingRing() {
-    let t = this.events[0];
-    for (let r = 1, i = this.events.length; r < i; r++) {
-      const u = this.events[r];
-      R.compare(t, u) > 0 && (t = u);
-    }
-    let e = t.segment.prevInResult(), n = e ? e.prevInResult() : null;
-    for (; ; ) {
-      if (!e) return null;
-      if (!n) return e.ringOut;
-      if (n.ringOut !== e.ringOut)
-        return n.ringOut.enclosingRing() !== e.ringOut ? e.ringOut : e.ringOut.enclosingRing();
-      e = n.prevInResult(), n = e ? e.prevInResult() : null;
-    }
-  }
-}
-class Rt {
-  constructor(t) {
-    this.exteriorRing = t, t.poly = this, this.interiorRings = [];
-  }
-  addInterior(t) {
-    this.interiorRings.push(t), t.poly = this;
-  }
-  getGeom() {
-    const t = [this.exteriorRing.getGeom()];
-    if (t[0] === null) return null;
-    for (let e = 0, n = this.interiorRings.length; e < n; e++) {
-      const r = this.interiorRings[e].getGeom();
-      r !== null && t.push(r);
+    const i = [];
+    for (let t = 0, e = this.polys.length; t < e; t++) {
+      const n = this.polys[t].getSweepEvents();
+      for (let r = 0, f = n.length; r < f; r++)
+        i.push(n[r]);
     }
-    return t;
+    return i;
   }
-}
-class ye {
-  constructor(t) {
-    this.rings = t, this.polys = this._composePolys(t);
-  }
-  getGeom() {
-    const t = [];
-    for (let e = 0, n = this.polys.length; e < n; e++) {
-      const r = this.polys[e].getGeom();
-      r !== null && t.push(r);
-    }
-    return t;
-  }
-  _composePolys(t) {
-    const e = [];
-    for (let n = 0, r = t.length; n < r; n++) {
-      const i = t[n];
-      if (!i.poly)
-        if (i.isExteriorRing()) e.push(new Rt(i));
-        else {
-          const u = i.enclosingRing();
-          u.poly || e.push(new Rt(u)), u.poly.addInterior(i);
-        }
-    }
-    return e;
-  }
-}
-class xe {
-  constructor(t) {
-    let e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : z.compare;
-    this.queue = t, this.tree = new lt(e), this.segments = [];
-  }
-  process(t) {
-    const e = t.segment, n = [];
-    if (t.consumedBy)
-      return t.isLeft ? this.queue.remove(t.otherSE) : this.tree.remove(e), n;
-    const r = t.isLeft ? this.tree.add(e) : this.tree.find(e);
-    if (!r) throw new Error(`Unable to find segment #${e.id} [${e.leftSE.point.x}, ${e.leftSE.point.y}] -> [${e.rightSE.point.x}, ${e.rightSE.point.y}] in SweepLine tree.`);
-    let i = r, u = r, l, c;
-    for (; l === void 0; )
-      i = this.tree.prev(i), i === null ? l = null : i.key.consumedBy === void 0 && (l = i.key);
-    for (; c === void 0; )
-      u = this.tree.next(u), u === null ? c = null : u.key.consumedBy === void 0 && (c = u.key);
-    if (t.isLeft) {
-      let f = null;
-      if (l) {
-        const s = l.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (f = s), !l.isAnEndpoint(s))) {
-          const h = this._splitSafely(l, s);
-          for (let g = 0, y = h.length; g < y; g++)
-            n.push(h[g]);
-        }
-      }
-      let a = null;
-      if (c) {
-        const s = c.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (a = s), !c.isAnEndpoint(s))) {
-          const h = this._splitSafely(c, s);
-          for (let g = 0, y = h.length; g < y; g++)
-            n.push(h[g]);
-        }
-      }
-      if (f !== null || a !== null) {
-        let s = null;
-        f === null ? s = a : a === null ? s = f : s = R.comparePoints(f, a) <= 0 ? f : a, this.queue.remove(e.rightSE), n.push(e.rightSE);
-        const h = e.split(s);
-        for (let g = 0, y = h.length; g < y; g++)
-          n.push(h[g]);
-      }
-      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = l);
-    } else {
-      if (l && c) {
-        const f = l.getIntersection(c);
-        if (f !== null) {
-          if (!l.isAnEndpoint(f)) {
-            const a = this._splitSafely(l, f);
-            for (let s = 0, h = a.length; s < h; s++)
-              n.push(a[s]);
-          }
-          if (!c.isAnEndpoint(f)) {
-            const a = this._splitSafely(c, f);
-            for (let s = 0, h = a.length; s < h; s++)
-              n.push(a[s]);
-          }
-        }
-      }
-      this.tree.remove(e);
-    }
-    return n;
-  }
-  /* Safely split a segment that is currently in the datastructures
-   * IE - a segment other than the one that is currently being processed. */
-  _splitSafely(t, e) {
-    this.tree.remove(t);
-    const n = t.rightSE;
-    this.queue.remove(n);
-    const r = t.split(e);
-    return r.push(n), t.consumedBy === void 0 && this.tree.add(t), r;
-  }
-}
-const Lt = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, de = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6;
-class ve {
-  run(t, e, n) {
-    A.type = t, U.reset();
-    const r = [new Mt(e, !0)];
-    for (let s = 0, h = n.length; s < h; s++)
-      r.push(new Mt(n[s], !1));
-    if (A.numMultiPolys = r.length, A.type === "difference") {
-      const s = r[0];
-      let h = 1;
-      for (; h < r.length; )
-        it(r[h].bbox, s.bbox) !== null ? h++ : r.splice(h, 1);
-    }
-    if (A.type === "intersection")
-      for (let s = 0, h = r.length; s < h; s++) {
-        const g = r[s];
-        for (let y = s + 1, p = r.length; y < p; y++)
-          if (it(g.bbox, r[y].bbox) === null) return [];
-      }
-    const i = new lt(R.compare);
-    for (let s = 0, h = r.length; s < h; s++) {
-      const g = r[s].getSweepEvents();
-      for (let y = 0, p = g.length; y < p; y++)
-        if (i.insert(g[y]), i.size > Lt)
-          throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big).");
-    }
-    const u = new xe(i);
-    let l = i.size, c = i.pop();
-    for (; c; ) {
-      const s = c.key;
-      if (i.size === l) {
-        const g = s.segment;
-        throw new Error(`Unable to pop() ${s.isLeft ? "left" : "right"} SweepEvent [${s.point.x}, ${s.point.y}] from segment #${g.id} [${g.leftSE.point.x}, ${g.leftSE.point.y}] -> [${g.rightSE.point.x}, ${g.rightSE.point.y}] from queue.`);
-      }
-      if (i.size > Lt)
-        throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big).");
-      if (u.segments.length > de)
-        throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments).");
-      const h = u.process(s);
-      for (let g = 0, y = h.length; g < y; g++) {
-        const p = h[g];
-        p.consumedBy === void 0 && i.insert(p);
-      }
-      l = i.size, c = i.pop();
-    }
-    U.reset();
-    const f = W.factory(u.segments);
-    return new ye(f).getGeom();
-  }
-}
-const A = new ve(), me = function(o) {
-  for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
-    e[n - 1] = arguments[n];
-  return A.run("union", o, e);
-}, we = function(o) {
-  for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
-    e[n - 1] = arguments[n];
-  return A.run("intersection", o, e);
-}, Ee = function(o) {
-  for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
-    e[n - 1] = arguments[n];
-  return A.run("xor", o, e);
-}, be = function(o) {
-  for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
-    e[n - 1] = arguments[n];
-  return A.run("difference", o, e);
-};
-var Ft = {
-  union: me,
-  intersection: we,
-  xor: Ee,
-  difference: be
-};
-function Se(o) {
+}, Dt = (i, ...t) => Te.run("union", i, t), zt = (i, ...t) => Te.run("difference", i, t);
+le.set;
+function Ut(i) {
   const t = [];
-  if (st(o, (r) => {
+  if (Ge(i, (r) => {
     t.push(r.coordinates);
   }), t.length < 2)
     throw new Error("Must have at least two features");
-  const e = o.features[0].properties || {}, n = Ft.difference(t[0], ...t.slice(1));
-  return n.length === 0 ? null : n.length === 1 ? ot(n[0], e) : At(n, e);
+  const e = i.features[0].properties || {}, n = zt(t[0], ...t.slice(1));
+  return n.length === 0 ? null : n.length === 1 ? Be(n[0], e) : rt(n, e);
 }
-var _e = Se;
-function Pe(o) {
-  if (!o)
-    throw new Error("geojson is required");
+var Vt = Ut;
+function $t(i) {
+  if (!i) throw new Error("geojson is required");
   var t = [];
-  return Dt(o, function(e) {
+  return St(i, function(e) {
     t.push(e);
-  }), H(t);
+  }), Ce(t);
 }
-var Me = Pe;
-function Re(o, t = {}) {
+var Kt = $t;
+function Xt(i, t = {}) {
   const e = [];
-  if (st(o, (r) => {
+  if (Ge(i, (r) => {
     e.push(r.coordinates);
   }), e.length < 2)
     throw new Error("Must have at least 2 geometries");
-  const n = Ft.union(e[0], ...e.slice(1));
-  return n.length === 0 ? null : n.length === 1 ? ot(n[0], t.properties) : At(n, t.properties);
+  const n = Dt(e[0], ...e.slice(1));
+  return n.length === 0 ? null : n.length === 1 ? Be(n[0], t.properties) : rt(n, t.properties);
 }
-var Le = Re;
-function It(o) {
-  const t = [...o];
+var Yt = Xt;
+function Qe(i) {
+  const t = [...i];
   return t[2] < t[0] && (Math.abs((t[0] + t[2] + 360) / 2) > Math.abs((t[0] - 360 + t[2]) / 2) ? t[0] -= 360 : t[2] += 360), t;
 }
-function kt(o, t) {
-  const e = _e(
-    H([
-      ot([
+function et(i, t) {
+  const e = Vt(
+    Ce([
+      Be([
         [
           [180, 90],
           [-180, 90],
@@ -1533,56 +1955,56 @@ function kt(o, t) {
           [180, 90]
         ]
       ]),
-      o
+      i
     ])
   );
   if (!e)
     return;
   e.properties = { isMask: !0 };
-  const n = It(yt(o)), r = (n[2] - n[0]) / 360 / 1e3, i = n[0] < -180, u = n[2] > 180, l = Me(o);
-  if (l.features.length > 1 && (i || u))
-    for (const c of l.features) {
-      const f = It(yt(c));
-      if (u && f[0] < -180 + r)
-        for (const a of c.geometry.coordinates)
-          for (const s of a)
-            s[0] += 360 - r;
-      if (i && f[2] > 180 - r)
-        for (const a of c.geometry.coordinates)
-          for (const s of a)
-            s[0] -= 360 - r;
+  const n = Qe(Ke(i)), r = (n[2] - n[0]) / 360 / 1e3, f = n[0] < -180, a = n[2] > 180, c = Kt(i);
+  if (c.features.length > 1 && (f || a))
+    for (const E of c.features) {
+      const d = Qe(Ke(E));
+      if (a && d[0] < -180 + r)
+        for (const T of E.geometry.coordinates)
+          for (const b of T)
+            b[0] += 360 - r;
+      if (f && d[2] > 180 - r)
+        for (const T of E.geometry.coordinates)
+          for (const b of T)
+            b[0] -= 360 - r;
     }
   t(
-    H([
-      l.features.length < 2 ? o : Le(l) ?? o,
+    Ce([
+      c.features.length < 2 ? i : Yt(c) ?? i,
       e
     ])
   );
 }
-const Ct = "EPSG:4326";
-function Ie(o) {
-  var i;
-  const t = o.getProperties(), { isMask: e } = t, n = (i = o.getGeometry()) == null ? void 0 : i.getType(), r = e ? 0 : n === "LineString" || n === "MultiLineString" ? 3 : 2;
-  return new Vt({
-    stroke: e ? void 0 : new pt({
+const tt = "EPSG:4326";
+function Wt(i) {
+  var f;
+  const t = i.getProperties(), { isMask: e } = t, n = (f = i.getGeometry()) == null ? void 0 : f.getType(), r = e ? 0 : n === "LineString" || n === "MultiLineString" ? 3 : 2;
+  return new wt({
+    stroke: e ? void 0 : new $e({
       color: "#3170fe",
       lineDash: [r, r],
       width: r,
       lineCap: "butt"
     }),
-    fill: e ? new gt({
+    fill: e ? new Ve({
       color: "#00000020"
     }) : void 0,
-    image: new Yt({
+    image: new xt({
       src: `/icons/marker_${t.isReverse ? "reverse" : t.isSelected ? "selected" : "unselected"}.svg`,
       anchor: [0.5, 1]
     }),
     zIndex: t.isSelected ? 2 : t.isReverse ? 0 : 1,
-    text: t.isSelected && t.tooltip ? new jt({
-      backgroundFill: new gt({ color: "white" }),
+    text: t.isSelected && t.tooltip ? new Et({
+      backgroundFill: new Ve({ color: "white" }),
       text: t.tooltip,
       offsetY: -40,
-      backgroundStroke: new pt({
+      backgroundStroke: new $e({
         color: "white",
         lineJoin: "round",
         width: 3
@@ -1591,162 +2013,162 @@ function Ie(o) {
     }) : void 0
   });
 }
-function Te(o, t = {}, e = {}, n = Ie) {
-  let r = -1, i, u, l, c = !1;
-  const f = new Tt({
+function oi(i, t = {}, e = {}, n = Wt) {
+  let r = -1, f, a, c, E = !1;
+  const d = new gt({
     updateWhileAnimating: !0
   });
-  o.addLayer(f);
-  const a = new Ut({});
-  f.setSource(a), f.setStyle(n), o.on("click", (y) => {
-    o.forEachFeatureAtPixel(y.pixel, (p) => {
-      const d = p.getId();
-      if (d)
-        return y.stopPropagation(), u == null || u({ type: "markerClick", id: d }), p;
+  i.addLayer(d);
+  const T = new dt({});
+  d.setSource(T), d.setStyle(n), i.on("click", (_) => {
+    i.forEachFeatureAtPixel(_.pixel, (L) => {
+      const A = L.getId();
+      if (A)
+        return _.stopPropagation(), a == null || a({ type: "markerClick", id: A }), L;
     });
-  }), o.on("pointermove", (y) => {
-    const p = o.forEachFeatureAtPixel(y.pixel, (d) => d.getId());
-    i !== p && (i && (u == null || u({
+  }), i.on("pointermove", (_) => {
+    const L = i.forEachFeatureAtPixel(_.pixel, (A) => A.getId());
+    f !== L && (f && (a == null || a({
       type: "markerMouseLeave",
-      id: i
-    })), p && (u == null || u({
+      id: f
+    })), L && (a == null || a({
       type: "markerMouseEnter",
-      id: p
-    })), o.getTargetElement().style.cursor = p ? "pointer" : c ? "crosshair" : "", i = p);
+      id: L
+    })), i.getTargetElement().style.cursor = L ? "pointer" : E ? "crosshair" : "", f = L);
   });
-  function s() {
-    return Qt() ?? o.getView().getProjection();
+  function b() {
+    return mt() ?? i.getView().getProjection();
   }
-  function h(y) {
-    return y.transform(Ct, s());
+  function P(_) {
+    return _.transform(tt, b());
   }
-  const g = (y) => {
-    u == null || u({
+  const N = (_) => {
+    a == null || a({
       type: "mapClick",
-      coordinates: at(y.coordinate, s())
+      coordinates: Ue(_.coordinate, b())
     });
   };
   return {
-    setEventHandler(y) {
-      y ? (u = y, o.on("click", g)) : (u = void 0, o.un("click", g));
+    setEventHandler(_) {
+      _ ? (a = _, i.on("click", N)) : (a = void 0, i.un("click", N));
     },
-    flyTo(y, p) {
-      o.getView().animate({
-        center: V(y, s()),
-        ...p ? { zoom: p } : {},
+    flyTo(_, L) {
+      i.getView().animate({
+        center: me(_, b()),
+        ...L ? { zoom: L } : {},
         duration: 2e3,
         ...t
       });
     },
-    fitBounds(y, p, d) {
-      o.getView().fit(qt(y, Ct, s()), {
-        padding: [p, p, p, p],
-        ...d ? { maxZoom: d } : {},
+    fitBounds(_, L, A) {
+      i.getView().fit(yt(_, tt, b()), {
+        padding: [L, L, L, L],
+        ...A ? { maxZoom: A } : {},
         duration: 2e3,
         ...e
       });
     },
-    indicateReverse(y) {
-      c = y, o.getTargetElement().style.cursor = y ? "crosshair" : "";
+    indicateReverse(_) {
+      E = _, i.getTargetElement().style.cursor = _ ? "crosshair" : "";
     },
-    setReverseMarker(y) {
-      l ? y ? l.getGeometry().setCoordinates(
-        V(y, s())
-      ) : (a.removeFeature(l), l.dispose(), l = void 0) : y && (l = new N(
-        new Z(V(y, s()))
-      ), l.setProperties({ isReverse: !0 }), a.addFeature(l));
+    setReverseMarker(_) {
+      c ? _ ? c.getGeometry().setCoordinates(
+        me(_, b())
+      ) : (T.removeFeature(c), c.dispose(), c = void 0) : _ && (c = new se(
+        new Re(me(_, b()))
+      ), c.setProperties({ isReverse: !0 }), T.addFeature(c));
     },
-    setFeatures(y, p, d) {
-      function x(v) {
-        var w;
-        if (v)
-          for (const m of v.features) {
-            const E = m.geometry.type === "Polygon" ? new ut(m.geometry.coordinates) : m.geometry.type === "MultiPolygon" ? new ft(m.geometry.coordinates) : null;
-            E && a.addFeature(
-              new N({
-                isMask: !!((w = m.properties) != null && w.isMask),
-                geometry: h(E)
+    setFeatures(_, L, A) {
+      function V(S) {
+        var F;
+        if (S)
+          for (const B of S.features) {
+            const Y = B.geometry.type === "Polygon" ? new Fe(B.geometry.coordinates) : B.geometry.type === "MultiPolygon" ? new qe(B.geometry.coordinates) : null;
+            Y && T.addFeature(
+              new se({
+                isMask: !!((F = B.properties) != null && F.isMask),
+                geometry: P(Y)
               })
             );
           }
       }
-      a.clear(), l && a.addFeature(l);
-      t: if (p) {
-        let v = !1;
-        if (p.geometry.type === "GeometryCollection") {
-          const w = p.geometry.geometries.map(
-            (m) => m.type === "Polygon" ? new ut(m.coordinates) : m.type === "MultiPolygon" ? new ft(m.coordinates) : null
-          ).filter((m) => !!m);
-          if (w.length > 0)
-            a.addFeature(
-              new N(h(new $t(w)))
-            ), v = !0;
+      T.clear(), c && T.addFeature(c);
+      e: if (L) {
+        let S = !1;
+        if (L.geometry.type === "GeometryCollection") {
+          const F = L.geometry.geometries.map(
+            (B) => B.type === "Polygon" ? new Fe(B.coordinates) : B.type === "MultiPolygon" ? new qe(B.coordinates) : null
+          ).filter((B) => !!B);
+          if (F.length > 0)
+            T.addFeature(
+              new se(P(new pt(F)))
+            ), S = !0;
           else
-            for (const m of p.geometry.geometries)
-              m.type === "LineString" ? (a.addFeature(
-                new N(
-                  h(new ct(m.coordinates))
+            for (const B of L.geometry.geometries)
+              B.type === "LineString" ? (T.addFeature(
+                new se(
+                  P(new De(B.coordinates))
                 )
-              ), v = !0) : m.type === "MultiLineString" && a.addFeature(
-                new N(
-                  h(new ht(m.coordinates))
+              ), S = !0) : B.type === "MultiLineString" && T.addFeature(
+                new se(
+                  P(new ze(B.coordinates))
                 )
-              ), v = !0;
+              ), S = !0;
         }
-        if (!v) {
-          if (p.geometry.type === "Polygon")
-            kt(p, x);
-          else if (p.geometry.type === "MultiPolygon")
-            kt(p, x);
-          else if (p.geometry.type === "LineString") {
-            a.addFeature(
-              new N(
-                h(new ct(p.geometry.coordinates))
+        if (!S) {
+          if (L.geometry.type === "Polygon")
+            et(L, V);
+          else if (L.geometry.type === "MultiPolygon")
+            et(L, V);
+          else if (L.geometry.type === "LineString") {
+            T.addFeature(
+              new se(
+                P(new De(L.geometry.coordinates))
               )
             );
-            break t;
-          } else if (p.geometry.type === "MultiLineString") {
-            a.addFeature(
-              new N(
-                h(new ht(p.geometry.coordinates))
+            break e;
+          } else if (L.geometry.type === "MultiLineString") {
+            T.addFeature(
+              new se(
+                P(new ze(L.geometry.coordinates))
               )
             );
-            break t;
+            break e;
           }
         }
-        if (!d && p.geometry.type !== "Point")
-          break t;
-        a.addFeature(new N(h(new Z(p.center))));
+        if (!A && L.geometry.type !== "Point")
+          break e;
+        T.addFeature(new se(P(new Re(L.center))));
       }
-      for (const v of y ?? []) {
-        if (v === p)
+      for (const S of _ ?? []) {
+        if (S === L)
           continue;
-        const w = new N(
-          new Z(V(v.center, s()))
+        const F = new se(
+          new Re(me(S.center, b()))
         );
-        w.setId(v.id), w.setProperties({
-          fuzzy: !!v.matching_text,
-          tooltip: v.place_type[0] === "reverse" ? v.place_name : v.place_name.replace(/,.*/, "")
-        }), a.addFeature(w);
+        F.setId(S.id), F.setProperties({
+          fuzzy: !!S.matching_text,
+          tooltip: S.place_type[0] === "reverse" ? S.place_name : S.place_name.replace(/,.*/, "")
+        }), T.addFeature(F);
       }
     },
-    setSelectedMarker(y) {
-      var x, v, w;
-      const p = a.getFeatures(), d = (x = p[0]) != null && x.getProperties().isReverse ? 1 : 0;
-      r > -1 && ((v = p[r + d]) == null || v.setProperties({
+    setSelectedMarker(_) {
+      var V, S, F;
+      const L = T.getFeatures(), A = (V = L[0]) != null && V.getProperties().isReverse ? 1 : 0;
+      r > -1 && ((S = L[r + A]) == null || S.setProperties({
         isSelected: !1
-      })), y > -1 && ((w = p[y + d]) == null || w.setProperties({
+      })), _ > -1 && ((F = L[_ + A]) == null || F.setProperties({
         isSelected: !0
-      })), r = y;
+      })), r = _;
     },
     getCenterAndZoom() {
-      const y = o.getView(), p = y.getCenter(), d = y.getZoom();
-      if (!(!p || d === void 0))
-        return [d, ...at(p, s())];
+      const _ = i.getView(), L = _.getCenter(), A = _.getZoom();
+      if (!(!L || A === void 0))
+        return [A, ...Ue(L, b())];
     }
   };
 }
 export {
-  Te as createOpenLayersMapController
+  oi as createOpenLayersMapController
 };
 //# sourceMappingURL=openlayers-controller.js.map