@synnaxlabs/pluto 0.29.0 → 0.31.0

package/dist/{external-D8r96cqI.js → external-ByGOTAK0.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-3WohopP9.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-BrC3s3ox.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-BpQMir30.js";
-import "./css-CiSR0WsA.js";
-import "./Pack-l3j3YWpE.js";
-import { L as Ze } from "./List-BI_89AyO.js";
-const K = Symbol(), le = Symbol(), J = Symbol();
+import { useCallback as Qe } from "react";
+import { w as Xe, j as Je } from "./aggregator-BNkkZ-Bc.js";
+import "./css-B8RwzK24.js";
+import "./Pack-BrxYNh7B.js";
+import { L as Ze } from "./List-L9yD_LRe.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-BFldRd_W.cjs → external-CGdoEsew.cjs}

@@ -1 +1 @@
-"use strict";const i=require("./jsx-runtime-Cek9Ww4S.cjs"),d=require("./aggregator-CoVqjgd_.cjs"),c=require("react"),S=require("./Pack-BgzS2BHo.cjs"),a=require("./Toggle-B8cAGDWx.cjs"),o=require("./css-Cc1vb61S.cjs"),p=c.createContext({divided:!1,level:"h1"}),l=()=>c.useContext(p),j=({children:s,className:r,level:e="h1",divided:n=!1,...t})=>i.jsxRuntimeExports.jsx(p.Provider,{value:{level:e,divided:n},children:i.jsxRuntimeExports.jsx(S.Space,{el:"header",direction:"x",justify:"spaceBetween",className:o.CSS(o.CSS.B("header"),o.CSS.bordered("bottom"),n&&o.CSS.BM("header","divided"),r),...t,children:s})}),m=({children:s=[]})=>{const{level:r,divided:e}=l();return i.jsxRuntimeExports.jsx(S.Space,{direction:"x",size:"small",align:"center",className:o.CSS.BE("header","actions"),children:d.A(s).map((n,t)=>i.jsxRuntimeExports.jsx(h,{index:t,level:r,divided:e,children:n},t))})},h=({index:s,level:r,children:e,divided:n})=>{let t=e;if(!c.isValidElement(e)){const{onClick:x,...C}=e;t=i.jsxRuntimeExports.jsx(a.Icon,{onClick:u=>{u.stopPropagation(),u.preventDefault(),x==null||x(u)},size:d.LevelComponentSizes[r],...C},s)}return i.jsxRuntimeExports.jsxs(c.Fragment,{children:[n&&i.jsxRuntimeExports.jsx(a.Divider,{}),t]},s)},v=({children:s="",className:r,onClick:e,...n})=>{const{level:t}=l();return i.jsxRuntimeExports.jsx(a.Button,{variant:"text",size:d.LevelComponentSizes[t],onClick:e,className:o.CSS(o.CSS.B("header-button-title"),r),sharp:!0,...n,children:s})},E=({className:s,level:r,...e})=>{const{level:n,divided:t}=l();return i.jsxRuntimeExports.jsx(a.WithIcon,{className:o.CSS(o.CSS.BE("header","text"),s),level:r??n,divided:t,size:1.5,...e})},R=Object.freeze(Object.defineProperty({__proto__:null,Actions:m,ButtonTitle:v,Header:j,Title:E,useContext:l},Symbol.toStringTag,{value:"Module"}));exports.Actions=m;exports.ButtonTitle=v;exports.Header=j;exports.external=R;
+"use strict";const i=require("./jsx-runtime-Cek9Ww4S.cjs"),d=require("./aggregator-LvZi4Kvh.cjs"),c=require("react"),S=require("./Pack-C_SrDA3a.cjs"),a=require("./Toggle-DdnBJm8D.cjs"),o=require("./css-LxkguM_s.cjs"),p=c.createContext({divided:!1,level:"h1"}),l=()=>c.useContext(p),j=({children:s,className:r,level:e="h1",divided:n=!1,...t})=>i.jsxRuntimeExports.jsx(p.Provider,{value:{level:e,divided:n},children:i.jsxRuntimeExports.jsx(S.Space,{el:"header",direction:"x",justify:"spaceBetween",className:o.CSS(o.CSS.B("header"),o.CSS.bordered("bottom"),n&&o.CSS.BM("header","divided"),r),...t,children:s})}),m=({children:s=[]})=>{const{level:r,divided:e}=l();return i.jsxRuntimeExports.jsx(S.Space,{direction:"x",size:"small",align:"center",className:o.CSS.BE("header","actions"),children:d.A(s).map((n,t)=>i.jsxRuntimeExports.jsx(h,{index:t,level:r,divided:e,children:n},t))})},h=({index:s,level:r,children:e,divided:n})=>{let t=e;if(!c.isValidElement(e)){const{onClick:x,...C}=e;t=i.jsxRuntimeExports.jsx(a.Icon,{onClick:u=>{u.stopPropagation(),u.preventDefault(),x==null||x(u)},size:d.LevelComponentSizes[r],...C},s)}return i.jsxRuntimeExports.jsxs(c.Fragment,{children:[n&&i.jsxRuntimeExports.jsx(a.Divider,{}),t]},s)},v=({children:s="",className:r,onClick:e,...n})=>{const{level:t}=l();return i.jsxRuntimeExports.jsx(a.Button,{variant:"text",size:d.LevelComponentSizes[t],onClick:e,className:o.CSS(o.CSS.B("header-button-title"),r),sharp:!0,...n,children:s})},E=({className:s,level:r,...e})=>{const{level:n,divided:t}=l();return i.jsxRuntimeExports.jsx(a.WithIcon,{className:o.CSS(o.CSS.BE("header","text"),s),level:r??n,divided:t,size:1.5,...e})},R=Object.freeze(Object.defineProperty({__proto__:null,Actions:m,ButtonTitle:v,Header:j,Title:E,useContext:l},Symbol.toStringTag,{value:"Module"}));exports.Actions=m;exports.ButtonTitle=v;exports.Header=j;exports.external=R;

package/dist/external-CJt9nz9P.cjs

@@ -0,0 +1 @@
+"use strict";const m=require("./Toggle-DdnBJm8D.cjs"),ke=require("./jsx-runtime-Cek9Ww4S.cjs"),ve=require("react"),he=require("./aggregator-LvZi4Kvh.cjs");require("./css-LxkguM_s.cjs");require("./Pack-C_SrDA3a.cjs");const $e=require("./List-DVMb5TAO.cjs"),W=Symbol(),ue=Symbol(),X=Symbol();let je=(t,e)=>new Proxy(t,e);const z=Object.getPrototypeOf,se=new WeakMap,J=t=>t&&(se.has(t)?se.get(t):z(t)===Object.prototype||z(t)===Array.prototype),re=t=>typeof t=="object"&&t!==null,ne=new WeakMap,fe=t=>t[X]||t,de=(t,e,s)=>{if(!J(t))return t;const r=fe(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 h=!1;const l=(d,g)=>{if(!h){let p=a.a.get(c);p||(p=new Set,a.a.set(c,p)),g&&p.has(W)||p.add(d)}},u={get:(d,g)=>g===X?c:(l(g),de(d[g],a.a,a.c)),has:(d,g)=>g===ue?(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(W),Reflect.ownKeys(d))};return o&&(u.set=u.deleteProperty=()=>!1),[u,a]})(r,n),i[1].p=je(n?(c=>{let o=ne.get(c);if(!o){if(Array.isArray(c))o=Array.from(c);else{const a=Object.getOwnPropertyDescriptors(c);Object.values(a).forEach(h=>{h.configurable=!0}),o=Object.create(z(c),a)}ne.set(c,o)}return o})(r):r,i[0]),s&&s.set(r,i)),i[1].a=e,i[1].c=s,i[1].p},Te=(t,e)=>{const s=Reflect.ownKeys(t),r=Reflect.ownKeys(e);return s.length!==r.length||s.some((n,i)=>n!==r[i])},ge=(t,e,s,r)=>{if(Object.is(t,e))return!1;if(!re(t)||!re(e))return!0;const n=s.get(fe(t));if(!n)return!0;if(r){const c=r.get(t);if(c&&c.n===e)return c.g;r.set(t,{n:e,g:!1})}let i=null;for(const c of n){const o=c===W?Te(t,e):ge(t[c],e[c],s,r);if(o!==!0&&o!==!1||(i=o),i)break}return i===null&&(i=!0),r&&r.set(t,{n:e,g:i}),i},Fe=t=>!!J(t)&&ue in t,Z=t=>J(t)&&t[X]||null,H=t=>typeof t=="object"&&t!==null,pe=(t,e)=>{if(!H(t))return t;const s=Z(t);return s!==null?(Fe(t),s):(e.has(t)||(e.add(t),Object.entries(t).forEach(([r,n])=>{const i=pe(n,e);Object.is(i,n)||(t[r]=i)})),t)},F=(t,e,s)=>{if(!H(t)||!H(e))return;const r=s.get(Z(e)||e);r&&r.forEach(n=>{F(t[n],e[n],s)})},Ne=(t,e)=>{var s;let r=0;const n=(s=e==null?void 0:e.size)!=null?s:1,i=[],c=new WeakMap,o=new WeakMap;return a=>{const h=Z(a)||a,l=c.get(h);if(l)return F(a,l.o,l.a),l.r;for(let M=0;M<n;M+=1){const y=i[(r+M)%n];if(!y)break;if(!ge(y.o,a,y.a,new WeakMap))return c.set(h,y),F(a,y.o,y.a),y.r}const u=new WeakMap,d=de(a,u,o),g=pe(t(d),new Set);F(a,a,u);const p={o:a,r:g,a:u};return r=(r-1+n)%n,i[r]=p,c.set(h,p),g}},me=(t,e)=>he.w.RUNTIME==="browser"?Ne(t,e):t;function I(t){return Array.isArray?Array.isArray(t):xe(t)==="[object Array]"}const De=1/0;function Pe(t){if(typeof t=="string")return t;let e=t+"";return e=="0"&&1/t==-De?"-0":e}function Ke(t){return t==null?"":Pe(t)}function _(t){return typeof t=="string"}function Me(t){return typeof t=="number"}function We(t){return t===!0||t===!1||ze(t)&&xe(t)=="[object Boolean]"}function ye(t){return typeof t=="object"}function ze(t){return ye(t)&&t!==null}function x(t){return t!=null}function K(t){return!t.trim().length}function xe(t){return t==null?t===void 0?"[object Undefined]":"[object Null]":Object.prototype.toString.call(t)}const He="Incorrect 'index' type",Ue=t=>`Invalid value for key ${t}`,Ve=t=>`Pattern length exceeds max of ${t}.`,Be=t=>`Missing ${t} property in key`,Ge=t=>`Property 'weight' in key '${t}' must be a positive integer`,ie=Object.prototype.hasOwnProperty;class Ye{constructor(e){this._keys=[],this._keyMap={};let s=0;e.forEach(r=>{let n=Se(r);this._keys.push(n),this._keyMap[n.id]=n,s+=n.weight}),this._keys.forEach(r=>{r.weight/=s})}get(e){return this._keyMap[e]}keys(){return this._keys}toJSON(){return JSON.stringify(this._keys)}}function Se(t){let e=null,s=null,r=null,n=1,i=null;if(_(t)||I(t))r=t,e=ce(t),s=U(t);else{if(!ie.call(t,"name"))throw new Error(Be("name"));const c=t.name;if(r=c,ie.call(t,"weight")&&(n=t.weight,n<=0))throw new Error(Ge(c));e=ce(c),s=U(c),i=t.getFn}return{path:e,id:s,weight:n,src:r,getFn:i}}function ce(t){return I(t)?t:t.split(".")}function U(t){return I(t)?t.join("."):t}function Qe(t,e){let s=[],r=!1;const n=(i,c,o)=>{if(x(i))if(!c[o])s.push(i);else{let a=c[o];const h=i[a];if(!x(h))return;if(o===c.length-1&&(_(h)||Me(h)||We(h)))s.push(Ke(h));else if(I(h)){r=!0;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,_(e)?e.split("."):e,0),r?s:s[0]}const Xe={includeMatches:!1,findAllMatches:!1,minMatchCharLength:1},Je={isCaseSensitive:!1,includeScore:!1,keys:[],shouldSort:!0,sortFn:(t,e)=>t.score===e.score?t.idx<e.idx?-1:1:t.score<e.score?-1:1},Ze={location:0,threshold:.6,distance:100},qe={useExtendedSearch:!1,getFn:Qe,ignoreLocation:!1,ignoreFieldNorm:!1,fieldNormWeight:1};var f={...Je,...Xe,...Ze,...qe};const et=/[^ ]+/g;function tt(t=1,e=3){const s=new Map,r=Math.pow(10,e);return{get(n){const i=n.match(et).length;if(s.has(i))return s.get(i);const c=1/Math.pow(i,.5*t),o=parseFloat(Math.round(c*r)/r);return s.set(i,o),o},clear(){s.clear()}}}class q{constructor({getFn:e=f.getFn,fieldNormWeight:s=f.fieldNormWeight}={}){this.norm=tt(s,3),this.getFn=e,this.isCreated=!1,this.setIndexRecords()}setSources(e=[]){this.docs=e}setIndexRecords(e=[]){this.records=e}setKeys(e=[]){this.keys=e,this._keysMap={},e.forEach((s,r)=>{this._keysMap[s.id]=r})}create(){this.isCreated||!this.docs.length||(this.isCreated=!0,_(this.docs[0])?this.docs.forEach((e,s)=>{this._addString(e,s)}):this.docs.forEach((e,s)=>{this._addObject(e,s)}),this.norm.clear())}add(e){const s=this.size();_(e)?this._addString(e,s):this._addObject(e,s)}removeAt(e){this.records.splice(e,1);for(let s=e,r=this.size();s<r;s+=1)this.records[s].i-=1}getValueForItemAtKeyId(e,s){return e[this._keysMap[s]]}size(){return this.records.length}_addString(e,s){if(!x(e)||K(e))return;let r={v:e,i:s,n:this.norm.get(e)};this.records.push(r)}_addObject(e,s){let r={i:s,$:{}};this.keys.forEach((n,i)=>{let c=n.getFn?n.getFn(e):this.getFn(e,n.path);if(x(c)){if(I(c)){let o=[];const a=[{nestedArrIndex:-1,value:c}];for(;a.length;){const{nestedArrIndex:h,value:l}=a.pop();if(x(l))if(_(l)&&!K(l)){let u={v:l,i:h,n:this.norm.get(l)};o.push(u)}else I(l)&&l.forEach((u,d)=>{a.push({nestedArrIndex:d,value:u})})}r.$[i]=o}else if(_(c)&&!K(c)){let o={v:c,n:this.norm.get(c)};r.$[i]=o}}}),this.records.push(r)}toJSON(){return{keys:this.keys,records:this.records}}}function Ee(t,e,{getFn:s=f.getFn,fieldNormWeight:r=f.fieldNormWeight}={}){const n=new q({getFn:s,fieldNormWeight:r});return n.setKeys(t.map(Se)),n.setSources(e),n.create(),n}function st(t,{getFn:e=f.getFn,fieldNormWeight:s=f.fieldNormWeight}={}){const{keys:r,records:n}=t,i=new q({getFn:e,fieldNormWeight:s});return i.setKeys(r),i.setIndexRecords(n),i}function T(t,{errors:e=0,currentLocation:s=0,expectedLocation:r=0,distance:n=f.distance,ignoreLocation:i=f.ignoreLocation}={}){const c=e/t.length;if(i)return c;const o=Math.abs(r-s);return n?c+o/n:o?1:c}function rt(t=[],e=f.minMatchCharLength){let s=[],r=-1,n=-1,i=0;for(let c=t.length;i<c;i+=1){let o=t[i];o&&r===-1?r=i:!o&&r!==-1&&(n=i-1,n-r+1>=e&&s.push([r,n]),r=-1)}return t[i-1]&&i-r>=e&&s.push([r,i-1]),s}const L=32;function nt(t,e,s,{location:r=f.location,distance:n=f.distance,threshold:i=f.threshold,findAllMatches:c=f.findAllMatches,minMatchCharLength:o=f.minMatchCharLength,includeMatches:a=f.includeMatches,ignoreLocation:h=f.ignoreLocation}={}){if(e.length>L)throw new Error(Ve(L));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,y=M?Array(u):[];let b;for(;(b=t.indexOf(e,p))>-1;){let S=T(e,{currentLocation:b,expectedLocation:d,distance:n,ignoreLocation:h});if(g=Math.min(S,g),p=b+l,M){let w=0;for(;w<l;)y[b+w]=1,w+=1}}p=-1;let R=[],C=1,$=l+u;const Re=1<<l-1;for(let S=0;S<l;S+=1){let w=0,A=$;for(;w<A;)T(e,{errors:S,currentLocation:d+A,expectedLocation:d,distance:n,ignoreLocation:h})<=g?w=A:$=A,A=Math.floor(($-w)/2+w);$=A;let ee=Math.max(1,d-A+1),P=c?u:Math.min(d+A,u)+l,k=Array(P+2);k[P+1]=(1<<S)-1;for(let E=P;E>=ee;E-=1){let j=E-1,te=s[t.charAt(j)];if(M&&(y[j]=+!!te),k[E]=(k[E+1]<<1|1)&te,S&&(k[E]|=(R[E+1]|R[E])<<1|1|R[E+1]),k[E]&Re&&(C=T(e,{errors:S,currentLocation:j,expectedLocation:d,distance:n,ignoreLocation:h}),C<=g)){if(g=C,p=j,p<=d)break;ee=Math.max(1,2*d-p)}}if(T(e,{errors:S+1,currentLocation:d,expectedLocation:d,distance:n,ignoreLocation:h})>g)break;R=k}const D={isMatch:p>=0,score:Math.max(.001,C)};if(M){const S=rt(y,o);S.length?a&&(D.indices=S):D.isMatch=!1}return D}function it(t){let e={};for(let s=0,r=t.length;s<r;s+=1){const n=t.charAt(s);e[n]=(e[n]||0)|1<<r-s-1}return e}class _e{constructor(e,{location:s=f.location,threshold:r=f.threshold,distance:n=f.distance,includeMatches:i=f.includeMatches,findAllMatches:c=f.findAllMatches,minMatchCharLength:o=f.minMatchCharLength,isCaseSensitive:a=f.isCaseSensitive,ignoreLocation:h=f.ignoreLocation}={}){if(this.options={location:s,threshold:r,distance:n,includeMatches:i,findAllMatches:c,minMatchCharLength:o,isCaseSensitive:a,ignoreLocation:h},this.pattern=a?e:e.toLowerCase(),this.chunks=[],!this.pattern.length)return;const l=(d,g)=>{this.chunks.push({pattern:d,alphabet:it(d),startIndex:g})},u=this.pattern.length;if(u>L){let d=0;const g=u%L,p=u-g;for(;d<p;)l(this.pattern.substr(d,L),d),d+=L;if(g){const M=u-L;l(this.pattern.substr(M),M)}}else l(this.pattern,0)}searchIn(e){const{isCaseSensitive:s,includeMatches:r}=this.options;if(s||(e=e.toLowerCase()),this.pattern===e){let p={isMatch:!0,score:0};return r&&(p.indices=[[0,e.length-1]]),p}const{location:n,distance:i,threshold:c,findAllMatches:o,minMatchCharLength:a,ignoreLocation:h}=this.options;let l=[],u=0,d=!1;this.chunks.forEach(({pattern:p,alphabet:M,startIndex:y})=>{const{isMatch:b,score:R,indices:C}=nt(e,p,M,{location:n+y,distance:i,threshold:c,findAllMatches:o,minMatchCharLength:a,includeMatches:r,ignoreLocation:h});b&&(d=!0),u+=R,b&&C&&(l=[...l,...C])});let g={isMatch:d,score:d?u/this.chunks.length:1};return d&&r&&(g.indices=l),g}}class O{constructor(e){this.pattern=e}static isMultiMatch(e){return oe(e,this.multiRegex)}static isSingleMatch(e){return oe(e,this.singleRegex)}search(){}}function oe(t,e){const s=t.match(e);return s?s[1]:null}class ct extends O{constructor(e){super(e)}static get type(){return"exact"}static get multiRegex(){return/^="(.*)"$/}static get singleRegex(){return/^=(.*)$/}search(e){const s=e===this.pattern;return{isMatch:s,score:s?0:1,indices:[0,this.pattern.length-1]}}}class ot extends O{constructor(e){super(e)}static get type(){return"inverse-exact"}static get multiRegex(){return/^!"(.*)"$/}static get singleRegex(){return/^!(.*)$/}search(e){const r=e.indexOf(this.pattern)===-1;return{isMatch:r,score:r?0:1,indices:[0,e.length-1]}}}class at extends O{constructor(e){super(e)}static get type(){return"prefix-exact"}static get multiRegex(){return/^\^"(.*)"$/}static get singleRegex(){return/^\^(.*)$/}search(e){const s=e.startsWith(this.pattern);return{isMatch:s,score:s?0:1,indices:[0,this.pattern.length-1]}}}class lt extends O{constructor(e){super(e)}static get type(){return"inverse-prefix-exact"}static get multiRegex(){return/^!\^"(.*)"$/}static get singleRegex(){return/^!\^(.*)$/}search(e){const s=!e.startsWith(this.pattern);return{isMatch:s,score:s?0:1,indices:[0,e.length-1]}}}class ht extends O{constructor(e){super(e)}static get type(){return"suffix-exact"}static get multiRegex(){return/^"(.*)"\$$/}static get singleRegex(){return/^(.*)\$$/}search(e){const s=e.endsWith(this.pattern);return{isMatch:s,score:s?0:1,indices:[e.length-this.pattern.length,e.length-1]}}}class ut extends O{constructor(e){super(e)}static get type(){return"inverse-suffix-exact"}static get multiRegex(){return/^!"(.*)"\$$/}static get singleRegex(){return/^!(.*)\$$/}search(e){const s=!e.endsWith(this.pattern);return{isMatch:s,score:s?0:1,indices:[0,e.length-1]}}}class be extends O{constructor(e,{location:s=f.location,threshold:r=f.threshold,distance:n=f.distance,includeMatches:i=f.includeMatches,findAllMatches:c=f.findAllMatches,minMatchCharLength:o=f.minMatchCharLength,isCaseSensitive:a=f.isCaseSensitive,ignoreLocation:h=f.ignoreLocation}={}){super(e),this._bitapSearch=new _e(e,{location:s,threshold:r,distance:n,includeMatches:i,findAllMatches:c,minMatchCharLength:o,isCaseSensitive:a,ignoreLocation:h})}static get type(){return"fuzzy"}static get multiRegex(){return/^"(.*)"$/}static get singleRegex(){return/^(.*)$/}search(e){return this._bitapSearch.searchIn(e)}}class Ie extends O{constructor(e){super(e)}static get type(){return"include"}static get multiRegex(){return/^'"(.*)"$/}static get singleRegex(){return/^'(.*)$/}search(e){let s=0,r;const n=[],i=this.pattern.length;for(;(r=e.indexOf(this.pattern,s))>-1;)s=r+i,n.push([r,s-1]);const c=!!n.length;return{isMatch:c,score:c?0:1,indices:n}}}const V=[ct,Ie,at,lt,ut,ht,ot,be],ae=V.length,ft=/ +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/,dt="|";function gt(t,e={}){return t.split(dt).map(s=>{let r=s.trim().split(ft).filter(i=>i&&!!i.trim()),n=[];for(let i=0,c=r.length;i<c;i+=1){const o=r[i];let a=!1,h=-1;for(;!a&&++h<ae;){const l=V[h];let u=l.isMultiMatch(o);u&&(n.push(new l(u,e)),a=!0)}if(!a)for(h=-1;++h<ae;){const l=V[h];let u=l.isSingleMatch(o);if(u){n.push(new l(u,e));break}}}return n})}const pt=new Set([be.type,Ie.type]);class mt{constructor(e,{isCaseSensitive:s=f.isCaseSensitive,includeMatches:r=f.includeMatches,minMatchCharLength:n=f.minMatchCharLength,ignoreLocation:i=f.ignoreLocation,findAllMatches:c=f.findAllMatches,location:o=f.location,threshold:a=f.threshold,distance:h=f.distance}={}){this.query=null,this.options={isCaseSensitive:s,includeMatches:r,minMatchCharLength:n,findAllMatches:c,ignoreLocation:i,location:o,threshold:a,distance:h},this.pattern=s?e:e.toLowerCase(),this.query=gt(this.pattern,this.options)}static condition(e,s){return s.useExtendedSearch}searchIn(e){const s=this.query;if(!s)return{isMatch:!1,score:1};const{includeMatches:r,isCaseSensitive:n}=this.options;e=n?e:e.toLowerCase();let i=0,c=[],o=0;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=l.length;u<d;u+=1){const g=l[u],{isMatch:p,indices:M,score:y}=g.search(e);if(p){if(i+=1,o+=y,r){const b=g.constructor.type;pt.has(b)?c=[...c,...M]:c.push(M)}}else{o=0,i=0,c.length=0;break}}if(i){let u={isMatch:!0,score:o/i};return r&&(u.indices=c),u}}return{isMatch:!1,score:1}}}const B=[];function Mt(...t){B.push(...t)}function G(t,e){for(let s=0,r=B.length;s<r;s+=1){let n=B[s];if(n.condition(t,e))return new n(t,e)}return new _e(t,e)}const N={AND:"$and",OR:"$or"},Y={PATH:"$path",PATTERN:"$val"},Q=t=>!!(t[N.AND]||t[N.OR]),yt=t=>!!t[Y.PATH],xt=t=>!I(t)&&ye(t)&&!Q(t),le=t=>({[N.AND]:Object.keys(t).map(e=>({[e]:t[e]}))});function we(t,e,{auto:s=!0}={}){const r=n=>{let i=Object.keys(n);const c=yt(n);if(!c&&i.length>1&&!Q(n))return r(le(n));if(xt(n)){const a=c?n[Y.PATH]:i[0],h=c?n[Y.PATTERN]:n[a];if(!_(h))throw new Error(Ue(a));const l={keyId:U(a),pattern:h};return s&&(l.searcher=G(h,e)),l}let o={children:[],operator:i[0]};return i.forEach(a=>{const h=n[a];I(h)&&h.forEach(l=>{o.children.push(r(l))})}),o};return Q(t)||(t=le(t)),r(t)}function St(t,{ignoreFieldNorm:e=f.ignoreFieldNorm}){t.forEach(s=>{let r=1;s.matches.forEach(({key:n,norm:i,score:c})=>{const o=n?n.weight:null;r*=Math.pow(c===0&&o?Number.EPSILON:c,(o||1)*(e?1:i))}),s.score=r})}function Et(t,e){const s=t.matches;e.matches=[],x(s)&&s.forEach(r=>{if(!x(r.indices)||!r.indices.length)return;const{indices:n,value:i}=r;let c={indices:n,value:i};r.key&&(c.key=r.key.src),r.idx>-1&&(c.refIndex=r.idx),e.matches.push(c)})}function _t(t,e){e.score=t.score}function bt(t,e,{includeMatches:s=f.includeMatches,includeScore:r=f.includeScore}={}){const n=[];return s&&n.push(Et),r&&n.push(_t),t.map(i=>{const{idx:c}=i,o={item:e[c],refIndex:c};return n.length&&n.forEach(a=>{a(i,o)}),o})}class v{constructor(e,s={},r){this.options={...f,...s},this.options.useExtendedSearch,this._keyStore=new Ye(this.options.keys),this.setCollection(e,r)}setCollection(e,s){if(this._docs=e,s&&!(s instanceof q))throw new Error(He);this._myIndex=s||Ee(this.options.keys,this._docs,{getFn:this.options.getFn,fieldNormWeight:this.options.fieldNormWeight})}add(e){x(e)&&(this._docs.push(e),this._myIndex.add(e))}remove(e=()=>!1){const s=[];for(let r=0,n=this._docs.length;r<n;r+=1){const i=this._docs[r];e(i,r)&&(this.removeAt(r),r-=1,n-=1,s.push(i))}return s}removeAt(e){this._docs.splice(e,1),this._myIndex.removeAt(e)}getIndex(){return this._myIndex}search(e,{limit:s=-1}={}){const{includeMatches:r,includeScore:n,shouldSort:i,sortFn:c,ignoreFieldNorm:o}=this.options;let a=_(e)?_(this._docs[0])?this._searchStringList(e):this._searchObjectList(e):this._searchLogical(e);return St(a,{ignoreFieldNorm:o}),i&&a.sort(c),Me(s)&&s>-1&&(a=a.slice(0,s)),bt(a,this._docs,{includeMatches:r,includeScore:n})}_searchStringList(e){const s=G(e,this.options),{records:r}=this._myIndex,n=[];return r.forEach(({v:i,i:c,n:o})=>{if(!x(i))return;const{isMatch:a,score:h,indices:l}=s.searchIn(i);a&&n.push({item:i,idx:c,matches:[{score:h,value:i,norm:o,indices:l}]})}),n}_searchLogical(e){const s=we(e,this.options),r=(o,a,h)=>{if(!o.children){const{keyId:u,searcher:d}=o,g=this._findMatches({key:this._keyStore.get(u),value:this._myIndex.getValueForItemAtKeyId(a,u),searcher:d});return g&&g.length?[{idx:h,item:a,matches:g}]:[]}const l=[];for(let u=0,d=o.children.length;u<d;u+=1){const g=o.children[u],p=r(g,a,h);if(p.length)l.push(...p);else if(o.operator===N.AND)return[]}return l},n=this._myIndex.records,i={},c=[];return n.forEach(({$:o,i:a})=>{if(x(o)){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}_searchObjectList(e){const s=G(e,this.options),{keys:r,records:n}=this._myIndex,i=[];return n.forEach(({$:c,i:o})=>{if(!x(c))return;let a=[];r.forEach((h,l)=>{a.push(...this._findMatches({key:h,value:c[l],searcher:s}))}),a.length&&i.push({idx:o,item:c,matches:a})}),i}_findMatches({key:e,value:s,searcher:r}){if(!x(s))return[];let n=[];if(I(s))s.forEach(({v:i,i:c,n:o})=>{if(!x(i))return;const{isMatch:a,score:h,indices:l}=r.searchIn(i);a&&n.push({score:h,key:e,value:i,idx:c,norm:o,indices:l})});else{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}}v.version="7.0.0";v.createIndex=Ee;v.parseIndex=st;v.config=f;v.parseQuery=we;Mt(mt);const It={threshold:.3},Ae=t=>e=>{const s=new v(e,{keys:Object.keys(e[0]),...It,...t});return{type:"fuse",page:(r,n)=>e.slice(r*n,(r+1)*n),search:r=>s.search(r).map(({item:n})=>n),retrieve:r=>e.filter(n=>r.includes(n.key))}},wt=Ae(),Oe=({term:t,searcher:e=wt})=>me(({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}),Ce=({debounce:t=250,value:e,onChange:s,transformBefore:r})=>{const[n,i]=he.usePurePassthrough({onChange:s,value:e,initial:""}),{setTransform:c,deleteTransform:o}=m.useDataUtilContext(),a=m.useDebouncedCallback(c,t,[]),h=ve.useCallback(l=>{i(l),l.length===0?o("filter"):(r!=null&&(l=r(l)),a("filter",Oe({term:l})))},[i,r]);return{value:n,onChange:h}},Le=({children:t=s=>ke.jsxRuntimeExports.jsx(m.Text$1,{placeholder:"Filter",...s}),...e})=>t(Ce(e)),At=Object.freeze(Object.defineProperty({__proto__:null,Column:m.Column,ColumnContext:m.ColumnContext,Core:m.Core,DataProvider:m.DataProvider,Filter:Le,Hover:m.Hover,ItemFrame:m.ItemFrame,List:$e.List,Search:m.Search,Selector:m.Selector,selectValueIsZero:m.selectValueIsZero,useDataContext:m.useDataContext,useDataUtilContext:m.useDataUtilContext,useFilter:Ce,useGetTransformedData:m.useGetTransformedData,useHoverContext:m.useHoverContext,useSearch:m.useSearch,useSelect:m.useSelect,useSelection:m.useSelection,useSelectionContext:m.useSelectionContext,useSelectionUtils:m.useSelectionUtils,useSetSourceData:m.useSetSourceData,useSourceData:m.useSourceData,useTransformedData:m.useTransformedData},Symbol.toStringTag,{value:"Module"}));exports.Filter=Le;exports.createFilterTransform=Oe;exports.external=At;exports.fuseFilter=Ae;exports.proxyMemo=me;

package/dist/{external-Clb-pmsS.cjs → external-Cl_evqYY.cjs}

@@ -1 +1 @@
-"use strict";const e=require("./Pack-BgzS2BHo.cjs"),r=Object.freeze(Object.defineProperty({__proto__:null,ALIGNMENTS:e.ALIGNMENTS,Center:e.Center,CoreCenter:e.CoreCenter,JUSTIFICATIONS:e.JUSTIFICATIONS,Pack:e.Pack,Space:e.Space,shouldReverse:e.shouldReverse},Symbol.toStringTag,{value:"Module"}));exports.external=r;
+"use strict";const e=require("./Pack-C_SrDA3a.cjs"),r=Object.freeze(Object.defineProperty({__proto__:null,ALIGNMENTS:e.ALIGNMENTS,Center:e.Center,CoreCenter:e.CoreCenter,JUSTIFICATIONS:e.JUSTIFICATIONS,Pack:e.Pack,Space:e.Space,shouldReverse:e.shouldReverse},Symbol.toStringTag,{value:"Module"}));exports.external=r;