@maptiler/geocoding-control 0.0.60 → 0.0.61

package/dist/leaflet.js

@@ -201,6 +201,7 @@ function Ro() {
     r: 0,
     c: [],
     p: kr
+    // parent group
   };
 }
 function Oo() {
@@ -242,16 +243,19 @@ function Mi(r, t, e, n, i, o, s, a = [-1]) {
   const l = r.$$ = {
     fragment: null,
     ctx: [],
+    // state
     props: o,
     update: xt,
     not_equal: i,
     bound: ea(),
+    // lifecycle
     on_mount: [],
     on_destroy: [],
     on_disconnect: [],
     before_update: [],
     after_update: [],
     context: new Map(t.context || (u ? u.$$.context : [])),
+    // everything else
     callbacks: ea(),
     dirty: a,
     skip_bound: !1,
@@ -359,13 +363,38 @@ function bl(r) {
   let t, e, n;
   return {
     c() {
-      t = Ir("svg"), e = Ir("path"), B(e, "stroke-width", "4"), B(e, "fill-rule", "evenodd"), B(e, "clip-rule", "evenodd"), B(e, "d", "M 5,33.103579 C 5,17.607779 18.457,5 35,5 C 51.543,5 65,17.607779 65,33.103579 C 65,56.388679 40.4668,76.048179 36.6112,79.137779 C 36.3714,79.329879 36.2116,79.457979 36.1427,79.518879 C 35.8203,79.800879 35.4102,79.942779 35,79.942779 C 34.5899,79.942779 34.1797,79.800879 33.8575,79.518879 C 33.7886,79.457979 33.6289,79.330079 33.3893,79.138079 C 29.5346,76.049279 5,56.389379 5,33.103579 Z M 35.0001,49.386379 C 43.1917,49.386379 49.8323,42.646079 49.8323,34.331379 C 49.8323,26.016779 43.1917,19.276479 35.0001,19.276479 C 26.8085,19.276479 20.1679,26.016779 20.1679,34.331379 C 20.1679,42.646079 26.8085,49.386379 35.0001,49.386379 Z"), B(e, "class", "svelte-1k1cmht"), B(t, "width", n = r[0] !== "list" ? void 0 : "20"), B(t, "viewBox", "0 0 70 85"), B(t, "fill", "none"), B(t, "class", "svelte-1k1cmht"), rn(t, "in-map", r[0] !== "list"), rn(t, "list-icon", r[0] === "list");
+      t = Ir("svg"), e = Ir("path"), B(e, "stroke-width", "4"), B(e, "fill-rule", "evenodd"), B(e, "clip-rule", "evenodd"), B(e, "d", "M 5,33.103579 C 5,17.607779 18.457,5 35,5 C 51.543,5 65,17.607779 65,33.103579 C 65,56.388679 40.4668,76.048179 36.6112,79.137779 C 36.3714,79.329879 36.2116,79.457979 36.1427,79.518879 C 35.8203,79.800879 35.4102,79.942779 35,79.942779 C 34.5899,79.942779 34.1797,79.800879 33.8575,79.518879 C 33.7886,79.457979 33.6289,79.330079 33.3893,79.138079 C 29.5346,76.049279 5,56.389379 5,33.103579 Z M 35.0001,49.386379 C 43.1917,49.386379 49.8323,42.646079 49.8323,34.331379 C 49.8323,26.016779 43.1917,19.276479 35.0001,19.276479 C 26.8085,19.276479 20.1679,26.016779 20.1679,34.331379 C 20.1679,42.646079 26.8085,49.386379 35.0001,49.386379 Z"), B(e, "class", "svelte-1k1cmht"), B(t, "width", n = /*displayIn*/
+      r[0] !== "list" ? void 0 : "20"), B(t, "viewBox", "0 0 70 85"), B(t, "fill", "none"), B(t, "class", "svelte-1k1cmht"), rn(
+        t,
+        "in-map",
+        /*displayIn*/
+        r[0] !== "list"
+      ), rn(
+        t,
+        "list-icon",
+        /*displayIn*/
+        r[0] === "list"
+      );
     },
     m(i, o) {
       Ke(i, t, o), lt(t, e);
     },
     p(i, [o]) {
-      o & 1 && n !== (n = i[0] !== "list" ? void 0 : "20") && B(t, "width", n), o & 1 && rn(t, "in-map", i[0] !== "list"), o & 1 && rn(t, "list-icon", i[0] === "list");
+      o & /*displayIn*/
+      1 && n !== (n = /*displayIn*/
+      i[0] !== "list" ? void 0 : "20") && B(t, "width", n), o & /*displayIn*/
+      1 && rn(
+        t,
+        "in-map",
+        /*displayIn*/
+        i[0] !== "list"
+      ), o & /*displayIn*/
+      1 && rn(
+        t,
+        "list-icon",
+        /*displayIn*/
+        i[0] === "list"
+      );
     },
     i: xt,
     o: xt,
@@ -435,13 +464,40 @@ function aa(r) {
   let t, e, n, i, o;
   return e = new Nl({}), {
     c() {
-      t = Qt("button"), Qi(e.$$.fragment), B(t, "type", "button"), B(t, "title", r[8]), B(t, "class", "svelte-1h1zm6d"), rn(t, "active", r[1]);
+      t = Qt("button"), Qi(e.$$.fragment), B(t, "type", "button"), B(
+        t,
+        "title",
+        /*reverseButtonTitle*/
+        r[8]
+      ), B(t, "class", "svelte-1h1zm6d"), rn(
+        t,
+        "active",
+        /*reverseActive*/
+        r[1]
+      );
     },
     m(s, a) {
-      Ke(s, t, a), ci(e, t, null), n = !0, i || (o = ke(t, "click", r[55]), i = !0);
+      Ke(s, t, a), ci(e, t, null), n = !0, i || (o = ke(
+        t,
+        "click",
+        /*click_handler_2*/
+        r[55]
+      ), i = !0);
     },
     p(s, a) {
-      (!n || a[0] & 256) && B(t, "title", s[8]), (!n || a[0] & 2) && rn(t, "active", s[1]);
+      (!n || a[0] & /*reverseButtonTitle*/
+      256) && B(
+        t,
+        "title",
+        /*reverseButtonTitle*/
+        s[8]
+      ), (!n || a[0] & /*reverseActive*/
+      2) && rn(
+        t,
+        "active",
+        /*reverseActive*/
+        s[1]
+      );
     },
     i(s) {
       n || (Kt(e.$$.fragment, s), n = !0);
@@ -455,7 +511,10 @@ function aa(r) {
   };
 }
 function Dl(r) {
-  let t, e, n, i, o = r[12], s = [];
+  let t, e, n, i, o = (
+    /*listFeatures*/
+    r[12]
+  ), s = [];
   for (let u = 0; u < o.length; u += 1)
     s[u] = la(oa(r, o, u));
   const a = (u) => be(s[u], 1, 1, () => {
@@ -473,13 +532,25 @@ function Dl(r) {
       for (let c = 0; c < s.length; c += 1)
         s[c].m(t, null);
       e = !0, n || (i = [
-        ke(t, "mouseout", r[58]),
-        ke(t, "blur", r[59])
+        ke(
+          t,
+          "mouseout",
+          /*mouseout_handler*/
+          r[58]
+        ),
+        ke(
+          t,
+          "blur",
+          /*blur_handler_1*/
+          r[59]
+        )
       ], n = !0);
     },
     p(u, l) {
-      if (l[0] & 2110464) {
-        o = u[12];
+      if (l[0] & /*selectedItemIndex, pick, listFeatures, showPlaceType*/
+      2110464) {
+        o = /*listFeatures*/
+        u[12];
         let c;
         for (c = 0; c < o.length; c += 1) {
           const f = oa(u, o, c);
@@ -512,13 +583,21 @@ function Tl(r) {
   let t, e;
   return {
     c() {
-      t = Qt("div"), e = Vr(r[5]), B(t, "class", "no-results svelte-1h1zm6d");
+      t = Qt("div"), e = Vr(
+        /*noResultsMessage*/
+        r[5]
+      ), B(t, "class", "no-results svelte-1h1zm6d");
     },
     m(n, i) {
       Ke(n, t, i), lt(t, e);
     },
     p(n, i) {
-      i[0] & 32 && ji(e, n[5]);
+      i[0] & /*noResultsMessage*/
+      32 && ji(
+        e,
+        /*noResultsMessage*/
+        n[5]
+      );
     },
     i: xt,
     o: xt,
@@ -548,13 +627,21 @@ function Al(r) {
   let t, e;
   return {
     c() {
-      t = Qt("div"), e = Vr(r[4]), B(t, "class", "error svelte-1h1zm6d");
+      t = Qt("div"), e = Vr(
+        /*errorMessage*/
+        r[4]
+      ), B(t, "class", "error svelte-1h1zm6d");
     },
     m(n, i) {
       Ke(n, t, i), lt(t, e);
     },
     p(n, i) {
-      i[0] & 16 && ji(e, n[4]);
+      i[0] & /*errorMessage*/
+      16 && ji(
+        e,
+        /*errorMessage*/
+        n[4]
+      );
     },
     i: xt,
     o: xt,
@@ -564,35 +651,73 @@ function Al(r) {
   };
 }
 function ua(r) {
-  let t, e = r[68].place_type + "", n;
+  var i, o;
+  let t, e = (
+    /*feature*/
+    (((o = (i = r[68].properties) == null ? void 0 : i.place_type_name) == null ? void 0 : o[0]) ?? /*feature*/
+    r[68].place_type[0]) + ""
+  ), n;
   return {
     c() {
       t = Qt("span"), n = Vr(e), B(t, "class", "svelte-1h1zm6d");
     },
-    m(i, o) {
-      Ke(i, t, o), lt(t, n);
+    m(s, a) {
+      Ke(s, t, a), lt(t, n);
     },
-    p(i, o) {
-      o[0] & 4096 && e !== (e = i[68].place_type + "") && ji(n, e);
+    p(s, a) {
+      var u, l;
+      a[0] & /*listFeatures*/
+      4096 && e !== (e = /*feature*/
+      (((l = (u = s[68].properties) == null ? void 0 : u.place_type_name) == null ? void 0 : l[0]) ?? /*feature*/
+      s[68].place_type[0]) + "") && ji(n, e);
     },
-    d(i) {
-      i && Ae(t);
+    d(s) {
+      s && Ae(t);
     }
   };
 }
 function la(r) {
-  let t, e, n, i, o, s, a = r[68].place_name.replace(/,.*/, "") + "", u, l, c, f, h, g = r[68].place_name.replace(/[^,]*,?\s*/, "") + "", p, m, d, y, I, C;
+  let t, e, n, i, o, s, a = (
+    /*feature*/
+    r[68].place_name.replace(/,.*/, "") + ""
+  ), u, l, c, f, h, g = (
+    /*feature*/
+    r[68].place_name.replace(/[^,]*,?\s*/, "") + ""
+  ), p, m, d, y, I, C;
   e = new Ka({ props: { displayIn: "list" } });
-  let x = r[10] && ua(r);
+  let x = (
+    /*showPlaceType*/
+    r[10] && ua(r)
+  );
   function b() {
-    return r[56](r[70]);
+    return (
+      /*mouseover_handler*/
+      r[56](
+        /*i*/
+        r[70]
+      )
+    );
   }
   function w() {
-    return r[57](r[68]);
+    return (
+      /*focus_handler_1*/
+      r[57](
+        /*feature*/
+        r[68]
+      )
+    );
   }
   return {
     c() {
-      t = Qt("li"), Qi(e.$$.fragment), n = qn(), i = Qt("span"), o = Qt("span"), s = Qt("span"), u = Vr(a), l = qn(), x && x.c(), c = qn(), f = Qt("span"), h = Qt("span"), p = Vr(g), m = qn(), B(s, "class", "svelte-1h1zm6d"), B(o, "class", "svelte-1h1zm6d"), B(i, "class", "svelte-1h1zm6d"), B(h, "class", "svelte-1h1zm6d"), B(f, "class", "svelte-1h1zm6d"), B(t, "tabindex", "0"), B(t, "data-selected", d = r[13] === r[70]), B(t, "class", "svelte-1h1zm6d"), rn(t, "selected", r[13] === r[70]);
+      t = Qt("li"), Qi(e.$$.fragment), n = qn(), i = Qt("span"), o = Qt("span"), s = Qt("span"), u = Vr(a), l = qn(), x && x.c(), c = qn(), f = Qt("span"), h = Qt("span"), p = Vr(g), m = qn(), B(s, "class", "svelte-1h1zm6d"), B(o, "class", "svelte-1h1zm6d"), B(i, "class", "svelte-1h1zm6d"), B(h, "class", "svelte-1h1zm6d"), B(f, "class", "svelte-1h1zm6d"), B(t, "tabindex", "0"), B(t, "data-selected", d = /*selectedItemIndex*/
+      r[13] === /*i*/
+      r[70]), B(t, "class", "svelte-1h1zm6d"), rn(
+        t,
+        "selected",
+        /*selectedItemIndex*/
+        r[13] === /*i*/
+        r[70]
+      );
     },
     m(D, T) {
       Ke(D, t, T), ci(e, t, null), lt(t, n), lt(t, i), lt(i, o), lt(o, s), lt(s, u), lt(o, l), x && x.m(o, null), lt(t, c), lt(t, f), lt(f, h), lt(h, p), lt(t, m), y = !0, I || (C = [
@@ -601,7 +726,22 @@ function la(r) {
       ], I = !0);
     },
     p(D, T) {
-      r = D, (!y || T[0] & 4096) && a !== (a = r[68].place_name.replace(/,.*/, "") + "") && ji(u, a), r[10] ? x ? x.p(r, T) : (x = ua(r), x.c(), x.m(o, null)) : x && (x.d(1), x = null), (!y || T[0] & 4096) && g !== (g = r[68].place_name.replace(/[^,]*,?\s*/, "") + "") && ji(p, g), (!y || T[0] & 8192 && d !== (d = r[13] === r[70])) && B(t, "data-selected", d), (!y || T[0] & 8192) && rn(t, "selected", r[13] === r[70]);
+      r = D, (!y || T[0] & /*listFeatures*/
+      4096) && a !== (a = /*feature*/
+      r[68].place_name.replace(/,.*/, "") + "") && ji(u, a), /*showPlaceType*/
+      r[10] ? x ? x.p(r, T) : (x = ua(r), x.c(), x.m(o, null)) : x && (x.d(1), x = null), (!y || T[0] & /*listFeatures*/
+      4096) && g !== (g = /*feature*/
+      r[68].place_name.replace(/[^,]*,?\s*/, "") + "") && ji(p, g), (!y || T[0] & /*selectedItemIndex*/
+      8192 && d !== (d = /*selectedItemIndex*/
+      r[13] === /*i*/
+      r[70])) && B(t, "data-selected", d), (!y || T[0] & /*selectedItemIndex*/
+      8192) && rn(
+        t,
+        "selected",
+        /*selectedItemIndex*/
+        r[13] === /*i*/
+        r[70]
+      );
     },
     i(D) {
       y || (Kt(e.$$.fragment, D), y = !0);
@@ -617,45 +757,200 @@ function la(r) {
 function Fl(r) {
   let t, e, n, i, o, s, a, u, l, c, f, h, g, p, m, d, y, I, C, x;
   i = new Ol({}), c = new Sl({});
-  let b = r[17] && sa(), w = r[7] === !0 && aa(r);
-  const D = r[47].default, T = ul(D, r, r[46], null), F = [Al, Ml, Tl, Dl], j = [];
+  let b = (
+    /*abortController*/
+    r[17] && sa()
+  ), w = (
+    /*enableReverse*/
+    r[7] === !0 && aa(r)
+  );
+  const D = (
+    /*#slots*/
+    r[47].default
+  ), T = ul(
+    D,
+    r,
+    /*$$scope*/
+    r[46],
+    null
+  ), F = [Al, Ml, Tl, Dl], j = [];
   function k(O, Y) {
     var P, X;
-    return O[16] ? 0 : O[14] ? ((P = O[12]) == null ? void 0 : P.length) === 0 ? 2 : O[14] && ((X = O[12]) != null && X.length) ? 3 : -1 : 1;
+    return (
+      /*error*/
+      O[16] ? 0 : (
+        /*focusedDelayed*/
+        O[14] ? (
+          /*listFeatures*/
+          ((P = O[12]) == null ? void 0 : P.length) === 0 ? 2 : (
+            /*focusedDelayed*/
+            O[14] && /*listFeatures*/
+            ((X = O[12]) != null && X.length) ? 3 : -1
+          )
+        ) : 1
+      )
+    );
   }
   return ~(m = k(r)) && (d = j[m] = F[m](r)), {
     c() {
-      t = Qt("form"), e = Qt("div"), n = Qt("button"), Qi(i.$$.fragment), o = qn(), s = Qt("input"), a = qn(), u = Qt("div"), l = Qt("button"), Qi(c.$$.fragment), f = qn(), b && b.c(), h = qn(), w && w.c(), g = qn(), T && T.c(), p = qn(), d && d.c(), B(n, "type", "button"), B(n, "class", "svelte-1h1zm6d"), B(s, "placeholder", r[3]), B(s, "aria-label", r[3]), B(s, "class", "svelte-1h1zm6d"), B(l, "type", "button"), B(l, "title", r[9]), B(l, "class", "svelte-1h1zm6d"), rn(l, "displayable", r[0] !== ""), B(u, "class", "clear-button-container svelte-1h1zm6d"), B(e, "class", "input-group svelte-1h1zm6d"), B(t, "tabindex", "0"), B(t, "class", y = na(r[2]) + " svelte-1h1zm6d"), rn(t, "can-collapse", r[6] && r[0] === "");
+      t = Qt("form"), e = Qt("div"), n = Qt("button"), Qi(i.$$.fragment), o = qn(), s = Qt("input"), a = qn(), u = Qt("div"), l = Qt("button"), Qi(c.$$.fragment), f = qn(), b && b.c(), h = qn(), w && w.c(), g = qn(), T && T.c(), p = qn(), d && d.c(), B(n, "type", "button"), B(n, "class", "svelte-1h1zm6d"), B(
+        s,
+        "placeholder",
+        /*placeholder*/
+        r[3]
+      ), B(
+        s,
+        "aria-label",
+        /*placeholder*/
+        r[3]
+      ), B(s, "class", "svelte-1h1zm6d"), B(l, "type", "button"), B(
+        l,
+        "title",
+        /*clearButtonTitle*/
+        r[9]
+      ), B(l, "class", "svelte-1h1zm6d"), rn(
+        l,
+        "displayable",
+        /*searchValue*/
+        r[0] !== ""
+      ), B(u, "class", "clear-button-container svelte-1h1zm6d"), B(e, "class", "input-group svelte-1h1zm6d"), B(t, "tabindex", "0"), B(t, "class", y = na(
+        /*className*/
+        r[2]
+      ) + " svelte-1h1zm6d"), rn(
+        t,
+        "can-collapse",
+        /*collapsed*/
+        r[6] && /*searchValue*/
+        r[0] === ""
+      );
     },
     m(O, Y) {
-      Ke(O, t, Y), lt(t, e), lt(e, n), ci(i, n, null), lt(e, o), lt(e, s), r[49](s), ra(s, r[0]), lt(e, a), lt(e, u), lt(u, l), ci(c, l, null), lt(u, f), b && b.m(u, null), lt(e, h), w && w.m(e, null), lt(e, g), T && T.m(e, null), lt(t, p), ~m && j[m].m(t, null), I = !0, C || (x = [
-        ke(n, "click", r[48]),
-        ke(s, "input", r[50]),
-        ke(s, "focus", r[51]),
-        ke(s, "blur", r[52]),
-        ke(s, "keydown", r[19]),
-        ke(s, "input", r[53]),
-        ke(l, "click", r[54]),
-        ke(t, "submit", gl(r[18]))
+      Ke(O, t, Y), lt(t, e), lt(e, n), ci(i, n, null), lt(e, o), lt(e, s), r[49](s), ra(
+        s,
+        /*searchValue*/
+        r[0]
+      ), lt(e, a), lt(e, u), lt(u, l), ci(c, l, null), lt(u, f), b && b.m(u, null), lt(e, h), w && w.m(e, null), lt(e, g), T && T.m(e, null), lt(t, p), ~m && j[m].m(t, null), I = !0, C || (x = [
+        ke(
+          n,
+          "click",
+          /*click_handler*/
+          r[48]
+        ),
+        ke(
+          s,
+          "input",
+          /*input_1_input_handler*/
+          r[50]
+        ),
+        ke(
+          s,
+          "focus",
+          /*focus_handler*/
+          r[51]
+        ),
+        ke(
+          s,
+          "blur",
+          /*blur_handler*/
+          r[52]
+        ),
+        ke(
+          s,
+          "keydown",
+          /*handleKeyDown*/
+          r[19]
+        ),
+        ke(
+          s,
+          "input",
+          /*input_handler*/
+          r[53]
+        ),
+        ke(
+          l,
+          "click",
+          /*click_handler_1*/
+          r[54]
+        ),
+        ke(t, "submit", gl(
+          /*handleOnSubmit*/
+          r[18]
+        ))
       ], C = !0);
     },
     p(O, Y) {
-      (!I || Y[0] & 8) && B(s, "placeholder", O[3]), (!I || Y[0] & 8) && B(s, "aria-label", O[3]), Y[0] & 1 && s.value !== O[0] && ra(s, O[0]), (!I || Y[0] & 512) && B(l, "title", O[9]), (!I || Y[0] & 1) && rn(l, "displayable", O[0] !== ""), O[17] ? b ? Y[0] & 131072 && Kt(b, 1) : (b = sa(), b.c(), Kt(b, 1), b.m(u, null)) : b && (Ro(), be(b, 1, 1, () => {
+      (!I || Y[0] & /*placeholder*/
+      8) && B(
+        s,
+        "placeholder",
+        /*placeholder*/
+        O[3]
+      ), (!I || Y[0] & /*placeholder*/
+      8) && B(
+        s,
+        "aria-label",
+        /*placeholder*/
+        O[3]
+      ), Y[0] & /*searchValue*/
+      1 && s.value !== /*searchValue*/
+      O[0] && ra(
+        s,
+        /*searchValue*/
+        O[0]
+      ), (!I || Y[0] & /*clearButtonTitle*/
+      512) && B(
+        l,
+        "title",
+        /*clearButtonTitle*/
+        O[9]
+      ), (!I || Y[0] & /*searchValue*/
+      1) && rn(
+        l,
+        "displayable",
+        /*searchValue*/
+        O[0] !== ""
+      ), /*abortController*/
+      O[17] ? b ? Y[0] & /*abortController*/
+      131072 && Kt(b, 1) : (b = sa(), b.c(), Kt(b, 1), b.m(u, null)) : b && (Ro(), be(b, 1, 1, () => {
         b = null;
-      }), Oo()), O[7] === !0 ? w ? (w.p(O, Y), Y[0] & 128 && Kt(w, 1)) : (w = aa(O), w.c(), Kt(w, 1), w.m(e, g)) : w && (Ro(), be(w, 1, 1, () => {
+      }), Oo()), /*enableReverse*/
+      O[7] === !0 ? w ? (w.p(O, Y), Y[0] & /*enableReverse*/
+      128 && Kt(w, 1)) : (w = aa(O), w.c(), Kt(w, 1), w.m(e, g)) : w && (Ro(), be(w, 1, 1, () => {
         w = null;
-      }), Oo()), T && T.p && (!I || Y[1] & 32768) && cl(
+      }), Oo()), T && T.p && (!I || Y[1] & /*$$scope*/
+      32768) && cl(
         T,
         D,
         O,
+        /*$$scope*/
         O[46],
-        I ? ll(D, O[46], Y, null) : fl(O[46]),
+        I ? ll(
+          D,
+          /*$$scope*/
+          O[46],
+          Y,
+          null
+        ) : fl(
+          /*$$scope*/
+          O[46]
+        ),
         null
       );
       let P = m;
       m = k(O), m === P ? ~m && j[m].p(O, Y) : (d && (Ro(), be(j[P], 1, 1, () => {
         j[P] = null;
-      }), Oo()), ~m ? (d = j[m], d ? d.p(O, Y) : (d = j[m] = F[m](O), d.c()), Kt(d, 1), d.m(t, null)) : d = null), (!I || Y[0] & 4 && y !== (y = na(O[2]) + " svelte-1h1zm6d")) && B(t, "class", y), (!I || Y[0] & 69) && rn(t, "can-collapse", O[6] && O[0] === "");
+      }), Oo()), ~m ? (d = j[m], d ? d.p(O, Y) : (d = j[m] = F[m](O), d.c()), Kt(d, 1), d.m(t, null)) : d = null), (!I || Y[0] & /*className*/
+      4 && y !== (y = na(
+        /*className*/
+        O[2]
+      ) + " svelte-1h1zm6d")) && B(t, "class", y), (!I || Y[0] & /*className, collapsed, searchValue*/
+      69) && rn(
+        t,
+        "can-collapse",
+        /*collapsed*/
+        O[6] && /*searchValue*/
+        O[0] === ""
+      );
     },
     i(O) {
       I || (Kt(i.$$.fragment, O), Kt(c.$$.fragment, O), Kt(b), Kt(w), Kt(T, O), Kt(d), I = !0);
@@ -780,9 +1075,22 @@ function Gl(r, t, e) {
   return r.$$set = (N) => {
     "class" in N && e(2, s = N.class), "mapController" in N && e(23, a = N.mapController), "apiKey" in N && e(24, u = N.apiKey), "debounceSearch" in N && e(25, l = N.debounceSearch), "placeholder" in N && e(3, c = N.placeholder), "errorMessage" in N && e(4, f = N.errorMessage), "noResultsMessage" in N && e(5, h = N.noResultsMessage), "proximity" in N && e(22, g = N.proximity), "bbox" in N && e(26, p = N.bbox), "trackProximity" in N && e(27, m = N.trackProximity), "minLength" in N && e(28, d = N.minLength), "language" in N && e(29, y = N.language), "showResultsWhileTyping" in N && e(30, I = N.showResultsWhileTyping), "zoom" in N && e(31, C = N.zoom), "flyTo" in N && e(32, x = N.flyTo), "collapsed" in N && e(6, b = N.collapsed), "clearOnBlur" in N && e(33, w = N.clearOnBlur), "enableReverse" in N && e(7, D = N.enableReverse), "reverseButtonTitle" in N && e(8, T = N.reverseButtonTitle), "clearButtonTitle" in N && e(9, F = N.clearButtonTitle), "filter" in N && e(34, j = N.filter), "searchValue" in N && e(0, k = N.searchValue), "reverseActive" in N && e(1, O = N.reverseActive), "showPlaceType" in N && e(10, Y = N.showPlaceType), "showFullGeometry" in N && e(35, P = N.showFullGeometry), "limit" in N && e(36, X = N.limit), "fuzzyMatch" in N && e(37, ut = N.fuzzyMatch), "country" in N && e(38, yt = N.country), "types" in N && e(39, Xt = N.types), "$$scope" in N && e(46, o = N.$$scope);
   }, r.$$.update = () => {
-    if (r.$$.dirty[0] & 134217728 && (m || e(22, g = void 0)), r.$$.dirty[0] & 2048 | r.$$.dirty[1] & 4 && setTimeout(() => {
+    if (r.$$.dirty[0] & /*trackProximity*/
+    134217728 && (m || e(22, g = void 0)), r.$$.dirty[0] & /*focused*/
+    2048 | r.$$.dirty[1] & /*clearOnBlur*/
+    4 && setTimeout(() => {
       e(14, Io = Le), w && !Le && e(0, k = "");
-    }), r.$$.dirty[0] & 4097 && (k || (e(44, it = void 0), e(12, J = void 0), e(16, gr = void 0), e(43, Mt = J))), r.$$.dirty[1] & 8208 && P && it && !it.address && it.geometry.type === "Point" && ss(it.id, { byId: !0 }).catch((N) => e(16, gr = N)), r.$$.dirty[0] & 8388608 | r.$$.dirty[1] & 8195 && a && it && x && (!it.bbox || it.bbox[0] === it.bbox[2] && it.bbox[1] === it.bbox[3] ? a.flyTo(it.center, C) : a.fitBounds(it.bbox, 50), e(12, J = void 0), e(43, Mt = void 0), e(13, At = -1)), r.$$.dirty[0] & 4096 | r.$$.dirty[1] & 4096 && Mt !== J && e(43, Mt = void 0), r.$$.dirty[0] & 8388608 | r.$$.dirty[1] & 12288 && a && a.setMarkers(Mt, it), r.$$.dirty[0] & 1 && e(13, At = -1), r.$$.dirty[0] & 142626818 && a && a.setEventHandler((N) => {
+    }), r.$$.dirty[0] & /*searchValue, listFeatures*/
+    4097 && (k || (e(44, it = void 0), e(12, J = void 0), e(16, gr = void 0), e(43, Mt = J))), r.$$.dirty[1] & /*showFullGeometry, picked*/
+    8208 && P && it && !it.address && it.geometry.type === "Point" && ss(it.id, { byId: !0 }).catch((N) => e(16, gr = N)), r.$$.dirty[0] & /*mapController*/
+    8388608 | r.$$.dirty[1] & /*picked, flyTo, zoom*/
+    8195 && a && it && x && (!it.bbox || it.bbox[0] === it.bbox[2] && it.bbox[1] === it.bbox[3] ? a.flyTo(it.center, C) : a.fitBounds(it.bbox, 50), e(12, J = void 0), e(43, Mt = void 0), e(13, At = -1)), r.$$.dirty[0] & /*listFeatures*/
+    4096 | r.$$.dirty[1] & /*markedFeatures*/
+    4096 && Mt !== J && e(43, Mt = void 0), r.$$.dirty[0] & /*mapController*/
+    8388608 | r.$$.dirty[1] & /*markedFeatures, picked*/
+    12288 && a && a.setMarkers(Mt, it), r.$$.dirty[0] & /*searchValue*/
+    1 && e(13, At = -1), r.$$.dirty[0] & /*mapController, reverseActive, trackProximity, listFeatures, focusedDelayed*/
+    142626818 && a && a.setEventHandler((N) => {
       switch (N.type) {
         case "mapClick":
           O && Hu(N.coordinates);
@@ -803,11 +1111,22 @@ function Gl(r, t, e) {
           e(13, At = -1);
           break;
       }
-    }), r.$$.dirty[0] & 8396800 && (a == null || a.setSelectedMarker(At)), r.$$.dirty[0] & 12288 && e(45, n = J == null ? void 0 : J[At]), r.$$.dirty[0] & 8388609) {
+    }), r.$$.dirty[0] & /*mapController, selectedItemIndex*/
+    8396800 && (a == null || a.setSelectedMarker(At)), r.$$.dirty[0] & /*listFeatures, selectedItemIndex*/
+    12288 && e(45, n = J == null ? void 0 : J[At]), r.$$.dirty[0] & /*searchValue, mapController*/
+    8388609) {
       const N = /^(-?\d+(?:\.\d*)?),(-?\d+(?:\.\d*)?)$/.exec(k);
       a == null || a.setReverseMarker(N ? [Number(N[1]), Number(N[2])] : void 0);
     }
-    r.$$.dirty[1] & 16384 && pr("select", n), r.$$.dirty[1] & 8192 && pr("pick", it), r.$$.dirty[0] & 20480 && pr("optionsVisibilityChange", Io && !!J), r.$$.dirty[0] & 4096 && pr("featuresListed", J), r.$$.dirty[1] & 4096 && pr("featuresMarked", Mt), r.$$.dirty[0] & 2 && pr("reverseToggle", O), r.$$.dirty[0] & 1 && pr("queryChange", k), r.$$.dirty[0] & 8388610 && a && a.indicateReverse(O);
+    r.$$.dirty[1] & /*selected*/
+    16384 && pr("select", n), r.$$.dirty[1] & /*picked*/
+    8192 && pr("pick", it), r.$$.dirty[0] & /*focusedDelayed, listFeatures*/
+    20480 && pr("optionsVisibilityChange", Io && !!J), r.$$.dirty[0] & /*listFeatures*/
+    4096 && pr("featuresListed", J), r.$$.dirty[1] & /*markedFeatures*/
+    4096 && pr("featuresMarked", Mt), r.$$.dirty[0] & /*reverseActive*/
+    2 && pr("reverseToggle", O), r.$$.dirty[0] & /*searchValue*/
+    1 && pr("queryChange", k), r.$$.dirty[0] & /*mapController, reverseActive*/
+    8388610 && a && a.indicateReverse(O);
   }, [
     k,
     O,
@@ -927,6 +1246,28 @@ let kl = class extends Ai {
     return this.$$.ctx[42];
   }
 };
+/**
+ * splaytree v3.1.1
+ * 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 zl(r, t) {
   var e = { label: 0, sent: function() {
     if (o[0] & 1)
@@ -992,12 +1333,15 @@ function zl(r, t) {
     return { value: l[0] ? l[1] : void 0, done: !0 };
   }
 }
-var Cr = function() {
-  function r(t, e) {
-    this.next = null, this.key = t, this.data = e, this.left = null, this.right = null;
-  }
-  return r;
-}();
+var Cr = (
+  /** @class */
+  function() {
+    function r(t, e) {
+      this.next = null, this.key = t, this.data = e, this.left = null, this.right = null;
+    }
+    return r;
+  }()
+);
 function Vl(r, t) {
   return r > t ? 1 : r < t ? -1 : 0;
 }
@@ -1055,190 +1399,196 @@ function Es(r, t, e, n, i) {
     r.left && Es(r.left, o, !1, n, i), r.right && Es(r.right, o, !0, n, i);
   }
 }
-var Ms = function() {
-  function r(t) {
-    t === void 0 && (t = Vl), this._root = null, this._size = 0, this._comparator = t;
-  }
-  return r.prototype.insert = function(t, e) {
-    return this._size++, this._root = gs(t, e, this._root, this._comparator);
-  }, r.prototype.add = function(t, e) {
-    var n = new Cr(t, e);
-    this._root === null && (n.left = n.right = null, this._size++, this._root = n);
-    var i = this._comparator, o = yr(t, this._root, i), s = i(t, o.key);
-    return s === 0 ? this._root = o : (s < 0 ? (n.left = o.left, n.right = o, o.left = null) : s > 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) {
-    var i;
-    if (e === null)
+var Ms = (
+  /** @class */
+  function() {
+    function r(t) {
+      t === void 0 && (t = Vl), this._root = null, this._size = 0, this._comparator = t;
+    }
+    return r.prototype.insert = function(t, e) {
+      return this._size++, this._root = gs(t, e, this._root, this._comparator);
+    }, r.prototype.add = function(t, e) {
+      var n = new Cr(t, e);
+      this._root === null && (n.left = n.right = null, this._size++, this._root = n);
+      var i = this._comparator, o = yr(t, this._root, i), s = i(t, o.key);
+      return s === 0 ? this._root = o : (s < 0 ? (n.left = o.left, n.right = o, o.left = null) : s > 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) {
+      var i;
+      if (e === null)
+        return null;
+      e = yr(t, e, n);
+      var o = n(t, e.key);
+      return o === 0 ? (e.left === null ? i = e.right : (i = yr(t, e.left, n), i.right = e.right), this._size--, i) : e;
+    }, r.prototype.pop = function() {
+      var t = this._root;
+      if (t) {
+        for (; t.left; )
+          t = t.left;
+        return this._root = yr(t.key, this._root, this._comparator), this._root = this._remove(t.key, this._root, this._comparator), { key: t.key, data: t.data };
+      }
       return null;
-    e = yr(t, e, n);
-    var o = n(t, e.key);
-    return o === 0 ? (e.left === null ? i = e.right : (i = yr(t, e.left, n), i.right = e.right), this._size--, i) : e;
-  }, r.prototype.pop = function() {
-    var t = this._root;
-    if (t) {
-      for (; t.left; )
-        t = t.left;
-      return this._root = yr(t.key, this._root, this._comparator), this._root = this._remove(t.key, this._root, this._comparator), { key: t.key, data: t.data };
-    }
-    return null;
-  }, r.prototype.findStatic = function(t) {
-    for (var e = this._root, n = this._comparator; e; ) {
-      var i = n(t, e.key);
-      if (i === 0)
-        return e;
-      i < 0 ? e = e.left : e = e.right;
-    }
-    return null;
-  }, r.prototype.find = function(t) {
-    return this._root && (this._root = yr(t, this._root, this._comparator), this._comparator(t, this._root.key) !== 0) ? null : this._root;
-  }, r.prototype.contains = function(t) {
-    for (var e = this._root, n = this._comparator; e; ) {
-      var i = n(t, e.key);
-      if (i === 0)
-        return !0;
-      i < 0 ? e = e.left : e = e.right;
-    }
-    return !1;
-  }, r.prototype.forEach = function(t, e) {
-    for (var n = this._root, i = [], o = !1; !o; )
-      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 = [], s = this._comparator, a = this._root, u; o.length !== 0 || a; )
-      if (a)
-        o.push(a), a = a.left;
-      else {
-        if (a = o.pop(), u = s(a.key, e), u > 0)
+    }, r.prototype.findStatic = function(t) {
+      for (var e = this._root, n = this._comparator; e; ) {
+        var i = n(t, e.key);
+        if (i === 0)
+          return e;
+        i < 0 ? e = e.left : e = e.right;
+      }
+      return null;
+    }, r.prototype.find = function(t) {
+      return this._root && (this._root = yr(t, this._root, this._comparator), this._comparator(t, this._root.key) !== 0) ? null : this._root;
+    }, r.prototype.contains = function(t) {
+      for (var e = this._root, n = this._comparator; e; ) {
+        var i = n(t, e.key);
+        if (i === 0)
+          return !0;
+        i < 0 ? e = e.left : e = e.right;
+      }
+      return !1;
+    }, r.prototype.forEach = function(t, e) {
+      for (var n = this._root, i = [], o = !1; !o; )
+        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 = [], s = this._comparator, a = this._root, u; o.length !== 0 || a; )
+        if (a)
+          o.push(a), a = a.left;
+        else {
+          if (a = o.pop(), u = s(a.key, e), u > 0)
+            break;
+          if (s(a.key, t) >= 0 && n.call(i, a))
+            return this;
+          a = a.right;
+        }
+      return this;
+    }, r.prototype.keys = function() {
+      var t = [];
+      return this.forEach(function(e) {
+        var n = e.key;
+        return t.push(n);
+      }), t;
+    }, r.prototype.values = function() {
+      var t = [];
+      return this.forEach(function(e) {
+        var n = e.data;
+        return t.push(n);
+      }), t;
+    }, r.prototype.min = function() {
+      return this._root ? this.minNode(this._root).key : null;
+    }, r.prototype.max = function() {
+      return this._root ? this.maxNode(this._root).key : null;
+    }, r.prototype.minNode = function(t) {
+      if (t === void 0 && (t = this._root), t)
+        for (; t.left; )
+          t = t.left;
+      return t;
+    }, r.prototype.maxNode = function(t) {
+      if (t === void 0 && (t = this._root), t)
+        for (; t.right; )
+          t = t.right;
+      return t;
+    }, r.prototype.at = function(t) {
+      for (var e = this._root, n = !1, i = 0, o = []; !n; )
+        if (e)
+          o.push(e), e = e.left;
+        else if (o.length > 0) {
+          if (e = o.pop(), i === t)
+            return e;
+          i++, e = e.right;
+        } else
+          n = !0;
+      return null;
+    }, r.prototype.next = function(t) {
+      var e = this._root, n = null;
+      if (t.right) {
+        for (n = t.right; n.left; )
+          n = n.left;
+        return n;
+      }
+      for (var i = this._comparator; e; ) {
+        var o = i(t.key, e.key);
+        if (o === 0)
           break;
-        if (s(a.key, t) >= 0 && n.call(i, a))
-          return this;
-        a = a.right;
+        o < 0 ? (n = e, e = e.left) : e = e.right;
       }
-    return this;
-  }, r.prototype.keys = function() {
-    var t = [];
-    return this.forEach(function(e) {
-      var n = e.key;
-      return t.push(n);
-    }), t;
-  }, r.prototype.values = function() {
-    var t = [];
-    return this.forEach(function(e) {
-      var n = e.data;
-      return t.push(n);
-    }), t;
-  }, r.prototype.min = function() {
-    return this._root ? this.minNode(this._root).key : null;
-  }, r.prototype.max = function() {
-    return this._root ? this.maxNode(this._root).key : null;
-  }, r.prototype.minNode = function(t) {
-    if (t === void 0 && (t = this._root), t)
-      for (; t.left; )
-        t = t.left;
-    return t;
-  }, r.prototype.maxNode = function(t) {
-    if (t === void 0 && (t = this._root), t)
-      for (; t.right; )
-        t = t.right;
-    return t;
-  }, r.prototype.at = function(t) {
-    for (var e = this._root, n = !1, i = 0, o = []; !n; )
-      if (e)
-        o.push(e), e = e.left;
-      else if (o.length > 0) {
-        if (e = o.pop(), i === t)
-          return e;
-        i++, e = e.right;
-      } else
-        n = !0;
-    return null;
-  }, r.prototype.next = function(t) {
-    var e = this._root, n = null;
-    if (t.right) {
-      for (n = t.right; n.left; )
-        n = n.left;
       return n;
-    }
-    for (var i = this._comparator; e; ) {
-      var o = i(t.key, e.key);
-      if (o === 0)
-        break;
-      o < 0 ? (n = e, e = e.left) : e = e.right;
-    }
-    return n;
-  }, r.prototype.prev = function(t) {
-    var e = this._root, n = null;
-    if (t.left !== null) {
-      for (n = t.left; n.right; )
-        n = n.right;
+    }, r.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;
+      }
+      for (var i = this._comparator; e; ) {
+        var o = i(t.key, e.key);
+        if (o === 0)
+          break;
+        o < 0 ? e = e.left : (n = e, e = e.right);
+      }
       return n;
-    }
-    for (var i = this._comparator; e; ) {
-      var o = i(t.key, e.key);
-      if (o === 0)
-        break;
-      o < 0 ? e = e.left : (n = e, e = e.right);
-    }
-    return n;
-  }, r.prototype.clear = function() {
-    return this._root = null, this._size = 0, this;
-  }, r.prototype.toList = function() {
-    return Xl(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 && Ns(t, e, 0, i - 1, o), this._root === null)
-      this._root = Is(t, e, 0, i), this._size = i;
-    else {
-      var s = Yl(this.toList(), ql(t, e), o);
-      i = this._size + i, this._root = Cs({ head: s }, 0, i);
-    }
-    return this;
-  }, r.prototype.isEmpty = function() {
-    return this._root === null;
-  }, Object.defineProperty(r.prototype, "size", {
-    get: function() {
-      return this._size;
-    },
-    enumerable: !0,
-    configurable: !0
-  }), Object.defineProperty(r.prototype, "root", {
-    get: function() {
-      return this._root;
-    },
-    enumerable: !0,
-    configurable: !0
-  }), r.prototype.toString = function(t) {
-    t === void 0 && (t = function(n) {
-      return String(n.key);
-    });
-    var e = [];
-    return Es(this._root, "", !0, function(n) {
-      return e.push(n);
-    }, t), e.join("");
-  }, r.prototype.update = function(t, e, n) {
-    var i = this._comparator, o = ca(t, this._root, i), s = o.left, a = o.right;
-    i(t, e) < 0 ? a = gs(e, n, a, i) : s = gs(e, n, s, i), this._root = Ul(s, a, i);
-  }, r.prototype.split = function(t) {
-    return ca(t, this._root, this._comparator);
-  }, r.prototype[Symbol.iterator] = function() {
-    var t;
-    return zl(this, function(e) {
-      switch (e.label) {
-        case 0:
-          t = this.minNode(), e.label = 1;
-        case 1:
-          return t ? [4, t] : [3, 3];
-        case 2:
-          return e.sent(), t = this.next(t), [3, 1];
-        case 3:
-          return [2];
+    }, r.prototype.clear = function() {
+      return this._root = null, this._size = 0, this;
+    }, r.prototype.toList = function() {
+      return Xl(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 && Ns(t, e, 0, i - 1, o), this._root === null)
+        this._root = Is(t, e, 0, i), this._size = i;
+      else {
+        var s = Yl(this.toList(), ql(t, e), o);
+        i = this._size + i, this._root = Cs({ head: s }, 0, i);
       }
-    });
-  }, r;
-}();
+      return this;
+    }, r.prototype.isEmpty = function() {
+      return this._root === null;
+    }, Object.defineProperty(r.prototype, "size", {
+      get: function() {
+        return this._size;
+      },
+      enumerable: !0,
+      configurable: !0
+    }), Object.defineProperty(r.prototype, "root", {
+      get: function() {
+        return this._root;
+      },
+      enumerable: !0,
+      configurable: !0
+    }), r.prototype.toString = function(t) {
+      t === void 0 && (t = function(n) {
+        return String(n.key);
+      });
+      var e = [];
+      return Es(this._root, "", !0, function(n) {
+        return e.push(n);
+      }, t), e.join("");
+    }, r.prototype.update = function(t, e, n) {
+      var i = this._comparator, o = ca(t, this._root, i), s = o.left, a = o.right;
+      i(t, e) < 0 ? a = gs(e, n, a, i) : s = gs(e, n, s, i), this._root = Ul(s, a, i);
+    }, r.prototype.split = function(t) {
+      return ca(t, this._root, this._comparator);
+    }, r.prototype[Symbol.iterator] = function() {
+      var t;
+      return zl(this, function(e) {
+        switch (e.label) {
+          case 0:
+            t = this.minNode(), e.label = 1;
+          case 1:
+            return t ? [4, t] : [3, 3];
+          case 2:
+            return e.sent(), t = this.next(t), [3, 1];
+          case 3:
+            return [
+              2
+              /*return*/
+            ];
+        }
+      });
+    }, r;
+  }()
+);
 function Is(r, t, e, n) {
   var i = n - e;
   if (i > 0) {
@@ -1421,15 +1771,18 @@ var Hl = mr * mr, Ss = function(t, e) {
 }, Vn = /* @__PURE__ */ function() {
   Ee(r, null, [{
     key: "compare",
+    // for ordering sweep events in the sweep event queue
     value: function(e, n) {
       var i = r.comparePoints(e.point, n.point);
       return i !== 0 ? i : (e.point !== n.point && e.link(n), e.isLeft !== n.isLeft ? e.isLeft ? 1 : -1 : Ao.compare(e.segment, n.segment));
     }
+    // for ordering points in sweep line order
   }, {
     key: "comparePoints",
     value: function(e, n) {
       return e.x < n.x ? -1 : e.x > n.x ? 1 : e.y < n.y ? -1 : e.y > n.y ? 1 : 0;
     }
+    // Warning: 'point' input will be modified and re-used (for performance)
   }]);
   function r(t, e) {
     yn(this, r), t.events === void 0 ? t.events = [this] : t.events.push(this), this.point = t, this.isLeft = e;
@@ -1445,6 +1798,8 @@ var Hl = mr * mr, Ss = function(t, e) {
       }
       this.checkForConsuming();
     }
+    /* Do a pass over our linked events and check to see if any pair
+     * of segments match, and should be consumed. */
   }, {
     key: "checkForConsuming",
     value: function() {
@@ -1466,6 +1821,16 @@ var Hl = mr * mr, Ss = function(t, e) {
       }
       return e;
     }
+    /**
+     * Returns a comparator function for sorting linked events that will
+     * favor the event that will give us the smallest left-side angle.
+     * All ring construction starts as low as possible heading to the right,
+     * so by always turning left as sharp as possible we'll get polygons
+     * without uncessary loops & holes.
+     *
+     * The comparator function has a compute cache such that it avoids
+     * re-computing already-computed values.
+     */
   }, {
     key: "getLeftmostComparator",
     value: function(e) {
@@ -1486,6 +1851,19 @@ var Hl = mr * mr, Ss = function(t, e) {
 }(), Jl = 0, Ao = /* @__PURE__ */ function() {
   Ee(r, null, [{
     key: "compare",
+    /* This compare() function is for ordering segments in the sweep
+     * line tree, and does so according to the following criteria:
+     *
+     * Consider the vertical line that lies an infinestimal step to the
+     * right of the right-more of the two left endpoints of the input
+     * segments. Imagine slowly moving a point up from negative infinity
+     * in the increasing y direction. Which of the two segments will that
+     * point intersect first? That segment comes 'before' the other one.
+     *
+     * If neither segment would be intersected by such a line, (if one
+     * or more of the segments are vertical) then the line to be considered
+     * is directly on the right-more of the two left inputs.
+     */
     value: function(e, n) {
       var i = e.leftSE.point.x, o = n.leftSE.point.x, s = e.rightSE.point.x, a = n.rightSE.point.x;
       if (a < i)
@@ -1542,12 +1920,15 @@ var Hl = mr * mr, Ss = function(t, e) {
       }
       return s > a ? 1 : s < a || c < f ? -1 : c > f ? 1 : e.id < n.id ? -1 : e.id > n.id ? 1 : 0;
     }
+    /* Warning: a reference to ringWindings input will be stored,
+     *  and possibly will be later modified */
   }]);
   function r(t, e, n, i) {
     yn(this, r), this.id = ++Jl, this.leftSE = t, t.segment = this, t.otherSE = e, this.rightSE = e, e.segment = this, e.otherSE = t, this.rings = n, this.windings = i;
   }
   return Ee(r, [{
     key: "replaceRightSE",
+    /* When a segment is split, the rightSE is replaced with a new sweep event */
     value: function(e) {
       this.rightSE = e, this.rightSE.segment = this, this.rightSE.otherSE = this.leftSE, this.leftSE.otherSE = this.rightSE;
     }
@@ -1566,6 +1947,7 @@ var Hl = mr * mr, Ss = function(t, e) {
         }
       };
     }
+    /* A vector from the left point to the right */
   }, {
     key: "vector",
     value: function() {
@@ -1579,6 +1961,19 @@ var Hl = mr * mr, Ss = function(t, e) {
     value: function(e) {
       return e.x === this.leftSE.point.x && e.y === this.leftSE.point.y || e.x === this.rightSE.point.x && e.y === this.rightSE.point.y;
     }
+    /* Compare this segment with a point.
+     *
+     * A point P is considered to be colinear to a segment if there
+     * exists a distance D such that if we travel along the segment
+     * from one * endpoint towards the other a distance D, we find
+     * ourselves at point P.
+     *
+     * Return value indicates:
+     *
+     *   1: point lies above the segment (to the left of vertical)
+     *   0: point is colinear to segment
+     *  -1: point lies below the segment (to the right of vertical)
+     */
   }, {
     key: "comparePoint",
     value: function(e) {
@@ -1593,6 +1988,21 @@ var Hl = mr * mr, Ss = function(t, e) {
       var u = (e.x - n.x) / o.x, l = n.y + u * o.y;
       return e.y === l ? 0 : e.y < l ? -1 : 1;
     }
+    /**
+     * Given another segment, returns the first non-trivial intersection
+     * between the two segments (in terms of sweep line ordering), if it exists.
+     *
+     * A 'non-trivial' intersection is one that will cause one or both of the
+     * segments to be split(). As such, 'trivial' vs. 'non-trivial' intersection:
+     *
+     *   * endpoint of segA with endpoint of segB --> trivial
+     *   * endpoint of segA with point along segB --> non-trivial
+     *   * endpoint of segB with point along segA --> non-trivial
+     *   * point along segA with point along segB --> non-trivial
+     *
+     * If no non-trivial intersection exists, return null
+     * Else, return null.
+     */
   }, {
     key: "getIntersection",
     value: function(e) {
@@ -1615,6 +2025,18 @@ var Hl = mr * mr, Ss = function(t, e) {
       var p = Ql(s, this.vector(), u, e.vector());
       return p === null || !Ui(o, p) ? null : Ji.round(p.x, p.y);
     }
+    /**
+     * Split the given segment into multiple segments on the given points.
+     *  * Each existing segment will retain its leftSE and a new rightSE will be
+     *    generated for it.
+     *  * A new segment will be generated which will adopt the original segment's
+     *    rightSE, and a new leftSE will be generated for it.
+     *  * If there are more than two points given to split on, new segments
+     *    in the middle will be generated with new leftSE and rightSE's.
+     *  * An array of the newly generated SweepEvents will be returned.
+     *
+     * Warning: input array of points is modified
+     */
   }, {
     key: "split",
     value: function(e) {
@@ -1623,6 +2045,7 @@ var Hl = mr * mr, Ss = function(t, e) {
       var u = new r(o, a, this.rings.slice(), this.windings.slice());
       return Vn.comparePoints(u.leftSE.point, u.rightSE.point) > 0 && u.swapEvents(), Vn.comparePoints(this.leftSE.point, this.rightSE.point) > 0 && this.swapEvents(), i && (o.checkForConsuming(), s.checkForConsuming()), n;
     }
+    /* Swap which event is left and right */
   }, {
     key: "swapEvents",
     value: function() {
@@ -1631,6 +2054,8 @@ var Hl = mr * mr, Ss = function(t, e) {
       for (var n = 0, i = this.windings.length; n < i; n++)
         this.windings[n] *= -1;
     }
+    /* Consume another segment. We take their rings under our wing
+     * and mark them as consumed. Use for perfectly overlapping segments */
   }, {
     key: "consume",
     value: function(e) {
@@ -1655,6 +2080,7 @@ var Hl = mr * mr, Ss = function(t, e) {
         i.rings = null, i.windings = null, i.consumedBy = n, i.leftSE.consumedBy = n.leftSE, i.rightSE.consumedBy = n.rightSE;
       }
     }
+    /* The first segment previous segment chain that is in the result */
   }, {
     key: "prevInResult",
     value: function() {
@@ -1710,6 +2136,7 @@ var Hl = mr * mr, Ss = function(t, e) {
       }
       return this._afterState;
     }
+    /* Is this segment part of the final result? */
   }, {
     key: "isInResult",
     value: function() {
@@ -1860,6 +2287,8 @@ var Hl = mr * mr, Ss = function(t, e) {
 }(), $l = /* @__PURE__ */ function() {
   Ee(r, null, [{
     key: "factory",
+    /* 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 */
     value: function(e) {
       for (var n = [], i = 0, o = e.length; i < o; i++) {
         var s = e[i];
@@ -1934,6 +2363,7 @@ var Hl = mr * mr, Ss = function(t, e) {
     value: function() {
       return this._enclosingRing === void 0 && (this._enclosingRing = this._calcEnclosingRing()), this._enclosingRing;
     }
+    /* Returns the ring that encloses this one, if any */
   }, {
     key: "_calcEnclosingRing",
     value: function() {
@@ -2067,6 +2497,8 @@ var Hl = mr * mr, Ss = function(t, e) {
       }
       return i;
     }
+    /* Safely split a segment that is currently in the datastructures
+     * IE - a segment other than the one that is currently being processed. */
   }, {
     key: "_splitSafely",
     value: function(e, n) {
@@ -3520,6 +3952,7 @@ var $e = {
   spaces: /\s+/,
   parenComma: /\)\s*,\s*\(/,
   doubleParenComma: /\)\s*\)\s*,\s*\(\s*\(/,
+  // can't use {2} here
   trimParens: /^\s*\(?(.*?)\)?\s*$/
 }, Ko = function(t) {
   this.geometryFactory = t || new H();
@@ -3546,14 +3979,35 @@ var kn = {
   coordinate: function(t) {
     return t.x + " " + t.y;
   },
+  /**
+   * Return a space delimited string of point coordinates.
+   *
+   * @param {Point}
+   *          point
+   * @return {String} A string of coordinates representing the point.
+   */
   point: function(t) {
     return kn.coordinate.call(this, t._coordinates._coordinates[0]);
   },
+  /**
+   * Return a comma delimited string of point coordinates from a multipoint.
+   *
+   * @param {MultiPoint}
+   *          multipoint
+   * @return {String} A string of point coordinate strings representing the
+   *         multipoint.
+   */
   multipoint: function(t) {
     for (var e = this, n = [], i = 0, o = t._geometries.length; i < o; ++i)
       n.push("(" + kn.point.apply(e, [t._geometries[i]]) + ")");
     return n.join(",");
   },
+  /**
+   * Return a comma delimited string of point coordinates from a line.
+   *
+   * @param {LineString} linestring
+   * @return {String} A string of point coordinate strings representing the linestring.
+   */
   linestring: function(t) {
     for (var e = this, n = [], i = 0, o = t._points._coordinates.length; i < o; ++i)
       n.push(kn.coordinate.apply(e, [t._points._coordinates[i]]));
@@ -3564,11 +4018,24 @@ var kn = {
       n.push(kn.coordinate.apply(e, [t._points._coordinates[i]]));
     return n.join(",");
   },
+  /**
+   * Return a comma delimited string of linestring strings from a
+   * multilinestring.
+   *
+   * @param {MultiLineString} multilinestring
+   * @return {String} A string of of linestring strings representing the multilinestring.
+   */
   multilinestring: function(t) {
     for (var e = this, n = [], i = 0, o = t._geometries.length; i < o; ++i)
       n.push("(" + kn.linestring.apply(e, [t._geometries[i]]) + ")");
     return n.join(",");
   },
+  /**
+   * Return a comma delimited string of linear ring arrays from a polygon.
+   *
+   * @param {Polygon} polygon
+   * @return {String} An array of linear ring arrays representing the polygon.
+   */
   polygon: function(t) {
     var e = this, n = [];
     n.push("(" + kn.linestring.apply(this, [t._shell]) + ")");
@@ -3576,17 +4043,37 @@ var kn = {
       n.push("(" + kn.linestring.apply(e, [t._holes[i]]) + ")");
     return n.join(",");
   },
+  /**
+   * Return an array of polygon arrays from a multipolygon.
+   *
+   * @param {MultiPolygon} multipolygon
+   * @return {String} An array of polygon arrays representing the multipolygon.
+   */
   multipolygon: function(t) {
     for (var e = this, n = [], i = 0, o = t._geometries.length; i < o; ++i)
       n.push("(" + kn.polygon.apply(e, [t._geometries[i]]) + ")");
     return n.join(",");
   },
+  /**
+   * Return the WKT portion between 'GEOMETRYCOLLECTION(' and ')' for an
+   * geometrycollection.
+   *
+   * @param {GeometryCollection} collection
+   * @return {String} internal WKT representation of the collection.
+   */
   geometrycollection: function(t) {
     for (var e = this, n = [], i = 0, o = t._geometries.length; i < o; ++i)
       n.push(e.extractGeometry(t._geometries[i]));
     return n.join(",");
   }
 }, li = {
+  /**
+   * Return point geometry given a point WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the point.
+   * @return {Point} A point geometry.
+   * @private
+   */
   point: function(t) {
     if (t === void 0)
       return this.geometryFactory.createPoint();
@@ -3596,6 +4083,13 @@ var kn = {
       Number.parseFloat(e[1])
     ));
   },
+  /**
+   * Return a multipoint geometry given a multipoint WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the multipoint.
+   * @return {Point} A multipoint feature.
+   * @private
+   */
   multipoint: function(t) {
     var e = this;
     if (t === void 0)
@@ -3604,6 +4098,13 @@ var kn = {
       n = i[s].replace($e.trimParens, "$1"), o.push(li.point.apply(e, [n]));
     return this.geometryFactory.createMultiPoint(o);
   },
+  /**
+   * Return a linestring geometry given a linestring WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the linestring.
+   * @return {LineString} A linestring geometry.
+   * @private
+   */
   linestring: function(t) {
     if (t === void 0)
       return this.geometryFactory.createLineString();
@@ -3611,6 +4112,13 @@ var kn = {
       i = e[o].trim().split($e.spaces), n.push(new v(Number.parseFloat(i[0]), Number.parseFloat(i[1])));
     return this.geometryFactory.createLineString(n);
   },
+  /**
+   * Return a linearring geometry given a linearring WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the linearring.
+   * @return {LinearRing} A linearring geometry.
+   * @private
+   */
   linearring: function(t) {
     if (t === void 0)
       return this.geometryFactory.createLinearRing();
@@ -3618,6 +4126,13 @@ var kn = {
       i = e[o].trim().split($e.spaces), n.push(new v(Number.parseFloat(i[0]), Number.parseFloat(i[1])));
     return this.geometryFactory.createLinearRing(n);
   },
+  /**
+   * Return a multilinestring geometry given a multilinestring WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the multilinestring.
+   * @return {MultiLineString} A multilinestring geometry.
+   * @private
+   */
   multilinestring: function(t) {
     var e = this;
     if (t === void 0)
@@ -3626,6 +4141,13 @@ var kn = {
       n = i[s].replace($e.trimParens, "$1"), o.push(li.linestring.apply(e, [n]));
     return this.geometryFactory.createMultiLineString(o);
   },
+  /**
+   * Return a polygon geometry given a polygon WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the polygon.
+   * @return {Polygon} A polygon geometry.
+   * @private
+   */
   polygon: function(t) {
     var e = this;
     if (t === void 0)
@@ -3634,6 +4156,13 @@ var kn = {
       n = s[l].replace($e.trimParens, "$1"), i = li.linestring.apply(e, [n]), o = e.geometryFactory.createLinearRing(i._points), l === 0 ? a = o : u.push(o);
     return this.geometryFactory.createPolygon(a, u);
   },
+  /**
+   * Return a multipolygon geometry given a multipolygon WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the multipolygon.
+   * @return {MultiPolygon} A multipolygon geometry.
+   * @private
+   */
   multipolygon: function(t) {
     var e = this;
     if (t === void 0)
@@ -3642,6 +4171,13 @@ var kn = {
       n = i[s].replace($e.trimParens, "$1"), o.push(li.polygon.apply(e, [n]));
     return this.geometryFactory.createMultiPolygon(o);
   },
+  /**
+   * Return a geometrycollection given a geometrycollection WKT fragment.
+   *
+   * @param {String} str A WKT fragment representing the geometrycollection.
+   * @return {GeometryCollection}
+   * @private
+   */
   geometrycollection: function(t) {
     var e = this;
     if (t === void 0)
@@ -6742,6 +7278,14 @@ ts.prototype.write = function(t) {
   return zn[e].apply(this, [t]);
 };
 var en = {
+  /**
+   * Parse a GeoJSON Feature object
+   *
+   * @param {Object}
+   *          obj Object to parse.
+   *
+   * @return {Object} Feature with geometry/bbox converted to JSTS Geometries.
+   */
   Feature: function(r) {
     var t = {};
     for (var e in r)
@@ -6754,6 +7298,14 @@ var en = {
     }
     return r.bbox && (t.bbox = en.bbox.apply(this, [r.bbox])), t;
   },
+  /**
+   * Parse a GeoJSON FeatureCollection object
+   *
+   * @param {Object}
+   *          obj Object to parse.
+   *
+   * @return {Object} FeatureCollection with geometry/bbox converted to JSTS Geometries.
+   */
   FeatureCollection: function(r) {
     var t = this, e = {};
     if (r.features) {
@@ -6763,6 +7315,14 @@ var en = {
     }
     return r.bbox && (e.bbox = this.parse.bbox.apply(this, [r.bbox])), e;
   },
+  /**
+   * Convert the ordinates in an array to an array of Coordinates
+   *
+   * @param {Array}
+   *          array Array with {Number}s.
+   *
+   * @return {Array} Array with Coordinates.
+   */
   coordinates: function(r) {
     for (var t = [], e = 0; e < r.length; ++e) {
       var n = r[e];
@@ -6770,6 +7330,14 @@ var en = {
     }
     return t;
   },
+  /**
+   * Convert the bbox to a LinearRing
+   *
+   * @param {Array}
+   *          array Array with [xMin, yMin, xMax, yMax].
+   *
+   * @return {Array} Array with Coordinates.
+   */
   bbox: function(r) {
     return this.geometryFactory.createLinearRing([
       new v(r[0], r[1]),
@@ -6779,24 +7347,64 @@ var en = {
       new v(r[0], r[1])
     ]);
   },
+  /**
+   * Convert an Array with ordinates to a Point
+   *
+   * @param {Array}
+   *          array Array with ordinates.
+   *
+   * @return {Point} Point.
+   */
   Point: function(r) {
     var t = new v(r[0], r[1]);
     return this.geometryFactory.createPoint(t);
   },
+  /**
+   * Convert an Array with coordinates to a MultiPoint
+   *
+   * @param {Array}
+   *          array Array with coordinates.
+   *
+   * @return {MultiPoint} MultiPoint.
+   */
   MultiPoint: function(r) {
     for (var t = this, e = [], n = 0; n < r.length; ++n)
       e.push(en.Point.apply(t, [r[n]]));
     return this.geometryFactory.createMultiPoint(e);
   },
+  /**
+   * Convert an Array with coordinates to a LineString
+   *
+   * @param {Array}
+   *          array Array with coordinates.
+   *
+   * @return {LineString} LineString.
+   */
   LineString: function(r) {
     var t = en.coordinates.apply(this, [r]);
     return this.geometryFactory.createLineString(t);
   },
+  /**
+   * Convert an Array with coordinates to a MultiLineString
+   *
+   * @param {Array}
+   *          array Array with coordinates.
+   *
+   * @return {MultiLineString} MultiLineString.
+   */
   MultiLineString: function(r) {
     for (var t = this, e = [], n = 0; n < r.length; ++n)
       e.push(en.LineString.apply(t, [r[n]]));
     return this.geometryFactory.createMultiLineString(e);
   },
+  /**
+   * Convert an Array to a Polygon
+   *
+   * @param {Array}
+   *          array Array with shell and holes.
+   *
+   * @return {Polygon} Polygon.
+   */
   Polygon: function(r) {
     for (var t = this, e = en.coordinates.apply(this, [r[0]]), n = this.geometryFactory.createLinearRing(e), i = [], o = 1; o < r.length; ++o) {
       var s = r[o], a = en.coordinates.apply(t, [s]), u = t.geometryFactory.createLinearRing(a);
@@ -6804,6 +7412,14 @@ var en = {
     }
     return this.geometryFactory.createPolygon(n, i);
   },
+  /**
+   * Convert an Array to a MultiPolygon
+   *
+   * @param {Array}
+   *          array Array of arrays with shell and rings.
+   *
+   * @return {MultiPolygon} MultiPolygon.
+   */
   MultiPolygon: function(r) {
     for (var t = this, e = [], n = 0; n < r.length; ++n) {
       var i = r[n];
@@ -6811,6 +7427,14 @@ var en = {
     }
     return this.geometryFactory.createMultiPolygon(e);
   },
+  /**
+   * Convert an Array to a GeometryCollection
+   *
+   * @param {Array}
+   *          array Array of GeoJSON geometries.
+   *
+   * @return {GeometryCollection} GeometryCollection.
+   */
   GeometryCollection: function(r) {
     for (var t = this, e = [], n = 0; n < r.length; ++n) {
       var i = r[n];
@@ -6819,9 +7443,25 @@ var en = {
     return this.geometryFactory.createGeometryCollection(e);
   }
 }, zn = {
+  /**
+   * Convert a Coordinate to an Array
+   *
+   * @param {Coordinate}
+   *          coordinate Coordinate to convert.
+   *
+   * @return {Array} Array of ordinates.
+   */
   coordinate: function(r) {
     return [r.x, r.y];
   },
+  /**
+   * Convert a Point to a GeoJSON object
+   *
+   * @param {Point}
+   *          point Point to convert.
+   *
+   * @return {Array} Array of 2 ordinates (paired to a coordinate).
+   */
   Point: function(r) {
     var t = zn.coordinate.apply(this, [r.getCoordinate()]);
     return {
@@ -6829,6 +7469,14 @@ var en = {
       coordinates: t
     };
   },
+  /**
+   * Convert a MultiPoint to a GeoJSON object
+   *
+   * @param {MultiPoint}
+   *          multipoint MultiPoint to convert.
+   *
+   * @return {Array} Array of coordinates.
+   */
   MultiPoint: function(r) {
     for (var t = this, e = [], n = 0; n < r._geometries.length; ++n) {
       var i = r._geometries[n], o = zn.Point.apply(t, [i]);
@@ -6839,6 +7487,14 @@ var en = {
       coordinates: e
     };
   },
+  /**
+   * Convert a LineString to a GeoJSON object
+   *
+   * @param {LineString}
+   *          linestring LineString to convert.
+   *
+   * @return {Array} Array of coordinates.
+   */
   LineString: function(r) {
     for (var t = this, e = [], n = r.getCoordinates(), i = 0; i < n.length; ++i) {
       var o = n[i];
@@ -6849,6 +7505,14 @@ var en = {
       coordinates: e
     };
   },
+  /**
+   * Convert a MultiLineString to a GeoJSON object
+   *
+   * @param {MultiLineString}
+   *          multilinestring MultiLineString to convert.
+   *
+   * @return {Array} Array of Array of coordinates.
+   */
   MultiLineString: function(r) {
     for (var t = this, e = [], n = 0; n < r._geometries.length; ++n) {
       var i = r._geometries[n], o = zn.LineString.apply(t, [i]);
@@ -6859,6 +7523,14 @@ var en = {
       coordinates: e
     };
   },
+  /**
+   * Convert a Polygon to a GeoJSON object
+   *
+   * @param {Polygon}
+   *          polygon Polygon to convert.
+   *
+   * @return {Array} Array with shell, holes.
+   */
   Polygon: function(r) {
     var t = this, e = [], n = zn.LineString.apply(this, [r._shell]);
     e.push(n.coordinates);
@@ -6871,6 +7543,14 @@ var en = {
       coordinates: e
     };
   },
+  /**
+   * Convert a MultiPolygon to a GeoJSON object
+   *
+   * @param {MultiPolygon}
+   *          multipolygon MultiPolygon to convert.
+   *
+   * @return {Array} Array of polygons.
+   */
   MultiPolygon: function(r) {
     for (var t = this, e = [], n = 0; n < r._geometries.length; ++n) {
       var i = r._geometries[n], o = zn.Polygon.apply(t, [i]);
@@ -6881,6 +7561,14 @@ var en = {
       coordinates: e
     };
   },
+  /**
+   * Convert a GeometryCollection to a GeoJSON object
+   *
+   * @param {GeometryCollection}
+   *          collection GeometryCollection to convert.
+   *
+   * @return {Array} Array of geometries.
+   */
   GeometryCollection: function(r) {
     for (var t = this, e = [], n = 0; n < r._geometries.length; ++n) {
       var i = r._geometries[n], o = i.getGeometryType();
@@ -14342,7 +15030,8 @@ function Uo() {
 Uo.prototype = {
   constructor: Uo,
   reset: function() {
-    this.s = this.t = 0;
+    this.s = // rounded value
+    this.t = 0;
   },
   add: function(r) {
     wa(No, r, this.t), wa(this, No.s, this.s), this.s ? this.t += No.t : this.s = No.t;
@@ -14899,6 +15588,8 @@ function Hc(r, t) {
       lineEnd: function() {
         g && c.lineEnd(), f = null;
       },
+      // Rejoin first and last segments if there were intersections and the first
+      // and last points were visible.
       clean: function() {
         return m | (p && g) << 1;
       }