@synnaxlabs/pluto 0.46.6 → 0.47.0

package/dist/{external-CH77I63o.js → external-x9Ylk2op.js}

@@ -1,28 +1,39 @@
-import { a as v, c as A, C as i } from "./css-BYwooBtA.js";
+import { h as k, c as A, C as i } from "./css-D6ZBcSwh.js";
 import { j as f } from "./jsx-runtime-OVHDjVDe.js";
-import { aL as K, aM as z, aN as J, aJ as U, aO as Y, aK as b, af as Q, r as V, ak as W } from "./main-BINuQ9na.js";
-import { createContext as X, useMemo as M, useCallback as g } from "react";
-import { A as Z } from "./provider-CKYgKu3z.js";
+import { A as z } from "./Animated-otpyxn5i.js";
+import { L as K } from "./Text-BzTkWLeU.js";
+import { L as U, F as Y } from "./Tags-Dpu9kD_T.js";
+import "./Button-BFoGC4WW.js";
+import "./Box-D5Qv__kr.js";
+import { a as J } from "./Items-G25zb57I.js";
+import { f as Q } from "./Animated-M9ynNzcI.js";
+import { createContext as V, useMemo as L, useCallback as g } from "react";
+import { d as W, c as R } from "./Editable-CxgdRDPb.js";
+import { b as X } from "./types-BNX_Jj6k.js";
+import "./Provider--RxgAoVG.js";
+import "./provider-C8In649C.js";
 import "react-dom";
-const L = (e, n) => n.includes(e.key), w = ({
+import "./Haul-BuI0PZpo.js";
+import { b as Z } from "./hooks-15yB7IKE.js";
+const M = (e, n) => n.includes(e.key), v = ({
   nodes: e,
   expanded: n,
   sort: t,
-  depth: s = 0
+  depth: o = 0
 }) => {
   const r = { keys: [], nodes: [] };
-  return t != null && e.sort(t), e.forEach((o) => {
-    const l = L(o, n);
-    if (r.keys.push(o.key), r.nodes.push({
-      depth: s,
+  return t != null && e.sort(t), e.forEach((s) => {
+    const l = M(s, n);
+    if (r.keys.push(s.key), r.nodes.push({
+      depth: o,
       expanded: l,
-      hasChildren: o.children != null
-    }), l && o.children != null) {
-      const { keys: c, nodes: h } = w({
-        nodes: o.children,
+      hasChildren: s.children != null
+    }), l && s.children != null) {
+      const { keys: c, nodes: h } = v({
+        nodes: s.children,
         expanded: n,
         sort: t,
-        depth: s + 1
+        depth: o + 1
       });
       r.keys.push(...c), r.nodes.push(...h);
     }
@@ -31,66 +42,66 @@ const L = (e, n) => n.includes(e.key), w = ({
   tree: e,
   destination: n,
   keys: t
-}) => (t = v.toArray(t), n == null ? [...T({ tree: e, keys: t }), ...e.filter((r) => !t.includes(r.key))] : (t.forEach((s) => {
-  const r = a({ tree: e, key: s });
-  r != null && (P({ tree: e, keys: s }), O({ tree: e, destination: n, additions: r }));
+}) => (t = k.toArray(t), n == null ? [...D({ tree: e, keys: t }), ...e.filter((r) => !t.includes(r.key))] : (t.forEach((o) => {
+  const r = a({ tree: e, key: o });
+  r != null && (P({ tree: e, keys: o }), T({ tree: e, destination: n, additions: r }));
 }), e)), P = ({
   tree: e,
   keys: n,
   parent: t
 }) => {
-  if (n = v.toArray(n), t !== void 0) {
+  if (n = k.toArray(n), t !== void 0) {
     if (t === null) return e.filter((r) => !n.includes(r.key));
-    const s = a({ tree: e, key: t });
-    return s == null || (s.children = s.children?.filter(
+    const o = a({ tree: e, key: t });
+    return o == null || (o.children = o.children?.filter(
       (r) => !n.includes(r.key)
     )), e;
   }
-  return n.forEach((s) => {
-    const r = e.findIndex((o) => o.key === s);
+  return n.forEach((o) => {
+    const r = e.findIndex((s) => s.key === o);
     if (r !== -1) e.splice(r, 1);
     else {
-      const o = C({ tree: e, key: s });
-      o != null && (o.children = o.children?.filter((l) => l.key !== s));
+      const s = C({ tree: e, key: o });
+      s != null && (s.children = s.children?.filter((l) => l.key !== o));
     }
   }), e;
-}, O = ({
+}, T = ({
   tree: e,
   destination: n,
   additions: t,
-  throwOnMissing: s = !0
+  throwOnMissing: o = !0
 }) => {
-  t = v.toArray(t);
-  const r = A.by(t, (c) => c.key, !1), o = r.map((c) => c.key);
+  t = k.toArray(t);
+  const r = A.by(t, (c) => c.key, !1), s = r.map((c) => c.key);
   if (n == null)
     return [
       ...r,
-      ...e.filter((c) => !o.includes(c.key))
+      ...e.filter((c) => !s.includes(c.key))
     ];
   const l = a({ tree: e, key: n });
   if (l == null) {
-    if (s) throw new Error(`Could not find node with key ${n}`);
+    if (o) throw new Error(`Could not find node with key ${n}`);
     return e;
   }
   return l.children ??= [], l.children = [
     ...r,
-    ...l.children.filter((c) => !o.includes(c.key))
+    ...l.children.filter((c) => !s.includes(c.key))
   ], e;
 }, ne = ({
   tree: e,
   key: n,
   updater: t,
-  throwOnMissing: s = !0
+  throwOnMissing: o = !0
 }) => {
   const r = a({ tree: e, key: n });
   if (r == null) {
-    if (s) throw new Error(`Could not find node with key ${n}`);
+    if (o) throw new Error(`Could not find node with key ${n}`);
     return e;
   }
-  const o = C({ tree: e, key: n });
-  if (o != null) {
-    const l = o.children?.findIndex((c) => c.key === n);
-    l != null && l !== -1 && o.children?.splice(l, 1, t(r));
+  const s = C({ tree: e, key: n });
+  if (s != null) {
+    const l = s.children?.findIndex((c) => c.key === n);
+    l != null && l !== -1 && s.children?.splice(l, 1, t(r));
   } else
     e.splice(
       e.findIndex((l) => l.key === n),
@@ -102,11 +113,11 @@ const L = (e, n) => n.includes(e.key), w = ({
   tree: e,
   parent: n,
   updater: t,
-  throwOnMissing: s = !0
+  throwOnMissing: o = !0
 }) => {
   const r = a({ tree: e, key: n });
   if (r == null) {
-    if (s) throw new Error(`Could not find node with key ${n}`);
+    if (o) throw new Error(`Could not find node with key ${n}`);
     return e;
   }
   return r.children = t(r.children ?? []), e;
@@ -115,22 +126,22 @@ const L = (e, n) => n.includes(e.key), w = ({
   key: n,
   depth: t = 0
 }) => {
-  for (let s = 0; s < e.length; s++) {
-    const r = e[s];
+  for (let o = 0; o < e.length; o++) {
+    const r = e[o];
     if (r.key === n) return r;
     if (r.children != null) {
-      const o = a({ tree: r.children, key: n, depth: t + 1 });
-      if (o != null) return o;
+      const s = a({ tree: r.children, key: n, depth: t + 1 });
+      if (s != null) return s;
     }
   }
   return null;
-}, T = ({
+}, D = ({
   tree: e,
   keys: n
 }) => {
   const t = [];
-  for (const s of n) {
-    const r = a({ tree: e, key: s });
+  for (const o of n) {
+    const r = a({ tree: e, key: o });
     r != null && t.push(r);
   }
   return t;
@@ -141,53 +152,53 @@ const L = (e, n) => n.includes(e.key), w = ({
   for (const t of e)
     if (t.children != null) {
       if (t.children.some((r) => r.key === n)) return t;
-      const s = C({ tree: t.children, key: n });
-      if (s != null) return s;
+      const o = C({ tree: t.children, key: n });
+      if (o != null) return o;
     }
   return null;
-}, D = (e) => e.map((n) => ({
+}, H = (e) => e.map((n) => ({
   ...n,
-  children: n.children != null ? D(n.children) : void 0
-})), H = (...e) => {
+  children: n.children != null ? H(n.children) : void 0
+})), O = (...e) => {
   const n = [];
   return e.forEach((t) => {
-    n.push(t), t.children != null && n.push(...H(...t.children));
+    n.push(t), t.children != null && n.push(...O(...t.children));
   }), n;
 }, re = (e, n) => {
   const t = { keys: [], nodes: [] };
-  return e.keys.forEach((s, r) => {
-    n(s, e.nodes[r].depth) && (t.keys.push(s), t.nodes.push(e.nodes[r]));
+  return e.keys.forEach((o, r) => {
+    n(o, e.nodes[r].depth) && (t.keys.push(o), t.nodes.push(e.nodes[r]));
   }), t;
-}, se = (e) => {
+}, oe = (e) => {
   const n = Math.min(...e.nodes.map((t) => t.depth));
-  return e.keys.filter((t, s) => e.nodes[s].depth === n);
-}, oe = (e, n) => {
-  const t = n.keys.findIndex((s) => s === e);
+  return e.keys.filter((t, o) => e.nodes[o].depth === n);
+}, se = (e, n) => {
+  const t = n.keys.findIndex((o) => o === e);
   return n.nodes[t].depth;
 }, $ = (e, n) => {
-  const t = e.keys.findIndex((s) => s === n);
+  const t = e.keys.findIndex((o) => o === n);
   return e.nodes[t];
-}, q = X(null), le = () => K(q), ce = (e) => {
+}, q = V(null), le = () => Q(q), ce = (e) => {
   const { shape: n } = le();
   return n.nodes[e];
 }, de = ({
   shape: e,
   children: n
 }) => {
-  const t = M(() => ({ shape: e }), [e]);
+  const t = L(() => ({ shape: e }), [e]);
   return /* @__PURE__ */ f.jsx(q.Provider, { value: t, children: n });
 }, ie = ({
   children: e,
   style: n,
   className: t,
-  loading: s,
+  loading: o,
   useMargin: r = !1,
-  offsetMultiplier: o = 2.5,
+  offsetMultiplier: s = 2.5,
   ...l
 }) => {
   const { index: c } = l, { expanded: h, depth: m, hasChildren: x } = ce(c);
   return /* @__PURE__ */ f.jsxs(
-    z,
+    U,
     {
       className: i(
         i.BE("tree", "item"),
@@ -196,7 +207,7 @@ const L = (e, n) => n.includes(e.key), w = ({
         t
       ),
       style: {
-        [i.var("tree-item-offset")]: `${m * o + 1.5}rem`,
+        [i.var("tree-item-offset")]: `${m * s + 1.5}rem`,
         ...n
       },
       gap: "small",
@@ -204,7 +215,7 @@ const L = (e, n) => n.includes(e.key), w = ({
       ...l,
       children: [
         x && /* @__PURE__ */ f.jsx(
-          J,
+          z,
           {
             className: i.BE("tree", "expansion-indicator"),
             enabled: h,
@@ -214,7 +225,7 @@ const L = (e, n) => n.includes(e.key), w = ({
           "caret"
         ),
         e,
-        s && /* @__PURE__ */ f.jsx(U, {})
+        o && /* @__PURE__ */ f.jsx(K, {})
       ]
     }
   );
@@ -222,25 +233,25 @@ const L = (e, n) => n.includes(e.key), w = ({
   onExpand: e,
   nodes: n,
   initialExpanded: t = [],
-  selected: s,
+  selected: o,
   onSelectedChange: r,
-  sort: o
+  sort: s
 }) => {
-  const [l, c, h] = Y(t), [m, x] = Z({
+  const [l, c, h] = W(t), [m, x] = X({
     initial: [],
-    value: s,
+    value: o,
     onChange: r
-  }), E = M(
-    () => w({ nodes: n, expanded: l, sort: o }),
-    [n, l, o]
-  ), N = b(n), S = b(E), k = Q({ triggers: ae }), I = g(
+  }), E = L(
+    () => v({ nodes: n, expanded: l, sort: s }),
+    [n, l, s]
+  ), N = R(n), S = R(E), b = Z({ triggers: ae }), I = g(
     (u, { clicked: d }) => {
-      if (x((p) => u.length === 0 && p.length > 0 ? p.slice(0, 1) : u), d == null || k.current.held) return;
+      if (x((p) => u.length === 0 && p.length > 0 ? p.slice(0, 1) : u), d == null || b.current.held) return;
       const y = $(S.current, d);
       if (y == null || !y.hasChildren) return;
-      const j = h.current, R = j.some((p) => p === d) ? "contract" : "expand";
+      const j = h.current, w = j.some((p) => p === d) ? "contract" : "expand";
       let _;
-      R === "contract" ? _ = j.filter((p) => p !== d) : _ = [...j, d], c(_), e?.({ current: _, action: R, clicked: d });
+      w === "contract" ? _ = j.filter((p) => p !== d) : _ = [...j, d], c(_), e?.({ current: _, action: w, clicked: d });
     },
     [e, N, c, x]
   ), B = g(
@@ -269,9 +280,9 @@ const L = (e, n) => n.includes(e.key), w = ({
   shape: e,
   children: n,
   selected: t,
-  onSelect: s,
+  onSelect: o,
   getItem: r,
-  subscribe: o,
+  subscribe: s,
   className: l,
   contract: c,
   expand: h,
@@ -280,56 +291,56 @@ const L = (e, n) => n.includes(e.key), w = ({
   clearExpanded: E,
   showRules: N = !1,
   virtual: S = !1,
-  ...k
+  ...b
 }) => {
   const { keys: I } = e;
   return /* @__PURE__ */ f.jsx(de, { shape: e, children: /* @__PURE__ */ f.jsx(
-    V,
+    Y,
     {
       multiple: !0,
       value: t,
       replaceOnSingle: !0,
       data: I,
-      onChange: s,
+      onChange: o,
       getItem: r,
-      subscribe: o,
+      subscribe: s,
       itemHeight: 27,
       virtual: S,
       children: /* @__PURE__ */ f.jsx(
-        W,
+        J,
         {
           full: "y",
           className: i(i.B("tree"), l, N && i.M("show-rules")),
-          ...k,
+          ...b,
           displayItems: 1 / 0,
           children: n
         }
       )
     }
   ) });
-}, Ce = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Ae = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   HAUL_TYPE: ue,
   Item: ie,
   Tree: he,
-  deepCopy: D,
+  deepCopy: H,
   filterShape: re,
   findNode: a,
   findNodeParent: C,
-  findNodes: T,
-  flatten: w,
-  getAllNodesOfMinDepth: se,
-  getDepth: oe,
-  getDescendants: H,
+  findNodes: D,
+  flatten: v,
+  getAllNodesOfMinDepth: oe,
+  getDepth: se,
+  getDescendants: O,
   getNodeShape: $,
   moveNode: ee,
   removeNode: P,
-  setNode: O,
-  shouldExpand: L,
+  setNode: T,
+  shouldExpand: M,
   updateNode: ne,
   updateNodeChildren: te,
   use: fe
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  Ce as e
+  Ae as e
 };

package/dist/flex.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./external-DX0zVdQa.cjs");exports.Flex=e.external;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./Box-BvqALodh.cjs");exports.Flex=e.Box;

package/dist/flex.js

@@ -1,4 +1,4 @@
-import { e as r } from "./external-BeFolwwf.js";
+import { B as r } from "./Box-D5Qv__kr.js";
 export {
   r as Flex
 };

package/dist/{fontString-CVUEOEMw.js → fontString-CGd4NYXa.js}

@@ -1,6 +1,7 @@
-import { i as g, C as y } from "./provider-CKYgKu3z.js";
-import "./css-BYwooBtA.js";
-const r = [
+import { i as m } from "./provider-C8In649C.js";
+import "./css-D6ZBcSwh.js";
+import { C as g } from "./types-BNX_Jj6k.js";
+const n = [
   { weight: 200, style: "light", value: "Inter 200, sans-serif" },
   { weight: 300, value: "Inter Threee, sans-serif" },
   { weight: 400, value: "Inter Four, sans-serif" },
@@ -9,20 +10,20 @@ const r = [
   { weight: 700, value: "Inter Seven, sans-serif" },
   { weight: 800, value: "Inter Eight, sans-serif" },
   { weight: 900, style: "bold", value: "Inter Nine, sans-serif" }
-], I = (s) => r.find((t, e) => e === r.length - 1 ? !0 : typeof s == "number" ? s >= t.weight && s < r[e + 1].weight : t.style === s), v = (s, { level: t, weight: e, code: a }) => {
+], p = (s) => n.find((t, e) => e === n.length - 1 ? !0 : typeof s == "number" ? s >= t.weight && s < n[e + 1].weight : t.style === s), d = (s, { level: t, weight: e, code: a }) => {
   const {
-    typography: n,
+    typography: r,
     sizes: { base: o }
   } = s;
-  let i = n.family;
-  if (a) i = n.codeFamily;
+  let i = r.family;
+  if (a) i = r.codeFamily;
   else if (e != null) {
-    const f = I(e);
+    const f = p(e);
     f != null ? i = f.value : i = "Inter Light, sans-serif";
   }
-  const u = n[g(t) ? y[t] : t].size, l = (o * u).toFixed(1), [h, c] = i.split(", ");
+  const u = r[m(t) ? g[t] : t].size, l = (o * u).toFixed(1), [h, c] = i.split(", ");
   return e != null ? ` ${e} ${l}px ${h}, ${c}` : ` ${l}px ${i}`;
 };
 export {
-  v as f
+  d as f
 };

package/dist/fontString-yPlq8smc.cjs

@@ -0,0 +1 @@
+"use strict";const g=require("./provider-lNhTlIWj.cjs");require("./css-HnNQMUzV.cjs");const y=require("./types-D-yz1qsT.cjs"),n=[{weight:200,style:"light",value:"Inter 200, sans-serif"},{weight:300,value:"Inter Threee, sans-serif"},{weight:400,value:"Inter Four, sans-serif"},{weight:500,value:"Inter Five, sans-serif"},{weight:600,value:"Inter Six, sans-serif"},{weight:700,value:"Inter Seven, sans-serif"},{weight:800,value:"Inter Eight, sans-serif"},{weight:900,style:"bold",value:"Inter Nine, sans-serif"}],v=s=>n.find((t,e)=>e===n.length-1?!0:typeof s=="number"?s>=t.weight&&s<n[e+1].weight:t.style===s),I=(s,{level:t,weight:e,code:l})=>{const{typography:i,sizes:{base:f}}=s;let r=i.family;if(l)r=i.codeFamily;else if(e!=null){const u=v(e);u!=null?r=u.value:r="Inter Light, sans-serif"}const o=i[g.isSize(t)?y.COMPONENT_SIZE_LEVELS[t]:t].size,a=(f*o).toFixed(1),[h,c]=r.split(", ");return e!=null?` ${e} ${a}px ${h}, ${c}`:` ${a}px ${r}`};exports.fontString=I;

package/dist/header.cjs

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

package/dist/header.js

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

package/dist/hooks-15yB7IKE.js

@@ -0,0 +1,74 @@
+import { c as x, j as m } from "./css-D6ZBcSwh.js";
+import { useCallback as b, useEffect as q, useState as C } from "react";
+import { u as H } from "./Editable-CxgdRDPb.js";
+import { p as k, u as M, a as j, f as d, d as y } from "./Text-BzTkWLeU.js";
+import { q as v } from "./deep-DRVLw7iw.js";
+const R = ({
+  triggers: n,
+  callback: u,
+  region: a,
+  loose: e,
+  double: r,
+  regionMustBeElement: l
+}) => {
+  const { listen: t } = M();
+  let i;
+  n != null && n?.length > 0 && typeof n[0] == "string" ? i = [n] : i = n;
+  const g = j(
+    () => i,
+    ([s], [c]) => s == null && c == null ? !0 : s == null || c == null ? !1 : v.primitiveArrays(s.flat(), c.flat()) === v.EQUAL,
+    [i]
+  );
+  q(() => {
+    if (!(g == null || g.length === 0))
+      return t((s) => {
+        const c = d(g, s.prev, { loose: e, double: r }), T = d(g, s.next, { loose: e, double: r }), h = y(T, c);
+        let f = h[0];
+        const o = h[1];
+        if (f.length === 0 && o.length === 0) return;
+        f = A(s.target, s.cursor, f, a, l);
+        const p = { target: s.target, cursor: s.cursor };
+        f.length > 0 && u?.({ ...p, stage: "start", triggers: f, prevTriggers: s.prev }), o.length > 0 && u?.({ ...p, stage: "end", triggers: o, prevTriggers: s.prev });
+      });
+  }, [u, g, t, e, a, r, l]);
+}, A = (n, u, a, e, r) => {
+  if (e == null) return a;
+  if (e.current == null) return [];
+  const l = m.construct(e.current);
+  return a.filter((t) => r ?? t.some((g) => g.includes("Mouse")) ? m.contains(l, u) && n === e.current : m.contains(l, u));
+}, U = ({
+  triggers: n,
+  loose: u
+}) => {
+  const [a, e] = H({
+    triggers: [],
+    held: !1
+  });
+  return R({
+    triggers: n,
+    callback: b((r) => {
+      e((l) => {
+        let t;
+        return r.stage === "start" ? t = x.unique([...l.triggers, ...r.triggers]) : t = k(l.triggers, r.triggers), { triggers: t, held: t.length > 0 };
+      });
+    }, []),
+    loose: u
+  }), a;
+}, w = ({ triggers: n, loose: u }) => {
+  const [a, e] = C({ triggers: [], held: !1 });
+  return R({
+    triggers: n,
+    callback: b((r) => {
+      e((l) => {
+        let t;
+        return r.stage === "start" ? t = x.unique([...l.triggers, ...r.triggers]) : t = k(l.triggers, r.triggers), { triggers: t, held: t.length > 0 };
+      });
+    }, []),
+    loose: u
+  }), a;
+};
+export {
+  w as a,
+  U as b,
+  R as u
+};

package/dist/hooks-D_-XdOAe.cjs

@@ -0,0 +1 @@
+"use strict";const h=require("./css-HnNQMUzV.cjs"),d=require("react"),b=require("./Editable-BXFY3-UW.cjs"),i=require("./Text-DECnk5vG.cjs"),x=require("./deep-DtdcJG4q.cjs"),q=({triggers:n,callback:u,region:c,loose:r,double:t,regionMustBeElement:l})=>{const{listen:e}=i.useContext();let a;n!=null&&n?.length>0&&typeof n[0]=="string"?a=[n]:a=n;const g=i.useMemoCompare(()=>a,([s],[f])=>s==null&&f==null?!0:s==null||f==null?!1:x.q.primitiveArrays(s.flat(),f.flat())===x.q.EQUAL,[a]);d.useEffect(()=>{if(!(g==null||g.length===0))return e(s=>{const f=i.filter(g,s.prev,{loose:r,double:t}),R=i.filter(g,s.next,{loose:r,double:t}),m=i.diff(R,f);let o=m[0];const p=m[1];if(o.length===0&&p.length===0)return;o=k(s.target,s.cursor,o,c,l);const v={target:s.target,cursor:s.cursor};o.length>0&&u?.({...v,stage:"start",triggers:o,prevTriggers:s.prev}),p.length>0&&u?.({...v,stage:"end",triggers:p,prevTriggers:s.prev})})},[u,g,e,r,c,t,l])},k=(n,u,c,r,t)=>{if(r==null)return c;if(r.current==null)return[];const l=h.jt.construct(r.current);return c.filter(e=>t??e.some(g=>g.includes("Mouse"))?h.jt.contains(l,u)&&n===r.current:h.jt.contains(l,u))},H=({triggers:n,loose:u})=>{const[c,r]=b.useStateRef({triggers:[],held:!1});return q({triggers:n,callback:d.useCallback(t=>{r(l=>{let e;return t.stage==="start"?e=h.c.unique([...l.triggers,...t.triggers]):e=i.purge(l.triggers,t.triggers),{triggers:e,held:e.length>0}})},[]),loose:u}),c},T=({triggers:n,loose:u})=>{const[c,r]=d.useState({triggers:[],held:!1});return q({triggers:n,callback:d.useCallback(t=>{r(l=>{let e;return t.stage==="start"?e=h.c.unique([...l.triggers,...t.triggers]):e=i.purge(l.triggers,t.triggers),{triggers:e,held:e.length>0}})},[]),loose:u}),c};exports.use=q;exports.useHeld=T;exports.useHeldRef=H;