@leaflink/stash 50.12.0 → 50.12.2

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@leaflink/stash",
-  "version": "50.12.0",
+  "version": "50.12.2",
   "description": "LeafLink's design system.",
   "homepage": "https://stash.leaflink.com",
   "main": "./dist/index.ts",
@@ -103,34 +103,34 @@
     "@vueuse/core": "^11.2.0",
     "date-fns": "3.6.0",
     "date-fns-tz": "3.1.3",
-    "dompurify": "3.1.6",
+    "dompurify": "3.2.4",
     "flat": "6.0.1",
     "fuzzysort": "3.0.2",
     "sanitize-html": "2.13.0",
     "v-calendar": "3.1.2",
-    "vue": "3.5.12",
+    "vue": "3.5.13",
     "vue-currency-input": "3.1.0",
     "vue-inline-svg": "3.1.4",
     "vue3-carousel": "0.3.4",
     "vue3-touch-events": "4.2.0"
   },
   "devDependencies": {
-    "@babel/core": "^7.25.2",
-    "@babel/preset-env": "^7.25.4",
-    "@babel/preset-typescript": "^7.24.7",
+    "@babel/core": "7.26.10",
+    "@babel/preset-env": "7.26.9",
+    "@babel/preset-typescript": "7.26.0",
     "@leaflink/eslint-config": "^4.1.0",
     "@rollup/pluginutils": "^5.1.1",
     "@testing-library/jest-dom": "^6.6.3",
     "@testing-library/user-event": "^14.5.2",
     "@testing-library/vue": "^8.1.0",
-    "@types/dompurify": "^3.0.5",
+    "@types/dompurify": "3.2.0",
     "@types/google.maps": "^3.58.1",
     "@types/lodash-es": "^4.17.12",
     "@types/plaid-link": "^2.0.15",
-    "@vitejs/plugin-vue": "^5.1.4",
-    "@vitejs/plugin-vue-jsx": "^4.0.1",
-    "@vitest/coverage-v8": "2.1.3",
-    "@vue/babel-plugin-jsx": "^1.2.5",
+    "@vitejs/plugin-vue": "5.2.1",
+    "@vitejs/plugin-vue-jsx": "4.1.1",
+    "@vitest/coverage-v8": "3.0.8",
+    "@vue/babel-plugin-jsx": "1.4.0",
     "@vue/test-utils": "^2.4.6",
     "autoprefixer": "^10.4.20",
     "doctoc": "^2.2.1",
@@ -151,14 +151,14 @@
     "svg-sprite": "^2.0.4",
     "tailwindcss": "^3.4.13",
     "typescript": "5.4.2",
-    "vite": "5.4.10",
+    "vite": "6.2.2",
     "vite-plugin-dts": "3.9.1",
     "vite-svg-loader": "^5.1.0",
-    "vitepress": "^1.3.4",
-    "vitest": "2.1.3",
-    "vue-component-meta": "^2.1.10",
+    "vitepress": "1.6.3",
+    "vitest": "3.0.8",
+    "vue-component-meta": "2.2.8",
     "vue-eslint-parser": "^9.4.3",
-    "vue-tsc": "2.1.10"
+    "vue-tsc": "2.2.8"
   },
   "peerDependencies": {
     "lodash-es": "^4.x.x",

package/dist/searchFuzzy-DKooyZM8.js

@@ -1,407 +0,0 @@
-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";
-function Be(A) {
-  return Array.isArray(A) && typeof A[0] == "string";
-}
-function Ce(A) {
-  return Array.isArray(A) && ye(A[0]);
-}
-var he = { exports: {} };
-(function(A) {
-  ((E, z) => {
-    A.exports ? A.exports = z() : E.fuzzysort = z();
-  })(Le, (E) => {
-    var z = (r, e) => {
-      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;
-      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));
-      }
-      if (a != null && a.key)
-        for (var L = a.key, g = 0; g < c; ++g) {
-          var y = e[g], h = Z(y, L);
-          if (h && (Y(h) || (h = G(h)), (v & h._bitflags) === v)) {
-            var d = K(i, h);
-            d !== b && (d._score < n || (d.obj = y, I(d)));
-          }
-        }
-      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;
-              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 (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);
-            }
-          }
-          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];
-          if (h && (Y(h) || (h = G(h)), (v & h._bitflags) === v)) {
-            var d = K(i, h);
-            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();
-      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) {
-        var g = v[L];
-        if (n[_] === L) {
-          if (++_, c || (c = !0, i ? (I.push(s), s = "") : s += e), _ === n.length) {
-            i ? (s += g, I.push(i(s, t++)), s = "", I.push(v.substr(L + 1))) : s += g + a + v.substr(L + 1);
-            break;
-          }
-        } else
-          c && (c = !1, i ? (I.push(i(s, t++)), s = "") : s += a);
-        s += g;
-      }
-      return i ? I : s;
-    }, P = (r) => {
-      typeof r == "number" ? r = "" + r : typeof r != "string" && (r = "");
-      var e = R(r);
-      return se(r, { _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _bitflags: e.bitflags });
-    }, q = () => {
-      p.clear(), ee.clear();
-    };
-    class ve {
-      get indexes() {
-        return this._indexes.slice(0, this._indexes.len).sort((e, a) => e - a);
-      }
-      set indexes(e) {
-        return this._indexes = e;
-      }
-      highlight(e, a) {
-        return J(this, e, a);
-      }
-      get score() {
-        return le(this._score);
-      }
-      set score(e) {
-        this._score = Q(e);
-      }
-    }
-    class te extends Array {
-      get score() {
-        return le(this._score);
-      }
-      set score(e) {
-        this._score = Q(e);
-      }
-    }
-    var se = (r, e) => {
-      const a = new ve();
-      return a.target = r, a.obj = e.obj ?? b, a._score = e._score ?? B, a._indexes = e._indexes ?? [], a._targetLower = e._targetLower ?? "", a._targetLowerCodes = e._targetLowerCodes ?? b, a._nextBeginningIndexes = e._nextBeginningIndexes ?? b, a._bitflags = e._bitflags ?? 0, a;
-    }, le = (r) => r === B ? 0 : r > 1 ? r : Math.E ** (((-r + 1) ** 0.04307 - 1) * -2), Q = (r) => r === 0 ? B : r > 1 ? r : 1 - Math.pow(Math.log(r) / -2 + 1, 1 / 0.04307), ce = (r) => {
-      typeof r == "number" ? r = "" + r : typeof r != "string" && (r = ""), r = r.trim();
-      var e = R(r), a = [];
-      if (e.containsSpace) {
-        var i = r.split(/\s+/);
-        i = [...new Set(i)];
-        for (var v = 0; v < i.length; v++)
-          if (i[v] !== "") {
-            var f = R(i[v]);
-            a.push({ lowerCodes: f.lowerCodes, _lower: i[v].toLowerCase(), containsSpace: !1 });
-          }
-      }
-      return { lowerCodes: e.lowerCodes, _lower: e._lower, containsSpace: e.containsSpace, bitflags: e.bitflags, spaceSearches: a };
-    }, G = (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);
-      var e = ee.get(r);
-      return e !== void 0 || (e = ce(r), ee.set(r, e)), e;
-    }, oe = (r, e) => {
-      var a = [];
-      a.total = r.length;
-      var i = (e == null ? void 0 : e.limit) || ae;
-      if (e != null && e.key)
-        for (var v = 0; v < r.length; v++) {
-          var f = r[v], n = Z(f, e.key);
-          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;
-          }
-        }
-      else if (e != null && e.keys)
-        for (var v = 0; v < r.length; v++) {
-          for (var f = r[v], t = new te(e.keys.length), _ = e.keys.length - 1; _ >= 0; --_) {
-            var n = Z(f, e.keys[_]);
-            if (!n) {
-              t[_] = H;
-              continue;
-            }
-            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;
-        }
-      else
-        for (var v = 0; v < r.length; v++) {
-          var n = r[v];
-          if (n != b && (Y(n) || (n = G(n)), n._score = B, n._indexes.len = 0, a.push(n), a.length >= i))
-            return a;
-        }
-      return a;
-    }, K = (r, e, a = !1, i = !1) => {
-      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;
-          n = f[g];
-        }
-        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)) 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];
-        }
-      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++) ;
-            if (C === t) {
-              m = l, S = !0;
-              break;
-            }
-          }
-      }
-      var w = (o) => {
-        for (var x = 0, _e = 0, F = 1; F < t; ++F)
-          o[F] - o[F - 1] !== 1 && (x -= o[F], ++_e);
-        var Se = o[t - 1] - o[0] - (t - 1);
-        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;
-          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;
-          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;
-        var M = N, D = w(M);
-      }
-      e._score = D;
-      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];
-      }, I = !1, u = 0; u < t; ++u) {
-        V[u] = B;
-        var L = s[u];
-        if (f = K(L, e), a) {
-          if (f === b) continue;
-          I = !0;
-        } else if (f === b)
-          return c(), b;
-        var g = u === t - 1;
-        if (!g) {
-          var y = f._indexes, h = !0;
-          for (let l = 0; l < y.len - 1; l++)
-            if (y[l + 1] - y[l] !== 1) {
-              h = !1;
-              break;
-            }
-          if (h) {
-            var d = y[y.len - 1] + 1, O = e._nextBeginningIndexes[d - 1];
-            for (let l = d - 1; l >= 0 && O === e._nextBeginningIndexes[l]; l--)
-              e._nextBeginningIndexes[l] = d, X[_ * 2 + 0] = l, X[_ * 2 + 1] = O, _++;
-          }
-        }
-        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]);
-      }
-      if (a && !I) return b;
-      c();
-      var m = K(
-        r,
-        e,
-        /*allowSpaces=*/
-        !0
-      );
-      if (m !== b && m._score > v) {
-        if (a)
-          for (var u = 0; u < t; ++u)
-            V[u] = m._score / t;
-        return m;
-      }
-      a && (f = e), f._score = v;
-      var u = 0;
-      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) {
-        var s = i[n] = a.charCodeAt(n);
-        if (s === 32) {
-          f = !0;
-          continue;
-        }
-        var t = s >= 97 && s <= 122 ? s - 97 : s >= 48 && s <= 57 ? 26 : s <= 127 ? 30 : 31;
-        v |= 1 << t;
-      }
-      return { lowerCodes: i, bitflags: v, containsSpace: f, _lower: a };
-    }, xe = (r) => {
-      for (var e = r.length, a = [], i = 0, v = !1, f = !1, n = 0; n < e; ++n) {
-        var s = r.charCodeAt(n), t = s >= 65 && s <= 90, _ = t || s >= 97 && s <= 122 || s >= 48 && s <= 57, c = t && !v || !f || !_;
-        v = t, f = _, c && (a[i++] = n);
-      }
-      return a;
-    }, we = (r) => {
-      for (var e = r.length, a = xe(r), i = [], v = a[0], f = 0, n = 0; n < e; ++n)
-        v > n ? i[n] = v : (v = a[++f], i[n] = v === void 0 ? e : v);
-      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);
-      var i = e;
-      Array.isArray(e) || (i = e.split("."));
-      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;
-    var b = null, H = P(""), be = (r) => {
-      var e = [], a = 0, i = {}, v = (f) => {
-        for (var n = 0, s = e[n], t = 1; t < a; ) {
-          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];
-        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];
-        e[n] = f;
-      }, i.poll = (f) => {
-        if (a !== 0) {
-          var n = e[0];
-          return e[0] = e[--a], v(), n;
-        }
-      }, i.peek = (f) => {
-        if (a !== 0) return e[0];
-      }, i.replaceTop = (f) => {
-        e[0] = f, v();
-      }, i;
-    }, U = be();
-    return { single: z, go: ie, prepare: P, cleanup: q };
-  });
-})(he);
-var ke = he.exports;
-const ge = /* @__PURE__ */ me(ke);
-function Fe(A, E, z) {
-  var P;
-  const J = Ie(A).replace(/[^\w\s]/gi, "").toLowerCase();
-  return Be(E) ? ge.go(J, E, { all: !0, threshold: -1e5 }).map((q) => q.target) : Ce(E) && ((P = z == null ? void 0 : z.fieldNames) != null && P.length) ? ge.go(J, E, { all: !0, threshold: -1e5, keys: z == null ? void 0 : z.fieldNames }).map((q) => q.obj) : E;
-}
-export {
-  Ce as i,
-  Fe as s
-};
-//# sourceMappingURL=searchFuzzy-DKooyZM8.js.map