@synnaxlabs/pluto 0.37.0 → 0.38.1

package/dist/{external-vYsKqfFS.js → external-DNjLBxYA.js}

@@ -1,10 +1,10 @@
-import { a7 as fe, aK as Le, aC as ke, aj as ve, aL as Te, ac as Ce, aM as Ne, ai as $e, aN as Fe, ad as je, aO as De, ae as Ke, aP as Ye, aQ as We, aR as ze, aS as He, aT as Ve, al as Ue, aU as Be, aV as Ge, a6 as Qe, aW as Xe, aX as Je, aY as Ze } from "./Toggle-DlYB4nmh.js";
-import { j as qe } from "./jsx-runtime-Dx-03ztt.js";
+import { a7 as fe, aH as ke, aA as Le, aj as Te, aI as Ce, ac as $e, aJ as ve, ai as Fe, aK as Ne, ad as je, aL as Ke, ae as De, aM as We, aN as Ye, aO as ze, aP as He, aQ as Ve, al as Ue, aR as Be, aS as Ge, a6 as Je, aT as Qe, aU as Xe, aV as Ze } from "./Toggle-DvdBHJvZ.js";
+import { j as qe } from "./jsx-runtime-Bdg6XQ1m.js";
 import { useCallback as et } from "react";
-import { x as tt, v as st } from "./aggregator-CWsCIyed.js";
-import "./css-Csw1Dn4s.js";
-import "./Pack-DNCFnyuR.js";
-const de = Symbol(), q = Symbol(), v = "a", $ = "w";
+import { x as tt, v as st } from "./aggregator-Bl15iClv.js";
+import "./css-Bbri4zkj.js";
+import "./Pack-Di5J8hmU.js";
+const de = Symbol(), q = Symbol(), T = "a", F = "w";
 let rt = (t, e) => new Proxy(t, e);
 const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) => t && (ne.has(t) ? ne.get(t) : H(t) === Object.prototype || H(t) === Array.prototype), ie = (t) => typeof t == "object" && t !== null, ce = /* @__PURE__ */ new WeakMap(), ge = (t) => t[q] || t, pe = (t, e, s) => {
   if (!ee(t)) return t;
@@ -15,14 +15,14 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
     let h = !1;
     const l = (f, g) => {
       if (!h) {
-        let p = a[v].get(c);
-        if (p || (p = {}, a[v].set(c, p)), f === $) p[$] = !0;
+        let p = a[T].get(c);
+        if (p || (p = {}, a[T].set(c, p)), f === F) p[F] = !0;
         else {
           let m = p[f];
           m || (m = /* @__PURE__ */ new Set(), p[f] = m), m.add(g);
         }
       }
-    }, u = { get: (f, g) => g === q ? c : (l("k", g), pe(Reflect.get(f, g), a[v], a.c)), has: (f, g) => g === de ? (h = !0, a[v].delete(c), !0) : (l("h", g), Reflect.has(f, g)), getOwnPropertyDescriptor: (f, g) => (l("o", g), Reflect.getOwnPropertyDescriptor(f, g)), ownKeys: (f) => (l($), Reflect.ownKeys(f)) };
+    }, u = { get: (f, g) => g === q ? c : (l("k", g), pe(Reflect.get(f, g), a[T], a.c)), has: (f, g) => g === de ? (h = !0, a[T].delete(c), !0) : (l("h", g), Reflect.has(f, g)), getOwnPropertyDescriptor: (f, g) => (l("o", g), Reflect.getOwnPropertyDescriptor(f, g)), ownKeys: (f) => (l(F), Reflect.ownKeys(f)) };
     return o && (u.set = u.deleteProperty = () => !1), [u, a];
   })(r, i), n[1].p = rt(i ? ((c) => {
     let o = ce.get(c);
@@ -37,7 +37,7 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
       ce.set(c, o);
     }
     return o;
-  })(r) : r, n[0]), s && s.set(r, n)), n[1][v] = e, n[1].c = s, n[1].p;
+  })(r) : r, n[0]), s && s.set(r, n)), n[1][T] = e, n[1].c = s, n[1].p;
 }, me = (t, e, s, r) => {
   if (Object.is(t, e)) return !1;
   if (!ie(t) || !ie(e)) return !0;
@@ -51,7 +51,7 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
   let n = null;
   try {
     for (const c of i.h || []) if (n = Reflect.has(t, c) !== Reflect.has(e, c), n) return n;
-    if (i[$] === !0) {
+    if (i[F] === !0) {
       if (n = ((c, o) => {
         const a = Reflect.ownKeys(c), h = Reflect.ownKeys(o);
         return a.length !== h.length || a.some((l, u) => l !== h[u]);
@@ -62,17 +62,17 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
   } finally {
     r && r.set(t, { n: e, g: n });
   }
-}, nt = (t) => !!ee(t) && de in t, Me = (t) => ee(t) && t[q] || null, it = "h", ct = "w", ot = "o", at = "k", V = (t) => typeof t == "object" && t !== null, ye = (t, e) => {
+}, nt = (t) => !!ee(t) && de in t, ye = (t) => ee(t) && t[q] || null, it = "h", ct = "w", ot = "o", at = "k", V = (t) => typeof t == "object" && t !== null, Me = (t, e) => {
   if (!V(t)) return t;
-  const s = Me(t);
+  const s = ye(t);
   return s !== null ? (nt(t), s) : (e.has(t) || (e.add(t), Object.entries(t).forEach(([r, i]) => {
-    const n = ye(i, e);
+    const n = Me(i, e);
     Object.is(n, i) || (t[r] = n);
   })), t);
 }, U = (t, e, s) => {
   var r, i, n;
   if (!V(t) || !V(e)) return;
-  const c = s.get(Me(e) || e);
+  const c = s.get(ye(e) || e);
   c && ((r = c[it]) == null || r.forEach((o) => {
     Reflect.has(t, o);
   }), c[ct] === !0 && Reflect.ownKeys(t), (i = c[ot]) == null || i.forEach((o) => {
@@ -80,7 +80,7 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
   }), (n = c[at]) == null || n.forEach((o) => {
     U(t[o], e[o], s);
   }));
-}, K = "o", Y = "r", W = "a";
+}, D = "o", W = "r", Y = "a";
 function lt(t, e) {
   var s;
   let r = 0;
@@ -88,19 +88,19 @@ function lt(t, e) {
   return (a) => {
     const h = c == null ? void 0 : c.get(a);
     if (h)
-      return h[Y];
+      return h[W];
     for (let p = 0; p < i; p += 1) {
       const m = n[(r + p) % i];
       if (!m) break;
-      if (!me(m[K], a, m[W], /* @__PURE__ */ new WeakMap()))
-        return U(a, m[K], m[W]), c == null || c.set(a, m), m[Y];
+      if (!me(m[D], a, m[Y], /* @__PURE__ */ new WeakMap()))
+        return U(a, m[D], m[Y]), c == null || c.set(a, m), m[W];
     }
-    const l = /* @__PURE__ */ new WeakMap(), u = pe(a, l), f = ye(t(u), /* @__PURE__ */ new Set());
+    const l = /* @__PURE__ */ new WeakMap(), u = pe(a, l), f = Me(t(u), /* @__PURE__ */ new Set());
     U(a, a, l);
     const g = {
-      [K]: a,
-      [Y]: f,
-      [W]: l
+      [D]: a,
+      [W]: f,
+      [Y]: l
     };
     return r = (r - 1 + i) % i, n[r] = g, c == null || c.set(a, g), f;
   };
@@ -109,32 +109,31 @@ const ht = (t, e) => tt.RUNTIME === "browser" ? lt(t, e) : t;
 function x(t) {
   return Array.isArray ? Array.isArray(t) : Se(t) === "[object Array]";
 }
-const ut = 1 / 0;
-function ft(t) {
+function ut(t) {
   if (typeof t == "string")
     return t;
   let e = t + "";
-  return e == "0" && 1 / t == -ut ? "-0" : e;
+  return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
 }
-function dt(t) {
-  return t == null ? "" : ft(t);
+function ft(t) {
+  return t == null ? "" : ut(t);
 }
-function _(t) {
+function E(t) {
   return typeof t == "string";
 }
-function Ee(t) {
+function _e(t) {
   return typeof t == "number";
 }
-function gt(t) {
-  return t === !0 || t === !1 || pt(t) && Se(t) == "[object Boolean]";
+function dt(t) {
+  return t === !0 || t === !1 || gt(t) && Se(t) == "[object Boolean]";
 }
-function _e(t) {
+function Ee(t) {
   return typeof t == "object";
 }
-function pt(t) {
-  return _e(t) && t !== null;
+function gt(t) {
+  return Ee(t) && t !== null;
 }
-function M(t) {
+function y(t) {
   return t != null;
 }
 function z(t) {
@@ -143,8 +142,8 @@ function z(t) {
 function Se(t) {
   return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(t);
 }
-const mt = "Incorrect 'index' type", Mt = (t) => `Invalid value for key ${t}`, yt = (t) => `Pattern length exceeds max of ${t}.`, Et = (t) => `Missing ${t} property in key`, _t = (t) => `Property 'weight' in key '${t}' must be a positive integer`, oe = Object.prototype.hasOwnProperty;
-class St {
+const pt = "Incorrect 'index' type", mt = (t) => `Invalid value for key ${t}`, yt = (t) => `Pattern length exceeds max of ${t}.`, Mt = (t) => `Missing ${t} property in key`, _t = (t) => `Property 'weight' in key '${t}' must be a positive integer`, oe = Object.prototype.hasOwnProperty;
+class Et {
   constructor(e) {
     this._keys = [], this._keyMap = {};
     let s = 0;
@@ -167,11 +166,11 @@ class St {
 }
 function xe(t) {
   let e = null, s = null, r = null, i = 1, n = null;
-  if (_(t) || x(t))
+  if (E(t) || x(t))
     r = t, e = ae(t), s = B(t);
   else {
     if (!oe.call(t, "name"))
-      throw new Error(Et("name"));
+      throw new Error(Mt("name"));
     const c = t.name;
     if (r = c, oe.call(t, "weight") && (i = t.weight, i <= 0))
       throw new Error(_t(c));
@@ -185,19 +184,19 @@ function ae(t) {
 function B(t) {
   return x(t) ? t.join(".") : t;
 }
-function xt(t, e) {
+function St(t, e) {
   let s = [], r = !1;
   const i = (n, c, o) => {
-    if (M(n))
+    if (y(n))
       if (!c[o])
         s.push(n);
       else {
         let a = c[o];
         const h = n[a];
-        if (!M(h))
+        if (!y(h))
           return;
-        if (o === c.length - 1 && (_(h) || Ee(h) || gt(h)))
-          s.push(dt(h));
+        if (o === c.length - 1 && (E(h) || _e(h) || dt(h)))
+          s.push(ft(h));
         else if (x(h)) {
           r = !0;
           for (let l = 0, u = h.length; l < u; l += 1)
@@ -205,9 +204,9 @@ function xt(t, e) {
         } else c.length && i(h, c, o + 1);
       }
   };
-  return i(t, _(e) ? e.split(".") : e, 0), r ? s : s[0];
+  return i(t, E(e) ? e.split(".") : e, 0), r ? s : s[0];
 }
-const Rt = {
+const xt = {
   // Whether the matches should be included in the result set. When `true`, each record in the result
   // set will include the indices of the matched characters.
   // These can consequently be used for highlighting purposes.
@@ -217,7 +216,7 @@ const Rt = {
   findAllMatches: !1,
   // Minimum number of characters that must be matched before a result is considered a match
   minMatchCharLength: 1
-}, Ot = {
+}, Rt = {
   // When `true`, the algorithm continues searching to the end of the input even if a perfect
   // match is found before the end of the same input.
   isCaseSensitive: !1,
@@ -229,7 +228,7 @@ const Rt = {
   shouldSort: !0,
   // Default sort function: sort by ascending score, ascending index
   sortFn: (t, e) => t.score === e.score ? t.idx < e.idx ? -1 : 1 : t.score < e.score ? -1 : 1
-}, wt = {
+}, Ot = {
   // Approximately where in the text is the pattern expected to be found?
   location: 0,
   // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match
@@ -241,12 +240,12 @@ const Rt = {
   // the exact location specified, a threshold of '1000' would require a perfect match
   // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.
   distance: 100
-}, It = {
+}, wt = {
   // When `true`, it enables the use of unix-like search commands
   useExtendedSearch: !1,
   // The get function to use when fetching an object's properties.
   // The default will search nested paths *ie foo.bar.baz*
-  getFn: xt,
+  getFn: St,
   // When `true`, search will ignore `location` and `distance`, so it won't matter
   // where in the string the pattern appears.
   // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score
@@ -259,17 +258,17 @@ const Rt = {
   fieldNormWeight: 1
 };
 var d = {
-  ...Ot,
   ...Rt,
-  ...wt,
-  ...It
+  ...xt,
+  ...Ot,
+  ...wt
 };
-const At = /[^ ]+/g;
+const It = /[^ ]+/g;
 function bt(t = 1, e = 3) {
   const s = /* @__PURE__ */ new Map(), r = Math.pow(10, e);
   return {
     get(i) {
-      const n = i.match(At).length;
+      const n = i.match(It).length;
       if (s.has(n))
         return s.get(n);
       const c = 1 / Math.pow(n, 0.5 * t), o = parseFloat(Math.round(c * r) / r);
@@ -299,7 +298,7 @@ class te {
     });
   }
   create() {
-    this.isCreated || !this.docs.length || (this.isCreated = !0, _(this.docs[0]) ? this.docs.forEach((e, s) => {
+    this.isCreated || !this.docs.length || (this.isCreated = !0, E(this.docs[0]) ? this.docs.forEach((e, s) => {
       this._addString(e, s);
     }) : this.docs.forEach((e, s) => {
       this._addObject(e, s);
@@ -308,7 +307,7 @@ class te {
   // Adds a doc to the end of the index
   add(e) {
     const s = this.size();
-    _(e) ? this._addString(e, s) : this._addObject(e, s);
+    E(e) ? this._addString(e, s) : this._addObject(e, s);
   }
   // Removes the doc at the specified index of the index
   removeAt(e) {
@@ -323,7 +322,7 @@ class te {
     return this.records.length;
   }
   _addString(e, s) {
-    if (!M(e) || z(e))
+    if (!y(e) || z(e))
       return;
     let r = {
       v: e,
@@ -336,14 +335,14 @@ class te {
     let r = { i: s, $: {} };
     this.keys.forEach((i, n) => {
       let c = i.getFn ? i.getFn(e) : this.getFn(e, i.path);
-      if (M(c)) {
+      if (y(c)) {
         if (x(c)) {
           let o = [];
           const a = [{ nestedArrIndex: -1, value: c }];
           for (; a.length; ) {
             const { nestedArrIndex: h, value: l } = a.pop();
-            if (M(l))
-              if (_(l) && !z(l)) {
+            if (y(l))
+              if (E(l) && !z(l)) {
                 let u = {
                   v: l,
                   i: h,
@@ -358,7 +357,7 @@ class te {
               });
           }
           r.$[n] = o;
-        } else if (_(c) && !z(c)) {
+        } else if (E(c) && !z(c)) {
           let o = {
             v: c,
             n: this.norm.get(c)
@@ -379,11 +378,11 @@ function Re(t, e, { getFn: s = d.getFn, fieldNormWeight: r = d.fieldNormWeight }
   const i = new te({ getFn: s, fieldNormWeight: r });
   return i.setKeys(t.map(xe)), i.setSources(e), i.create(), i;
 }
-function Pt(t, { getFn: e = d.getFn, fieldNormWeight: s = d.fieldNormWeight } = {}) {
+function At(t, { getFn: e = d.getFn, fieldNormWeight: s = d.fieldNormWeight } = {}) {
   const { keys: r, records: i } = t, n = new te({ getFn: e, fieldNormWeight: s });
   return n.setKeys(r), n.setIndexRecords(i), n;
 }
-function N(t, {
+function v(t, {
   errors: e = 0,
   currentLocation: s = 0,
   expectedLocation: r = 0,
@@ -396,7 +395,7 @@ function N(t, {
   const o = Math.abs(r - s);
   return i ? c + o / i : o ? 1 : c;
 }
-function Lt(t = [], e = d.minMatchCharLength) {
+function Pt(t = [], e = d.minMatchCharLength) {
   let s = [], r = -1, i = -1, n = 0;
   for (let c = t.length; n < c; n += 1) {
     let o = t[n];
@@ -404,7 +403,7 @@ function Lt(t = [], e = d.minMatchCharLength) {
   }
   return t[n - 1] && n - r >= e && s.push([r, n - 1]), s;
 }
-const b = 32;
+const A = 32;
 function kt(t, e, s, {
   location: r = d.location,
   distance: i = d.distance,
@@ -414,77 +413,77 @@ function kt(t, e, s, {
   includeMatches: a = d.includeMatches,
   ignoreLocation: h = d.ignoreLocation
 } = {}) {
-  if (e.length > b)
-    throw new Error(yt(b));
+  if (e.length > A)
+    throw new Error(yt(A));
   const l = e.length, u = t.length, f = Math.max(0, Math.min(r, u));
   let g = n, p = f;
   const m = o > 1 || a, I = m ? Array(u) : [];
   let S;
   for (; (S = t.indexOf(e, p)) > -1; ) {
-    let y = N(e, {
+    let M = v(e, {
       currentLocation: S,
       expectedLocation: f,
       distance: i,
       ignoreLocation: h
     });
-    if (g = Math.min(y, g), p = S + l, m) {
+    if (g = Math.min(M, g), p = S + l, m) {
       let R = 0;
       for (; R < l; )
         I[S + R] = 1, R += 1;
     }
   }
   p = -1;
-  let P = [], A = 1, T = l + u;
+  let P = [], b = 1, C = l + u;
   const Pe = 1 << l - 1;
-  for (let y = 0; y < l; y += 1) {
-    let R = 0, O = T;
+  for (let M = 0; M < l; M += 1) {
+    let R = 0, O = C;
     for (; R < O; )
-      N(e, {
-        errors: y,
+      v(e, {
+        errors: M,
         currentLocation: f + O,
         expectedLocation: f,
         distance: i,
         ignoreLocation: h
-      }) <= g ? R = O : T = O, O = Math.floor((T - R) / 2 + R);
-    T = O;
-    let se = Math.max(1, f - O + 1), D = c ? u : Math.min(f + O, u) + l, L = Array(D + 2);
-    L[D + 1] = (1 << y) - 1;
-    for (let E = D; E >= se; E -= 1) {
-      let C = E - 1, re = s[t.charAt(C)];
-      if (m && (I[C] = +!!re), L[E] = (L[E + 1] << 1 | 1) & re, y && (L[E] |= (P[E + 1] | P[E]) << 1 | 1 | P[E + 1]), L[E] & Pe && (A = N(e, {
-        errors: y,
-        currentLocation: C,
+      }) <= g ? R = O : C = O, O = Math.floor((C - R) / 2 + R);
+    C = O;
+    let se = Math.max(1, f - O + 1), K = c ? u : Math.min(f + O, u) + l, k = Array(K + 2);
+    k[K + 1] = (1 << M) - 1;
+    for (let _ = K; _ >= se; _ -= 1) {
+      let $ = _ - 1, re = s[t.charAt($)];
+      if (m && (I[$] = +!!re), k[_] = (k[_ + 1] << 1 | 1) & re, M && (k[_] |= (P[_ + 1] | P[_]) << 1 | 1 | P[_ + 1]), k[_] & Pe && (b = v(e, {
+        errors: M,
+        currentLocation: $,
         expectedLocation: f,
         distance: i,
         ignoreLocation: h
-      }), A <= g)) {
-        if (g = A, p = C, p <= f)
+      }), b <= g)) {
+        if (g = b, p = $, p <= f)
           break;
         se = Math.max(1, 2 * f - p);
       }
     }
-    if (N(e, {
-      errors: y + 1,
+    if (v(e, {
+      errors: M + 1,
       currentLocation: f,
       expectedLocation: f,
       distance: i,
       ignoreLocation: h
     }) > g)
       break;
-    P = L;
+    P = k;
   }
   const j = {
     isMatch: p >= 0,
     // Count exact matches (those with a score of 0) to be "almost" exact
-    score: Math.max(1e-3, A)
+    score: Math.max(1e-3, b)
   };
   if (m) {
-    const y = Lt(I, o);
-    y.length ? a && (j.indices = y) : j.isMatch = !1;
+    const M = Pt(I, o);
+    M.length ? a && (j.indices = M) : j.isMatch = !1;
   }
   return j;
 }
-function vt(t) {
+function Lt(t) {
   let e = {};
   for (let s = 0, r = t.length; s < r; s += 1) {
     const i = t.charAt(s);
@@ -517,17 +516,17 @@ class Oe {
     const l = (f, g) => {
       this.chunks.push({
         pattern: f,
-        alphabet: vt(f),
+        alphabet: Lt(f),
         startIndex: g
       });
     }, u = this.pattern.length;
-    if (u > b) {
+    if (u > A) {
       let f = 0;
-      const g = u % b, p = u - g;
+      const g = u % A, p = u - g;
       for (; f < p; )
-        l(this.pattern.substr(f, b), f), f += b;
+        l(this.pattern.substr(f, A), f), f += A;
       if (g) {
-        const m = u - b;
+        const m = u - A;
         l(this.pattern.substr(m), m);
       }
     } else
@@ -552,7 +551,7 @@ class Oe {
     } = this.options;
     let l = [], u = 0, f = !1;
     this.chunks.forEach(({ pattern: p, alphabet: m, startIndex: I }) => {
-      const { isMatch: S, score: P, indices: A } = kt(e, p, m, {
+      const { isMatch: S, score: P, indices: b } = kt(e, p, m, {
         location: i + I,
         distance: n,
         threshold: c,
@@ -561,7 +560,7 @@ class Oe {
         includeMatches: r,
         ignoreLocation: h
       });
-      S && (f = !0), u += P, S && A && (l = [...l, ...A]);
+      S && (f = !0), u += P, S && b && (l = [...l, ...b]);
     });
     let g = {
       isMatch: f,
@@ -631,7 +630,7 @@ class Ct extends w {
     };
   }
 }
-class Nt extends w {
+class $t extends w {
   constructor(e) {
     super(e);
   }
@@ -653,7 +652,7 @@ class Nt extends w {
     };
   }
 }
-class $t extends w {
+class vt extends w {
   constructor(e) {
     super(e);
   }
@@ -697,7 +696,7 @@ class Ft extends w {
     };
   }
 }
-class jt extends w {
+class Nt extends w {
   constructor(e) {
     super(e);
   }
@@ -783,16 +782,16 @@ class Ie extends w {
 const G = [
   Tt,
   Ie,
-  Nt,
   $t,
-  jt,
+  vt,
+  Nt,
   Ft,
   Ct,
   we
-], he = G.length, Dt = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Kt = "|";
-function Yt(t, e = {}) {
+], he = G.length, jt = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Kt = "|";
+function Dt(t, e = {}) {
   return t.split(Kt).map((s) => {
-    let r = s.trim().split(Dt).filter((n) => n && !!n.trim()), i = [];
+    let r = s.trim().split(jt).filter((n) => n && !!n.trim()), i = [];
     for (let n = 0, c = r.length; n < c; n += 1) {
       const o = r[n];
       let a = !1, h = -1;
@@ -815,7 +814,7 @@ function Yt(t, e = {}) {
   });
 }
 const Wt = /* @__PURE__ */ new Set([we.type, Ie.type]);
-class zt {
+class Yt {
   constructor(e, {
     isCaseSensitive: s = d.isCaseSensitive,
     includeMatches: r = d.includeMatches,
@@ -835,7 +834,7 @@ class zt {
       location: o,
       threshold: a,
       distance: h
-    }, this.pattern = s ? e : e.toLowerCase(), this.query = Yt(this.pattern, this.options);
+    }, this.pattern = s ? e : e.toLowerCase(), this.query = Dt(this.pattern, this.options);
   }
   static condition(e, s) {
     return s.useExtendedSearch;
@@ -879,44 +878,44 @@ class zt {
     };
   }
 }
-const Q = [];
-function Ht(...t) {
-  Q.push(...t);
+const J = [];
+function zt(...t) {
+  J.push(...t);
 }
-function X(t, e) {
-  for (let s = 0, r = Q.length; s < r; s += 1) {
-    let i = Q[s];
+function Q(t, e) {
+  for (let s = 0, r = J.length; s < r; s += 1) {
+    let i = J[s];
     if (i.condition(t, e))
       return new i(t, e);
   }
   return new Oe(t, e);
 }
-const F = {
+const N = {
   AND: "$and",
   OR: "$or"
-}, J = {
+}, X = {
   PATH: "$path",
   PATTERN: "$val"
-}, Z = (t) => !!(t[F.AND] || t[F.OR]), Vt = (t) => !!t[J.PATH], Ut = (t) => !x(t) && _e(t) && !Z(t), ue = (t) => ({
-  [F.AND]: Object.keys(t).map((e) => ({
+}, Z = (t) => !!(t[N.AND] || t[N.OR]), Ht = (t) => !!t[X.PATH], Vt = (t) => !x(t) && Ee(t) && !Z(t), ue = (t) => ({
+  [N.AND]: Object.keys(t).map((e) => ({
     [e]: t[e]
   }))
 });
-function Ae(t, e, { auto: s = !0 } = {}) {
+function be(t, e, { auto: s = !0 } = {}) {
   const r = (i) => {
     let n = Object.keys(i);
-    const c = Vt(i);
+    const c = Ht(i);
     if (!c && n.length > 1 && !Z(i))
       return r(ue(i));
-    if (Ut(i)) {
-      const a = c ? i[J.PATH] : n[0], h = c ? i[J.PATTERN] : i[a];
-      if (!_(h))
-        throw new Error(Mt(a));
+    if (Vt(i)) {
+      const a = c ? i[X.PATH] : n[0], h = c ? i[X.PATTERN] : i[a];
+      if (!E(h))
+        throw new Error(mt(a));
       const l = {
         keyId: B(a),
         pattern: h
       };
-      return s && (l.searcher = X(h, e)), l;
+      return s && (l.searcher = Q(h, e)), l;
     }
     let o = {
       children: [],
@@ -931,7 +930,7 @@ function Ae(t, e, { auto: s = !0 } = {}) {
   };
   return Z(t) || (t = ue(t)), r(t);
 }
-function Bt(t, { ignoreFieldNorm: e = d.ignoreFieldNorm }) {
+function Ut(t, { ignoreFieldNorm: e = d.ignoreFieldNorm }) {
   t.forEach((s) => {
     let r = 1;
     s.matches.forEach(({ key: i, norm: n, score: c }) => {
@@ -943,10 +942,10 @@ function Bt(t, { ignoreFieldNorm: e = d.ignoreFieldNorm }) {
     }), s.score = r;
   });
 }
-function Gt(t, e) {
+function Bt(t, e) {
   const s = t.matches;
-  e.matches = [], M(s) && s.forEach((r) => {
-    if (!M(r.indices) || !r.indices.length)
+  e.matches = [], y(s) && s.forEach((r) => {
+    if (!y(r.indices) || !r.indices.length)
       return;
     const { indices: i, value: n } = r;
     let c = {
@@ -956,15 +955,15 @@ function Gt(t, e) {
     r.key && (c.key = r.key.src), r.idx > -1 && (c.refIndex = r.idx), e.matches.push(c);
   });
 }
-function Qt(t, e) {
+function Gt(t, e) {
   e.score = t.score;
 }
-function Xt(t, e, {
+function Jt(t, e, {
   includeMatches: s = d.includeMatches,
   includeScore: r = d.includeScore
 } = {}) {
   const i = [];
-  return s && i.push(Gt), r && i.push(Qt), t.map((n) => {
+  return s && i.push(Bt), r && i.push(Gt), t.map((n) => {
     const { idx: c } = n, o = {
       item: e[c],
       refIndex: c
@@ -974,20 +973,20 @@ function Xt(t, e, {
     }), o;
   });
 }
-class k {
+class L {
   constructor(e, s = {}, r) {
-    this.options = { ...d, ...s }, this.options.useExtendedSearch, this._keyStore = new St(this.options.keys), this.setCollection(e, r);
+    this.options = { ...d, ...s }, this.options.useExtendedSearch, this._keyStore = new Et(this.options.keys), this.setCollection(e, r);
   }
   setCollection(e, s) {
     if (this._docs = e, s && !(s instanceof te))
-      throw new Error(mt);
+      throw new Error(pt);
     this._myIndex = s || Re(this.options.keys, this._docs, {
       getFn: this.options.getFn,
       fieldNormWeight: this.options.fieldNormWeight
     });
   }
   add(e) {
-    M(e) && (this._docs.push(e), this._myIndex.add(e));
+    y(e) && (this._docs.push(e), this._myIndex.add(e));
   }
   remove(e = () => !1) {
     const s = [];
@@ -1011,16 +1010,16 @@ class k {
       sortFn: c,
       ignoreFieldNorm: o
     } = this.options;
-    let a = _(e) ? _(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
-    return Bt(a, { ignoreFieldNorm: o }), n && a.sort(c), Ee(s) && s > -1 && (a = a.slice(0, s)), Xt(a, this._docs, {
+    let a = E(e) ? E(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
+    return Ut(a, { ignoreFieldNorm: o }), n && a.sort(c), _e(s) && s > -1 && (a = a.slice(0, s)), Jt(a, this._docs, {
       includeMatches: r,
       includeScore: i
     });
   }
   _searchStringList(e) {
-    const s = X(e, this.options), { records: r } = this._myIndex, i = [];
+    const s = Q(e, this.options), { records: r } = this._myIndex, i = [];
     return r.forEach(({ v: n, i: c, n: o }) => {
-      if (!M(n))
+      if (!y(n))
         return;
       const { isMatch: a, score: h, indices: l } = s.searchIn(n);
       a && i.push({
@@ -1031,7 +1030,7 @@ class k {
     }), i;
   }
   _searchLogical(e) {
-    const s = Ae(e, this.options), r = (o, a, h) => {
+    const s = be(e, this.options), r = (o, a, h) => {
       if (!o.children) {
         const { keyId: u, searcher: f } = o, g = this._findMatches({
           key: this._keyStore.get(u),
@@ -1051,13 +1050,13 @@ class k {
         const g = o.children[u], p = r(g, a, h);
         if (p.length)
           l.push(...p);
-        else if (o.operator === F.AND)
+        else if (o.operator === N.AND)
           return [];
       }
       return l;
     }, i = this._myIndex.records, n = {}, c = [];
     return i.forEach(({ $: o, i: a }) => {
-      if (M(o)) {
+      if (y(o)) {
         let h = r(s, o, a);
         h.length && (n[a] || (n[a] = { idx: a, item: o, matches: [] }, c.push(n[a])), h.forEach(({ matches: l }) => {
           n[a].matches.push(...l);
@@ -1066,9 +1065,9 @@ class k {
     }), c;
   }
   _searchObjectList(e) {
-    const s = X(e, this.options), { keys: r, records: i } = this._myIndex, n = [];
+    const s = Q(e, this.options), { keys: r, records: i } = this._myIndex, n = [];
     return i.forEach(({ $: c, i: o }) => {
-      if (!M(c))
+      if (!y(c))
         return;
       let a = [];
       r.forEach((h, l) => {
@@ -1087,12 +1086,12 @@ class k {
     }), n;
   }
   _findMatches({ key: e, value: s, searcher: r }) {
-    if (!M(s))
+    if (!y(s))
       return [];
     let i = [];
     if (x(s))
       s.forEach(({ v: n, i: c, n: o }) => {
-        if (!M(n))
+        if (!y(n))
           return;
         const { isMatch: a, score: h, indices: l } = r.searchIn(n);
         a && i.push({
@@ -1111,18 +1110,18 @@ class k {
     return i;
   }
 }
-k.version = "7.0.0";
-k.createIndex = Re;
-k.parseIndex = Pt;
-k.config = d;
-k.parseQuery = Ae;
-Ht(zt);
-const Jt = {
+L.version = "7.0.0";
+L.createIndex = Re;
+L.parseIndex = At;
+L.config = d;
+L.parseQuery = be;
+zt(Yt);
+const Qt = {
   threshold: 0.3
-}, Zt = (t) => (e) => {
-  const s = new k(e, {
+}, Xt = (t) => (e) => {
+  const s = new L(e, {
     keys: Object.keys(e[0]),
-    ...Jt,
+    ...Qt,
     ...t
   });
   return {
@@ -1131,10 +1130,10 @@ const Jt = {
     search: (r) => s.search(r).map(({ item: i }) => i),
     retrieve: (r) => e.filter((i) => r.includes(i.key))
   };
-}, qt = Zt(), es = ({
+}, Zt = Xt(), qt = ({
   term: t,
-  searcher: e = qt
-}) => ht(({ data: s }) => typeof e == "function" ? t.length === 0 || (s == null ? void 0 : s.length) === 0 ? { data: s, transformed: !1 } : { data: e(s).search(t), transformed: !0 } : { data: e.search(t), transformed: !0 }), be = ({
+  searcher: e = Zt
+}) => ht(({ data: s }) => typeof e == "function" ? t.length === 0 || (s == null ? void 0 : s.length) === 0 ? { data: s, transformed: !1 } : { data: e(s).search(t), transformed: !0 } : { data: e.search(t), transformed: !0 }), Ae = ({
   debounce: t = 250,
   value: e,
   onChange: s,
@@ -1144,47 +1143,47 @@ const Jt = {
     onChange: s,
     value: e,
     initial: ""
-  }), { setTransform: c, deleteTransform: o } = fe(), a = Le(c, t, []), h = et(
+  }), { setTransform: c, deleteTransform: o } = fe(), a = ke(c, t, []), h = et(
     (l) => {
-      n(l), l.length === 0 ? o("filter") : (r != null && (l = r(l)), a("filter", es({ term: l })));
+      n(l), l.length === 0 ? o("filter") : (r != null && (l = r(l)), a("filter", qt({ term: l })));
     },
     [n, r]
   );
   return { value: i, onChange: h };
-}, ts = ({
-  children: t = (s) => /* @__PURE__ */ qe.jsx(ke, { placeholder: "Filter", ...s }),
+}, es = ({
+  children: t = (s) => /* @__PURE__ */ qe.jsx(Le, { placeholder: "Filter", ...s }),
   ...e
-}) => t(be(e)), ls = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}) => t(Ae(e)), as = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Column: ve,
-  ColumnContext: Te,
-  Core: Ce,
-  DataProvider: Ne,
-  Filter: ts,
-  Hover: $e,
-  ItemFrame: Fe,
+  Column: Te,
+  ColumnContext: Ce,
+  Core: $e,
+  DataProvider: ve,
+  Filter: es,
+  Hover: Fe,
+  ItemFrame: Ne,
   List: je,
-  Search: De,
-  Selector: Ke,
-  selectValueIsZero: Ye,
-  useDataContext: We,
+  Search: Ke,
+  Selector: De,
+  selectValueIsZero: We,
+  useDataContext: Ye,
   useDataUtilContext: fe,
-  useFilter: be,
+  useFilter: Ae,
   useGetTransformedData: ze,
   useHoverContext: He,
   useSearch: Ve,
   useSelect: Ue,
   useSelection: Be,
   useSelectionContext: Ge,
-  useSelectionUtils: Qe,
-  useSetSourceData: Xe,
-  useSourceData: Je,
+  useSelectionUtils: Je,
+  useSetSourceData: Qe,
+  useSourceData: Xe,
   useTransformedData: Ze
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  ts as F,
-  es as c,
-  ls as e,
-  Zt as f,
+  es as F,
+  qt as c,
+  as as e,
+  Xt as f,
   ht as p
 };