@synnaxlabs/pluto 0.30.0 → 0.32.0

package/dist/{external-C2rLSz0G.js → external-kSaQF2Vi.js}

@@ -1,25 +1,25 @@
-import { w as he, au as Ae, ak as Oe, K as ke, av as Le, A as Re, i as Ce, J as je, aw as ve, ax as $e, E as Ne, ay as Fe, az as Te, aA as Pe, aB as De, aC as Ke, L as We, aD as ze, aE as He, v as Ve, aF as Be, aG as Ge, aH as Ue } from "./Toggle-BGyo9v6o.js";
+import { a1 as le, au as Ae, ak as Oe, ab as ke, av as Le, a5 as Re, l as Ce, aa as je, aw as $e, ax as ve, a6 as Ne, ay as Fe, az as Te, aA as Pe, aB as De, aC as Ke, ac as We, aD as ze, aE as He, a0 as Ve, aF as Be, aG as Ge, aH as Ue } from "./Toggle-C1k6Tnpo.js";
 import { j as Ye } from "./jsx-runtime-B6kdoens.js";
-import { useCallback as Je } from "react";
-import { k as Qe, j as Xe } from "./aggregator-Dgqx_W5g.js";
-import "./css-CiSR0WsA.js";
-import "./Pack-l3j3YWpE.js";
-import { L as Ze } from "./List-DD-MkX0Z.js";
-const K = Symbol(), le = Symbol(), J = Symbol();
+import { useCallback as Qe } from "react";
+import { w as Xe, j as Je } from "./aggregator-f5OfPmNc.js";
+import "./css-B8RwzK24.js";
+import "./Pack-BrxYNh7B.js";
+import { L as Ze } from "./List-BjRQA8wb.js";
+const K = Symbol(), he = Symbol(), Q = Symbol();
 let qe = (t, e) => new Proxy(t, e);
-const W = Object.getPrototypeOf, te = /* @__PURE__ */ new WeakMap(), Q = (t) => t && (te.has(t) ? te.get(t) : W(t) === Object.prototype || W(t) === Array.prototype), se = (t) => typeof t == "object" && t !== null, re = /* @__PURE__ */ new WeakMap(), ue = (t) => t[J] || t, fe = (t, e, s) => {
-  if (!Q(t)) return t;
+const W = Object.getPrototypeOf, te = /* @__PURE__ */ new WeakMap(), X = (t) => t && (te.has(t) ? te.get(t) : W(t) === Object.prototype || W(t) === Array.prototype), se = (t) => typeof t == "object" && t !== null, re = /* @__PURE__ */ new WeakMap(), ue = (t) => t[Q] || t, fe = (t, e, s) => {
+  if (!X(t)) return t;
   const r = ue(t), n = ((c) => Object.isFrozen(c) || Object.values(Object.getOwnPropertyDescriptors(c)).some((o) => !o.writable))(r);
   let i = s && s.get(r);
   return i && i[1].f === n || (i = ((c, o) => {
     const a = { f: o };
-    let l = !1;
-    const h = (d, g) => {
-      if (!l) {
+    let h = !1;
+    const l = (d, g) => {
+      if (!h) {
         let p = a.a.get(c);
         p || (p = /* @__PURE__ */ new Set(), a.a.set(c, p)), g && p.has(K) || p.add(d);
       }
-    }, u = { get: (d, g) => g === J ? c : (h(g), fe(d[g], a.a, a.c)), has: (d, g) => g === le ? (l = !0, a.a.delete(c), !0) : (h(g), g in d), getOwnPropertyDescriptor: (d, g) => (h(g, !0), Object.getOwnPropertyDescriptor(d, g)), ownKeys: (d) => (h(K), Reflect.ownKeys(d)) };
+    }, u = { get: (d, g) => g === Q ? c : (l(g), fe(d[g], a.a, a.c)), has: (d, g) => g === he ? (h = !0, a.a.delete(c), !0) : (l(g), g in d), getOwnPropertyDescriptor: (d, g) => (l(g, !0), Object.getOwnPropertyDescriptor(d, g)), ownKeys: (d) => (l(K), Reflect.ownKeys(d)) };
     return o && (u.set = u.deleteProperty = () => !1), [u, a];
   })(r, n), i[1].p = qe(n ? ((c) => {
     let o = re.get(c);
@@ -27,8 +27,8 @@ const W = Object.getPrototypeOf, te = /* @__PURE__ */ new WeakMap(), Q = (t) =>
       if (Array.isArray(c)) o = Array.from(c);
       else {
         const a = Object.getOwnPropertyDescriptors(c);
-        Object.values(a).forEach((l) => {
-          l.configurable = !0;
+        Object.values(a).forEach((h) => {
+          h.configurable = !0;
         }), o = Object.create(W(c), a);
       }
       re.set(c, o);
@@ -54,16 +54,16 @@ const W = Object.getPrototypeOf, te = /* @__PURE__ */ new WeakMap(), Q = (t) =>
     if (o !== !0 && o !== !1 || (i = o), i) break;
   }
   return i === null && (i = !0), r && r.set(t, { n: e, g: i }), i;
-}, tt = (t) => !!Q(t) && le in t, X = (t) => Q(t) && t[J] || null, z = (t) => typeof t == "object" && t !== null, ge = (t, e) => {
+}, tt = (t) => !!X(t) && he in t, J = (t) => X(t) && t[Q] || null, z = (t) => typeof t == "object" && t !== null, ge = (t, e) => {
   if (!z(t)) return t;
-  const s = X(t);
+  const s = J(t);
   return s !== null ? (tt(t), s) : (e.has(t) || (e.add(t), Object.entries(t).forEach(([r, n]) => {
     const i = ge(n, e);
     Object.is(i, n) || (t[r] = i);
   })), t);
 }, N = (t, e, s) => {
   if (!z(t) || !z(e)) return;
-  const r = s.get(X(e) || e);
+  const r = s.get(J(e) || e);
   r && r.forEach((n) => {
     N(t[n], e[n], s);
   });
@@ -72,19 +72,19 @@ const W = Object.getPrototypeOf, te = /* @__PURE__ */ new WeakMap(), Q = (t) =>
   let r = 0;
   const n = (s = e == null ? void 0 : e.size) != null ? s : 1, i = [], c = /* @__PURE__ */ new WeakMap(), o = /* @__PURE__ */ new WeakMap();
   return (a) => {
-    const l = X(a) || a, h = c.get(l);
-    if (h) return N(a, h.o, h.a), h.r;
+    const h = J(a) || a, l = c.get(h);
+    if (l) return N(a, l.o, l.a), l.r;
     for (let m = 0; m < n; m += 1) {
       const M = i[(r + m) % n];
       if (!M) break;
-      if (!de(M.o, a, M.a, /* @__PURE__ */ new WeakMap())) return c.set(l, M), N(a, M.o, M.a), M.r;
+      if (!de(M.o, a, M.a, /* @__PURE__ */ new WeakMap())) return c.set(h, M), N(a, M.o, M.a), M.r;
     }
     const u = /* @__PURE__ */ new WeakMap(), d = fe(a, u, o), g = ge(t(d), /* @__PURE__ */ new Set());
     N(a, a, u);
     const p = { o: a, r: g, a: u };
-    return r = (r - 1 + n) % n, i[r] = p, c.set(l, p), g;
+    return r = (r - 1 + n) % n, i[r] = p, c.set(h, p), g;
   };
-}, rt = (t, e) => Qe.RUNTIME === "browser" ? st(t, e) : t;
+}, rt = (t, e) => Xe.RUNTIME === "browser" ? st(t, e) : t;
 function b(t) {
   return Array.isArray ? Array.isArray(t) : Me(t) === "[object Array]";
 }
@@ -122,7 +122,7 @@ function D(t) {
 function Me(t) {
   return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(t);
 }
-const ht = "Incorrect 'index' type", lt = (t) => `Invalid value for key ${t}`, ut = (t) => `Pattern length exceeds max of ${t}.`, ft = (t) => `Missing ${t} property in key`, dt = (t) => `Property 'weight' in key '${t}' must be a positive integer`, ne = Object.prototype.hasOwnProperty;
+const lt = "Incorrect 'index' type", ht = (t) => `Invalid value for key ${t}`, ut = (t) => `Pattern length exceeds max of ${t}.`, ft = (t) => `Missing ${t} property in key`, dt = (t) => `Property 'weight' in key '${t}' must be a positive integer`, ne = Object.prototype.hasOwnProperty;
 class gt {
   constructor(e) {
     this._keys = [], this._keyMap = {};
@@ -172,16 +172,16 @@ function pt(t, e) {
         s.push(i);
       else {
         let a = c[o];
-        const l = i[a];
-        if (!y(l))
+        const h = i[a];
+        if (!y(h))
           return;
-        if (o === c.length - 1 && (S(l) || pe(l) || ot(l)))
-          s.push(ct(l));
-        else if (b(l)) {
+        if (o === c.length - 1 && (S(h) || pe(h) || ot(h)))
+          s.push(ct(h));
+        else if (b(h)) {
           r = !0;
-          for (let h = 0, u = l.length; h < u; h += 1)
-            n(l[h], c, o + 1);
-        } else c.length && n(l, c, o + 1);
+          for (let l = 0, u = h.length; l < u; l += 1)
+            n(h[l], c, o + 1);
+        } else c.length && n(h, c, o + 1);
       }
   };
   return n(t, S(e) ? e.split(".") : e, 0), r ? s : s[0];
@@ -320,16 +320,16 @@ class Z {
           let o = [];
           const a = [{ nestedArrIndex: -1, value: c }];
           for (; a.length; ) {
-            const { nestedArrIndex: l, value: h } = a.pop();
-            if (y(h))
-              if (S(h) && !D(h)) {
+            const { nestedArrIndex: h, value: l } = a.pop();
+            if (y(l))
+              if (S(l) && !D(l)) {
                 let u = {
-                  v: h,
-                  i: l,
-                  n: this.norm.get(h)
+                  v: l,
+                  i: h,
+                  n: this.norm.get(l)
                 };
                 o.push(u);
-              } else b(h) && h.forEach((u, d) => {
+              } else b(l) && l.forEach((u, d) => {
                 a.push({
                   nestedArrIndex: d,
                   value: u
@@ -362,7 +362,7 @@ function _t(t, { getFn: e = f.getFn, fieldNormWeight: s = f.fieldNormWeight } =
   const { keys: r, records: n } = t, i = new Z({ getFn: e, fieldNormWeight: s });
   return i.setKeys(r), i.setIndexRecords(n), i;
 }
-function $(t, {
+function v(t, {
   errors: e = 0,
   currentLocation: s = 0,
   expectedLocation: r = 0,
@@ -391,63 +391,63 @@ function wt(t, e, s, {
   findAllMatches: c = f.findAllMatches,
   minMatchCharLength: o = f.minMatchCharLength,
   includeMatches: a = f.includeMatches,
-  ignoreLocation: l = f.ignoreLocation
+  ignoreLocation: h = f.ignoreLocation
 } = {}) {
   if (e.length > k)
     throw new Error(ut(k));
-  const h = e.length, u = t.length, d = Math.max(0, Math.min(r, u));
+  const l = e.length, u = t.length, d = Math.max(0, Math.min(r, u));
   let g = i, p = d;
   const m = o > 1 || a, M = m ? Array(u) : [];
   let _;
   for (; (_ = t.indexOf(e, p)) > -1; ) {
-    let x = $(e, {
+    let x = v(e, {
       currentLocation: _,
       expectedLocation: d,
       distance: n,
-      ignoreLocation: l
+      ignoreLocation: h
     });
-    if (g = Math.min(x, g), p = _ + h, m) {
+    if (g = Math.min(x, g), p = _ + l, m) {
       let w = 0;
-      for (; w < h; )
+      for (; w < l; )
         M[_ + w] = 1, w += 1;
     }
   }
   p = -1;
-  let L = [], O = 1, j = h + u;
-  const Ie = 1 << h - 1;
-  for (let x = 0; x < h; x += 1) {
+  let L = [], O = 1, j = l + u;
+  const Ie = 1 << l - 1;
+  for (let x = 0; x < l; x += 1) {
     let w = 0, I = j;
     for (; w < I; )
-      $(e, {
+      v(e, {
         errors: x,
         currentLocation: d + I,
         expectedLocation: d,
         distance: n,
-        ignoreLocation: l
+        ignoreLocation: h
       }) <= g ? w = I : j = I, I = Math.floor((j - w) / 2 + w);
     j = I;
-    let q = Math.max(1, d - I + 1), P = c ? u : Math.min(d + I, u) + h, R = Array(P + 2);
+    let q = Math.max(1, d - I + 1), P = c ? u : Math.min(d + I, u) + l, R = Array(P + 2);
     R[P + 1] = (1 << x) - 1;
     for (let E = P; E >= q; E -= 1) {
-      let v = E - 1, ee = s[t.charAt(v)];
-      if (m && (M[v] = +!!ee), R[E] = (R[E + 1] << 1 | 1) & ee, x && (R[E] |= (L[E + 1] | L[E]) << 1 | 1 | L[E + 1]), R[E] & Ie && (O = $(e, {
+      let $ = E - 1, ee = s[t.charAt($)];
+      if (m && (M[$] = +!!ee), R[E] = (R[E + 1] << 1 | 1) & ee, x && (R[E] |= (L[E + 1] | L[E]) << 1 | 1 | L[E + 1]), R[E] & Ie && (O = v(e, {
         errors: x,
-        currentLocation: v,
+        currentLocation: $,
         expectedLocation: d,
         distance: n,
-        ignoreLocation: l
+        ignoreLocation: h
       }), O <= g)) {
-        if (g = O, p = v, p <= d)
+        if (g = O, p = $, p <= d)
           break;
         q = Math.max(1, 2 * d - p);
       }
     }
-    if ($(e, {
+    if (v(e, {
       errors: x + 1,
       currentLocation: d,
       expectedLocation: d,
       distance: n,
-      ignoreLocation: l
+      ignoreLocation: h
     }) > g)
       break;
     L = R;
@@ -480,7 +480,7 @@ class Ee {
     findAllMatches: c = f.findAllMatches,
     minMatchCharLength: o = f.minMatchCharLength,
     isCaseSensitive: a = f.isCaseSensitive,
-    ignoreLocation: l = f.ignoreLocation
+    ignoreLocation: h = f.ignoreLocation
   } = {}) {
     if (this.options = {
       location: s,
@@ -490,10 +490,10 @@ class Ee {
       findAllMatches: c,
       minMatchCharLength: o,
       isCaseSensitive: a,
-      ignoreLocation: l
+      ignoreLocation: h
     }, this.pattern = a ? e : e.toLowerCase(), this.chunks = [], !this.pattern.length)
       return;
-    const h = (d, g) => {
+    const l = (d, g) => {
       this.chunks.push({
         pattern: d,
         alphabet: It(d),
@@ -504,13 +504,13 @@ class Ee {
       let d = 0;
       const g = u % k, p = u - g;
       for (; d < p; )
-        h(this.pattern.substr(d, k), d), d += k;
+        l(this.pattern.substr(d, k), d), d += k;
       if (g) {
         const m = u - k;
-        h(this.pattern.substr(m), m);
+        l(this.pattern.substr(m), m);
       }
     } else
-      h(this.pattern, 0);
+      l(this.pattern, 0);
   }
   searchIn(e) {
     const { isCaseSensitive: s, includeMatches: r } = this.options;
@@ -527,9 +527,9 @@ class Ee {
       threshold: c,
       findAllMatches: o,
       minMatchCharLength: a,
-      ignoreLocation: l
+      ignoreLocation: h
     } = this.options;
-    let h = [], u = 0, d = !1;
+    let l = [], u = 0, d = !1;
     this.chunks.forEach(({ pattern: p, alphabet: m, startIndex: M }) => {
       const { isMatch: _, score: L, indices: O } = wt(e, p, m, {
         location: n + M,
@@ -538,15 +538,15 @@ class Ee {
         findAllMatches: o,
         minMatchCharLength: a,
         includeMatches: r,
-        ignoreLocation: l
+        ignoreLocation: h
       });
-      _ && (d = !0), u += L, _ && O && (h = [...h, ...O]);
+      _ && (d = !0), u += L, _ && O && (l = [...l, ...O]);
     });
     let g = {
       isMatch: d,
       score: d ? u / this.chunks.length : 1
     };
-    return d && r && (g.indices = h), g;
+    return d && r && (g.indices = l), g;
   }
 }
 class A {
@@ -707,7 +707,7 @@ class Se extends A {
     findAllMatches: c = f.findAllMatches,
     minMatchCharLength: o = f.minMatchCharLength,
     isCaseSensitive: a = f.isCaseSensitive,
-    ignoreLocation: l = f.ignoreLocation
+    ignoreLocation: h = f.ignoreLocation
   } = {}) {
     super(e), this._bitapSearch = new Ee(e, {
       location: s,
@@ -717,7 +717,7 @@ class Se extends A {
       findAllMatches: c,
       minMatchCharLength: o,
       isCaseSensitive: a,
-      ignoreLocation: l
+      ignoreLocation: h
     });
   }
   static get type() {
@@ -768,24 +768,24 @@ const V = [
   Rt,
   Ot,
   Se
-], oe = V.length, jt = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, vt = "|";
-function $t(t, e = {}) {
-  return t.split(vt).map((s) => {
+], oe = V.length, jt = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, $t = "|";
+function vt(t, e = {}) {
+  return t.split($t).map((s) => {
     let r = s.trim().split(jt).filter((i) => i && !!i.trim()), n = [];
     for (let i = 0, c = r.length; i < c; i += 1) {
       const o = r[i];
-      let a = !1, l = -1;
-      for (; !a && ++l < oe; ) {
-        const h = V[l];
-        let u = h.isMultiMatch(o);
-        u && (n.push(new h(u, e)), a = !0);
+      let a = !1, h = -1;
+      for (; !a && ++h < oe; ) {
+        const l = V[h];
+        let u = l.isMultiMatch(o);
+        u && (n.push(new l(u, e)), a = !0);
       }
       if (!a)
-        for (l = -1; ++l < oe; ) {
-          const h = V[l];
-          let u = h.isSingleMatch(o);
+        for (h = -1; ++h < oe; ) {
+          const l = V[h];
+          let u = l.isSingleMatch(o);
           if (u) {
-            n.push(new h(u, e));
+            n.push(new l(u, e));
             break;
           }
         }
@@ -803,7 +803,7 @@ class Ft {
     findAllMatches: c = f.findAllMatches,
     location: o = f.location,
     threshold: a = f.threshold,
-    distance: l = f.distance
+    distance: h = f.distance
   } = {}) {
     this.query = null, this.options = {
       isCaseSensitive: s,
@@ -813,8 +813,8 @@ class Ft {
       ignoreLocation: i,
       location: o,
       threshold: a,
-      distance: l
-    }, this.pattern = s ? e : e.toLowerCase(), this.query = $t(this.pattern, this.options);
+      distance: h
+    }, this.pattern = s ? e : e.toLowerCase(), this.query = vt(this.pattern, this.options);
   }
   static condition(e, s) {
     return s.useExtendedSearch;
@@ -829,11 +829,11 @@ class Ft {
     const { includeMatches: r, isCaseSensitive: n } = this.options;
     e = n ? e : e.toLowerCase();
     let i = 0, c = [], o = 0;
-    for (let a = 0, l = s.length; a < l; a += 1) {
-      const h = s[a];
+    for (let a = 0, h = s.length; a < h; a += 1) {
+      const l = s[a];
       c.length = 0, i = 0;
-      for (let u = 0, d = h.length; u < d; u += 1) {
-        const g = h[u], { isMatch: p, indices: m, score: M } = g.search(e);
+      for (let u = 0, d = l.length; u < d; u += 1) {
+        const g = l[u], { isMatch: p, indices: m, score: M } = g.search(e);
         if (p) {
           if (i += 1, o += M, r) {
             const _ = g.constructor.type;
@@ -888,23 +888,23 @@ function be(t, e, { auto: s = !0 } = {}) {
     if (!c && i.length > 1 && !Y(n))
       return r(ae(n));
     if (Dt(n)) {
-      const a = c ? n[U.PATH] : i[0], l = c ? n[U.PATTERN] : n[a];
-      if (!S(l))
-        throw new Error(lt(a));
-      const h = {
+      const a = c ? n[U.PATH] : i[0], h = c ? n[U.PATTERN] : n[a];
+      if (!S(h))
+        throw new Error(ht(a));
+      const l = {
         keyId: H(a),
-        pattern: l
+        pattern: h
       };
-      return s && (h.searcher = G(l, e)), h;
+      return s && (l.searcher = G(h, e)), l;
     }
     let o = {
       children: [],
       operator: i[0]
     };
     return i.forEach((a) => {
-      const l = n[a];
-      b(l) && l.forEach((h) => {
-        o.children.push(r(h));
+      const h = n[a];
+      b(h) && h.forEach((l) => {
+        o.children.push(r(l));
       });
     }), o;
   };
@@ -959,7 +959,7 @@ class C {
   }
   setCollection(e, s) {
     if (this._docs = e, s && !(s instanceof Z))
-      throw new Error(ht);
+      throw new Error(lt);
     this._myIndex = s || xe(this.options.keys, this._docs, {
       getFn: this.options.getFn,
       fieldNormWeight: this.options.fieldNormWeight
@@ -1001,16 +1001,16 @@ class C {
     return r.forEach(({ v: i, i: c, n: o }) => {
       if (!y(i))
         return;
-      const { isMatch: a, score: l, indices: h } = s.searchIn(i);
+      const { isMatch: a, score: h, indices: l } = s.searchIn(i);
       a && n.push({
         item: i,
         idx: c,
-        matches: [{ score: l, value: i, norm: o, indices: h }]
+        matches: [{ score: h, value: i, norm: o, indices: l }]
       });
     }), n;
   }
   _searchLogical(e) {
-    const s = be(e, this.options), r = (o, a, l) => {
+    const s = be(e, this.options), r = (o, a, h) => {
       if (!o.children) {
         const { keyId: u, searcher: d } = o, g = this._findMatches({
           key: this._keyStore.get(u),
@@ -1019,27 +1019,27 @@ class C {
         });
         return g && g.length ? [
           {
-            idx: l,
+            idx: h,
             item: a,
             matches: g
           }
         ] : [];
       }
-      const h = [];
+      const l = [];
       for (let u = 0, d = o.children.length; u < d; u += 1) {
-        const g = o.children[u], p = r(g, a, l);
+        const g = o.children[u], p = r(g, a, h);
         if (p.length)
-          h.push(...p);
+          l.push(...p);
         else if (o.operator === F.AND)
           return [];
       }
-      return h;
+      return l;
     }, n = this._myIndex.records, i = {}, c = [];
     return n.forEach(({ $: o, i: a }) => {
       if (y(o)) {
-        let l = r(s, o, a);
-        l.length && (i[a] || (i[a] = { idx: a, item: o, matches: [] }, c.push(i[a])), l.forEach(({ matches: h }) => {
-          i[a].matches.push(...h);
+        let h = r(s, o, a);
+        h.length && (i[a] || (i[a] = { idx: a, item: o, matches: [] }, c.push(i[a])), h.forEach(({ matches: l }) => {
+          i[a].matches.push(...l);
         }));
       }
     }), c;
@@ -1050,11 +1050,11 @@ class C {
       if (!y(c))
         return;
       let a = [];
-      r.forEach((l, h) => {
+      r.forEach((h, l) => {
         a.push(
           ...this._findMatches({
-            key: l,
-            value: c[h],
+            key: h,
+            value: c[l],
             searcher: s
           })
         );
@@ -1073,19 +1073,19 @@ class C {
       s.forEach(({ v: i, i: c, n: o }) => {
         if (!y(i))
           return;
-        const { isMatch: a, score: l, indices: h } = r.searchIn(i);
+        const { isMatch: a, score: h, indices: l } = r.searchIn(i);
         a && n.push({
-          score: l,
+          score: h,
           key: e,
           value: i,
           idx: c,
           norm: o,
-          indices: h
+          indices: l
         });
       });
     else {
-      const { v: i, n: c } = s, { isMatch: o, score: a, indices: l } = r.searchIn(i);
-      o && n.push({ score: a, key: e, value: i, norm: c, indices: l });
+      const { v: i, n: c } = s, { isMatch: o, score: a, indices: h } = r.searchIn(i);
+      o && n.push({ score: a, key: e, value: i, norm: c, indices: h });
     }
     return n;
   }
@@ -1119,17 +1119,17 @@ const Vt = {
   onChange: s,
   transformBefore: r
 }) => {
-  const [n, i] = Xe({
+  const [n, i] = Je({
     onChange: s,
     value: e,
     initial: ""
-  }), { setTransform: c, deleteTransform: o } = he(), a = Ae(c, t, []), l = Je(
-    (h) => {
-      i(h), h.length === 0 ? o("filter") : (r != null && (h = r(h)), a("filter", Ut({ term: h })));
+  }), { setTransform: c, deleteTransform: o } = le(), a = Ae(c, t, []), h = Qe(
+    (l) => {
+      i(l), l.length === 0 ? o("filter") : (r != null && (l = r(l)), a("filter", Ut({ term: l })));
     },
     [i, r]
   );
-  return { value: n, onChange: l };
+  return { value: n, onChange: h };
 }, Yt = ({
   children: t = (s) => /* @__PURE__ */ Ye.jsx(Oe, { placeholder: "Filter", ...s }),
   ...e
@@ -1141,13 +1141,13 @@ const Vt = {
   DataProvider: Ce,
   Filter: Yt,
   Hover: je,
-  ItemFrame: ve,
+  ItemFrame: $e,
   List: Ze,
-  Search: $e,
+  Search: ve,
   Selector: Ne,
   selectValueIsZero: Fe,
   useDataContext: Te,
-  useDataUtilContext: he,
+  useDataUtilContext: le,
   useFilter: we,
   useGetTransformedData: Pe,
   useHoverContext: De,

package/dist/{external-B_mVlkww.js → external-n_t7VfzS.js}

@@ -1,4 +1,4 @@
-import { A as e, C as a, a as r, J as o, P as s, S as t, s as l } from "./Pack-l3j3YWpE.js";
+import { A as e, C as a, a as r, J as o, P as s, S as t, s as l } from "./Pack-BrxYNh7B.js";
 const S = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   ALIGNMENTS: e,

package/dist/header.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./external-CNl6YOd-.cjs");exports.Header=e.external;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./external-CN-OhewX.cjs");exports.Header=e.external;

package/dist/header.js

@@ -1,4 +1,4 @@
-import { e as a } from "./external-CulLnj8B.js";
+import { e as a } from "./external-CmbBTupJ.js";
 export {
   a as Header
 };