@leaflink/stash 51.11.0 → 51.11.1

package/dist/searchFuzzy-DBDE6jkd.js

@@ -1,408 +0,0 @@
-import { g as Le } from "./_commonjsHelpers-DaMA6jEr.js";
-import ye from "lodash-es/isPlainObject";
-import "vue";
-import { normalizeText as me } from "./utils/helpers.js";
-function Ie(C) {
-  return Array.isArray(C) && typeof C[0] == "string";
-}
-function ze(C) {
-  return Array.isArray(C) && ye(C[0]);
-}
-var U = { exports: {} }, Be = U.exports, _e;
-function Ce() {
-  return _e || (_e = 1, function(C) {
-    ((T, M) => {
-      C.exports ? C.exports = M() : T.fuzzysort = M();
-    })(Be, (T) => {
-      var M = (r, e) => {
-        if (!r || !e) return b;
-        var n = ue(r);
-        G(e) || (e = P(e));
-        var t = n.bitflags;
-        return (t & e._bitflags) !== t ? b : Y(n, e);
-      }, te = (r, e, n) => {
-        if (!r) return n?.all ? de(e, n) : ae;
-        var t = ue(r), f = t.bitflags, i = t.containsSpace, a = H(n?.threshold || 0), v = n?.limit || ne, s = 0, c = 0, l = e.length;
-        function m(V) {
-          s < v ? (X.add(V), ++s) : (++c, V._score > X.peek()._score && X.replaceTop(V));
-        }
-        if (n?.key)
-          for (var p = n.key, _ = 0; _ < l; ++_) {
-            var y = e[_], g = W(y, p);
-            if (g && (G(g) || (g = P(g)), (f & g._bitflags) === f)) {
-              var d = Y(t, g);
-              d !== b && (d._score < a || (d.obj = y, m(d)));
-            }
-          }
-        else if (n?.keys) {
-          var E = n.keys, B = E.length;
-          e: for (var _ = 0; _ < l; ++_) {
-            var y = e[_];
-            {
-              for (var L = 0, u = 0; u < B; ++u) {
-                var p = E[u], g = W(y, p);
-                if (!g) {
-                  re[u] = D;
-                  continue;
-                }
-                G(g) || (g = P(g)), re[u] = g, L |= g._bitflags;
-              }
-              if ((f & L) !== f) continue;
-            }
-            if (i) for (let h = 0; h < t.spaceSearches.length; h++) A[h] = I;
-            for (var u = 0; u < B; ++u) {
-              if (g = re[u], g === D) {
-                $[u] = D;
-                continue;
-              }
-              if ($[u] = Y(
-                t,
-                g,
-                /*allowSpaces=*/
-                !1,
-                /*allowPartialMatch=*/
-                i
-              ), $[u] === b) {
-                $[u] = D;
-                continue;
-              }
-              if (i) for (let x = 0; x < t.spaceSearches.length; x++) {
-                if (q[x] > -1e3 && A[x] > I) {
-                  var S = (A[x] + q[x]) / 4;
-                  S > A[x] && (A[x] = S);
-                }
-                q[x] > A[x] && (A[x] = q[x]);
-              }
-            }
-            if (i) {
-              for (let h = 0; h < t.spaceSearches.length; h++)
-                if (A[h] === I) continue e;
-            } else {
-              var o = !1;
-              for (let h = 0; h < B; h++)
-                if ($[h]._score !== I) {
-                  o = !0;
-                  break;
-                }
-              if (!o) continue;
-            }
-            var z = new se(B);
-            for (let h = 0; h < B; h++)
-              z[h] = $[h];
-            if (i) {
-              var w = 0;
-              for (let h = 0; h < t.spaceSearches.length; h++) w += A[h];
-            } else {
-              var w = I;
-              for (let x = 0; x < B; x++) {
-                var d = z[x];
-                if (d._score > -1e3 && w > I) {
-                  var S = (w + d._score) / 4;
-                  S > w && (w = S);
-                }
-                d._score > w && (w = d._score);
-              }
-            }
-            if (z.obj = y, z._score = w, n?.scoreFn) {
-              if (w = n.scoreFn(z), !w) continue;
-              w = H(w), z._score = w;
-            }
-            w < a || m(z);
-          }
-        } else
-          for (var _ = 0; _ < l; ++_) {
-            var g = e[_];
-            if (g && (G(g) || (g = P(g)), (f & g._bitflags) === f)) {
-              var d = Y(t, g);
-              d !== b && (d._score < a || m(d));
-            }
-          }
-        if (s === 0) return ae;
-        for (var O = new Array(s), _ = s - 1; _ >= 0; --_) O[_] = X.poll();
-        return O.total = s + c, O;
-      }, K = (r, e = "<b>", n = "</b>") => {
-        for (var t = typeof e == "function" ? e : void 0, f = r.target, i = f.length, a = r.indexes, v = "", s = 0, c = 0, l = !1, m = [], p = 0; p < i; ++p) {
-          var _ = f[p];
-          if (a[c] === p) {
-            if (++c, l || (l = !0, t ? (m.push(v), v = "") : v += e), c === a.length) {
-              t ? (v += _, m.push(t(v, s++)), v = "", m.push(f.substr(p + 1))) : v += _ + n + f.substr(p + 1);
-              break;
-            }
-          } else
-            l && (l = !1, t ? (m.push(t(v, s++)), v = "") : v += n);
-          v += _;
-        }
-        return t ? m : v;
-      }, F = (r) => {
-        typeof r == "number" ? r = "" + r : typeof r != "string" && (r = "");
-        var e = R(r);
-        return ve(r, { _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _bitflags: e.bitflags });
-      }, he = () => {
-        j.clear(), ee.clear();
-      };
-      class fe {
-        get indexes() {
-          return this._indexes.slice(0, this._indexes.len).sort((e, n) => e - n);
-        }
-        set indexes(e) {
-          return this._indexes = e;
-        }
-        highlight(e, n) {
-          return K(this, e, n);
-        }
-        get score() {
-          return oe(this._score);
-        }
-        set score(e) {
-          this._score = H(e);
-        }
-      }
-      class se extends Array {
-        get score() {
-          return oe(this._score);
-        }
-        set score(e) {
-          this._score = H(e);
-        }
-      }
-      var ve = (r, e) => {
-        const n = new fe();
-        return n.target = r, n.obj = e.obj ?? b, n._score = e._score ?? I, n._indexes = e._indexes ?? [], n._targetLower = e._targetLower ?? "", n._targetLowerCodes = e._targetLowerCodes ?? b, n._nextBeginningIndexes = e._nextBeginningIndexes ?? b, n._bitflags = e._bitflags ?? 0, n;
-      }, oe = (r) => r === I ? 0 : r > 1 ? r : Math.E ** (((-r + 1) ** 0.04307 - 1) * -2), H = (r) => r === 0 ? I : r > 1 ? r : 1 - Math.pow(Math.log(r) / -2 + 1, 1 / 0.04307), le = (r) => {
-        typeof r == "number" ? r = "" + r : typeof r != "string" && (r = ""), r = r.trim();
-        var e = R(r), n = [];
-        if (e.containsSpace) {
-          var t = r.split(/\s+/);
-          t = [...new Set(t)];
-          for (var f = 0; f < t.length; f++)
-            if (t[f] !== "") {
-              var i = R(t[f]);
-              n.push({ lowerCodes: i.lowerCodes, _lower: t[f].toLowerCase(), containsSpace: !1 });
-            }
-        }
-        return { lowerCodes: e.lowerCodes, _lower: e._lower, containsSpace: e.containsSpace, bitflags: e.bitflags, spaceSearches: n };
-      }, P = (r) => {
-        if (r.length > 999) return F(r);
-        var e = j.get(r);
-        return e !== void 0 || (e = F(r), j.set(r, e)), e;
-      }, ue = (r) => {
-        if (r.length > 999) return le(r);
-        var e = ee.get(r);
-        return e !== void 0 || (e = le(r), ee.set(r, e)), e;
-      }, de = (r, e) => {
-        var n = [];
-        n.total = r.length;
-        var t = e?.limit || ne;
-        if (e?.key)
-          for (var f = 0; f < r.length; f++) {
-            var i = r[f], a = W(i, e.key);
-            if (a != b) {
-              G(a) || (a = P(a));
-              var v = ve(a.target, { _score: a._score, obj: i });
-              if (n.push(v), n.length >= t) return n;
-            }
-          }
-        else if (e?.keys)
-          for (var f = 0; f < r.length; f++) {
-            for (var i = r[f], s = new se(e.keys.length), c = e.keys.length - 1; c >= 0; --c) {
-              var a = W(i, e.keys[c]);
-              if (!a) {
-                s[c] = D;
-                continue;
-              }
-              G(a) || (a = P(a)), a._score = I, a._indexes.len = 0, s[c] = a;
-            }
-            if (s.obj = i, s._score = I, n.push(s), n.length >= t) return n;
-          }
-        else
-          for (var f = 0; f < r.length; f++) {
-            var a = r[f];
-            if (a != b && (G(a) || (a = P(a)), a._score = I, a._indexes.len = 0, n.push(a), n.length >= t))
-              return n;
-          }
-        return n;
-      }, Y = (r, e, n = !1, t = !1) => {
-        if (n === !1 && r.containsSpace) return xe(r, e, t);
-        for (var f = r._lower, i = r.lowerCodes, a = i[0], v = e._targetLowerCodes, s = i.length, c = v.length, _ = 0, l = 0, m = 0; ; ) {
-          var p = a === v[l];
-          if (p) {
-            if (k[m++] = l, ++_, _ === s) break;
-            a = i[_];
-          }
-          if (++l, l >= c) return b;
-        }
-        var _ = 0, y = !1, g = 0, d = e._nextBeginningIndexes;
-        d === b && (d = e._nextBeginningIndexes = be(e.target)), l = k[0] === 0 ? 0 : d[k[0] - 1];
-        var E = 0;
-        if (l !== c) for (; ; )
-          if (l >= c) {
-            if (_ <= 0 || (++E, E > 200)) break;
-            --_;
-            var B = J[--g];
-            l = d[B];
-          } else {
-            var p = i[_] === v[l];
-            if (p) {
-              if (J[g++] = l, ++_, _ === s) {
-                y = !0;
-                break;
-              }
-              ++l;
-            } else
-              l = d[l];
-          }
-        var L = s <= 1 ? -1 : e._targetLower.indexOf(f, k[0]), u = !!~L, S = u ? L === 0 || e._nextBeginningIndexes[L - 1] === L : !1;
-        if (u && !S) {
-          for (var o = 0; o < d.length; o = d[o])
-            if (!(o <= L)) {
-              for (var z = 0; z < s && i[z] === e._targetLowerCodes[o + z]; z++) ;
-              if (z === s) {
-                L = o, S = !0;
-                break;
-              }
-            }
-        }
-        var w = (h) => {
-          for (var x = 0, ce = 0, N = 1; N < s; ++N)
-            h[N] - h[N - 1] !== 1 && (x -= h[N], ++ce);
-          var pe = h[s - 1] - h[0] - (s - 1);
-          if (x -= (12 + pe) * ce, h[0] !== 0 && (x -= h[0] * h[0] * 0.2), !y)
-            x *= 1e3;
-          else {
-            for (var ie = 1, N = d[0]; N < c; N = d[N]) ++ie;
-            ie > 24 && (x *= (ie - 24) * 10);
-          }
-          return x -= (c - s) / 2, u && (x /= 1 + s * s * 1), S && (x /= 1 + s * s * 1), x -= (c - s) / 2, x;
-        };
-        if (y)
-          if (S) {
-            for (var o = 0; o < s; ++o) k[o] = L + o;
-            var O = k, V = w(k);
-          } else
-            var O = J, V = w(J);
-        else {
-          if (u) for (var o = 0; o < s; ++o) k[o] = L + o;
-          var O = k, V = w(O);
-        }
-        e._score = V;
-        for (var o = 0; o < s; ++o) e._indexes[o] = O[o];
-        e._indexes.len = s;
-        const Z = new fe();
-        return Z.target = e.target, Z._score = e._score, Z._indexes = e._indexes, Z;
-      }, xe = (r, e, n) => {
-        for (var t = /* @__PURE__ */ new Set(), f = 0, i = b, a = 0, v = r.spaceSearches, s = v.length, c = 0, l = () => {
-          for (let S = c - 1; S >= 0; S--) e._nextBeginningIndexes[Q[S * 2 + 0]] = Q[S * 2 + 1];
-        }, m = !1, u = 0; u < s; ++u) {
-          q[u] = I;
-          var p = v[u];
-          if (i = Y(p, e), n) {
-            if (i === b) continue;
-            m = !0;
-          } else if (i === b)
-            return l(), b;
-          var _ = u === s - 1;
-          if (!_) {
-            var y = i._indexes, g = !0;
-            for (let o = 0; o < y.len - 1; o++)
-              if (y[o + 1] - y[o] !== 1) {
-                g = !1;
-                break;
-              }
-            if (g) {
-              var d = y[y.len - 1] + 1, E = e._nextBeginningIndexes[d - 1];
-              for (let o = d - 1; o >= 0 && E === e._nextBeginningIndexes[o]; o--)
-                e._nextBeginningIndexes[o] = d, Q[c * 2 + 0] = o, Q[c * 2 + 1] = E, c++;
-            }
-          }
-          f += i._score / s, q[u] = i._score / s, i._indexes[0] < a && (f -= (a - i._indexes[0]) * 2), a = i._indexes[0];
-          for (var B = 0; B < i._indexes.len; ++B) t.add(i._indexes[B]);
-        }
-        if (n && !m) return b;
-        l();
-        var L = Y(
-          r,
-          e,
-          /*allowSpaces=*/
-          !0
-        );
-        if (L !== b && L._score > f) {
-          if (n)
-            for (var u = 0; u < s; ++u)
-              q[u] = L._score / s;
-          return L;
-        }
-        n && (i = e), i._score = f;
-        var u = 0;
-        for (let S of t) i._indexes[u++] = S;
-        return i._indexes.len = u, i;
-      }, R = (r) => {
-        for (var e = r.length, n = r.toLowerCase(), t = [], f = 0, i = !1, a = 0; a < e; ++a) {
-          var v = t[a] = n.charCodeAt(a);
-          if (v === 32) {
-            i = !0;
-            continue;
-          }
-          var s = v >= 97 && v <= 122 ? v - 97 : v >= 48 && v <= 57 ? 26 : v <= 127 ? 30 : 31;
-          f |= 1 << s;
-        }
-        return { lowerCodes: t, bitflags: f, containsSpace: i, _lower: n };
-      }, we = (r) => {
-        for (var e = r.length, n = [], t = 0, f = !1, i = !1, a = 0; a < e; ++a) {
-          var v = r.charCodeAt(a), s = v >= 65 && v <= 90, c = s || v >= 97 && v <= 122 || v >= 48 && v <= 57, l = s && !f || !i || !c;
-          f = s, i = c, l && (n[t++] = a);
-        }
-        return n;
-      }, be = (r) => {
-        for (var e = r.length, n = we(r), t = [], f = n[0], i = 0, a = 0; a < e; ++a)
-          f > a ? t[a] = f : (f = n[++i], t[a] = f === void 0 ? e : f);
-        return t;
-      }, j = /* @__PURE__ */ new Map(), ee = /* @__PURE__ */ new Map(), k = [], J = [], Q = [], A = [], q = [], re = [], $ = [], W = (r, e) => {
-        var n = r[e];
-        if (n !== void 0) return n;
-        if (typeof e == "function") return e(r);
-        var t = e;
-        Array.isArray(e) || (t = e.split("."));
-        for (var f = t.length, i = -1; r && ++i < f; ) r = r[t[i]];
-        return r;
-      }, G = (r) => typeof r == "object" && typeof r._bitflags == "number", ne = 1 / 0, I = -ne, ae = [];
-      ae.total = 0;
-      var b = null, D = F(""), Se = (r) => {
-        var e = [], n = 0, t = {}, f = (i) => {
-          for (var a = 0, v = e[a], s = 1; s < n; ) {
-            var c = s + 1;
-            a = s, c < n && e[c]._score < e[s]._score && (a = c), e[a - 1 >> 1] = e[a], s = 1 + (a << 1);
-          }
-          for (var l = a - 1 >> 1; a > 0 && v._score < e[l]._score; l = (a = l) - 1 >> 1) e[a] = e[l];
-          e[a] = v;
-        };
-        return t.add = (i) => {
-          var a = n;
-          e[n++] = i;
-          for (var v = a - 1 >> 1; a > 0 && i._score < e[v]._score; v = (a = v) - 1 >> 1) e[a] = e[v];
-          e[a] = i;
-        }, t.poll = (i) => {
-          if (n !== 0) {
-            var a = e[0];
-            return e[0] = e[--n], f(), a;
-          }
-        }, t.peek = (i) => {
-          if (n !== 0) return e[0];
-        }, t.replaceTop = (i) => {
-          e[0] = i, f();
-        }, t;
-      }, X = Se();
-      return { single: M, go: te, prepare: F, cleanup: he };
-    });
-  }(U)), U.exports;
-}
-var ke = Ce();
-const ge = /* @__PURE__ */ Le(ke);
-function Ee(C, T, M) {
-  const K = me(C).replace(/[^\w\s]/gi, "").toLowerCase();
-  return Ie(T) ? ge.go(K, T, { all: !0, threshold: -1e5 }).map((F) => F.target) : ze(T) && M?.fieldNames?.length ? ge.go(K, T, { all: !0, threshold: -1e5, keys: M?.fieldNames }).map((F) => F.obj) : T;
-}
-export {
-  ze as i,
-  Ee as s
-};
-//# sourceMappingURL=searchFuzzy-DBDE6jkd.js.map