@synnaxlabs/pluto 0.34.0 → 0.35.0

package/dist/{external-FVIwMFDr.js → external-CgpiH-10.js}

@@ -1,11 +1,11 @@
-import { a1 as fe, au as Pe, ak as ke, ab as ve, av as Te, a5 as Ce, l as Fe, aa as Ne, aw as $e, ax as je, a6 as De, ay as Ke, az as Ye, aA as We, aB as ze, aC as He, ac as Be, aD as Ve, aE as Ue, a0 as Ge, aF as Je, aG as Qe, aH as Xe } from "./Toggle-Cdu7WaiC.js";
+import { a9 as fe, aF as Pe, av as ke, ak as ve, aG as Te, ae as Ce, m as Ne, aj as Fe, aH as $e, aI as je, af as De, aJ as Ke, aK as Ye, aL as We, aM as ze, aN as He, am as Ve, aO as Be, aP as Ue, a8 as Ge, aQ as Je, aR as Qe, aS as Xe } from "./Toggle-CLkPIiQK.js";
 import { j as Ze } from "./jsx-runtime-B6kdoens.js";
 import { useCallback as qe } from "react";
-import { w as et, p as tt } from "./aggregator-DzdAnRwI.js";
-import "./css-B4FcyECk.js";
-import "./Pack-D6eMgf33.js";
-import { L as st } from "./List-BjimX8fM.js";
-const de = Symbol(), q = Symbol(), v = "a", N = "w";
+import { q as et, p as tt } from "./aggregator-23mu0FOF.js";
+import "./css-DJCM-h5_.js";
+import "./Pack-BzCJQZ58.js";
+import { L as st } from "./List-Cuz80sgI.js";
+const de = Symbol(), q = Symbol(), v = "a", F = "w";
 let rt = (t, e) => new Proxy(t, e);
 const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) => t && (ne.has(t) ? ne.get(t) : H(t) === Object.prototype || H(t) === Array.prototype), ie = (t) => typeof t == "object" && t !== null, ce = /* @__PURE__ */ new WeakMap(), ge = (t) => t[q] || t, pe = (t, e, s) => {
   if (!ee(t)) return t;
@@ -17,13 +17,13 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
     const l = (f, g) => {
       if (!h) {
         let p = a[v].get(c);
-        if (p || (p = {}, a[v].set(c, p)), f === N) p[N] = !0;
+        if (p || (p = {}, a[v].set(c, p)), f === F) p[F] = !0;
         else {
           let m = p[f];
           m || (m = /* @__PURE__ */ new Set(), p[f] = m), m.add(g);
         }
       }
-    }, u = { get: (f, g) => g === q ? c : (l("k", g), pe(Reflect.get(f, g), a[v], a.c)), has: (f, g) => g === de ? (h = !0, a[v].delete(c), !0) : (l("h", g), Reflect.has(f, g)), getOwnPropertyDescriptor: (f, g) => (l("o", g), Reflect.getOwnPropertyDescriptor(f, g)), ownKeys: (f) => (l(N), Reflect.ownKeys(f)) };
+    }, u = { get: (f, g) => g === q ? c : (l("k", g), pe(Reflect.get(f, g), a[v], a.c)), has: (f, g) => g === de ? (h = !0, a[v].delete(c), !0) : (l("h", g), Reflect.has(f, g)), getOwnPropertyDescriptor: (f, g) => (l("o", g), Reflect.getOwnPropertyDescriptor(f, g)), ownKeys: (f) => (l(F), Reflect.ownKeys(f)) };
     return o && (u.set = u.deleteProperty = () => !1), [u, a];
   })(r, i), n[1].p = rt(i ? ((c) => {
     let o = ce.get(c);
@@ -52,7 +52,7 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
   let n = null;
   try {
     for (const c of i.h || []) if (n = Reflect.has(t, c) !== Reflect.has(e, c), n) return n;
-    if (i[N] === !0) {
+    if (i[F] === !0) {
       if (n = ((c, o) => {
         const a = Reflect.ownKeys(c), h = Reflect.ownKeys(o);
         return a.length !== h.length || a.some((l, u) => l !== h[u]);
@@ -63,23 +63,23 @@ const H = Object.getPrototypeOf, ne = /* @__PURE__ */ new WeakMap(), ee = (t) =>
   } finally {
     r && r.set(t, { n: e, g: n });
   }
-}, nt = (t) => !!ee(t) && de in t, ye = (t) => ee(t) && t[q] || null, it = "h", ct = "w", ot = "o", at = "k", B = (t) => typeof t == "object" && t !== null, Me = (t, e) => {
-  if (!B(t)) return t;
-  const s = ye(t);
+}, nt = (t) => !!ee(t) && de in t, Me = (t) => ee(t) && t[q] || null, it = "h", ct = "w", ot = "o", at = "k", V = (t) => typeof t == "object" && t !== null, ye = (t, e) => {
+  if (!V(t)) return t;
+  const s = Me(t);
   return s !== null ? (nt(t), s) : (e.has(t) || (e.add(t), Object.entries(t).forEach(([r, i]) => {
-    const n = Me(i, e);
+    const n = ye(i, e);
     Object.is(n, i) || (t[r] = n);
   })), t);
-}, V = (t, e, s) => {
+}, B = (t, e, s) => {
   var r, i, n;
-  if (!B(t) || !B(e)) return;
-  const c = s.get(ye(e) || e);
+  if (!V(t) || !V(e)) return;
+  const c = s.get(Me(e) || e);
   c && ((r = c[it]) == null || r.forEach((o) => {
     Reflect.has(t, o);
   }), c[ct] === !0 && Reflect.ownKeys(t), (i = c[ot]) == null || i.forEach((o) => {
     Reflect.getOwnPropertyDescriptor(t, o);
   }), (n = c[at]) == null || n.forEach((o) => {
-    V(t[o], e[o], s);
+    B(t[o], e[o], s);
   }));
 }, K = "o", Y = "r", W = "a";
 function lt(t, e) {
@@ -94,10 +94,10 @@ function lt(t, e) {
       const m = n[(r + p) % i];
       if (!m) break;
       if (!me(m[K], a, m[W], /* @__PURE__ */ new WeakMap()))
-        return V(a, m[K], m[W]), c == null || c.set(a, m), m[Y];
+        return B(a, m[K], m[W]), c == null || c.set(a, m), m[Y];
     }
-    const l = /* @__PURE__ */ new WeakMap(), u = pe(a, l), f = Me(t(u), /* @__PURE__ */ new Set());
-    V(a, a, l);
+    const l = /* @__PURE__ */ new WeakMap(), u = pe(a, l), f = ye(t(u), /* @__PURE__ */ new Set());
+    B(a, a, l);
     const g = {
       [K]: a,
       [Y]: f,
@@ -135,7 +135,7 @@ function _e(t) {
 function pt(t) {
   return _e(t) && t !== null;
 }
-function y(t) {
+function M(t) {
   return t != null;
 }
 function z(t) {
@@ -144,7 +144,7 @@ function z(t) {
 function Se(t) {
   return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(t);
 }
-const mt = "Incorrect 'index' type", yt = (t) => `Invalid value for key ${t}`, Mt = (t) => `Pattern length exceeds max of ${t}.`, Et = (t) => `Missing ${t} property in key`, _t = (t) => `Property 'weight' in key '${t}' must be a positive integer`, oe = Object.prototype.hasOwnProperty;
+const mt = "Incorrect 'index' type", Mt = (t) => `Invalid value for key ${t}`, yt = (t) => `Pattern length exceeds max of ${t}.`, Et = (t) => `Missing ${t} property in key`, _t = (t) => `Property 'weight' in key '${t}' must be a positive integer`, oe = Object.prototype.hasOwnProperty;
 class St {
   constructor(e) {
     this._keys = [], this._keyMap = {};
@@ -189,13 +189,13 @@ function U(t) {
 function xt(t, e) {
   let s = [], r = !1;
   const i = (n, c, o) => {
-    if (y(n))
+    if (M(n))
       if (!c[o])
         s.push(n);
       else {
         let a = c[o];
         const h = n[a];
-        if (!y(h))
+        if (!M(h))
           return;
         if (o === c.length - 1 && (_(h) || Ee(h) || gt(h)))
           s.push(dt(h));
@@ -218,7 +218,7 @@ const Rt = {
   findAllMatches: !1,
   // Minimum number of characters that must be matched before a result is considered a match
   minMatchCharLength: 1
-}, wt = {
+}, Ot = {
   // 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,
@@ -230,7 +230,7 @@ const Rt = {
   shouldSort: !0,
   // Default sort function: sort by ascending score, ascending index
   sortFn: (t, e) => t.score === e.score ? t.idx < e.idx ? -1 : 1 : t.score < e.score ? -1 : 1
-}, Ot = {
+}, wt = {
   // 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
@@ -242,7 +242,7 @@ const Rt = {
   // the exact location specified, a threshold of '1000' would require a perfect match
   // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.
   distance: 100
-}, At = {
+}, It = {
   // When `true`, it enables the use of unix-like search commands
   useExtendedSearch: !1,
   // The get function to use when fetching an object's properties.
@@ -260,17 +260,17 @@ const Rt = {
   fieldNormWeight: 1
 };
 var d = {
-  ...wt,
-  ...Rt,
   ...Ot,
-  ...At
+  ...Rt,
+  ...wt,
+  ...It
 };
-const It = /[^ ]+/g;
+const At = /[^ ]+/g;
 function bt(t = 1, e = 3) {
   const s = /* @__PURE__ */ new Map(), r = Math.pow(10, e);
   return {
     get(i) {
-      const n = i.match(It).length;
+      const n = i.match(At).length;
       if (s.has(n))
         return s.get(n);
       const c = 1 / Math.pow(n, 0.5 * t), o = parseFloat(Math.round(c * r) / r);
@@ -324,7 +324,7 @@ class te {
     return this.records.length;
   }
   _addString(e, s) {
-    if (!y(e) || z(e))
+    if (!M(e) || z(e))
       return;
     let r = {
       v: e,
@@ -337,13 +337,13 @@ class te {
     let r = { i: s, $: {} };
     this.keys.forEach((i, n) => {
       let c = i.getFn ? i.getFn(e) : this.getFn(e, i.path);
-      if (y(c)) {
+      if (M(c)) {
         if (x(c)) {
           let o = [];
           const a = [{ nestedArrIndex: -1, value: c }];
           for (; a.length; ) {
             const { nestedArrIndex: h, value: l } = a.pop();
-            if (y(l))
+            if (M(l))
               if (_(l) && !z(l)) {
                 let u = {
                   v: l,
@@ -384,7 +384,7 @@ function Lt(t, { getFn: e = d.getFn, fieldNormWeight: s = d.fieldNormWeight } =
   const { keys: r, records: i } = t, n = new te({ getFn: e, fieldNormWeight: s });
   return n.setKeys(r), n.setIndexRecords(i), n;
 }
-function F(t, {
+function N(t, {
   errors: e = 0,
   currentLocation: s = 0,
   expectedLocation: r = 0,
@@ -416,56 +416,56 @@ function kt(t, e, s, {
   ignoreLocation: h = d.ignoreLocation
 } = {}) {
   if (e.length > b)
-    throw new Error(Mt(b));
+    throw new Error(yt(b));
   const l = e.length, u = t.length, f = Math.max(0, Math.min(r, u));
   let g = n, p = f;
-  const m = o > 1 || a, A = m ? Array(u) : [];
+  const m = o > 1 || a, I = m ? Array(u) : [];
   let S;
   for (; (S = t.indexOf(e, p)) > -1; ) {
-    let M = F(e, {
+    let y = N(e, {
       currentLocation: S,
       expectedLocation: f,
       distance: i,
       ignoreLocation: h
     });
-    if (g = Math.min(M, g), p = S + l, m) {
+    if (g = Math.min(y, g), p = S + l, m) {
       let R = 0;
       for (; R < l; )
-        A[S + R] = 1, R += 1;
+        I[S + R] = 1, R += 1;
     }
   }
   p = -1;
-  let L = [], I = 1, T = l + u;
+  let L = [], A = 1, T = l + u;
   const Le = 1 << l - 1;
-  for (let M = 0; M < l; M += 1) {
-    let R = 0, w = T;
-    for (; R < w; )
-      F(e, {
-        errors: M,
-        currentLocation: f + w,
+  for (let y = 0; y < l; y += 1) {
+    let R = 0, O = T;
+    for (; R < O; )
+      N(e, {
+        errors: y,
+        currentLocation: f + O,
         expectedLocation: f,
         distance: i,
         ignoreLocation: h
-      }) <= g ? R = w : T = w, w = Math.floor((T - R) / 2 + R);
-    T = w;
-    let se = Math.max(1, f - w + 1), D = c ? u : Math.min(f + w, u) + l, P = Array(D + 2);
-    P[D + 1] = (1 << M) - 1;
+      }) <= g ? R = O : T = O, O = Math.floor((T - R) / 2 + R);
+    T = O;
+    let se = Math.max(1, f - O + 1), D = c ? u : Math.min(f + O, u) + l, P = Array(D + 2);
+    P[D + 1] = (1 << y) - 1;
     for (let E = D; E >= se; E -= 1) {
       let C = E - 1, re = s[t.charAt(C)];
-      if (m && (A[C] = +!!re), P[E] = (P[E + 1] << 1 | 1) & re, M && (P[E] |= (L[E + 1] | L[E]) << 1 | 1 | L[E + 1]), P[E] & Le && (I = F(e, {
-        errors: M,
+      if (m && (I[C] = +!!re), P[E] = (P[E + 1] << 1 | 1) & re, y && (P[E] |= (L[E + 1] | L[E]) << 1 | 1 | L[E + 1]), P[E] & Le && (A = N(e, {
+        errors: y,
         currentLocation: C,
         expectedLocation: f,
         distance: i,
         ignoreLocation: h
-      }), I <= g)) {
-        if (g = I, p = C, p <= f)
+      }), A <= g)) {
+        if (g = A, p = C, p <= f)
           break;
         se = Math.max(1, 2 * f - p);
       }
     }
-    if (F(e, {
-      errors: M + 1,
+    if (N(e, {
+      errors: y + 1,
       currentLocation: f,
       expectedLocation: f,
       distance: i,
@@ -477,11 +477,11 @@ function kt(t, e, s, {
   const j = {
     isMatch: p >= 0,
     // Count exact matches (those with a score of 0) to be "almost" exact
-    score: Math.max(1e-3, I)
+    score: Math.max(1e-3, A)
   };
   if (m) {
-    const M = Pt(A, o);
-    M.length ? a && (j.indices = M) : j.isMatch = !1;
+    const y = Pt(I, o);
+    y.length ? a && (j.indices = y) : j.isMatch = !1;
   }
   return j;
 }
@@ -493,7 +493,7 @@ function vt(t) {
   }
   return e;
 }
-class we {
+class Oe {
   constructor(e, {
     location: s = d.location,
     threshold: r = d.threshold,
@@ -552,9 +552,9 @@ class we {
       ignoreLocation: h
     } = this.options;
     let l = [], u = 0, f = !1;
-    this.chunks.forEach(({ pattern: p, alphabet: m, startIndex: A }) => {
-      const { isMatch: S, score: L, indices: I } = kt(e, p, m, {
-        location: i + A,
+    this.chunks.forEach(({ pattern: p, alphabet: m, startIndex: I }) => {
+      const { isMatch: S, score: L, indices: A } = kt(e, p, m, {
+        location: i + I,
         distance: n,
         threshold: c,
         findAllMatches: o,
@@ -562,7 +562,7 @@ class we {
         includeMatches: r,
         ignoreLocation: h
       });
-      S && (f = !0), u += L, S && I && (l = [...l, ...I]);
+      S && (f = !0), u += L, S && A && (l = [...l, ...A]);
     });
     let g = {
       isMatch: f,
@@ -571,7 +571,7 @@ class we {
     return f && r && (g.indices = l), g;
   }
 }
-class O {
+class w {
   constructor(e) {
     this.pattern = e;
   }
@@ -588,7 +588,7 @@ function le(t, e) {
   const s = t.match(e);
   return s ? s[1] : null;
 }
-class Tt extends O {
+class Tt extends w {
   constructor(e) {
     super(e);
   }
@@ -610,7 +610,7 @@ class Tt extends O {
     };
   }
 }
-class Ct extends O {
+class Ct extends w {
   constructor(e) {
     super(e);
   }
@@ -632,7 +632,7 @@ class Ct extends O {
     };
   }
 }
-class Ft extends O {
+class Nt extends w {
   constructor(e) {
     super(e);
   }
@@ -654,7 +654,7 @@ class Ft extends O {
     };
   }
 }
-class Nt extends O {
+class Ft extends w {
   constructor(e) {
     super(e);
   }
@@ -676,7 +676,7 @@ class Nt extends O {
     };
   }
 }
-class $t extends O {
+class $t extends w {
   constructor(e) {
     super(e);
   }
@@ -698,7 +698,7 @@ class $t extends O {
     };
   }
 }
-class jt extends O {
+class jt extends w {
   constructor(e) {
     super(e);
   }
@@ -720,7 +720,7 @@ class jt extends O {
     };
   }
 }
-class Oe extends O {
+class we extends w {
   constructor(e, {
     location: s = d.location,
     threshold: r = d.threshold,
@@ -731,7 +731,7 @@ class Oe extends O {
     isCaseSensitive: a = d.isCaseSensitive,
     ignoreLocation: h = d.ignoreLocation
   } = {}) {
-    super(e), this._bitapSearch = new we(e, {
+    super(e), this._bitapSearch = new Oe(e, {
       location: s,
       threshold: r,
       distance: i,
@@ -755,7 +755,7 @@ class Oe extends O {
     return this._bitapSearch.searchIn(e);
   }
 }
-class Ae extends O {
+class Ie extends w {
   constructor(e) {
     super(e);
   }
@@ -783,13 +783,13 @@ class Ae extends O {
 }
 const G = [
   Tt,
-  Ae,
-  Ft,
+  Ie,
   Nt,
+  Ft,
   jt,
   $t,
   Ct,
-  Oe
+  we
 ], he = G.length, Dt = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Kt = "|";
 function Yt(t, e = {}) {
   return t.split(Kt).map((s) => {
@@ -815,7 +815,7 @@ function Yt(t, e = {}) {
     return i;
   });
 }
-const Wt = /* @__PURE__ */ new Set([Oe.type, Ae.type]);
+const Wt = /* @__PURE__ */ new Set([we.type, Ie.type]);
 class zt {
   constructor(e, {
     isCaseSensitive: s = d.isCaseSensitive,
@@ -855,9 +855,9 @@ class zt {
       const l = s[a];
       c.length = 0, n = 0;
       for (let u = 0, f = l.length; u < f; u += 1) {
-        const g = l[u], { isMatch: p, indices: m, score: A } = g.search(e);
+        const g = l[u], { isMatch: p, indices: m, score: I } = g.search(e);
         if (p) {
-          if (n += 1, o += A, r) {
+          if (n += 1, o += I, r) {
             const S = g.constructor.type;
             Wt.has(S) ? c = [...c, ...m] : c.push(m);
           }
@@ -890,7 +890,7 @@ function Q(t, e) {
     if (i.condition(t, e))
       return new i(t, e);
   }
-  return new we(t, e);
+  return new Oe(t, e);
 }
 const $ = {
   AND: "$and",
@@ -898,21 +898,21 @@ const $ = {
 }, X = {
   PATH: "$path",
   PATTERN: "$val"
-}, Z = (t) => !!(t[$.AND] || t[$.OR]), Bt = (t) => !!t[X.PATH], Vt = (t) => !x(t) && _e(t) && !Z(t), ue = (t) => ({
+}, Z = (t) => !!(t[$.AND] || t[$.OR]), Vt = (t) => !!t[X.PATH], Bt = (t) => !x(t) && _e(t) && !Z(t), ue = (t) => ({
   [$.AND]: Object.keys(t).map((e) => ({
     [e]: t[e]
   }))
 });
-function Ie(t, e, { auto: s = !0 } = {}) {
+function Ae(t, e, { auto: s = !0 } = {}) {
   const r = (i) => {
     let n = Object.keys(i);
-    const c = Bt(i);
+    const c = Vt(i);
     if (!c && n.length > 1 && !Z(i))
       return r(ue(i));
-    if (Vt(i)) {
+    if (Bt(i)) {
       const a = c ? i[X.PATH] : n[0], h = c ? i[X.PATTERN] : i[a];
       if (!_(h))
-        throw new Error(yt(a));
+        throw new Error(Mt(a));
       const l = {
         keyId: U(a),
         pattern: h
@@ -946,8 +946,8 @@ function Ut(t, { ignoreFieldNorm: e = d.ignoreFieldNorm }) {
 }
 function Gt(t, e) {
   const s = t.matches;
-  e.matches = [], y(s) && s.forEach((r) => {
-    if (!y(r.indices) || !r.indices.length)
+  e.matches = [], M(s) && s.forEach((r) => {
+    if (!M(r.indices) || !r.indices.length)
       return;
     const { indices: i, value: n } = r;
     let c = {
@@ -988,7 +988,7 @@ class k {
     });
   }
   add(e) {
-    y(e) && (this._docs.push(e), this._myIndex.add(e));
+    M(e) && (this._docs.push(e), this._myIndex.add(e));
   }
   remove(e = () => !1) {
     const s = [];
@@ -1021,7 +1021,7 @@ class k {
   _searchStringList(e) {
     const s = Q(e, this.options), { records: r } = this._myIndex, i = [];
     return r.forEach(({ v: n, i: c, n: o }) => {
-      if (!y(n))
+      if (!M(n))
         return;
       const { isMatch: a, score: h, indices: l } = s.searchIn(n);
       a && i.push({
@@ -1032,7 +1032,7 @@ class k {
     }), i;
   }
   _searchLogical(e) {
-    const s = Ie(e, this.options), r = (o, a, h) => {
+    const s = Ae(e, this.options), r = (o, a, h) => {
       if (!o.children) {
         const { keyId: u, searcher: f } = o, g = this._findMatches({
           key: this._keyStore.get(u),
@@ -1058,7 +1058,7 @@ class k {
       return l;
     }, i = this._myIndex.records, n = {}, c = [];
     return i.forEach(({ $: o, i: a }) => {
-      if (y(o)) {
+      if (M(o)) {
         let h = r(s, o, a);
         h.length && (n[a] || (n[a] = { idx: a, item: o, matches: [] }, c.push(n[a])), h.forEach(({ matches: l }) => {
           n[a].matches.push(...l);
@@ -1069,7 +1069,7 @@ class k {
   _searchObjectList(e) {
     const s = Q(e, this.options), { keys: r, records: i } = this._myIndex, n = [];
     return i.forEach(({ $: c, i: o }) => {
-      if (!y(c))
+      if (!M(c))
         return;
       let a = [];
       r.forEach((h, l) => {
@@ -1088,12 +1088,12 @@ class k {
     }), n;
   }
   _findMatches({ key: e, value: s, searcher: r }) {
-    if (!y(s))
+    if (!M(s))
       return [];
     let i = [];
     if (x(s))
       s.forEach(({ v: n, i: c, n: o }) => {
-        if (!y(n))
+        if (!M(n))
           return;
         const { isMatch: a, score: h, indices: l } = r.searchIn(n);
         a && i.push({
@@ -1116,7 +1116,7 @@ k.version = "7.0.0";
 k.createIndex = Re;
 k.parseIndex = Lt;
 k.config = d;
-k.parseQuery = Ie;
+k.parseQuery = Ae;
 Ht(zt);
 const Xt = {
   threshold: 0.3
@@ -1160,9 +1160,9 @@ const Xt = {
   Column: ve,
   ColumnContext: Te,
   Core: Ce,
-  DataProvider: Fe,
+  DataProvider: Ne,
   Filter: ts,
-  Hover: Ne,
+  Hover: Fe,
   ItemFrame: $e,
   List: st,
   Search: je,
@@ -1174,8 +1174,8 @@ const Xt = {
   useGetTransformedData: We,
   useHoverContext: ze,
   useSearch: He,
-  useSelect: Be,
-  useSelection: Ve,
+  useSelect: Ve,
+  useSelection: Be,
   useSelectionContext: Ue,
   useSelectionUtils: Ge,
   useSetSourceData: Je,