@maptiler/geocoding-control 1.4.2-dev.3 → 2.0.0-rc.2

package/leaflet-controller.js

@@ -1,7 +1,7 @@
-var re = Object.defineProperty;
-var ie = (r, t, e) => t in r ? re(r, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[t] = e;
-var it = (r, t, e) => ie(r, typeof t != "symbol" ? t + "" : t, e);
-import * as F from "leaflet";
+var ie = Object.defineProperty;
+var oe = (r, t, e) => t in r ? ie(r, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[t] = e;
+var it = (r, t, e) => oe(r, typeof t != "symbol" ? t + "" : t, e);
+import * as T from "leaflet";
 function V(r, 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 = r, n;
@@ -27,49 +27,49 @@ function Z(r, t = {}) {
   const e = { type: "FeatureCollection" };
   return t.id && (e.id = t.id), t.bbox && (e.bbox = t.bbox), e.features = r, e;
 }
-function Qt(r, t, e = {}) {
+function Ut(r, t, e = {}) {
   return V({
     type: "MultiPolygon",
     coordinates: r
   }, t, e);
 }
-function Ut(r, t, e) {
+function Yt(r, t, e) {
   if (r !== null)
-    for (var n, i, o, l, u, c, f, p = 0, s = 0, a, h = r.type, g = h === "FeatureCollection", y = h === "Feature", d = g ? r.features.length : 1, x = 0; x < d; x++) {
-      f = g ? r.features[x].geometry : y ? r.geometry : r, a = f ? f.type === "GeometryCollection" : !1, u = a ? f.geometries.length : 1;
-      for (var v = 0; v < u; v++) {
-        var m = 0, w = 0;
-        if (l = a ? f.geometries[v] : f, l !== null) {
-          c = l.coordinates;
-          var E = l.type;
+    for (var n, i, o, f, s, c, u, p = 0, l = 0, h, a = r.type, y = a === "FeatureCollection", g = a === "Feature", x = y ? r.features.length : 1, d = 0; d < x; d++) {
+      u = y ? r.features[d].geometry : g ? r.geometry : r, h = u ? u.type === "GeometryCollection" : !1, s = h ? u.geometries.length : 1;
+      for (var m = 0; m < s; m++) {
+        var v = 0, w = 0;
+        if (f = h ? u.geometries[m] : u, f !== null) {
+          c = f.coordinates;
+          var E = f.type;
           switch (p = 0, E) {
             case null:
               break;
             case "Point":
               if (t(
                 c,
-                s,
-                x,
-                m,
+                l,
+                d,
+                v,
                 w
               ) === !1)
                 return !1;
-              s++, m++;
+              l++, v++;
               break;
             case "LineString":
             case "MultiPoint":
               for (n = 0; n < c.length; n++) {
                 if (t(
                   c[n],
-                  s,
-                  x,
-                  m,
+                  l,
+                  d,
+                  v,
                   w
                 ) === !1)
                   return !1;
-                s++, E === "MultiPoint" && m++;
+                l++, E === "MultiPoint" && v++;
               }
-              E === "LineString" && m++;
+              E === "LineString" && v++;
               break;
             case "Polygon":
             case "MultiLineString":
@@ -77,17 +77,17 @@ function Ut(r, t, e) {
                 for (i = 0; i < c[n].length - p; i++) {
                   if (t(
                     c[n][i],
-                    s,
-                    x,
-                    m,
+                    l,
+                    d,
+                    v,
                     w
                   ) === !1)
                     return !1;
-                  s++;
+                  l++;
                 }
-                E === "MultiLineString" && m++, E === "Polygon" && w++;
+                E === "MultiLineString" && v++, E === "Polygon" && w++;
               }
-              E === "Polygon" && m++;
+              E === "Polygon" && v++;
               break;
             case "MultiPolygon":
               for (n = 0; n < c.length; n++) {
@@ -95,22 +95,22 @@ function Ut(r, t, e) {
                   for (o = 0; o < c[n][i].length - p; o++) {
                     if (t(
                       c[n][i][o],
-                      s,
-                      x,
-                      m,
+                      l,
+                      d,
+                      v,
                       w
                     ) === !1)
                       return !1;
-                    s++;
+                    l++;
                   }
                   w++;
                 }
-                m++;
+                v++;
               }
               break;
             case "GeometryCollection":
-              for (n = 0; n < l.geometries.length; n++)
-                if (Ut(l.geometries[n], t) === !1)
+              for (n = 0; n < f.geometries.length; n++)
+                if (Yt(f.geometries[n], t) === !1)
                   return !1;
               break;
             default:
@@ -120,17 +120,17 @@ function Ut(r, t, e) {
       }
     }
 }
-function mt(r, t) {
-  var e, n, i, o, l, u, c, f, p, s, a = 0, h = r.type === "FeatureCollection", g = r.type === "Feature", y = h ? r.features.length : 1;
-  for (e = 0; e < y; e++) {
-    for (u = h ? r.features[e].geometry : g ? r.geometry : r, f = h ? r.features[e].properties : g ? r.properties : {}, p = h ? r.features[e].bbox : g ? r.bbox : void 0, s = h ? r.features[e].id : g ? r.id : void 0, c = u ? u.type === "GeometryCollection" : !1, l = c ? u.geometries.length : 1, i = 0; i < l; i++) {
-      if (o = c ? u.geometries[i] : u, o === null) {
+function vt(r, t) {
+  var e, n, i, o, f, s, c, u, p, l, h = 0, a = r.type === "FeatureCollection", y = r.type === "Feature", g = a ? r.features.length : 1;
+  for (e = 0; e < g; e++) {
+    for (s = a ? r.features[e].geometry : y ? r.geometry : r, u = a ? r.features[e].properties : y ? r.properties : {}, p = a ? r.features[e].bbox : y ? r.bbox : void 0, l = a ? r.features[e].id : y ? r.id : void 0, c = s ? s.type === "GeometryCollection" : !1, f = c ? s.geometries.length : 1, i = 0; i < f; i++) {
+      if (o = c ? s.geometries[i] : s, o === null) {
         if (t(
           null,
-          a,
-          f,
+          h,
+          u,
           p,
-          s
+          l
         ) === !1)
           return !1;
         continue;
@@ -144,10 +144,10 @@ function mt(r, t) {
         case "MultiPolygon": {
           if (t(
             o,
-            a,
-            f,
+            h,
+            u,
             p,
-            s
+            l
           ) === !1)
             return !1;
           break;
@@ -156,10 +156,10 @@ function mt(r, t) {
           for (n = 0; n < o.geometries.length; n++)
             if (t(
               o.geometries[n],
-              a,
-              f,
+              h,
+              u,
               p,
-              s
+              l
             ) === !1)
               return !1;
           break;
@@ -168,25 +168,25 @@ function mt(r, t) {
           throw new Error("Unknown Geometry Type");
       }
     }
-    a++;
+    h++;
   }
 }
-function oe(r, t) {
-  mt(r, function(e, n, i, o, l) {
-    var u = e === null ? null : e.type;
-    switch (u) {
+function se(r, t) {
+  vt(r, function(e, n, i, o, f) {
+    var s = e === null ? null : e.type;
+    switch (s) {
       case null:
       case "Point":
       case "LineString":
       case "Polygon":
         return t(
-          V(e, i, { bbox: o, id: l }),
+          V(e, i, { bbox: o, id: f }),
           n,
           0
         ) === !1 ? !1 : void 0;
     }
     var c;
-    switch (u) {
+    switch (s) {
       case "MultiPoint":
         c = "Point";
         break;
@@ -197,33 +197,33 @@ function oe(r, t) {
         c = "Polygon";
         break;
     }
-    for (var f = 0; f < e.coordinates.length; f++) {
-      var p = e.coordinates[f], s = {
+    for (var u = 0; u < e.coordinates.length; u++) {
+      var p = e.coordinates[u], l = {
         type: c,
         coordinates: p
       };
-      if (t(V(s, i), n, f) === !1)
+      if (t(V(l, i), n, u) === !1)
         return !1;
     }
   });
 }
-function se(r, t = {}) {
+function le(r, t = {}) {
   if (r.bbox != null && t.recompute !== !0)
     return r.bbox;
   const e = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-  return Ut(r, (n) => {
+  return Yt(r, (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 ut = se;
-function le(r) {
+var ut = le;
+function ue(r) {
   if (!r)
     throw new Error("geojson is required");
   switch (r.type) {
     case "Feature":
-      return Yt(r);
+      return Dt(r);
     case "FeatureCollection":
-      return ue(r);
+      return fe(r);
     case "Point":
     case "LineString":
     case "Polygon":
@@ -231,12 +231,12 @@ function le(r) {
     case "MultiLineString":
     case "MultiPolygon":
     case "GeometryCollection":
-      return vt(r);
+      return mt(r);
     default:
       throw new Error("unknown GeoJSON type");
   }
 }
-function Yt(r) {
+function Dt(r) {
   const t = { type: "Feature" };
   return Object.keys(r).forEach((e) => {
     switch (e) {
@@ -247,16 +247,16 @@ function Yt(r) {
       default:
         t[e] = r[e];
     }
-  }), t.properties = Dt(r.properties), r.geometry == null ? t.geometry = null : t.geometry = vt(r.geometry), t;
+  }), t.properties = jt(r.properties), r.geometry == null ? t.geometry = null : t.geometry = mt(r.geometry), t;
 }
-function Dt(r) {
+function jt(r) {
   const t = {};
   return r && Object.keys(r).forEach((e) => {
     const n = r[e];
-    typeof n == "object" ? n === null ? t[e] = null : Array.isArray(n) ? t[e] = n.map((i) => i) : t[e] = Dt(n) : t[e] = n;
+    typeof n == "object" ? n === null ? t[e] = null : Array.isArray(n) ? t[e] = n.map((i) => i) : t[e] = jt(n) : t[e] = n;
   }), t;
 }
-function ue(r) {
+function fe(r) {
   const t = { type: "FeatureCollection" };
   return Object.keys(r).forEach((e) => {
     switch (e) {
@@ -266,17 +266,17 @@ function ue(r) {
       default:
         t[e] = r[e];
     }
-  }), t.features = r.features.map((e) => Yt(e)), t;
+  }), t.features = r.features.map((e) => Dt(e)), t;
 }
-function vt(r) {
+function mt(r) {
   const t = { type: r.type };
-  return r.bbox && (t.bbox = r.bbox), r.type === "GeometryCollection" ? (t.geometries = r.geometries.map((e) => vt(e)), t) : (t.coordinates = jt(r.coordinates), t);
+  return r.bbox && (t.bbox = r.bbox), r.type === "GeometryCollection" ? (t.geometries = r.geometries.map((e) => mt(e)), t) : (t.coordinates = Xt(r.coordinates), t);
 }
-function jt(r) {
+function Xt(r) {
   const t = r;
-  return typeof t[0] != "object" ? t.slice() : t.map((e) => jt(e));
+  return typeof t[0] != "object" ? t.slice() : t.map((e) => Xt(e));
 }
-var fe = le;
+var ce = ue;
 /**
  * splaytree v3.1.2
  * Fast Splay tree for Node and browser
@@ -299,67 +299,67 @@ MERCHANTABLITY OR NON-INFRINGEMENT.
 See the Apache Version 2.0 License for specific language governing permissions
 and limitations under the License.
 ***************************************************************************** */
-function ce(r, t) {
+function he(r, t) {
   var e = { label: 0, sent: function() {
     if (o[0] & 1) throw o[1];
     return o[1];
-  }, trys: [], ops: [] }, n, i, o, l;
-  return l = { next: u(0), throw: u(1), return: u(2) }, typeof Symbol == "function" && (l[Symbol.iterator] = function() {
+  }, trys: [], ops: [] }, n, i, o, f;
+  return f = { next: s(0), throw: s(1), return: s(2) }, typeof Symbol == "function" && (f[Symbol.iterator] = function() {
     return this;
-  }), l;
-  function u(f) {
+  }), f;
+  function s(u) {
     return function(p) {
-      return c([f, p]);
+      return c([u, p]);
     };
   }
-  function c(f) {
+  function c(u) {
     if (n) throw new TypeError("Generator is already executing.");
     for (; e; ) try {
-      if (n = 1, i && (o = f[0] & 2 ? i.return : f[0] ? i.throw || ((o = i.return) && o.call(i), 0) : i.next) && !(o = o.call(i, f[1])).done) return o;
-      switch (i = 0, o && (f = [f[0] & 2, o.value]), f[0]) {
+      if (n = 1, i && (o = u[0] & 2 ? i.return : u[0] ? i.throw || ((o = i.return) && o.call(i), 0) : i.next) && !(o = o.call(i, u[1])).done) return o;
+      switch (i = 0, o && (u = [u[0] & 2, o.value]), u[0]) {
         case 0:
         case 1:
-          o = f;
+          o = u;
           break;
         case 4:
-          return e.label++, { value: f[1], done: !1 };
+          return e.label++, { value: u[1], done: !1 };
         case 5:
-          e.label++, i = f[1], f = [0];
+          e.label++, i = u[1], u = [0];
           continue;
         case 7:
-          f = e.ops.pop(), e.trys.pop();
+          u = e.ops.pop(), e.trys.pop();
           continue;
         default:
-          if (o = e.trys, !(o = o.length > 0 && o[o.length - 1]) && (f[0] === 6 || f[0] === 2)) {
+          if (o = e.trys, !(o = o.length > 0 && o[o.length - 1]) && (u[0] === 6 || u[0] === 2)) {
             e = 0;
             continue;
           }
-          if (f[0] === 3 && (!o || f[1] > o[0] && f[1] < o[3])) {
-            e.label = f[1];
+          if (u[0] === 3 && (!o || u[1] > o[0] && u[1] < o[3])) {
+            e.label = u[1];
             break;
           }
-          if (f[0] === 6 && e.label < o[1]) {
-            e.label = o[1], o = f;
+          if (u[0] === 6 && e.label < o[1]) {
+            e.label = o[1], o = u;
             break;
           }
           if (o && e.label < o[2]) {
-            e.label = o[2], e.ops.push(f);
+            e.label = o[2], e.ops.push(u);
             break;
           }
           o[2] && e.ops.pop(), e.trys.pop();
           continue;
       }
-      f = t.call(r, e);
+      u = t.call(r, e);
     } catch (p) {
-      f = [6, p], i = 0;
+      u = [6, p], i = 0;
     } finally {
       n = o = 0;
     }
-    if (f[0] & 5) throw f[1];
-    return { value: f[0] ? f[1] : void 0, done: !0 };
+    if (u[0] & 5) throw u[1];
+    return { value: u[0] ? u[1] : void 0, done: !0 };
   }
 }
-var T = (
+var F = (
   /** @class */
   /* @__PURE__ */ function() {
     function r(t, e) {
@@ -368,27 +368,27 @@ var T = (
     return r;
   }()
 );
-function he(r, t) {
+function ae(r, t) {
   return r > t ? 1 : r < t ? -1 : 0;
 }
 function B(r, t, e) {
-  for (var n = new T(null, null), i = n, o = n; ; ) {
-    var l = e(r, t.key);
-    if (l < 0) {
+  for (var n = new F(null, null), i = n, o = n; ; ) {
+    var f = e(r, t.key);
+    if (f < 0) {
       if (t.left === null)
         break;
       if (e(r, t.left.key) < 0) {
-        var u = t.left;
-        if (t.left = u.right, u.right = t, t = u, t.left === null)
+        var s = t.left;
+        if (t.left = s.right, s.right = t, t = s, t.left === null)
           break;
       }
       o.left = t, o = t, t = t.left;
-    } else if (l > 0) {
+    } else if (f > 0) {
       if (t.right === null)
         break;
       if (e(r, t.right.key) > 0) {
-        var u = t.right;
-        if (t.right = u.left, u.left = t, t = u, t.right === null)
+        var s = t.right;
+        if (t.right = s.left, s.left = t, t = s, t.right === null)
           break;
       }
       i.right = t, i = t, t = t.right;
@@ -398,7 +398,7 @@ function B(r, t, e) {
   return i.right = t.left, o.left = t.right, t.left = n.right, t.right = n.left, t;
 }
 function ot(r, t, e, n) {
-  var i = new T(r, t);
+  var i = new F(r, t);
   if (e === null)
     return i.left = i.right = null, i;
   e = B(r, e, n);
@@ -414,7 +414,7 @@ function bt(r, t, e) {
   }
   return { left: n, right: i };
 }
-function ae(r, t, e) {
+function pe(r, t, e) {
   return t === null ? r : (r === null || (t = B(r.key, t, e), t.left = r), t);
 }
 function ft(r, t, e, n, i) {
@@ -429,15 +429,15 @@ var wt = (
   /** @class */
   function() {
     function r(t) {
-      t === void 0 && (t = he), this._root = null, this._size = 0, this._comparator = t;
+      t === void 0 && (t = ae), this._root = null, this._size = 0, this._comparator = t;
     }
     return r.prototype.insert = function(t, e) {
       return this._size++, this._root = ot(t, e, this._root, this._comparator);
     }, r.prototype.add = function(t, e) {
-      var n = new T(t, e);
+      var n = new F(t, e);
       this._root === null && (n.left = n.right = null, this._size++, this._root = n);
-      var i = this._comparator, o = B(t, this._root, i), l = i(t, o.key);
-      return l === 0 ? this._root = o : (l < 0 ? (n.left = o.left, n.right = o, o.left = null) : l > 0 && (n.right = o.right, n.left = o, o.right = null), this._size++, this._root = n), this._root;
+      var i = this._comparator, o = B(t, this._root, i), f = i(t, o.key);
+      return f === 0 ? this._root = o : (f < 0 ? (n.left = o.left, n.right = o, o.left = null) : f > 0 && (n.right = o.right, n.left = o, o.right = null), this._size++, this._root = n), this._root;
     }, r.prototype.remove = function(t) {
       this._root = this._remove(t, this._root, this._comparator);
     }, r.prototype._remove = function(t, e, n) {
@@ -478,15 +478,15 @@ var wt = (
         n !== null ? (i.push(n), n = n.left) : i.length !== 0 ? (n = i.pop(), t.call(e, n), n = n.right) : o = !0;
       return this;
     }, r.prototype.range = function(t, e, n, i) {
-      for (var o = [], l = this._comparator, u = this._root, c; o.length !== 0 || u; )
-        if (u)
-          o.push(u), u = u.left;
+      for (var o = [], f = this._comparator, s = this._root, c; o.length !== 0 || s; )
+        if (s)
+          o.push(s), s = s.left;
         else {
-          if (u = o.pop(), c = l(u.key, e), c > 0)
+          if (s = o.pop(), c = f(s.key, e), c > 0)
             break;
-          if (l(u.key, t) >= 0 && n.call(i, u))
+          if (f(s.key, t) >= 0 && n.call(i, s))
             return this;
-          u = u.right;
+          s = s.right;
         }
       return this;
     }, r.prototype.keys = function() {
@@ -557,15 +557,15 @@ var wt = (
     }, r.prototype.clear = function() {
       return this._root = null, this._size = 0, this;
     }, r.prototype.toList = function() {
-      return ge(this._root);
+      return ye(this._root);
     }, r.prototype.load = function(t, e, n) {
       e === void 0 && (e = []), n === void 0 && (n = !1);
       var i = t.length, o = this._comparator;
       if (n && at(t, e, 0, i - 1, o), this._root === null)
         this._root = ct(t, e, 0, i), this._size = i;
       else {
-        var l = ye(this.toList(), pe(t, e), o);
-        i = this._size + i, this._root = ht({ head: l }, 0, i);
+        var f = de(this.toList(), ge(t, e), o);
+        i = this._size + i, this._root = ht({ head: f }, 0, i);
       }
       return this;
     }, r.prototype.isEmpty = function() {
@@ -591,13 +591,13 @@ var wt = (
         return e.push(n);
       }, t), e.join("");
     }, r.prototype.update = function(t, e, n) {
-      var i = this._comparator, o = bt(t, this._root, i), l = o.left, u = o.right;
-      i(t, e) < 0 ? u = ot(e, n, u, i) : l = ot(e, n, l, i), this._root = ae(l, u, i);
+      var i = this._comparator, o = bt(t, this._root, i), f = o.left, s = o.right;
+      i(t, e) < 0 ? s = ot(e, n, s, i) : f = ot(e, n, f, i), this._root = pe(f, s, i);
     }, r.prototype.split = function(t) {
       return bt(t, this._root, this._comparator);
     }, r.prototype[Symbol.iterator] = function() {
       var t, e, n;
-      return ce(this, function(i) {
+      return he(this, function(i) {
         switch (i.label) {
           case 0:
             t = this._root, e = [], n = !1, i.label = 1;
@@ -624,66 +624,66 @@ var wt = (
 function ct(r, t, e, n) {
   var i = n - e;
   if (i > 0) {
-    var o = e + Math.floor(i / 2), l = r[o], u = t[o], c = new T(l, u);
+    var o = e + Math.floor(i / 2), f = r[o], s = t[o], c = new F(f, s);
     return c.left = ct(r, t, e, o), c.right = ct(r, t, o + 1, n), c;
   }
   return null;
 }
-function pe(r, t) {
-  for (var e = new T(null, null), n = e, i = 0; i < r.length; i++)
-    n = n.next = new T(r[i], t[i]);
+function ge(r, t) {
+  for (var e = new F(null, null), n = e, i = 0; i < r.length; i++)
+    n = n.next = new F(r[i], t[i]);
   return n.next = null, e.next;
 }
-function ge(r) {
-  for (var t = r, e = [], n = !1, i = new T(null, null), o = i; !n; )
+function ye(r) {
+  for (var t = r, e = [], n = !1, i = new F(null, null), o = i; !n; )
     t ? (e.push(t), t = t.left) : e.length > 0 ? (t = o = o.next = e.pop(), t = t.right) : n = !0;
   return o.next = null, i.next;
 }
 function ht(r, t, e) {
   var n = e - t;
   if (n > 0) {
-    var i = t + Math.floor(n / 2), o = ht(r, t, i), l = r.head;
-    return l.left = o, r.head = r.head.next, l.right = ht(r, i + 1, e), l;
+    var i = t + Math.floor(n / 2), o = ht(r, t, i), f = r.head;
+    return f.left = o, r.head = r.head.next, f.right = ht(r, i + 1, e), f;
   }
   return null;
 }
-function ye(r, t, e) {
-  for (var n = new T(null, null), i = n, o = r, l = t; o !== null && l !== null; )
-    e(o.key, l.key) < 0 ? (i.next = o, o = o.next) : (i.next = l, l = l.next), i = i.next;
-  return o !== null ? i.next = o : l !== null && (i.next = l), n.next;
+function de(r, t, e) {
+  for (var n = new F(null, null), i = n, o = r, f = t; o !== null && f !== null; )
+    e(o.key, f.key) < 0 ? (i.next = o, o = o.next) : (i.next = f, f = f.next), i = i.next;
+  return o !== null ? i.next = o : f !== null && (i.next = f), n.next;
 }
 function at(r, t, e, n, i) {
   if (!(e >= n)) {
-    for (var o = r[e + n >> 1], l = e - 1, u = n + 1; ; ) {
+    for (var o = r[e + n >> 1], f = e - 1, s = n + 1; ; ) {
       do
-        l++;
-      while (i(r[l], o) < 0);
+        f++;
+      while (i(r[f], o) < 0);
       do
-        u--;
-      while (i(r[u], o) > 0);
-      if (l >= u)
+        s--;
+      while (i(r[s], o) > 0);
+      if (f >= s)
         break;
-      var c = r[l];
-      r[l] = r[u], r[u] = c, c = t[l], t[l] = t[u], t[u] = c;
+      var c = r[f];
+      r[f] = r[s], r[s] = c, c = t[f], t[f] = t[s], t[s] = c;
     }
-    at(r, t, e, u, i), at(r, t, u + 1, n, i);
+    at(r, t, e, s, i), at(r, t, s + 1, n, i);
   }
 }
-const O = 11102230246251565e-32, S = 134217729, de = (3 + 8 * O) * O;
+const O = 11102230246251565e-32, S = 134217729, xe = (3 + 8 * O) * O;
 function st(r, t, e, n, i) {
-  let o, l, u, c, f = t[0], p = n[0], s = 0, a = 0;
-  p > f == p > -f ? (o = f, f = t[++s]) : (o = p, p = n[++a]);
-  let h = 0;
-  if (s < r && a < e)
-    for (p > f == p > -f ? (l = f + o, u = o - (l - f), f = t[++s]) : (l = p + o, u = o - (l - p), p = n[++a]), o = l, u !== 0 && (i[h++] = u); s < r && a < e; )
-      p > f == p > -f ? (l = o + f, c = l - o, u = o - (l - c) + (f - c), f = t[++s]) : (l = o + p, c = l - o, u = o - (l - c) + (p - c), p = n[++a]), o = l, u !== 0 && (i[h++] = u);
-  for (; s < r; )
-    l = o + f, c = l - o, u = o - (l - c) + (f - c), f = t[++s], o = l, u !== 0 && (i[h++] = u);
-  for (; a < e; )
-    l = o + p, c = l - o, u = o - (l - c) + (p - c), p = n[++a], o = l, u !== 0 && (i[h++] = u);
-  return (o !== 0 || h === 0) && (i[h++] = o), h;
-}
-function xe(r, t) {
+  let o, f, s, c, u = t[0], p = n[0], l = 0, h = 0;
+  p > u == p > -u ? (o = u, u = t[++l]) : (o = p, p = n[++h]);
+  let a = 0;
+  if (l < r && h < e)
+    for (p > u == p > -u ? (f = u + o, s = o - (f - u), u = t[++l]) : (f = p + o, s = o - (f - p), p = n[++h]), o = f, s !== 0 && (i[a++] = s); l < r && h < e; )
+      p > u == p > -u ? (f = o + u, c = f - o, s = o - (f - c) + (u - c), u = t[++l]) : (f = o + p, c = f - o, s = o - (f - c) + (p - c), p = n[++h]), o = f, s !== 0 && (i[a++] = s);
+  for (; l < r; )
+    f = o + u, c = f - o, s = o - (f - c) + (u - c), u = t[++l], o = f, s !== 0 && (i[a++] = s);
+  for (; h < e; )
+    f = o + p, c = f - o, s = o - (f - c) + (p - c), p = n[++h], o = f, s !== 0 && (i[a++] = s);
+  return (o !== 0 || a === 0) && (i[a++] = o), a;
+}
+function ve(r, t) {
   let e = t[0];
   for (let n = 1; n < r; n++) e += t[n];
   return e;
@@ -691,24 +691,24 @@ function xe(r, t) {
 function K(r) {
   return new Float64Array(r);
 }
-const me = (3 + 16 * O) * O, ve = (2 + 12 * O) * O, we = (9 + 64 * O) * O * O, q = K(4), _t = K(8), St = K(12), Pt = K(16), P = K(4);
-function Ee(r, t, e, n, i, o, l) {
-  let u, c, f, p, s, a, h, g, y, d, x, v, m, w, E, b, M, _;
-  const C = r - i, R = e - i, k = t - o, I = n - o;
-  w = C * I, a = S * C, h = a - (a - C), g = C - h, a = S * I, y = a - (a - I), d = I - y, E = g * d - (w - h * y - g * y - h * d), b = k * R, a = S * k, h = a - (a - k), g = k - h, a = S * R, y = a - (a - R), d = R - y, M = g * d - (b - h * y - g * y - h * d), x = E - M, s = E - x, q[0] = E - (x + s) + (s - M), v = w + x, s = v - w, m = w - (v - s) + (x - s), x = m - b, s = m - x, q[1] = m - (x + s) + (s - b), _ = v + x, s = _ - v, q[2] = v - (_ - s) + (x - s), q[3] = _;
-  let A = xe(4, q), D = ve * l;
-  if (A >= D || -A >= D || (s = r - C, u = r - (C + s) + (s - i), s = e - R, f = e - (R + s) + (s - i), s = t - k, c = t - (k + s) + (s - o), s = n - I, p = n - (I + s) + (s - o), u === 0 && c === 0 && f === 0 && p === 0) || (D = we * l + de * Math.abs(A), A += C * p + I * u - (k * f + R * c), A >= D || -A >= D)) return A;
-  w = u * I, a = S * u, h = a - (a - u), g = u - h, a = S * I, y = a - (a - I), d = I - y, E = g * d - (w - h * y - g * y - h * d), b = c * R, a = S * c, h = a - (a - c), g = c - h, a = S * R, y = a - (a - R), d = R - y, M = g * d - (b - h * y - g * y - h * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), v = w + x, s = v - w, m = w - (v - s) + (x - s), x = m - b, s = m - x, P[1] = m - (x + s) + (s - b), _ = v + x, s = _ - v, P[2] = v - (_ - s) + (x - s), P[3] = _;
-  const te = st(4, q, 4, P, _t);
-  w = C * p, a = S * C, h = a - (a - C), g = C - h, a = S * p, y = a - (a - p), d = p - y, E = g * d - (w - h * y - g * y - h * d), b = k * f, a = S * k, h = a - (a - k), g = k - h, a = S * f, y = a - (a - f), d = f - y, M = g * d - (b - h * y - g * y - h * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), v = w + x, s = v - w, m = w - (v - s) + (x - s), x = m - b, s = m - x, P[1] = m - (x + s) + (s - b), _ = v + x, s = _ - v, P[2] = v - (_ - s) + (x - s), P[3] = _;
-  const ee = st(te, _t, 4, P, St);
-  w = u * p, a = S * u, h = a - (a - u), g = u - h, a = S * p, y = a - (a - p), d = p - y, E = g * d - (w - h * y - g * y - h * d), b = c * f, a = S * c, h = a - (a - c), g = c - h, a = S * f, y = a - (a - f), d = f - y, M = g * d - (b - h * y - g * y - h * d), x = E - M, s = E - x, P[0] = E - (x + s) + (s - M), v = w + x, s = v - w, m = w - (v - s) + (x - s), x = m - b, s = m - x, P[1] = m - (x + s) + (s - b), _ = v + x, s = _ - v, P[2] = v - (_ - s) + (x - s), P[3] = _;
-  const ne = st(ee, St, 4, P, Pt);
-  return Pt[ne - 1];
-}
-function be(r, t, e, n, i, o) {
-  const l = (t - o) * (e - i), u = (r - i) * (n - o), c = l - u, f = Math.abs(l + u);
-  return Math.abs(c) >= me * f ? c : -Ee(r, t, e, n, i, o, f);
+const me = (3 + 16 * O) * O, we = (2 + 12 * O) * O, Ee = (9 + 64 * O) * O * O, q = K(4), _t = K(8), St = K(12), Pt = K(16), P = K(4);
+function be(r, t, e, n, i, o, f) {
+  let s, c, u, p, l, h, a, y, g, x, d, m, v, w, E, b, M, _;
+  const C = r - i, R = e - i, I = t - o, $ = n - o;
+  w = C * $, h = S * C, a = h - (h - C), y = C - a, h = S * $, g = h - (h - $), x = $ - g, E = y * x - (w - a * g - y * g - a * x), b = I * R, h = S * I, a = h - (h - I), y = I - a, h = S * R, g = h - (h - R), x = R - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, q[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, q[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, q[2] = m - (_ - l) + (d - l), q[3] = _;
+  let A = ve(4, q), D = we * f;
+  if (A >= D || -A >= D || (l = r - C, s = r - (C + l) + (l - i), l = e - R, u = e - (R + l) + (l - i), l = t - I, c = t - (I + l) + (l - o), l = n - $, p = n - ($ + l) + (l - o), s === 0 && c === 0 && u === 0 && p === 0) || (D = Ee * f + xe * Math.abs(A), A += C * p + $ * s - (I * u + R * c), A >= D || -A >= D)) return A;
+  w = s * $, h = S * s, a = h - (h - s), y = s - a, h = S * $, g = h - (h - $), x = $ - g, E = y * x - (w - a * g - y * g - a * x), b = c * R, h = S * c, a = h - (h - c), y = c - a, h = S * R, g = h - (h - R), x = R - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, P[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, P[2] = m - (_ - l) + (d - l), P[3] = _;
+  const ee = st(4, q, 4, P, _t);
+  w = C * p, h = S * C, a = h - (h - C), y = C - a, h = S * p, g = h - (h - p), x = p - g, E = y * x - (w - a * g - y * g - a * x), b = I * u, h = S * I, a = h - (h - I), y = I - a, h = S * u, g = h - (h - u), x = u - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, P[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, P[2] = m - (_ - l) + (d - l), P[3] = _;
+  const ne = st(ee, _t, 4, P, St);
+  w = s * p, h = S * s, a = h - (h - s), y = s - a, h = S * p, g = h - (h - p), x = p - g, E = y * x - (w - a * g - y * g - a * x), b = c * u, h = S * c, a = h - (h - c), y = c - a, h = S * u, g = h - (h - u), x = u - g, M = y * x - (b - a * g - y * g - a * x), d = E - M, l = E - d, P[0] = E - (d + l) + (l - M), m = w + d, l = m - w, v = w - (m - l) + (d - l), d = v - b, l = v - d, P[1] = v - (d + l) + (l - b), _ = m + d, l = _ - m, P[2] = m - (_ - l) + (d - l), P[3] = _;
+  const re = st(ne, St, 4, P, Pt);
+  return Pt[re - 1];
+}
+function _e(r, t, e, n, i, o) {
+  const f = (t - o) * (e - i), s = (r - i) * (n - o), c = f - s, u = Math.abs(f + s);
+  return Math.abs(c) >= me * u ? c : -be(r, t, e, n, i, o, u);
 }
 const j = (r, t) => r.ll.x <= t.x && t.x <= r.ur.x && r.ll.y <= t.y && t.y <= r.ur.y, pt = (r, t) => {
   if (t.ur.x < r.ll.x || r.ur.x < t.ll.x || t.ur.y < r.ll.y || r.ur.y < t.ll.y) return null;
@@ -726,13 +726,13 @@ const j = (r, t) => r.ll.x <= t.x && t.x <= r.ur.x && r.ll.y <= t.y && t.y <= r.
 };
 let G = Number.EPSILON;
 G === void 0 && (G = Math.pow(2, -52));
-const _e = G * G, Mt = (r, t) => {
+const Se = G * G, Mt = (r, t) => {
   if (-G < r && r < G && -G < t && t < G)
     return 0;
   const e = r - t;
-  return e * e < _e * r * t ? 0 : r < t ? -1 : 1;
+  return e * e < Se * r * t ? 0 : r < t ? -1 : 1;
 };
-class Se {
+class Pe {
   constructor() {
     this.reset();
   }
@@ -765,10 +765,10 @@ class Lt {
     return i !== null && Mt(e.key, i.key) === 0 ? (this.tree.remove(t), i.key) : t;
   }
 }
-const J = new Se(), tt = (r, t) => r.x * t.y - r.y * t.x, Xt = (r, t) => r.x * t.x + r.y * t.y, Ct = (r, t, e) => {
-  const n = be(r.x, r.y, t.x, t.y, e.x, e.y);
+const J = new Pe(), tt = (r, t) => r.x * t.y - r.y * t.x, Vt = (r, t) => r.x * t.x + r.y * t.y, Ct = (r, t, e) => {
+  const n = _e(r.x, r.y, t.x, t.y, e.x, e.y);
   return n > 0 ? -1 : n < 0 ? 1 : 0;
-}, et = (r) => Math.sqrt(Xt(r, r)), Pe = (r, t, e) => {
+}, et = (r) => Math.sqrt(Vt(r, r)), Me = (r, t, e) => {
   const n = {
     x: t.x - r.x,
     y: t.y - r.y
@@ -777,7 +777,7 @@ const J = new Se(), tt = (r, t) => r.x * t.y - r.y * t.x, Xt = (r, t) => r.x * t
     y: e.y - r.y
   };
   return tt(i, n) / et(i) / et(n);
-}, Me = (r, t, e) => {
+}, Le = (r, t, e) => {
   const n = {
     x: t.x - r.x,
     y: t.y - r.y
@@ -785,16 +785,16 @@ const J = new Se(), tt = (r, t) => r.x * t.y - r.y * t.x, Xt = (r, t) => r.x * t
     x: e.x - r.x,
     y: e.y - r.y
   };
-  return Xt(i, n) / et(i) / et(n);
+  return Vt(i, n) / et(i) / et(n);
 }, Rt = (r, t, e) => t.y === 0 ? null : {
   x: r.x + t.x / t.y * (e - r.y),
   y: e
-}, kt = (r, t, e) => t.x === 0 ? null : {
+}, It = (r, t, e) => t.x === 0 ? null : {
   x: e,
   y: r.y + t.y / t.x * (e - r.x)
-}, Le = (r, t, e, n) => {
-  if (t.x === 0) return kt(e, n, r.x);
-  if (n.x === 0) return kt(r, t, e.x);
+}, Ce = (r, t, e, n) => {
+  if (t.x === 0) return It(e, n, r.x);
+  if (n.x === 0) return It(r, t, e.x);
   if (t.y === 0) return Rt(e, n, r.y);
   if (n.y === 0) return Rt(r, t, e.y);
   const i = tt(t, n);
@@ -802,10 +802,10 @@ const J = new Se(), tt = (r, t) => r.x * t.y - r.y * t.x, Xt = (r, t) => r.x * t
   const o = {
     x: e.x - r.x,
     y: e.y - r.y
-  }, l = tt(o, t) / i, u = tt(o, n) / i, c = r.x + u * t.x, f = e.x + l * n.x, p = r.y + u * t.y, s = e.y + l * n.y, a = (c + f) / 2, h = (p + s) / 2;
+  }, f = tt(o, t) / i, s = tt(o, n) / i, c = r.x + s * t.x, u = e.x + f * n.x, p = r.y + s * t.y, l = e.y + f * n.y, h = (c + u) / 2, a = (p + l) / 2;
   return {
-    x: a,
-    y: h
+    x: h,
+    y: a
   };
 };
 class L {
@@ -867,24 +867,24 @@ class L {
     const e = /* @__PURE__ */ new Map(), n = (i) => {
       const o = i.otherSE;
       e.set(i, {
-        sine: Pe(this.point, t.point, o.point),
-        cosine: Me(this.point, t.point, o.point)
+        sine: Me(this.point, t.point, o.point),
+        cosine: Le(this.point, t.point, o.point)
       });
     };
     return (i, o) => {
       e.has(i) || n(i), e.has(o) || n(o);
       const {
-        sine: l,
-        cosine: u
+        sine: f,
+        cosine: s
       } = e.get(i), {
         sine: c,
-        cosine: f
+        cosine: u
       } = e.get(o);
-      return l >= 0 && c >= 0 ? u < f ? 1 : u > f ? -1 : 0 : l < 0 && c < 0 ? u < f ? -1 : u > f ? 1 : 0 : c < l ? -1 : c > l ? 1 : 0;
+      return f >= 0 && c >= 0 ? s < u ? 1 : s > u ? -1 : 0 : f < 0 && c < 0 ? s < u ? -1 : s > u ? 1 : 0 : c < f ? -1 : c > f ? 1 : 0;
     };
   }
 }
-let Ce = 0;
+let Re = 0;
 class z {
   /* This compare() function is for ordering segments in the sweep
    * line tree, and does so according to the following criteria:
@@ -900,60 +900,60 @@ class z {
    * is directly on the right-more of the two left inputs.
    */
   static compare(t, e) {
-    const n = t.leftSE.point.x, i = e.leftSE.point.x, o = t.rightSE.point.x, l = e.rightSE.point.x;
-    if (l < n) return 1;
+    const n = t.leftSE.point.x, i = e.leftSE.point.x, o = t.rightSE.point.x, f = e.rightSE.point.x;
+    if (f < n) return 1;
     if (o < i) return -1;
-    const u = t.leftSE.point.y, c = e.leftSE.point.y, f = t.rightSE.point.y, p = e.rightSE.point.y;
+    const s = t.leftSE.point.y, c = e.leftSE.point.y, u = t.rightSE.point.y, p = e.rightSE.point.y;
     if (n < i) {
-      if (c < u && c < f) return 1;
-      if (c > u && c > f) return -1;
-      const s = t.comparePoint(e.leftSE.point);
-      if (s < 0) return 1;
-      if (s > 0) return -1;
-      const a = e.comparePoint(t.rightSE.point);
-      return a !== 0 ? a : -1;
+      if (c < s && c < u) return 1;
+      if (c > s && c > u) return -1;
+      const l = t.comparePoint(e.leftSE.point);
+      if (l < 0) return 1;
+      if (l > 0) return -1;
+      const h = e.comparePoint(t.rightSE.point);
+      return h !== 0 ? h : -1;
     }
     if (n > i) {
-      if (u < c && u < p) return -1;
-      if (u > c && u > p) return 1;
-      const s = e.comparePoint(t.leftSE.point);
-      if (s !== 0) return s;
-      const a = t.comparePoint(e.rightSE.point);
-      return a < 0 ? 1 : a > 0 ? -1 : 1;
+      if (s < c && s < p) return -1;
+      if (s > c && s > p) return 1;
+      const l = e.comparePoint(t.leftSE.point);
+      if (l !== 0) return l;
+      const h = t.comparePoint(e.rightSE.point);
+      return h < 0 ? 1 : h > 0 ? -1 : 1;
     }
-    if (u < c) return -1;
-    if (u > c) return 1;
-    if (o < l) {
-      const s = e.comparePoint(t.rightSE.point);
-      if (s !== 0) return s;
+    if (s < c) return -1;
+    if (s > c) return 1;
+    if (o < f) {
+      const l = e.comparePoint(t.rightSE.point);
+      if (l !== 0) return l;
     }
-    if (o > l) {
-      const s = t.comparePoint(e.rightSE.point);
-      if (s < 0) return 1;
-      if (s > 0) return -1;
+    if (o > f) {
+      const l = t.comparePoint(e.rightSE.point);
+      if (l < 0) return 1;
+      if (l > 0) return -1;
     }
-    if (o !== l) {
-      const s = f - u, a = o - n, h = p - c, g = l - i;
-      if (s > a && h < g) return 1;
-      if (s < a && h > g) return -1;
+    if (o !== f) {
+      const l = u - s, h = o - n, a = p - c, y = f - i;
+      if (l > h && a < y) return 1;
+      if (l < h && a > y) return -1;
     }
-    return o > l ? 1 : o < l || f < p ? -1 : f > p ? 1 : t.id < e.id ? -1 : t.id > e.id ? 1 : 0;
+    return o > f ? 1 : o < f || u < p ? -1 : u > p ? 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, i) {
-    this.id = ++Ce, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = n, this.windings = i;
+    this.id = ++Re, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = n, this.windings = i;
   }
   static fromRing(t, e, n) {
-    let i, o, l;
-    const u = L.comparePoints(t, e);
-    if (u < 0)
-      i = t, o = e, l = 1;
-    else if (u > 0)
-      i = e, o = t, l = -1;
+    let i, o, f;
+    const s = L.comparePoints(t, e);
+    if (s < 0)
+      i = t, o = e, f = 1;
+    else if (s > 0)
+      i = e, o = t, f = -1;
     else throw new Error(`Tried to create degenerate segment at [${t.x}, ${t.y}]`);
-    const c = new L(i, !0), f = new L(o, !1);
-    return new z(c, f, [n], [l]);
+    const c = new L(i, !0), u = new L(o, !1);
+    return new z(c, u, [n], [f]);
   }
   /* When a segment is split, the rightSE is replaced with a new sweep event */
   replaceRightSE(t) {
@@ -1000,9 +1000,9 @@ class z {
     const e = this.leftSE.point, n = this.rightSE.point, i = this.vector();
     if (e.x === n.x)
       return t.x === e.x ? 0 : t.x < e.x ? 1 : -1;
-    const o = (t.y - e.y) / i.y, l = e.x + o * i.x;
-    if (t.x === l) return 0;
-    const u = (t.x - e.x) / i.x, c = e.y + u * i.y;
+    const o = (t.y - e.y) / i.y, f = e.x + o * i.x;
+    if (t.x === f) return 0;
+    const s = (t.x - e.x) / i.x, c = e.y + s * i.y;
     return t.y === c ? 0 : t.y < c ? -1 : 1;
   }
   /**
@@ -1023,18 +1023,18 @@ class z {
   getIntersection(t) {
     const e = this.bbox(), n = t.bbox(), i = pt(e, n);
     if (i === null) return null;
-    const o = this.leftSE.point, l = this.rightSE.point, u = t.leftSE.point, c = t.rightSE.point, f = j(e, u) && this.comparePoint(u) === 0, p = j(n, o) && t.comparePoint(o) === 0, s = j(e, c) && this.comparePoint(c) === 0, a = j(n, l) && t.comparePoint(l) === 0;
-    if (p && f)
-      return a && !s ? l : !a && s ? c : null;
+    const o = this.leftSE.point, f = this.rightSE.point, s = t.leftSE.point, c = t.rightSE.point, u = j(e, s) && this.comparePoint(s) === 0, p = j(n, o) && t.comparePoint(o) === 0, l = j(e, c) && this.comparePoint(c) === 0, h = j(n, f) && t.comparePoint(f) === 0;
+    if (p && u)
+      return h && !l ? f : !h && l ? c : null;
     if (p)
-      return s && o.x === c.x && o.y === c.y ? null : o;
-    if (f)
-      return a && l.x === u.x && l.y === u.y ? null : u;
-    if (a && s) return null;
-    if (a) return l;
-    if (s) return c;
-    const h = Le(o, this.vector(), u, t.vector());
-    return h === null || !j(i, h) ? null : J.round(h.x, h.y);
+      return l && o.x === c.x && o.y === c.y ? null : o;
+    if (u)
+      return h && f.x === s.x && f.y === s.y ? null : s;
+    if (h && l) return null;
+    if (h) return f;
+    if (l) return c;
+    const a = Ce(o, this.vector(), s, t.vector());
+    return a === null || !j(i, a) ? null : J.round(a.x, a.y);
   }
   /**
    * Split the given segment into multiple segments on the given points.
@@ -1049,10 +1049,10 @@ class z {
    * Warning: input array of points is modified
    */
   split(t) {
-    const e = [], n = t.events !== void 0, i = new L(t, !0), o = new L(t, !1), l = this.rightSE;
+    const e = [], n = t.events !== void 0, i = new L(t, !0), o = new L(t, !1), f = this.rightSE;
     this.replaceRightSE(o), e.push(o), e.push(i);
-    const u = new z(i, l, this.rings.slice(), this.windings.slice());
-    return L.comparePoints(u.leftSE.point, u.rightSE.point) > 0 && u.swapEvents(), L.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (i.checkForConsuming(), o.checkForConsuming()), e;
+    const s = new z(i, f, this.rings.slice(), this.windings.slice());
+    return L.comparePoints(s.leftSE.point, s.rightSE.point) > 0 && s.swapEvents(), L.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), n && (i.checkForConsuming(), o.checkForConsuming()), e;
   }
   /* Swap which event is left and right */
   swapEvents() {
@@ -1077,9 +1077,9 @@ class z {
         const o = e;
         e = n, n = o;
       }
-      for (let o = 0, l = n.rings.length; o < l; o++) {
-        const u = n.rings[o], c = n.windings[o], f = e.rings.indexOf(u);
-        f === -1 ? (e.rings.push(u), e.windings.push(c)) : e.windings[f] += c;
+      for (let o = 0, f = n.rings.length; o < f; o++) {
+        const s = n.rings[o], c = n.windings[o], u = e.rings.indexOf(s);
+        u === -1 ? (e.rings.push(s), e.windings.push(c)) : e.windings[u] += c;
       }
       n.rings = null, n.windings = null, n.consumedBy = e, n.leftSE.consumedBy = e.leftSE, n.rightSE.consumedBy = e.rightSE;
     }
@@ -1110,25 +1110,25 @@ class z {
       multiPolys: []
     };
     const e = this._afterState.rings, n = this._afterState.windings, i = this._afterState.multiPolys;
-    for (let u = 0, c = this.rings.length; u < c; u++) {
-      const f = this.rings[u], p = this.windings[u], s = e.indexOf(f);
-      s === -1 ? (e.push(f), n.push(p)) : n[s] += p;
+    for (let s = 0, c = this.rings.length; s < c; s++) {
+      const u = this.rings[s], p = this.windings[s], l = e.indexOf(u);
+      l === -1 ? (e.push(u), n.push(p)) : n[l] += p;
     }
-    const o = [], l = [];
-    for (let u = 0, c = e.length; u < c; u++) {
-      if (n[u] === 0) continue;
-      const f = e[u], p = f.poly;
-      if (l.indexOf(p) === -1)
-        if (f.isExterior) o.push(p);
+    const o = [], f = [];
+    for (let s = 0, c = e.length; s < c; s++) {
+      if (n[s] === 0) continue;
+      const u = e[s], p = u.poly;
+      if (f.indexOf(p) === -1)
+        if (u.isExterior) o.push(p);
         else {
-          l.indexOf(p) === -1 && l.push(p);
-          const s = o.indexOf(f.poly);
-          s !== -1 && o.splice(s, 1);
+          f.indexOf(p) === -1 && f.push(p);
+          const l = o.indexOf(u.poly);
+          l !== -1 && o.splice(l, 1);
         }
     }
-    for (let u = 0, c = o.length; u < c; u++) {
-      const f = o[u].multiPoly;
-      i.indexOf(f) === -1 && i.push(f);
+    for (let s = 0, c = o.length; s < c; s++) {
+      const u = o[s].multiPoly;
+      i.indexOf(u) === -1 && i.push(u);
     }
     return this._afterState;
   }
@@ -1137,7 +1137,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 ($.type) {
+    switch (k.type) {
       case "union": {
         const n = t.length === 0, i = e.length === 0;
         this._isInResult = n !== i;
@@ -1145,7 +1145,7 @@ class z {
       }
       case "intersection": {
         let n, i;
-        t.length < e.length ? (n = t.length, i = e.length) : (n = e.length, i = t.length), this._isInResult = i === $.numMultiPolys && n < i;
+        t.length < e.length ? (n = t.length, i = e.length) : (n = e.length, i = t.length), this._isInResult = i === k.numMultiPolys && n < i;
         break;
       }
       case "xor": {
@@ -1159,12 +1159,12 @@ class z {
         break;
       }
       default:
-        throw new Error(`Unrecognized operation type found ${$.type}`);
+        throw new Error(`Unrecognized operation type found ${k.type}`);
     }
     return this._isInResult;
   }
 }
-class It {
+class $t {
   constructor(t, e, n) {
     if (!Array.isArray(t) || t.length === 0)
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1182,10 +1182,10 @@ class It {
       }
     };
     let o = i;
-    for (let l = 1, u = t.length; l < u; l++) {
-      if (typeof t[l][0] != "number" || typeof t[l][1] != "number")
+    for (let f = 1, s = t.length; f < s; f++) {
+      if (typeof t[f][0] != "number" || typeof t[f][1] != "number")
         throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-      let c = J.round(t[l][0], t[l][1]);
+      let c = J.round(t[f][0], t[f][1]);
       c.x === o.x && c.y === o.y || (this.segments.push(z.fromRing(o, 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), o = c);
     }
     (i.x !== o.x || i.y !== o.y) && this.segments.push(z.fromRing(o, i, this));
@@ -1199,11 +1199,11 @@ class It {
     return t;
   }
 }
-class Re {
+class Ie {
   constructor(t, e) {
     if (!Array.isArray(t))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
-    this.exteriorRing = new It(t[0], this, !0), this.bbox = {
+    this.exteriorRing = new $t(t[0], this, !0), this.bbox = {
       ll: {
         x: this.exteriorRing.bbox.ll.x,
         y: this.exteriorRing.bbox.ll.y
@@ -1214,7 +1214,7 @@ class Re {
       }
     }, this.interiorRings = [];
     for (let n = 1, i = t.length; n < i; n++) {
-      const o = new It(t[n], this, !1);
+      const o = new $t(t[n], this, !1);
       o.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = o.bbox.ll.x), o.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = o.bbox.ll.y), o.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = o.bbox.ur.x), o.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = o.bbox.ur.y), this.interiorRings.push(o);
     }
     this.multiPoly = e;
@@ -1223,13 +1223,13 @@ class Re {
     const t = this.exteriorRing.getSweepEvents();
     for (let e = 0, n = this.interiorRings.length; e < n; e++) {
       const i = this.interiorRings[e].getSweepEvents();
-      for (let o = 0, l = i.length; o < l; o++)
+      for (let o = 0, f = i.length; o < f; o++)
         t.push(i[o]);
     }
     return t;
   }
 }
-class $t {
+class kt {
   constructor(t, e) {
     if (!Array.isArray(t))
       throw new Error("Input geometry is not a valid Polygon or MultiPolygon");
@@ -1248,7 +1248,7 @@ class $t {
       }
     };
     for (let n = 0, i = t.length; n < i; n++) {
-      const o = new Re(t[n], this);
+      const o = new Ie(t[n], this);
       o.bbox.ll.x < this.bbox.ll.x && (this.bbox.ll.x = o.bbox.ll.x), o.bbox.ll.y < this.bbox.ll.y && (this.bbox.ll.y = o.bbox.ll.y), o.bbox.ur.x > this.bbox.ur.x && (this.bbox.ur.x = o.bbox.ur.x), o.bbox.ur.y > this.bbox.ur.y && (this.bbox.ur.y = o.bbox.ur.y), this.polys.push(o);
     }
     this.isSubject = e;
@@ -1257,7 +1257,7 @@ class $t {
     const t = [];
     for (let e = 0, n = this.polys.length; e < n; e++) {
       const i = this.polys[e].getSweepEvents();
-      for (let o = 0, l = i.length; o < l; o++)
+      for (let o = 0, f = i.length; o < f; o++)
         t.push(i[o]);
     }
     return t;
@@ -1271,39 +1271,39 @@ class nt {
     for (let n = 0, i = t.length; n < i; n++) {
       const o = t[n];
       if (!o.isInResult() || o.ringOut) continue;
-      let l = null, u = o.leftSE, c = o.rightSE;
-      const f = [u], p = u.point, s = [];
-      for (; l = u, u = c, f.push(u), u.point !== p; )
+      let f = null, s = o.leftSE, c = o.rightSE;
+      const u = [s], p = s.point, l = [];
+      for (; f = s, s = c, u.push(s), s.point !== p; )
         for (; ; ) {
-          const a = u.getAvailableLinkedEvents();
-          if (a.length === 0) {
-            const y = f[0].point, d = f[f.length - 1].point;
-            throw new Error(`Unable to complete output ring starting at [${y.x}, ${y.y}]. Last matching segment found ends at [${d.x}, ${d.y}].`);
+          const h = s.getAvailableLinkedEvents();
+          if (h.length === 0) {
+            const g = u[0].point, x = u[u.length - 1].point;
+            throw new Error(`Unable to complete output ring starting at [${g.x}, ${g.y}]. Last matching segment found ends at [${x.x}, ${x.y}].`);
           }
-          if (a.length === 1) {
-            c = a[0].otherSE;
+          if (h.length === 1) {
+            c = h[0].otherSE;
             break;
           }
-          let h = null;
-          for (let y = 0, d = s.length; y < d; y++)
-            if (s[y].point === u.point) {
-              h = y;
+          let a = null;
+          for (let g = 0, x = l.length; g < x; g++)
+            if (l[g].point === s.point) {
+              a = g;
               break;
             }
-          if (h !== null) {
-            const y = s.splice(h)[0], d = f.splice(y.index);
-            d.unshift(d[0].otherSE), e.push(new nt(d.reverse()));
+          if (a !== null) {
+            const g = l.splice(a)[0], x = u.splice(g.index);
+            x.unshift(x[0].otherSE), e.push(new nt(x.reverse()));
             continue;
           }
-          s.push({
-            index: f.length,
-            point: u.point
+          l.push({
+            index: u.length,
+            point: s.point
           });
-          const g = u.getLeftmostComparator(l);
-          c = a.sort(g)[0].otherSE;
+          const y = s.getLeftmostComparator(f);
+          c = h.sort(y)[0].otherSE;
           break;
         }
-      e.push(new nt(f));
+      e.push(new nt(u));
     }
     return e;
   }
@@ -1316,15 +1316,15 @@ class nt {
   getGeom() {
     let t = this.events[0].point;
     const e = [t];
-    for (let f = 1, p = this.events.length - 1; f < p; f++) {
-      const s = this.events[f].point, a = this.events[f + 1].point;
-      Ct(s, t, a) !== 0 && (e.push(s), t = s);
+    for (let u = 1, p = this.events.length - 1; u < p; u++) {
+      const l = this.events[u].point, h = this.events[u + 1].point;
+      Ct(l, t, h) !== 0 && (e.push(l), t = l);
     }
     if (e.length === 1) return null;
     const n = e[0], i = e[1];
     Ct(n, t, i) === 0 && e.shift(), e.push(e[0]);
-    const o = this.isExteriorRing() ? 1 : -1, l = this.isExteriorRing() ? 0 : e.length - 1, u = this.isExteriorRing() ? e.length : -1, c = [];
-    for (let f = l; f != u; f += o) c.push([e[f].x, e[f].y]);
+    const o = this.isExteriorRing() ? 1 : -1, f = this.isExteriorRing() ? 0 : e.length - 1, s = this.isExteriorRing() ? e.length : -1, c = [];
+    for (let u = f; u != s; u += o) c.push([e[u].x, e[u].y]);
     return c;
   }
   isExteriorRing() {
@@ -1341,8 +1341,8 @@ class nt {
   _calcEnclosingRing() {
     let t = this.events[0];
     for (let i = 1, o = this.events.length; i < o; i++) {
-      const l = this.events[i];
-      L.compare(t, l) > 0 && (t = l);
+      const f = this.events[i];
+      L.compare(t, f) > 0 && (t = f);
     }
     let e = t.segment.prevInResult(), n = e ? e.prevInResult() : null;
     for (; ; ) {
@@ -1371,7 +1371,7 @@ class At {
     return t;
   }
 }
-class ke {
+class $e {
   constructor(t) {
     this.rings = t, this.polys = this._composePolys(t);
   }
@@ -1390,14 +1390,14 @@ class ke {
       if (!o.poly)
         if (o.isExteriorRing()) e.push(new At(o));
         else {
-          const l = o.enclosingRing();
-          l.poly || e.push(new At(l)), l.poly.addInterior(o);
+          const f = o.enclosingRing();
+          f.poly || e.push(new At(f)), f.poly.addInterior(o);
         }
     }
     return e;
   }
 }
-class Ie {
+class ke {
   constructor(t) {
     let e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : z.compare;
     this.queue = t, this.tree = new wt(e), this.segments = [];
@@ -1408,51 +1408,51 @@ class Ie {
       return t.isLeft ? this.queue.remove(t.otherSE) : this.tree.remove(e), n;
     const i = t.isLeft ? this.tree.add(e) : this.tree.find(e);
     if (!i) 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 o = i, l = i, u, c;
-    for (; u === void 0; )
-      o = this.tree.prev(o), o === null ? u = null : o.key.consumedBy === void 0 && (u = o.key);
+    let o = i, f = i, s, c;
+    for (; s === void 0; )
+      o = this.tree.prev(o), o === null ? s = null : o.key.consumedBy === void 0 && (s = o.key);
     for (; c === void 0; )
-      l = this.tree.next(l), l === null ? c = null : l.key.consumedBy === void 0 && (c = l.key);
+      f = this.tree.next(f), f === null ? c = null : f.key.consumedBy === void 0 && (c = f.key);
     if (t.isLeft) {
-      let f = null;
-      if (u) {
-        const s = u.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (f = s), !u.isAnEndpoint(s))) {
-          const a = this._splitSafely(u, s);
-          for (let h = 0, g = a.length; h < g; h++)
-            n.push(a[h]);
+      let u = null;
+      if (s) {
+        const l = s.getIntersection(e);
+        if (l !== null && (e.isAnEndpoint(l) || (u = l), !s.isAnEndpoint(l))) {
+          const h = this._splitSafely(s, l);
+          for (let a = 0, y = h.length; a < y; a++)
+            n.push(h[a]);
         }
       }
       let p = null;
       if (c) {
-        const s = c.getIntersection(e);
-        if (s !== null && (e.isAnEndpoint(s) || (p = s), !c.isAnEndpoint(s))) {
-          const a = this._splitSafely(c, s);
-          for (let h = 0, g = a.length; h < g; h++)
-            n.push(a[h]);
+        const l = c.getIntersection(e);
+        if (l !== null && (e.isAnEndpoint(l) || (p = l), !c.isAnEndpoint(l))) {
+          const h = this._splitSafely(c, l);
+          for (let a = 0, y = h.length; a < y; a++)
+            n.push(h[a]);
         }
       }
-      if (f !== null || p !== null) {
-        let s = null;
-        f === null ? s = p : p === null ? s = f : s = L.comparePoints(f, p) <= 0 ? f : p, this.queue.remove(e.rightSE), n.push(e.rightSE);
-        const a = e.split(s);
-        for (let h = 0, g = a.length; h < g; h++)
-          n.push(a[h]);
+      if (u !== null || p !== null) {
+        let l = null;
+        u === null ? l = p : p === null ? l = u : l = L.comparePoints(u, p) <= 0 ? u : p, this.queue.remove(e.rightSE), n.push(e.rightSE);
+        const h = e.split(l);
+        for (let a = 0, y = h.length; a < y; a++)
+          n.push(h[a]);
       }
-      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = u);
+      n.length > 0 ? (this.tree.remove(e), n.push(t)) : (this.segments.push(e), e.prev = s);
     } else {
-      if (u && c) {
-        const f = u.getIntersection(c);
-        if (f !== null) {
-          if (!u.isAnEndpoint(f)) {
-            const p = this._splitSafely(u, f);
-            for (let s = 0, a = p.length; s < a; s++)
-              n.push(p[s]);
+      if (s && c) {
+        const u = s.getIntersection(c);
+        if (u !== null) {
+          if (!s.isAnEndpoint(u)) {
+            const p = this._splitSafely(s, u);
+            for (let l = 0, h = p.length; l < h; l++)
+              n.push(p[l]);
           }
-          if (!c.isAnEndpoint(f)) {
-            const p = this._splitSafely(c, f);
-            for (let s = 0, a = p.length; s < a; s++)
-              n.push(p[s]);
+          if (!c.isAnEndpoint(u)) {
+            const p = this._splitSafely(c, u);
+            for (let l = 0, h = p.length; l < h; l++)
+              n.push(p[l]);
           }
         }
       }
@@ -1470,120 +1470,120 @@ class Ie {
     return i.push(n), t.consumedBy === void 0 && this.tree.add(t), i;
   }
 }
-const Ot = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, $e = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6;
-class Ae {
+const Ot = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_QUEUE_SIZE || 1e6, Ae = typeof process < "u" && process.env.POLYGON_CLIPPING_MAX_SWEEPLINE_SEGMENTS || 1e6;
+class Oe {
   run(t, e, n) {
-    $.type = t, J.reset();
-    const i = [new $t(e, !0)];
-    for (let s = 0, a = n.length; s < a; s++)
-      i.push(new $t(n[s], !1));
-    if ($.numMultiPolys = i.length, $.type === "difference") {
-      const s = i[0];
-      let a = 1;
-      for (; a < i.length; )
-        pt(i[a].bbox, s.bbox) !== null ? a++ : i.splice(a, 1);
+    k.type = t, J.reset();
+    const i = [new kt(e, !0)];
+    for (let l = 0, h = n.length; l < h; l++)
+      i.push(new kt(n[l], !1));
+    if (k.numMultiPolys = i.length, k.type === "difference") {
+      const l = i[0];
+      let h = 1;
+      for (; h < i.length; )
+        pt(i[h].bbox, l.bbox) !== null ? h++ : i.splice(h, 1);
     }
-    if ($.type === "intersection")
-      for (let s = 0, a = i.length; s < a; s++) {
-        const h = i[s];
-        for (let g = s + 1, y = i.length; g < y; g++)
-          if (pt(h.bbox, i[g].bbox) === null) return [];
+    if (k.type === "intersection")
+      for (let l = 0, h = i.length; l < h; l++) {
+        const a = i[l];
+        for (let y = l + 1, g = i.length; y < g; y++)
+          if (pt(a.bbox, i[y].bbox) === null) return [];
       }
     const o = new wt(L.compare);
-    for (let s = 0, a = i.length; s < a; s++) {
-      const h = i[s].getSweepEvents();
-      for (let g = 0, y = h.length; g < y; g++)
-        if (o.insert(h[g]), o.size > Ot)
+    for (let l = 0, h = i.length; l < h; l++) {
+      const a = i[l].getSweepEvents();
+      for (let y = 0, g = a.length; y < g; y++)
+        if (o.insert(a[y]), o.size > Ot)
           throw new Error("Infinite loop when putting segment endpoints in a priority queue (queue size too big).");
     }
-    const l = new Ie(o);
-    let u = o.size, c = o.pop();
+    const f = new ke(o);
+    let s = o.size, c = o.pop();
     for (; c; ) {
-      const s = c.key;
-      if (o.size === u) {
-        const h = s.segment;
-        throw new Error(`Unable to pop() ${s.isLeft ? "left" : "right"} SweepEvent [${s.point.x}, ${s.point.y}] from segment #${h.id} [${h.leftSE.point.x}, ${h.leftSE.point.y}] -> [${h.rightSE.point.x}, ${h.rightSE.point.y}] from queue.`);
+      const l = c.key;
+      if (o.size === s) {
+        const a = l.segment;
+        throw new Error(`Unable to pop() ${l.isLeft ? "left" : "right"} SweepEvent [${l.point.x}, ${l.point.y}] from segment #${a.id} [${a.leftSE.point.x}, ${a.leftSE.point.y}] -> [${a.rightSE.point.x}, ${a.rightSE.point.y}] from queue.`);
       }
       if (o.size > Ot)
         throw new Error("Infinite loop when passing sweep line over endpoints (queue size too big).");
-      if (l.segments.length > $e)
+      if (f.segments.length > Ae)
         throw new Error("Infinite loop when passing sweep line over endpoints (too many sweep line segments).");
-      const a = l.process(s);
-      for (let h = 0, g = a.length; h < g; h++) {
-        const y = a[h];
-        y.consumedBy === void 0 && o.insert(y);
+      const h = f.process(l);
+      for (let a = 0, y = h.length; a < y; a++) {
+        const g = h[a];
+        g.consumedBy === void 0 && o.insert(g);
       }
-      u = o.size, c = o.pop();
+      s = o.size, c = o.pop();
     }
     J.reset();
-    const f = nt.factory(l.segments);
-    return new ke(f).getGeom();
+    const u = nt.factory(f.segments);
+    return new $e(u).getGeom();
   }
 }
-const $ = new Ae(), Oe = function(r) {
+const k = new Oe(), Ne = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("union", r, e);
-}, Ne = function(r) {
-  for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
-    e[n - 1] = arguments[n];
-  return $.run("intersection", r, e);
+  return k.run("union", r, e);
 }, Be = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("xor", r, e);
+  return k.run("intersection", r, e);
 }, Ge = function(r) {
   for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
     e[n - 1] = arguments[n];
-  return $.run("difference", r, e);
+  return k.run("xor", r, e);
+}, ze = function(r) {
+  for (var t = arguments.length, e = new Array(t > 1 ? t - 1 : 0), n = 1; n < t; n++)
+    e[n - 1] = arguments[n];
+  return k.run("difference", r, e);
 };
-var Vt = {
-  union: Oe,
-  intersection: Ne,
-  xor: Be,
-  difference: Ge
+var Zt = {
+  union: Ne,
+  intersection: Be,
+  xor: Ge,
+  difference: ze
 };
-function ze(r, t = {}) {
+function Fe(r, t = {}) {
   const e = [];
-  if (mt(r, (i) => {
+  if (vt(r, (i) => {
     e.push(i.coordinates);
   }), e.length < 2)
     throw new Error("Must have at least 2 geometries");
-  const n = Vt.union(e[0], ...e.slice(1));
-  return n.length === 0 ? null : n.length === 1 ? xt(n[0], t.properties) : Qt(n, t.properties);
+  const n = Zt.union(e[0], ...e.slice(1));
+  return n.length === 0 ? null : n.length === 1 ? xt(n[0], t.properties) : Ut(n, t.properties);
 }
-var Zt = ze;
+var Jt = Fe;
 function gt(r) {
   const t = [...r];
   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 W() {
 }
-function Jt(r) {
+function Wt(r) {
   return r();
 }
 function Nt() {
   return /* @__PURE__ */ Object.create(null);
 }
 function rt(r) {
-  r.forEach(Jt);
+  r.forEach(Wt);
 }
-function Wt(r) {
+function Kt(r) {
   return typeof r == "function";
 }
 function Te(r, t) {
   return r != r ? t == t : r !== t || r && typeof r == "object" || typeof r == "function";
 }
-function Fe(r) {
+function qe(r) {
   return Object.keys(r).length === 0;
 }
-function qe(r, t) {
+function Qe(r, t) {
   r.appendChild(t);
 }
-function Qe(r, t, e) {
+function Ue(r, t, e) {
   r.insertBefore(t, e || null);
 }
-function Kt(r) {
+function Ht(r) {
   r.parentNode && r.parentNode.removeChild(r);
 }
 function Bt(r) {
@@ -1592,7 +1592,7 @@ function Bt(r) {
 function N(r, t, e) {
   e == null ? r.removeAttribute(t) : r.getAttribute(t) !== e && r.setAttribute(t, e);
 }
-function Ue(r) {
+function Ye(r) {
   return Array.from(r.childNodes);
 }
 function H(r, t, e) {
@@ -1604,17 +1604,17 @@ function X(r) {
 }
 const U = [], Gt = [];
 let Y = [];
-const zt = [], Ye = /* @__PURE__ */ Promise.resolve();
+const zt = [], De = /* @__PURE__ */ Promise.resolve();
 let yt = !1;
-function De() {
-  yt || (yt = !0, Ye.then(Ht));
+function je() {
+  yt || (yt = !0, De.then(te));
 }
 function dt(r) {
   Y.push(r);
 }
 const lt = /* @__PURE__ */ new Set();
 let Q = 0;
-function Ht() {
+function te() {
   if (Q !== 0)
     return;
   const r = Et;
@@ -1622,7 +1622,7 @@ function Ht() {
     try {
       for (; Q < U.length; ) {
         const t = U[Q];
-        Q++, X(t), je(t.$$);
+        Q++, X(t), Xe(t.$$);
       }
     } catch (t) {
       throw U.length = 0, Q = 0, t;
@@ -1638,39 +1638,39 @@ function Ht() {
     zt.pop()();
   yt = !1, lt.clear(), X(r);
 }
-function je(r) {
+function Xe(r) {
   if (r.fragment !== null) {
     r.update(), rt(r.before_update);
     const t = r.dirty;
     r.dirty = [-1], r.fragment && r.fragment.p(r.ctx, t), r.after_update.forEach(dt);
   }
 }
-function Xe(r) {
+function Ve(r) {
   const t = [], e = [];
   Y.forEach((n) => r.indexOf(n) === -1 ? t.push(n) : e.push(n)), e.forEach((n) => n()), Y = t;
 }
-const Ve = /* @__PURE__ */ new Set();
-function Ze(r, t) {
-  r && r.i && (Ve.delete(r), r.i(t));
+const Ze = /* @__PURE__ */ new Set();
+function Je(r, t) {
+  r && r.i && (Ze.delete(r), r.i(t));
 }
-function Je(r, t, e) {
+function We(r, t, e) {
   const { fragment: n, after_update: i } = r.$$;
   n && n.m(t, e), dt(() => {
-    const o = r.$$.on_mount.map(Jt).filter(Wt);
+    const o = r.$$.on_mount.map(Wt).filter(Kt);
     r.$$.on_destroy ? r.$$.on_destroy.push(...o) : rt(o), r.$$.on_mount = [];
   }), i.forEach(dt);
 }
-function We(r, t) {
+function Ke(r, t) {
   const e = r.$$;
-  e.fragment !== null && (Xe(e.after_update), rt(e.on_destroy), e.fragment && e.fragment.d(t), e.on_destroy = e.fragment = null, e.ctx = []);
+  e.fragment !== null && (Ve(e.after_update), rt(e.on_destroy), e.fragment && e.fragment.d(t), e.on_destroy = e.fragment = null, e.ctx = []);
 }
-function Ke(r, t) {
-  r.$$.dirty[0] === -1 && (U.push(r), De(), r.$$.dirty.fill(0)), r.$$.dirty[t / 31 | 0] |= 1 << t % 31;
+function He(r, t) {
+  r.$$.dirty[0] === -1 && (U.push(r), je(), r.$$.dirty.fill(0)), r.$$.dirty[t / 31 | 0] |= 1 << t % 31;
 }
-function He(r, t, e, n, i, o, l = null, u = [-1]) {
+function tn(r, t, e, n, i, o, f = null, s = [-1]) {
   const c = Et;
   X(r);
-  const f = r.$$ = {
+  const u = r.$$ = {
     fragment: null,
     ctx: [],
     // state
@@ -1687,26 +1687,26 @@ function He(r, t, e, n, i, o, l = null, u = [-1]) {
     context: new Map(t.context || (c ? c.$$.context : [])),
     // everything else
     callbacks: Nt(),
-    dirty: u,
+    dirty: s,
     skip_bound: !1,
     root: t.target || c.$$.root
   };
-  l && l(f.root);
+  f && f(u.root);
   let p = !1;
-  if (f.ctx = e ? e(r, t.props || {}, (s, a, ...h) => {
-    const g = h.length ? h[0] : a;
-    return f.ctx && i(f.ctx[s], f.ctx[s] = g) && (!f.skip_bound && f.bound[s] && f.bound[s](g), p && Ke(r, s)), a;
-  }) : [], f.update(), p = !0, rt(f.before_update), f.fragment = n ? n(f.ctx) : !1, t.target) {
+  if (u.ctx = e ? e(r, t.props || {}, (l, h, ...a) => {
+    const y = a.length ? a[0] : h;
+    return u.ctx && i(u.ctx[l], u.ctx[l] = y) && (!u.skip_bound && u.bound[l] && u.bound[l](y), p && He(r, l)), h;
+  }) : [], u.update(), p = !0, rt(u.before_update), u.fragment = n ? n(u.ctx) : !1, t.target) {
     if (t.hydrate) {
-      const s = Ue(t.target);
-      f.fragment && f.fragment.l(s), s.forEach(Kt);
+      const l = Ye(t.target);
+      u.fragment && u.fragment.l(l), l.forEach(Ht);
     } else
-      f.fragment && f.fragment.c();
-    t.intro && Ze(r.$$.fragment), Je(r, t.target, t.anchor), Ht();
+      u.fragment && u.fragment.c();
+    t.intro && Je(r.$$.fragment), We(r, t.target, t.anchor), te();
   }
   X(c);
 }
-class tn {
+class en {
   constructor() {
     /**
      * ### PRIVATE API
@@ -1727,7 +1727,7 @@ class tn {
   }
   /** @returns {void} */
   $destroy() {
-    We(this, 1), this.$destroy = W;
+    Ke(this, 1), this.$destroy = W;
   }
   /**
    * @template {Extract<keyof Events, string>} K
@@ -1736,7 +1736,7 @@ class tn {
    * @returns {() => void}
    */
   $on(t, e) {
-    if (!Wt(e))
+    if (!Kt(e))
       return W;
     const n = this.$$.callbacks[t] || (this.$$.callbacks[t] = []);
     return n.push(e), () => {
@@ -1749,12 +1749,12 @@ class tn {
    * @returns {void}
    */
   $set(t) {
-    this.$$set && !Fe(t) && (this.$$.skip_bound = !0, this.$$set(t), this.$$.skip_bound = !1);
+    this.$$set && !qe(t) && (this.$$.skip_bound = !0, this.$$set(t), this.$$.skip_bound = !1);
   }
 }
-const en = "4";
-typeof window < "u" && (window.__svelte || (window.__svelte = { v: /* @__PURE__ */ new Set() })).v.add(en);
-function nn(r) {
+const nn = "4";
+typeof window < "u" && (window.__svelte || (window.__svelte = { v: /* @__PURE__ */ new Set() })).v.add(nn);
+function rn(r) {
   let t, e, n;
   return {
     c() {
@@ -1772,7 +1772,7 @@ function nn(r) {
       );
     },
     m(i, o) {
-      Qe(i, t, o), qe(t, e);
+      Ue(i, t, o), Qe(t, e);
     },
     p(i, [o]) {
       o & /*displayIn*/
@@ -1794,42 +1794,42 @@ function nn(r) {
     i: W,
     o: W,
     d(i) {
-      i && Kt(t);
+      i && Ht(t);
     }
   };
 }
-function rn(r, t, e) {
+function on(r, t, e) {
   let { displayIn: n } = t;
   return r.$$set = (i) => {
     "displayIn" in i && e(0, n = i.displayIn);
   }, [n];
 }
-class on extends tn {
+class sn extends en {
   constructor(t) {
-    super(), He(this, t, rn, nn, Te, { displayIn: 0 });
+    super(), tn(this, t, on, rn, Te, { displayIn: 0 });
   }
 }
-function sn(r) {
+function ln(r) {
   const t = [];
-  if (mt(r, (i) => {
+  if (vt(r, (i) => {
     t.push(i.coordinates);
   }), t.length < 2)
     throw new Error("Must have at least two features");
-  const e = r.features[0].properties || {}, n = Vt.difference(t[0], ...t.slice(1));
-  return n.length === 0 ? null : n.length === 1 ? xt(n[0], e) : Qt(n, e);
+  const e = r.features[0].properties || {}, n = Zt.difference(t[0], ...t.slice(1));
+  return n.length === 0 ? null : n.length === 1 ? xt(n[0], e) : Ut(n, e);
 }
-var ln = sn;
-function un(r) {
+var un = ln;
+function fn(r) {
   if (!r)
     throw new Error("geojson is required");
   var t = [];
-  return oe(r, function(e) {
+  return se(r, function(e) {
     t.push(e);
   }), Z(t);
 }
-var fn = un;
-function Tt(r, t) {
-  const e = ln(
+var cn = fn;
+function Ft(r, t) {
+  const e = un(
     Z([
       xt([
         [
@@ -1846,56 +1846,57 @@ function Tt(r, t) {
   if (!e)
     return;
   e.properties = { isMask: !0 };
-  const n = gt(ut(r)), i = (n[2] - n[0]) / 360 / 1e3, o = n[0] < -180, l = n[2] > 180, u = fn(r);
-  if (u.features.length > 1 && (o || l))
-    for (const c of u.features) {
-      const f = gt(ut(c));
-      if (l && f[0] < -180 + i)
+  const n = gt(ut(r)), i = (n[2] - n[0]) / 360 / 1e3, o = n[0] < -180, f = n[2] > 180, s = cn(r);
+  if (s.features.length > 1 && (o || f))
+    for (const c of s.features) {
+      const u = gt(ut(c));
+      if (f && u[0] < -180 + i)
         for (const p of c.geometry.coordinates)
-          for (const s of p)
-            s[0] += 360 - i;
-      if (o && f[2] > 180 - i)
+          for (const l of p)
+            l[0] += 360 - i;
+      if (o && u[2] > 180 - i)
         for (const p of c.geometry.coordinates)
-          for (const s of p)
-            s[0] -= 360 - i;
+          for (const l of p)
+            l[0] -= 360 - i;
     }
   t(
     Z([
-      u.features.length < 2 ? r : Zt(u) ?? r,
+      s.features.length < 2 ? r : Jt(s) ?? r,
       e
     ])
   );
 }
-function hn(r, t = !0, e = !0, n = {}, i = {}, o = (l) => {
-  var f, p, s;
-  const u = (f = l == null ? void 0 : l.geometry) == null ? void 0 : f.type, c = (p = l == null ? void 0 : l.properties) != null && p.isMask ? 0 : u === "LineString" || u === "MultiLineString" ? 3 : 2;
+const Tt = (r) => {
+  var n, i, o;
+  const t = (n = r == null ? void 0 : r.geometry) == null ? void 0 : n.type, e = (i = r == null ? void 0 : r.properties) != null && i.isMask ? 0 : t === "LineString" || t === "MultiLineString" ? 3 : 2;
   return {
     color: "#3170fe",
     fillColor: "#000",
-    fillOpacity: (s = l == null ? void 0 : l.properties) != null && s.isMask ? 0.1 : 0,
-    weight: c,
-    dashArray: [c, c],
+    fillOpacity: (o = r == null ? void 0 : r.properties) != null && o.isMask ? 0.1 : 0,
+    weight: e,
+    dashArray: [e, e],
     lineCap: "butt"
   };
-}) {
-  let l;
-  const u = [];
-  let c, f;
-  const p = F.geoJSON(void 0, {
-    style: o,
+};
+function an(r, t = !0, e = !0, n = {}, i = {}, o = Tt, f = !1) {
+  let s;
+  const c = [];
+  let u, p;
+  const l = T.geoJSON(void 0, {
+    style: o === !0 ? Tt : o === !1 ? void 0 : o ?? void 0,
     interactive: !1
-  }).addTo(r), s = (h) => {
-    l == null || l({
+  }).addTo(r), h = (y) => {
+    s == null || s({
       type: "mapClick",
-      coordinates: [h.latlng.lng, h.latlng.lat]
+      coordinates: [y.latlng.lng, y.latlng.lat]
     });
   };
-  function a(h, g = !1) {
-    const y = document.createElement("div");
-    return new on({ props: { displayIn: "leaflet" }, target: y }), new F.Marker(h, {
+  function a(y, g = !1) {
+    const x = document.createElement("div");
+    return new sn({ props: { displayIn: "leaflet" }, target: x }), new T.Marker(y, {
       interactive: g,
-      icon: new F.DivIcon({
-        html: y,
+      icon: new T.DivIcon({
+        html: x,
         className: "",
         iconAnchor: [12, 26],
         iconSize: [25, 30],
@@ -1904,141 +1905,151 @@ function hn(r, t = !0, e = !0, n = {}, i = {}, o = (l) => {
     });
   }
   return {
-    setEventHandler(h) {
-      h ? (l = h, r.on("click", s)) : (l = void 0, r.off("click", s));
+    setEventHandler(y) {
+      y ? (s = y, r.on("click", h)) : (s = void 0, r.off("click", h));
     },
-    flyTo(h, g) {
-      r.flyTo([h[1], h[0]], g, { duration: 2, ...n });
+    flyTo(y, g) {
+      r.flyTo([y[1], y[0]], g, { duration: 2, ...n });
     },
-    fitBounds(h, g, y) {
+    fitBounds(y, g, x) {
       r.flyToBounds(
         [
-          [h[1], h[0]],
-          [h[3], h[2]]
+          [y[1], y[0]],
+          [y[3], y[2]]
         ],
         {
           padding: [g, g],
           duration: 2,
-          ...y ? { maxZoom: y } : {},
+          ...x ? { maxZoom: x } : {},
           ...i
         }
       );
     },
-    indicateReverse(h) {
-      r.getContainer().style.cursor = h ? "crosshair" : "";
+    indicateReverse(y) {
+      r.getContainer().style.cursor = y ? "crosshair" : "";
     },
-    setReverseMarker(h) {
-      var y;
+    setReverseMarker(y) {
+      var x;
       if (!t)
         return;
-      const g = h && [h[1], h[0]];
-      f ? g ? f.setLatLng(g) : (f.remove(), f = void 0) : g && (f = (typeof t == "object" ? new F.Marker(g, t) : a(g)).addTo(r), (y = f.getElement()) == null || y.classList.add("marker-reverse"));
+      const g = y && [y[1], y[0]];
+      p ? g ? p.setLatLng(g) : (p.remove(), p = void 0) : g && (t instanceof Function ? p = t(r) ?? void 0 : (p = (typeof t == "object" ? new T.Marker(g, t) : a(g)).addTo(r), (x = p.getElement()) == null || x.classList.add("marker-reverse")));
     },
-    setMarkers(h, g) {
-      if (!t)
-        return;
-      function y(d) {
-        p.clearLayers(), d && p.addData(d);
+    setMarkers(y, g) {
+      function x(d) {
+        l.clearLayers(), d && l.addData(d);
       }
-      for (const d of u)
+      for (const d of c)
         d.remove();
-      if (u.length = 0, y(), g) {
+      if (c.length = 0, x(), g) {
         let d = !1;
         if (g.geometry.type === "GeometryCollection") {
-          const v = g.geometry.geometries.filter(
-            (m) => m.type === "Polygon" || m.type === "MultiPolygon"
+          const m = g.geometry.geometries.filter(
+            (v) => v.type === "Polygon" || v.type === "MultiPolygon"
           );
-          t: if (v.length > 0) {
-            const m = Zt(
-              Z(v.map((w) => V(w)))
+          t: if (m.length > 0) {
+            const v = Jt(
+              Z(m.map((w) => V(w)))
             );
-            if (!m)
+            if (!v)
               break t;
-            Tt(
+            Ft(
               {
                 ...g,
-                geometry: m.geometry
+                geometry: v.geometry
               },
-              y
+              x
             ), d = !0;
           } else {
-            const m = g.geometry.geometries.filter(
+            const v = g.geometry.geometries.filter(
               (w) => w.type === "LineString" || w.type === "MultiLineString"
             );
-            m.length > 0 && (y({
+            v.length > 0 && (x({
               ...g,
-              geometry: { type: "GeometryCollection", geometries: m }
+              geometry: { type: "GeometryCollection", geometries: v }
             }), d = !0);
           }
         }
         if (!d) {
           if (g.geometry.type === "Polygon" || g.geometry.type === "MultiPolygon")
-            Tt(g, (v) => {
-              if (!v)
+            Ft(g, (m) => {
+              if (!m)
                 return;
-              const m = [...v.features], w = gt(ut(g)), E = w[2] - w[0];
-              w[0] - E / 4 < -180 && m.push(...Ft(v, -360).features), w[2] + E / 4 > 180 && m.push(...Ft(v, 360).features), y(Z(m));
+              const v = [...m.features], w = gt(ut(g)), E = w[2] - w[0];
+              w[0] - E / 4 < -180 && v.push(...qt(m, -360).features), w[2] + E / 4 > 180 && v.push(...qt(m, 360).features), x(Z(v));
             });
           else if (g.geometry.type === "LineString" || g.geometry.type === "MultiLineString") {
-            y(g);
+            x(g);
             return;
           }
         }
-        const x = [g.center[1], g.center[0]];
-        u.push(
-          (typeof t == "object" ? new F.Marker(x, t) : a(x)).addTo(r)
-        );
+        if (!f && g.geometry.type !== "Point")
+          return;
+        if (t instanceof Function) {
+          const m = t(r, g);
+          m && c.push(m.addTo(r));
+        } else if (t) {
+          const m = [g.center[1], g.center[0]];
+          c.push(
+            typeof t == "object" ? new T.Marker(m, t) : a(m).addTo(r)
+          );
+        }
       }
       if (e)
-        for (const d of h ?? []) {
+        for (const d of y ?? []) {
           if (d === g)
             continue;
-          const x = [
+          const m = [
             d.center[1],
             d.center[0]
-          ], v = typeof e == "object" ? new F.Marker(x, e) : a(x, !0);
-          v.addTo(r).bindTooltip(
-            d.place_type[0] === "reverse" ? d.place_name : d.place_name.replace(/,.*/, ""),
-            {
-              direction: "top"
-            }
-          );
-          const m = v.getElement();
-          m && (m.addEventListener("click", (w) => {
-            w.stopPropagation(), l == null || l({ type: "markerClick", id: d.id });
-          }), m.addEventListener("mouseenter", () => {
-            l == null || l({ type: "markerMouseEnter", id: d.id });
-          }), m.addEventListener("mouseleave", () => {
-            l == null || l({ type: "markerMouseLeave", id: d.id });
-          }), m.classList.toggle("marker-fuzzy", !!d.matching_text)), u.push(v);
+          ];
+          let v;
+          if (e instanceof Function) {
+            if (v = e(r, d), !v)
+              continue;
+          } else
+            v = (typeof e == "object" ? new T.Marker(m, e) : a(m, !0)).addTo(r).bindTooltip(
+              d.place_type[0] === "reverse" ? d.place_name : d.place_name.replace(/,.*/, ""),
+              {
+                direction: "top"
+              }
+            );
+          const w = v.getElement();
+          w && (w.addEventListener("click", (E) => {
+            E.stopPropagation(), s == null || s({ type: "markerClick", id: d.id });
+          }), w.addEventListener("mouseenter", () => {
+            s == null || s({ type: "markerMouseEnter", id: d.id });
+          }), w.addEventListener("mouseleave", () => {
+            s == null || s({ type: "markerMouseLeave", id: d.id });
+          }), w.classList.toggle("marker-fuzzy", !!d.matching_text)), c.push(v);
         }
     },
-    setSelectedMarker(h) {
-      var g, y;
-      c && ((g = c.getElement()) == null || g.classList.toggle("marker-selected", !1)), c = h > -1 ? u[h] : void 0, (y = c == null ? void 0 : c.getElement()) == null || y.classList.toggle("marker-selected", !0);
+    setSelectedMarker(y) {
+      var g, x;
+      u && ((g = u.getElement()) == null || g.classList.toggle("marker-selected", !1)), u = y > -1 ? c[y] : void 0, (x = u == null ? void 0 : u.getElement()) == null || x.classList.toggle("marker-selected", !0);
     },
     getCenterAndZoom() {
-      const h = r.getCenter();
-      return [r.getZoom(), h.lng, h.lat];
+      const y = r.getCenter();
+      return [r.getZoom(), y.lng, y.lat];
     }
   };
 }
-function Ft(r, t) {
-  const e = fe(r);
+function qt(r, t) {
+  const e = ce(r);
   for (const n of e.features)
     if (n.geometry.type == "MultiPolygon")
       for (const i of n.geometry.coordinates)
-        qt(i, t);
+        Qt(i, t);
     else
-      qt(n.geometry.coordinates, t);
+      Qt(n.geometry.coordinates, t);
   return e;
 }
-function qt(r, t) {
+function Qt(r, t) {
   for (const e of r)
     for (const n of e)
       n[0] += t;
 }
 export {
-  hn as createLeafletMapController
+  an as createLeafletMapController
 };
 //# sourceMappingURL=leaflet-controller.js.map