@konstructio/ui 0.1.2-alpha.80 → 0.1.2-alpha.82

package/dist/{utils-CQSRNcoF.js → utils-2zv-ysvP.js}

@@ -25,24 +25,24 @@ var da = /* @__PURE__ */ C(((A, l) => {
       if (c !== this.b)
         return this.b = c, this.matchingBlocks = this.opcodes = null, this.fullbcount = null, this._chainB();
     }, h.prototype._chainB = function() {
-      var c = this.b, s, g, t, d, E, j, u, f, m, F, M, S, D, N, T;
+      var c = this.b, s, g, t, d, E, j, u, f, m, U, M, S, D, N, T;
       for (this.b2j = s = {}, t = M = 0, D = c.length; M < D; t = ++M)
         g = c[t], E = o(s, g) ? s[g] : s[g] = [], E.push(t);
       if (u = {}, j = this.isjunk, j)
         for (T = Object.keys(s), S = 0, N = T.length; S < N; S++)
           g = T[S], j(g) && (u[g] = !0, delete s[g]);
-      if (F = {}, f = c.length, this.autojunk && f >= 200) {
+      if (U = {}, f = c.length, this.autojunk && f >= 200) {
         m = r(f / 100) + 1;
         for (g in s)
-          d = s[g], d.length > m && (F[g] = !0, delete s[g]);
+          d = s[g], d.length > m && (U[g] = !0, delete s[g]);
       }
       return this.isbjunk = function(G) {
         return o(u, G);
       }, this.isbpopular = function(G) {
-        return o(F, G);
+        return o(U, G);
       };
     }, h.prototype.findLongestMatch = function(c, s, g, t) {
-      var d, E, j, u, f, m, F, M, S, D, N, T, G, w, V, I = [
+      var d, E, j, u, f, m, U, M, S, D, N, T, G, w, V, I = [
         this.a,
         this.b,
         this.b2j,
@@ -52,12 +52,12 @@ var da = /* @__PURE__ */ C(((A, l) => {
         c,
         g,
         0
-      ], u = q[0], f = q[1], m = q[2], D = {}, F = G = c; c <= s ? G < s : G > s; F = c <= s ? ++G : --G) {
-        for (T = {}, k = o(j, d[F]) ? j[d[F]] : [], w = 0, V = k.length; w < V; w++)
+      ], u = q[0], f = q[1], m = q[2], D = {}, U = G = c; c <= s ? G < s : G > s; U = c <= s ? ++G : --G) {
+        for (T = {}, k = o(j, d[U]) ? j[d[U]] : [], w = 0, V = k.length; w < V; w++)
           if (S = k[w], !(S < g)) {
             if (S >= t) break;
             N = T[S] = (D[S - 1] || 0) + 1, N > m && (Y = [
-              F - N + 1,
+              U - N + 1,
               S - N + 1,
               N
             ], u = Y[0], f = Y[1], m = Y[2]);
@@ -82,7 +82,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
         m
       ];
     }, h.prototype.getMatchingBlocks = function() {
-      var c, s, g, t, d, E, j, u, f, m, F, M, S, D, N, T, G, w, V, I, q, k, Y, Q, ee, ce;
+      var c, s, g, t, d, E, j, u, f, m, U, M, S, D, N, T, G, w, V, I, q, k, Y, Q, ee, ce;
       if (this.matchingBlocks) return this.matchingBlocks;
       for (k = [this.a.length, this.b.length], D = k[0], N = k[1], w = [[
         0,
@@ -90,15 +90,15 @@ var da = /* @__PURE__ */ C(((A, l) => {
         0,
         N
       ]], T = []; w.length; )
-        Y = w.pop(), s = Y[0], c = Y[1], t = Y[2], g = Y[3], Q = V = this.findLongestMatch(s, c, t, g), d = Q[0], u = Q[1], F = Q[2], F && (T.push(V), s < d && t < u && w.push([
+        Y = w.pop(), s = Y[0], c = Y[1], t = Y[2], g = Y[3], Q = V = this.findLongestMatch(s, c, t, g), d = Q[0], u = Q[1], U = Q[2], U && (T.push(V), s < d && t < u && w.push([
           s,
           d,
           t,
           u
-        ]), d + F < c && u + F < g && w.push([
-          d + F,
+        ]), d + U < c && u + U < g && w.push([
+          d + U,
           c,
-          u + F,
+          u + U,
           g
         ]));
       for (T.sort(n), E = f = M = 0, G = [], I = 0, q = T.length; I < q; I++)
@@ -121,10 +121,10 @@ var da = /* @__PURE__ */ C(((A, l) => {
         0
       ]), this.matchingBlocks = G;
     }, h.prototype.getOpcodes = function() {
-      var c, s, g, t, d, E, j, u, f, m, F, M;
+      var c, s, g, t, d, E, j, u, f, m, U, M;
       if (this.opcodes) return this.opcodes;
       for (t = d = 0, this.opcodes = s = [], m = this.getMatchingBlocks(), u = 0, f = m.length; u < f; u++)
-        F = m[u], c = F[0], g = F[1], E = F[2], j = "", t < c && d < g ? j = "replace" : t < c ? j = "delete" : d < g && (j = "insert"), j && s.push([
+        U = m[u], c = U[0], g = U[1], E = U[2], j = "", t < c && d < g ? j = "replace" : t < c ? j = "delete" : d < g && (j = "insert"), j && s.push([
           j,
           t,
           c,
@@ -139,7 +139,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
         ]);
       return s;
     }, h.prototype.getGroupedOpcodes = function(c) {
-      var s, g, t, d, E, j, u, f, m, F, M, S, D, N, T;
+      var s, g, t, d, E, j, u, f, m, U, M, S, D, N, T;
       for (c == null && (c = 3), s = this.getOpcodes(), s.length || (s = [[
         "equal",
         0,
@@ -158,8 +158,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
         a(E, d + c),
         j,
         a(u, j + c)
-      ]), f = c + c, t = [], g = [], F = 0, M = s.length; F < M; F++)
-        N = s[F], m = N[0], d = N[1], E = N[2], j = N[3], u = N[4], m === "equal" && E - d > f && (g.push([
+      ]), f = c + c, t = [], g = [], U = 0, M = s.length; U < M; U++)
+        N = s[U], m = N[0], d = N[1], E = N[2], j = N[3], u = N[4], m === "equal" && E - d > f && (g.push([
           m,
           d,
           a(E, d + c),
@@ -179,12 +179,12 @@ var da = /* @__PURE__ */ C(((A, l) => {
         c = d[g], s += c[2];
       return e(s, this.a.length + this.b.length);
     }, h.prototype.quickRatio = function() {
-      var c, s, g, t, d, E, j, u, f, m, F;
+      var c, s, g, t, d, E, j, u, f, m, U;
       if (!this.fullbcount)
         for (this.fullbcount = g = {}, m = this.b, E = 0, u = m.length; E < u; E++)
           s = m[E], g[s] = (g[s] || 0) + 1;
-      for (g = this.fullbcount, c = {}, t = 0, F = this.a, j = 0, f = F.length; j < f; j++)
-        s = F[j], o(c, s) ? d = c[s] : d = g[s] || 0, c[s] = d - 1, d > 0 && t++;
+      for (g = this.fullbcount, c = {}, t = 0, U = this.a, j = 0, f = U.length; j < f; j++)
+        s = U[j], o(c, s) ? d = c[s] : d = g[s] || 0, c[s] = d - 1, d > 0 && t++;
       return e(t, this.a.length + this.b.length);
     }, h.prototype.realQuickRatio = function() {
       var c, s, g = [this.a.length, this.b.length];
@@ -197,56 +197,56 @@ var da = /* @__PURE__ */ C(((A, l) => {
     var r, i, a = Math.floor, e, n, o, _, h, c, s = Math.min, g, t, d, E, j;
     i = function(u, f) {
       return u < f ? -1 : u > f ? 1 : 0;
-    }, c = function(u, f, m, F, M) {
+    }, c = function(u, f, m, U, M) {
       var S;
       if (m == null && (m = 0), M == null && (M = i), m < 0) throw new Error("lo must be non-negative");
-      for (F == null && (F = u.length); m < F; )
-        S = a((m + F) / 2), M(f, u[S]) < 0 ? F = S : m = S + 1;
+      for (U == null && (U = u.length); m < U; )
+        S = a((m + U) / 2), M(f, u[S]) < 0 ? U = S : m = S + 1;
       return [].splice.apply(u, [m, m - m].concat(f)), f;
     }, o = function(u, f, m) {
       return m == null && (m = i), u.push(f), E(u, 0, u.length - 1, m);
     }, n = function(u, f) {
-      var m, F;
-      return f == null && (f = i), m = u.pop(), u.length ? (F = u[0], u[0] = m, j(u, 0, f)) : F = m, F;
+      var m, U;
+      return f == null && (f = i), m = u.pop(), u.length ? (U = u[0], u[0] = m, j(u, 0, f)) : U = m, U;
     }, h = function(u, f, m) {
-      var F;
-      return m == null && (m = i), F = u[0], u[0] = f, j(u, 0, m), F;
+      var U;
+      return m == null && (m = i), U = u[0], u[0] = f, j(u, 0, m), U;
     }, _ = function(u, f, m) {
-      var F;
-      return m == null && (m = i), u.length && m(u[0], f) < 0 && (F = [u[0], f], f = F[0], u[0] = F[1], j(u, 0, m)), f;
+      var U;
+      return m == null && (m = i), u.length && m(u[0], f) < 0 && (U = [u[0], f], f = U[0], u[0] = U[1], j(u, 0, m)), f;
     }, e = function(u, f) {
-      var m, F, M, S, D, N;
+      var m, U, M, S, D, N;
       for (f == null && (f = i), S = (function() {
         N = [];
         for (var T = 0, G = a(u.length / 2); 0 <= G ? T < G : T > G; 0 <= G ? T++ : T--) N.push(T);
         return N;
-      }).apply(this).reverse(), D = [], F = 0, M = S.length; F < M; F++)
-        m = S[F], D.push(j(u, m, f));
+      }).apply(this).reverse(), D = [], U = 0, M = S.length; U < M; U++)
+        m = S[U], D.push(j(u, m, f));
       return D;
     }, d = function(u, f, m) {
-      var F;
-      if (m == null && (m = i), F = u.indexOf(f), F !== -1)
-        return E(u, 0, F, m), j(u, F, m);
+      var U;
+      if (m == null && (m = i), U = u.indexOf(f), U !== -1)
+        return E(u, 0, U, m), j(u, U, m);
     }, g = function(u, f, m) {
-      var F, M, S, D, N;
+      var U, M, S, D, N;
       if (m == null && (m = i), M = u.slice(0, f), !M.length) return M;
       for (e(M, m), N = u.slice(f), S = 0, D = N.length; S < D; S++)
-        F = N[S], _(M, F, m);
+        U = N[S], _(M, U, m);
       return M.sort(m).reverse();
     }, t = function(u, f, m) {
-      var F, M, S, D, N, T, G, w, V;
+      var U, M, S, D, N, T, G, w, V;
       if (m == null && (m = i), f * 10 <= u.length) {
         if (S = u.slice(0, f).sort(m), !S.length) return S;
         for (M = S[S.length - 1], G = u.slice(f), D = 0, T = G.length; D < T; D++)
-          F = G[D], m(F, M) < 0 && (c(S, F, 0, null, m), S.pop(), M = S[S.length - 1]);
+          U = G[D], m(U, M) < 0 && (c(S, U, 0, null, m), S.pop(), M = S[S.length - 1]);
         return S;
       }
       for (e(u, m), V = [], N = 0, w = s(f, u.length); 0 <= w ? N < w : N > w; 0 <= w ? ++N : --N) V.push(n(u, m));
       return V;
-    }, E = function(u, f, m, F) {
+    }, E = function(u, f, m, U) {
       var M, S, D;
-      for (F == null && (F = i), M = u[m]; m > f; ) {
-        if (D = m - 1 >> 1, S = u[D], F(M, S) < 0) {
+      for (U == null && (U = i), M = u[m]; m > f; ) {
+        if (D = m - 1 >> 1, S = u[D], U(M, S) < 0) {
           u[m] = S, m = D;
           continue;
         }
@@ -254,9 +254,9 @@ var da = /* @__PURE__ */ C(((A, l) => {
       }
       return u[m] = M;
     }, j = function(u, f, m) {
-      var F, M, S, D, N;
-      for (m == null && (m = i), M = u.length, N = f, S = u[f], F = 2 * f + 1; F < M; )
-        D = F + 1, D < M && !(m(u[F], u[D]) < 0) && (F = D), u[f] = u[F], f = F, F = 2 * f + 1;
+      var U, M, S, D, N;
+      for (m == null && (m = i), M = u.length, N = f, S = u[f], U = 2 * f + 1; U < M; )
+        D = U + 1, D < M && !(m(u[U], u[D]) < 0) && (U = D), u[f] = u[U], f = U, U = 2 * f + 1;
       return u[f] = S, E(u, N, f, m);
     }, r = (function() {
       u.push = o, u.pop = n, u.replace = h, u.pushpop = _, u.heapify = e, u.updateItem = d, u.nlargest = g, u.nsmallest = t;
@@ -681,28 +681,28 @@ var da = /* @__PURE__ */ C(((A, l) => {
     if (E != j && !(d && j > E)) return !1;
     var u = t.get(_), f = t.get(h);
     if (u && f) return u == h && f == _;
-    var m = -1, F = !0, M = c & n ? new r() : void 0;
+    var m = -1, U = !0, M = c & n ? new r() : void 0;
     for (t.set(_, h), t.set(h, _); ++m < E; ) {
       var S = _[m], D = h[m];
       if (s) var N = d ? s(D, S, m, h, _, t) : s(S, D, m, _, h, t);
       if (N !== void 0) {
         if (N) continue;
-        F = !1;
+        U = !1;
         break;
       }
       if (M) {
         if (!i(h, function(T, G) {
           if (!a(M, G) && (S === T || g(S, T, c, s, t))) return M.push(G);
         })) {
-          F = !1;
+          U = !1;
           break;
         }
       } else if (!(S === D || g(S, D, c, s, t))) {
-        F = !1;
+        U = !1;
         break;
       }
     }
-    return t.delete(_), t.delete(h), F;
+    return t.delete(_), t.delete(h), U;
   }
   l.exports = o;
 })), en = /* @__PURE__ */ C(((A, l) => {
@@ -725,10 +725,10 @@ var da = /* @__PURE__ */ C(((A, l) => {
   }
   l.exports = r;
 })), rn = /* @__PURE__ */ C(((A, l) => {
-  var r = ke(), i = en(), a = Ve(), e = Xe(), n = an(), o = nn(), _ = 1, h = 2, c = "[object Boolean]", s = "[object Date]", g = "[object Error]", t = "[object Map]", d = "[object Number]", E = "[object RegExp]", j = "[object Set]", u = "[object String]", f = "[object Symbol]", m = "[object ArrayBuffer]", F = "[object DataView]", M = r ? r.prototype : void 0, S = M ? M.valueOf : void 0;
+  var r = ke(), i = en(), a = Ve(), e = Xe(), n = an(), o = nn(), _ = 1, h = 2, c = "[object Boolean]", s = "[object Date]", g = "[object Error]", t = "[object Map]", d = "[object Number]", E = "[object RegExp]", j = "[object Set]", u = "[object String]", f = "[object Symbol]", m = "[object ArrayBuffer]", U = "[object DataView]", M = r ? r.prototype : void 0, S = M ? M.valueOf : void 0;
   function D(N, T, G, w, V, I, q) {
     switch (G) {
-      case F:
+      case U:
         if (N.byteLength != T.byteLength || N.byteOffset != T.byteOffset) return !1;
         N = N.buffer, T = T.buffer;
       case m:
@@ -833,8 +833,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
   }
   l.exports = i;
 })), gn = /* @__PURE__ */ C(((A, l) => {
-  var r = _e(), i = Ne(), a = Fe(), e = "[object Arguments]", n = "[object Array]", o = "[object Boolean]", _ = "[object Date]", h = "[object Error]", c = "[object Function]", s = "[object Map]", g = "[object Number]", t = "[object Object]", d = "[object RegExp]", E = "[object Set]", j = "[object String]", u = "[object WeakMap]", f = "[object ArrayBuffer]", m = "[object DataView]", F = "[object Float32Array]", M = "[object Float64Array]", S = "[object Int8Array]", D = "[object Int16Array]", N = "[object Int32Array]", T = "[object Uint8Array]", G = "[object Uint8ClampedArray]", w = "[object Uint16Array]", V = "[object Uint32Array]", I = {};
-  I[F] = I[M] = I[S] = I[D] = I[N] = I[T] = I[G] = I[w] = I[V] = !0, I[e] = I[n] = I[f] = I[o] = I[m] = I[_] = I[h] = I[c] = I[s] = I[g] = I[t] = I[d] = I[E] = I[j] = I[u] = !1;
+  var r = _e(), i = Ne(), a = Fe(), e = "[object Arguments]", n = "[object Array]", o = "[object Boolean]", _ = "[object Date]", h = "[object Error]", c = "[object Function]", s = "[object Map]", g = "[object Number]", t = "[object Object]", d = "[object RegExp]", E = "[object Set]", j = "[object String]", u = "[object WeakMap]", f = "[object ArrayBuffer]", m = "[object DataView]", U = "[object Float32Array]", M = "[object Float64Array]", S = "[object Int8Array]", D = "[object Int16Array]", N = "[object Int32Array]", T = "[object Uint8Array]", G = "[object Uint8ClampedArray]", w = "[object Uint16Array]", V = "[object Uint32Array]", I = {};
+  I[U] = I[M] = I[S] = I[D] = I[N] = I[T] = I[G] = I[w] = I[V] = !0, I[e] = I[n] = I[f] = I[o] = I[m] = I[_] = I[h] = I[c] = I[s] = I[g] = I[t] = I[d] = I[E] = I[j] = I[u] = !1;
   function q(k) {
     return a(k) && i(k.length) && !!I[r(k)];
   }
@@ -923,7 +923,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
     if (u && f) return u == o && f == n;
     var m = !0;
     s.set(n, o), s.set(o, n);
-    for (var F = g; ++E < d; ) {
+    for (var U = g; ++E < d; ) {
       j = t[E];
       var M = n[j], S = o[j];
       if (h) var D = g ? h(S, M, j, o, n, s) : h(M, S, j, n, o, s);
@@ -931,9 +931,9 @@ var da = /* @__PURE__ */ C(((A, l) => {
         m = !1;
         break;
       }
-      F || (F = j == "constructor");
+      U || (U = j == "constructor");
     }
-    if (m && !F) {
+    if (m && !U) {
       var N = n.constructor, T = o.constructor;
       N != T && "constructor" in n && "constructor" in o && !(typeof N == "function" && N instanceof N && typeof T == "function" && T instanceof T) && (m = !1);
     }
@@ -953,8 +953,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
   var r = me()(oe(), "WeakMap");
   l.exports = r;
 })), vn = /* @__PURE__ */ C(((A, l) => {
-  var r = En(), i = Me(), a = jn(), e = Sn(), n = Cn(), o = _e(), _ = qe(), h = "[object Map]", c = "[object Object]", s = "[object Promise]", g = "[object Set]", t = "[object WeakMap]", d = "[object DataView]", E = _(r), j = _(i), u = _(a), f = _(e), m = _(n), F = o;
-  (r && F(new r(/* @__PURE__ */ new ArrayBuffer(1))) != d || i && F(new i()) != h || a && F(a.resolve()) != s || e && F(new e()) != g || n && F(new n()) != t) && (F = function(M) {
+  var r = En(), i = Me(), a = jn(), e = Sn(), n = Cn(), o = _e(), _ = qe(), h = "[object Map]", c = "[object Object]", s = "[object Promise]", g = "[object Set]", t = "[object WeakMap]", d = "[object DataView]", E = _(r), j = _(i), u = _(a), f = _(e), m = _(n), U = o;
+  (r && U(new r(/* @__PURE__ */ new ArrayBuffer(1))) != d || i && U(new i()) != h || a && U(a.resolve()) != s || e && U(new e()) != g || n && U(new n()) != t) && (U = function(M) {
     var S = o(M), D = S == c ? M.constructor : void 0, N = D ? _(D) : "";
     if (N) switch (N) {
       case E:
@@ -969,10 +969,10 @@ var da = /* @__PURE__ */ C(((A, l) => {
         return t;
     }
     return S;
-  }), l.exports = F;
+  }), l.exports = U;
 })), Mn = /* @__PURE__ */ C(((A, l) => {
   var r = Je(), i = Xe(), a = rn(), e = An(), n = vn(), o = ie(), _ = $e(), h = na(), c = 1, s = "[object Arguments]", g = "[object Array]", t = "[object Object]", d = Object.prototype.hasOwnProperty;
-  function E(j, u, f, m, F, M) {
+  function E(j, u, f, m, U, M) {
     var S = o(j), D = o(u), N = S ? g : n(j), T = D ? g : n(u);
     N = N == s ? t : N, T = T == s ? t : T;
     var G = N == t, w = T == t, V = N == T;
@@ -981,15 +981,15 @@ var da = /* @__PURE__ */ C(((A, l) => {
       S = !0, G = !1;
     }
     if (V && !G)
-      return M || (M = new r()), S || h(j) ? i(j, u, f, m, F, M) : a(j, u, N, f, m, F, M);
+      return M || (M = new r()), S || h(j) ? i(j, u, f, m, U, M) : a(j, u, N, f, m, U, M);
     if (!(f & c)) {
       var I = G && d.call(j, "__wrapped__"), q = w && d.call(u, "__wrapped__");
       if (I || q) {
         var k = I ? j.value() : j, Y = q ? u.value() : u;
-        return M || (M = new r()), F(k, Y, f, m, M);
+        return M || (M = new r()), U(k, Y, f, m, M);
       }
     }
-    return V ? (M || (M = new r()), e(j, u, f, m, F, M)) : !1;
+    return V ? (M || (M = new r()), e(j, u, f, m, U, M)) : !1;
   }
   l.exports = E;
 })), ra = /* @__PURE__ */ C(((A, l) => {
@@ -1210,11 +1210,10 @@ var da = /* @__PURE__ */ C(((A, l) => {
     }) : t = [h];
     var E = -1;
     return t = r(t, o(a)), n(e(g, function(j, u, f) {
-      var m = r(t, function(F) {
-        return F(j);
-      });
       return {
-        criteria: m,
+        criteria: r(t, function(m) {
+          return m(j);
+        }),
         index: ++E,
         value: j
       };
@@ -1302,13 +1301,13 @@ var da = /* @__PURE__ */ C(((A, l) => {
     var s = Array.from(a), g = Array.from(e), t = s.length, d = g.length;
     if (t === 0) return d;
     if (d === 0) return t;
-    for (var E, j, u, f, m = 0, F = 0; m < t; )
+    for (var E, j, u, f, m = 0, U = 0; m < t; )
       _[m] = s[m].codePointAt(0), o[m] = ++m;
-    if (h) for (; F < d; )
-      for (E = g[F].codePointAt(0), u = F++, j = F, m = 0; m < t; m++)
+    if (h) for (; U < d; )
+      for (E = g[U].codePointAt(0), u = U++, j = U, m = 0; m < t; m++)
         f = r.compare(String.fromCodePoint(E), String.fromCodePoint(_[m])) === 0 ? u : u + c, u = o[m], j = o[m] = u > j ? f > j ? j + 1 : f : f > u ? u + 1 : f;
-    else for (; F < d; )
-      for (E = g[F].codePointAt(0), u = F++, j = F, m = 0; m < t; m++)
+    else for (; U < d; )
+      for (E = g[U].codePointAt(0), u = U++, j = U, m = 0; m < t; m++)
         f = E === _[m] ? u : u + c, u = o[m], j = o[m] = u > j ? f > j ? j + 1 : f : f > u ? u + 1 : f;
     return j;
   };
@@ -1336,14 +1335,14 @@ var da = /* @__PURE__ */ C(((A, l) => {
         if (a = a.replace(new RegExp(u, "g"), E), e = e.replace(new RegExp(u, "g"), E), a === e) return 0;
       } else
         E = n.wildcards[0].toLowerCase(), j = E.charCodeAt(0);
-      for (var f, m, F, M, S = 0, D = 0; S < g; )
+      for (var f, m, U, M, S = 0, D = 0; S < g; )
         h[S] = a.charCodeAt(S), _[S] = ++S;
       if (c) for (; D < t; )
-        for (f = e.charCodeAt(D), F = D++, m = D, S = 0; S < g; S++)
-          M = r.compare(String.fromCharCode(f), String.fromCharCode(h[S])) === 0 || f === j || h[S] === j ? F : F + s, F = _[S], m = _[S] = F > m ? M > m ? m + 1 : M : M > F ? F + 1 : M;
+        for (f = e.charCodeAt(D), U = D++, m = D, S = 0; S < g; S++)
+          M = r.compare(String.fromCharCode(f), String.fromCharCode(h[S])) === 0 || f === j || h[S] === j ? U : U + s, U = _[S], m = _[S] = U > m ? M > m ? m + 1 : M : M > U ? U + 1 : M;
       else for (; D < t; )
-        for (f = e.charCodeAt(D), F = D++, m = D, S = 0; S < g; S++)
-          M = f === h[S] || f === j || h[S] === j ? F : F + s, F = _[S], m = _[S] = F > m ? M > m ? m + 1 : M : M > F ? F + 1 : M;
+        for (f = e.charCodeAt(D), U = D++, m = D, S = 0; S < g; S++)
+          M = f === h[S] || f === j || h[S] === j ? U : U + s, U = _[S], m = _[S] = U > m ? M > m ? m + 1 : M : M > U ? U + 1 : M;
       return m;
     } else return o(a, e, n);
   };
@@ -1377,7 +1376,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
     var r = 1, i = {}, a = !1, e = A.document, n;
     function o(f) {
       typeof f != "function" && (f = new Function("" + f));
-      for (var m = new Array(arguments.length - 1), F = 0; F < m.length; F++) m[F] = arguments[F + 1];
+      for (var m = new Array(arguments.length - 1), U = 0; U < m.length; U++) m[U] = arguments[U + 1];
       return i[r] = {
         callback: f,
         args: m
@@ -1387,22 +1386,22 @@ var da = /* @__PURE__ */ C(((A, l) => {
       delete i[f];
     }
     function h(f) {
-      var m = f.callback, F = f.args;
-      switch (F.length) {
+      var m = f.callback, U = f.args;
+      switch (U.length) {
         case 0:
           m();
           break;
         case 1:
-          m(F[0]);
+          m(U[0]);
           break;
         case 2:
-          m(F[0], F[1]);
+          m(U[0], U[1]);
           break;
         case 3:
-          m(F[0], F[1], F[2]);
+          m(U[0], U[1], U[2]);
           break;
         default:
-          m.apply(l, F);
+          m.apply(l, U);
           break;
       }
     }
@@ -1436,18 +1435,18 @@ var da = /* @__PURE__ */ C(((A, l) => {
       }
     }
     function t() {
-      var f = "setImmediate$" + Math.random() + "$", m = function(F) {
-        F.source === A && typeof F.data == "string" && F.data.indexOf(f) === 0 && c(+F.data.slice(f.length));
+      var f = "setImmediate$" + Math.random() + "$", m = function(U) {
+        U.source === A && typeof U.data == "string" && U.data.indexOf(f) === 0 && c(+U.data.slice(f.length));
       };
-      A.addEventListener ? A.addEventListener("message", m, !1) : A.attachEvent("onmessage", m), n = function(F) {
-        A.postMessage(f + F, "*");
+      A.addEventListener ? A.addEventListener("message", m, !1) : A.attachEvent("onmessage", m), n = function(U) {
+        A.postMessage(f + U, "*");
       };
     }
     function d() {
       var f = new MessageChannel();
       f.port1.onmessage = function(m) {
-        var F = m.data;
-        c(F);
+        var U = m.data;
+        c(U);
       }, n = function(m) {
         f.port2.postMessage(m);
       };
@@ -1455,10 +1454,10 @@ var da = /* @__PURE__ */ C(((A, l) => {
     function E() {
       var f = e.documentElement;
       n = function(m) {
-        var F = e.createElement("script");
-        F.onreadystatechange = function() {
-          c(m), F.onreadystatechange = null, f.removeChild(F), F = null;
-        }, f.appendChild(F);
+        var U = e.createElement("script");
+        U.onreadystatechange = function() {
+          c(m), U.onreadystatechange = null, f.removeChild(U), U = null;
+        }, f.appendChild(U);
       };
     }
     function j() {
@@ -1468,7 +1467,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
     }
     var u = Object.getPrototypeOf && Object.getPrototypeOf(A);
     u = u && u.setTimeout ? u : A, {}.toString.call(A.process) === "[object process]" ? s() : g() ? t() : A.MessageChannel ? d() : e && "onreadystatechange" in e.createElement("script") ? E() : j(), u.setImmediate = o, u.clearImmediate = _;
-  })(typeof self > "u" ? typeof global > "u" ? exports : global : self);
+  })(typeof self > "u" ? typeof global > "u" ? void 0 : global : self);
 })), er = /* @__PURE__ */ C(((A, l) => {
   l.exports = function(r, i, a) {
     var e = {}, n = oa(), o = ca();
@@ -1502,8 +1501,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
           var m = "[^A-Za-z0-9" + _(E) + "]";
           g = g.replace(new RegExp(m, "g"), " "), g = g.replace(/_/g, " "), d = g.trim();
         } else {
-          var F = "[^\\p{L}\\p{N}|" + _(E) + "]";
-          g = g.replace(new RegExp(F, "gu"), " ");
+          var U = "[^\\p{L}\\p{N}|" + _(E) + "]";
+          g = g.replace(new RegExp(U, "gu"), " ");
           var u = "[" + _(E) + "]", f = E[0];
           g = g.replace(new RegExp(u, "g"), f), d = g.trim();
         }
@@ -1546,8 +1545,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
           item: d[0].choice,
           key: d[0].key
         } : (d = d.sort(function(u, f) {
-          var m = c(u.choice), F = c(f.choice), M = m.length, S = F.length;
-          return M === S ? m < F ? -1 : 1 : S - M;
+          var m = c(u.choice), U = c(f.choice), M = m.length, S = U.length;
+          return M === S ? m < U ? -1 : 1 : S - M;
         }), h.keepmap ? s[c(d[0].choice)] = {
           item: d[0].choice,
           key: d[0].key,
@@ -1560,8 +1559,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
           d[0][2],
           d
         ] : s[c(d[0][0])] = [d[0][0], d[0][2]] : (d = d.sort(function(u, f) {
-          var m = c(u[0]), F = c(f[0]), M = m.length, S = F.length;
-          return M === S ? m < F ? -1 : 1 : S - M;
+          var m = c(u[0]), U = c(f[0]), M = m.length, S = U.length;
+          return M === S ? m < U ? -1 : 1 : S - M;
         }), h.keepmap ? s[c(d[0][0])] = [
           d[0][0],
           d[0][2],
@@ -1578,61 +1577,61 @@ var da = /* @__PURE__ */ C(((A, l) => {
     "use strict";
     var r = da(), i = ha(), a = Jn(), e = Xn(), n = e._intersect, o = e._intersectWith, _ = e._difference, h = e._differenceWith, c = e._uniq, s = e._uniqWith, g = e._partialRight, t = e._forEach, d = e._isArray, E = Qn(), j = oa(), u = ca();
     typeof setImmediate != "function" && $n();
-    var f = er()(c, s, g), m = f.validate, F = f.process_and_sort, M = f.tokenize, S = f.full_process, D = f.clone_and_set_option_defaults, N = f.isCustomFunc, T = ar()(D, d, w, Re).dedupe;
-    function G(y, U, B) {
+    var f = er()(c, s, g), m = f.validate, U = f.process_and_sort, M = f.tokenize, S = f.full_process, D = f.clone_and_set_option_defaults, N = f.isCustomFunc, T = ar()(D, d, w, Re).dedupe;
+    function G(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, typeof p.subcost > "u" && (p.subcost = 1), p.astral ? E(y, U, p) : j(y, U, p, u);
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, typeof p.subcost > "u" && (p.subcost = 1), p.astral ? E(y, F, p) : j(y, F, p, u);
     }
-    function w(y, U, B) {
+    function w(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : ue(y, U, p);
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : ue(y, F, p);
     }
-    function V(y, U, B) {
+    function V(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : pe(y, U, p);
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : pe(y, F, p);
     }
-    function I(y, U, B) {
+    function I(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : Ke(y, U, p);
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : Ke(y, F, p);
     }
-    function q(y, U, B) {
+    function q(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : (p.partial = !0, Ke(y, U, p));
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : (p.partial = !0, Ke(y, F, p));
     }
-    function k(y, U, B) {
+    function k(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : (p.proc_sorted || (y = F(y), U = F(U)), ue(y, U, p));
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : (p.proc_sorted || (y = U(y), F = U(F)), ue(y, F, p));
     }
-    function Y(y, U, B) {
+    function Y(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : (p.partial = !0, p.proc_sorted || (y = F(y), U = F(U)), pe(y, U, p));
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : (p.partial = !0, p.proc_sorted || (y = U(y), F = U(F)), pe(y, F, p));
     }
-    function Q(y, U, B) {
+    function Q(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : Le(y, U, p);
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : Le(y, F, p);
     }
-    function ee(y, U, B) {
+    function ee(y, F, B) {
       var p = D(B);
-      return y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, !m(y) || !m(U) ? 0 : (p.partial = !0, Le(y, U, p));
+      return y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, !m(y) || !m(F) ? 0 : (p.partial = !0, Le(y, F, p));
     }
-    function ce(y, U, B) {
+    function ce(y, F, B) {
       var p = D(B);
-      if (y = p.normalize ? y.normalize() : y, U = p.normalize ? U.normalize() : U, y = p.full_process ? S(y, p) : y, U = p.full_process ? S(U, p) : U, p.full_process = !1, !m(y) || !m(U)) return 0;
-      var v = !0, P = 0.95, R = 0.9, O = ue(y, U, p), b = Math.max(y.length, U.length) / Math.min(y.length, U.length);
+      if (y = p.normalize ? y.normalize() : y, F = p.normalize ? F.normalize() : F, y = p.full_process ? S(y, p) : y, F = p.full_process ? S(F, p) : F, p.full_process = !1, !m(y) || !m(F)) return 0;
+      var v = !0, P = 0.95, R = 0.9, O = ue(y, F, p), b = Math.max(y.length, F.length) / Math.min(y.length, F.length);
       if (b < 1.5 && (v = !1), b > 8 && (R = 0.6), v) {
-        var W = pe(y, U, p) * R, x = Y(y, U, p) * P * R, $ = q(y, U, p) * P * R;
+        var W = pe(y, F, p) * R, x = Y(y, F, p) * P * R, $ = q(y, F, p) * P * R;
         return Math.round(Math.max(O, W, x, $));
       } else {
-        var ne = k(y, U, p) * P, J = I(y, U, p) * P;
+        var ne = k(y, F, p) * P, J = I(y, F, p) * P;
         return Math.round(Math.max(O, ne, J));
       }
     }
-    function Re(y, U, B) {
+    function Re(y, F, B) {
       var p = D(B), v;
-      if (d(U)) v = U.length;
-      else if (U instanceof Object) v = Object.keys(U).length;
+      if (d(F)) v = F.length;
+      else if (F instanceof Object) v = Object.keys(F).length;
       else throw new Error("Invalid choices");
-      if (!U || v === 0)
+      if (!F || v === 0)
         return console.warn("No choices"), [];
       if (p.processor && typeof p.processor != "function") throw new Error("Invalid Processor");
       if (p.processor || (p.processor = function(L) {
@@ -1649,7 +1648,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
       P || (p.astral && p.normalize && (p.normalize = !1, String.prototype.normalize ? (O = !0, y = y.normalize()) : console.warn("Normalization not supported in your environment")), y = R(y, p), p.full_process = !1, y.length === 0 && console.warn("Processed query is empty string"));
       var b = [], W = !1, x = !1, $ = !1;
       if (p.scorer.name === "token_sort_ratio" || p.scorer.name === "partial_token_sort_ratio") {
-        var ne = F(y);
+        var ne = U(y);
         x = !0;
       } else if (p.scorer.name === "token_set_ratio" || p.scorer.name === "partial_token_set_ratio") {
         var J = M(y, p);
@@ -1664,8 +1663,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
         return L[1] - z[1];
       }, le = function(L, z) {
         return z[1] - L[1];
-      }), t(U, function(L, z) {
-        p.tokens = void 0, p.proc_sorted = !1, x ? (p.proc_sorted = !0, L && L.proc_sorted ? Z = L.proc_sorted : (Z = R(O ? p.processor(L).normalize() : p.processor(L), p), Z = F(Z)), ae = p.scorer(ne, Z, p)) : $ ? (Z = "x", L && L.tokens ? (p.tokens = [J, L.tokens], p.trySimple && (Z = R(p.processor(L), p))) : (Z = R(O ? p.processor(L).normalize() : p.processor(L), p), p.tokens = [J, M(Z, p)]), ae = p.scorer(y, Z, p)) : P ? (Z = p.processor(L), ae = p.scorer(y, Z, p)) : (Z = R(O ? p.processor(L).normalize() : p.processor(L), p), (typeof Z != "string" || Z.length === 0) && (W = !0), ae = p.scorer(y, Z, p)), ae > p.cutoff && (p.returnObjects ? b.push({
+      }), t(F, function(L, z) {
+        p.tokens = void 0, p.proc_sorted = !1, x ? (p.proc_sorted = !0, L && L.proc_sorted ? Z = L.proc_sorted : (Z = R(O ? p.processor(L).normalize() : p.processor(L), p), Z = U(Z)), ae = p.scorer(ne, Z, p)) : $ ? (Z = "x", L && L.tokens ? (p.tokens = [J, L.tokens], p.trySimple && (Z = R(p.processor(L), p))) : (Z = R(O ? p.processor(L).normalize() : p.processor(L), p), p.tokens = [J, M(Z, p)]), ae = p.scorer(y, Z, p)) : P ? (Z = p.processor(L), ae = p.scorer(y, Z, p)) : (Z = R(O ? p.processor(L).normalize() : p.processor(L), p), (typeof Z != "string" || Z.length === 0) && (W = !0), ae = p.scorer(y, Z, p)), ae > p.cutoff && (p.returnObjects ? b.push({
           choice: L,
           score: ae,
           key: z
@@ -1676,7 +1675,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
         ]));
       }), W && console.log("One or more choices were empty. (post-processing if applied)"), p.limit && typeof p.limit == "number" && p.limit > 0 && p.limit < v && !p.unsorted ? b = i.nlargest(b, p.limit, te) : p.unsorted || (b = b.sort(le)), b;
     }
-    function Ie(y, U, B, p) {
+    function Ie(y, F, B, p) {
       var v = D(B), P;
       typeof B.abortController == "object" && (P = B.abortController);
       var R;
@@ -1684,15 +1683,15 @@ var da = /* @__PURE__ */ C(((A, l) => {
       var O = 256;
       typeof v.asyncLoopOffset == "number" && (v.asyncLoopOffset < 1 ? O = 1 : O = v.asyncLoopOffset);
       var b = !1, W;
-      if (U && U.length && d(U))
-        W = U.length, b = !0;
-      else if (U instanceof Object)
-        W = Object.keys(U).length;
+      if (F && F.length && d(F))
+        W = F.length, b = !0;
+      else if (F instanceof Object)
+        W = Object.keys(F).length;
       else {
         p(/* @__PURE__ */ new Error("Invalid choices"));
         return;
       }
-      if (!U || W === 0) {
+      if (!F || W === 0) {
         console.warn("No choices"), p(null, []);
         return;
       }
@@ -1717,7 +1716,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
       x || (v.astral && v.normalize && (v.normalize = !1, String.prototype.normalize ? (ne = !0, y = y.normalize()) : console.warn("Normalization not supported in your environment")), y = $(y, v), v.full_process = !1, y.length === 0 && console.warn("Processed query is empty string"));
       var J = [], ae = !1, Z = !1, te = !1;
       if (v.scorer.name === "token_sort_ratio" || v.scorer.name === "partial_token_sort_ratio") {
-        var le = F(y);
+        var le = U(y);
         Z = !0;
       } else if (v.scorer.name === "token_set_ratio" || v.scorer.name === "partial_token_set_ratio") {
         var L = M(y, v);
@@ -1733,15 +1732,15 @@ var da = /* @__PURE__ */ C(((A, l) => {
       }, fe = function(K, X) {
         return X[1] - K[1];
       });
-      var de = Object.keys(U);
+      var de = Object.keys(F);
       b ? se(0) : se(de[0], 0);
       function se(K, X) {
-        if ((b || U.hasOwnProperty(K)) && (v.tokens = void 0, v.proc_sorted = !1, Z ? (v.proc_sorted = !0, U[K] && U[K].proc_sorted ? H = U[K].proc_sorted : (H = $(ne ? v.processor(U[K]).normalize() : v.processor(U[K]), v), H = F(H)), re = v.scorer(le, H, v)) : te ? (H = "x", U[K] && U[K].tokens ? (v.tokens = [L, U[K].tokens], v.trySimple && (H = $(v.processor(U[K]), v))) : (H = $(ne ? v.processor(U[K]).normalize() : v.processor(U[K]), v), v.tokens = [L, M(H, v)]), re = v.scorer(y, H, v)) : x ? (H = v.processor(U[K]), re = v.scorer(y, H, v)) : (H = $(ne ? v.processor(U[K]).normalize() : v.processor(U[K]), v), (typeof H != "string" || H.length === 0) && (ae = !0), re = v.scorer(y, H, v)), b ? z = parseInt(K) : z = K, re > v.cutoff && (v.returnObjects ? J.push({
-          choice: U[K],
+        if ((b || F.hasOwnProperty(K)) && (v.tokens = void 0, v.proc_sorted = !1, Z ? (v.proc_sorted = !0, F[K] && F[K].proc_sorted ? H = F[K].proc_sorted : (H = $(ne ? v.processor(F[K]).normalize() : v.processor(F[K]), v), H = U(H)), re = v.scorer(le, H, v)) : te ? (H = "x", F[K] && F[K].tokens ? (v.tokens = [L, F[K].tokens], v.trySimple && (H = $(v.processor(F[K]), v))) : (H = $(ne ? v.processor(F[K]).normalize() : v.processor(F[K]), v), v.tokens = [L, M(H, v)]), re = v.scorer(y, H, v)) : x ? (H = v.processor(F[K]), re = v.scorer(y, H, v)) : (H = $(ne ? v.processor(F[K]).normalize() : v.processor(F[K]), v), (typeof H != "string" || H.length === 0) && (ae = !0), re = v.scorer(y, H, v)), b ? z = parseInt(K) : z = K, re > v.cutoff && (v.returnObjects ? J.push({
+          choice: F[K],
           score: re,
           key: z
         }) : J.push([
-          U[K],
+          F[K],
           re,
           z
         ]))), P && P.signal.aborted === !0) {
@@ -1752,16 +1751,16 @@ var da = /* @__PURE__ */ C(((A, l) => {
           p(/* @__PURE__ */ new Error("canceled"));
           return;
         }
-        b && K < U.length - 1 ? K % O === 0 ? setImmediate(function() {
+        b && K < F.length - 1 ? K % O === 0 ? setImmediate(function() {
           se(K + 1);
         }) : se(K + 1) : X < de.length - 1 ? X % O === 0 ? setImmediate(function() {
           se(de[X + 1], X + 1);
         }) : se(de[X + 1], X + 1) : (ae && console.log("One or more choices were empty. (post-processing if applied)"), v.limit && typeof v.limit == "number" && v.limit > 0 && v.limit < W && !v.unsorted ? J = i.nlargest(J, v.limit, ge) : v.unsorted || (J = J.sort(fe)), p(null, J));
       }
     }
-    function ma(y, U, B) {
-      var p = Object.keys(y), v = Object.keys(U), P = n(p, v).map(function(b) {
-        return y[b] * U[b];
+    function ma(y, F, B) {
+      var p = Object.keys(y), v = Object.keys(F), P = n(p, v).map(function(b) {
+        return y[b] * F[b];
       }).reduce(function(b, W) {
         return b + W;
       }, 0), R = p.map(function(b) {
@@ -1769,21 +1768,21 @@ var da = /* @__PURE__ */ C(((A, l) => {
       }).reduce(function(b, W) {
         return b + W;
       }, 0), O = v.map(function(b) {
-        return Math.pow(U[b], 2);
+        return Math.pow(F[b], 2);
       }).reduce(function(b, W) {
         return b + W;
       }, 0);
       return P / (Math.sqrt(R) * Math.sqrt(O));
     }
     var Se = "%*SuperUniqueWildcardKey*%";
-    function be(y, U) {
+    function be(y, F) {
       var B = y;
-      if (U.astral) var p = Array.from(B);
+      if (F.astral) var p = Array.from(B);
       else var p = B.split("");
       var v = {};
-      if (U.wildcards) for (var P = 0; P < p.length; P++) {
+      if (F.wildcards) for (var P = 0; P < p.length; P++) {
         var R = p[P];
-        U.wildcards.indexOf(R) > -1 ? v[Se] ? v[Se] += 1 : v[Se] = 1 : v[R] ? v[R] += 1 : v[R] = 1;
+        F.wildcards.indexOf(R) > -1 ? v[Se] ? v[Se] += 1 : v[Se] = 1 : v[R] ? v[R] += 1 : v[R] = 1;
       }
       else for (var P = 0; P < p.length; P++) {
         var R = p[P];
@@ -1791,8 +1790,8 @@ var da = /* @__PURE__ */ C(((A, l) => {
       }
       return v;
     }
-    function Ge(y, U, B) {
-      for (var p = U, v = y.reduce(function(W, x) {
+    function Ge(y, F, B) {
+      for (var p = F, v = y.reduce(function(W, x) {
         return W[x] = be(x, B), W;
       }, {}), P = p.reduce(function(W, x) {
         return W[x] = be(x, B), W;
@@ -1806,24 +1805,24 @@ var da = /* @__PURE__ */ C(((A, l) => {
       }
       return R.concat(p);
     }
-    function Oe(y, U, B, p) {
-      var v = U, P = p;
-      return (U.length > p.length || U.length === p.length && (y.length > B.length || [y, B].sort()[0] === B)) && (v = p, P = U), [v, P];
+    function Oe(y, F, B, p) {
+      var v = F, P = p;
+      return (F.length > p.length || F.length === p.length && (y.length > B.length || [y, B].sort()[0] === B)) && (v = p, P = F), [v, P];
     }
-    function Le(y, U, B) {
+    function Le(y, F, B) {
       if (B.tokens)
         var p = B.tokens[0], v = B.tokens[1];
       else
-        var p = M(y, B), v = M(U, B);
-      var P = Oe(y, p.sort(), U, v.sort()), R = P[0], O = P[1];
+        var p = M(y, B), v = M(F, B);
+      var P = Oe(y, p.sort(), F, v.sort()), R = P[0], O = P[1];
       const b = Ge(R, O, B);
       return B.partial ? pe(R.join(" "), b.join(" "), B) : ue(R.join(" "), b.join(" "), B);
     }
-    function Ke(y, U, B) {
+    function Ke(y, F, B) {
       if (B.tokens)
         var p = B.tokens[0], v = B.tokens[1];
       else
-        var p = M(y, B), v = M(U, B);
+        var p = M(y, B), v = M(F, B);
       if (B.wildcards)
         var P = g(j, B, u), R = function(ge, fe) {
           return P(ge, fe) === 0;
@@ -1832,7 +1831,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
         var O = n(p, v), b = _(p, v), W = _(v, p);
       var x = O.sort().join(" "), $ = b.sort(), ne = W.sort();
       if (B.sortBySimilarity)
-        var J = Oe(y, $, U, ne), ae = J[0], Z = J[1], te = ae.join(" "), le = Ge(ae, Z, B).join(" ");
+        var J = Oe(y, $, F, ne), ae = J[0], Z = J[1], te = ae.join(" "), le = Ge(ae, Z, B).join(" ");
       else
         var te = $.join(" "), le = ne.join(" ");
       var L = x + " " + te, z = x + " " + le;
@@ -1845,24 +1844,24 @@ var da = /* @__PURE__ */ C(((A, l) => {
         H(x, z, B),
         H(L, z, B)
       ];
-      return B.trySimple && re.push(H(y, U, B)), Math.max.apply(null, re);
+      return B.trySimple && re.push(H(y, F, B)), Math.max.apply(null, re);
     }
-    function ue(y, U, B) {
-      if (!m(y) || !m(U)) return 0;
+    function ue(y, F, B) {
+      if (!m(y) || !m(F)) return 0;
       if (B.ratio_alg && B.ratio_alg === "difflib") {
-        var p = new r(null, y, U, B.autojunk).ratio();
+        var p = new r(null, y, F, B.autojunk).ratio();
         return Math.round(100 * p);
       }
       typeof B.subcost > "u" && (B.subcost = 2);
       var v, P;
-      return B.astral ? (v = E(y, U, B), P = Array.from(y).length + Array.from(U).length) : B.wildcards ? (v = j(y, U, B, u), P = y.length + U.length) : (v = u(y, U, B), P = y.length + U.length), Math.round(100 * ((P - v) / P));
+      return B.astral ? (v = E(y, F, B), P = Array.from(y).length + Array.from(F).length) : B.wildcards ? (v = j(y, F, B, u), P = y.length + F.length) : (v = u(y, F, B), P = y.length + F.length), Math.round(100 * ((P - v) / P));
     }
-    function pe(y, U, B) {
-      if (!m(y) || !m(U)) return 0;
-      if (y.length <= U.length)
-        var p = y, v = U;
+    function pe(y, F, B) {
+      if (!m(y) || !m(F)) return 0;
+      if (y.length <= F.length)
+        var p = y, v = F;
       else
-        var p = U, v = y;
+        var p = F, v = y;
       for (var P = new r(null, p, v, B.autojunk).getMatchingBlocks(), R = [], O = 0; O < P.length; O++) {
         var b = P[O][1] - P[O][0] > 0 ? P[O][1] - P[O][0] : 0, W = b + p.length, x = ue(p, v.substring(b, W), B);
         if (x > 99.5) return 100;
@@ -1872,7 +1871,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
     }
     Object.keys || (Object.keys = (function() {
       "use strict";
-      var y = Object.prototype.hasOwnProperty, U = !{ toString: null }.propertyIsEnumerable("toString"), B = [
+      var y = Object.prototype.hasOwnProperty, F = !{ toString: null }.propertyIsEnumerable("toString"), B = [
         "toString",
         "toLocaleString",
         "valueOf",
@@ -1885,15 +1884,15 @@ var da = /* @__PURE__ */ C(((A, l) => {
         if (typeof v != "object" && (typeof v != "function" || v === null)) throw new TypeError("Object.keys called on non-object");
         var P = [], R, O;
         for (R in v) y.call(v, R) && P.push(R);
-        if (U)
+        if (F)
           for (O = 0; O < p; O++) y.call(v, B[O]) && P.push(B[O]);
         return P;
       };
     })());
     var We = void 0;
-    typeof Promise < "u" && (We = function(y, U, B) {
+    typeof Promise < "u" && (We = function(y, F, B) {
       return new Promise(function(p, v) {
-        Ie(y, U, B, function(P, R) {
+        Ie(y, F, B, function(P, R) {
           P ? v(P) : p(R);
         });
       });
@@ -1913,7 +1912,7 @@ var da = /* @__PURE__ */ C(((A, l) => {
       extract: Re,
       extractAsync: Ie,
       extractAsPromised: We,
-      process_and_sort: F,
+      process_and_sort: U,
       unique_tokens: M,
       dedupe: T
     };