@leaflink/stash 49.5.0 → 50.0.0

package/dist/{searchFuzzy-9b74ec4e.js → searchFuzzy-DKooyZM8.js}

@@ -1,4 +1,4 @@
-import { c as Le, g as me } from "./_commonjsHelpers-10dfc225.js";
+import { c as Le, g as me } from "./_commonjsHelpers-DaMA6jEr.js";
 import ye from "lodash-es/isPlainObject";
 import "vue";
 import { normalizeText as Ie } from "./utils/helpers.js";
@@ -14,15 +14,13 @@ var he = { exports: {} };
     A.exports ? A.exports = z() : E.fuzzysort = z();
   })(Le, (E) => {
     var z = (r, e) => {
-      if (!r || !e)
-        return b;
+      if (!r || !e) return b;
       var a = ue(r);
       Y(e) || (e = G(e));
       var i = a.bitflags;
       return (i & e._bitflags) !== i ? b : K(a, e);
     }, ie = (r, e, a) => {
-      if (!r)
-        return a != null && a.all ? oe(e, a) : ne;
+      if (!r) return a != null && a.all ? oe(e, a) : ne;
       var i = ue(r), v = i.bitflags, f = i.containsSpace, n = Q((a == null ? void 0 : a.threshold) || 0), s = (a == null ? void 0 : a.limit) || ae, t = 0, _ = 0, c = e.length;
       function I(D) {
         t < s ? (U.add(D), ++t) : (++_, D._score > U.peek()._score && U.replaceTop(D));
@@ -37,88 +35,79 @@ var he = { exports: {} };
         }
       else if (a != null && a.keys) {
         var O = a.keys, k = O.length;
-        e:
-          for (var g = 0; g < c; ++g) {
-            var y = e[g];
-            {
-              for (var m = 0, u = 0; u < k; ++u) {
-                var L = O[u], h = Z(y, L);
-                if (!h) {
-                  re[u] = H;
-                  continue;
-                }
-                Y(h) || (h = G(h)), re[u] = h, m |= h._bitflags;
-              }
-              if ((v & m) !== v)
-                continue;
-            }
-            if (f)
-              for (let o = 0; o < i.spaceSearches.length; o++)
-                T[o] = B;
-            for (var u = 0; u < k; ++u) {
-              if (h = re[u], h === H) {
-                $[u] = H;
-                continue;
-              }
-              if ($[u] = K(
-                i,
-                h,
-                /*allowSpaces=*/
-                !1,
-                /*allowPartialMatch=*/
-                f
-              ), $[u] === b) {
-                $[u] = H;
+        e: for (var g = 0; g < c; ++g) {
+          var y = e[g];
+          {
+            for (var m = 0, u = 0; u < k; ++u) {
+              var L = O[u], h = Z(y, L);
+              if (!h) {
+                re[u] = H;
                 continue;
               }
-              if (f)
-                for (let x = 0; x < i.spaceSearches.length; x++) {
-                  if (V[x] > -1e3 && T[x] > B) {
-                    var S = (T[x] + V[x]) / 4;
-                    S > T[x] && (T[x] = S);
-                  }
-                  V[x] > T[x] && (T[x] = V[x]);
-                }
+              Y(h) || (h = G(h)), re[u] = h, m |= h._bitflags;
             }
-            if (f) {
-              for (let o = 0; o < i.spaceSearches.length; o++)
-                if (T[o] === B)
-                  continue e;
-            } else {
-              var l = !1;
-              for (let o = 0; o < k; o++)
-                if ($[o]._score !== B) {
-                  l = !0;
-                  break;
-                }
-              if (!l)
-                continue;
+            if ((v & m) !== v) continue;
+          }
+          if (f) for (let o = 0; o < i.spaceSearches.length; o++) T[o] = B;
+          for (var u = 0; u < k; ++u) {
+            if (h = re[u], h === H) {
+              $[u] = H;
+              continue;
             }
-            var C = new te(k);
-            for (let o = 0; o < k; o++)
-              C[o] = $[o];
-            if (f) {
-              var w = 0;
-              for (let o = 0; o < i.spaceSearches.length; o++)
-                w += T[o];
-            } else {
-              var w = B;
-              for (let x = 0; x < k; x++) {
-                var d = C[x];
-                if (d._score > -1e3 && w > B) {
-                  var S = (w + d._score) / 4;
-                  S > w && (w = S);
-                }
-                d._score > w && (w = d._score);
+            if ($[u] = K(
+              i,
+              h,
+              /*allowSpaces=*/
+              !1,
+              /*allowPartialMatch=*/
+              f
+            ), $[u] === b) {
+              $[u] = H;
+              continue;
+            }
+            if (f) for (let x = 0; x < i.spaceSearches.length; x++) {
+              if (V[x] > -1e3 && T[x] > B) {
+                var S = (T[x] + V[x]) / 4;
+                S > T[x] && (T[x] = S);
               }
+              V[x] > T[x] && (T[x] = V[x]);
             }
-            if (C.obj = y, C._score = w, a != null && a.scoreFn) {
-              if (w = a.scoreFn(C), !w)
-                continue;
-              w = Q(w), C._score = w;
+          }
+          if (f) {
+            for (let o = 0; o < i.spaceSearches.length; o++)
+              if (T[o] === B) continue e;
+          } else {
+            var l = !1;
+            for (let o = 0; o < k; o++)
+              if ($[o]._score !== B) {
+                l = !0;
+                break;
+              }
+            if (!l) continue;
+          }
+          var C = new te(k);
+          for (let o = 0; o < k; o++)
+            C[o] = $[o];
+          if (f) {
+            var w = 0;
+            for (let o = 0; o < i.spaceSearches.length; o++) w += T[o];
+          } else {
+            var w = B;
+            for (let x = 0; x < k; x++) {
+              var d = C[x];
+              if (d._score > -1e3 && w > B) {
+                var S = (w + d._score) / 4;
+                S > w && (w = S);
+              }
+              d._score > w && (w = d._score);
             }
-            w < n || I(C);
           }
+          if (C.obj = y, C._score = w, a != null && a.scoreFn) {
+            if (w = a.scoreFn(C), !w) continue;
+            w = Q(w), C._score = w;
+          }
+          w < n || I(C);
+        }
       } else
         for (var g = 0; g < c; ++g) {
           var h = e[g];
@@ -127,10 +116,8 @@ var he = { exports: {} };
             d !== b && (d._score < n || I(d));
           }
         }
-      if (t === 0)
-        return ne;
-      for (var M = new Array(t), g = t - 1; g >= 0; --g)
-        M[g] = U.poll();
+      if (t === 0) return ne;
+      for (var M = new Array(t), g = t - 1; g >= 0; --g) M[g] = U.poll();
       return M.total = t + _, M;
     }, J = (r, e = "<b>", a = "</b>") => {
       for (var i = typeof e == "function" ? e : void 0, v = r.target, f = v.length, n = r.indexes, s = "", t = 0, _ = 0, c = !1, I = [], L = 0; L < f; ++L) {
@@ -194,13 +181,11 @@ var he = { exports: {} };
       }
       return { lowerCodes: e.lowerCodes, _lower: e._lower, containsSpace: e.containsSpace, bitflags: e.bitflags, spaceSearches: a };
     }, G = (r) => {
-      if (r.length > 999)
-        return P(r);
+      if (r.length > 999) return P(r);
       var e = p.get(r);
       return e !== void 0 || (e = P(r), p.set(r, e)), e;
     }, ue = (r) => {
-      if (r.length > 999)
-        return ce(r);
+      if (r.length > 999) return ce(r);
       var e = ee.get(r);
       return e !== void 0 || (e = ce(r), ee.set(r, e)), e;
     }, oe = (r, e) => {
@@ -213,8 +198,7 @@ var he = { exports: {} };
           if (n != b) {
             Y(n) || (n = G(n));
             var s = se(n.target, { _score: n._score, obj: f });
-            if (a.push(s), a.length >= i)
-              return a;
+            if (a.push(s), a.length >= i) return a;
           }
         }
       else if (e != null && e.keys)
@@ -227,8 +211,7 @@ var he = { exports: {} };
             }
             Y(n) || (n = G(n)), n._score = B, n._indexes.len = 0, t[_] = n;
           }
-          if (t.obj = f, t._score = B, a.push(t), a.length >= i)
-            return a;
+          if (t.obj = f, t._score = B, a.push(t), a.length >= i) return a;
         }
       else
         for (var v = 0; v < r.length; v++) {
@@ -238,46 +221,40 @@ var he = { exports: {} };
         }
       return a;
     }, K = (r, e, a = !1, i = !1) => {
-      if (a === !1 && r.containsSpace)
-        return de(r, e, i);
+      if (a === !1 && r.containsSpace) return de(r, e, i);
       for (var v = r._lower, f = r.lowerCodes, n = f[0], s = e._targetLowerCodes, t = f.length, _ = s.length, g = 0, c = 0, I = 0; ; ) {
         var L = n === s[c];
         if (L) {
-          if (N[I++] = c, ++g, g === t)
-            break;
+          if (N[I++] = c, ++g, g === t) break;
           n = f[g];
         }
-        if (++c, c >= _)
-          return b;
+        if (++c, c >= _) return b;
       }
       var g = 0, y = !1, h = 0, d = e._nextBeginningIndexes;
       d === b && (d = e._nextBeginningIndexes = we(e.target)), c = N[0] === 0 ? 0 : d[N[0] - 1];
       var O = 0;
-      if (c !== _)
-        for (; ; )
-          if (c >= _) {
-            if (g <= 0 || (++O, O > 200))
+      if (c !== _) for (; ; )
+        if (c >= _) {
+          if (g <= 0 || (++O, O > 200)) break;
+          --g;
+          var k = W[--h];
+          c = d[k];
+        } else {
+          var L = f[g] === s[c];
+          if (L) {
+            if (W[h++] = c, ++g, g === t) {
+              y = !0;
               break;
-            --g;
-            var k = W[--h];
-            c = d[k];
-          } else {
-            var L = f[g] === s[c];
-            if (L) {
-              if (W[h++] = c, ++g, g === t) {
-                y = !0;
-                break;
-              }
-              ++c;
-            } else
-              c = d[c];
-          }
+            }
+            ++c;
+          } else
+            c = d[c];
+        }
       var m = t <= 1 ? -1 : e._targetLower.indexOf(v, N[0]), u = !!~m, S = u ? m === 0 || e._nextBeginningIndexes[m - 1] === m : !1;
       if (u && !S) {
         for (var l = 0; l < d.length; l = d[l])
           if (!(l <= m)) {
-            for (var C = 0; C < t && f[C] === e._targetLowerCodes[l + C]; C++)
-              ;
+            for (var C = 0; C < t && f[C] === e._targetLowerCodes[l + C]; C++) ;
             if (C === t) {
               m = l, S = !0;
               break;
@@ -291,41 +268,34 @@ var he = { exports: {} };
         if (x -= (12 + Se) * _e, o[0] !== 0 && (x -= o[0] * o[0] * 0.2), !y)
           x *= 1e3;
         else {
-          for (var fe = 1, F = d[0]; F < _; F = d[F])
-            ++fe;
+          for (var fe = 1, F = d[0]; F < _; F = d[F]) ++fe;
           fe > 24 && (x *= (fe - 24) * 10);
         }
         return x -= (_ - t) / 2, u && (x /= 1 + t * t * 1), S && (x /= 1 + t * t * 1), x -= (_ - t) / 2, x;
       };
       if (y)
         if (S) {
-          for (var l = 0; l < t; ++l)
-            N[l] = m + l;
+          for (var l = 0; l < t; ++l) N[l] = m + l;
           var M = N, D = w(N);
         } else
           var M = W, D = w(W);
       else {
-        if (u)
-          for (var l = 0; l < t; ++l)
-            N[l] = m + l;
+        if (u) for (var l = 0; l < t; ++l) N[l] = m + l;
         var M = N, D = w(M);
       }
       e._score = D;
-      for (var l = 0; l < t; ++l)
-        e._indexes[l] = M[l];
+      for (var l = 0; l < t; ++l) e._indexes[l] = M[l];
       e._indexes.len = t;
       const j = new ve();
       return j.target = e.target, j._score = e._score, j._indexes = e._indexes, j;
     }, de = (r, e, a) => {
       for (var i = /* @__PURE__ */ new Set(), v = 0, f = b, n = 0, s = r.spaceSearches, t = s.length, _ = 0, c = () => {
-        for (let S = _ - 1; S >= 0; S--)
-          e._nextBeginningIndexes[X[S * 2 + 0]] = X[S * 2 + 1];
+        for (let S = _ - 1; S >= 0; S--) e._nextBeginningIndexes[X[S * 2 + 0]] = X[S * 2 + 1];
       }, I = !1, u = 0; u < t; ++u) {
         V[u] = B;
         var L = s[u];
         if (f = K(L, e), a) {
-          if (f === b)
-            continue;
+          if (f === b) continue;
           I = !0;
         } else if (f === b)
           return c(), b;
@@ -344,11 +314,9 @@ var he = { exports: {} };
           }
         }
         v += f._score / t, V[u] = f._score / t, f._indexes[0] < n && (v -= (n - f._indexes[0]) * 2), n = f._indexes[0];
-        for (var k = 0; k < f._indexes.len; ++k)
-          i.add(f._indexes[k]);
+        for (var k = 0; k < f._indexes.len; ++k) i.add(f._indexes[k]);
       }
-      if (a && !I)
-        return b;
+      if (a && !I) return b;
       c();
       var m = K(
         r,
@@ -364,8 +332,7 @@ var he = { exports: {} };
       }
       a && (f = e), f._score = v;
       var u = 0;
-      for (let S of i)
-        f._indexes[u++] = S;
+      for (let S of i) f._indexes[u++] = S;
       return f._indexes.len = u, f;
     }, R = (r) => {
       for (var e = r.length, a = r.toLowerCase(), i = [], v = 0, f = !1, n = 0; n < e; ++n) {
@@ -390,14 +357,11 @@ var he = { exports: {} };
       return i;
     }, p = /* @__PURE__ */ new Map(), ee = /* @__PURE__ */ new Map(), N = [], W = [], X = [], T = [], V = [], re = [], $ = [], Z = (r, e) => {
       var a = r[e];
-      if (a !== void 0)
-        return a;
-      if (typeof e == "function")
-        return e(r);
+      if (a !== void 0) return a;
+      if (typeof e == "function") return e(r);
       var i = e;
       Array.isArray(e) || (i = e.split("."));
-      for (var v = i.length, f = -1; r && ++f < v; )
-        r = r[i[f]];
+      for (var v = i.length, f = -1; r && ++f < v; ) r = r[i[f]];
       return r;
     }, Y = (r) => typeof r == "object" && typeof r._bitflags == "number", ae = 1 / 0, B = -ae, ne = [];
     ne.total = 0;
@@ -407,15 +371,13 @@ var he = { exports: {} };
           var _ = t + 1;
           n = t, _ < a && e[_]._score < e[t]._score && (n = _), e[n - 1 >> 1] = e[n], t = 1 + (n << 1);
         }
-        for (var c = n - 1 >> 1; n > 0 && s._score < e[c]._score; c = (n = c) - 1 >> 1)
-          e[n] = e[c];
+        for (var c = n - 1 >> 1; n > 0 && s._score < e[c]._score; c = (n = c) - 1 >> 1) e[n] = e[c];
         e[n] = s;
       };
       return i.add = (f) => {
         var n = a;
         e[a++] = f;
-        for (var s = n - 1 >> 1; n > 0 && f._score < e[s]._score; s = (n = s) - 1 >> 1)
-          e[n] = e[s];
+        for (var s = n - 1 >> 1; n > 0 && f._score < e[s]._score; s = (n = s) - 1 >> 1) e[n] = e[s];
         e[n] = f;
       }, i.poll = (f) => {
         if (a !== 0) {
@@ -423,8 +385,7 @@ var he = { exports: {} };
           return e[0] = e[--a], v(), n;
         }
       }, i.peek = (f) => {
-        if (a !== 0)
-          return e[0];
+        if (a !== 0) return e[0];
       }, i.replaceTop = (f) => {
         e[0] = f, v();
       }, i;
@@ -443,4 +404,4 @@ export {
   Ce as i,
   Fe as s
 };
-//# sourceMappingURL=searchFuzzy-9b74ec4e.js.map
+//# sourceMappingURL=searchFuzzy-DKooyZM8.js.map