@synnaxlabs/pluto 0.38.2 → 0.39.1

package/dist/external-CjZqwgDh.js

@@ -0,0 +1,1265 @@
+import { a as ce, b as Ye, T, c as We, C as ze, D as He, H as Ve, I as Ue, L as Ge, S as Je, s as Qe, d as Xe, e as Ze, f as qe, g as et, h as tt, i as st, u as rt, j as nt, k as it, l as ut } from "./Text-DT2rIwXL.js";
+import { j as C } from "./jsx-runtime-CYK1ROHF.js";
+import { useCallback as X, useRef as H, useEffect as de } from "react";
+import { S as ct, k as De } from "./state-w46WTrh-.js";
+import { u as Me } from "./useDebouncedCallback-DDLuEZa8.js";
+import { T as Be } from "./Text-B3pNXYhh.js";
+import { f as ot, E as at } from "./Divider-C5m3c4pv.js";
+import "./aggregator-5XpEdQtr.js";
+import "./Pack-D50qN0Vu.js";
+import "./css-rxwBYwM1.js";
+import "./Toggle-DZMcFiiI.js";
+const _e = Symbol(), oe = Symbol(), L = "a", N = "w";
+let lt = (t, e) => new Proxy(t, e);
+const Z = Object.getPrototypeOf, ge = /* @__PURE__ */ new WeakMap(), ae = (t) => t && (ge.has(t) ? ge.get(t) : Z(t) === Object.prototype || Z(t) === Array.prototype), pe = (t) => typeof t == "object" && t !== null, Ae = /* @__PURE__ */ new WeakMap(), Se = (t) => t[oe] || t, xe = (t, e, s) => {
+  if (!ae(t)) return t;
+  const r = Se(t), n = ((u) => Object.isFrozen(u) || Object.values(Object.getOwnPropertyDescriptors(u)).some((c) => !c.writable))(r);
+  let i = s && s.get(r);
+  return i && i[1].f === n || (i = ((u, c) => {
+    const o = { f: c };
+    let a = !1;
+    const l = (h, f) => {
+      if (!a) {
+        let p = o[L].get(u);
+        if (p || (p = {}, o[L].set(u, p)), h === N) p[N] = !0;
+        else {
+          let A = p[h];
+          A || (A = /* @__PURE__ */ new Set(), p[h] = A), A.add(f);
+        }
+      }
+    }, g = { get: (h, f) => f === oe ? u : (l("k", f), xe(Reflect.get(h, f), o[L], o.c)), has: (h, f) => f === _e ? (a = !0, o[L].delete(u), !0) : (l("h", f), Reflect.has(h, f)), getOwnPropertyDescriptor: (h, f) => (l("o", f), Reflect.getOwnPropertyDescriptor(h, f)), ownKeys: (h) => (l(N), Reflect.ownKeys(h)) };
+    return c && (g.set = g.deleteProperty = () => !1), [g, o];
+  })(r, n), i[1].p = lt(n ? ((u) => {
+    let c = Ae.get(u);
+    if (!c) {
+      if (Array.isArray(u)) c = Array.from(u);
+      else {
+        const o = Object.getOwnPropertyDescriptors(u);
+        Object.values(o).forEach((a) => {
+          a.configurable = !0;
+        }), c = Object.create(Z(u), o);
+      }
+      Ae.set(u, c);
+    }
+    return c;
+  })(r) : r, i[0]), s && s.set(r, i)), i[1][L] = e, i[1].c = s, i[1].p;
+}, Re = (t, e, s, r) => {
+  if (Object.is(t, e)) return !1;
+  if (!pe(t) || !pe(e)) return !0;
+  const n = s.get(Se(t));
+  if (!n) return !0;
+  if (r) {
+    const u = r.get(t);
+    if (u && u.n === e) return u.g;
+    r.set(t, { n: e, g: !1 });
+  }
+  let i = null;
+  try {
+    for (const u of n.h || []) if (i = Reflect.has(t, u) !== Reflect.has(e, u), i) return i;
+    if (n[N] === !0) {
+      if (i = ((u, c) => {
+        const o = Reflect.ownKeys(u), a = Reflect.ownKeys(c);
+        return o.length !== a.length || o.some((l, g) => l !== a[g]);
+      })(t, e), i) return i;
+    } else for (const u of n.o || []) if (i = !!Reflect.getOwnPropertyDescriptor(t, u) != !!Reflect.getOwnPropertyDescriptor(e, u), i) return i;
+    for (const u of n.k || []) if (i = Re(t[u], e[u], s, r), i) return i;
+    return i === null && (i = !0), i;
+  } finally {
+    r && r.set(t, { n: e, g: i });
+  }
+}, ht = (t) => !!ae(t) && _e in t, Oe = (t) => ae(t) && t[oe] || null, ft = "h", dt = "w", gt = "o", pt = "k", q = (t) => typeof t == "object" && t !== null, we = (t, e) => {
+  if (!q(t)) return t;
+  const s = Oe(t);
+  return s !== null ? (ht(t), s) : (e.has(t) || (e.add(t), Object.entries(t).forEach(([r, n]) => {
+    const i = we(n, e);
+    Object.is(i, n) || (t[r] = i);
+  })), t);
+}, ee = (t, e, s) => {
+  var r, n, i;
+  if (!q(t) || !q(e)) return;
+  const u = s.get(Oe(e) || e);
+  u && ((r = u[ft]) == null || r.forEach((c) => {
+    Reflect.has(t, c);
+  }), u[dt] === !0 && Reflect.ownKeys(t), (n = u[gt]) == null || n.forEach((c) => {
+    Reflect.getOwnPropertyDescriptor(t, c);
+  }), (i = u[pt]) == null || i.forEach((c) => {
+    ee(t[c], e[c], s);
+  }));
+}, V = "o", U = "r", G = "a";
+function At(t, e) {
+  var s;
+  let r = 0;
+  const n = (s = e == null ? void 0 : e.size) != null ? s : 1, i = [], u = e != null && e.noWeakMap ? null : /* @__PURE__ */ new WeakMap();
+  return (o) => {
+    const a = u == null ? void 0 : u.get(o);
+    if (a)
+      return a[U];
+    for (let p = 0; p < n; p += 1) {
+      const A = i[(r + p) % n];
+      if (!A) break;
+      if (!Re(A[V], o, A[G], /* @__PURE__ */ new WeakMap()))
+        return ee(o, A[V], A[G]), u == null || u.set(o, A), A[U];
+    }
+    const l = /* @__PURE__ */ new WeakMap(), g = xe(o, l), h = we(t(g), /* @__PURE__ */ new Set());
+    ee(o, o, l);
+    const f = {
+      [V]: o,
+      [U]: h,
+      [G]: l
+    };
+    return r = (r - 1 + n) % n, i[r] = f, u == null || u.set(o, f), h;
+  };
+}
+const Et = (t, e) => ct.RUNTIME === "browser" ? At(t, e) : t;
+function x(t) {
+  return Array.isArray ? Array.isArray(t) : ve(t) === "[object Array]";
+}
+function mt(t) {
+  if (typeof t == "string")
+    return t;
+  let e = t + "";
+  return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
+}
+function Ct(t) {
+  return t == null ? "" : mt(t);
+}
+function S(t) {
+  return typeof t == "string";
+}
+function Ie(t) {
+  return typeof t == "number";
+}
+function yt(t) {
+  return t === !0 || t === !1 || Ft(t) && ve(t) == "[object Boolean]";
+}
+function be(t) {
+  return typeof t == "object";
+}
+function Ft(t) {
+  return be(t) && t !== null;
+}
+function D(t) {
+  return t != null;
+}
+function J(t) {
+  return !t.trim().length;
+}
+function ve(t) {
+  return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(t);
+}
+const Dt = "Incorrect 'index' type", Mt = (t) => `Invalid value for key ${t}`, Bt = (t) => `Pattern length exceeds max of ${t}.`, _t = (t) => `Missing ${t} property in key`, St = (t) => `Property 'weight' in key '${t}' must be a positive integer`, Ee = Object.prototype.hasOwnProperty;
+class xt {
+  constructor(e) {
+    this._keys = [], this._keyMap = {};
+    let s = 0;
+    e.forEach((r) => {
+      let n = Pe(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 Pe(t) {
+  let e = null, s = null, r = null, n = 1, i = null;
+  if (S(t) || x(t))
+    r = t, e = me(t), s = te(t);
+  else {
+    if (!Ee.call(t, "name"))
+      throw new Error(_t("name"));
+    const u = t.name;
+    if (r = u, Ee.call(t, "weight") && (n = t.weight, n <= 0))
+      throw new Error(St(u));
+    e = me(u), s = te(u), i = t.getFn;
+  }
+  return { path: e, id: s, weight: n, src: r, getFn: i };
+}
+function me(t) {
+  return x(t) ? t : t.split(".");
+}
+function te(t) {
+  return x(t) ? t.join(".") : t;
+}
+function Rt(t, e) {
+  let s = [], r = !1;
+  const n = (i, u, c) => {
+    if (D(i))
+      if (!u[c])
+        s.push(i);
+      else {
+        let o = u[c];
+        const a = i[o];
+        if (!D(a))
+          return;
+        if (c === u.length - 1 && (S(a) || Ie(a) || yt(a)))
+          s.push(Ct(a));
+        else if (x(a)) {
+          r = !0;
+          for (let l = 0, g = a.length; l < g; l += 1)
+            n(a[l], u, c + 1);
+        } else u.length && n(a, u, c + 1);
+      }
+  };
+  return n(t, S(e) ? e.split(".") : e, 0), r ? s : s[0];
+}
+const Ot = {
+  // 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.
+  includeMatches: !1,
+  // When `true`, the matching function will continue to the end of a search pattern even if
+  // a perfect match has already been located in the string.
+  findAllMatches: !1,
+  // Minimum number of characters that must be matched before a result is considered a match
+  minMatchCharLength: 1
+}, wt = {
+  // 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,
+  // When `true`, the algorithm will ignore diacritics (accents) in comparisons
+  ignoreDiacritics: !1,
+  // When true, the matching function will continue to the end of a search pattern even if
+  includeScore: !1,
+  // List of properties that will be searched. This also supports nested properties.
+  keys: [],
+  // Whether to sort the result list, by score
+  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
+}, It = {
+  // 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
+  // (of both letters and location), a threshold of '1.0' would match anything.
+  threshold: 0.6,
+  // Determines how close the match must be to the fuzzy location (specified above).
+  // An exact letter match which is 'distance' characters away from the fuzzy location
+  // would score as a complete mismatch. A distance of '0' requires the match be at
+  // 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
+}, bt = {
+  // 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: Rt,
+  // 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
+  ignoreLocation: !1,
+  // When `true`, the calculation for the relevance score (used for sorting) will
+  // ignore the field-length norm.
+  // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm
+  ignoreFieldNorm: !1,
+  // The weight to determine how much field length norm effects scoring.
+  fieldNormWeight: 1
+};
+var d = {
+  ...wt,
+  ...Ot,
+  ...It,
+  ...bt
+};
+const vt = /[^ ]+/g;
+function Pt(t = 1, e = 3) {
+  const s = /* @__PURE__ */ new Map(), r = Math.pow(10, e);
+  return {
+    get(n) {
+      const i = n.match(vt).length;
+      if (s.has(i))
+        return s.get(i);
+      const u = 1 / Math.pow(i, 0.5 * t), c = parseFloat(Math.round(u * r) / r);
+      return s.set(i, c), c;
+    },
+    clear() {
+      s.clear();
+    }
+  };
+}
+class le {
+  constructor({
+    getFn: e = d.getFn,
+    fieldNormWeight: s = d.fieldNormWeight
+  } = {}) {
+    this.norm = Pt(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, S(this.docs[0]) ? this.docs.forEach((e, s) => {
+      this._addString(e, s);
+    }) : this.docs.forEach((e, s) => {
+      this._addObject(e, s);
+    }), this.norm.clear());
+  }
+  // Adds a doc to the end of the index
+  add(e) {
+    const s = this.size();
+    S(e) ? this._addString(e, s) : this._addObject(e, s);
+  }
+  // Removes the doc at the specified index of the index
+  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 (!D(e) || J(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 u = n.getFn ? n.getFn(e) : this.getFn(e, n.path);
+      if (D(u)) {
+        if (x(u)) {
+          let c = [];
+          const o = [{ nestedArrIndex: -1, value: u }];
+          for (; o.length; ) {
+            const { nestedArrIndex: a, value: l } = o.pop();
+            if (D(l))
+              if (S(l) && !J(l)) {
+                let g = {
+                  v: l,
+                  i: a,
+                  n: this.norm.get(l)
+                };
+                c.push(g);
+              } else x(l) && l.forEach((g, h) => {
+                o.push({
+                  nestedArrIndex: h,
+                  value: g
+                });
+              });
+          }
+          r.$[i] = c;
+        } else if (S(u) && !J(u)) {
+          let c = {
+            v: u,
+            n: this.norm.get(u)
+          };
+          r.$[i] = c;
+        }
+      }
+    }), this.records.push(r);
+  }
+  toJSON() {
+    return {
+      keys: this.keys,
+      records: this.records
+    };
+  }
+}
+function ke(t, e, { getFn: s = d.getFn, fieldNormWeight: r = d.fieldNormWeight } = {}) {
+  const n = new le({ getFn: s, fieldNormWeight: r });
+  return n.setKeys(t.map(Pe)), n.setSources(e), n.create(), n;
+}
+function kt(t, { getFn: e = d.getFn, fieldNormWeight: s = d.fieldNormWeight } = {}) {
+  const { keys: r, records: n } = t, i = new le({ getFn: e, fieldNormWeight: s });
+  return i.setKeys(r), i.setIndexRecords(n), i;
+}
+function $(t, {
+  errors: e = 0,
+  currentLocation: s = 0,
+  expectedLocation: r = 0,
+  distance: n = d.distance,
+  ignoreLocation: i = d.ignoreLocation
+} = {}) {
+  const u = e / t.length;
+  if (i)
+    return u;
+  const c = Math.abs(r - s);
+  return n ? u + c / n : c ? 1 : u;
+}
+function Lt(t = [], e = d.minMatchCharLength) {
+  let s = [], r = -1, n = -1, i = 0;
+  for (let u = t.length; i < u; i += 1) {
+    let c = t[i];
+    c && r === -1 ? r = i : !c && 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 v = 32;
+function Tt(t, e, s, {
+  location: r = d.location,
+  distance: n = d.distance,
+  threshold: i = d.threshold,
+  findAllMatches: u = d.findAllMatches,
+  minMatchCharLength: c = d.minMatchCharLength,
+  includeMatches: o = d.includeMatches,
+  ignoreLocation: a = d.ignoreLocation
+} = {}) {
+  if (e.length > v)
+    throw new Error(Bt(v));
+  const l = e.length, g = t.length, h = Math.max(0, Math.min(r, g));
+  let f = i, p = h;
+  const A = c > 1 || o, y = A ? Array(g) : [];
+  let F;
+  for (; (F = t.indexOf(e, p)) > -1; ) {
+    let m = $(e, {
+      currentLocation: F,
+      expectedLocation: h,
+      distance: n,
+      ignoreLocation: a
+    });
+    if (f = Math.min(m, f), p = F + l, A) {
+      let O = 0;
+      for (; O < l; )
+        y[F + O] = 1, O += 1;
+    }
+  }
+  p = -1;
+  let M = [], R = 1, E = l + g;
+  const b = 1 << l - 1;
+  for (let m = 0; m < l; m += 1) {
+    let O = 0, w = E;
+    for (; O < w; )
+      $(e, {
+        errors: m,
+        currentLocation: h + w,
+        expectedLocation: h,
+        distance: n,
+        ignoreLocation: a
+      }) <= f ? O = w : E = w, w = Math.floor((E - O) / 2 + O);
+    E = w;
+    let he = Math.max(1, h - w + 1), z = u ? g : Math.min(h + w, g) + l, P = Array(z + 2);
+    P[z + 1] = (1 << m) - 1;
+    for (let _ = z; _ >= he; _ -= 1) {
+      let j = _ - 1, fe = s[t.charAt(j)];
+      if (A && (y[j] = +!!fe), P[_] = (P[_ + 1] << 1 | 1) & fe, m && (P[_] |= (M[_ + 1] | M[_]) << 1 | 1 | M[_ + 1]), P[_] & b && (R = $(e, {
+        errors: m,
+        currentLocation: j,
+        expectedLocation: h,
+        distance: n,
+        ignoreLocation: a
+      }), R <= f)) {
+        if (f = R, p = j, p <= h)
+          break;
+        he = Math.max(1, 2 * h - p);
+      }
+    }
+    if ($(e, {
+      errors: m + 1,
+      currentLocation: h,
+      expectedLocation: h,
+      distance: n,
+      ignoreLocation: a
+    }) > f)
+      break;
+    M = P;
+  }
+  const B = {
+    isMatch: p >= 0,
+    // Count exact matches (those with a score of 0) to be "almost" exact
+    score: Math.max(1e-3, R)
+  };
+  if (A) {
+    const m = Lt(y, c);
+    m.length ? o && (B.indices = m) : B.isMatch = !1;
+  }
+  return B;
+}
+function jt(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;
+}
+const K = String.prototype.normalize ? (t) => t.normalize("NFD").replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g, "") : (t) => t;
+class Le {
+  constructor(e, {
+    location: s = d.location,
+    threshold: r = d.threshold,
+    distance: n = d.distance,
+    includeMatches: i = d.includeMatches,
+    findAllMatches: u = d.findAllMatches,
+    minMatchCharLength: c = d.minMatchCharLength,
+    isCaseSensitive: o = d.isCaseSensitive,
+    ignoreDiacritics: a = d.ignoreDiacritics,
+    ignoreLocation: l = d.ignoreLocation
+  } = {}) {
+    if (this.options = {
+      location: s,
+      threshold: r,
+      distance: n,
+      includeMatches: i,
+      findAllMatches: u,
+      minMatchCharLength: c,
+      isCaseSensitive: o,
+      ignoreDiacritics: a,
+      ignoreLocation: l
+    }, e = o ? e : e.toLowerCase(), e = a ? K(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length)
+      return;
+    const g = (f, p) => {
+      this.chunks.push({
+        pattern: f,
+        alphabet: jt(f),
+        startIndex: p
+      });
+    }, h = this.pattern.length;
+    if (h > v) {
+      let f = 0;
+      const p = h % v, A = h - p;
+      for (; f < A; )
+        g(this.pattern.substr(f, v), f), f += v;
+      if (p) {
+        const y = h - v;
+        g(this.pattern.substr(y), y);
+      }
+    } else
+      g(this.pattern, 0);
+  }
+  searchIn(e) {
+    const { isCaseSensitive: s, ignoreDiacritics: r, includeMatches: n } = this.options;
+    if (e = s ? e : e.toLowerCase(), e = r ? K(e) : e, this.pattern === e) {
+      let A = {
+        isMatch: !0,
+        score: 0
+      };
+      return n && (A.indices = [[0, e.length - 1]]), A;
+    }
+    const {
+      location: i,
+      distance: u,
+      threshold: c,
+      findAllMatches: o,
+      minMatchCharLength: a,
+      ignoreLocation: l
+    } = this.options;
+    let g = [], h = 0, f = !1;
+    this.chunks.forEach(({ pattern: A, alphabet: y, startIndex: F }) => {
+      const { isMatch: M, score: R, indices: E } = Tt(e, A, y, {
+        location: i + F,
+        distance: u,
+        threshold: c,
+        findAllMatches: o,
+        minMatchCharLength: a,
+        includeMatches: n,
+        ignoreLocation: l
+      });
+      M && (f = !0), h += R, M && E && (g = [...g, ...E]);
+    });
+    let p = {
+      isMatch: f,
+      score: f ? h / this.chunks.length : 1
+    };
+    return f && n && (p.indices = g), p;
+  }
+}
+class I {
+  constructor(e) {
+    this.pattern = e;
+  }
+  static isMultiMatch(e) {
+    return Ce(e, this.multiRegex);
+  }
+  static isSingleMatch(e) {
+    return Ce(e, this.singleRegex);
+  }
+  search() {
+  }
+}
+function Ce(t, e) {
+  const s = t.match(e);
+  return s ? s[1] : null;
+}
+class $t extends I {
+  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 Nt extends I {
+  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 Kt extends I {
+  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 Yt extends I {
+  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 Wt extends I {
+  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 zt extends I {
+  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 Te extends I {
+  constructor(e, {
+    location: s = d.location,
+    threshold: r = d.threshold,
+    distance: n = d.distance,
+    includeMatches: i = d.includeMatches,
+    findAllMatches: u = d.findAllMatches,
+    minMatchCharLength: c = d.minMatchCharLength,
+    isCaseSensitive: o = d.isCaseSensitive,
+    ignoreDiacritics: a = d.ignoreDiacritics,
+    ignoreLocation: l = d.ignoreLocation
+  } = {}) {
+    super(e), this._bitapSearch = new Le(e, {
+      location: s,
+      threshold: r,
+      distance: n,
+      includeMatches: i,
+      findAllMatches: u,
+      minMatchCharLength: c,
+      isCaseSensitive: o,
+      ignoreDiacritics: a,
+      ignoreLocation: l
+    });
+  }
+  static get type() {
+    return "fuzzy";
+  }
+  static get multiRegex() {
+    return /^"(.*)"$/;
+  }
+  static get singleRegex() {
+    return /^(.*)$/;
+  }
+  search(e) {
+    return this._bitapSearch.searchIn(e);
+  }
+}
+class je extends I {
+  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 u = !!n.length;
+    return {
+      isMatch: u,
+      score: u ? 0 : 1,
+      indices: n
+    };
+  }
+}
+const se = [
+  $t,
+  je,
+  Kt,
+  Yt,
+  zt,
+  Wt,
+  Nt,
+  Te
+], ye = se.length, Ht = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Vt = "|";
+function Ut(t, e = {}) {
+  return t.split(Vt).map((s) => {
+    let r = s.trim().split(Ht).filter((i) => i && !!i.trim()), n = [];
+    for (let i = 0, u = r.length; i < u; i += 1) {
+      const c = r[i];
+      let o = !1, a = -1;
+      for (; !o && ++a < ye; ) {
+        const l = se[a];
+        let g = l.isMultiMatch(c);
+        g && (n.push(new l(g, e)), o = !0);
+      }
+      if (!o)
+        for (a = -1; ++a < ye; ) {
+          const l = se[a];
+          let g = l.isSingleMatch(c);
+          if (g) {
+            n.push(new l(g, e));
+            break;
+          }
+        }
+    }
+    return n;
+  });
+}
+const Gt = /* @__PURE__ */ new Set([Te.type, je.type]);
+class Jt {
+  constructor(e, {
+    isCaseSensitive: s = d.isCaseSensitive,
+    ignoreDiacritics: r = d.ignoreDiacritics,
+    includeMatches: n = d.includeMatches,
+    minMatchCharLength: i = d.minMatchCharLength,
+    ignoreLocation: u = d.ignoreLocation,
+    findAllMatches: c = d.findAllMatches,
+    location: o = d.location,
+    threshold: a = d.threshold,
+    distance: l = d.distance
+  } = {}) {
+    this.query = null, this.options = {
+      isCaseSensitive: s,
+      ignoreDiacritics: r,
+      includeMatches: n,
+      minMatchCharLength: i,
+      findAllMatches: c,
+      ignoreLocation: u,
+      location: o,
+      threshold: a,
+      distance: l
+    }, e = s ? e : e.toLowerCase(), e = r ? K(e) : e, this.pattern = e, this.query = Ut(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, ignoreDiacritics: i } = this.options;
+    e = n ? e : e.toLowerCase(), e = i ? K(e) : e;
+    let u = 0, c = [], o = 0;
+    for (let a = 0, l = s.length; a < l; a += 1) {
+      const g = s[a];
+      c.length = 0, u = 0;
+      for (let h = 0, f = g.length; h < f; h += 1) {
+        const p = g[h], { isMatch: A, indices: y, score: F } = p.search(e);
+        if (A) {
+          if (u += 1, o += F, r) {
+            const M = p.constructor.type;
+            Gt.has(M) ? c = [...c, ...y] : c.push(y);
+          }
+        } else {
+          o = 0, u = 0, c.length = 0;
+          break;
+        }
+      }
+      if (u) {
+        let h = {
+          isMatch: !0,
+          score: o / u
+        };
+        return r && (h.indices = c), h;
+      }
+    }
+    return {
+      isMatch: !1,
+      score: 1
+    };
+  }
+}
+const re = [];
+function Qt(...t) {
+  re.push(...t);
+}
+function ne(t, e) {
+  for (let s = 0, r = re.length; s < r; s += 1) {
+    let n = re[s];
+    if (n.condition(t, e))
+      return new n(t, e);
+  }
+  return new Le(t, e);
+}
+const Y = {
+  AND: "$and",
+  OR: "$or"
+}, ie = {
+  PATH: "$path",
+  PATTERN: "$val"
+}, ue = (t) => !!(t[Y.AND] || t[Y.OR]), Xt = (t) => !!t[ie.PATH], Zt = (t) => !x(t) && be(t) && !ue(t), Fe = (t) => ({
+  [Y.AND]: Object.keys(t).map((e) => ({
+    [e]: t[e]
+  }))
+});
+function $e(t, e, { auto: s = !0 } = {}) {
+  const r = (n) => {
+    let i = Object.keys(n);
+    const u = Xt(n);
+    if (!u && i.length > 1 && !ue(n))
+      return r(Fe(n));
+    if (Zt(n)) {
+      const o = u ? n[ie.PATH] : i[0], a = u ? n[ie.PATTERN] : n[o];
+      if (!S(a))
+        throw new Error(Mt(o));
+      const l = {
+        keyId: te(o),
+        pattern: a
+      };
+      return s && (l.searcher = ne(a, e)), l;
+    }
+    let c = {
+      children: [],
+      operator: i[0]
+    };
+    return i.forEach((o) => {
+      const a = n[o];
+      x(a) && a.forEach((l) => {
+        c.children.push(r(l));
+      });
+    }), c;
+  };
+  return ue(t) || (t = Fe(t)), r(t);
+}
+function qt(t, { ignoreFieldNorm: e = d.ignoreFieldNorm }) {
+  t.forEach((s) => {
+    let r = 1;
+    s.matches.forEach(({ key: n, norm: i, score: u }) => {
+      const c = n ? n.weight : null;
+      r *= Math.pow(
+        u === 0 && c ? Number.EPSILON : u,
+        (c || 1) * (e ? 1 : i)
+      );
+    }), s.score = r;
+  });
+}
+function es(t, e) {
+  const s = t.matches;
+  e.matches = [], D(s) && s.forEach((r) => {
+    if (!D(r.indices) || !r.indices.length)
+      return;
+    const { indices: n, value: i } = r;
+    let u = {
+      indices: n,
+      value: i
+    };
+    r.key && (u.key = r.key.src), r.idx > -1 && (u.refIndex = r.idx), e.matches.push(u);
+  });
+}
+function ts(t, e) {
+  e.score = t.score;
+}
+function ss(t, e, {
+  includeMatches: s = d.includeMatches,
+  includeScore: r = d.includeScore
+} = {}) {
+  const n = [];
+  return s && n.push(es), r && n.push(ts), t.map((i) => {
+    const { idx: u } = i, c = {
+      item: e[u],
+      refIndex: u
+    };
+    return n.length && n.forEach((o) => {
+      o(i, c);
+    }), c;
+  });
+}
+class k {
+  constructor(e, s = {}, r) {
+    this.options = { ...d, ...s }, this.options.useExtendedSearch, this._keyStore = new xt(this.options.keys), this.setCollection(e, r);
+  }
+  setCollection(e, s) {
+    if (this._docs = e, s && !(s instanceof le))
+      throw new Error(Dt);
+    this._myIndex = s || ke(this.options.keys, this._docs, {
+      getFn: this.options.getFn,
+      fieldNormWeight: this.options.fieldNormWeight
+    });
+  }
+  add(e) {
+    D(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: u,
+      ignoreFieldNorm: c
+    } = this.options;
+    let o = S(e) ? S(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
+    return qt(o, { ignoreFieldNorm: c }), i && o.sort(u), Ie(s) && s > -1 && (o = o.slice(0, s)), ss(o, this._docs, {
+      includeMatches: r,
+      includeScore: n
+    });
+  }
+  _searchStringList(e) {
+    const s = ne(e, this.options), { records: r } = this._myIndex, n = [];
+    return r.forEach(({ v: i, i: u, n: c }) => {
+      if (!D(i))
+        return;
+      const { isMatch: o, score: a, indices: l } = s.searchIn(i);
+      o && n.push({
+        item: i,
+        idx: u,
+        matches: [{ score: a, value: i, norm: c, indices: l }]
+      });
+    }), n;
+  }
+  _searchLogical(e) {
+    const s = $e(e, this.options), r = (c, o, a) => {
+      if (!c.children) {
+        const { keyId: g, searcher: h } = c, f = this._findMatches({
+          key: this._keyStore.get(g),
+          value: this._myIndex.getValueForItemAtKeyId(o, g),
+          searcher: h
+        });
+        return f && f.length ? [
+          {
+            idx: a,
+            item: o,
+            matches: f
+          }
+        ] : [];
+      }
+      const l = [];
+      for (let g = 0, h = c.children.length; g < h; g += 1) {
+        const f = c.children[g], p = r(f, o, a);
+        if (p.length)
+          l.push(...p);
+        else if (c.operator === Y.AND)
+          return [];
+      }
+      return l;
+    }, n = this._myIndex.records, i = {}, u = [];
+    return n.forEach(({ $: c, i: o }) => {
+      if (D(c)) {
+        let a = r(s, c, o);
+        a.length && (i[o] || (i[o] = { idx: o, item: c, matches: [] }, u.push(i[o])), a.forEach(({ matches: l }) => {
+          i[o].matches.push(...l);
+        }));
+      }
+    }), u;
+  }
+  _searchObjectList(e) {
+    const s = ne(e, this.options), { keys: r, records: n } = this._myIndex, i = [];
+    return n.forEach(({ $: u, i: c }) => {
+      if (!D(u))
+        return;
+      let o = [];
+      r.forEach((a, l) => {
+        o.push(
+          ...this._findMatches({
+            key: a,
+            value: u[l],
+            searcher: s
+          })
+        );
+      }), o.length && i.push({
+        idx: c,
+        item: u,
+        matches: o
+      });
+    }), i;
+  }
+  _findMatches({ key: e, value: s, searcher: r }) {
+    if (!D(s))
+      return [];
+    let n = [];
+    if (x(s))
+      s.forEach(({ v: i, i: u, n: c }) => {
+        if (!D(i))
+          return;
+        const { isMatch: o, score: a, indices: l } = r.searchIn(i);
+        o && n.push({
+          score: a,
+          key: e,
+          value: i,
+          idx: u,
+          norm: c,
+          indices: l
+        });
+      });
+    else {
+      const { v: i, n: u } = s, { isMatch: c, score: o, indices: a } = r.searchIn(i);
+      c && n.push({ score: o, key: e, value: i, norm: u, indices: a });
+    }
+    return n;
+  }
+}
+k.version = "7.1.0";
+k.createIndex = ke;
+k.parseIndex = kt;
+k.config = d;
+k.parseQuery = $e;
+Qt(Jt);
+const rs = {
+  threshold: 0.3
+}, ns = (t) => (e) => {
+  const s = new k(e, {
+    keys: Object.keys(e[0]),
+    ...rs,
+    ...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))
+  };
+}, is = ns(), us = ({
+  term: t,
+  searcher: e = is
+}) => Et(({ 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 }), Ne = ({
+  debounce: t = 250,
+  value: e,
+  onChange: s,
+  transformBefore: r
+}) => {
+  const [n, i] = De({
+    onChange: s,
+    value: e,
+    initial: ""
+  }), { setTransform: u, deleteTransform: c } = ce(), o = Me(u, t, []), a = X(
+    (l) => {
+      i(l), l.length === 0 ? c("filter") : (r != null && (l = r(l)), o("filter", us({ term: l })));
+    },
+    [i, r]
+  );
+  return { value: n, onChange: a };
+}, cs = ({
+  children: t = (s) => /* @__PURE__ */ C.jsx(Be, { placeholder: "Filter", ...s }),
+  ...e
+}) => t(Ne(e)), W = {
+  height: 150
+}, Q = () => /* @__PURE__ */ C.jsx(T.Centered, { level: "h4", variant: "disabled", hideIcon: !0, style: W, children: "No Results" }), os = () => /* @__PURE__ */ C.jsx(T.Centered, { level: "h4", variant: "disabled", hideIcon: !0, style: W, children: "Type to search" }), as = () => /* @__PURE__ */ C.jsx(T.Centered, { level: "h2", variant: "disabled", hideIcon: !0, style: W, children: /* @__PURE__ */ C.jsx(at.Loading, {}) }), ls = ({ error: t }) => /* @__PURE__ */ C.jsx(T.Centered, { level: "h4", variant: "error", style: W, children: t.message }), hs = (t) => t, Ke = ({
+  debounce: t = 250,
+  searcher: e,
+  value: s,
+  onChange: r,
+  pageSize: n = 15,
+  filter: i = hs
+}) => {
+  const [u, c] = De({
+    value: s,
+    onChange: r,
+    initial: ""
+  }), o = ot(u), a = H(!1), l = H(!0), g = H(0), { setSourceData: h, setEmptyContent: f, getDefaultEmptyContent: p } = ce(), { setHasMore: A, setOnFetchMore: y } = Ye();
+  de(() => f(/* @__PURE__ */ C.jsx(os, {})), [f]);
+  const F = X(
+    (E = !1) => {
+      if (o.current.length > 0 || a.current || e == null) return;
+      E && (g.current = 0, l.current = !0, A(!0)), a.current = !0, f(/* @__PURE__ */ C.jsx(as, {})), (async () => {
+        try {
+          let B = await e.page(g.current, n);
+          B = i(B), B.length === 0 && f(p() ?? /* @__PURE__ */ C.jsx(Q, {})), B.length < n && (l.current = !1, A(!1)), g.current += n, h(E ? B : (m) => [...m, ...B]);
+        } catch (B) {
+          a.current = !1, f(/* @__PURE__ */ C.jsx(ls, { error: B }));
+        } finally {
+          a.current = !1;
+        }
+      })();
+    },
+    [e, h, n, i]
+  );
+  de(() => {
+    F(!0), y(F);
+  }, [F]);
+  const M = Me(
+    (E) => {
+      if (E.length === 0) {
+        F(!0);
+        return;
+      }
+      if (e == null) return f(/* @__PURE__ */ C.jsx(Q, {}));
+      e.search(E).then((b) => {
+        b.length === 0 && f(/* @__PURE__ */ C.jsx(Q, {})), h(i(b));
+      }).catch((b) => {
+        f(
+          /* @__PURE__ */ C.jsx(T.Centered, { level: "h4", variant: "error", children: b.message })
+        );
+      });
+    },
+    t,
+    [e, h, f, i]
+  ), R = X(
+    (E) => {
+      c(E), M(E);
+    },
+    [c, M]
+  );
+  return { value: u, onChange: R };
+}, fs = (t) => /* @__PURE__ */ C.jsx(Be, { placeholder: "Search", ...t }), ds = ({
+  children: t = fs,
+  ...e
+}) => t(Ke(e)), Ss = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  Column: We,
+  Core: ze,
+  DataProvider: He,
+  Filter: cs,
+  Hover: Ve,
+  ItemFrame: Ue,
+  List: Ge,
+  Search: ds,
+  Selector: Je,
+  selectValueIsZero: Qe,
+  useDataContext: Xe,
+  useDataUtils: ce,
+  useFilter: Ne,
+  useGetTransformedData: Ze,
+  useHoverContext: qe,
+  useSearch: Ke,
+  useSelect: et,
+  useSelection: tt,
+  useSelectionContext: st,
+  useSelectionUtils: rt,
+  useSetSourceData: nt,
+  useSourceData: it,
+  useTransformedData: ut
+}, Symbol.toStringTag, { value: "Module" }));
+export {
+  cs as F,
+  ds as S,
+  us as c,
+  Ss as e,
+  ns as f,
+  Et as p
+};